Explicit estimates for the Riemann zeta function close to the -line
Abstract
We provide explicit upper bounds of the order for and when is close to . These improve existing bounds for on the -line.
1 Introduction
In the study of the Riemann zeta function and related functions, one often requires upper bounds for the logarithmic derivative of and the reciprocal of . The Chebyshev function , where is the von Mangoldt function, or , where is the Möbius function are particularly relevant examples of where these estimates are useful. To estimate either with Perron’s formula, we use the fact that
(1) |
for (see e.g. [18], [2], [3], [16, (3.14)] for more detail).
Trudgian [18] gave explicit upper bounds of the order for both functions in (1) (see also [10, Theorem 6.7]). These estimates are especially notable because they are valid inside the critical strip (), but only within known zero-free regions. Because of this, the constants had to be sufficiently large to bound the functions as , which would happen as approaches the boundary of the zero-free region. As such, the problem of improving these explicit constants is extremely non-trivial, and explicit estimates heavily depend on explicit zero-free regions.
The recent work of Yang [20] establishes a Littlewood-type zero-free region (see Lemma 4), which is the largest known region for . With this, Hiary, Leong and Yang [6] gave bounds on and of the order on the -line, which are the first explicit bounds of this type. The goal of this article is to improve and extend their results inside the critical strip.
2 Main results
The following four corollaries are the new estimates we prove in Sections 4 and 5. They are the first explicit bounds of this order inside the critical strip, and also improve current bounds at . On the -line, Corollary 2 improves [6, Theorem 2], and Corollary 4 improves [6, Theorem 2] for , and [1, Proposition A.2] for .
Throughout this article, we denote the height to which the Riemann Hypothesis has been verified [12] by .
Corollary 1.
Corollary 2.
Corollary 3.
Corollary 4.
Furthermore, with the restriction , the range of can be extended. In other words, for we have
3 Some preliminaries
This section contains the lemmas and theorems used to prove our main results. The first two lemmas, which form the basis of our method, are built upon a theorem of Hadamard, Borel and Carathéodory, sometimes also referred to as the Borel–Carathéodory theorem. This theorem enables us to deduce an upper bound for the modulus of a function and its derivatives on a circle, using bounds for its real part on a larger concentric circle.
Theorem 1.
[6, Theorem 4][Borel–Carathéodory] Let be a complex number, and let be a positive number possibly dependent on . Suppose that the function is analytic in a region containing the disc . Let denote the maximum of on the boundary . Then, for any and any such that ,
If in addition , then for any and any such that ,
Lemma 1.
[6, Lemma 5] Let be a complex number, and let and be positive numbers (possibly depending on ) such that . Suppose that the function is analytic in a region containing the disc . Suppose further that there is a number independent of such that
for . Then, for any in the disc we have
where runs through the zeros of in the disc , counted with multiplicity.
Lemma 2.
[6, Lemma 6] Let and be complex numbers with real parts and , respectively. Let , , , and be positive numbers, possibly depending on , such that and . Suppose that the function satisfies the conditions of Lemma 1 with , and , and that
Suppose, in addition, that for any in both the disc and the right half-plane . Then, for any in the disc ,
Theorem 2.
Let be an integer and . Then for all ,
Proof.
Lemma 3.
Let for real . Choose real parameters and such that
Also define
Then for every , all , and we have
where and
(2) |
We give some admissible values of and in Table 1.
Proof.
We use the bound for given in Theorem 2. The Phragmén–Lindelöf Principle can be used to show that a bound on of the form in Theorem 2 holds for for any real and integer . We refer to the statement of the principle in [17, Lemma 3] (or [19, Lemma 2.1]), in which we consider . As the lower bound on implies , we can take to satisfy the condition in [17, (4.1)] with , , , , , , , and . This choice of comes from separately checking and . First, we can numerically verify
both for , noting that the bound for follows from
the maximum occurring at and . Second, it can be seen that
for and , and lastly
for and . Then, by [17, Lemma 3] we have
(3) |
for and , where is defined in (2).
From here we can use the proof of Titchmarsh’s Theorem 5.17 [15]. Let
where is chosen such that we have for all . This implies
(4) |
with as defined in the statement of the lemma.
The bound in (4) indicates that since (3) holds for , it also holds for
The expression for also implies
so (3) becomes
where is in (2). For specific , we can find a that minimises , then find the smallest that permits our choice of for all . It is then possible to compute and . This allows us to compute the values in Table 1 mentioned in the statement of the lemma. ∎
We can compare this result to that of Hiary, Leong and Yang [6, Lemma 7], derived using a Richert-type bound for by Ford in [4]. For instance, in the range and , we have
whereas [6, Lemma 7] has
Lemma 4.
[20, Corollary 1.2] There are no zeroes of in the region
Lemma 5.
[14, Lemma 5.4] Let denote Euler’s constant. For we have
Theorem 3.
[6, Theorem 1] For we have
Lemma 6.
Let and be real numbers such that , and let be a holomorphic function in the strip such that it satisfies the growth condition
for some and . Suppose further that
(5) |
where and where . Then throughout the strip , one has
Proof.
This is derived in a similar way to Lemma 3 of [17]. Trudgian’s lemma is an adaption of a theorem from Rademacher on a generalisation of the Phragmén–Lindelöf theorem [13, §33]. The Phragmén–Lindelöf theorem [13, §29] is applied to a function , to which Trudgian adds a factor of , to use the theorem for bounds on that have a factor of .
We will make a similar change to Rademacher’s theorem. However, instead of a factor of , we will include a factor of to form the function
where is defined in [17, Lem. 2]. We also include the restriction to ensure that is holomorphic in the strip . The proof then proceeds as in [17, Lemma 3] and [13, §32]. ∎
Lemma 7.
For with , and , we have
where
Admissible values of are given in Table 2 for specific and optimized .
Proof.
This is similar to the proof of Lemma 3. We take in Lemma 6 and bound in for . Note that is entire in this strip, and satisfies the growth condition given by Rademacher or [17, Lemma 3].
We will need two bounds on to verify the condition in (5): one for and one for . The latter is relatively simple to derive, as we can use , which is true for all and computable. For the other bound we use Theorem 3.
Lemma 8.
Let be real positive parameters, , be Euler’s constant, and be defined as in Lemma 7. Then for and all , we have
where
(6) |
In addition, for such that and , we have for that
where
(7) |
Proof.
Since , we use the classical non-negativity argument involving the trigonometric polynomial (see [16, § 3.3]). That is, we use , which implies
(8) |
Taking in the above gives
(9) |
These two factors can be bounded with Lemmas 5 and 7. First consider . In this range, is decreasing. Hence, we have
Applying these bounds in Lemmas 5 and 7, and then (9), we find
4 Bounding
In this section, we use the lemmas in the previous section to bound . We follow the argument of [18], which gives an explicit version of results in [16, §3]. This has been done in [6] to obtain bounds for and on the -line, and we now extend these results to hold within a zero-free region. The method is identical to that of [6], but uses sharper bounds on , and a more careful handling of constants to obtain some savings. Given this, we will only give an outline of how to obtain such bounds, defining the functions with the same notation, but omitting details. The reader is referred to [6] for a full elucidation on the proof, especially on justification of certain parameter choices.
As before, we construct concentric discs, centred just to the right of the line , and extend them slightly to the left and into the critical strip. We aim to apply Lemmas 1 and 2 with .
Let and be constants. The centre of the concentric discs will be denoted by
where is a real positive constant to be chosen later. Notice that is decreasing for , and is at most . Also, let and be positive parameters chosen such that , which will be satisfied if
(10) |
Let be a complex number. Aiming to apply Lemma 1 in the disc , we first seek a valid in that disc. Similarly, for Lemma 2, we seek a valid at the disc centre . In applying Lemma 2, we also need to ensure that the non-vanishing condition on is met, which we do with a zero-free region.
First, let
(11) |
where is defined in Lemma 3. Then, by the same lemma, for each and any , we have
(12) |
with and given in Table 1.
For our purposes, we choose a radius of
(13) |
To ensure the constraint (10) is met for all , we need
(14) |
as reaches a maximum of at . This choice of also requires Lemma 3 to be applicable for up to , which corresponds to
This will be satisfied for all for
and the values of in Table 1 satisfy this condition.
To fulfil the bounding condition of Lemma 1, we can take either lower bound for from Lemma 8, and use a constant
(15) |
where and are always taken such that . With this, by (12) and (13), throughout the disc we have
Noting that is decreasing in , we obtain that throughout ,
(16) |
where .
Next, we fulfill the zero-free condition of Lemma 2 by way of the zero-free region in Lemma 4, where for ,
(17) |
This leads to the following choice of
(18) |
where
(19) |
to keep , and we require
(20) |
to satisfy the constraint in Lemma 1.
To determine , we utilise [5, Lemma 70.1], which states that for ,
(21) |
Taking in this inequality leads to
Finally, we turn to the choice of in Lemma 2. From here on, we differ from [6] as we want the circles to be able to extend into the zero-free region. For any results from Lemma 2 to be meaningful to us, we want the left-most point of to lie between the zero-free region and not exceed the -line. In other words, we want , which means must satisfy
(22) |
Up to this point, Lemma 2 holds for
For larger , we will just use (21). To finish, observe that is decreasing in , so we can substitute to arrive at the following lemma.
Lemma 9.
Let , , , and be constants satisfying the constraints (14) and (20). Let (subject to (22)) and (defined in (19)) be chosen such that , where . Then, for and
we have
where
with
The constant is defined in Lemma 3, is defined in (16) and depends on , is defined in (11) and depends on and , and is defined in (15) and depends on and .
4.1 Computations
Proof of Corollary 1.
Although we can use Lemma 9 with , we can reduce the size of by computing it for , the height to which the Riemann Hypothesis has been verified in [12], and combining it with a result for . Over the latter range, we know there are no zeros of with . We can therefore use a wider zero-free region than in Lemma 4 when verifying the condition in Lemma 2. Since
for all , we can replace with any in (17) as long as it fulfils (20). Given (19), we see that (20) is satisfied by
(23) |
since for all . When optimising over to calculate for , we consistently found an optimal . Hence, we will assume , which, along with and , gives us that the right-hand side of (23) is
by Table 1. Therefore, we can choose any for the range of values .
Although a larger would mean we have a larger zero-free region, taking it too large can have an adverse effect on the parameter . Smaller reduces , which means a better bound in Lemma 2, and hence in Lemma 9. However, larger means we can take smaller to satisfy the expression for , which leads to a smaller value for in Lemma 9.
Starting by fixing a value for , we compute in the range by optimising over , , and , subject to the constraints of Lemma 9, and using as in (17). We similarly obtain in the range , but instead optimise over , , , and . We also require the result to hold for
which leads to replacing the condition in (22) with
Finally we take the maximum of the two results, which is an admissible over all . This value is in Corollary 1. In Table 3, we opt to use the smallest that makes the over the smallest of the two . For we use for all entries up to and including ; for we use , and for all larger we use . ∎
In addition, we have Corollary 2, especially relevant for .
5 Bounding
Moving from a bound on the logarithmic derivative of to one on the reciprocal of is done in the same way as [6, Lemma 10]. In essence, a bound on the latter depends on a bound for the former in some range of . We are able to make some savings by using multiple bounds for across the desired range, using corresponding pairs of from Tables 3 and 4.
Lemma 10.
Proof.
Let . We will split the proof into three cases: , , and . First see that in the range we have
(25) |
Writing , we can split the integral and rewrite it as
By Corollary 2 and the assumption in the lemma we have
We therefore have, from (5),
(26) | ||||
Corollary 3 follows from Lemma 10 by computing for specific choices of and , and optimizing over and . These computed values of are labelled .
Proof of Corollary 3.
After choosing , we aim to minimise by optimising over and . This requires choosing , which corresponds to the number of values. Using more will give a better result, but the improvements eventually become negligible, as is largely determined by the initial few .
For computations, we only used values for from Table 3 (Corollary 1). This meant that using , for instance, would only be valid for . On the plus side, larger meant we could also use smaller from Corollary 2. With these factors in mind, we chose to compute two results for a selection of , one for the largest possible range, and the other for the smallest achievable constant. This meant that computing for and , for instance, only used the entries of Table 3 for . Computing for , however, allowed us to use all available greater than the one chosen.
For , we can take . Other values of are listed in Table 5 for the specified , and we note that all results for had the same approximate optimal alongside the stated , and the results for all had and . ∎
If we only consider the case it is possible to reduce . This is done in Corollary 4. This result is especially useful for bounds on the line .
Proof of Corollary 4.
The proof follows the same method as Lemma 10, but in the case , we only need the following bound in (5),
This simplifies , replacing the third case in (24) with
We can now fix and optimise over using the values of in Table 4.
For the second assertion of the corollary, Carneiro, Chirre, Helfgott, and Mejía-Cordero verify, using interval arithmetic in the proof of Proposition A.2 [1], that
for . This can then be used in conjunction with the result for . All that remains is to check that
holds for . ∎
6 Discussion
Using the methods of this paper, the main obstruction to obtaining better bounds on and is the width of the zero-free region. Lemmas 1 and 2 rely on the Borel–Carathéodory theorem (Theorem 1), which, in the setting of a general function , already has the best possible constant (see [9, §5] for a discussion). Thus, to get improvements, one would have to input additional information on the specific function used. For example, in Lemmas 1 and 2 we use information on the zero-free region of , so one could utilise more information to do better.
Because we sought bounds of the form rather than , we were restricted by the bound on in the region . The width of this region hampers us in a similar fashion to the width of the zero-free region, so improving is another possibility.
We conclude with a discussion on the trigonometric inequality (8) used in the proof of Lemma 8. When bounding for close to and above 1, (8) is superior to the trivial bound if
(27) |
The validity of this inequality is not obvious, as the left-hand side of (27) decreases to as , but the right-hand side can be trivially bounded: . However, if this trivial bound is replaced by a bound depending on , then having sufficiently large on the right-hand side of (27) will prevent the bound from approaching infinity as . Indeed, when using Lemma 7 to bound (8) over , we have
for . In contrast, for (with defined as in the proof of Lemma 10) we would have
Thus (27) is true for , and our optimised always fell in this range.
Notice that in Lemma 7 depends on, and also tends to, the constant in Theorem 3 (as gets large). Unfortunately, an increase or decrease in this constant has a minimal impact on our main results, since our main constants are quite large. Thus, even though Lemma 8 offers a bound better than trivial, one would be better served seeking improvements from other avenues like the ones mentioned at the beginning of this section, for more substantial savings.
Another interesting point is that the conditions for trigonometric inequalities like (8) to give good bounds on for differ from the conditions needed for good zero-free regions. For instance, when dealing with the latter, one requires a non-negative trigonometric polynomial
(28) |
where , with each coefficient non-negative, to state a few conditions (see [8], [11], for more information). However, for the criteria is to have the sum of all coefficients in the polynomial , with . This condition is to ensure the overall bound is of the desired order. To illustrate this, if we had used a polynomial in the proof of Lemma 8 with , for any , then we would have ended up with a factor of instead of .
The natural question to ask is if one could do better with a different choice of inequality than (8) when bounding . This is equivalent to asking for (28) with , while at the same time satisfying our new criteria. We briefly did a search for such polynomials of higher degree, to no avail. Although there have been many trigonometric polynomials found in the arena of refining zero-free regions, none of these fit our stated new criteria while also improving on . We hypothesise that no better polynomials exist. Certainly for a degree- polynomial of the form
(which is the prequel to (8)), it is easily seen that to fulfil our new criteria, one needs . Thus the only option is , and so (8) is the best possible in this situation.
References
- [1] E. Carneiro, A. Chirre, H. A. Helfgott, and J. Mejía-Cordero, Optimality for the two-parameter quadratic sieve, Acta Arith. 203 (2022), no. 3, 195–226.
- [2] K. A. Chalker, Perron’s formula and resulting explicit bounds on sum, 2019, MSc Thesis — University of Lethbridge.
- [3] A. W. Dudek, An explicit result for primes between cubes, Funct. Approx. Comment. Math. 55 (2016), no. 2, 177–197.
- [4] K. Ford, Vinogradov’s integral and bounds for the Riemann zeta function, Proc. London Math. Soc. 85 (2002), no. 3, 565–633.
- [5] R. R. Hall and G. Tenenbaum, Divisors, Cambridge Tracts in Math., vol. 90, Cambridge University Press, Cambridge, 1988.
- [6] G. A. Hiary, N. Leong, and A. Yang, Explicit bounds for the Riemann zeta-function on the 1-line, arXiv preprint arXiv:2306.13289 (2023).
- [7] G. A. Hiary, D. Patel, and A. Yang, An improved explicit estimate for , J. Number Theory 256 (2024), 195–217.
- [8] V.P. Kondrat’ev, Some extremal properties of positive trigonometric polynomials, Mathematical Notes of the Academy of Sciences of the USSR 22 (1977), no. 3, 696–698.
- [9] V. Maz’ya and G. Kresin, Sharp real-part theorems: A unified approach, Springer Berlin, Heidelberg, 2007.
- [10] H. L. Montgomery and R. C. Vaughan, The large sieve, Mathematika 20 (1973), 119–134.
- [11] M. J. Mossinghoff and T. Trudgian, Nonnegative trigonometric polynomials and a zero-free region for the Riemann zeta-function, J. Number Theory 157 (2015), 329–349.
- [12] D. Platt and T. Trudgian, The Riemann hypothesis is true up to , Bull. Lond. Math. Soc. 53 (2021), no. 3, 792–797.
- [13] H. Rademacher, Topics in Analytic Number Theory, Ergebnisse der Mathematik Und Ihrer Grenzgebiete, Springer Berlin, Heidelberg, 1973.
- [14] O. Ramaré, An explicit density estimate for Dirichlet -series, Math. Comp. 85 (2016), no. 297, 325–356.
- [15] E. C. Titchmarsh, The Theory of Functions, Oxford University Press, New York, 1939.
- [16] , The Theory of the Riemann zeta-function, Oxford University Press, New York, 1986.
- [17] T. Trudgian, An improved upper bound for the argument of the Riemann zeta-function on the critical line II, J. Number Theory 134 (2014), 280–292.
- [18] , Explicit bounds on the logarithmic derivative and the reciprocal of the Riemann zeta-function, Funct. Approx. Comment. Math. 52 (2015), no. 2, 253–261.
- [19] , Improvements to Turing’s method II, Rocky Mountain J. Math. 46 (2016), no. 1, 325–332.
- [20] A. Yang, Explicit bounds on in the critical strip and a zero-free region, J. Math. Anal. Appl. 534 (2024), no. 2, 128124.