Error-term reduction for the finite reciprocal-prime endpoint certificate
ProvedTaoFivePrimes.rho_certificateFor every integer , the rational error term
of the finite endpoint certificate for the reciprocal-prime sum satisfies
where is the largest prime , the smallest prime , and the rational tables are the log-log table bounds of TaoFivePrimes_mertens_cert_511_tables.
The terms are with
the second-order Taylor correction obtained by expanding between the largest prime below and , and with , the corresponding correction towards the smallest prime above measured against the endpoint terms .
This lemma is the analytic heart of the reduction of the endpoint certificate: it converts the rational Taylor-type errors of the finite certificate into the log-log comparison between and its neighbouring primes, using the table inequalities , and .
Formalization Note. The bounds are stated for every integer ; the outermost terms are used at so that the final estimate holds on the whole half-open interval for real arguments.
import Mathlib import Definitions.Def_TaoFivePrimes_mertens_cert_511_tables
namespace TaoFivePrimes
theorem rho_certificate (n : Nat) (hn : 2 ≤ n) (hN : n ≤ 511) :
(rho n : Real) ≤ (Real.log (Real.log (n:Real)) - (llb (lastP n) : Real)) +
(4/(Real.log ((n:Real)+1))^3 - 4/(lub (firstP n) : Real)^3) := by
sorry
end TaoFivePrimes