Under RH,
ProvedLandauCriterion.psi1_error_of_riemannHypothesisanalytic-number-theorychebyshev-functionriemann-hypothesis
Let be the von Mangoldt function and let
be the first Riesz mean of , where is Chebyshev's function. Assume the Riemann hypothesis. Then there is a constant such that for every real ,
where is the Euler–Mascheroni constant.
The leading constant is the value of over the nontrivial zeros under RH, and it is the size of the main term in the explicit formula . An explicit constant of this quality is what makes the Massias–Nicolas–Robin criterion hold under RH.
Formalization Note is written out as . The error term is weaker than the classical and suffices for the application.
Preamble
import Mathlib
Formal statement
namespace LandauCriterion
theorem psi1_error_of_riemannHypothesis (hRH : RiemannHypothesis) :
∃ C : ℝ, 0 < C ∧ ∀ x : ℝ, 4 ≤ x →
|(∑ n ∈ Finset.range (⌊x⌋₊ + 1), ArithmeticFunction.vonMangoldt n * max (x - n) 0) -
x ^ 2 / 2| ≤
(2 + Real.eulerMascheroniConstant - Real.log (4 * Real.pi)) * x ^ (3 / 2 : ℝ) +
C * (x ^ (5 / 4 : ℝ) * Real.log x ^ 2) := by sorry
end LandauCriterion
Source
A. E. Ingham, The Distribution of Prime Numbers (Cambridge Tracts 30, 1932), Chapter IV (explicit formula for ψ₁(x) = ∫₀ˣ ψ(t) dt); H. Davenport, Multiplicative Number Theory, 3rd ed., GTM 74, Chapter 12 (B = −Σ_ρ Re(1/ρ) = −γ/2 − 1 + (1/2) log 4π). Auxiliary lemma for the formal proof of the criterion of J.-P. Massias, J.-L. Nicolas, G. Robin, "Évaluation asymptotique de l'ordre maximum d'un élément du groupe symétrique", Acta Arith. 50 (1988), 221–242; as quoted in Wikipedia, "Landau's function", revision oldid=1303222269 (https://en.wikipedia.org/w/index.php?title=Landau%27s_function&oldid=1303222269), sentence "The statement that ln g(n) < sqrt(Li^{-1}(n)) for all sufficiently large n is equivalent to the Riemann hypothesis".