theta cert blocks 4
ProvedTaoFivePrimes.theta_cert_blocks_4analytic-number-theorychebyshev-thetanumber-theorynumerical-certificate
Block verification, fourth chunk: the bound holds for every interval in the fourth group of 18 intervals (near the top of the range).
Same verification as the first chunk; the top block uses the clamped target .
Preamble
import Mathlib.NumberTheory.Chebyshev import Mathlib.Analysis.Complex.ExponentialBounds import Mathlib.Tactic import Definitions.Def_TaoFivePrimes_theta_cert_tables import Theorems.Thm_TaoFivePrimes_theta_cert_plist_eq import Theorems.Thm_TaoFivePrimes_theta_cert_primesLE_eq import Theorems.Thm_TaoFivePrimes_theta_cert_clbZ_le_log
Formal statement
namespace TaoFivePrimes
theorem theta_cert_blocks_4 (ab : ℕ × ℕ) (hab : ab ∈ blk4) :
((min (ab.2 + 1) 1420 : ℕ) : ℝ) - 2 * Real.sqrt ((min (ab.2 + 1) 1420 : ℕ) : ℝ) <
Chebyshev.theta ((ab.1 : ℕ) : ℝ) := by sorrySource
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