The diagonal equation: exact count
ProvedWeil.card_diagonal_eq_card_addexponential-sumsfinite-fieldsgauss-sumsnumber-theoryweil-bound
Exact point count for a diagonal equation. Let be a finite field, , and let and be multiplicative characters of valued in of orders exactly and . Then
The main term is , the count one expects from a curve of this shape, and the deviation is a sum of Jacobi sums. In particular the count is exactly when or .
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_eq_card_add : ∀ {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}) : ℂ) = (↑(Fintype.card F) : ℂ) + ∑ i ∈ Finset.Ico 1 (Nat.gcd (Fintype.card Fˣ) d), ∑ j ∈ Finset.Ico 1 (Nat.gcd (Fintype.card Fˣ) e), jacobiSum (χ ^ i) (lam ^ j) := by sorry
end WeilSource
A. Weil, Numbers of solutions of equations in finite fields, Bull. Amer. Math. Soc. 55 (1949), 497-508 (diagonal equations are the worked example of the Weil conjectures)