Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rosser--Schoenfeld (3.14) finite range 109<t≤101010^9< t\le 10^{10}109<t≤1010: certificate segment 252 of 1348

Proved
TaoFivePrimes.rosser_schoenfeld_theta_lower_mid_e10_seg0252

by Nickrobbins95 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorychebyshev-functionsnumber-theoryprimes

Let θ(x)=∑p≤xlog⁡p\theta(x)=\sum_{p\le x}\log pθ(x)=∑p≤x​logp be the Chebyshev theta function (ppp prime, log⁡\loglog natural), and suppose the integer B=2859868370994453275355B=2859868370994453275355B=2859868370994453275355 satisfies B/240≤θ(2601067412)B/2^{40}\le\theta(2601067412)B/240≤θ(2601067412).

Then for every integer nnn with 2601067412≤n≤26075765092601067412\le n\le 26075765092601067412≤n≤2607576509,

(n+1)−10n+1≤θ(n),(n+1)-10\sqrt{n+1}\le\theta(n),(n+1)−10n+1​≤θ(n),

and moreover the integer A=2867016306472803431090A=2867016306472803431090A=2867016306472803431090 satisfies A/240≤θ(2607576510)A/2^{40}\le\theta(2607576510)A/240≤θ(2607576510).

Role: this is segment 252252252 of 134813481348 consecutive segments covering 109<n≤101010^9<n\le 10^{10}109<n≤1010, the finite verification behind the range 109<t≤101010^9<t\le10^{10}109<t≤1010 of Rosser and Schoenfeld's inequality (3.14), t (1−1/(2log⁡t))<θ(t)t\,(1-1/(2\log t))<\theta(t)t(1−1/(2logt))<θ(t) (Theorem 4), which is the parent node TaoFivePrimes.rosser_schoenfeld_theta_lower_analytic_mid. Since θ\thetaθ is constant between consecutive integers, the bound at the integers nnn with n≤t<n+1n\le t<n+1n≤t<n+1 gives the bound for real ttt, and 20t<t/(2log⁡t)20\sqrt t<t/(2\log t)20t​<t/(2logt) holds for t≥108t\ge10^8t≥108. The hypothesis is the lower bound for θ\thetaθ handed on by the previous segment (for the first segment it is the second conjunct of TaoFivePrimes.rosser_schoenfeld_theta_lower_mid_lower_cert151, the last segment of the range 108≤n≤10910^8\le n\le10^9108≤n≤109); the second conjunct is the lower bound this segment hands to the next one. Both conjuncts are unconditional finite statements about the primes up to 260757651026075765102607576510.

Formalization Note The constant 101010 in front of n+1\sqrt{n+1}n+1​ is a formalization choice: it is weaker than the 2t2\sqrt{t}2t​ of Rosser--Schoenfeld's Theorem 19 (which is stated only up to 10810^8108) and is all that (3.14) needs on this range. The segment endpoints and the integers AAA, BBB are the exact values produced by the certificate chain; segment kkk's AAA is segment k+1k+1k+1's BBB.

Preamble
import Mathlib.NumberTheory.Chebyshev
Formal statement
namespace TaoFivePrimes

theorem rosser_schoenfeld_theta_lower_mid_e10_seg0252
    (hbase : (2859868370994453275355 : Real) / 2 ^ 40 <= Chebyshev.theta (2601067412 : Real))
    (n : Nat) (h1 : 2601067412 <= n) (h2 : n <= 2607576509) :
    (((n : Real) + 1) - 10 * Real.sqrt ((n : Real) + 1) <= Chebyshev.theta (n : Real)) /\
      ((2867016306472803431090 : Real) / 2 ^ 40 <= Chebyshev.theta (2607576510 : Real)) := by sorry

end TaoFivePrimes
Source
J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois Journal of Mathematics 6 (1962), 64--94, Theorem 4, p. 70, eq. (3.14), https://doi.org/10.1215/ijm/1255631807 (finite verification of the range 10^9 < t <= 10^10, integer certificate segment 252 of 1348; the finite part of the Five Primes node TaoFivePrimes.rosser_schoenfeld_theta_lower_analytic_mid, used in T. Tao, arXiv:1201.6656, Section 9)

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