Finite prime certificates with additive error bound the total omitted zero mass
ProvedMasulloRH.approximate_prime_certificate_bounds_missing_zero_massriemann-hypothesisriemann-masullo
For any cutoff N+1 with N ≥ 2, a prime certificate with slack ε bounds the entire omitted decay weight by 4ε + 4((2/3)log N+4/9)/N^(3/2). This gives a finite error estimate for the cofinal approximation frontier.
Preamble
import Definitions.Def_MasulloRH_RegularizedTrace import Mathlib open MasulloRH ArithmeticFunction
Formal statement
namespace MasulloRH
theorem approximate_prime_certificate_bounds_missing_zero_mass (N : ℕ) (hN : 2 ≤ N) (ε : ℝ)
(F : Finset (ZetaZerosInTraceStrip (1/2))) (hF : ∀ z ∈ F, z.val.re = 1/2)
(hc : Real.log 2/2 + Real.pi/4 - 37/30 +
(∑ j ∈ Finset.range (N+1), (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)))) + ε) :
(∑' z : ZetaZerosInTraceStrip (1/2), if z ∈ F then 0 else zeroDecayWeight (1/2) z) ≤
4*(ε + ((2/3)*Real.log N+4/9)*(N:ℝ)^(-(3/2):ℝ)) := by sorry
end MasulloRHSource