Exact cached Mellin rounding for moments 292–293
ProvedTaoFivePrimes.rh_moment_292_293_roundingnumber-theorynumerical-verificationriemann-zetatao-five-primes
For each index , let be the stored integer and let be the cached rational Mellin quadrature rule. Then
The exact rounding certificate supports a true moment enclosure through separately proved rule identities and error bounds.
Preamble
import Definitions.Def_TaoFivePrimes_RHExtendedMomentData272to303 import Definitions.Def_TaoFivePrimes_RHExtendedMomentCachedNumerator
Formal statement
theorem TaoFivePrimes.rh_moment_292_293_rounding : ∀ n : Fin 2,
let j := 272+20+n.val
let c := TaoFivePrimes_RHExtendedMomentData272to303.getD (20+n.val) 0
c*(RHNextMomentInteger.denominator j:ℤ) ≤ 3*(10^64:ℤ)*RHNextMomentCached.numerator j ∧
3*(10^64:ℤ)*RHNextMomentCached.numerator j < (c+1)*(RHNextMomentInteger.denominator j:ℤ) := by sorrySource
Exact cached integer quadrature based on the theta-jet and Mellin framework of sometik179, https://prove2.me/submissions/c9908072-d99a-4431-aad8-a72c6352619a; theta/Mellin foundations by Gabewhigham. The higher rounded values are new.