for prime moduli, elementary form
ProvedCMSharp.S_prime_bound_elementaryLet be a prime, , and an integer with . Then the complete exponential sum over the prime modulus exhibits square-root cancellation:
An elementary route to square-root cancellation. The sharp form of this estimate is with , which follows from evaluating as a sum of Gauss sums, each of modulus exactly . The constant stated here is weaker, but it is reachable without any multiplicative character theory, by a second-moment argument:
Writing , additive orthogonality gives the exact identity
because has at most solutions for each fixed . Subtracting the term leaves . Separately, the substitution shows for every , so summing over the nonzero reproduces while covering each nonzero residue at most times. Comparing the two counts yields , hence the stated bound.
Role. This is the one point in the proof of the classical estimate (Vaughan, Theorem 4.2) at which the trivial bound is insufficient: at it overshoots by a factor . Every higher prime power reduces to this case through the recursion . Since for , square-root cancellation with any constant depending only on is enough to drive the whole argument.
import Definitions.Def_CircleMethod_waring import Mathlib.Data.Nat.Prime.Basic import Mathlib.Data.Real.Sqrt
namespace CMSharp
theorem S_prime_bound_elementary {k p : ℕ} (hk : 1 ≤ k) (hp : p.Prime) {a : ℤ}
(ha : ¬ ((p : ℤ) ∣ a)) :
‖CircleMethod.S k p a‖ ≤ (k : ℝ) * Real.sqrt (p : ℝ) := by sorry
end CMSharp