1 Introduction
Let $\pi (x)$ denote the number of primes less than or equal to x and
In his celebrated 1859 article, Riemann [Reference Riemann21] remarked on the apparent truth of the inequality
for all $x\geq 2$ . In 1903, Schmidt [Reference Schmidt25, p. 204] showed that such a result would imply the Riemann hypothesis. However, in 1914, Littlewood [Reference Littlewood16] managed to prove that $\pi (x)-\operatorname {\textrm {li}}(x)$ changes sign infinitely often. More precisely, he showed that for some positive constant c, there are arbitrarily large values of x such that
It is an open problem to determine the smallest value of x such that $\pi (x)>\operatorname {\textrm {li}}(x)$ . Large computations have shown that $\pi (x)<\operatorname {\textrm {li}}(x)$ for all $x\leq 10^{19}$ [Reference Büthe6, Theorem 2] and that the first sign change occurs before $x=1.4\times 10^{316}$ [Reference Bays and Hudson1, Reference Saouter, Trudgian and Demichel24].
Although $\pi (x)<\operatorname {\textrm {li}}(x)$ is not true in general, one can ask whether, in a precise sense, $\pi (x)<\operatorname {\textrm {li}}(x)$ is true on average. Namely, several authors [Reference Ingham12–Reference Karatsuba14, Reference Pintz19, Reference Stechkin and Popov26] assert that the Riemann hypothesis implies
for some sufficiently large $x_0$ . Pintz [Reference Pintz19] claims that (1.1) is in fact equivalent to the Riemann hypothesis and is likely to hold for all $x>2$ under such assumptions. Using explicit bounds on prime-counting functions, we are able to prove this claim.
Theorem 1.1 The Riemann hypothesis is equivalent to the condition
We also prove an analogous result for the Chebyshev function
Theorem 1.2 The Riemann hypothesis is equivalent to the condition
It is natural to ask whether a modification of (1.2) or (1.3) is true unconditionally. In this direction, we consider the weighted integrals
for some choice of function $f(t)$ . Given that one has to go quite far to find a value of t such thatFootnote 1 $\pi (t)-\operatorname {\textrm {li}}(t)>0$ , one should intuitively take $f(t)$ to be positive and decreasing as to give more weight to the negative bias for small values of t. In [Reference Pintz19], Pintz considers $f(t)=\exp (-\log ^2t/y)$ for sufficiently large y. However, using an explicit form of Mertens’ theorems, we show that $I_1(x,f)<0$ and $I_2(x,f)<0$ for the simpler and asymptotically larger function $f(t)=1/t^2$ . Analogous results also hold for the prime-counting functions
Theorem 1.3 Unconditionally, we have
for all $x>2$ .
Note that since $\pi (t)<\Pi (t)$ and $\theta (t)<\psi (t)$ , the apparent negative bias of $\Pi (t)-\operatorname {\textrm {li}}(t)$ and $\psi (t)-t$ is less pronounced than that of $\pi (t)-\operatorname {\textrm {li}}(t)$ or $\theta (t)-t$ . In fact, $\int _2^x\Pi (t)-\operatorname {\textrm {li}}(t)\:\textrm {d}t$ and $\int _2^x\psi (t)-t\:\textrm {d}t$ change sign infinitely often (see Lemma 2.8). Thus, unlike as in Theorem 1.3, Theorems 1.1 and 1.2 do not hold if $\pi (t)$ and $\theta (t)$ are replaced with $\Pi (t)$ and $\psi (t)$ , respectively.
Finally, we show that one cannot do much better than Theorem 1.3 without further knowledge of the location of the zeros of $\zeta (s)$ .
Theorem 1.4 Let $\omega =\sup \{\Re (s):\zeta (s)=0\}$ . If $1/2<\omega \leq 1$ and $c<1+\omega \leq 2$ , then
Here, as per usual, the notation $g(x)=\Omega _+(1)$ means that there exist arbitrarily large values of x such that $g(x)>0$ .
Remark 1.5 Despite the restrictions in Theorem 1.4, it is conceivable that one may be able to use a slightly (asymptotically) larger weight than $f(t)=1/t^2$ in Theorem 1.3. For instance, $f(t)=\log t/t^2$ . Such a result would most likely require the use of an explicit zero-free region, e.g., [Reference Mossinghoff and Trudgian18, Theorem 1] or [Reference Ford8, Theorem 5]. We do not pursue this here.
2 Useful lemmas
In this section, we list a series of useful lemmas. Most of the following results are explicit bounds on prime-counting functions which follow directly from existing results in the literature.
Lemma 2.1 [Reference Büthe6, Theorem 2]
For all $2\leq x\leq 10^{19}$ , $\pi (x)-\operatorname {\textrm {li}}(x)<0$ and $\theta (x)-x<0$ .
Lemma 2.2 [Reference Rosser and Schoenfeld22, Equations (3.5), (3.6), (3.15), and (3.16)]
We have
Lemma 2.3 We have
Proof Let $M=\lfloor \frac {\log x}{\log 2}\rfloor $ . Then,
by Lemma 2.2. On the other hand,
as required. The inequalities in (2.4) then follow from equations (3.36) and (3.37) in [Reference Rosser and Schoenfeld22].▪
Lemma 2.4 For all $x>1$ , we have
Proof For $x\geq 1{,}865$ , the result follows from [Reference Bennett, Martin, O’Bryant and Rechnitzer2, Lemma 5.9]. For smaller values of x, the result follows via simple computations.▪
Lemma 2.5 We have
Proof Follows by directly computing each integral on Mathematica.▪
Lemma 2.6 Assuming the Riemann hypothesis, $\left |\int _2^x\left (\psi (t)-t\right )\textrm {d}t\right |\leq 0.08x^{3/2}$ for all $x\geq 3{,}000$ .
Proof By [Reference Ingham12, Theorem 27],
where the sum is taken over all nontrivial zeros $\rho =\beta +i\gamma $ of the Riemann zeta function. First, we note that
because $\sum _{\rho }1/\gamma ^2=0.046209\ldots $ [Reference Brent, Platt and Trudgian3, Corollary 1]. Next, $(\zeta '/\zeta )(0)=\log 2\pi $ [Reference Edwards7, Section 3.8] and $(\zeta '/\zeta )(-1)=1.985\ldots $ as computed on Mathematica. Finally,
Thus, noting that $\frac {x^2}{2}=\int _2^x t\:\textrm {d}t+2$ ,
for all $x\geq 3{,}000$ .▪
Lemma 2.7 (Cf. [Reference Ingham12, pp. 103–104])
Let $Q(x)=\Pi (x)-\operatorname {\textrm {li}}(x)$ , $R(x)=\psi (x)-x$ , and $R_1(x)=\int _2^xR(t)\:\textrm {d}t$ . Then,
where
Proof Using integration by parts,
so that by partial summation,
Hence,
A further application of integration by parts then gives the desired result.▪
Lemma 2.8 Let $c\in \mathbb {R}$ and define
If $\omega =\sup \{\Re (s):\zeta (s)=0\}$ and $c<1+\omega \leq 2$ , then for all $\delta>0$ ,
Proof We begin with the integral expression [Reference Ingham12, Equation (18), p. 18]
Using integration by parts,
noting that since $\Pi (x)=O(x)$ ,
Hence,
Using an analogous argument with the integral expression [Reference Ingham12, Equation (17), p. 18]
one obtains
Equipped with (2.6) and (2.7), one can then follow a standard argument (e.g., [Reference Broughan4, p. 80], [Reference Ingham12, pp. 90–91]) mutatis mutandis to obtain the desired result.▪
3 Proofs of Theorems 1.1 and 1.2
We begin with the case where the Riemann hypothesis is false. By Lemma 2.8 with $c=0$ , there are arbitrarily large values of x such that $\int _{2}^x\Pi (t)-\operatorname {\textrm {li}}(t)\:\textrm {d}t>Kx^{\kappa }$ for some positive constants $K>0$ and $\kappa>3/2$ . For such values of x, we then have by Lemma 2.3 that
Thus, there are arbitrarily large values of x such that
as required. The same reasoning holds for the integral over $\theta (t)-t$ using the corresponding bounds for $\theta (t)$ in Lemmas 2.3 and 2.8.
Now, suppose the Riemann hypothesis is true. To show (1.2) and (1.3), it suffices to consider $x>10^{19}$ in light of Lemma 2.1. We begin with the integral over $\theta (t)-t$ . By Lemmas 2.3, 2.5, and 2.6, we have
as required.
The integral over $\pi (t)-\operatorname {\textrm {li}}(t)$ requires more work. First, we apply Lemmas 2.3, 2.5, and 2.7 to obtain
using the notation from Lemma 2.7. Now, by integration by parts and Lemmas 2.5 and 2.6,
Next,
Since $u^{1/4}/\log ^2u$ is increasing for $u\geq 3{,}000$ , we then have
Thus,
Substituting (3.2) and (3.3) into (3.1) then gives
Now, using integration by parts,
Moreover,
Applying (3.5) and (3.6), we have that (3.4) reduces to
as required.
4 Proof of Theorem 1.3
First, we note that, via a simple computation, all four integrals in question are negative for $2<x\leq 200$ . Thus, we may assume throughout that $x>200$ .
First, we deal with the integrals involving $\pi (t)$ and $\Pi (t)$ . By an explicit form of Mertens’ theorem [Reference Rosser and Schoenfeld22, Equation (3.20)], we have
where $B=0.2614\ldots $ . Now, by partial summation and Lemma 2.2,
Moreover, by integration by parts and Lemma 2.4,
Substituting (4.2) and (4.3) into (4.1) gives
as desired. For the integral involving $\Pi (t)$ , we then note that by Lemma 2.3,
Substituting this into (4.4) then gives
We argue similarly for the integrals involving $\theta (t)$ and $\psi (t)$ . In particular, we have [Reference Rosser and Schoenfeld22, Equation (3.23)]
where $E=-1.332\ldots $ . Then, by Lemma 2.2,
and
Therefore,
as required. The corresponding result for $\psi (t)$ then follows similar to before by applying Lemma 2.3 to (4.5). In particular, we have that
5 Proof of Theorem 1.4
The result for the integrals involving $\Pi (t)$ and $\psi (t)$ follows immediately from Lemma 2.8. For the integral involving $\pi (t)$ , we first note that by Lemma 2.8, for any choice of $\delta>0$ , there exist arbitrarily large values of x such that
for some positive constant $K>0$ . For such values of x, we then have by Lemma 2.3 that
The integral in (5.1) satisfies
Thus, if we take any choice of $\delta <\omega -1/2$ when $c\leq 3/2$ , and $\delta <1+\omega -c$ when $3/2<c<1+\omega $ , we have
for arbitrarily large values of x as required. The same reasoning holds for the integral over $(\theta (t)-t)/t^c$ using the corresponding bounds for $\theta (t)$ in Lemmas 2.3 and 2.8.
6 Discussion and further work
The general idea in this paper was to consider averaged versions of arithmetic functions in order to gain insight into biases occurring in number theory. The functions $\pi (t)-\operatorname {\textrm {li}}(t)$ and $\theta (t)-t$ , in particular, exhibit an apparent negative bias, and our results reflect this.
There are many other biases occurring in number theory, and it would be interesting to consider averaged versions of these. For example, we have:
-
(a) The bias in Mertens’ theorems [Reference Büthe5, Reference Lamzouri15].
-
(b) The Chebyshev bias for primes in arithmetic progressions [Reference Granville and Martin10, Reference Rubinstein and Sarnak23].
-
(c) The bias of $\lambda (n)$ and related functions [Reference Humphries11, Reference Martin, Mossinghoff and Trudgian17].
One could also attempt to extend our results to more general number fields. In this direction, it is worth noting that Garcia and Lee [Reference Garcia and Lee9] recently proved explicit versions of Mertens’ theorems for number fields. Using Garcia and Lee’s results could thus allow one to generalize Theorem 1.3, whose proof followed directly from an explicit version of Mertens’ theorems in the standard setting.
Acknowledgment
Thanks to my supervisor Tim Trudgian and colleagues Ethan, Michaela, and Shehzad for the fun and fruitful discussions on this project.