A finite list of in-window zeros bounds the full regularized trace error on a bounded initial half-plane
ProvedMasulloRH.regularized_trace_error_le_finite_resolvent_defectanalytic-number-theoryriemann-hypothesistrace-formula
For and , let be the regularized trace in the centered open window . Write , where is the multiplicity. Let be any finite set of nontrivial zeros inside this window. Define the real reference mass
Then
Any finite verified list supplies a bound for all these test points. No completeness of the list is required.
Preamble
import Definitions.Def_MasulloRH_RegularizedTrace set_option autoImplicit false
Formal statement
namespace MasulloRH
theorem regularized_trace_error_le_finite_resolvent_defect (α R : ℝ) (s : ℂ)
(hR : ‖s‖ ≤ R) (hs : (3/2:ℝ) < s.re)
(F : Finset (ZetaZerosInTraceStrip (1/2)))
(hF : ∀ z ∈ F, |z.val.re-1/2| < α) :
‖zetaLogDeriv s - regularizedTraceRHS α s‖ ≤ (16*(2*(2*R+3)*(R+5/2))) *
((zetaLogDeriv 3).re - (zetaLogDeriv (5/2) + regularizedArch 3 - regularizedPolar 3).re -
∑ z ∈ F,(zeroResolventTerm (1/2) 3 z).re) := by sorry
end MasulloRHSource
Quantitative refinement of MasulloRH.single_resolvent_test (proof by Yi) for the 20 November 2026 Masullo trace specialization. Uses the independently proved zero-free rectangle up to ordinate six and the campaign’s full-strip regularized trace formula.