TaoFivePrimes.rh_batch01_height_contour_fft_upper_neg64_k03
ProvedTaoFivePrimes.rh_batch01_height_contour_fft_upper_neg64_k03numerical-verificationriemann-zetatao-five-primes
Exact integer evaluation of the first2048 DFT outputs proposed for the explicit Fourier polynomial on the upper rectangle edge starting atx=-64. Three packed convolutions, offset removal and80-bit rounding are checked in Lean. Separate spectrum-accuracy and analytic DFT-soundness proofs are required before any contour or zero-count conclusion.
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_RHBatch01ContourInputRUpperNeg64K03 import Definitions.Def_TaoFivePrimes_RHBatch01ContourInputIUpperNeg64K03 import Definitions.Def_TaoFivePrimes_RHHighFFTChirpR import Definitions.Def_TaoFivePrimes_RHHighFFTChirpI import Definitions.Def_TaoFivePrimes_RHHighFFTChirpS import Definitions.Def_TaoFivePrimes_RHHighFFTArithmeticBase import Definitions.Def_TaoFivePrimes_RHBatch01ContourOutputUpperNeg64K03 import Definitions.Def_TaoFivePrimes_RHHighPackedFFT
Formal statement
theorem TaoFivePrimes.rh_batch01_height_contour_fft_upper_neg64_k03 :
RHHighPackedFFT.output RHBatch01ContourInputRUpperNeg64K03.rows.flatten RHBatch01ContourInputIUpperNeg64K03.rows.flatten
RHHighFFTChirpR.rows.flatten RHHighFFTChirpI.rows.flatten RHHighFFTChirpS.rows.flatten
RHHighFFTArithmeticBase.chirp=RHHighPackedFFT.decode RHBatch01ContourOutputUpperNeg64K03.rows.flatten := by sorrySource
Bluestein convolution after Platt DOI10.1090/mcom/3198. Original surrounding attribution: sometik179 c9908072-d99a-4431-aad8-a72c6352619a, Gabewhigham.