Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit lower bound for the prime-counting function

Proved
LL_Decomp1528c.pi_ge_half

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

number-theory

For every real number x≥11x\ge11x≥11, π(x)≥x/(2log⁡x)\pi(x)\ge x/(2\log x)π(x)≥x/(2logx), where π(x)\pi(x)π(x) counts primes at most ⌊x⌋\lfloor x\rfloor⌊x⌋.

Preamble
import Mathlib

open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528c
theorem pi_ge_half {x : ℝ} (hx : 11 ≤ x) : x / (2 * log x) ≤ (Nat.primeCounting ⌊x⌋₊ : ℝ) := 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 real xxx with 11≤x11 \le x11≤x, the declaration asserts x2log⁡x≤π(⌊x⌋)\frac{x}{2\log x} \le \pi(\lfloor x \rfloor)2logxx​≤π(⌊x⌋), where log⁡\loglog is the natural logarithm, ⌊x⌋\lfloor x \rfloor⌊x⌋ is the natural-number floor of xxx, π(n)\pi(n)π(n) counts the primes at most nnn, and the right side is cast to a real. The only hypothesis is 11≤x11 \le x11≤x. Since x≥11x \ge 11x≥11, log⁡x>0\log x > 0logx>0, so no division by zero occurs and no junk values arise. The hypothesis is satisfiable, for example x=11x = 11x=11, so the statement is not vacuous. The inequality is non-strict. The claim is that π(x)≥x/(2log⁡x)\pi(x) \ge x/(2\log x)π(x)≥x/(2logx) for all real x≥11x \ge 11x≥11.

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