Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rosser-Schoenfeld product bound certificate: (92086102, 94416971]

Proved
TaoFivePrimes.ros_chain_c37

by andreaskapfer · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

interval-certificatekernel-certificatemertens-productnumber-theoryrosser-schoenfeld

Segment c37 of the chained kernel certificate for the Rosser-Schoenfeld Mertens product lower bound, spanning the interval (92086102, 94416971]. Conditionally on e^gamma < 577216170667183/10^15 and on the incoming state 10^15 * logProd(92086102) >= 3486208334321301, it exports the outgoing state 10^15 * logProd(94416971) >= 3487569337793548 and proves that exp(gamma) * log x < prod_{p <= x} p/(p-1) for every real x with 92086102 < x <= 94416971. 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_c37 (hγ : Real.eulerMascheroniConstant < (RosserLower.gammaUpS : ℝ) / (RosserLower.S : ℝ))
    (hstate : (3486208334321301 : ℝ) ≤ (RosserLower.S : ℝ) * RosserLower.logProd 92086102) :
    (3487569337793548 : ℝ) ≤ (RosserLower.S : ℝ) * RosserLower.logProd 94416971 ∧
      (∀ x : ℝ, (92086102 : ℝ) < x → x ≤ (94416971 : ℝ) →
        Real.exp Real.eulerMascheroniConstant * Real.log x < RosserProductCertificate.eulerProduct ⌊x⌋₊) := by sorry
Source
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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me