The fibre-count identity for -th powers via a multiplicative character
ProvedWeil.card_pow_fiber_unitsexponential-sumsfinite-fieldsgauss-sumsnumber-theoryweil-bound
Let be a finite field, , and a multiplicative character of valued in whose order is exactly . Then for every unit of ,
Equivalently, the image of the -th power map on is exactly the kernel of , and every non-empty fibre has elements. One inclusion is immediate (-th powers lie in ); equality follows because both counting functions are non-negative, one dominates the other pointwise, and both sum to . This identity is what turns a monomial exponential sum into a sum of Gauss sums.
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 card_pow_fiber_units : ∀ {F : Type u_1} [inst : Field F] [inst_1 : Fintype F] [inst_2 : DecidableEq F] {d : ℕ} {χ : MulChar F ℂ}, orderOf χ = Nat.gcd (Fintype.card Fˣ) d → ∀ (y : Fˣ), Finset.card {x : Fˣ | x ^ d = y} = if (χ : F → ℂ) (↑y : F) = 1 then Nat.gcd (Fintype.card Fˣ) d else 0 := by sorry
end WeilSource
Iwaniec & Kowalski, Analytic Number Theory, AMS Colloquium Publications 53, 2004, Ch. 11 (Sums over finite fields), §11.1-11.3