Large Oscillations of the Argument of the Riemann Zeta-function
Andr\'es Chirre, Kamalakshya Mahatab

TL;DR
Under the Riemann hypothesis, the paper proves that the argument of the Riemann zeta-function exhibits large oscillations of a specific order, refining previous omega results and aligning with recent findings.
Contribution
The paper establishes a new lower bound for the oscillations of the argument of the Riemann zeta-function assuming the Riemann hypothesis, improving classical results.
Findings
Proves $S(t)= ext{Omega}_ ext{pm}(rac{ ext{log} t ext{log} ext{log} ext{log} t}{ ext{log} ext{log} t})$ under RH.
Matches recent omega results by Bondarenko and Seip.
Refines classical oscillation bounds for $S(t)$.
Abstract
Let denote the argument of the Riemann zeta-function, defined as Assuming the Riemann hypothesis, we prove that This improves the classical omega results of Montgomery and matches with the -result obtained by Bondarenko and Seip.
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.
Large oscillations of the argument of the Riemann zeta-function
Andrés Chirre and Kamalakshya Mahatab
Department of Mathematical Sciences, Norwegian University of Science and Technology, NO-7491 Trondheim, Norway
Kamalakshya Mahatab, Department of Mathematics, Chennai Mathematical Institute, H1, SIPCOT IT Park, Siruseri, Kelambakkam 603103, India
[email protected], k̇[email protected]
Abstract.
Let denote the argument of the Riemann zeta-function, defined as
[TABLE]
Assuming the Riemann hypothesis, we prove that
[TABLE]
This improves the classical -results of Montgomery [14, Theorem 2] and matches with the -result obtained by Bondarenko and Seip [1, Theorem 2].
Key words and phrases:
Riemann zeta function, Riemann hypothesis, argument
2010 Mathematics Subject Classification:
11M06, 11M26, 11N37
AC was supported by Grant 275113 of the Research Council of Norway. KM was supported by Grant 227768 of the Research Council of Norway and Project 1309940 of Finnish Academy. A part of this work was carried out when KM was a Leibniz fellow at MFO, Oberwolfach.
1. Introduction
In the theory of the Riemann zeta-function, it is important to understand the distribution of its non-trivial zeros in the critical strip () and on the critical line (). The Riemann Hypothesis (RH) asserts that all the zeros in the critical strip lie on the critical line, which we will assume for our main theorem. Let be the number of zeros of the Riemann zeta-function in the rectangle , where the zeros with imaginary part are counted with weight . The famous Riemann–von Mangoldt formula ([9, Chapter 1.4], [17, Chapter IX]) asserts that
[TABLE]
When is not the ordinate of a non-trivial zero of , the argument function is defined as
[TABLE]
where the argument is obtained by continuous variation of along the polygonal path starting from the point (where ) and then going first to the point and then to . If is the ordinate of a non-trivial zero of , we define
[TABLE]
For a detailed exposition on , we refer to [10] and [17, Chapter IX].
In this paper, we investigate large positive and negative values of . In , Littlewood [11, Theorem 11] proved under RH that
[TABLE]
The best explicit upper bound know for under RH is due to Carneiro, Chandee and Milinovich [3]
[TABLE]
The error term in the above expression was later improved by Carneiro, Milinovich and the first author [4] to .
On the other hand, in 1977, Montgomery [14, Theorem] showed that under RH
[TABLE]
Recently, using the resonance method and assuming RH, Bondarenko and Seip [1] showed that for each fixed constant , there is a constant such that
[TABLE]
Although the estimates (1.1) and (1.3) are the conditionally best known bounds, the true size of is perhaps closer to the lower bound. A heuristic argument of Farmer, Gonek and Hughes [8] suggests that
[TABLE]
We note that from (1.3) we can not infer if
[TABLE]
We only know that at least one of these bounds is true. Our main goal in this paper is to show that both the bounds are true and hence we improve the result of Montgomery (1.2).
Theorem 1**.**
Assume the Riemann hypothesis. Then, for each fixed constant , there exists a constant such that
[TABLE]
for sufficiently large .
1.1. Strategy outline
Our strategy consists of two main ingredients: (i) a new convolution formula for with a suitable parameter , and (ii) the resonator used by Bondarenko and Seip [1]. We start using a new convolution formula, which is inspired by Montgomery’s paper [14]. Assuming RH, Proposition 3 shows that for each fixed and sufficiently large, we have111Throughout this paper we will use the notations and .
[TABLE]
where is the von-Mangoldt function and . We emphasize that on the left-hand side of (1.4), the kernel
[TABLE]
is always positive or always negative. This is one of the differences between our proof and the proof of Bondarenko and Seip [1] as our kernel allows us to have control of the sign. Then, integrating (1.4) with the resonator, and considering the imaginary part, we can pick the large positive and negative values of . On the right-hand side, the parameter gives the necessary control on the length of the Dirichlet polynomial to apply [1, Lemma 7]. Also, this parameter introduces another Dirichlet polynomial (see (2.2)) as error term in (1.4). The length of our Dirichlet polynomial is an important difference of our convolution formula from that of Montgomery, because we need a long enough Dirichlet polynomial to resonate, while Montgomery used a Dirichlet polynomial of length . We highlight that the absence of the sign on the right-hand side of (1.4) is because it will be absorbed in the error term. A similar situation was studied by Mueller [13] who established gaps between sign changes of .
We also recall that the version of the resonance method of Soundararajan [15] was used by Bui, Lester and Milinovich [2] to give a new proof of the omega results of Montgomery (1.2).
We would like to remark that our method can be generalized to a family of -functions (see [5, Section 4]) and to the argument function defined in a region close to the critical line (see [6] and [7]). We would also like to refer to [12] for another application of the resonance method to show results.
2. A new convolution formula
The following lemma is inspired by a result of Montgomery [14, Lemma 4].
Lemma 2**.**
Assume the Riemann hypothesis. Let be a fixed number. Let , , and , for sufficiently large. Then
[TABLE]
where is the von-Mangoldt function defined to be if with a prime number and an integer, and zero otherwise, and for all .
Proof.
By [14, Lemma 3], we have the following formula
[TABLE]
where , and . Since the Dirichlet series
[TABLE]
converges absolutely for , we have
[TABLE]
where . Since we assume RH (see also [16, Theorem 33]), we can move the line of integration in (2.1) to lie on the following five paths:
[TABLE]
For each , we define the integrals
[TABLE]
Then222The notation means that there is a constant such that .,
[TABLE]
Further,
[TABLE]
where in the last line we have used the following estimate (see [18, Eq. (2.13)]):
[TABLE]
Finally, the integral gives us the main term:
[TABLE]
Therefore, combining the above estimates, (2.1), and the error terms, we get the desired result. ∎
The motivation behind the next proposition is to construct a kernel which is always positive or always negative. Note that the function
[TABLE]
has a unique sign.
Proposition 3**.**
Assume the Riemann hypothesis. Let be a fixed number. Let be a fixed parameter and , where is sufficiently large. Then
[TABLE]
where .
Proof.
We take with , and in Lemma 2 and use the linear combination
[TABLE]
to get
[TABLE]
Here we have used that for . Also note that the first sum runs over and the second sum runs over . We want to bound the first sum. Since , using integration by parts and the prime number theorem, we get
[TABLE]
Inserting this into (2.2), we obtain the desired result. ∎
3. The Resonator
We will use the resonator constructed by Bondarenko and Seip in [1, Section 3] (see also [6, Section 3]). The resonator is a function of the form , where
[TABLE]
and is a suitable finite set of positive integers whose construction is given below. We start fixing the real number and define . Note that . For sufficiently large, we define . Let be the set of prime numbers such that
[TABLE]
We define to be the multiplicative function supported on the set of square-free numbers such that
[TABLE]
for and otherwise. For each k\in\big{\{}1,...,\big{[}(\log_{2}N)^{1/8}\big{]}\big{\}}, we define the sets:
[TABLE]
[TABLE]
and
[TABLE]
Now, let be the set of integers such that
[TABLE]
and we define to be the minimum of \big{[}(1+T^{-1})^{j},(1+T^{-1})^{j+1}\big{)}\cap\mathcal{M} for in . Consider the set
[TABLE]
and finally we define
[TABLE]
for every .
3.1. Estimates with the resonator
We collect some results related to the resonator which was proved in [1, Section 3]. Let us write .
Proposition 4**.**
We have the following properties:
- (i)
, 2. (ii)
\int_{-\infty}^{\infty}|R(t)|^{2}\,\Phi\bigg{(}\dfrac{t}{T}\bigg{)}\,\text{\rm d}t\ll T\displaystyle\sum_{l\in\mathcal{M}}f(l)^{2}.**
Proof.
and follows from the definition of and [1, Lemma 5]. ∎
Lemma 5**.**
If
[TABLE]
is absolutely convergent and for , then
[TABLE]
Proof.
See [1, Lemma 7]. ∎
4. Proof of Theorem 1
Assume the Riemann hypothesis and consider the parameters defined in Proposition 3 and Section 3. We start integrating our convolution formula in Proposition 3 in the range with the factor . Using of Proposition 4 we get,
[TABLE]
Taking the imaginary part, we obtain
[TABLE]
We denote the above expression by .
(i) Analysis of . First we want to complete the integrals involving , from to , and then we need to calculate the error terms. Recalling that the sum that appears above runs over , and using the bounds , , the prime number theorem and of Proposition 4, we have
[TABLE]
Similarly, using the rapid decay of , we obtain
[TABLE]
Therefore, we rewrite the integral of from [math] to . Using the fact that and are real and even functions, we get that
[TABLE]
Then
[TABLE]
Note that for a fixed and , we have . Using (3.1), we have that each satisfies , where is sufficienty large. Therefore
[TABLE]
Using Lemma 5, we get
[TABLE]
Finally, accommodating this lower bound in (4.2) and using the fact that , we conclude that
[TABLE]
(ii) Analysis of . Grouping the signs appropriately, we get
[TABLE]
Using (4.3), we have that each factor in the above expression is positive. Then by of Proposition 4, it follows
[TABLE]
(iii) Final analysis. Finally, combining (4.1), (4.3) and (4), we conclude that
[TABLE]
We obtain the desired restriction after a trivial adjustment, changing to and making slightly smaller.
Acknowledgements
We would like to thank Andriy Bondarenko, Micah B. Milinovich, Eero Saksman and Kristian Seip for many valuable discussions and for their insightful comments. We would also like to thank the anonymous referee for the review.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Bondarenko and K. Seip, Extreme values of the Riemann zeta function and its argument, Math. Ann. 372, Issue 3–4, 999–1015, 2018.
- 2[2] H. M. Bui, S. J. Lester, M. B. Milinovich, On Balazard, Saias, and Yor’s equivalence to the Riemann hypothesis, J. Math. Anal. Appl. 409 (1) (2014) 244–253.
- 3[3] E. Carneiro, V. Chandee and M. B. Milinovich, Bounding S ( t ) 𝑆 𝑡 S(t) and S 1 ( t ) subscript 𝑆 1 𝑡 S_{1}(t) on the Riemann hypothesis, Math. Ann. 356, no. 3, 939–968, 2013.
- 4[4] E. Carneiro, A. Chirre and M. B. Milinovich, Bandlimited approximations and estimates for the Riemann zeta-function, Publ. Mat. 63, no. 2, 601–661, 2019.
- 5[5] E. Carneiro, V. Chandee, M. B. Milinovich, A note on the zeros of zeta and L-functions, Math. Z. 281, 315–332, 2015.
- 6[6] A. Chirre, Extreme values for S n ( σ , t ) subscript 𝑆 𝑛 𝜎 𝑡 S_{n}(\sigma,t) near the critical line, J. Number Theory 200, 329–352, 2019.
- 7[7] A. Chirre and K. Mahatab, Large values of the argument of the Riemann-zeta function and its iterates, J. Number Theory 225, 240–259, 2021.
- 8[8] D. W. Farmer, S. M. Gonek and C. P. Hughes, The maximum size of L 𝐿 L -functions, J. Reine Angew. Math 609, 215–236, 2007.
