Chebyshev's upper bound for ψ
ProvedFamousTheorems.chebyshev_psi_upper_boundChebyshev's upper bound for ψ. For all ,
where is the second Chebyshev function.
Chebyshev proved around 1850 that has order of magnitude , the first major step towards the prime number theorem. The upper bound comes from the divisibility of the central binomial coefficient by all primes in together with . It gives .
Formalization note. Mathlib's Chebyshev.psi_le_const_mul_self. Chebyshev.psi x is with the von Mangoldt function. The explicit constant is .
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem chebyshev_psi_upper_bound {x : ℝ} (hx : 0 ≤ x) :
Chebyshev.psi x ≤ (Real.log 4 + 4) * x := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Chebyshev.psi_le_const_mul_self`. Proof here reduces to that Mathlib result.