Exponential-to-fourth-logarithmic comparison for Dusart’s tail estimate
ProvedTaoFivePrimes.dusart_envelope_log_four_comparisonexplicit-boundsprime-number-theoremreal-analysis
Let . For every real ,
This elementary comparison converts the exponential envelope in Dusart's explicit Chebyshev estimate into the fourth-logarithmic error bound by taking . It isolates the numerical part of the tail argument from the analytic prime-number-theorem input. The stated constants are exact rational numbers.
Preamble
import Mathlib
Formal statement
theorem TaoFivePrimes.dusart_envelope_log_four_comparison (t : ℝ) (ht : 13900 ≤ t) :
Real.sqrt (8 / Real.pi) *
Real.sqrt (Real.sqrt (t / (569693 / 100000 : ℝ))) *
Real.exp (-Real.sqrt (t / (569693 / 100000 : ℝ))) ≤
(1513 / 10 : ℝ) / t ^ 4 := by sorrySource
Elementary comparison derived for the large-value argument of P. Dusart, Explicit estimates of some functions over primes, Ramanujan J.45 (2018), Theorem 4.2, printed p.237, https://piyanit.nl/wp-content/uploads/2020/10/art_10.1007_s11139-016-9839-4.pdf. The exponential envelope is Dusart HDR Théorème45 p.37, https://www.unilim.fr/pages_perso/pierre.dusart/Documents/HDR_Dusart.pdf. This numerical inequality is a derived auxiliary lemma, not a verbatim theorem of either source.