Explicit lower bound for the prime-counting function
ProvedLL_Decomp1528c.pi_ge_halfnumber-theory
For every real number , , where counts primes at most .
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_Decomp1528cSource
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 with , the declaration asserts , where is the natural logarithm, is the natural-number floor of , counts the primes at most , and the right side is cast to a real. The only hypothesis is . Since , , so no division by zero occurs and no junk values arise. The hypothesis is satisfiable, for example , so the statement is not vacuous. The inequality is non-strict. The claim is that for all real .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.