Vinogradov's theorem

In number theory, Vinogradov's theorem is a result which implies that any sufficiently large odd integer can be written as a sum of three prime numbers. It is a weaker form of Goldbach's weak conjecture, which would imply the existence of such a representation for all odd integers greater than five. It is named after Ivan Matveyevich Vinogradov who proved it in the 1930s. Hardy and Littlewood had shown earlier that this result followed from the generalized Riemann hypothesis, and Vinogradov was able to remove this assumption. The full statement of Vinogradov's theorem gives asymptotic bounds on the number of representations of an odd integer as a sum of three primes. The notion of "sufficiently large" was ill-defined in Vinogradov's original work, but in 2002 it was shown that 10¹³⁴⁶ is sufficiently large. Additionally numbers up to 10²⁰ had been checked via brute force methods, thus only a finite number of cases to check remained before the odd Goldbach conjecture would be proven or disproven. In 2013, Harald Helfgott proved Goldbach's weak conjecture for all cases.

Statement of Vinogradov's theorem

Let ''A'' be a positive real number. Then
:$r(N)=G(N)N^2+O\left(N^2\log^N\right),$
where
:$r(N)=\sum_\Lambda(k_1)\Lambda(k_2)\Lambda(k_3),$
using the von Mangoldt function $\Lambda$, and
:$G(N)=\left(\prod_\left(1-\right)\right)\left(\prod_\left(1+\right)\right).$

A consequence

If ''N'' is odd, then ''G''(''N'') is roughly 1, hence $N^2 \ll r(N)$ for all sufficiently large ''N''. By showing that the contribution made to ''r''(''N'') by proper prime powers is $O\left(N^\log^2N\right)$, one sees that
:$N^2\log^N\ll\left(\hbox\right).$
This means in particular that any sufficiently large odd integer can be written as a sum of three primes, thus showing Goldbach's weak conjecture for all but finitely many cases.

Strategy of proof

The proof of the theorem follows the Hardy–Littlewood circle method. Define the exponential sum
:$S(\alpha)=\sum_^N\Lambda(n)e(\alpha n)$.
Then we have
:$S(\alpha)^3 = \sum_\Lambda(n_1)\Lambda(n_2)\Lambda(n_3)e(\alpha(n_1+n_2+n_3)) = \sum_ \tilde(n)e(\alpha n)$,
where $\tilde$ denotes the number of representations restricted to prime powers $\leq N$. Hence
:$r(N) = \int_0^1 S(\alpha)^3 e(-\alpha N)\;d\alpha$.
If $\alpha$ is a rational number $\frac$, then $S(\alpha)$ can be given by the distribution of prime numbers in residue classes modulo $q$. Hence, using the Siegel–Walfisz theorem we can compute the contribution of the above integral in small neighbourhoods of rational points with small denominator. The set of real numbers close to such rational points is usually referred to as the major arcs, the complement forms the minor arcs. It turns out that these intervals dominate the integral, hence to prove the theorem one has to give an upper bound for $S(\alpha)$ for $\alpha$ contained in the minor arcs. This estimate is the most difficult part of the proof.

If we assume the Generalized Riemann Hypothesis, the argument used for the major arcs can be extended to the minor arcs. This was done by Hardy and Littlewood in 1923. In 1937 Vinogradov gave an unconditional upper bound for $, S(\alpha),$. His argument began with a simple sieve identity, the resulting terms were then rearranged in a complicated way to obtain some cancellation. In 1977 R. C. Vaughan found a much simpler argument, based on what later became known as Vaughan's identity. He proved that if $, \alpha-\frac, <\frac$, then
:$, S(\alpha), \ll \left(\frac + N^+\sqrt\right)\log^4 N$.
Using the Siegel–Walfisz theorem we can deal with $q$ up to arbitrary powers of $\log N$, using Dirichlet's approximation theorem we obtain $, S(\alpha), \ll\frac$ on the minor arcs. Hence the integral over the minor arcs can be bounded above by
:$\frac\int_0^1, S(\alpha), ^2\;d\alpha \ll \frac$,
which gives the error term in the theorem.

References

*
* Chapter 8.

External links

*{{MathWorld, urlname=VinogradovsTheorem, title=Vinogradov's Theorem

Theorems about prime numbers