Vinogradov’s estimate for exponential sums over primes
1 Introduction
For , let be the greatest integer , let , and let
In this note I work through Chapters 24 and 25 of Harold Davenport, Multiplicative Number Theory, third ed.11 1 Many of the manipulations of sums in these chapters are hard to follow, and I greatly expand on the calculations in Davenport. The organization of the proof in Davenport seems to be due to Vaughan. I have also used lecture notes by Andreas Strömbergsson, http://www2.math.uu.se/~astrombe/analtalt08/www_notes.pdf, pp. 245–257. Another set of notes, which I have not used, are http://jonismathnotes.blogspot.ca/2014/11/prime-exponential-sums-and-vaughans.html
We end up proving that there is some constant such that if and , with positive and , then for any ,
2 The von Mangoldt function
Let be the von Mangoldt function: if for some prime and , and otherwise. For example, , , and . This satisfies
and so by the Möbius inversion formula,
For it is a fact that22 2 G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, fifth ed., p. 235, Theorem 263.
Write . It is a fact that .33 3 G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, fifth ed., p. 341, Theorem 414. (The prime number theorem states .)
The derivative of the Riemann zeta function is
The Euler product for the Riemann zeta function is
Then
so, for ,
Let , , and write
For ,
First,44 4 Harold Davenport, Multiplicative Number Theory, third ed., p. 138, Chapter 24.
for
Second,
for
Third,
for
Fourth,
and
whence
thus
for
We have
3 Sums involving the von Mangoldt function
Let be an arithmetical function with and write
for which
Lemma 1.
.
Proof.
As ,
∎
Lemma 2.
Proof.
For , , so
∎
Lemma 3.
Proof.
Then
∎
Lemma 4.
for
Proof.
For , using the Cauchy-Schwarz inequality,
and
so, using ,
Therefore,
for
Because for , if then . Thus
so
Define for and for , and . Using the above we get
On the one hand,
On the other hand, let be the multiplicative arithmetic function such that for prime and for nonnegative integer , . The divisor function satisfies , and
Hence, as is multiplicative and nonnegative,
But, for ,
so
Merten’s theorem55 5 G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, fifth ed., p. 351, Theorem 429. tells us
where is Euler’s constant, and using this,
We have therefore got for ,
What we now have is
proving the claim. ∎
Putting together the estimates for gives, for , and , ,
for
4 Exponential sums
For , on the one hand
On the other hand,
and hence
Thus
Let and let . Then
and
Let . By what we have worked out,
for
We calculate
so
We now have
But for , a fortiori , whence
Summarizing, we have the following.
Theorem 5.
For and ,
5 Diophantine approximation
Theorem 6.
There is some such that for all , if , , and , then
Proof.
Write . Then
If and , then, using and ,
and, as ,
Otherwise, or , and then , and the sum over these indices is
So we have got
Let , let be a closed arc in of measure , and let . For , if then , and as , then . As is a closed arc with measure and are distinct in , due to , there are at most four , , for which . Therefore there are at most four , , for which .
For , let . If , then
i.e.
Therefore, for with ,
We have just established that for each there are at most four such that , and hence
Putting things together,
∎
Theorem 7.
There is some such that if , , , , then for any ,