Prime number theorem with Ford's error term
OpenLandauFunction.ford_prime_counting_errorThere is a constant such that, as ,
where is the number of primes and .
This is the error term in the prime number theorem that the source feeds into the asymptotic formula for in terms of .
Formalization Note for real is Nat.primeCounting ⌊x⌋₊; the real powers are Real.rpow.
import Mathlib import Definitions.Def_LandauFunction_logIntegral
namespace LandauFunction
theorem ford_prime_counting_error :
∃ c : ℝ, 0 < c ∧
(fun x : ℝ => (Nat.primeCounting ⌊x⌋₊ : ℝ) - logIntegral x) =O[Filter.atTop]
(fun x : ℝ => x * Real.exp (-c * Real.log x ^ ((3 : ℝ) / 5) *
Real.log (Real.log x) ^ (-(1 : ℝ) / 5))) := by sorry
end LandauFunction
Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — non-blind, same agent as the drafter
Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement below, with full knowledge of the source material and of the intended meaning. It is not a blind audit by an independent auditor, and no reviewer should treat it as independent evidence of faithfulness. It was produced at the explicit request of the proposal owner.
There exists a real number such that, as the real variable ,
Here is the natural-number floor (equal to for ), is the number of primes , and (definition logIntegral; for the ordinary offset logarithmic integral). The powers and are real powers; they are only evaluated at and , which are positive for , so the library's conventions for non-positive bases do not affect this eventual statement. "" means: there are constants and with for all . No other hypotheses.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.