An unconditional trace error bound from finite prime powers and a finite list of zeros
ProvedMasulloRH.regularized_trace_error_le_finite_prime_zero_boundanalytic-number-theoryriemann-hypothesistrace-formula
Let be the regularized trace, , and any finite set of nontrivial zeros in the window . For put
Write , with the analytic multiplicity. For and ,
The bound requires finitely many prime powers and zeros. Its explicit remainder holds for every integer .
Preamble
import Definitions.Def_MasulloRH_RegularizedTrace import Mathlib.NumberTheory.LSeries.Dirichlet set_option autoImplicit false
Formal statement
namespace MasulloRH
theorem regularized_trace_error_le_finite_prime_zero_bound (N : ℕ) (hN : 2 ≤ N)
(α 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)) *
(Real.log 2/2 + Real.pi/4 - 37/30 +
(∑ n ∈ Finset.range (N+1), (ArithmeticFunction.vonMangoldt n / (n:ℝ)^(5/2:ℝ) -
ArithmeticFunction.vonMangoldt n / (n:ℝ)^(3:ℝ))) +
((2/3)*Real.log N+4/9)*(N:ℝ)^(-(3/2):ℝ) -
∑ z ∈ F,(zeroResolventTerm (1/2) 3 z).re) := by sorry
end MasulloRHSource
Finite computational form of the proved regularized trace error bound and prime-power mass expansion in the Masullo RH specialization. Classical von Mangoldt estimate and integral comparison.