The prime number theorem in -form:
ProvedApery.theta_eventually_closeFor every , for all sufficiently large real ,
where is Chebyshev's function. This is the -form of the prime number theorem in the form ; it is the external analytic input of the small-prime range of the normaliser's growth estimate (source Apery/Growth.lean uses it through Apery/PrimeSum.lean, lemma theta_eventually_close, which imports the prime number theorem () from the external project PrimeNumberTheoremAnd; Mathlib does not contain it). Formalization Note The statement is the source's. On the platform the closest available results are Mathlib's upper bound and the proved lower bound FamousTheorems.chebyshev_theta_lower_bound; the open platform targets IntMul.HvdH.rosser_schoenfeld_thm4 and TaoFivePrimes.dusart_theta_error_log_four_chebyshev are strong explicit forms that imply this statement.
import Mathlib open Filter
namespace Apery
lemma theta_eventually_close {ε : ℝ} (hε : 0 < ε) :
∀ᶠ y : ℝ in atTop, |Chebyshev.theta y - y| ≤ ε * y := by
sorry
end Apery