Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Weil bound for monomials, sharp gcd form (given a character of the right order)

Proved
Weil.norm_sum_addChar_monomial_le_gcd

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)∥≤(m−1)#F.\Big\lVert\sum_{x \in F} \psi(a x^d)\Big\rVert \le (m - 1)\sqrt{\#F}.​x∈F∑​ψ(axd)​≤(m−1)#F​.

The sum is a sum of m−1m-1m−1 Gauss sums, each of modulus exactly #F\sqrt{\#F}#F​.

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 norm_sum_addChar_monomial_le_gcd : ∀ {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)‖ ≤ ((↑(Nat.gcd (Fintype.card Fˣ) d) : ℝ) - 1) * √(↑(Fintype.card F) : ℝ) := by sorry
end Weil
Source
A. Weil, On some exponential sums, Proc. Nat. Acad. Sci. USA 34 (1948), 204-207

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