Rosser-Schoenfeld product bound certificate: (82629481, 85012902]
ProvedTaoFivePrimes.ros_chain_c33interval-certificatekernel-certificatemertens-productnumber-theoryrosser-schoenfeld
Segment c33 of the chained kernel certificate for the Rosser-Schoenfeld Mertens product lower bound, spanning the interval (82629481, 85012902]. Conditionally on e^gamma < 577216170667183/10^15 and on the incoming state 10^15 * logProd(82629481) >= 3480283512810665, it exports the outgoing state 10^15 * logProd(85012902) >= 3481841241769495 and proves that exp(gamma) * log x < prod_{p <= x} p/(p-1) for every real x with 82629481 < x <= 85012902. The interval is partitioned into consecutive prime-interval blocks grouped into chained groups; each block inequality is discharged by kernel computation and the groups are chained. The segment is independent of the others: the incoming state is a hypothesis.
Preamble
import Definitions.Def_ros_lower
Formal statement
theorem TaoFivePrimes.ros_chain_c33 (hγ : Real.eulerMascheroniConstant < (RosserLower.gammaUpS : ℝ) / (RosserLower.S : ℝ))
(hstate : (3480283512810665 : ℝ) ≤ (RosserLower.S : ℝ) * RosserLower.logProd 82629481) :
(3481841241769495 : ℝ) ≤ (RosserLower.S : ℝ) * RosserLower.logProd 85012902 ∧
(∀ x : ℝ, (82629481 : ℝ) < x → x ≤ (85012902 : ℝ) →
Real.exp Real.eulerMascheroniConstant * Real.log x < RosserProductCertificate.eulerProduct ⌊x⌋₊) := by sorrySource
Rosser & Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64-94; companion to the platform theorem TaoFivePrimes.rosser_schoenfeld_product_bound_lower; kernel-verified block certificate.