: square-root cancellation
ProvedCircleMethod.gauss_sum_modulusFor an odd prime and ,
Perfect square-root cancellation: a sum of unit vectors has modulus exactly , the size of a random walk rather than the trivial . This is the prototype of the general estimate for degree , and it is exactly the saving that makes the singular series converge and hence the Hardy--Littlewood main term finite.
The identity is also the analytic input to quadratic reciprocity, and the ancestor of the Weil bounds for exponential sums over finite fields.
Preamble
import Definitions.Def_CircleMethod_waring import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.NumberTheory.Divisors import Mathlib.Data.ZMod.Basic import Mathlib.Algebra.Field.ZMod import Mathlib.Algebra.BigOperators.Group.Finset.Basic open Finset
Formal statement
namespace CircleMethod
theorem gauss_sum_modulus {p : ℕ} (hp : p.Prime) (hodd : p ≠ 2) {a : ℤ} (hp_a : ¬ ((p : ℤ) ∣ a)) :
‖S 2 p a‖ = Real.sqrt (p : ℝ) := by sorry
end CircleMethodSource
C. F. Gauss, Summatio quarumdam serierum singularium, 1811; R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Section 2.6.