The Weil bound for , with equality
ProvedWeil.norm_sum_e_quadraticexponential-sumsfinite-fieldsgauss-sumsnumber-theoryweil-bound
Quadratic exponential sums mod . Let be an odd prime, with . Writing ,
The Weil bound is attained with equality in degree two: completing the square reduces the sum to a quadratic Gauss sum, whose modulus is exactly .
Preamble
import Mathlib.NumberTheory.GaussSum import Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.GaussSum import Mathlib.NumberTheory.MulChar.Lemmas import Mathlib.GroupTheory.SpecificGroups.Cyclic import Mathlib.GroupTheory.Index import Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar import Mathlib.Analysis.SpecialFunctions.Sqrt import Mathlib.Analysis.RCLike.Basic import Mathlib.Analysis.Complex.Basic import Mathlib.Algebra.Field.GeomSum import Mathlib.Algebra.Order.BigOperators.Group.Finset set_option autoImplicit false set_option linter.unusedSectionVars false set_option linter.unusedVariables false universe u_1 u_2 open AddChar MulChar Finset
Formal statement
namespace Weil
theorem norm_sum_e_quadratic : ∀ {p : ℕ} [inst : Fact (Nat.Prime p)], p ≠ 2 → ∀ {a : ZMod p}, a ≠ 0 → ∀ (b c : ZMod p), ‖∑ x : ZMod p, (ZMod.stdAddChar : ZMod p → ℂ) (a * x ^ 2 + b * x + c)‖ = √(↑p : ℝ) := by sorry
end WeilSource
Ireland & Rosen, A Classical Introduction to Modern Number Theory, 2nd ed., Springer GTM 84, Ch. 8 (Gauss and Jacobi Sums)