Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cofinal positive-height completed-zeta sign tables above 100000 with one unused counting slot

Open
MasulloRH.cofinal_signed_critical_band_certificates

by marozols · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

computational-number-theoryriemann-hypothesiszero-counting

For every requested height T, find an integer H≥T, exact known critical-line zeros E between heights 100000 and H, and finitely many pairwise disjoint rational intervals in that band on which the real completed zeta function has strictly opposite endpoint signs. Exact ordinates in E avoid the open intervals. The number of all distinct nontrivial zeros in the positive band (100000,H] is at most |E|+|B|+1. This is an open, cofinal family of finite computations. It permits unspecified convenient heights, an incomplete central count by one, and central zeros without a sign change. Nothing is requested from the already verified initial band.

Preamble
import Definitions.Def_MasulloRH_RegularizedTrace
import Mathlib.Data.Set.Card

set_option autoImplicit false
Formal statement
open Set Finset
namespace MasulloRH

theorem cofinal_signed_critical_band_certificates (T : ℕ) :
    ∃ H : ℕ, T ≤ H ∧ ∃ (E : Finset (ZetaZerosInTraceStrip (1/2))) (B : Finset (ℚ×ℚ)),
      (∀ z ∈ E, 100000 < z.val.im ∧ z.val.im ≤ (H:ℝ) ∧ z.val.re=1/2) ∧
      (∀ i ∈ B, 100000 ≤ (i.1:ℝ) ∧ i.1 < i.2 ∧ (i.2:ℝ) ≤ H ∧
        (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<z.val.im ∧ z.val.im ≤ H} ≤ ((E.card+B.card+1:ℕ):ℕ∞) := by sorry

end MasulloRH
Source
Proposed finite-data input to Prove2Me MasulloRH.prime_height_critical_zero_count_certificates (60aa6e62). The classical computational precedent for bracketing and certifying zero counts is Platt–Trudgian, https://doi.org/10.1112/blms.12460. The required cofinal family is open; that finite published computation does not establish it.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me