Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A complete monomial exponential sum as a sum of Gauss sums

Proved
Weil.sum_addChar_monomial

by tabbott · Sep 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

exponential-sumsfinite-fieldsgauss-sumsnumber-theoryweil-bound

Let FFF be a finite field, ψ\psiψ a non-trivial additive character of FFF valued in C\mathbb{C}C, a∈Fa \in Fa∈F with a≠0a \ne 0a=0, d≠0d \ne 0d=0, and let χ\chiχ be a multiplicative character of FFF of order exactly m=gcd⁡(#F×,d)m = \gcd(\#F^\times, d)m=gcd(#F×,d). Then

∑x∈Fψ(axd)=∑j=1m−1g(χj,ψa),\sum_{x \in F} \psi(a x^d) = \sum_{j=1}^{m-1} g(\chi^j, \psi_a),x∈F∑​ψ(axd)=j=1∑m−1​g(χj,ψa​),

where ψa(x)=ψ(ax)\psi_a(x)=\psi(ax)ψa​(x)=ψ(ax) and g(⋅,⋅)g(\cdot,\cdot)g(⋅,⋅) denotes the Gauss sum. Expanding the number of ddd-th roots of yyy as ∑j<mχj(y)\sum_{j<m}\chi^j(y)∑j<m​χj(y) turns the monomial sum into mmm Gauss sums; the j=0j=0j=0 term equals −1-1−1 and cancels the contribution of x=0x=0x=0, leaving m−1m-1m−1 terms. This is the exact evaluation from which the Weil bound for monomials follows.

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 sum_addChar_monomial : ∀ {F : Type u_1} [inst : Field F] [inst_1 : Fintype F] [inst_2 : DecidableEq F] {d : ℕ} {χ : MulChar F ℂ} (ψ : AddChar F ℂ), ψ ≠ 1 → ∀ {a : F}, a ≠ 0 → d ≠ 0 → orderOf χ = Nat.gcd (Fintype.card Fˣ) d → ∑ x : F, (ψ : F → ℂ) (a * x ^ d) = ∑ j ∈ Finset.Ico 1 (Nat.gcd (Fintype.card Fˣ) d), gaussSum (χ ^ j) (AddChar.mulShift ψ a) := by sorry
end Weil
Source
Ireland & Rosen, A Classical Introduction to Modern Number Theory, 2nd ed., Springer GTM 84, Ch. 8 (Gauss and Jacobi Sums)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me