510-case endpoint certificate for the reciprocal-prime estimate below 512
ProvedTaoFivePrimes.endpoint_certificateFor every integer ,
where
- is the partial reciprocal-prime sum,
- is the largest prime and the smallest prime ,
- and are the certified rational lower/upper tables for and ,
- is the rational endpoint error term built from the tables, and
- .
This is the finite 510-case numerical certificate underlying the endpoint estimate: combined with the analytic tail bound it yields, for every integer , the reciprocal-prime estimate with Meissel-Mertens constant and correction .
Formalization Note. All quantities on both sides are exact rationals coerced from the tables of TaoFivePrimes_mertens_cert_511_tables; the four analytic constants are represented by their displaced rounded values, so the statement is a purely finite arithmetic claim.
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_mertens_cert_511_tables
Formal statement
namespace TaoFivePrimes
theorem endpoint_certificate (n : Nat) (hn : 2 ≤ n) (hN : n ≤ 511) :
(T n : Rat) ≤ llb (lastP n) + rho n + 4/(lub (firstP n))^3 + Mq := by
sorry
end TaoFivePrimes