Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Large natural range for the half-theta bound

Proved
LL_Decomp1528c.theta_ge_half_large

by sthubbar · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

For every natural number n≥104n\ge10^4n≥104, θ(n)≥(n+1)/2\theta(n)\ge(n+1)/2θ(n)≥(n+1)/2.

Preamble
import Mathlib

open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528c
theorem theta_ge_half_large (n : ℕ) (hn : 10 ^ 4 ≤ n) : ((n : ℝ) + 1) / 2 ≤ θ n := by sorry
end LL_Decomp1528c
Source
Lab unit U-1528, classical Chebyshev bounds; source context: P. J. Campbell 2026, https://arxiv.org/abs/2608.09488v1. Lab large-range formulation; comparison cited in the lab: Rosser and Schoenfeld 1962, equation 3.14, p. 70.
Read-back

What the Lean code literally says, in plain math · claude-haiku

For every natural number nnn with 104≤n10^4 \le n104≤n, that is n≥10000n \ge 10000n≥10000, the inequality n+12≤θ(n)\frac{n+1}{2} \le \theta(n)2n+1​≤θ(n) holds. The left side is real division, with nnn cast to R\mathbb{R}R, so no truncation occurs. The right side is θ(x)=∑p prime, p≤⌊x⌋log⁡p\theta(x) = \sum_{p \text{ prime},\, p \le \lfloor x \rfloor} \log pθ(x)=∑p prime,p≤⌊x⌋​logp with natural logarithm, evaluated at x=nx = nx=n, so ⌊x⌋=n\lfloor x \rfloor = n⌊x⌋=n. There are no other binders or typeclass assumptions. The hypothesis is satisfiable and no junk values arise at these inputs, so the statement is not vacuous.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

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