A positive compensated shifted-resolvent kernel with uniform local counting bound
ProvedMasulloRH.compensated_shifted_resolvent_local_count_boundanalyticexplicit-boundfinite-certificateresolvent
For every real height , define the literal compensated resolvent kernel
For every satisfying and , the kernel dominates the positive Poisson kernel
If , then .
Consequently, for every finite family satisfying those strip and height conditions, every family of nonnegative real weights , and every subset of indices lying in the radius-one window (of total height two),
This includes the empty family, arbitrary real heights, and arbitrary nonnegative real multiplicity weights; it assumes neither conjugate pairing nor the Riemann Hypothesis. It is a finite algebraic counting ingredient. An application to actual zeta zeros additionally requires a justified infinite spectral identity and a rigorous arithmetic bound for the remaining kernel mass.
Preamble
import Mathlib open scoped BigOperators
Formal statement
theorem MasulloRH.compensated_shifted_resolvent_local_count_bound (T : ℝ) :
let K : ℂ → ℝ := fun z =>
(((13/8 : ℂ) + (T : ℂ) * Complex.I - z)⁻¹ - ((5/2 : ℂ) - z)⁻¹).re +
8 * (((3 : ℂ) - z)⁻¹ - ((5/2 : ℂ) - z)⁻¹).re
(∀ z : ℂ, 0 ≤ z.re → z.re ≤ 1 → 36 ≤ z.im^2 →
(13/8-z.re) / ((13/8-z.re)^2+(T-z.im)^2) ≤ K z ∧
0 < K z ∧ (|z.im-T| ≤ 1 → (104/233 : ℝ) ≤ K z)) ∧
(∀ (n : ℕ) (z : Fin n → ℂ) (m : Fin n → ℝ) (S : Finset (Fin n)),
(∀ i, 0 ≤ m i) → (∀ i, 0 ≤ (z i).re) → (∀ i, (z i).re ≤ 1) →
(∀ i, 36 ≤ (z i).im^2) → (∀ i ∈ S, |(z i).im-T| ≤ 1) →
(∑ i ∈ S, m i) ≤ (233/104 : ℝ) * ∑ i, m i * K (z i)) := by sorrySource
New scalar-trace certificate construction for the Masullo RH mission. Pure real/complex algebra and finite sums over Mathlib. The explicit height-six strip hypotheses are motivated by the independently proved low-height zero-free rectangle. This theorem does not use that rectangle or any RH/Alpöge theorem as a formal dependency, and it does not close MasulloRH.regularized_trace_scalar_lower_bound.