Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Rosser–Schoenfeld upper bound ϑ(y)<y+y/(2log⁡y)\vartheta(y) < y + y/(2\log y)ϑ(y)<y+y/(2logy) for y≥563y \ge 563y≥563

Open
IntMul.HvdH.rosser_schoenfeld_theta_upper

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

integer-multiplicationnumber-theory

Let ϑ(y)=∑p≤ylog⁡p\vartheta(y) = \sum_{p \le y} \log pϑ(y)=∑p≤y​logp be Chebyshev's function (sum over primes p≤yp \le yp≤y, natural logarithm). For every real y≥563y \ge 563y≥563,

ϑ(y)  <  y+y2log⁡y.\vartheta(y) \;<\; y + \frac{y}{2\log y}.ϑ(y)<y+2logyy​.

This is the upper half of Rosser–Schoenfeld's Theorem 4 (which states it on a wider range of yyy), restricted to the range y≥563y \ge 563y≥563 in which Harvey–van der Hoeven quote it in the proof of their Lemma 5.1. Together with the matching lower bound y−y/(2log⁡y)<ϑ(y)y - y/(2\log y) < \vartheta(y)y−y/(2logy)<ϑ(y) it gives IntMul.HvdH.rosser_schoenfeld_thm4.

Formalization note: Chebyshev.theta is Mathlib's ϑ\varthetaϑ on R\mathbb{R}R; since y≥563y \ge 563y≥563, log⁡y>0\log y > 0logy>0 and no junk values arise. The inequality is strict.

Preamble
import Mathlib
Formal statement
namespace IntMul.HvdH

theorem rosser_schoenfeld_theta_upper (y : ℝ) (hy : 563 ≤ y) :
    Chebyshev.theta y < y + y / (2 * Real.log y) := by sorry

end IntMul.HvdH
Source
J. B. Rosser, L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64–94, Theorem 4, p. 70 (upper bound for θ), https://doi.org/10.1215/ijm/1255631807; as quoted in D. Harvey, J. van der Hoeven, Integer multiplication in time O(n log n), Ann. of Math. 193 (2021), proof of Lemma 5.1, p. 38–39 ([39, Thm. 4]).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me