Extreme values of the Riemann zeta function on the 1-line
Christoph Aistleitner, Kamalakshya Mahatab, Marc Munsch

TL;DR
This paper establishes new lower bounds for the extreme values of the Riemann zeta function on the 1-line, matching conjectured predictions, by developing a novel variant of the long resonator method that leverages self-similarity properties.
Contribution
Introduces a new variant of the long resonator method using self-similarity, improving the analysis of zeta function maxima without sparsification.
Findings
Proves arbitrarily large values of |(1+it)| with explicit lower bounds.
Matches the conjectured optimal lower bounds for zeta function maxima.
Develops a new resonator technique exploiting self-similarity properties.
Abstract
We prove that there are arbitrarily large values of such that . This essentially matches the prediction for the optimal lower bound in a conjecture of Granville and Soundararajan. Our proof uses a new variant of the "long resonator" method. While earlier implementations of this method crucially relied on a "sparsification" technique to control the mean-square of the resonator function, in the present paper we exploit certain self-similarity properties of a specially designed resonator function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Extreme values of the Riemann zeta function on the 1-line
Christoph Aistleitner
Christoph Aistleitner, Institute of Analysis and Number Theory, TU Graz, Austria
,
Kamalakshya Mahatab
Kamalakshya Mahatab, Department of Mathematical Sciences, NTNU Trondheim, Norway
and
Marc Munsch
Marc Munsch, Institute of Analysis and Number Theory, TU Graz, Austria
Abstract.
We prove that there are arbitrarily large values of such that . This essentially matches the prediction for the optimal lower bound in a conjecture of Granville and Soundararajan. Our proof uses a new variant of the “long resonator” method. While earlier implementations of this method crucially relied on a “sparsification” technique to control the mean-square of the resonator function, in the present paper we exploit certain self-similarity properties of a specially designed resonator function.
The first and third author are supported by the Austrian Science Fund (FWF), project Y-901. This paper was written while the second author was a visitor at the TU Graz for one month; this visit was also supported by FWF project Y-901. Furthermore, this work was carried out during the tenure of an ERCIM “Alain Bensoussan” Fellowship of the second author.
1. Introduction
Improving earlier work of Littlewood, in 1972 Levinson [7] proved that
[TABLE]
for arbitrarily large .111Throughout this paper, we write for the Riemann zeta function and for the -th iterated logarithm. This was further improved by Granville and Soundararajan [5], who in 2006 established the lower bound
[TABLE]
for arbitrarily large . Their result also gives bounds for the measure of those for which is of this size. Also in [5], Granville and Soundararajan state the conjecture that actually
[TABLE]
and even give a conjectural value of the constant .
The proofs of Levinson and of Granville and Soundararajan rely on estimates for high moments of the zeta function and on Diophantine approximation arguments, respectively. Using a different method, the so-called resonance method, Hilberdink [6] re-established (1). This method can be traced back to a paper of Voronin [11], but it was developed independently and significantly refined by Hilberdink and by Soundararajan [9] about 10 years ago. Roughly speaking, the functional principle of this method is to find a function such that
[TABLE]
is “large”, whereas
[TABLE]
is “small”. Then the quotient is a lower bound for the maximal value of in the range . The “resonator” is chosen as a Dirichlet polynomial, and experience shows that it is often suitable to choose a function with multiplicative coefficients which can be written as a finite Euler product. This method can be implemented relatively easily if the length of is bounded by a small power of , since then is the square-integral of a sum of essentially orthogonal terms. However, it is desirable to be able to control significantly longer resonator functions as well, and in [1] a method was developed which allows the implementation of “long” resonators of length roughly . For this method allowed to recapture Montgomery’s [8] lower bounds for extreme values of by means of the resonance method, while on the critical line Bondarenko and Seip [3] used a “long resonator” to obtain lower bounds for extreme values of which even surpassed those established before by different methods.222From the work of Bondarenko and Seip it is also visible why the “long resonator” does not give any essential improvement of Montgomery’s results in the case , other than better values for the involved constants. See [3, 4]. In the present paper we will adapt the “long resonator” argument to the case , and prove the following theorem.
Theorem 1**.**
There is a constant such that
[TABLE]
for all sufficiently large .
Note that our theorem is in accordance with the conjecture of Granville and Soundararajan in equation (2). However, the conjecture is much stronger than the theorem. First of all, our theorem only gives a lower bound with error , while the conjecture gives an asymptotic equality with error . Thus a proof of the full conjecture would also require a vast improvement of the upper bound of Vinogradov. Additionally, in the conjecture the range for is , while our theorem requires the larger range . The requirement for such a longer range is typical for applications of the “long resonator”, and appears in [1] and [3] as well. The range in our theorem could be reduced to for , at the expense of replacing by some other constant .
Before turning to the proof of Theorem 1, we comment on the difficulties when extending the “long resonator” method to the case . Two key ingredients of the resonance method for a “long resonator” are positivity and sparsity. “Positivity” means the introduction of an additional function having non-negative Fourier transform in , which ensures that is a sum of non-negative terms, while “sparsity” means that nearby frequencies in the resonator function are merged in such a way that one obtains a function having a “quasi-orthogonality” property which allows to control . For details see [1, 3] and the very recent paper [4]. The “long resonator” has only been implemented for in the range so far, since the extension of the method to meets serious technical difficulties. The main problem is that the “sparsification” of the resonator cannot be carried out to such an extent as to obtain a truly orthogonal sum, but one rather ends up with a function whose square-integral can be estimated only up to multiplicative errors of logarithmic order; if one tried to continue thinning out the resonator function to obtain precise control of , then from some point on this would cause a significant loss in instead. Note that these errors do not play a role in the case , where they are negligible in comparison to the main terms, whereas in the case we want to obtain a very precise result where only multiplicative errors of order are allowed.
Thus for the case it is necessary to devise a novel variant of the “long resonator” technique, which will be done in the present paper. The method is genuinely different from those used in [1, 3], where the “sparsification” of the resonator function played a key role. In the present paper we will avoid this sparsity requirement, and actually we make no attempt at all to control the size of . Instead we use a self-similarity property of the resonator function, which is due to its construction in a completely multiplicative way.
2. Proof of Theorem 1
We will use the following approximation formula for the zeta function, which appears in the first lines of the proof of Theorem 2 in [5].
Lemma 1**.**
Define . Let be large, and set . Then for we have
[TABLE]
Instead of this approximation of by an Euler product we could also use the classical approximation by a Dirichlet polynomial ([10, Theorem 4.11]), which was used in [1, 3, 6]. However, the approximation by an Euler product is more convenient for us, since the resonator will also be defined as an Euler product.
Assume that is “large”, and set . By Lemma 1 it suffices to prove Theorem 1 for instead of . Set , and for primes set
[TABLE]
This choice of “weights” is inspired by those used in the proof of Theorem 2.3 (case ) in [6]. We set and for , and extend our definition in a completely multiplicative way such that we obtain weights for all . Now we define
[TABLE]
Then
[TABLE]
where is the prime-counting function and is the first Chebyshev function. It is well-known that by partial summation one has
[TABLE]
and thus we have
[TABLE]
by our choice of .
We can write as a Dirichlet series in the form
[TABLE]
and accordingly
[TABLE]
Note that all the weights are non-negative reals. Set . By our choice of we have
[TABLE]
Thus, using (4), we obtain
[TABLE]
and
[TABLE]
Using (5) we can write
[TABLE]
We have the lower bound
[TABLE]
which follows from and the positivity of the Fourier transform of , together with estimates similar to (6) and (7) to restrict to the desired range. Again using the fact that has a positive Fourier transform we have
[TABLE]
Here we reduced the range of primes in from to , so that the same primes appear in the definitions of and , respectively. Writing
[TABLE]
for appropriate coefficients , where , we have
[TABLE]
Note that we can freely interchange the order of summations and integration, since everything is absolutely convergent. Assume to be fixed. Then, again using the fact that has a positive Fourier transform, we have
[TABLE]
Thus we have
[TABLE]
For the first product we have
[TABLE]
by Mertens’ theorem. For the second product we have
[TABLE]
Thus together with (10) and (11) we have
[TABLE]
From (6)–(9) we deduce that also
[TABLE]
Thus we have
[TABLE]
As noted at the beginning of the proof, by Lemma 1 this estimate remains valid if we replace by . This proves Theorem 1.
In conclusion, we add some remarks on the method used in the present paper. As noted in the introduction, earlier implementations of the resonance method relied on a combination of “positivity” and “sparsity” properties. In the present paper we show that it is possible to leave out the sparsity requirement, at least in one particular instance. One could also obtain the results from [1] for the case using the method from the present paper without problems. However, it does not seem that the results from [3] for the case could also be obtained using our argument, since the resonator function there necessarily has a more complicated structure (which is not of a simple Euler product form), while our argument relies on the fact that one can use a resonator which has completely multiplicative coefficients (which is essential for the argument, since any other coefficients would destroy the required self-similarity property).
We want to emphasize that the only real restriction on the size of the resonator in our argument is (4), which gives an upper bound for . This is different from earlier versions of the “long resonator” argument, where bounds on the cardinality of the support of (that is, on the number of non-zero coefficients in the Dirichlet series representation) are required.
Another remark is that while the sparsity requirement may be unnecessary (at least in some cases), the positivity requirement still plays a crucial role in our argument. This prevents a possible generalization of the method to the case of functions whose Dirichlet series representation does not only contain non-negative real numbers as coefficients. This topic is also discussed in [2] in some detail. In particular, we have not been able to obtain a result for extreme values of beyond those mentioned in [5].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] C. Aistleitner. Lower bounds for the maximum of the Riemann zeta function along vertical lines. Math. Ann. , 365(1-2):473–496, 2016.
- 2[2] C. Aistleitner and Ł. Pańkowski. Large values of L-functions from the Selberg class. J. Math. Anal. Appl. , 446(1):345–364, 2017.
- 3[3] A. Bondarenko and K. Seip. Large greatest common divisor sums and extreme values of the Riemann zeta function. Duke Math. J. , 166(9):1685–1701, 2017.
- 4[4] A. Bondarenko and K. Seip. Note on the resonance method for the Riemann zeta function. To appear in: Tribute to Victor Havin. 50 years with Hardy spaces , in the series “Operator Theory: Advances and Applications”, Birkhäuser Verlag. Available at https://arxiv.org/abs/1701.04978 .
- 5[5] A. Granville and K. Soundararajan. Extreme values of | ζ ( 1 + i t ) | 𝜁 1 𝑖 𝑡 |\zeta(1+it)| . In The Riemann zeta function and related themes: papers in honour of Professor K. Ramachandra , volume 2 of Ramanujan Math. Soc. Lect. Notes Ser. , pages 65–80. Ramanujan Math. Soc., Mysore, 2006.
- 6[6] T. Hilberdink. An arithmetical mapping and applications to Ω Ω \Omega -results for the Riemann zeta function. Acta Arith. , 139(4):341–367, 2009.
- 7[7] N. Levinson. Ω Ω \Omega -theorems for the Riemann zeta-function. Acta Arith. , 20:317–330, 1972.
- 8[8] H. L. Montgomery. Extreme values of the Riemann zeta function. Comment. Math. Helv. , 52(4):511–518, 1977.
