Open independent signed zero-count certificates in each unit-height band
OpenMasulloRH.unit_height_signed_critical_band_certificatesFor each integer n≥0, put L=100000+n. In the single band (L,L+1], find a finite set E of exact critical-line zeros and a finite collection B of disjoint open intervals with rational endpoints. Each interval lies between L and L+1, the real completed zeta function has strictly opposite endpoint signs, and no exact ordinate in E lies inside an interval. Require the extended cardinality of all distinct nontrivial zeros in this positive band to satisfy
The one unused count slot is allowed separately in every unit band. The proved functional-equation pairing criterion excludes off-line zeros separately in each such band; the slots therefore do not accumulate as a global error. This independent finite-computation interface allows bands to be checked in parallel, with no common endpoint choices or compatibility of lists. The infinite family remains OPEN and RH-strength. No simplicity assumption is imposed because E can record zeros without a sign change.
import Definitions.Def_MasulloRH_RegularizedTrace import Mathlib.Data.Set.Card open MasulloRH set_option autoImplicit false
theorem MasulloRH.unit_height_signed_critical_band_certificates (n : ℕ) :
∃ (E : Finset (ZetaZerosInTraceStrip (1/2))) (B : Finset (ℚ×ℚ)),
(∀ z ∈ E, (100000:ℝ)+n < z.val.im ∧ z.val.im ≤ (100000:ℝ)+n+1 ∧ z.val.re=1/2) ∧
(∀ i ∈ B, (100000:ℝ)+n ≤ (i.1:ℝ) ∧ i.1 < i.2 ∧ (i.2:ℝ) ≤ (100000:ℝ)+n+1 ∧
(completedRiemannZeta (1/2+(i.1:ℂ)*Complex.I)).re *
(completedRiemannZeta (1/2+(i.2:ℂ)*Complex.I)).re < 0) ∧
(∀ i ∈ B, ∀ j ∈ B, i ≠ j → Disjoint (Set.Ioo (i.1:ℝ) (i.2:ℝ)) (Set.Ioo (j.1:ℝ) (j.2:ℝ))) ∧
(∀ z ∈ E, ∀ i ∈ B, z.val.im ∉ Set.Ioo (i.1:ℝ) (i.2:ℝ)) ∧
Set.encard {z : ZetaZerosInTraceStrip (1/2) |
(100000:ℝ)+n<z.val.im ∧ z.val.im ≤ (100000:ℝ)+n+1} ≤
((E.card+B.card+1:ℕ):ℕ∞) := by sorry