Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

TaoFivePrimes.rh_fast_kernel_dirichlet_static_bins04

Proved
TaoFivePrimes.rh_fast_kernel_dirichlet_static_bins04

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

numerical-verificationriemann-zetatao-five-primes

Center-independent exact arithmetic certificate for every40001≤n≤50000: bin≤928 and twice the normalized delta magnitude plus2^100≤D. The ordinary Lean kernel computes the published rational log/bin program on all10000 indices. Does not assert real-log error, phase/gamma accuracy, a zero count or RH.

Preamble
import Definitions.Def_TaoFivePrimes_RHFastKernelDirichletArithmetic
Formal statement
theorem TaoFivePrimes.rh_fast_kernel_dirichlet_static_bins04 (n : Nat) (hn : 40001≤n) (hN : n≤50000) :
  2*(RHFastKernelDirichletArithmetic.delta n).natAbs+2^100≤RHFastKernelLogData.D ∧
  RHFastKernelDirichletArithmetic.bin n≤928 := by sorry
Source
The static log/bin formulas of the 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