Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The sharp Mertens quadratic criterion for RH and unconditional divergence at the critical endpoint

Proved
MasulloRH.mertens_energy_criterion_and_critical_divergence

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

explicit-formulaprime-countingriemann-hypothesis

Let M(k) be the ordinary summatory Möbius function. RH is equivalent to convergence of Σ M(k)²/k^(1+2θ) for every θ>1/2, and equivalently to Σ_{k≤N} M(k)²=O_d((N+1)^(2+d)) for every d>0. For any 0≤θ<1, convergence at θ puts every nontrivial zero STRICTLY to its left. In particular Σ M(k)²/k² diverges unconditionally, by the proved zero with ordinate between 14.13 and 14.14. The endpoint divergence holds even under RH.

Preamble
import Definitions.Def_MasulloRH_RegularizedTrace
import Mathlib
set_option autoImplicit false
Formal statement
open Filter Finset Set Topology MeasureTheory ArithmeticFunction Asymptotics
namespace MasulloRH

theorem mertens_energy_criterion_and_critical_divergence :
    let M (n : ℕ) : ℝ := ∑ i ∈ Finset.Icc 1 n,(moebius i:ℝ)
    let a (θ : ℝ) (n : ℕ) := (M (n+1))^2*((n:ℝ)+1)^(-(1+2*θ))
    (RiemannHypothesis ↔ ∀ θ : ℝ,1/2<θ → Summable (a θ)) ∧
    (RiemannHypothesis ↔ ∀ d : ℝ,0<d → ∃ C : ℝ,0≤C ∧ ∀ N : ℕ,
      (∑ n ∈ range N,(M (n+1))^2) ≤ C*((N:ℝ)+1)^(2+d)) ∧
    (∀ θ : ℝ,0≤θ → θ<1 → Summable (a θ) →
      ∀ z : ZetaZerosInTraceStrip (1/2), z.val.re<θ) ∧
    ¬Summable (a (1/2)) := by sorry

end MasulloRH
Source
Positive quadratic estimate for the actual frontier moebius_summatory_rpow_bound_below_record (7abb4d24). The Laplace transform of M(floor(exp u)) is 1/(s ζ(s)). The exact-endpoint obstruction uses Cauchy–Schwarz together with differentiability at a hypothetical boundary zero. For the unconditional divergence we use the library theorem XiQuantitativePublished.zeta_zero_between_1413_1414.

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