Geometric sum of the powers of a multiplicative character
ProvedWeil.sum_pow_char_applyexponential-sumsfinite-fieldsgauss-sumsnumber-theoryweil-bound
Let be a finite field, a multiplicative character of valued in with , and with . Then
Since is an -th root of unity, this is the geometric series with . It is the orthogonality relation that converts a fibre count into a sum of characters.
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 sum_pow_char_apply : ∀ {F : Type u_1} [inst : Field F] (χ : MulChar F ℂ) {n : ℕ}, χ ^ n = 1 → ∀ {u : F}, u ≠ 0 → ∑ j ∈ Finset.range n, (χ ^ j) u = if χ u = 1 then (n : ℂ) else 0 := by sorry
end WeilSource
Ireland & Rosen, A Classical Introduction to Modern Number Theory, 2nd ed., Springer GTM 84, Ch. 8 (Gauss and Jacobi Sums)