Open finite zero-count certificates at explicit prime-power heights
OpenMasulloRH.prime_height_critical_zero_count_certificatesFor each prime , put . The proposed certificate consists of a finite set of distinct nontrivial zeta zeros on the critical line, all of absolute ordinate at most , whose cardinality is at least the total number of distinct nontrivial zeros through that height:
This is a finite lower-count/upper-count certificate interface, of the type produced by locating critical-line zeros and checking the complete zero count. The assertion that such certificates exist at every indicated prime height is OPEN and retains RH strength. No finite computational verification is asserted to establish this infinite family, and no zero simplicity assumption is imposed.
Its quantitative role is that the already proved resolvent tail bound at index is at most the single prime contribution . Thus a prime beyond an arithmetic cutoff supplies both an explicit height and an explicit tail budget. Extended cardinality is used in Lean so an infinite zero set cannot acquire a spurious count of zero.
import Definitions.Def_MasulloRH_RegularizedTrace import Mathlib.Data.Set.Card open MasulloRH set_option autoImplicit false
theorem MasulloRH.prime_height_critical_zero_count_certificates
(p : ℕ) (hp : Nat.Prime p) (hp100 : 100 ≤ p) :
∃ F : Finset (ZetaZerosInTraceStrip (1/2)),
(∀ z ∈ F, z.val.re = 1/2 ∧ |z.val.im| ≤ 5/2 + 2*((p^6 : ℕ):ℝ)) ∧
Set.encard {z : ZetaZerosInTraceStrip (1/2) |
|z.val.im| ≤ 5/2 + 2*((p^6 : ℕ):ℝ)} ≤ (F.card : ℕ∞) := by sorry