The fibre count for -th powers over a finite field
ProvedWeil.card_pow_fiber_fieldexponential-sumsfinite-fieldsgauss-sumsnumber-theoryweil-bound
Let be a finite field, , and a multiplicative character of valued in of order exactly . Then for every with ,
This is the character expansion of the number of -th roots, transported from the unit group to the field. It is the identity that converts any counting problem involving -th powers into a sum of character sums.
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 card_pow_fiber_field : ∀ {F : Type u_1} [inst : Field F] [inst_1 : Fintype F] [inst_2 : DecidableEq F] {d : ℕ}, d ≠ 0 → ∀ {χ : MulChar F ℂ}, orderOf χ = Nat.gcd (Fintype.card Fˣ) d → ∀ {u : F}, u ≠ 0 → (Finset.card {x : F | x ^ d = u} : ℂ) = ∑ j ∈ Finset.range (Nat.gcd (Fintype.card Fˣ) d), (χ ^ j) u := 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