Pólya-Vinogradov inequality


Theorem 1.

For m,n∈N and p a positive odd rational prime,

|∑t=mm+n(tp)|<p⁢ln⁡p.
Proof.

Start with the following manipulations:

∑t=mm+n(tp)=1p⁢∑t=0p-1∑x=mm+n∑a=0p-1(tp)⁢e2⁢π⁢i⁢a⁢(x-t)/p=1p⁢∑a=1p-1∑x=mm+ne2⁢π⁢i⁢a⁢x/p⁢∑t=0p-1(tp)⁢e-2⁢π⁢i⁢a⁢t/p

The expression ∑t=0p-1(tp)⁢e-2⁢π⁢i⁢a⁢t/p is just a Gauss sumDlmfPlanetmath, and has magnitude p. Hence

|∑t=mm+n(tp)| ≤ |pp⁢∑a=1p-1∑x=mm+ne2⁢π⁢a⁢i⁢x/p|=|pp⁢∑a=1p-1e2⁢π⁢i⁢a⁢m/p⁢∑x=0ne2⁢π⁢i⁢a⁢x/p|≤|pp⁢∑a=1p-1e2⁢π⁢i⁢a⁢n/p-1e2⁢π⁢i⁢a/p-1|
= |pp⁢∑a=1p-1eπ⁢i⁢a⁢n/p⁢sin⁡(π⁢a⁢n/p)eπ⁢i⁢a/p⁢sin⁡(π⁢a/p)|≤pp⁢∑a=1p-1|1sin⁡(π⁢⟨a/p⟩)|≤pp⁢∑a=1p-112⁢⟨a/p⟩

Here ⟨x⟩ denotes the absolute valueMathworldPlanetmathPlanetmathPlanetmath of the difference between x and the closest integer to x, i.e. ⟨x⟩=infz∈𝐙⁡{|x-z|}.

Since p is odd, we have

12⁢∑a=1p-11⟨a/p⟩=∑0<a<p2pa=p⁢∑a=1p-121a

Now ln⁡2⁢x+12⁢x-1>1x for x>1; to prove this, it suffices to show that the functionMathworldPlanetmath f:[1,∞)→𝐑 given by f⁢(x)=x⁢ln⁡2⁢x+12⁢x-1 is decreasing and approaches 1 as x→∞. To prove the latter statement, substitute v=1/x and take the limit as v→0 using L’Hôpital’s rule. To prove the former statement, it will suffice to show that f′ is less than zero on the interval [1,∞). But f′⁢(x)→0 as x→∞ and f′ is increasing on [1,∞), since f′′⁢(x)=-44⁢x2-1⁢(1-4⁢x2+14⁢x2-1)>0 for x>1, so f′ is less than zero for x>1.

With this in hand, we have

|∑t=mm+n(tp)|≤pp⋅p⁢∑a=1p-121a<p⁢∑a=1p-12ln⁡2⁢a+12⁢a-1=p⁢ln⁡p.

∎

References

Title Pólya-Vinogradov inequality
Canonical name PolyaVinogradovInequality
Date of creation 2013-03-22 12:46:23
Last modified on 2013-03-22 12:46:23
Owner djao (24)
Last modified by djao (24)
Numerical id 7
Author djao (24)
Entry type Theorem
Classification msc 11L40