Chebyshev's lower bound for θ
ProvedFamousTheorems.chebyshev_theta_lower_boundChebyshev's lower bound for θ. For every natural number ,
where is the first Chebyshev function.
This makes explicit Chebyshev's lower bound , so there are at least primes up to . The proof compares the central binomial coefficient, which is at least , with its prime factorization.
Formalization note. Mathlib's Chebyshev.theta_ge. Chebyshev.theta x is , evaluated here at the real number .
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem chebyshev_theta_lower_bound (n : ℕ) :
(n : ℝ) * Real.log 2 - Real.log (n + 1) - 2 * Real.sqrt n * Real.log n ≤ Chebyshev.theta n := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Chebyshev.theta_ge`. Proof here reduces to that Mathlib result.