Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Integer translation of 304 Mellin moment candidates

Definition
TaoFivePrimes_RH304TranslationArithmetic

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

number-theorynumerical-verificationriemann-zetatao-five-primes

For a scaled center parameter ppp, a normalization SSS, and a nonnegative index nnn, this definition forms an integer Np,S,nN_{p,S,n}Np,S,n​ and a positive integer DDD by exact binomial translation of the 304 proposed moment numerators.

(p,S,n)⟼Np,S,n/D.(p,S,n)\longmapsto N_{p,S,n}/D.(p,S,n)⟼Np,S,n​/D.

The expression is an arithmetic model. It asserts neither the accuracy of the candidate moments nor an analytic xi approximation.

Definition code
/- Exact integer translation of the 304 proposed Mellin moments. The
original 256-moment data and xi translation framework are by sometik179,
with theta/Mellin foundations by Gabewhigham. This is arithmetic data only. -/
import Definitions.Def_TaoFivePrimes_RH14To100MomentModel
import Definitions.Def_TaoFivePrimes_RH272TranslationArithmetic
import Definitions.Def_TaoFivePrimes_RHExtendedMomentData272to303
import Mathlib.Data.Nat.Factorial.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
set_option autoImplicit false
open Finset

namespace RH304TranslationArithmetic

noncomputable def denominator : ℕ := 8*10^64*2^4864

noncomputable def momentInteger (j : ℕ) : ℤ :=
  if j<272 then RH272TranslationArithmetic.momentInteger j
  else TaoFivePrimes_RHExtendedMomentData272to303.getD (j-272) 0

noncomputable def chooseFast (k n : ℕ) : ℕ :=
  if n≤k then k.factorial/(n.factorial*(k-n).factorial) else 0

noncomputable def numerator (p : ℤ) (S n : ℕ) : ℤ :=
  (if n=0 then (4*10^64*2^4864:ℤ) else 0)*(S:ℤ)-
  (S:ℤ)*∑ j ∈ range 304,
    momentInteger j*(-1:ℤ)^j*((2^(4864-16*j+n):ℕ):ℤ)*
    ((chooseFast (2*j+2) n:ℤ)*p^(2*j+2-n)+
      (chooseFast (2*j) n:ℤ)*p^(2*j-n))

end RH304TranslationArithmetic
Source
Exact integer translation of the published 256 moment data and 48 extended candidate moments, using the local xi/Taylor framework of sometik179, Prove2Me c9908072-d99a-4431-aad8-a72c6352619a, https://prove2.me/submissions/c9908072-d99a-4431-aad8-a72c6352619a; theta/Mellin foundations by Gabewhigham. The height-114.5 arithmetic data are new.

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