Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite prime certificates bound off-line zero counts with multiplicity

Proved
MasulloRH.cofinal_prime_slack_bounds_off_line_zero_count

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

prime-certificatesriemann-hypothesis

If the cofinal finite prime certificates hold with slack τ, then any finite set of zeros off the critical line through height H has total multiplicity at most 2.00000001 τ(1+H²).

Preamble
import Definitions.Def_MasulloRH_RegularizedTrace
import Mathlib
open MasulloRH ArithmeticFunction Set Filter Topology
Formal statement
namespace MasulloRH
theorem cofinal_prime_slack_bounds_off_line_zero_count (τ : ℝ) :
    let f := fun j : ℕ => vonMangoldt j/(j:ℝ)^(5/2:ℝ) - vonMangoldt j/(j:ℝ)^(3:ℝ)
    let C := Real.log 2/2 + Real.pi/4 - 37/30
    let Z := {z : ZetaZerosInTraceStrip (1/2) // z.val.re = 1/2}
    let M := fun F : Finset Z => ∑ z ∈ F, (analyticOrderNatAt riemannZeta z.val.val:ℝ) *
      ((z.val.val.im^2-5)/(2*(z.val.val.im^2+25/4)*(z.val.val.im^2+4)))
    (∀ k : ℕ, ∃ N ≥ k, ∃ F : Finset Z,
      C + (∑ j ∈ Finset.range N,f j) ≤ M F + τ + 1/((k:ℝ)+1)) →
    ∀ (H : ℝ) (S : Finset {z : ZetaZerosInTraceStrip (1/2) // z.val.re ≠ 1/2}),
      (∀ z ∈ S, |z.val.val.im| ≤ H) →
      (∑ z ∈ S,(analyticOrderNatAt riemannZeta z.val.val : ℝ)) ≤
        (200000001/100000000 : ℝ)*τ*(1+H^2) := by sorry
end MasulloRH
Source
Original consequence of the certified height and the reference resolvent remainder.

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