Vinogradov's Three-Primes Theorem
Every sufficiently large odd integer is the sum of three primes. Moreover, the number of representations satisfies: where for odd .
Proof Outline
Step 1: Circle method setup. Write where .
Step 2: Major arcs. For near with and : by the Siegel-Walfisz theorem, where and . The major arc integral evaluates to where .
Step 3: Minor arcs (Vinogradov's key estimate). The critical innovation is the bound: for on the minor arcs ( or large), for any .
This uses Vaughan's identity to decompose into Type I and Type II sums:
- Type I: (inner sum is geometric, bounded via estimates)
- Type II: (bilinear, bounded via Cauchy-Schwarz and the large sieve)
With , both types are on the minor arcs.
Step 4: Combining. The minor arc contribution is , using Parseval: .
For , this is , proving for large .
Helfgott (2013) made all constants explicit, proving Vinogradov's theorem for . The remaining cases were handled computationally, completing the proof that every odd integer is a sum of three primes (the ternary Goldbach conjecture).
factors as a product over primes. For : the local factor is . For : the factor is but positive. The product converges and for explicit constants . For (not divisible by 3): .