theta cert log 1
ProvedTaoFivePrimes.theta_cert_log_1analytic-number-theorychebyshev-thetanumber-theorynumerical-certificate
Logarithmic table, first chunk: for every prime in the first block of primes , the integer (stored in clbZ) is a strict lower bound for .
Each of the 55 primes is checked by the exponential lower bound with and , so that (Mathlib's Real.exp_bound').
Preamble
import Mathlib.NumberTheory.Chebyshev import Mathlib.Analysis.Complex.ExponentialBounds import Mathlib.Tactic import Definitions.Def_TaoFivePrimes_theta_cert_tables
Formal statement
namespace TaoFivePrimes theorem theta_cert_log_1 (p : ℕ) (hp : p ∈ plist1) : ((clbZ p : ℕ) : ℝ) < Real.log p * 10 ^ 4 := 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