TaoFivePrimes.rh_high_height_window_count_le
ProvedTaoFivePrimes.rh_high_height_window_count_lenumerical-verificationriemann-zetatao-five-primes
The distinct zeta zero set in the closed strip window 0<Re(s)<1, 3289999872≤Im(s)≤3290000000 contains at most 409 elements. This includes both endpoints and requires a complete zero-count certificate; critical-line signs alone do not prove it. A multiplicity-aware Turing count, with suitable endpoint guards, is one intended route.
Preamble
import Definitions.Def_TaoFivePrimes_RHHighHeightWindow
Formal statement
theorem TaoFivePrimes.rh_high_height_window_count_le : (RHHighHeight.windowZeros 3289999872 3290000000).ncard ≤ 409 := by sorry
Source
High-height 128-unit certificate prototype for the existing TaoFivePrimes finite-RH work. Platt FFT/interpolation proposals and native total counts motivate these exact goals; neither is a Lean proof. The normalized-function, bracket-completeness, finiteness, Turing offset and structural data ingredients are proved separately. Platt method: DOI 10.1090/mcom/3198. The original surrounding xi/theta work credits sometik179, c9908072-d99a-4431-aad8-a72c6352619a, and Gabewhigham.