8 Large value theorems for zeta partial sums
Now we study a variant of the exponent , specialized to the Riemann zeta function.
Definition
8.1
Large value zeta exponent
Let and be fixed. We define to be the least (fixed) exponent for which the following claim is true: if is a zeta large value pattern with is unbounded, , and , then .
Implemented at large_values
.py as:
Large_Value_Estimate
We will primarily be interested in the regime (as this is the region connected to the Riemann-Siegel formula for ), but for sake of completeness we develop the theory for the entire range . (The range can be worked out exactly by existing tools, while the region can be reflected to the region by Poisson summation.)
As usual, we have a non-asymptotic formulation of :
Lemma
8.2
Asymptotic form of large value exponent at zeta
Let , , and be fixed. Then the following are equivalent:
The proof of Lemma 8.2 proceeds as in previous sections and is omitted.
Lemma
8.3
Basic properties
(Monotonicity in ) For any , is upper semicontinuous and monotone non-increasing.
(Trivial bound) For any and , we have .
(Domination by large values) We have for all and .
(Reflection) For and , one has
Implemented at zeta_large_values
.py as:
get_trivial_zlv()
We note that in practice, bounds for are monotone decreasing in , so the reflection property in Lemma 8.3(iv) morally simplifies to
TODO: implement a python method for reflection
Proof
▶
The claims (i), (ii) are obvious. The claim (iii) is clear by setting in Definition 7.2.
Now we turn to (iv). By symmetry it suffices to prove the upper bound. Actually it suffices to just show
as this easily implies the general upper bound.
Let be a zeta large value pattern with unbounded, , and . By definition, it suffices to show the bound
for some . By definition, . By a Fourier expansion of in , we can bound
and hence by the pigeonhole principle, we can find for each such that
for . By refining by if necessary, we may assume that the are -separated.
Now we use the approximate functional equation
for ; see
[
110
,
Theorem 4.1
]
. Applying this to the two endpoints of and subtracting, we conclude that
where . Since has magnitude one, we conclude that
Writing , we see that and
Performing a Fourier expansion of (smoothed out at scale ) in , we can bound
and hence
If we let denote the set of for which for a suitably chosen error, then we have
Summing in , we obtain
and so by dyadic pigeonholing we can find and a -separated subset of such that
for all , and
By passing to a subsequence we may assume that for some . Partitioning into a bounded number of intervals each of which lies in a dyadic range for some , and using Definition 8.1, we have
and 2 follows.
Note in comparison with , that can be , and is indeed conjectured to do so whenever and . Indeed:
Lemma
8.4
Characterization of negative infinite value
Let and be fixed. Then the following are equivalent:
Proof
▶
Clearly (i) implies (ii). If (iii) holds, then in any zeta large value pattern with unbounded and , is necessarily empty, giving (i). Conversely, if (i) fails, then there must be with unbounded and with non-empty, contradicting (ii).
Corollary
8.5
If is fixed then whenever is fixed. For instance, by 8, one has whenever is fixed.
Proof
▶
Suppose one has data obeying the hypotheses of Lemma 8.4(iii), then by 2 (with ) one has
and the claim follows from Lemma 8.4.
Corollary
8.6
If and are fixed, then whenever .
Proof
▶
From Definition 6.1 one has
for unbounded . By standard arguments (see
[
110
,
(8.13)
]
), this implies that
for unbounded , if and . By partial summation this gives
The claim now follows from Lemma 8.4.
Corollary
8.7
If is an exponent pair, then whenever , are fixed quantities with .
Proof
▶
Immediate from Corollary 8.5 and Lemma 5.3; alternatively, one can use Corollary 8.6 and Corollary 6.8.
Corollary
8.8
Assuming the Lindelof hypothesis, one has whenever and .
Proof
▶
Apply Corollary 8.6 with , so that vanishes from the Lindelof hypothesis.
For completeness, we now work out the values of in the remaining cases not covered by the above corollary.
Proof
▶
The upper bound follows from Lemma 8.3(ii), so it suffices to prove the lower bound. Accordingly, let be unbounded, let for a large fixed constant , and set . In the case , we see from the mean value theorem (Lemma 3.1) that the expression has an mean of for ; on other hand, from 8 we also have an norm of . We conclude that for in a subset of of measure , and hence on a -separated subset of cardinality . This gives the claim .
Next, we establish the case. Let be unbounded, set , and set . From Lemma 3.1 we see that the mean of is . Also, by squaring this Dirichlet series and applying Lemma 3.1 again we see that the mean is . We may now argue as before to give the desired claim .
Finally we need to handle the case . By Lemma 8.3(iv) with we have
By the case, the left-hand side is at least , thus
On the other hand, from Theorem 7.9 and Lemma 8.3(iii) we have
We conclude that the supremum is in fact attained asymptotically at , in the sense that
By the monotonicity of in , this implies that , as required.
Lemma
8.10
Value at
If , then is equal to for and equal to for .
Proof
▶
The first claim follows from Corollary 8.5 and Lemma 4.4. For the second claim, it suffices by Lemma 8.3(ii) to establish the lower bound . But this is clear from 5.
One can use exponent pairs to control :
Lemma
8.11
From exponent pairs to zeta large values estimate
[
110
,
Theorem 8.2
]
If is an exponent pair with , then for any and one has
By applying this lemma to the exponent pairs in Corollary 5.11, one recovers the bounds in
[
110
,
Corollary 8.1, 8.2
]
(up to epsilon losses in the exponents).
A useful connection between large values estimates and large values estimates for the zeta function is the following strengthening of Theorem 7.10.
Lemma
8.12
Halász–Montgomery inequality
Note from Lemma 8.5 one could also impose the restriction in the supremum if desired, at which point one recovers Theorem 7.10. Similarly, from Corollary 8.6 one could also impose the restriction for any fixed .
Proof
▶
It suffices to show that
since the terms with are less than the left-hand side and can thus be dropped. We repeat the proof of Lemma 7.10. We can find a large value pattern with unbounded, , , and , and we have
for some -bounded , and hence by the triangle inequality
which we rearrange as
As in the proof of Lemma 7.10, the contribution of the case to the right-hand side is , so we can restrict attention to the case . By a dyadic decomposition and the pigeonhole principle, we may then assume that
for some and some ; by passing to a subsequence we may assume that for some . By further dyadic decomposition, we may also assume that for some ; the cardinality of the sum is then bounded both by and by , hence
The case is dominated by that of . The claim now follows.
Corollary
8.13
Converting a bound on to a large values theorem
If , , and are fixed, then
In particular, the Montgomery conjecture holds for .
Proof
▶
By Lemma 7.7 it suffices to verify the claim for . The claim now follows from Lemma 8.12 and Corollary 8.6.
Theorem
8.14
Halász-Turán large values theorem
[
63
,
Theorem 1
]
On the Lindelöf hypothesis, one has the Montgomery conjecture whenever .
Proof
▶
Immediate from Corollary 8.13, since in this case.
Theorem
8.15
First Ivic large values theorem
[
110
,
Lemma 8.2
]
If and are fixed, then
where is equal to
In particular, the Montgomery conjecture holds for this choice of if
Proof
▶
We set to equal
and then from the bounds , , one can bound by the quantity , defined to equal
By Corollary 8.13, we have for
The right-hand side can be computed to equal , giving the claim.
Another typical application of the Halász-Montgomery inequality is
Lemma
8.16
Second Ivic large values theorem
[
110
,
(11.40)
]
For any and , one has
In particular, optimizing using subdivision (Lemma 7.7) we have
This implies the Montgomery conjecture for
Proof
▶
Write , and let be arbitrary. By Lemma 8.12, we may assume without loss of generality that
for some and . On the other hand, from Lemma 8.11 applied to the exponent pair from Lemma 5.11, and bounding by , one has
and thus on taking convex combinations
hence is bounded by either , , or . The claim then follows after solving for . □