Jump to content

Vinogradov's mean-value theorem

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Turtlens (talk | contribs) at 18:21, 25 January 2024 (Proof of the Main conjecture). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In mathematics, Vinogradov's mean value theorem is an estimate for the number of equal sums of powers. It is an important inequality in analytic number theory, named for I. M. Vinogradov.

More specifically, let count the number of solutions to the system of simultaneous Diophantine equations in variables given by

with

.

That is, it counts the number of equal sums of powers with equal numbers of terms () and equal exponents (), up to th powers and up to powers of . An alternative analytic expression for is

where

Vinogradov's mean-value theorem gives an upper bound on the value of .

A strong estimate for is an important part of the Hardy-Littlewood method for attacking Waring's problem and also for demonstrating a zero free region for the Riemann zeta-function in the critical strip.[1] Various bounds have been produced for , valid for different relative ranges of and . The classical form of the theorem applies when is very large in terms of .

An analysis of the proofs of the Vinogradov mean-value conjecture can be found in the Bourbaki Séminaire talk by Lillian Pierce.[2]

Lower bounds

[edit]

By considering the solutions where

one can see that .

A more careful analysis (see Vaughan [3] equation 7.4) provides the lower bound

Proof of the Main conjecture

[edit]

The main conjecture of Vinogradov's mean value theorem was that the upper bound is close to this lower bound. More specifically that for any we have

This was proved by Jean Bourgain, Ciprian Demeter, and Larry Guth[4] and by a different method by Trevor Wooley.[5]

If

this is equivalent to the bound

Similarly if the conjectural form is equivalent to the bound

Stronger forms of the theorem lead to an asymptotic expression for , in particular for large relative to the expression

where is a fixed positive number depending on at most and , holds, see Theorem 1.2 in.[6]

History

[edit]

Vinogradov's original theorem of 1935 [7] showed that for fixed with

there exists a positive constant such that

Although this was a ground-breaking result, it falls short of the full conjectured form. Instead it demonstrates the conjectured form when

.

Vinogradov's approach was improved upon by Karatsuba[8] and Stechkin[9] who showed that for there exists a positive constant such that

where

Noting that for

we have

,

this proves that the conjectural form holds for of this size.

The method can be sharpened further to prove the asymptotic estimate

for large in terms of .

In 2012 Wooley[10] improved the range of for which the conjectural form holds. He proved that for

and

and for any we have

Ford and Wooley[11] have shown that the conjectural form is established for small in terms of . Specifically they show that for

and

for any

we have

References

[edit]
  1. ^ Titchmarsh, Edward Charles (1986). The theory of the Riemann Zeta-function. Edited and with a preface by D. R. Heath-Brown (Second ed.). New York: The Clarendon Press, Oxford University Press. ISBN 978-0-19-853369-6. MR 0882550.
  2. ^ Pierce, Lilian B. (2017). "The Vinogradov mean-value theorem [after Wooley, and Bourgain, Demeter and Guth]". Séminaire Bourbaki. 69 (1134): 1–80. arXiv:1707.00119.
  3. ^ Vaughan, Robert C. (1997). The Hardy-Littlewood method. Cambridge Tracts in Mathematics. Vol. 25 (Second ed.). Cambridge: Cambridge University Press. ISBN 978-0-521-57347-4. MR 1435742.
  4. ^ Bourgain, Jean; Demeter, Ciprian; Guth, Larry (2016). "Proof of the main conjecture in Vinogradov's Mean Value Theorem for degrees higher than three". Ann. of Math. 184 (2): 633–682. arXiv:1512.01565. doi:10.4007/annals.2016.184.2.7. hdl:1721.1/115568. S2CID 43929329.
  5. ^ Wooley, Trevor D. (2019). "Nested efficient congruencing and relatives of Vinogradov's mean value theorem". Proceedings of the London Mathematical Society. 118 (4): 942–1016. arXiv:1708.01220. doi:10.1112/plms.12204.
  6. ^ Wooley, Trevor (2012). "Vinogradov's mean value theorem via efficient congruencing". Annals of Mathematics. 175 (3): 1575–1627. arXiv:1101.0574. doi:10.4007/annals.2012.175.3.12.
  7. ^ I. M. Vinogradov, New estimates for Weyl sums, Dokl. Akad. Nauk SSSR 8 (1935), 195–198
  8. ^ Karatsuba, Anatoly (1973). "Mean value of the modulus of a trigonometric sum". Izv. Akad. Nauk SSSR Ser. Mat. (in Russian). 37 (6): 1203–1227. Bibcode:1973IzMat...7.1199K. doi:10.1070/IM1973v007n06ABEH002080. MR 0337817.
  9. ^ Stečkin, Sergeĭ Borisovich (1975). "Mean values of the modulus of a trigonometric sum". Trudy Mat. Inst. Steklov (in Russian). 134: 283–309. MR 0396431.
  10. ^ Wooley, Trevor D. (2012). "Vinogradov's mean value theorem via efficient congruencing". Ann. of Math. 175 (3): 1575–1627. arXiv:1101.0574. doi:10.4007/annals.2012.175.3.12. MR 2912712. S2CID 13286053.
  11. ^ Ford, Kevin; Wooley, Trevor D. (2014). "On Vinogradov's mean value theorem: strong diagonal behaviour via efficient congruencing". Acta Math. 213 (2): 199–236. arXiv:1304.6917. doi:10.1007/s11511-014-0119-0. MR 3286035. S2CID 11603320.