Vinogradov's mean-value theorem

Last updated

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.

Contents

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

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

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

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

Related Research Articles

In mathematics, the classic Möbius inversion formula is a relation between pairs of arithmetic functions, each defined from the other by sums over divisors. It was introduced into number theory in 1832 by August Ferdinand Möbius.

In mathematics, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs. The theorem was proved independently by Jacques Hadamard and Charles Jean de la Vallée Poussin in 1896 using ideas introduced by Bernhard Riemann.

<span class="mw-page-title-main">Uniform convergence</span> Mode of convergence of a function sequence

In the mathematical field of analysis, uniform convergence is a mode of convergence of functions stronger than pointwise convergence, in the sense that the convergence is uniform over the domain. A sequence of functions converges uniformly to a limiting function on a set as the function domain if, given any arbitrarily small positive number , a number can be found such that each of the functions differs from by no more than at every pointin. Described in an informal way, if converges to uniformly, then how quickly the functions approach is "uniform" throughout in the following sense: in order to guarantee that differs from by less than a chosen distance , we only need to make sure that is larger than or equal to a certain , which we can find without knowing the value of in advance. In other words, there exists a number that could depend on but is independent of , such that choosing will ensure that for all . In contrast, pointwise convergence of to merely guarantees that for any given in advance, we can find such that, for that particular, falls within of whenever .

The Liouville lambda function, denoted by λ(n) and named after Joseph Liouville, is an important arithmetic function. Its value is +1 if n is the product of an even number of prime numbers, and −1 if it is the product of an odd number of primes.

<span class="mw-page-title-main">Law of large numbers</span> Averages of repeated trials converge to the expected value

In probability theory, the law of large numbers (LLN) is a mathematical theorem that states that the average of the results obtained from a large number of independent and identical random samples converges to the true value, if it exists. More formally, the LLN states that given a sample of independent and identically distributed values, the sample mean converges to the true mean.

<span class="mw-page-title-main">Prime-counting function</span> Function representing the number of primes less than or equal to a given number

In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number x. It is denoted by π(x) (unrelated to the number π).

<span class="mw-page-title-main">Mertens function</span> Summatory function of the Möbius function

In number theory, the Mertens function is defined for all positive integers n as

In probability theory, a Chernoff bound is an exponentially decreasing upper bound on the tail of a random variable based on its moment generating function. The minimum of all such exponential bounds forms the Chernoff or Chernoff-Cramér bound, which may decay faster than exponential. It is especially useful for sums of independent random variables, such as sums of Bernoulli random variables.

In mathematics, subadditivity is a property of a function that states, roughly, that evaluating the function for the sum of two elements of the domain always returns something less than or equal to the sum of the function's values at each element. There are numerous examples of subadditive functions in various areas of mathematics, particularly norms and square roots. Additive maps are special cases of subadditive functions.

In mathematics, concentration of measure is a principle that is applied in measure theory, probability and combinatorics, and has consequences for other fields such as Banach space theory. Informally, it states that "A random variable that depends in a Lipschitz way on many independent variables is essentially constant".

In information theory, information dimension is an information measure for random vectors in Euclidean space, based on the normalized entropy of finely quantized versions of the random vectors. This concept was first introduced by Alfréd Rényi in 1959.

Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine space, i.e., a spectrahedron.

In mathematics, Fejér's theorem, named after Hungarian mathematician Lipót Fejér, states the following:

<span class="mw-page-title-main">Divisor summatory function</span>

In number theory, the divisor summatory function is a function that is a sum over the divisor function. It frequently occurs in the study of the asymptotic behaviour of the Riemann zeta function. The various studies of the behaviour of the divisor function are sometimes called divisor problems.

In the mathematical discipline of graph theory, the expander walk sampling theorem intuitively states that sampling vertices in an expander graph by doing relatively short random walk can simulate sampling the vertices independently from a uniform distribution. The earliest version of this theorem is due to Ajtai, Komlós & Szemerédi (1987), and the more general version is typically attributed to Gillman (1998).

<span class="mw-page-title-main">Riemann hypothesis</span> Conjecture on zeros of the zeta function

In mathematics, the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is of great interest in number theory because it implies results about the distribution of prime numbers. It was proposed by Bernhard Riemann (1859), after whom it is named.

<span class="mw-page-title-main">Anatoly Karatsuba</span> Russian mathematician (1937–2008)

Anatoly Alexeyevich Karatsuba was a Russian mathematician working in the field of analytic number theory, p-adic numbers and Dirichlet series.

An approach to nonlinear congruential methods of generating uniform pseudorandom numbers in the interval [0,1) is the Inversive congruential generator with prime modulus. A generalization for arbitrary composite moduli with arbitrary distinct primes will be present here.

In computational learning theory, Occam learning is a model of algorithmic learning where the objective of the learner is to output a succinct representation of received training data. This is closely related to probably approximately correct (PAC) learning, where the learner is evaluated on its predictive power of a test set.

Roth's theorem on arithmetic progressions is a result in additive combinatorics concerning the existence of arithmetic progressions in subsets of the natural numbers. It was first proven by Klaus Roth in 1953. Roth's theorem is a special case of Szemerédi's theorem for the case .

References

  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.