Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An explicit finite zero height suffices to verify any prime cutoff in the critical-line mass criterion

Proved
MasulloRH.critical_line_mass_has_explicit_verification_height

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

analytic-number-theoryexplicit-formulariemann-hypothesis

Given N≥0N\ge0N≥0, put X=N+4X=N+4X=N+4, n=⌈16384X3/2(1+log⁡X)⌉n=\lceil 16384 X^{3/2}(1+\log X)\rceiln=⌈16384X3/2(1+logX)⌉ and HN=5/2+2nH_N=5/2+2nHN​=5/2+2n. If every zeta zero in the critical strip with ∣ℑρ∣≤HN|\Im\rho|\le H_N∣ℑρ∣≤HN​ is on the critical line, the finite set of all these zeros witnesses the critical-line mass comparison at cutoff NNN. Thus a failed comparison at NNN forces an off-line zero below this explicit height. The zero tail is paid entirely by the von Mangoldt mass on the finite interval (X,16X](X,16X](X,16X].

Preamble
import Definitions.Def_MasulloRH_RegularizedTrace
import Mathlib.NumberTheory.LSeries.Dirichlet

set_option autoImplicit false
Formal statement
open ArithmeticFunction Finset
namespace MasulloRH

theorem critical_line_mass_has_explicit_verification_height (N : ℕ) :
    let X := (N:ℝ)+4
    let n := ⌈16384*X^(3/2:ℝ)*(1+Real.log X)⌉₊
    let H := (5/2:ℝ)+2*(n:ℝ)
    (∀ z : ZetaZerosInTraceStrip (1/2), |z.val.im| ≤ H → z.val.re = 1/2) →
    ∃ F : Finset (ZetaZerosInTraceStrip (1/2)),
      (∀ z, z ∈ F ↔ |z.val.im| ≤ H) ∧ (∀ z ∈ F, z.val.re = 1/2) ∧
      Real.log 2/2 + Real.pi/4 - 37/30 +
        (∑ j ∈ Finset.range N, (vonMangoldt j/(j:ℝ)^(5/2:ℝ) - vonMangoldt j/(j:ℝ)^(3:ℝ))) ≤
        ∑ z ∈ F, (analyticOrderNatAt riemannZeta z.val:ℝ) *
          ((z.val.im^2-5)/(2*(z.val.im^2+25/4)*(z.val.im^2+4))) := by sorry

end MasulloRH
Source
Explicit finite localization of the open rational prime–critical-line-mass criterion bd574b97. Uses the proved full-strip regularized trace and its ordinate tail, together with the elementary Chebyshev bounds for ψ in Mathlib.

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