For an integer , direct integration gives zero unless , in which case it gives one. Products of this identity on the unit cube turn integrals of finite exponential sums into counts of integer solutions. This is the elementary orthogonality used in the Vinogradov mean value.
The Vinogradov mean value is
By orthogonality of integer Fourier modes, it counts the ordered integer solutions of for , with every coordinate between one and . The diagonal solutions give .
Put . The moment vector has at most possible values. If counts the tuples with vector , then and . The Cauchy-Schwarz inequality gives . Combining the two lower bounds, with one common positive constant for large , yields
Here is an explicit way that upper bounds enter the Vinogradov mean-value method for a bilinear exponential sum. Write and . Two applications of the Holder inequality, followed by grouping equal differences of moment vectors, give
At integer the minimum is defined as ; means distance to the nearest integer. To explain the mean-value factor, let count pairs of -tuples with prescribed moment difference. It is an autocorrelation of , so by Cauchy-Schwarz inequality. The first Holder inequality groups the tuples, and the second groups the tuples, providing the two factors . The remaining sums over moment differences are bounded by the displayed finite geometric series estimates. Good Vinogradov mean value upper bounds, together with rational approximation or spacing bounds for , therefore give cancellation in . The mean-value estimate alone does not force cancellation for arbitrary coefficients: when all are integers, . For the paper take and the specified .