TaoFivePrimes.rh_high_height_fft_computation19
ProvedTaoFivePrimes.rh_high_height_fft_computation19numerical-verificationriemann-zetatao-five-primes
Exact integer verification of the first2048 Fourier outputs for the normalized gamma moment order19. Three packed natural-number convolution checks, independently checked input sums, offset removal and80-bit rounding. This arithmetic theorem requires a separate generic DFT soundness and analytic-error proof before it can imply signs or a zero count.
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_RHHighFFTInputR19 import Definitions.Def_TaoFivePrimes_RHHighFFTInputI19 import Definitions.Def_TaoFivePrimes_RHHighFFTChirpR import Definitions.Def_TaoFivePrimes_RHHighFFTChirpI import Definitions.Def_TaoFivePrimes_RHHighFFTChirpS import Definitions.Def_TaoFivePrimes_RHHighFFTArithmeticBase import Definitions.Def_TaoFivePrimes_RHHighFFTPositive19 import Definitions.Def_TaoFivePrimes_RHHighPackedFFT
Formal statement
theorem TaoFivePrimes.rh_high_height_fft_computation19 :
RHHighPackedFFT.output RHHighFFTInputR19.rows.flatten RHHighFFTInputI19.rows.flatten
RHHighFFTChirpR.rows.flatten RHHighFFTChirpI.rows.flatten RHHighFFTChirpS.rows.flatten
RHHighFFTArithmeticBase.chirp=RHHighPackedFFT.decode RHHighFFTPositive19.rows.flatten := by sorrySource
Bluestein convolution after Platt DOI10.1090/mcom/3198. Original surrounding attribution: sometik179 c9908072-d99a-4431-aad8-a72c6352619a, Gabewhigham.