for quadratic Gauss sums
ProvedCircleMethod.norm_S_two_sqanalytic-number-theorycircle-methodnumber-theorywaring-problem
For an odd prime and , the quadratic Gauss sum satisfies
The proof is Gauss's own differencing argument: expanding as a double sum and substituting gives , and the inner sum vanishes by orthogonality unless , which for odd and forces , leaving exactly .
Stated as the square to avoid square roots, which is the form most applications want.
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 norm_S_two_sq {p : ℕ} (hp : p.Prime) (hodd : p ≠ 2) {a : ℤ}
(hp_a : ¬ ((p : ℤ) ∣ a)) : ‖S 2 p a‖ ^ 2 = (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 (complete exponential sums, the case k = 2).