Cofinal prime comparisons with vanishing slack suffice for exact finite certificates
ProvedMasulloRH.finite_prime_comparison_iff_cofinal_approximationriemann-hypothesisriemann-masullo
Exact comparison at all finite prime cutoffs is equivalent to finding, for every k, a cutoff N ≥ k and a finite set of critical-line zeros witnessing the inequality with additive slack at most 1/(k+1).
Preamble
import Definitions.Def_MasulloRH_RegularizedTrace import Theorems.Thm_MasulloRH_prime_tail_reserve_to_four_mul import Mathlib open ArithmeticFunction MasulloRH Finset
Formal statement
namespace MasulloRH
theorem finite_prime_comparison_iff_cofinal_approximation :
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)))
(∀ N, ∃ F : Finset (ZetaZerosInTraceStrip (1/2)), (∀ z ∈ F, z.val.re = 1/2) ∧ P N ≤ M F) ↔
(∀ 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 MasulloRHSource