The diagonal equation as plus a double Jacobi sum
ProvedWeil.card_diagonal_complexexponential-sumsfinite-fieldsgauss-sumsnumber-theoryweil-bound
Let be a finite field, , and let and be multiplicative characters of valued in of orders exactly and . Then
The terms and are the corrections at and , where the character expansion of the fibre count fails because a multiplicative character vanishes at .
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_diagonal_complex : ∀ {F : Type u_1} [inst : Field F] [inst_1 : Fintype F] [inst_2 : DecidableEq F] {d e : ℕ} {χ lam : MulChar F ℂ}, d ≠ 0 → e ≠ 0 → orderOf χ = Nat.gcd (Fintype.card Fˣ) d → orderOf lam = Nat.gcd (Fintype.card Fˣ) e → (↑(Finset.card {z : F × F | Prod.fst z ^ d + Prod.snd z ^ e = 1}) : ℂ) = (↑(Nat.gcd (Fintype.card Fˣ) d) : ℂ) + (↑(Nat.gcd (Fintype.card Fˣ) e) : ℂ) + ∑ i ∈ Finset.range (Nat.gcd (Fintype.card Fˣ) d), ∑ j ∈ Finset.range (Nat.gcd (Fintype.card Fˣ) e), jacobiSum (χ ^ i) (lam ^ j) := 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