Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

∣τ(χ)∣2=N|\tau(\chi)|^2=N∣τ(χ)∣2=N for primitive Dirichlet characters

Proved
QRHLittlewood.normSq_gaussSum_of_isPrimitive

by @bwdaugherty · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorynumber-theory

Let χ\chiχ be a primitive Dirichlet character modulo N≥1N\ge1N≥1 and let

τ(χ)=∑a∈Z/NZχ(a) e2πia/N\tau(\chi)=\sum_{a\in\mathbb Z/N\mathbb Z}\chi(a)\,e^{2\pi i a/N}τ(χ)=a∈Z/NZ∑​χ(a)e2πia/N

be its Gauss sum with respect to the standard additive character. Then

∣τ(χ)∣2=N.|\tau(\chi)|^2=N.∣τ(χ)∣2=N.

This holds for every modulus, prime or composite. It gives ∣τ(χ)∣=N|\tau(\chi)|=\sqrt N∣τ(χ)∣=N​ and hence the unit modulus of the root number in the functional equation of L(s,χ)L(s,\chi)L(s,χ).

Formalization Note The Gauss sum is Mathlib's gaussSum χ ZMod.stdAddChar and primitivity is DirichletCharacter.IsPrimitive.

Preamble
import Mathlib.NumberTheory.LSeries.DirichletContinuation
import Mathlib.NumberTheory.DirichletCharacter.GaussSum
import Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar

open Complex
Formal statement
namespace QRHLittlewood

theorem normSq_gaussSum_of_isPrimitive {N : ℕ} [NeZero N] {χ : DirichletCharacter ℂ N}
    (hχ : χ.IsPrimitive) : Complex.normSq (gaussSum χ ZMod.stdAddChar) = N := by sorry

end QRHLittlewood
Source
H. Davenport, Multiplicative Number Theory, 3rd ed., Springer GTM 74, Chapter 9 (Gauss sums for primitive characters).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me