TaoFivePrimes.rh_fast_log_ratio_polynomial
ProvedTaoFivePrimes.rh_fast_log_ratio_polynomialnumerical-verificationriemann-zetatao-five-primes
For0<=x<=1/3, the64-term odd logarithm polynomial approximates log((1+x)/(1-x)) within2^-128 in complex norm. Integer Horner evaluation and concrete logarithm seeds require separate proofs.
Preamble
import Mathlib.Analysis.SpecialFunctions.Complex.LogBounds
Formal statement
theorem TaoFivePrimes.rh_fast_log_ratio_polynomial (x:ℝ) (hx0:0≤x) (hx:x≤1/3) : ‖((Real.log ((1+x)/(1-x)):ℝ):ℂ)- 2*(x:ℂ)*(∑k∈Finset.range 64,(x:ℂ)^(2*k)/((2*k+1:Nat):ℂ))‖≤1/(2:ℝ)^128 := by sorry
Source
Platt, Isolating some non-trivial zeros of zeta, DOI10.1090/mcom/3198; Gaussian/Hermite Fourier identities and center Stirling expansion. Original surrounding attribution retained: sometik179 c9908072-d99a-4431-aad8-a72c6352619a and Gabewhigham.