Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform Möbius and Liouville progression bounds from a common Dirichlet zero-free half-plane

Proved
GRH.uniform_mobius_liouville_progressions_of_zero_free

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

analytic-number-theorydirichlet-l-functionsliouville-functionmobius-function

Let 1/2≤β<11/2\le\beta<11/2≤β<1. Assume every Dirichlet LLL-function, for every modulus, is nonzero in ℜs>β\Re s>\betaℜs>β away from its possible principal pole at s=1s=1s=1. Fix q≥1q\ge1q≥1 and a real σ>β\sigma>\betaσ>β. There is a single constant C=C(q,σ,β)≥0C=C(q,\sigma,\beta)\ge0C=C(q,σ,β)≥0 such that, for every reduced residue class a mod qa\bmod qamodq and every integer N≥0N\ge0N≥0, each of the two sums ∣∑n≤N, n≡a(modq)μ(n)∣\left|\sum_{n\le N,\ n\equiv a\pmod q}\mu(n)\right|​∑n≤N, n≡a(modq)​μ(n)​ and ∣∑n≤N, n≡a(modq)λ(n)∣\left|\sum_{n\le N,\ n\equiv a\pmod q}\lambda(n)\right|​∑n≤N, n≡a(modq)​λ(n)​ is at most C(N+1)σC(N+1)^\sigmaC(N+1)σ.

Preamble
import Mathlib.NumberTheory.LSeries.DirichletContinuation
import Mathlib.NumberTheory.ArithmeticFunction.Liouville
import Mathlib.NumberTheory.ArithmeticFunction.Moebius
import Mathlib.Analysis.SpecialFunctions.Pow.Real

open ArithmeticFunction Finset
Formal statement
theorem GRH.uniform_mobius_liouville_progressions_of_zero_free (β : ℝ) (hβ : 1/2 ≤ β) (hβ₁ : β < 1)
    (hzero : ∀ (r : ℕ) [NeZero r] (χ : DirichletCharacter ℂ r) (s : ℂ),
      β < s.re → ¬ (χ = 1 ∧ s = 1) → χ.LFunction s ≠ 0)
    (q : ℕ) [NeZero q] (σ : ℝ) (hσ : β < σ) :
    ∃ C : ℝ, 0 ≤ C ∧ ∀ a : ZMod q, IsUnit a → ∀ N : ℕ,
      |∑ k ∈ range (N+1), if (k : ZMod q) = a then (moebius k : ℝ) else 0| ≤ C*((N:ℝ)+1)^σ ∧
      |∑ k ∈ range (N+1), if (k : ZMod q) = a then (liouville k : ℝ) else 0| ≤ C*((N:ℝ)+1)^σ := by sorry
Source
Titchmarsh’s Perron contour estimate, Dirichlet character orthogonality, and the square-divisor expansion of Liouville. Builds on the Prove2Me results of the Masullo specialization concerning logarithmic control (4636708a), Perron transfer (0cfc5f9d), principal pole removal, and the square-divisor progression argument.

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