Lindelöf hypothesis

In mathematics, the Lindelöf hypothesis is a conjecture by Finnish mathematician Ernst Leonard Lindelöf about the rate of growth of the Riemann zeta function on the critical line. This hypothesis is implied by the Riemann hypothesis. It says that for any ε > 0, $$\zeta\!\left(\frac{1}{2} + it\right)\! = O(t^\varepsilon)$$ as t tends to infinity (see big O notation). Since ε can be replaced by a smaller value, the conjecture can be restated as follows: for any positive ε, $$\zeta\!\left(\frac{1}{2} + it\right)\! = o(t^\varepsilon).$$

The μ function
If σ is real, then μ(σ) is defined to be the infimum of all real numbers a such that ζ(σ + iT&thinsp;) = O(T&thinsp;a). It is trivial to check that μ(σ) = 0 for σ > 1, and the functional equation of the zeta function implies that μ(σ) = μ(1 − σ) − σ +&thinsp;1/2. The Phragmén–Lindelöf theorem implies that μ is a convex function. The Lindelöf hypothesis states μ(1/2) = 0, which together with the above properties of μ implies that μ(σ) is 0 for σ ≥ 1/2 and 1/2 − σ for σ ≤ 1/2.

Lindelöf's convexity result together with μ(1) = 0 and μ(0) = 1/2 implies that 0 ≤ μ(1/2) ≤ 1/4. The upper bound of 1/4 was lowered by Hardy and Littlewood to 1/6 by applying Weyl's method of estimating exponential sums to the approximate functional equation. It has since been lowered to slightly less than 1/6 by several authors using long and technical proofs, as in the following table:

Relation to the Riemann hypothesis
Backlund (1918–1919) showed that the Lindelöf hypothesis is equivalent to the following statement about the zeros of the zeta function: for every ε > 0, the number of zeros with real part at least 1/2 + ε and imaginary part between T and T +&thinsp;1 is o(log(T)) as T tends to infinity. The Riemann hypothesis implies that there are no zeros at all in this region and so implies the Lindelöf hypothesis. The number of zeros with imaginary part between T and T +&thinsp;1 is known to be O(log(T)), so the Lindelöf hypothesis seems only slightly stronger than what has already been proved, but in spite of this it has resisted all attempts to prove it.

Means of powers (or moments) of the zeta function
The Lindelöf hypothesis is equivalent to the statement that $$\frac{1}{T} \int_0^T|\zeta(1/2+it)|^{2k}\,dt = O(T^{\varepsilon})$$ for all positive integers k and all positive real numbers ε. This has been proved for k =&thinsp;1 or 2, but the case k = 3 seems much harder and is still an open problem.

There is a much more precise conjecture about the asymptotic behavior of the integral: it is believed that


 * $$ \int_0^T|\zeta(1/2+it)|^{2k} \, dt = T\sum_{j=0}^{k^2}c_{k,j}\log(T)^{k^2-j} + o(T)$$

for some constants ck,j&hairsp;. This has been proved by Littlewood for k =&thinsp;1 and by Heath-Brown for k = 2 (extending a result of Ingham who found the leading term).

Conrey and Ghosh suggested the value
 * $$\frac{42}{9!}\prod_ p \left((1-p^{-1})^4(1+4p^{-1}+p^{-2})\right)$$

for the leading coefficient when k is 6, and Keating and Snaith used random matrix theory to suggest some conjectures for the values of the coefficients for higher k. The leading coefficients are conjectured to be the product of an elementary factor, a certain product over primes, and the number of n&thinsp;×&thinsp;n Young tableaux given by the sequence
 * 1, 1, 2, 42, 24024, 701149020, ....

Other consequences
Denoting by pn the n-th prime number, let $$g_n = p_{n + 1} - p_n.\ $$ A result by Albert Ingham shows that the Lindelöf hypothesis implies that, for any ε > 0, $$g_n\ll p_n^{1/2+\varepsilon}$$ if n is sufficiently large.

A prime gap conjecture stronger than Ingham's result is Cramér's conjecture, which asserts that $$ g_n = O\!\left((\log p_n)^2\right).$$

The density hypothesis


The density hypothesis says that $$N(\sigma,T)\le N^{2(1-\sigma)+\epsilon}$$, where $$N(\sigma,T)$$ denote the number of zeros $$\rho$$ of $$\zeta(s)$$with $$\mathfrak{R}(s)\ge \sigma$$ and $$|\mathfrak{I}(s)|\le T$$, and it would follow from the Lindelöf hypothesis.

More generally let $$N(\sigma,T)\le N^{A(\sigma)(1-\sigma)+\epsilon}$$ then it is known that this bound roughly correspond to asymptotics for primes in short intervals of length $$x^{1-1/A(\sigma)}$$.

Ingham showed that $$A_I(\sigma)=\frac{3}{2-\sigma}$$ in 1940, Huxley that $$A_H(\sigma)=\frac{3}{3\sigma-1}$$ in 1971, and Guth and Maynard that $$A_{GM}(\sigma)=\frac{15}{5\sigma+3}$$ in 2024 (preprint)   and these coincide on $$\sigma_{I,GM}=7/10<\sigma_{H,GM}=8/10<\sigma_{I,H}=3/4$$, therefore the latest work of Guth and Maynard gives the closest known value to $$\sigma=1/2$$ as we would expect from the Riemann hypothesis and improves the bound to $$N(\sigma,T)\le N^{\frac{30}{13}(1-\sigma)+\epsilon}$$ or equivalently the asymptotics to $$x^{17/30}$$.

In theory improvements to Baker, Harman, and Pintz estimates for the Legendre conjecture and better Siegel zeros free regions could also be expected among others.

L-functions
The Riemann zeta function belongs to a more general family of functions called L-functions. In 2010, new methods to obtain sub-convexity estimates for L-functions in the PGL(2) case were given by Joseph Bernstein and Andre Reznikov and in the GL(1) and GL(2) case by Akshay Venkatesh and Philippe Michel and in 2021 for the GL(n) case by Paul Nelson.

Notes and references

 * 2001 pbk reprint
 * 2001 pbk reprint
 * 2001 pbk reprint
 * 2001 pbk reprint
 * 2001 pbk reprint
 * 2001 pbk reprint