TaoFivePrimes.rh_high_height_fft_actual_input12
ProvedTaoFivePrimes.rh_high_height_fft_actual_input12numerical-verificationriemann-zetatao-five-primes
All16384 order12 chirped FFT input pairs are exactly the128-bit rational gamma algorithm normalized to80 bits, multiplied by the80-bit indexed chirps. Ordinary sequential16-entry kernel checks are joined to all32 accepted normalized-moment arithmetic packets. This exact arithmetic equality requires separate analytic error and FFT-soundness proofs before a sign or count conclusion.
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_RHHighNormalizedMomentArithmetic import Definitions.Def_TaoFivePrimes_RHHighFFTArithmeticBase import Definitions.Def_TaoFivePrimes_RHHighFFTInputR12 import Definitions.Def_TaoFivePrimes_RHHighFFTInputI12
Formal statement
theorem TaoFivePrimes.rh_high_height_fft_actual_input12 :
∀ i : Nat,i<16384 →
let m:=RHHighMomentArithmetic.moment i (RHHighGammaArithmetic.compute i) 12
let c:=RHHighFFTArithmeticBase.chirp i
(m.1*c.1+m.2*c.2,m.2*c.1-m.1*c.2)=
((((((RHHighFFTInputR12.rows[i/512]?).getD [])[i%512]?).getD 0:Nat):Int)-2^166,
(((((RHHighFFTInputI12.rows[i/512]?).getD [])[i%512]?).getD 0:Nat):Int)-2^166) := by sorrySource
Platt DOI10.1090/mcom/3198 and Bluestein convolution. Original surrounding attribution sometik179 c9908072-d99a-4431-aad8-a72c6352619a, Gabewhigham.