Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cofinal critical-line prime-mass certificates with vanishing additive deficit

Open
MasulloRH.cofinal_approximate_prime_mass_certificates

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

riemann-hypothesisriemann-masullo

For every precision index k, find a finite cutoff N ≥ k and a finite set of critical-line zeros whose mass is within 1/(k+1) of the finite prime target from below. This simultaneous growth and accuracy requirement is open.

Preamble
import Definitions.Def_MasulloRH_RegularizedTrace
import Mathlib
open ArithmeticFunction MasulloRH Finset
Formal statement
namespace MasulloRH
theorem cofinal_approximate_prime_mass_certificates :
    let P := fun N : ℕ => Real.log 2/2 + Real.pi/4 - 37/30 +
      ∑ j ∈ Finset.range N, (vonMangoldt j/(j:ℝ)^(5/2:ℝ)-vonMangoldt j/(j:ℝ)^(3:ℝ))
    let M := fun F : Finset (ZetaZerosInTraceStrip (1/2)) =>
      ∑ z ∈ F, (analyticOrderNatAt riemannZeta z.val:ℝ) *
        ((z.val.im^2-5)/(2*(z.val.im^2+25/4)*(z.val.im^2+4)))
    ∀ k : ℕ, ∃ N ≥ k, ∃ F : Finset (ZetaZerosInTraceStrip (1/2)), (∀ z ∈ F, z.val.re = 1/2) ∧ P N ≤ M F + 1/((k:ℝ)+1) := by sorry
end MasulloRH
Source
https://prove2.me/theorems/bd574b97-ccdf-4e3d-aff9-98ed941abbf8

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