Sharper bounds for the Chebyshev function ψ(x)

Abstract

We improve the unconditional explicit bounds for the error term in the prime counting function ψ(x). In particular, we prove that, for all x>2, we have|ψ(x)−x|<9.22022x(log⁡x)3/2exp⁡(−0.8476836log⁡x), and that, for all x≥exp⁡(3000),|ψ(x)−x|<4.9678⋅10−15x. This compares to results of Platt and Trudgian (2021) who obtained 4.51⋅10−13x. Our approach represents a significant refinement of ideas of Pintz which had been applied by Platt and Trudgian. Improvements are obtained by splitting the zeros into additional regions, carefully estimating all of the consequent terms, and a significant use of computational methods. Results concerning π(x) will appear in the follow up work [11].