Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite Rosser bound between 1000 and 10^8

Proved
TaoFivePrimes.rosser_psi_finite_middle

by Yuxuan Xu · Sep 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

For every integer strictly between 1000 and 10^8, the second Chebyshev function satisfies

ψ(n)<1.03883n.\psi(n)<1.03883n.ψ(n)<1.03883n.

This is the remaining finite certificate obligation in a range decomposition of the uniform Rosser--Schoenfeld bound. The small range through 1000 is proved separately by exact LCM certificates; the range at least 10^8 follows from an explicit two-sided Chebyshev estimate. This finite obligation is open: numerical interval scouting is not a formal proof.

Preamble
import Mathlib.NumberTheory.Chebyshev
Formal statement
theorem TaoFivePrimes.rosser_psi_finite_middle (n : ℕ) (hn : 1000 < n) (hN : n < 10 ^ 8) : Chebyshev.psi (n : ℝ) < 1.03883 * (n : ℝ) := by sorry
Source
Finite restriction of Prove2Me theorem TaoFivePrimes.rosser_schoenfeld_psi_bound (cf6be7a8-2493-479a-9d57-6ee8535546d1), whose source is Rosser and Schoenfeld, Approximate formulas for some functions of prime numbers (1962), Theorem 12. The endpoints 1000 and 10^8 are specific to this formal range decomposition, not claimed to be a separately numbered theorem in that paper.

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