TaoFivePrimes.rh_fft_packed_product_batch_fixture
ProvedTaoFivePrimes.rh_fft_packed_product_batch_fixturenumerical-verificationriemann-zetatao-five-primes
A deterministic batch of sixteen exact natural-number product identities for the proposed packed 4096-entry arithmetic fixture. This tests ordinary kernel checking and modular data loading. It proves no general convolution interpretation, FFT analytic error, zeta value or RH interval.
Preamble
import Definitions.Def_TaoFivePrimes_RHFFT4096PackedFixture
Formal statement
theorem TaoFivePrimes.rh_fft_packed_product_batch_fixture (i : Fin 16) : (RHFFT4096PackedFixture.a+i.val)*RHFFT4096PackedFixture.b=RHFFT4096PackedFixture.c+i.val*RHFFT4096PackedFixture.b := by sorry
Source
Arithmetic acceptance probe within the scalable finite-RH certificate investigation. The existing project preserves the xi/theta method attribution to sometik179, c9908072-d99a-4431-aad8-a72c6352619a, and theta/Mellin foundations to Gabewhigham. The fixture uses a proved Karatsuba-style checker and literal proposed integers; all proof terms are ordinary Lean.