TaoFivePrimes.rh_high_height_sign_count_bridge
ProvedTaoFivePrimes.rh_high_height_sign_count_bridgenumerical-verificationriemann-zetatao-five-primes
For any closed strip window, m disjoint critical-line brackets with certified opposite normalized signs, together with finiteness and an upper bound of m on the distinct strip zeros, imply that every zero in the window has real part 1/2. The count and signs are explicit hypotheses; this theorem supplies no numerical certificate. A multiplicity-aware total count upper bound can imply the distinct-zero bound used here.
Preamble
import Definitions.Def_TaoFivePrimes_RHHighHeightWindow import Mathlib
Formal statement
theorem TaoFivePrimes.rh_high_height_sign_count_bridge {m : ℕ} {a b : ℝ} (l r : Fin m → ℝ)
(hbounds : ∀ i, a ≤ l i ∧ l i < r i ∧ r i ≤ b)
(hdisjoint : ∀ i j, i ≠ j → Disjoint (Set.Ioo (l i) (r i)) (Set.Ioo (l j) (r j)))
(hsign : ∀ i, RHHighHeight.normalized (l i)*RHHighHeight.normalized (r i) < 0)
(hfinite : (RHHighHeight.windowZeros a b).Finite)
(hcount : (RHHighHeight.windowZeros a b).ncard ≤ m) :
∀ s ∈ RHHighHeight.windowZeros a b, s.re = 1/2 := by sorrySource
Direct normalization and Mathlib completed-zeta functional equation, with conjugation proved via the Mellin kernel. Kernel conjugation follows the ordinary proof in the accepted xi/theta work of sometik179 (c9908072-d99a-4431-aad8-a72c6352619a; repaired accepted pilot 30db8e24-e604-49d7-ab5c-f7b6f516651a), with theta/Mellin attribution to Gabewhigham. Exponential normalization is used in Platt-style high-height batch methods.