An improved explicit estimate for
Abstract.
An explicit subconvex bound for the Riemann zeta function on the critical line is proved. Previous subconvex bounds relied on an incorrect version of the Kusmin–Landau lemma. After accounting for the needed correction in that lemma, we recover and improve the record explicit bound for .
1. Introduction
An important type of inequality in analytic number theory is upper bounds on the exponential sum for some smooth phase function . Suppose that is monotonic and for some and throughout . One would like to derive inequalities of the form , where is a constant. Among other applications, such results are used to derive explicit upper bounds for .
Kusmin [Kuz27, p. 239] writes that inequalities for were first introduced by Vinogradov in 1916. According to Landau [Lan28, p. 21], van der Corput was the first to prove a bound on depending only on , independent of the length of the interval . Using results in [Cor21, p. 58] and [Lan26, p. 221], which rely on the Poisson summation formula, it follows easily that is admissible. Kusmin [Kuz27, p. 237] gave a geometric argument to improve this to . He then immediately noted that it follows from his proof that is also admissible. Landau [Lan28, p. 21] refined the Kusmin bound to and constructed examples for which the equality holds.
In [CG04, Lemma 2], the bound was derived. Unfortunately, this bound misses an extra factor of , i.e. the leading constant in the bound should be instead of . This was recently pointed out by K. Ford and also discussed in a preprint by J. Arias de Reyna. Indeed, Kusmin [Kuz27, p. 237] and Landau [Lan28, p. 21] had shown that is sharp. Therefore, there is no hope of recovering the constant in [CG04, Lemma 2] in the general case, but only in special (though important) cases such as when is linear.
The incorrect constant has impacted all published explicit subconvex bounds on . In particular, the bound in [Hia16, Theorem 1.1] is affected. This bound relied on an explicit process (from the method of exponent pairs) that is derived in [CG04, Lemma 3]. In turn, this explicit process relied on the version of the Kusmin–Landau lemma in [CG04, Lemma 2] from which the incorrect constant arises. After accounting for the correct constant in the Kusmin–Landau lemma, the constant in [Hia16, Theorem 1.1] increases substantially to . In other words, the revised bound becomes for .
Since the missing factor of in [CG04, Lemma 3] is sizeable and the method of proof in [Hia16] is already optimized, our savings had to come in small quantities from multiple places.
We specialize the phase function to our specific application of bounding zeta, and derive better explicit and processes in lemmas 2.5 and 2.6, as well as a generalized Kusmin-Landau lemma in Lemma 2.3.
Moreover, we are exceedingly careful in treating boundary terms in the explicit and processes we derive. Boundary term may be all that arises in the intermediate region where is too large for the Riemann–Siegel–Lehman bound to be useful, but too small for the asymptotic savings from the and processes to be realized. This intermediate region (bottleneck region) is the subject of subsection 3.3.
Also, our treatment for large improves on [Hia16] in one important aspect that enables reducing the coefficient of considerably, as detailed at the end of subsection 3.4.
Put together, our main result is to recover and improve the constant .
Theorem 1.1.
For , we have
Note that if one employs the Riemann–Siegel–Lehman bound for any range of at all, then the leading constant cannot break . The constant we obtain is not too far from this barrier.
1.1. Notation
Throughout this work let denote the distance to the integer nearest to , i.e. . We write .
2. Required lemmas
Lemma 2.1.
If and , then
where .
Proof.
One starts with the Riemann–Siegel formula, and applies the triangle inequality to the main sum and to the Gabcke remainder term, bounding the latter by . See Lemma 2.1 in [Hia16]. ∎
Lemma 2.2 (Riemann-Siegel-Lehman bound).
If , then
Proof.
Lemma 2.3 (Generalised Cheng-Graham lemma).
Let be a real-valued function with a monotonic and continuous derivative on , satisfying
for some and some integer . Then,
Proof.
Lemma 2.4 (Weyl differencing).
Let be a real-valued function and and positive integers. Then
where if , then
and if , then .
Proof.
Lemma 2.5 (Improved second derivative test).
Let be positive integers, and let and be a positive numbers. Suppose and . Let
So, by construction,
For each positive integer , and each positive integer ,
where
If or , then the sum on the left-side is zero and the bound still holds.
Proof.
See Section 5. ∎
Remark.
Lemma 2.6 (Improved third derivative test).
Proof.
See Section 6. ∎
Remark.
Versions of these derivative tests for a general phase function, as well as several other derivative tests, can be found in [Pat ̵p].
3. Proof of Theorem 1
We divide the proof into four regions.
3.1. Proof for
In this range we rely on the interval-arithmetic computations carried out in Hiary [Hia16], which established
for .
3.2. Proof for
For this region we use the Riemann-Siegel-Lehman formula combined with the triangle inequality. Firstly, in preparation for using Lemma 2.2, we note
This can be seen by verifying that the difference of the two sides is unimodal (monotonically increasing then monotonically decreasing), and so it suffices to check that the difference is positive at the endpoints and . Hence, our main theorem follows from Lemma 2.2 for that range of .
Assume now that . We follow a similar argument to Lemma 2.3 in [Hia16]. By Lemma 2.1,
where and, in this subsection, . Next, we observe that if is a real-valued function such that for , then by Jensen’s inequality
(3.1) |
Therefore, using and the fact that ,
However, , so
for . One need verify the last inequality at the endpoints and since the difference of the two sides is monotonic in between.
3.3. Proof for
In this range of we use the following modified third-derivative test in Lemma 2.6.
Throughout this subsection, let be an integer and be a constant, both to be chosen later. Furthermore, let
Also, let , to be chosen later, and suppose . By Lemma 2.1, we have
where
Define
Then, noting that , and following the arguments in Hiary [Hia16],
(3.2) |
for all . Meanwhile, by partial summation,
(3.3) |
So, since ,
(3.4) |
it follows
We apply Lemma 2.6 with to obtain for any ,
(3.5) | ||||
(3.6) |
where , , , , and are defined in Lemma 2.6.
Using the same trick with the Jensen inequality as in the previous section, we observe that
(3.7) |
where the inequality follows from using in (3.1). In addition,
(3.8) |
for , and
hence
where
Next, let
Since and , we have
(3.9) |
and
(3.10) |
Therefore,
(3.11) |
We apply the above inequalities to (3.6), together with the inequality
to obtain
(3.12) |
We observe since is monotonically decreasing with , is decreasing with . Since, in addition, is monotonically increasing with , and are both decreasing with . Denoting the values of , and at by , and , we see that , and . Therefore, using (3.7) and the subsequent estimates, we obtain
(3.13) |
where, as we also have and , may be taken to be
(3.14) |
Explicitly, combining with (3.2), yields
where,
(3.15) |
We choose , , and . This choice of is valid since it satisfies . Also, in view of the chosen values for and , the inequality , for , is valid. We use this inequality to simplify the bounds for and , considering they are both monotonically decreasing with . Together, we obtain
Similarly, choosing , , and , we obtain
Finally, choosing , , and , we obtain
hence the desired result holds for .
3.4. Proof for
For the region we use a similar method as the previous subsection, but with . Analogously to before, let , , and, this time, let . Suppose .
We bound differently, by splitting the square root in (3.6) as follows. Let
(3.16) |
so that, recalling (3.6), we have
(3.17) |
Substituting into (3.11), and noting that and , we deduce
(3.18) |
Next, using the definition of , and since , and ,
(3.19) |
Furthermore, using , valid for any nonnegative numbers and , and combining (3.16), (3.18) and (3.19), as well as the observation and which follows by the same reasoning as in subsection 3.3, we thus see
(3.20) |
where
We execute the sum over using (3.7) and (3.8). To bound the resulting terms, we appeal to the estimate
valid for , and implying that
(3.21) |
in that range of . Note, in addition, that . Therefore, combined with (3.21) we obtain
(3.22) |
where
(3.23) |
Using this together with (3.20), it follows on recalling (3.17) that
(3.24) |
for .
Finally, combining (3.24) and (3.25), we arrive at
where
Choosing and , and using the inequality to remove remaining dependence of and on , yields
as required.
We point out one of main reasons for the improvement over [Hia16] obtained in this subsection. After we invoke the explicit process from Lemma 2.6 to arrive at (3.5), we pay greater attention to the cross term . Specifically, we arrange for this cross term to contribute to the coefficient of in the overall bound in (3.24), rather than to the coefficient of , as done in [Hia16]. This saves a factor of from the contribution of this term, which is a considerable saving.
4. Proof of Lemma 2.3
The proof proceeds similarly to Lemma 2 in [CG04] and Lemma 2.1 in Patel [Pat ̵p], with only a few differences. We include the complete proof here for convenience.
Let be a function satisfying the conditions of Lemma 2.3, that is, has a continuous and monotonic derivative on and
(4.1) |
for some and some integer . We may assume that , i.e. that , since
We may also assume that is increasing, since we may replace with without changing the magnitude of the sum.
Now, define . Since by assumption is increasing in over , over . Therefore, is increasing in over that interval. Furthermore, by the mean-value theorem, for some . Therefore,
(4.2) |
for every . Thus, for instance, over .
Next, let
(4.3) |
so that
(4.4) |
and also
(4.5) |
Let . If is not an integer, let . If is an integer, let . In either cases, the summation over is the same as the summation over , and is increasing in .
Suppose that , so there is only one term in the sum. Then, by the trivial bound, we have
(4.6) |
Here we use the fact that the condition (4.1) implies that , so by the inequality of harmonic and arithmetic means,
(4.7) |
Therefore, the result of the lemma follows when .
Next, suppose . By (4.4), and after a few rearrangements,
Note that if , then the last sum is empty and should be interpreted as equal to 0. Now, since is increasing in , is decreasing in over the same interval. Hence, by (4.5),
for . Therefore,
(4.8) | ||||
(4.9) | ||||
(4.10) | ||||
(4.11) | ||||
as required. Going from (4.9) to (4.10), we combined the various terms using the formulas and , valid for . In (4.11) we used the monotonicity of and over . In the last line we used the inequalities and , valid for . Lastly, we note that passing from (4.8) to (4.9) presents no difficulty if since in this case.
5. Proof of Lemma 2.5
We divide the summation interval into about suitable subintervals, chosen so that we may apply the generalized Cheng–Graham Lemma 2.3 on about half of the subintervals and the trivial bound on the remaining half. The special form of allows a sharper bound on , so that in the definition of in Lemma 2.5 the contribution of can be reduced to . Moreover, we adjust the definition of the boundary subintervals (determined by and below) to further reduce the number of sub-intervals in the sum. Recall that is a positive integer, , and where is an integer. We will use the following elementary inequality.
(5.1) |
Let us recall that and the phase function where . We compute, for ,
where in the first line we used that is monotonically increasing, and in the last line we used the inequality (5.1), as well as the observation
This observation follows since for any real number the expression is positive for positive and , as we have with and , and is increasing in away from the possible discontinuity at . Therefore, by definition of , we obtain
(5.2) |
We next define
and let and , where denotes the fractional part of . Let be a number such that , to be chosen later, and let
So that
(5.3) |
where we used (5.2) in the last inequality. Furthermore, since both and are increasing, we have, for ,
for some satisfying
However this implies that and hence
(5.4) |
Next, we observe that , so the and interlace. We treat the intervals using the trivial bound, and the intervals using the Kusmin–Landau lemma. As for the boundary intervals and , they will require more careful analysis and a separate treatment.
By the triangle inequality, we have for any real numbers and such that ,
Hence, applying (5.4),
(5.5) |
As for the complementary intervals , we have, by construction, for all . So by Lemma 2.3, for ,
(5.6) |
It remains to consider the boundary intervals, starting with . Let
We consider the following three cases.
Case 1:
Since and is increasing,
hence and thus .
Case 2:
Case 3:
In this case, and for all , where . So by Lemma 2.3,
Combining the three cases, we conclude that
where
(5.7) |
Similarly, the sum corresponding to the other boundary interval satisfies
(5.8) |
The only difference in the treatment of is that if , then we use a slightly modified version of Lemma 2.3 that holds for sums over the closed interval instead of . This is easy to produce since the bound from that lemma is independent of the length of summation.
Together with (5.5) and (5.6), and using (5.3) to bound the sums over , we obtain
To balance the first two terms in the second factor, we choose
(5.9) |
Note that if this choice of is , then the bound we are trying to prove in Lemma 2.5 follows anyway since the contribution of the first term of the bound will already be , which is no better than the trivial bound. Therefore, we may assume that our choice of satisfies . Also, with our choice of we have
(5.10) |
Put together, on defining
(5.11) |
and using (5.10) to simplify in the second line next, we arrive at
(5.12) |
Case 1:
Case 2:
Case 3:
Then, using ,
(5.18) |
as claimed.
6. Proof of Lemma 2.6
In this lemma we propagate the improvements from Lemma 2.5 through to the third derivative test. The approach remains the same as Hiary [Hia16]. We first apply Weyl differencing from Lemma 2.4 to the given exponential, then we estimate the differenced sums . By Lemma 2.5, we have
where is as defined in Lemma 2.5. We apply the inequalities
which appear after [CG04, Lemma 7], which gives
Upon choosing , for some , we have and
Substituting into Lemma 2.4, we obtain the desired result.
7. Concluding remarks
It appears difficult to substantially improve the constant in Theorem 1.1 without resorting to a large-scale numerical computation. Such a numerical computation would probably need to be extensive enough to allow us to, both, avoid using the Riemann–Siegel-Lehman bound and increase the threshold value of where we start applying explicit van der Corput lemmas.
We briefly describe two theoretical approaches that may achieve modest improvements. Firstly, in Lemma 2.5 we used the inequality , but this can be replaced with a sharper inequality. This change will ultimately lower the constant term appearing in the main bound of Lemma 2.5.
Secondly, our application of the third derivative test in (3.4) may be inefficient on the last piece in the main sum subdivision. This last piece contains terms, yet we always bound it as though it contains terms. This could be wasteful if is much smaller than . More careful treatment of this boundary piece may produce savings for certain ranges of in the “intermediate” region, i.e. in the region .
Lastly, the context of this work highlights the sensitivity of explicit estimates in number theory to errors (even minor ones) that could compound quickly, and points to the need for a more automated approach in the future to verify explicit theoretical results. Overall, the incorrect explicit Kusmin–Landau lemma affected all the published subconvex explicit estimates on zeta, as well as other important explicit estimates in number theory. For example, the explicit process derived in [Hia16, Lemma 1.2] was impacted, and in turn, as mentioned earlier, the constant in the main theorem there was also impacted. Our work restores the constant and improves it. Therefore, we leave intact several works that have subsequently used the bound in [Hia16, Theorem 1.1].
References
- [CG04] Yuanyou F. Cheng and Sidney W. Graham “Explicit Estimates for the Riemann Zeta Function” In Rocky Mountain Journal of Mathematics 34.4, 2004
- [Cor21] J.G. van der Corput “Zahlentheoretische Abschätzungen” In Mathematische Annalen 84, 1921, pp. 53–79
- [Hia16] Ghaith A. Hiary “An explicit van der Corput estimate for ” In Indagationes Mathematicae 27.2, 2016, pp. 524–533
- [Kuz27] R. Kuzmin “Sur quelques inégalités trigonométriques” In Soc. Phys.-Math. Léningrade 1, 1927, pp. 233–239
- [Lan28] E. Landau “Üeber eine trigonometrische Summe” In Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, 1928, pp. 21–24
- [Lan26] Edmund Landau “Die Winogradowsche Methode zum Beweise des Waring-Hilbert-Kamkeschen Satzes” In Acta Mathematica 48.3-4 Institut Mittag-Leffler, 1926, pp. 217 –253
- [Pat ̵p] Dhir Patel “An explicit upper bound for ” In Indagationes Mathematicae, in press
- [PT15] D. J. Platt and T. S. Trudgian “An improved explicit bound on ” In Journal of Number Theory 147, 2015, pp. 842–851