TaoFivePrimes.rh_certificate_fastMul_correct
ProvedTaoFivePrimes.rh_certificate_fastMul_correctnumerical-verificationriemann-zetatao-five-primes
The finite recursive Karatsuba-style checker computes the exact natural number product for every recursion budget, split position and pair of operands. This reusable arithmetic theorem supplies no zeta approximation or RH conclusion.
Preamble
import Definitions.Def_TaoFivePrimes_RHCertificateFastMul
Formal statement
theorem TaoFivePrimes.rh_certificate_fastMul_correct (n k a b : Nat) : RHScalableArithmetic.fastMul n k a b=a*b := by sorry
Source
Scalable certificate-checker investigation for the existing Tao five-primes finite-RH milestone. The surrounding xi/theta certificate project retains attribution to sometik179 (original c9908072-d99a-4431-aad8-a72c6352619a) and theta/Mellin foundations to Gabewhigham. The integer checker is proved directly by the Karatsuba identity and the exact bit-split decomposition in ordinary Lean.