TheoremComplete

Vinogradov's Three-Primes Theorem

Theorem8.1Vinogradov's Theorem

Every sufficiently large odd integer NN is the sum of three primes. Moreover, the number of representations satisfies: R3(N)=p1+p2+p3=Npi prime112S(N)N2(logN)3R_3(N) = \sum_{\substack{p_1+p_2+p_3=N \\ p_i \text{ prime}}} 1 \sim \frac{1}{2}\mathfrak{S}(N)\frac{N^2}{(\log N)^3} where S(N)=pN(11(p1)2)pN(1+1(p1)3)>0\mathfrak{S}(N) = \prod_{p | N}\left(1 - \frac{1}{(p-1)^2}\right) \prod_{p \nmid N}\left(1 + \frac{1}{(p-1)^3}\right) > 0 for odd NN.


Proof Outline

Proof

Step 1: Circle method setup. Write R3(N)=01S(α)3e2πiNαdαR_3(N) = \int_0^1 S(\alpha)^3 e^{-2\pi iN\alpha}\,d\alpha where S(α)=pN(logp)e2πipαS(\alpha) = \sum_{p \leq N} (\log p) e^{2\pi ip\alpha}.

Step 2: Major arcs. For α\alpha near a/qa/q with q(logN)Bq \leq (\log N)^B and αa/q(logN)B/N|\alpha - a/q| \leq (\log N)^B/N: by the Siegel-Walfisz theorem, S(α)μ(q)ϕ(q)v(β)S(\alpha) \approx \frac{\mu(q)}{\phi(q)} v(\beta) where β=αa/q\beta = \alpha - a/q and v(β)=nNe2πinβv(\beta) = \sum_{n \leq N} e^{2\pi in\beta}. The major arc integral evaluates to S(N)J(N)\mathfrak{S}(N)\mathfrak{J}(N) where J(N)=Rv(β)3e2πiNβdβ=N22+O(N)\mathfrak{J}(N) = \int_\mathbb{R} v(\beta)^3 e^{-2\pi iN\beta}\,d\beta = \frac{N^2}{2} + O(N).

Step 3: Minor arcs (Vinogradov's key estimate). The critical innovation is the bound: for α\alpha on the minor arcs (q>(logN)Bq > (\log N)^B or αa/q|\alpha - a/q| large), S(α)N(logN)A|S(\alpha)| \ll \frac{N}{(\log N)^A} for any A>0A > 0.

This uses Vaughan's identity to decompose S(α)=S1+S2S3S(\alpha) = S_1 + S_2 - S_3 into Type I and Type II sums:

  • Type I: mUamne2πimnα\sum_{m \leq U} a_m \sum_{n} e^{2\pi imn\alpha} (inner sum is geometric, bounded via αm\|\alpha m\| estimates)
  • Type II: mMamnN/Mbne2πimnα\sum_{m \sim M} a_m \sum_{n \sim N/M} b_n e^{2\pi imn\alpha} (bilinear, bounded via Cauchy-Schwarz and the large sieve)

With U=N2/3U = N^{2/3}, both types are O(N/(logN)A)O(N/(\log N)^A) on the minor arcs.

Step 4: Combining. The minor arc contribution is mS3e2πiNαdαsupmS(α)01S(α)2dαN(logN)AN=N2(logN)A|\int_\mathfrak{m} S^3 e^{-2\pi iN\alpha}d\alpha| \leq \sup_\mathfrak{m}|S(\alpha)| \int_0^1 |S(\alpha)|^2 d\alpha \ll \frac{N}{(\log N)^A} \cdot N = \frac{N^2}{(\log N)^A}, using Parseval: S2dα=(logp)2N\int|S|^2 d\alpha = \sum (\log p)^2 \sim N.

For A>3A > 3, this is o(S(N)N2/(logN)3)o(\mathfrak{S}(N)N^2/(\log N)^3), proving R3(N)>0R_3(N) > 0 for large NN. \square


RemarkHelfgott's Effective Version

Helfgott (2013) made all constants explicit, proving Vinogradov's theorem for N>1027N > 10^{27}. The remaining cases were handled computationally, completing the proof that every odd integer >5> 5 is a sum of three primes (the ternary Goldbach conjecture).

ExampleEvaluating the Singular Series

S(N)\mathfrak{S}(N) factors as a product over primes. For pNp \nmid N: the local factor is 1+1/(p1)3=1+O(p3)1 + 1/(p-1)^3 = 1 + O(p^{-3}). For pNp | N: the factor is 11/(p1)2<11 - 1/(p-1)^2 < 1 but positive. The product converges and S(N)[c1,c2]\mathfrak{S}(N) \in [c_1, c_2] for explicit constants 0<c1<c20 < c_1 < c_2. For N=2k+1N = 2k + 1 (not divisible by 3): S(N)2.858\mathfrak{S}(N) \approx 2.858.