Prime number theorem with de la Vallée Poussin error term (Davenport §18)
ProvedDavenport.pnt_dlvpThe prime number theorem with the de la Vallée Poussin error term (Davenport §18). There are absolute constants such that for every real ,
i.e. . Here is Mathlib's Chebyshev function Chebyshev.psi. This is the principal-character input of the Siegel–Walfisz theorem: differs from by .
import Definitions.Def_Davenport_siegelWalfisz import Mathlib.NumberTheory.LSeries.DirichletContinuation import Mathlib.NumberTheory.DirichletCharacter.Basic import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt import Mathlib.NumberTheory.Chebyshev import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Pow.Complex import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Analysis.SpecialFunctions.Exp import Mathlib.Analysis.SpecialFunctions.Sqrt import Mathlib.Algebra.BigOperators.Finprod import Mathlib.Data.Nat.Totient open Finset DirichletCharacter Vino
namespace Davenport
theorem pnt_dlvp :
∃ c C : ℝ, 0 < c ∧ 0 < C ∧
∀ x : ℝ, 2 ≤ x →
|Chebyshev.psi x - x| ≤ C * x * Real.exp (-c * Real.sqrt (Real.log x)) := by sorry
end DavenportRead-back
What the Lean code literally says, in plain math · claude-opus-4-8
Read-back: Davenport.pnt_dlvp
The theorem is a single closed statement with no parameters, no hypotheses of its own, and no typeclass assumptions: it asserts the existence of a pair of real numbers and , both strictly positive ( and ), such that a certain inequality holds for every real number satisfying . In full, it says:
Here is Mathlib's Chebyshev function, , the sum of the von Mangoldt function over the positive integers up to ; it is a real-valued, right-continuous step function of the real variable that depends on only through . The quantity is the natural logarithm, is the real square root, and is the real exponential; the exponent is , i.e. the product of with , so the exponential factor lies strictly between and whenever , and the right-hand side is therefore strictly smaller than .
The quantifier order is essential to the content: the two constants and are chosen once and for all, before is introduced. They are therefore absolute numerical constants — they may not depend on , and a single pair must work simultaneously for every real , including arbitrarily large . Nothing in the statement pins down, bounds, or otherwise constrains and beyond their positivity: may be arbitrarily small and arbitrarily large, and no relation between them is required. Conversely, the statement makes no claim of uniqueness or optimality — it is a plain , not , and no "for all sufficiently small " or "for all below some threshold" is asserted.
The bound is two-sided, because it is stated on the absolute value : it simultaneously asserts and . The inequality is non-strict (, not ). It is an upper bound only; no matching lower bound on is claimed.
On the range and degenerate cases: the hypothesis is satisfiable (so the inner universally quantified claim is not vacuous), and it is the only restriction on — there is no upper cutoff, so the assertion covers all . Real numbers are excluded entirely, so the statement says nothing about or about negative , and in particular nothing about the degenerate values that occur for . On the retained range one has , so is a genuine positive square root and no junk value of the total functions or (which would return on non-positive arguments) is invoked. The right-hand side is a product of the positive constant , the positive number , and a positive exponential, hence positive throughout the range. Because ranges over the reals rather than the naturals, the claim at a real compares the step value against the real number itself.
Finally, the statement invokes nothing from the accompanying definition files: the auxiliary notions available in the preamble — the arithmetic-progression Chebyshev sum , the zero-free-region boundary and its associated predicate, the exceptional-set predicate for Dirichlet -functions, the Gauss sum, and the twisted von Mangoldt sum — do not appear in the assertion. No Dirichlet character, modulus , residue class , -function, or zero-free region occurs anywhere in what is claimed; the theorem is entirely about the single unrestricted Chebyshev function on .
Confirmed by the mission captain (proposal self-audit).