6 Growth exponents for the Riemann zeta function

Definition 6.1 Growth rate of zeta

For any fixed $σ \in R$ , let $μ (σ)$ denote the least possible (fixed) exponent for which one has the bound

| ζ (σ + i t) | ≪ | t |^{μ (σ) + o (1)}

for all unbounded $t$ .

One can check that for each $σ$ , the set of possible candidates for $μ (σ)$ is closed (by underspill), non-empty, and bounded from below, so that $μ (σ)$ is well-defined as a real number. An equivalent definition without asymptotic notation, is that $μ (σ)$ is the least real number such that for every $ε > 0$ there exists $C > 0$ such that

| ζ (σ + i t) | \leq C | t |^{μ (σ) + ε}

for all $t$ with $| t | \geq C$ ; equivalently, one has

μ (σ) = \underset{| t | \to \infty}{lim sup} \frac{\log | ζ (σ + i t) |}{\log | t |} .

Implemented at bound_mu.py as:
Bound_mu

Lemma 6.2 Trivial bound

One has $μ (σ) = 0$ for all $σ \geq 1$ .

Implemented at bound_mu.py as:
apply_trivial_mu_bound()

Proof ▶

Immediate from the absolute convergence of the Dirichlet series for both $ζ (s)$ and $1 / ζ (s)$ ; see e.g., [ 88 , Theorem 1.9 ] .

Lemma 6.3 Convexity

$μ$ is convex.

Implemented at bound_mu.py as:
bound_mu_convexity()

Proof ▶

Lemma 6.4 Functional equation

One has $μ (1 - σ) = μ (σ) + σ - 1 / 2$ for all $0 \leq σ \leq 1 / 2$ .

Implemented at bound_mu.py as:
apply_functional_equation()

Proof ▶

Immediate from the functional equation for $ζ$ and asymptotics of the Gamma function; see e.g., [ 88 , (1.23), (1.25) ] .

Lemma 6.5 Left of critical strip

One has $μ (σ) = 1 / 2 - σ$ for $σ \leq 0$ .

Implemented at bound_mu.py as:
apply_trivial_mu_bound()

Proof ▶

Lemma 6.6 Convexity bounds

One has $max (0, 1 / 2 - σ) \leq μ (σ) \leq (1 - σ) / 2$ for $0 \leq σ \leq 1$ .

Implemented at bound_mu.py as:
apply_trivial_mu_bound()

Proof ▶

6.1 Connection with exponent pairs and dual exponent pairs

Lemma 6.7 Connection with dual exponent pairs

For any $1 / 2 \leq σ \leq 1$ , one has

μ (σ) \leq sup_{0 \leq α \leq 1 / 2} β (α) - α σ .

Proof ▶

Let $t$ be unbounded. From the Riemann–Siegel formula (see [ 88 , Theorem 4.1 ] ) one has

ζ (σ + i t) ≪ | \sum_{n \leq \sqrt{t / 2 π}} \frac{1}{n^{σ + i t}} | + | t |^{1 / 2 - σ} | \sum_{n \leq \sqrt{t / 2 π}} \frac{1}{n^{1 - σ - i t}} | + O (1) .

From dyadic decomposition and Definition 4.2 (and Lemma 2.1) one has for any fixed $ε > 0$ that

\sum_{t^{ε} \leq n \leq \sqrt{t / 2 π}} \frac{1}{n^{σ + i t}} ≪ | t |^{sup_{ε \leq α \leq 1 / 2} β (α) - α σ + o (1)},

while from the triangle inequality one has the crude bound

\sum_{n < t^{ε}} \frac{1}{n^{σ + i t}} ≪ | t |^{ε} .

Combining the bounds and using underspill, we conclude that

\sum_{n \leq \sqrt{t / 2 π}} \frac{1}{n^{σ + i t}} ≪ | t |^{sup_{0 \leq α \leq 1 / 2} β (α) - α σ + o (1)} .

A similar argument gives

\sum_{n \leq \sqrt{t / 2 π}} \frac{1}{n^{1 - σ - i t}} ≪ | t |^{sup_{0 \leq α \leq 1 / 2} β (α) - α (1 - σ) + o (1)}

Since $σ \geq 1 / 2$ and $α \leq 1 / 2$ , one has $(1 / 2 - σ) - α (1 - σ) \leq - α σ$ , and hence

ζ (σ + i t) ≪ | t |^{sup_{0 \leq α \leq 1 / 2} β (α) - α σ + o (1)}

giving the claim.

We remark that this inequality is morally an equality (indeed, it would be if one would restrict the model phases in Definition 4.2 to purely the logarithmic phase $u \mapsto \log u$ ).

The following form of Lemma 6.7 is convenient for applications:

Corollary 6.8 Exponent pairs and

μ

If $(k, ℓ)$ is an exponent pair, then

μ (ℓ - k) \leq k .

Implemented at bound_mu.py as:
exponent_pair_to_mu_bound(exp_pair)

Proof ▶

Heuristic 6.9 Lindelöf hypothesis

One has $μ (1 / 2) = 0$ .

Implemented at bound_mu.py as:
bound_mu_Lindelof()

Lemma 6.10

The exponent pair conjecture implies the Lindelöf hypothesis.

Proof ▶

Proposition 6.11 Conjectured value of

μ

We have the lower bound

μ (σ) \geq max (0, \frac{1}{2} - σ)

for all $σ \in R$ , and equality holds everywhere in 1 if and only if the Lindelöf hypothesis holds.

We remark that this proposition explains why there are no further lower bounds on $μ$ in the literature beyond 1; all the remaining known results revolve around upper bounds.

Proof ▶

Clearly equality in 1 implies the Lindelöf hypothesis, while from the trivial bounds in Propositions 6.2, 6.5 and convexity (Lemma 6.6) one we see that the Lindelöf hypothesis implies the upper bound

μ (σ) \leq max (0, \frac{1}{2} - σ)

for all $σ$ . So it suffices to establish the lower bound unconditionally. By the functional equation (Proposition 6.4) it suffices to do this for $σ \geq 1 / 2$ ; in fact by convexity it suffices to establish the claim when $1 / 2 < σ < 1$ . In this regime, the $L^{2}$ mean value theorem (see [ 88 , Theorem 1.11 ] ) gives

\int_{0}^{T} | ζ (σ + i t) |^{2} d t ≍ T

for large $T$ , giving the claim.

6.2 Known bounds on $μ$

Theorem 6.12 Historical bounds

The upper bounds on $μ (σ)$ given by Table 6.1 are known.

TODO: supplement as many of these citations as possible with derivations from other exponents and relations in the database

Table 6.1 Historical bounds on

μ (σ)

for

1 / 2 \leq σ \leq 1

, and the exponent pair generating them (if applicable).

Reference	Results	Exponent pair
Hardy–Littlewood (1923) [ 50 ]	$μ (1 / 2) \leq 1 / 6$	(1/6, 2/3)
Walfisz (1924) [ 149 ]	$μ (1 / 2) \leq 193 / 988$
Titchmarsh (1932) [ 165 ]	$μ (1 / 2) \leq 27 / 164$
Phillips (1933) [ 138 ]	$μ (1 / 2) \leq 229 / 1392$
Titchmarsh (1942) [ 167 ]	$μ (1 / 2) \leq 19 / 116$
Min (1949) [ 128 ]	$μ (1 / 2) \leq 15 / 92$
Haneke (1962) [ 46 ]	$μ (1 / 2) \leq 6 / 37$
Kolesnik (1973) [ 109 ]	$μ (1 / 2) \leq 173 / 1067$
Kolesnik (1982) [ 106 ]	$μ (1 / 2) \leq 35 / 216$
Kolesnik (1985) [ 107 ]	$μ (1 / 2) \leq 139 / 858$
Bombieri–Iwaniec (1985) [ 10 ]	$μ (1 / 2) \leq 9 / 56$	$(9 / 56, 1 / 2 + 9 / 56)$
Watt (1989) [ 173 ]	$μ (1 / 2) \leq 89 / 560$	$(89 / 560, 1 / 2 + 89 / 560)$
Huxley–Kolesnik (1991) [ 74 ]	$μ (1 / 2) \leq 17 / 108$	$(17 / 108, 1 / 2 + 17 / 108)$
Huxley (1993) [ 70 ]	$μ (1 / 2) \leq 89 / 570$	$(89 / 570, 1 / 2 + 89 / 570)$
Huxley (1996) [ 71 ]	$μ (1934 / 3655) \leq 6299 / 43860$
Sargos (2003) [ 157 ]	$μ (49 / 51) \leq 1 / 204$ , $μ (361 / 370) \leq 1 / 370$
Huxley (2005) [ 73 ]	$μ (1 / 2) \leq 32 / 205$	$(32 / 205, 1 / 2 + 32 / 205)$
Lelechenko (2014) [ 112 ]	$μ (3 / 5) \leq 1409 / 12170$ , $μ (4 / 5) \leq 3 / 71$
Bourgain (2017) [ 14 ]	$μ (1 / 2) \leq 13 / 84$	$(13 / 84, 1 / 2 + 13 / 84)$
Heath-Brown (2017) [ 63 ]	$μ (σ) \leq \frac{8}{63} \sqrt{15} (1 - σ)^{3 / 2}$ for $1 / 2 \leq σ \leq 1$
Heath-Brown (2020) [ 34 ]	$μ (11 / 15) \leq 1 / 15$

Recorded in literature.py as:
add_literature_bounds_mu()

Some additional bounds are recorded in [ 169 ] by combining various exponential sum estimates.

Theorem 6.13

[ 169 , Theorems 2.4-2.6 ] We have

μ (σ) \leq {\begin{cases} (31 - 36 σ) / 84, & \frac{1}{2} \leq σ < \frac{88225}{153852} = 0.5734 \dots, \\ (220633 - 251324 σ) / 620612, & \frac{88225}{153852} \leq σ < \frac{521}{796} = 0.6545 \dots, \\ (1333 - 1508 σ) / 3825, & \frac{521}{796} \leq σ < \frac{53141}{76066} = 0.6986 \dots, \\ (405 - 454 σ) / 1202, & \frac{53141}{76066} \leq σ < \frac{3620}{5119} = 0.7071 \dots, \\ (49318855 - 52938216 σ) / 170145110, & \frac{3620}{5119} \leq σ < \frac{52209}{69128} = 0.7552 \dots, \\ (471957 - 502648 σ) / 1682490, & \frac{52209}{69128} \leq σ < \frac{1389}{1736} = 0.8001 \dots, \\ (2841 - 3016 σ) / 10316, & \frac{1389}{1736} \leq σ < \frac{134765}{163248} = 0.8255 \dots, \\ (859 - 908 σ) / 3214, & \frac{134765}{163248} \leq σ < \frac{18193}{21906} = 0.8305 \dots, \\ 5 (8707 - 9067 σ) / 180277, & \frac{18193}{21906} \leq σ < \frac{249}{280} = 0.8892 \dots, \\ (29 - 30 σ) / 130, & \frac{249}{280} \leq σ \leq \frac{9}{10} . \end{cases}

Furthermore, for $1 / 2 \leq σ \leq 1$ , we have

μ (σ) \leq \frac{2}{13} \sqrt{10} (1 - σ)^{3 / 2} = 0.4865 \dots (1 - σ)^{3 / 2},

and

μ (σ) \leq \frac{2}{3^{3 / 2}} (1 - σ)^{3 / 2} + \frac{103}{300} (1 - σ)^{2}, \frac{117955}{118272} \leq σ \leq 1.

Recorded in literature.py as:
add_literature_bounds_mu()

Additionally, the series of exponent pairs in Theorem 5.17 imply the following bounds on $μ (σ)$ close to $σ = 1$ .

Theorem 6.14 Heath-Brown [ 63 ]

μ

bounds

For any integer $k \geq 3$ , one has

μ (1 - \frac{3 k^{2} - 3 k + 2}{k (k - 1)^{2} (k + 2)}) \leq \frac{2}{(k - 1)^{2} (k + 2)} .

Proof ▶

The new exponent pairs in Theorem 5.22 may be used to obtain sharper bounds on $μ (σ)$ in certain ranges. The current sharpest bounds on $μ (σ)$ are recorded in Table 6.2 and graphed in Figure 6.1.

Table 6.2 Current sharpest known bound on

μ (σ)

for

1 / 2 \leq σ \leq 1

Upper bound on $μ (σ)$

Range of $σ$

Reference

$μ (σ) \leq \frac{31}{84} - \frac{3}{7} σ$

$\frac{1}{2} \leq σ \leq \frac{88225}{153852} = 0.5734 \dots$

Theorem 6.13

$μ (σ) \leq \frac{220633}{620612} - \frac{62831}{155153} σ$

$\frac{88225}{153852} \leq σ \leq \frac{521}{796} = 0.6545 \dots$

Theorem 6.13

$μ (σ) \leq \frac{1333}{3825} - \frac{1508}{3825} σ$

$\frac{521}{796} \leq σ \leq \frac{53141}{76066} = 0.6986 \dots$

Theorem 6.13

$μ (σ) \leq \frac{405}{1202} - \frac{227}{601} σ$

$\frac{53141}{76066} \leq σ \leq \frac{454}{641} = 0.7082 \dots$

Theorem 6.13

$μ (σ) \leq \frac{779}{2590} - \frac{423}{1295} σ$

$\frac{454}{641} \leq σ \leq \frac{3473692}{4856993} = 0.7151 \dots$

Theorem 5.22, Corollary 6.8

$μ (σ) \leq \frac{1610593}{5622410} - \frac{861996}{2811205} σ$

$\frac{3473692}{4856993} \leq σ \leq \frac{52209}{69128} = 0.7552 \dots$

Theorem 5.22, Corollary 6.8

$μ (σ) \leq \frac{157319}{560830} - \frac{251324}{841245} σ$

$\frac{52209}{69128} \leq σ \leq \frac{1389}{1736} = 0.8001 \dots$

Theorem 5.22, Corollary 6.8

$μ (σ) \leq \frac{2841}{10316} - \frac{754}{2579} σ$

$\frac{1389}{1736} \leq σ \leq \frac{587779}{702192} = 0.8370 \dots$

Theorem 6.13

$μ (σ) \leq \frac{1691}{6554} - \frac{890}{3277} σ$

$\frac{587779}{702192} \leq σ \leq \frac{7441}{8695} = 0.8557 \dots$

Theorem 5.22, Corollary 6.8

$μ (σ) \leq \frac{29}{130} - \frac{3}{13} σ$

$\frac{7441}{8695} \leq σ \leq \frac{277}{300} = 0.9233 \dots$

Theorem 5.22, Theorem 6.14

$μ (σ) \leq λ μ_{n} + (1 - λ) μ_{n + 1}$

$μ_{n} = \frac{2}{(n - 1)^{2} (n + 2)}$

$λ = (σ_{n + 1} - σ) / (σ_{n + 1} - σ_{n})$

$σ_{n} \leq σ \leq σ_{n + 1}$

$σ_{n} = 1 - \frac{3 n^{2} - 3 n + 2}{n (n - 1)^{2} (n + 2)}, (n \geq 7)$

Theorem 6.14

Derived in derived.py as:
compute_best_mu_bound()

\includegraphics[width=0.5\linewidth ]{chapter/mu_bound_plot.png} — Figure 6.1 Current sharpest known bound on $μ (σ)$ for $1 / 2 \leq σ \leq 1$ .

6.3 Connection to the Riemann hypothesis

It is well known that the Riemann hypothesis implies the Lindelöf hypothesis. Here is a sharper version, essentially due to Backlund [ 2 ] :

Lemma 6.15 Growth exponent and zeroes

Let $1 / 2 \leq σ_{0} < 1$ be fixed. Then the assertion $μ (σ_{0}) = 0$ is equivalent to the assertion that for any fixed $ε > 0$ and unbounded $T > 0$ , the number of zeroes $σ + i t$ of the zeta function with $σ \geq σ_{0} + ε$ and $T \leq t \leq T + 1$ is $o (\log T)$ .

Proof ▶

6 Growth exponents for the Riemann zeta function

6.1 Connection with exponent pairs and dual exponent pairs

6.2 Known bounds on μ

6.3 Connection to the Riemann hypothesis

6.2 Known bounds on $μ$