Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Open finite prime-power versus critical-line zero inequalities for the regularized trace

Open
MasulloRH.critical_line_mass_dominates_finite_prime_sums

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

analytic-number-theoryriemann-hypothesistrace-formula

Put C=12log⁡2+π4−3730C=\tfrac12\log2+\tfrac\pi4-\tfrac{37}{30}C=21​log2+4π​−3037​ and K(t)=(t2−5)/(2(t2+25/4)(t2+4))K(t)=(t^2-5)/(2(t^2+25/4)(t^2+4))K(t)=(t2−5)/(2(t2+25/4)(t2+4)). Write mρm_\rhomρ​ for the analytic multiplicity of a nontrivial zero of the Riemann zeta function and Λ\LambdaΛ for the von Mangoldt function. For every integer cutoff N≥0N\ge0N≥0, there exists a finite set FFF of distinct critical-line zeros such that

C+∑1≤n<NΛ(n)(n−5/2−n−3) ≤ ∑ρ∈FmρK(ℑρ).C+\sum_{1\le n<N}\Lambda(n)(n^{-5/2}-n^{-3})\ \le\ \sum_{\rho\in F}m_\rho K(\Im\rho).C+1≤n<N∑​Λ(n)(n−5/2−n−3) ≤ ρ∈F∑​mρ​K(ℑρ).

Both sums are finite. The zeros may occur on either side of the real axis. The assertion for every cutoff is an open condition in the Masullo RH specialization.

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

set_option autoImplicit false
Formal statement

namespace MasulloRH

theorem critical_line_mass_dominates_finite_prime_sums (N : ℕ) :
    ∃ F : Finset (ZetaZerosInTraceStrip (1/2)),
      (∀ z ∈ F, z.val.re = 1/2) ∧
      Real.log 2 / 2 + Real.pi / 4 - 37 / 30 +
        (∑ n ∈ Finset.range N, (ArithmeticFunction.vonMangoldt n / (n:ℝ)^(5/2:ℝ) -
          ArithmeticFunction.vonMangoldt n / (n:ℝ)^(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
Finite arithmetic criterion for the initial regularized trace identity in the Masullo RH specialization. The prime expansion at 3 and the uniform finite-resolvent-defect bound are independent proved ingredients.

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