Abstract
This paper gives an explicit bound for the prime number theorem in short intervals under the assumption of the Riemann hypothesis.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
The von Mangoldt function is defined as
and we will consider the sum \(\psi (x) = \sum _{n \le x} \Lambda (n)\). The prime number theorem (PNT) is the statement \(\psi (x) \sim x\) as \(x \rightarrow \infty \). For the PNT in short intervals, it is known that
provided that h grows suitably with respect to x. Heath-Brown [9] has shown that one can take \(h = x^{\frac{7}{12} - \epsilon }\) provided that \(\epsilon \rightarrow 0\) as \(x \rightarrow \infty \). Assuming the Riemann hypothesis (RH), Selberg [14] showed that (1) is true for any \(h=h(x)\) such that \(h/(x^{1/2} \log x) \rightarrow \infty \) as \(x \rightarrow \infty \). On the other hand, Maier [11] has shown that the statement is false for \(h = (\log x)^{\lambda } \) for any \(\lambda > 1\).
In this paper we prove the following explicit version of Selberg’s result.
Theorem 1
Assuming RH, for any h satisfying \(\sqrt{x}\log x\le h \le x^\frac{3}{4}\) and all \(x \ge e^{10}\) we have
Selberg’s result follows from Theorem 1 for any \(h = f(x)\sqrt{x}\log x\) with unbounded \(f(x)=o(x)\), in that we would have
For \(h = c \sqrt{x} \log x\), Theorem 1 implies Cramér’s [6] result on primes in the interval \((x, x + h)\) for all sufficiently large x and c. In an earlier paper [7], the author showed that \(c = 1 + \epsilon \) is suitable for any \(\epsilon > 0\) and for all sufficiently large x. Carneiro, Milinovich and Soundararajan [4] have since shown that we can take \(c=22/55\) for all \(x\ge 4\). The same methods used in [7] are applied to reach Theorem 1. As such, it could be possible to sharpen Theorem 1 using the techniques in [4].
The closest result to Theorem 1 is the following from Schoenfeld [13].
Theorem 2
Assuming RH, for \(x \ge 73.2\) we have
Schoenfeld’s result confirms Selberg’s theorem for the slightly stronger condition of \(h/(\sqrt{x} \log ^2 x) \rightarrow \infty \). One also has from the above
When x is sufficiently large, Theorem 1 improves the leading constant in this bound for any choice of \(h\le x^{0.735}\).
2 Proof of Theorem 1
2.1 A smooth explicit formula
The Riemann–von Mangoldt explicit formula relates \(\psi (x)\) to the zeros of the Riemann zeta-function \(\zeta (s)\) (e.g. see Ingham [10]). Tor all non-integer \(x>0\),
where the sum is over all non-trivial zeroes \(\rho = \beta +i\gamma \) of \(\zeta (s)\). We define the weighted sum
and use the following explicit formula, proved in [7] (see also Thm. 28 of [10]).
Lemma 3
For non-integer \(x>0\) we have
where
The bound on \(\epsilon (x)\) has been reduced from [7], as we can write
and
Using a linear combination of Eq. (5), we can examine the distribution of prime powers in the interval \((x, x+h)\). For \(2\le \Delta < \sqrt{x}\log x \le h \le x\), let
This leads to the identity
which can be verified by expanding both sides. Notice that over \(x \le n \le x+h\), the sum on the LHS is equal to \(\psi (x+h)-\psi (x)\). We thus aim to estimate this expression by bounding the RHS of (7). Using Lemma 3 in the above equation gives the following.
Lemma 4
Let \(2 \le \Delta < h \le x\) with \(x \notin {\mathbb {Z}}\). Then
where
and
It remains to estimate the sum over zeros. We will split it into three sums,
where \(\alpha > 0\) and \(\beta >0\) are parameters we can later optimise over.
Lemma 5
Let \(2 \le \Delta < h \le x\) and assume RH. We have
provided that \(\beta x / \Delta \ge \gamma _1 = 14.13\ldots \), the ordinate of the first zero of \(\zeta (s)\).
Proof
On RH, one has
The result follows from Lemma 1(ii) of Skewes [15], that for all \(T \ge \gamma _1\),
\(\square \)
The following lemmas require estimates on the zero-counting function N(T), which counts the number of zeros of \(\zeta (s)\) in the critical strip \(0<\beta <1\) with \(0<\gamma \le T\). Backlund [1] showed that \(N(T) = P(T) + Q(T)\), where
and \(Q(T) = O(\log T)\). Hasanalizade, Shen, and Wong [8, Cor. 1.2] have given the most recent explicit version of this, of
with \(a_1= 0.1038\), \(a_2=0.2573\), and \(a_3 = 9.3675\), for all \(T \ge e\).
Lemma 6
Let \(2 \le \Delta < h \le x\) and assume RH. We have
Proof
We can write
so, under RH, one has
With (8), we can use
from which the result immediately follows. \(\square \)
For the middle sum of (7), we will use the following lemma. It follows directly from Lemma 3 of [2], in whose notation we use \(\phi (\gamma ) = \gamma ^{-1}\), and takes constants \(A_0\) and \(A_1\) from Trudgian [16, Thm. 2.2] and \(A_2\) from [2, Lem. 2].
Lemma 7
For \(2\pi \le T_1 \le T_2\) we have
where \(|Q(T)|\le R(T)\), defined in (8), and
with \(A_0 = 2.067\), \(A_1 = 0.059\), \(A_2 = 1/150\).
Lemma 8
Let \(2 \le \Delta < h \le x\) and assume RH. For \(\alpha x/h\ge 15\) we have
Proof
We can write
and so bounding trivially gives
It follows that
on which we apply Lemma 7, and bound the smaller order terms with the assumption of \(T_1\ge 15\) to obtain the result. Note that the bound on \(T_1\) is to reduce the constant 5.4, but not restrict \(\alpha \) too much. \(\square \)
2.2 Bounding the PNT in intervals
From Lemma 4 we can write
As the smooth weight has \(|w(n)| \le 1\), the above bound is no greater than
The largest term in this bound comes from the sum over \(\rho \), in particular, the section estimated in Lemma 8. Larger \(\Delta \) results in a smaller main-term constant, so we will set \(\Delta = C\sqrt{x}\log x\) and later choose an optimal value of \(C\in (0,1)\). The reason for not taking larger \(\Delta \) is two-fold: to keep \(\Delta < h\) and ensure the smaller terms in (10) are \(O(\sqrt{x}\log x)\).
To bound the sum over prime powers we can use Montgomery and Vaughan’s version of the Brun–Titchmarsh theorem for primes in intervals [12, Eq. 1.12]. Defining \(\theta (x) = \sum _{p\le x}\log p\), Eq. (1.12) of [12] implies
The contribution from higher prime powers is relatively small, and can be bounded with explicit estimates on the difference between the Chebyshev functions \(\psi (x)\) and \(\theta (x)\). Costa Pereira [5, Thm. 2,4,5] gives lower bounds for different ranges of x. These can be combined into
for all \(x\ge 2187\). Broadbent et al. [3, Cor. 5.1] give
with \(\alpha _1= 1+ 1.93378 \cdot 10^{-8}\) and \(\alpha _2 = 2.69\) for all \(x\ge e^{10}\). Thus, we have
where \(E_1(x) = \alpha _1 (x+h+\Delta )^\frac{1}{2} + \alpha _2 (x+h+\Delta )^\frac{1}{3} - 0.999(x+h)^\frac{1}{2} - \frac{2}{3} (x+h)^\frac{1}{3}\), and is bounded by \(E_1(x) \le \beta _1 x^{\frac{1}{2}} + \beta _2 x^{\frac{1}{3}}\) with
Here and hereafter, let \(x_0=e^{10}\). For \(x\ge x_0\) we can bound the smaller order terms in (10),
where, for \(h\le x^t\) with \(t<1\),
This, along with Lemmas 5 and 6, allow us to bound
where
For \(\sqrt{x}\log x\le h\le x^t\) we have
where, for \(x\ge x_0\ge e^{\beta /C}\) and \(0<\alpha \le 5\), we can take
The first term in (13) can be estimated with Lemma 8, so that
in which, assuming \(100 e^{-10} \le \frac{\alpha \beta }{4\pi ^2 C}\le 100\), we can take
Note that the assumption for \(\alpha \) and \(\beta \) is to ensure certain terms are bounded for all \(x\ge x_0\). Combining estimates, we have
where \(K_4 = K_3 + K_2\). It remains to optimise over the parameters. Before deciding these values, recall that we have made the assumptions \(\beta \le 10C\),
The restriction on \(\alpha \) will be satisfied for all \(\sqrt{x}\log x\le h\le x^\frac{3}{4}\) if we take \(\alpha \ge 15 x_0^{-\frac{1}{4}}\). Optimising over C, \(\alpha \), and \(\beta \) to minimise \(K_4\), we find that choosing \(C= 0.25\) and \(\alpha = \beta = 1.35\) allows us to take \(K_4 = 2\) for all \(x\ge x_0\).
Data Availibility Statement
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
References
Backlund, R.J.: Über die Nullstellen der Riemannschen Zetafunktion. Acta Math. 41(1), 345–375 (1918)
Brent, R.P., Platt, D.J., Trudgian, T.S.: Accurate estimation of sums over zeros of the Riemann zeta-function. Math. Comp. 90(332), 2923–2935 (2021)
Broadbent, S., Kadiri, H., Lumley, A., Ng, N., Wilk, K.: Sharper bounds for the Chebyshev function \(\theta (x)\). Math. Comp. 90(331), 2281–2315 (2021)
Carneiro, E., Milinovich, M.B., Soundararajan, K.: Fourier optimization and prime gaps. Comment. Math. Helv. 94(3), 533–568 (2019)
Costa Pereira, N.: Estimates for the Chebyshev function \(\psi (x)-\theta (x)\). Math. Comput. 44(169), 211–221 (1985)
Cramér, H.: On the order of magnitude of the difference between consecutive prime numbers. Acta Arith. 2(1), 23–46 (1936)
Dudek, A.W.: On the Riemann hypothesis and the difference between primes. Int. J. Number Theory 11(3), 771–778 (2015)
Hasanalizade, E., Shen, Q., Wong, P.-J.: Counting zeros of the Riemann zeta function. J. Number Theory 235, 219–241 (2022)
Heath-Brown, D.R.: The number of primes in a short interval. J. für die Reine Angew 389, 22–63 (1988)
Ingham, A.E.: The Distribution of Prime Numbers, 30th edn. Cambridge University Press, Cambridge (1932)
Maier, H.: Primes in short intervals. Mich. Math. J. 32(2), 221–225 (1985)
Montgomery, H.L., Vaughan, R.C.: The large sieve. Mathematika 20(2), 119–134 (1973)
Schoenfeld, L.: Sharper bounds for the Chebyshev functions \(\theta (x)\) and \(\psi (x)\). II. Math. Comput. 25, 337–360 (1976)
Selberg, A.: On the normal density of primes in small intervals, and the difference between consecutive primes. Arch. Math. Naturvid. 47(6), 87–105 (1943)
Skewes, S.: On the difference \(\pi (x)- \text{ li }(x)\) (II). Proc. Lond. Math. Soc. 3(1), 48–70 (1955)
Trudgian, T.: Improvements to Turing’s method. Math. Comput. 80(276), 2259–2279 (2011)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Cully-Hugill, M., Dudek, A.W. A conditional explicit result for the prime number theorem in short intervals. Res. number theory 8, 61 (2022). https://doi.org/10.1007/s40993-022-00358-1
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40993-022-00358-1