Uniform bound on a Jacobi sum of nontrivial characters
ProvedWeil.norm_jacobiSum_leexponential-sumsfinite-fieldsgauss-sumsnumber-theoryweil-bound
Let be a finite field and let and be nontrivial multiplicative characters of valued in . Then
with no hypothesis on . When is nontrivial the modulus is exactly ; when the Jacobi sum is , of modulus one, which is still at most .
Preamble
import Mathlib.NumberTheory.GaussSum import Mathlib.NumberTheory.JacobiSum.Basic 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_jacobiSum_le : ∀ {F : Type u_1} [inst : Field F] [inst_1 : Fintype F] [DecidableEq F] {χ φ : MulChar F ℂ}, χ ≠ 1 → φ ≠ 1 → ‖jacobiSum χ φ‖ ≤ √(↑(Fintype.card F) : ℝ) := by sorry
end WeilSource
Ireland & Rosen, A Classical Introduction to Modern Number Theory, 2nd ed., Springer GTM 84, Ch. 8 (Gauss and Jacobi Sums), Sections 8.3 and 8.5