Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Small natural range for the half-theta bound

Open
LL_Decomp1528c.theta_ge_half_small

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

number-theory

For every natural number nnn with 11≤n<100011\le n<100011≤n<1000, θ(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_small (n : ℕ) (h1 : 11 ≤ n) (h2 : n < 1000) : ((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. Exact range and constant as stated in Decomp1528c.lean.
Read-back

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

For every natural number nnn with 11≤n<100011 \le n < 100011≤n<1000, the statement asserts n+12≤θ(n)\frac{n+1}{2} \le \theta(n)2n+1​≤θ(n), where θ(n)=∑p prime, p≤nlog⁡p\theta(n) = \sum_{p \text{ prime},\, p \le n} \log pθ(n)=∑p prime,p≤n​logp and log⁡\loglog is the natural logarithm. The natural number nnn is cast to a real, so the inequality is between reals. The claim covers the 989 integers n=11,…,999n = 11, \dots, 999n=11,…,999. The inequality is non-strict. No edge cases produce junk values: the arguments are positive, there is no division by zero, and no natural-number subtraction is involved. The hypotheses are satisfiable and 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