Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

TaoFivePrimes.rh_high_height_global_binning_semantics

Proved
TaoFivePrimes.rh_high_height_global_binning_semantics

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

numerical-verificationriemann-zetatao-five-primes

Gives the exact finite-sum meaning of every global bin coefficient at all24 Taylor orders: it is the sum of the proposed word terms assigned to that bin. The proof joins33 accepted packet-binning identities to the accepted global merge and generic proved list semantics. Analytic interpretation then uses the separate word-arithmetic and enclosure theorems; this statement alone asserts no Fourier accuracy, sign, count or RH.

Preamble
import Mathlib
import Definitions.Def_TaoFivePrimes_RHHighBinningSemantic
import Definitions.Def_TaoFivePrimes_RHHighGlobalDirichletBins
import Definitions.Def_TaoFivePrimes_RHHighAllDirichletWords
import Definitions.Def_TaoFivePrimes_RHHighBinningMerge
Formal statement
theorem TaoFivePrimes.rh_high_height_global_binning_semantics :
  ∀ m:Nat,m<929 → ∀ k:Nat,k<24 →
  RHHighBinningSemantic.pairValue (RHHighGlobalDirichletBins.coefficient m k)=
    ((RHHighAllDirichletWords.values.map (fun w=>if RHHighDirichletBinning.bin w=m then
      RHHighBinningSemantic.coefficientAt (RHHighDirichletBinning.terms w) k else 0)).sum) := 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