1. Introduction
A classical problem in analytic number theory is to find explicit bounds for the Riemann zeta-function. In particular, bounds on the line $\mathrm {Re}\,{s}=1$ are of great interest, owing to their usefulness in estimations for the Möbius function and the von Mangoldt function. The main purpose of this paper is to obtain new bounds for the Riemann zeta-function in ranges where currently it is challenging to get computational verification.
1.1. Background
Let $\zeta (s)$ be the Riemann zeta-function. Unconditionally, it is known that, as $t\to \infty $ ,
Currently, the best explicit bounds for $1/\zeta (1+it)$ and $\zeta '(1+it)/\zeta (1+it)$ are given by
for $t\geq 133$ . The first bound in (1.2) was established by Carneiro et al. in [Reference Carneiro, Chirre, Helfgott and Mejía-Cordero2, Proposition A.2], and the second bound was established by Trudgian in [Reference Trudgian15]. There are improvements in the orders of magnitude of the mentioned estimates (see, for example, [Reference Titchmarsh14, page 135]), but it appears that those bounds are better when t is astronomically large and then they will not be useful for computational purposes.
On the other hand, assuming the Riemann hypothesis (RH), Littlewood proved in [Reference Littlewood7] that, as $t\to \infty $ ,
where $\gamma $ is the Euler–Mascheroni constant. An explicit version of this result has been given by Lamzouri et al. [Reference Lamzouri, Li and Soundararajan6, page 2394], establishing that
for $t\geq 10^{10}$ . Moreover, recently, Chirre et al. [Reference Chirre, Simonič and Valås Hagen3, Theorem 5] proved under RH that
for $t\geq 10^{30}$ . Some generalisations of these estimates for families of L-functions can be found in [Reference Lumley8, Reference Palojärvi and Simonič10].
1.2. Bounds for zeta under partial RH
We are interested in obtaining bounds for the Riemann zeta-function, but assuming only a partial verification of RH. For $T>0$ , we say that RH is true up to height T if all nontrivial zeros $\rho =\beta +i\gamma $ of $\zeta (s)$ such that $|\gamma |\leq T$ satisfy $\beta =1/2$ . The best current result of this type is given by Platt and Trudgian [Reference Platt and Trudgian12] who verified numerically, in a rigorous way using interval arithmetic, that RH is true up to height $T=3\cdot 10^{12}$ .
Theorem 1.1. For a fixed $\delta $ with $0<\delta <1$ , define
Assume RH up to height $T\geq 10^9$ . Then, for $10^6\leq t\leq (1-\delta )T$ ,
and
From Theorem 1.1, we can also derive explicit versions of (1.1) in a finite but large range where computational verification is difficult. In fact, by Platt and Trudgian’s result, we can take $T=3\cdot 10^{12}$ and, letting $\delta =10^{-5}$ , it follows unconditionally that
for $10^6\leq t\leq 2.99997\cdot 10^{12}$ . This improves (1.2) in the range $10^6\leq t\leq 2.99997\cdot 10^{12}$ .
We mention that (1.5) is derived from an upper bound for $|\!\log \zeta (1+it)|$ (see (3.4)), which allows us to deduce that
Currently, the best unconditional explicit bound for $\zeta (1+it)$ is given by Patel, who proved in [Reference Patel11, Theorem 1.1] that, for $t\geq 3$ ,
So, (1.6) improves (1.7) if RH is verified up to height T for T sufficiently large.
The proof of Theorem 1.1 is carried out in Section 3 and partly follows the conditional proofs of [Reference Montgomery and Vaughan9, Section 13.2]. Here, an explicit formula is used that relates the zeros of $\zeta (s)$ and the prime numbers. This formula is unconditional and contains a certain sum involving the nontrivial zeros. Assuming RH, this sum is bounded without much effort. In our case, the novelty is in bounding the contribution of the nontrivial zeros, since we only assume RH up to height T. We split this sum into two parts, the zeros with ordinates $|\gamma |\leq T$ and $|\gamma |>T$ , and analyse them separately. These sums are studied in Section 2. The proof of Theorem 1.1 is short, and the constants involved can be improved slightly.
Throughout the paper, we use the notation $\alpha =O^*(\beta )$ , which means that $|\alpha |\leq \beta $ .
2. The sum over the nontrivial zeros
To bound the sum related to the nontrivial zeros of $\zeta (s)$ with ordinates $|\gamma |\leq T$ , we use the following lemma.
Lemma 2.1. Assume RH up to height $T>0$ . Then, for $t\geq 10^6$ and $1\leq \alpha \leq 3/2$ ,
Proof. Letting $s=\alpha +it$ and using the fractional decomposition of $\zeta (s)$ (see [Reference Montgomery and Vaughan9, Corollary 10.14]), we get
From the bound
(see [Reference Helfgott4, Lemma 3.11, page 67]), it follows that
On the other hand, splitting the sum over the zeros and using the fact that $\mathrm {Re}\,\rho <1$ , we get
By combining (2.1) and (2.2), we arrive at the desired result.
To bound the sum related to the nontrivial zeros of $\zeta (s)$ with ordinates $|\gamma |>T$ , we use the auxiliary function
where t does not coincide with an ordinate of a zero of $\zeta (s)$ . This function measures, in a certain sense, the difference between the bounds under RH up to height T and the bounds under RH. In fact, for a fixed $t\geq 0$ , we see that
To estimate $E(t,T)$ , the parameter t must not be close to the ordinates of the zeros, and we need to take T sufficiently large to reduce the contribution. Here, we bound this term using a sum studied by Brent, Platt and Trudgian in [Reference Brent, Platt and Trudgian1].
Lemma 2.2. Fix $0<\delta <1$ and $T\geq 10^9$ . Then, for $0\leq t\leq (1-\delta )T$ ,
where $E_\delta (T)$ was defined in (1.3).
Proof. Since $t\leq (1-\delta )T$ , we find that
By [Reference Brent, Platt and Trudgian1, Theorem 1 and Example 1],
where the prime symbol $'$ indicates that if $\gamma =T$ , then it is counted with weight $1/2$ . Thus,
Hence, using $T\geq 10^9$ concludes the proof.
3. Proof of Theorem 1.1
3.1. Bounding $\zeta '(s)/\zeta (s)$
Assume that RH is true up to height $T\geq 10^9$ . Let ${t\geq 10^6}$ and $1\leq \alpha \leq 3/2$ . Given $x, y \geq 2$ and $s=\alpha +it$ , the unconditional formula [Reference Montgomery and Vaughan9, Equation 13.35] states that $\zeta '(s)/\zeta (s)$ is equal to
where $w(n)$ is the function defined in [Reference Montgomery and Vaughan9, page 433] satisfying $|w(n)|\leq 1$ . We bound each term of (3.1). Since $|(xy)^{\rho -s}-x^{\rho -s}|\leq x^{\mathrm {Re}\,{\rho }-\alpha }(y^{\mathrm {Re}\,{\rho }-\alpha }+1)$ and $\mathrm {Re}\,{\rho }<1$ ,
from the assumption that $10^6\leq t\leq (1-\delta )T$ and Lemmas 2.1 and 2.2. We estimate the next terms in (3.1) trivially as
and
Inserting these bounds in (3.1), we arrive at
Now, let $\lambda _0=1.2784\ldots $ be the point where the function $\lambda \mapsto (1+e^\lambda )/\lambda $ reaches its minimum value $\mathcal {A}_0=3.5911\ldots $ in $(0,\infty )$ . Take
Note that
Therefore, we get
where $\epsilon (\alpha ,t)$ is defined as
3.2. Bounding $\zeta '(1+it)/\zeta (1+it)$
Letting $\alpha =1$ in (3.2), it follows that
To bound the sum over the primes in the above expression, we use the estimate (see [Reference Johnston, Ramaré and Trudgian5, Lemma 10])
Finally, using $t\geq 10^6$ , we arrive at (1.4).
3.3. Bounding log $\zeta (1+it)$
By the fundamental calculus theorem,
Since $|\!\log \zeta (\tfrac {3}{2}+it)|\leq \log \zeta (\tfrac {3}{2})$ , we obtain
To bound the right-hand side of this inequality, we use $\epsilon (\alpha ,t)\leq \epsilon (1,t)$ in $1\leq \alpha \leq 3/2$ and integrate (3.2) from $1$ to $3/2$ to obtain
where we have used $-\mathcal {A}_0/(4\log t\log \log t)+1.6/t^2<0$ . Furthermore, since
we have
for $t\geq 10^6$ . This implies that
To bound the sum over the primes, we use [Reference Rosser and Schoenfeld13, Equation (3.30)] to see that, for $x>1$ ,
Inserting this in (3.3), we arrive at
Thus,
Taking exponentials in this inequality and using the estimate $e^x\leq 1+x+0.8093x^2$ for $0\leq x\leq 1.297$ , we obtain
Since $\log |\zeta (1+it)|^{-1}\leq |\!\log \zeta (1+it)|$ and $\log |\zeta (1+it)|\leq |\!\log \zeta (1+it)|$ , we deduce (1.5) and (1.6), respectively.
Acknowledgement
I am grateful to Harald Helfgott for encouraging me in this project and for helpful discussions related to the material in this paper.