Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Character sum bounds are equivalent to bounds in every reduced residue class

Proved
GRH.character_sum_bound_iff_reduced_residue_class_bounds

by Yi · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theoryasymptoticsdirichlet-characters

Fix a positive modulus qqq, a complex sequence w(k)w(k)w(k), and a real comparison function g(N)g(N)g(N). The partial sums of w(k)χ(k)w(k)\chi(k)w(k)χ(k) are O(g(N))O(g(N))O(g(N)) for every Dirichlet character modulo qqq if and only if the partial sums of www in each reduced residue class modulo qqq are O(g(N))O(g(N))O(g(N)). Each bound is for fixed modulus and may have a class- or character-dependent constant. Taking w=μw=\muw=μ gives a residue-class formulation of the finite twisted Möbius frontier.

Preamble
import Mathlib.NumberTheory.DirichletCharacter.Orthogonality
import Mathlib.Analysis.Asymptotics.Defs
import Mathlib.RingTheory.RootsOfUnity.AlgebraicallyClosed
import Mathlib.Analysis.Complex.Basic
import Mathlib.Analysis.Complex.Polynomial.Basic

open Filter Asymptotics
Formal statement
theorem GRH.character_sum_bound_iff_reduced_residue_class_bounds (q : ℕ) [NeZero q] (w : ℕ → ℂ) (g : ℕ → ℝ) :
    (∀ χ : DirichletCharacter ℂ q,
      (fun N : ℕ ↦ ∑ k ∈ Finset.range (N + 1), χ k * w k) =O[atTop] g) ↔
    (∀ a : ZMod q, IsUnit a →
      (fun N : ℕ ↦ ∑ k ∈ Finset.range (N + 1), if a = (k : ZMod q) then w k else 0) =O[atTop] g) := by sorry
Source
Finite character orthogonality and Fourier inversion using Mathlib.NumberTheory.DirichletCharacter.Orthogonality.

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