An approximate prime certificate forces completeness of its zero list through an explicit height
ProvedMasulloRH.approximate_prime_certificate_verifies_a_zero_heightriemann-hypothesisriemann-masullo
Let B = 4(ε + ((2/3)log N+4/9)/N^(3/2)). A critical-line witness at cutoff N+1 with slack ε must contain every strip zero through height H whenever B(1+H²)<1. Hence all such zeros are on the critical line.
Preamble
import Definitions.Def_MasulloRH_RegularizedTrace import Mathlib open MasulloRH ArithmeticFunction
Formal statement
namespace MasulloRH
theorem approximate_prime_certificate_verifies_a_zero_height (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)))) + ε) (H : ℝ)
(hsmall : 4*(ε + ((2/3)*Real.log N+4/9)*(N:ℝ)^(-(3/2):ℝ))*(1+H^2) < 1) :
∀ z : ZetaZerosInTraceStrip (1/2), |z.val.im| ≤ H → z ∈ F ∧ z.val.re = 1/2 := by sorry
end MasulloRHSource