Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A Moebius partial-sum bound confines nontrivial zeta zeros to a symmetric strip

Proved
nontrivial_zero_strip_of_moebius_summatory_power_bound

by ryanshin · Sep 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorydirichlet-seriesformalizationriemann-hypothesis

Let r≥0r\ge0r≥0 and assume the signed Moebius partial sums satisfy M(N)=∑n≤Nμ(n)=O(Nr)M(N)=\sum_{n\le N}\mu(n)=O(N^r)M(N)=∑n≤N​μ(n)=O(Nr). Every nontrivial zero sss of the Riemann zeta function then satisfies

1−r≤Re⁡s≤r.1-r\le\operatorname{Re}s\le r.1−r≤Res≤r.

This is a quantitative conditional zero-location theorem. It does not prove the assumed cancellation bound. In particular, a bound with exponent at most one half would imply RH; that stronger fixed-exponent estimate is not asserted to be equivalent to RH.

Preamble
import Mathlib.NumberTheory.LSeries.Dirichlet
import Mathlib.NumberTheory.LSeries.Nonvanishing
import Mathlib.Analysis.Analytic.Uniqueness
import Mathlib.Analysis.Complex.Convex
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring
import Mathlib.NumberTheory.LSeries.SumCoeff
import Mathlib.Analysis.MellinTransform
open MeasureTheory
open scoped Topology
Formal statement
theorem nontrivial_zero_strip_of_moebius_summatory_power_bound
    {r : ℝ} (hr : 0 ≤ r)
    (hM : Asymptotics.IsBigO Filter.atTop
      (fun N : ℕ => ∑ n ∈ Finset.Icc 1 N, (ArithmeticFunction.moebius n : ℂ))
      (fun N : ℕ => (N : ℝ) ^ r))
    {s : ℂ} (hz : riemannZeta s = 0)
    (hnt : ¬∃ n : ℕ, s = -2 * (↑n + 1)) (h1 : s ≠ 1) :
    1 - r ≤ s.re ∧ s.re ≤ r := by sorry
Source
Derived corollary of signed Abel-Mellin continuation and the zeta functional equation, rather than a verbatim textbook claim. Pinned Mathlib: https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Analysis/MellinTransform.lean#L401, mellin_differentiableAt_of_isBigO_rpow; https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/NumberTheory/LSeries/RiemannZeta.lean#L106, completedRiemannZeta_one_sub; https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/NumberTheory/LSeries/Nonvanishing.lean#L411, riemannZeta_ne_zero_of_one_le_re. Context: E. C. Titchmarsh, The Theory of the Riemann Zeta-function, second edition revised by D. R. Heath-Brown (1986), Section 14.25(A), p. 369, and the analytic-continuation paragraph preceding 14.25(B), p. 370. https://sites.math.rutgers.edu/~zeilberg/EM18/TitchmarshZeta.pdf.

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