The diagonal equation as a convolution of fibre counts
ProvedWeil.card_diagonal_eq_sumexponential-sumsfinite-fieldsgauss-sumsnumber-theoryweil-bound
Let be a finite field and . Writing , the number of solutions of is the convolution
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_sum : ∀ {F : Type u_1} [inst : Field F] [inst_1 : Fintype F] [inst_2 : DecidableEq F] (d e : ℕ), Finset.card {z : F × F | Prod.fst z ^ d + Prod.snd z ^ e = 1} = ∑ u : F, Finset.card {x : F | x ^ d = u} * Finset.card {y : F | y ^ e = 1 - 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