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 J s , k ( X ) {\displaystyle J_{s,k}(X)} count the number of solutions to the system of k {\displaystyle k} simultaneous Diophantine equations in 2 s {\displaystyle 2s} variables given by
x 1 j + x 2 j + ⋯ + x s j = y 1 j + y 2 j + ⋯ + y s j ( 1 ≤ j ≤ k ) {\displaystyle x_{1}^{j}+x_{2}^{j}+\cdots +x_{s}^{j}=y_{1}^{j}+y_{2}^{j}+\cdots +y_{s}^{j}\quad (1\leq j\leq k)}
with
1 ≤ x i , y i ≤ X , ( 1 ≤ i ≤ s ) {\displaystyle 1\leq x_{i},y_{i}\leq X,(1\leq i\leq s)} . That is, it counts the number of equal sums of powers with equal numbers of terms ( s {\displaystyle s} ) and equal exponents ( j {\displaystyle j} ), up to k {\displaystyle k} th powers and up to powers of X {\displaystyle X} . An alternative analytic expression for J s , k ( X ) {\displaystyle J_{s,k}(X)} is
J s , k ( X ) = ∫ [ 0 , 1 ) k | f k ( α ; X ) | 2 s d α {\displaystyle J_{s,k}(X)=\int _{[0,1)^{k}}|f_{k}(\mathbf {\alpha } ;X)|^{2s}d\mathbf {\alpha } }
where
f k ( α ; X ) = ∑ 1 ≤ x ≤ X exp ( 2 π i ( α 1 x + ⋯ + α k x k ) ) . {\displaystyle f_{k}(\mathbf {\alpha } ;X)=\sum _{1\leq x\leq X}\exp(2\pi i(\alpha _{1}x+\cdots +\alpha _{k}x^{k})).}
Vinogradov's mean-value theorem gives an upper bound on the value of J s , k ( X ) {\displaystyle J_{s,k}(X)} . A strong estimate for J s , k ( X ) {\displaystyle J_{s,k}(X)} 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. Various bounds have been produced for J s , k ( X ) {\displaystyle J_{s,k}(X)} , valid for different relative ranges of s {\displaystyle s} and k {\displaystyle k} . The classical form of the theorem applies when s {\displaystyle s} is very large in terms of k {\displaystyle k} . An analysis of the proofs of the Vinogradov mean-value conjecture can be found in the Bourbaki Séminaire talk by Lillian Pierce.
Lower bounds By considering the X s {\displaystyle X^{s}} solutions where
x i = y i , ( 1 ≤ i ≤ s ) {\displaystyle x_{i}=y_{i},(1\leq i\leq s)}
one can see that J s , k ( X ) ≫ X s {\displaystyle J_{s,k}(X)\gg X^{s}} . A more careful analysis (see Vaughan equation 7.4) provides the lower bound
… excerpt ends here. Continue reading the full article.
