Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A verified zero height and finitely many later prime powers certify one finite trace comparison

Proved
MasulloRH.critical_line_mass_of_verified_height_and_prime_tail

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​, a(j)=Λ(j)(j−5/2−j−3)a(j)=\Lambda(j)(j^{-5/2}-j^{-3})a(j)=Λ(j)(j−5/2−j−3), 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)). For an integer n≥0n\ge0n≥0 put H=5/2+2nH=5/2+2nH=5/2+2n. Let AAA denote the regularized reference mass, L=ζ′/ζL=\zeta'/\zetaL=ζ′/ζ, and Un=2(8A−ℜL(5/2)+(1+log⁡n)/2)/(H−1)U_n=2(8A-\Re L(5/2)+(1+\log n)/2)/(H-1)Un​=2(8A−ℜL(5/2)+(1+logn)/2)/(H−1), with log⁡0=0\log 0=0log0=0. Suppose all nontrivial zeta zeros through absolute height HHH have real part 1/21/21/2. Let N≥0N\ge0N≥0 be an integer and PPP a finite set of integers p≥Np\ge Np≥N for which ∑p∈Pa(p)≥Un\sum_{p\in P}a(p)\ge U_n∑p∈P​a(p)≥Un​. There is a finite set FFF of distinct critical-line zeros, counted with analytic multiplicity mρm_\rhomρ​, satisfying

C+∑1≤j<Na(j)≤∑ρ∈FmρK(ℑρ).C+\sum_{1\le j<N}a(j)\le\sum_{\rho\in F}m_\rho K(\Im\rho).C+1≤j<N∑​a(j)≤ρ∈F∑​mρ​K(ℑρ).

The result certifies a chosen cutoff from a bounded-height zero verification and finite prime-power arithmetic.

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

set_option autoImplicit false
Formal statement

namespace MasulloRH

theorem critical_line_mass_of_verified_height_and_prime_tail (n N : ℕ) (P : Finset ℕ)
    (hP : ∀ p ∈ P, N ≤ p)
    (hcover : ∀ z : ZetaZerosInTraceStrip (1/2), |z.val.im| ≤ 5/2+2*(n:ℝ) → z.val.re = 1/2)
    (hbudget : 2/((5/2+2*(n:ℝ))-1) * (8*((zetaLogDeriv 3).re -
      (zetaLogDeriv (5/2)+regularizedArch 3-regularizedPolar 3).re) -
      (zetaLogDeriv (5/2)).re + (1+Real.log n)/2) ≤
      ∑ p ∈ P, (ArithmeticFunction.vonMangoldt p / (p:ℝ)^(5/2:ℝ) -
        ArithmeticFunction.vonMangoldt p / (p:ℝ)^(3:ℝ))) :
    ∃ F : Finset (ZetaZerosInTraceStrip (1/2)),
      (∀ z ∈ F, z.val.re = 1/2) ∧
      Real.log 2 / 2 + Real.pi / 4 - 37 / 30 +
        (∑ j ∈ Finset.range N, (ArithmeticFunction.vonMangoldt j / (j:ℝ)^(5/2:ℝ) -
          ArithmeticFunction.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
Finite criterion in the Masullo regularized trace reconstruction bd574b97, using the unconditional lattice tail bound 7bc6a754 and the prime expansion c38c09eb. The multiplicity and resolvent comparisons follow Yi’s single-resolvent argument.

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