The rational theta cutoff and finite prime frontiers have the same admissible tolerances
ProvedMasulloRH.theta_cutoff_tolerance_iff_finite_prime_certificatesriemann-hypothesisriemann-masullo
At each real threshold τ, the cofinal theta trace lower bounds for all tolerances ε>τ are equivalent to cofinal finite prime and critical-line certificates with additive error τ+1/(k+1).
Preamble
import Definitions.Def_MasulloRH_RationalThetaSpace import Definitions.Def_MasulloRH_RegularizedTrace import Definitions.Def_MasulloGRH_HilbertNuclear open MasulloRH MasulloGRH Filter open scoped Topology open ArithmeticFunction
Formal statement
namespace MasulloRH
theorem theta_cutoff_tolerance_iff_finite_prime_certificates (τ : ℝ) :
let f := fun j : ℕ => vonMangoldt j/(j:ℝ)^(5/2:ℝ) - vonMangoldt j/(j:ℝ)^(3:ℝ)
let C := Real.log 2/2 + Real.pi/4 - 37/30
let Z := {z : ZetaZerosInTraceStrip (1/2) // z.val.re = 1/2}
let M := fun F : Finset Z => ∑ z ∈ F, (analyticOrderNatAt riemannZeta z.val.val:ℝ) *
((z.val.val.im^2-5)/(2*(z.val.val.im^2+25/4)*(z.val.val.im^2+4)))
(∀ ε : ℝ, τ < ε → ∀ N : ℕ, ∃ n ≥ N,
∀ T : rationalThetaAnnihilator ((n:ℝ)+1) →L[ℂ] rationalThetaAnnihilator ((n:ℝ)+1),
IsRationalThetaConvolution ((n:ℝ)+1) (regularizedTraceTest n 3) T →
(cutoffPolar n 3 - (cutoffArch n 3 + cutoffPrime n 3)).re ≤ (operatorTrace T).re + ε) ↔ ∀ k : ℕ, ∃ N ≥ k, ∃ F : Finset Z,
C + (∑ j ∈ Finset.range N,f j) ≤ M F + τ + 1/((k:ℝ)+1) := by sorry
end MasulloRHSource