With and analogous notation for , Vaughan identity isThus, when ,The first term is short, the next two are Type I sums, and the last becomes a Type II bilinear sum after grouping variables and applying a dyadic decomposition.
Write , where . Split the -interval into consecutive blocks of length at most . If distinct integers lie in one block, then . Since ,whereas . Hence .
The points in one block are therefore -separated modulo one. Order them by distance from the nearest integer. Apart from a bounded number of endpoints, the th closest point has distance , and consequentlyMultiplying by givesThis is the reciprocal fractional-part sum near a rational estimate.
LetApplying the Cauchy-Schwarz inequality in givesTake absolute values and apply Cauchy-Schwarz to . Since , expanding the remaining square givesTaking fourth roots proves the claimed bilinear quadratic exponential sum fourth-moment bound.
In the fourth moment from part c, putThen the phase is . The contribution with is , because ; the contribution with is . Their fourth roots are respectively and .
Off the diagonals, fix . The variable ranges over an interval of length , subject only to harmless parity and range restrictions. The exponential geometric sum bound givesPut . We have , and the number of representations of a fixed by the three factors, including signs and range restrictions, is . Hence the fourth moment isUsing in part c provesThis is the factorized fourth moment for a bilinear quadratic exponential sum.
Write and split the last sum in part d according as or . For the first part, the reciprocal fractional-part sum near a rational givesFor the second part, use the supplied second-moment estimate and truncation of a divisor weight by its second moment:Substitute , take fourth roots, and factor out . The four terms from the bounded-weight estimate become, after harmless enlargement by ,with the smaller term absorbed by . The large-weight part contributes . Finally, the two diagonal terms from part d contribute and ; since , the first is absorbed by . Therefore
Assume . To beat the trivial bound by , it is enough to make every term in the parentheses of part e smaller than a sufficiently larger negative power of , allowing for the prefactor .
Choose the splitting parameter with large in terms of . It then suffices, for a still larger constant , thatIndeed, these four conditions control respectively the last, third, second, and fourth terms, while the choice of controls the first. Equivalently, away from polylogarithmic neighborhoods of the endpoints, the estimate gives a logarithmic saving wheneverare all sufficiently large powers of , with also larger than the chosen divisor cutoff by such a power. This is the Type II range used after Vaughan identity.
Articles by others on the same topic
There are currently no matching articles.