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 \epsilon>0 we have :J_{s,k}(X)\ll X^{s+\epsilon}+X^{2s-\frac12k(k+1)+\epsilon}. This was proved by
Jean Bourgain, Ciprian Demeter, and
Larry Guth and by a different method by
Trevor Wooley. If :s\ge \frac12k(k+1) this is equivalent to the bound :J_{s,k}(X)\ll X^{2s-\frac12k(k+1)+\epsilon}. Similarly if s\le \frac12k(k+1) the conjectural form is equivalent to the bound :J_{s,k}(X)\ll X^{s+\epsilon}. Stronger forms of the theorem lead to an asymptotic expression for J_{s,k}, in particular for large s relative to k the expression :J_{s,k}\sim \mathcal C(s,k)X^{2s-\frac12k(k+1)}, where \mathcal C(s,k) is a fixed positive number depending on at most s and k, holds, see Theorem 1.2 in. == History ==