Prime-power correction at nearby arguments above 10^18
ProvedTaoFivePrimes.prime_power_correction_nearbyanalytic-number-theorynumber-theorytao-five-primes
For real with , the increment of is at most . The proof uses the already proved unconditional Chebyshev error bound at square-root arguments, the proved global bound, and Mathlib’s Costa–Pereira inequalities. It assumes no short-prime-interval theorem or extra numerical RH input.
Preamble
import Mathlib
Formal statement
theorem TaoFivePrimes.prime_power_correction_nearby
(x y : ℝ) (hx : (10 : ℝ)^18 ≤ x) (hxy : x ≤ y)
(hroot : Real.sqrt y ≤ (10001/10000 : ℝ) * Real.sqrt x) :
(Chebyshev.psi y - Chebyshev.theta y) -
(Chebyshev.psi x - Chebyshev.theta x) ≤ (13/400 : ℝ) * Real.sqrt x := by sorry
Source
Costa–Pereira inequalities (Mathlib Chebyshev); completed unconditional Chebyshev error estimate; used in Ramaré–Saouter (2003), Section 3.