Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

TaoFivePrimes.rh_batch01_height_window_count_le

Proved
TaoFivePrimes.rh_batch01_height_window_count_le

by raresbuhai · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

numerical-verificationriemann-zetatao-five-primes

At most409 actual nontrivial zeta zeros in the exact closed128-unit window. Applies the accepted concrete finite-record count proof to the accepted all-grid accuracy theorem, discharging its final explicit hypothesis. The separate opposite-sign theorem is also required for the window; full finite-height RH and Proposition7.2 remain separate.

Preamble
import Definitions.Def_TaoFivePrimes_RHHighHeightWindow
Formal statement
theorem TaoFivePrimes.rh_batch01_height_window_count_le : (RHHighHeight.windowZeros 3289999744 3289999872).ncard ≤ 409 := by sorry
Source
Existing Platt Fourier construction, DOI10.1090/mcom/3198. Original surrounding attribution sometik179 c9908072-d99a-4431-aad8-a72c6352619a and Gabewhigham.

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