von Koch: under RH,
ProvedVonKoch.primeCounting_sub_logIntegral_of_riemannHypothesisanalytic-number-theoryprime-countingprime-number-theoremriemann-hypothesis
Assume the Riemann hypothesis, in Mathlib's form RiemannHypothesis. Then there is a constant such that for all real
where is the number of primes . This is von Koch's theorem (1901): under RH the prime number theorem holds with error . Von Koch also proved the converse; it is not part of this statement.
Formalization Note. is Nat.primeCounting ⌊x⌋₊. The offset logarithmic integral is written as an interval integral. It differs from by the constant , which is absorbed in the -term. The bound is explicit in with a single constant , valid for every .
Preamble
import Mathlib
Formal statement
namespace VonKoch
theorem primeCounting_sub_logIntegral_of_riemannHypothesis (hRH : RiemannHypothesis) :
∃ C : ℝ, ∀ x : ℝ, 3 ≤ x →
|(Nat.primeCounting ⌊x⌋₊ : ℝ) - ∫ t in (2 : ℝ)..x, 1 / Real.log t| ≤
C * Real.sqrt x * Real.log x := by sorry
end VonKochSource
H. von Koch, Sur la distribution des nombres premiers, Acta Math. 24 (1901), 159–182. E. C. Titchmarsh, The Theory of the Riemann Zeta-function, 2nd ed. (rev. D. R. Heath-Brown), OUP 1986, §14.26 (consequences of RH for π(x)); H. L. Montgomery and R. C. Vaughan, Multiplicative Number Theory I, Cambridge Univ. Press 2007, Theorem 13.1 (RH ⇒ ψ(x) = x + O(x^{1/2} log² x) and π(x) = li(x) + O(x^{1/2} log x)).