theta cert plist eq
ProvedTaoFivePrimes.theta_cert_plist_eqanalytic-number-theorychebyshev-thetanumber-theorynumerical-certificate
The explicit table of primes: the primes (as a finite set, listed as four consecutive chunks plist1--plist4) are exactly the primes in the integer interval .
Completeness of a primality table for : . Each of the four consecutive chunks is verified by direct kernel computation (trial division), and the chunks are glued along the interval partition.
Preamble
import Mathlib.Data.Finset.Basic import Mathlib.Order.Interval.Finset.Nat import Mathlib.Tactic import Definitions.Def_TaoFivePrimes_theta_cert_tables
Formal statement
namespace TaoFivePrimes theorem theta_cert_plist_eq : (Finset.Icc 2 1420).filter Nat.Prime = plist := by sorry
Source
J.B. Rosser, L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64-94; p. 82, Theorem 19 (finite window), used in the '288' chain of the Lemma 15 proof, p. 89. https://doi.org/10.1215/ijm/1255631807