Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Factorial and binomial cached numerators agree

Proved
TaoFivePrimes.rh_direct_132_fast_numerator_identity

by Johan Mercedes · Oct 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisnumber-theorynumerical-verificationriemann-zetatao-five-primes

For every nonnegative index kkk, the factorial-based integer component equals the corresponding real cached numerator when kkk is even and the imaginary cached numerator when kkk is odd. This is an exact identity of finite integer sums.

Preamble
import Definitions.Def_TaoFivePrimes_RHDirect132FastNumerator
import Mathlib
Formal statement
theorem TaoFivePrimes.rh_direct_132_fast_numerator_identity (k : ℕ) :
    RHDirect132FastNumerator.component k =
      if k%2=0 then RHDirect132CachedRule.numeratorRe k
      else RHDirect132CachedRule.numeratorIm k := by sorry
Source
Finite theta-jet and Mellin quadrature framework by sometik179 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