If σ is real, then μ is defined to be the infimum of all real numbersa such that ζ = O. It is trivial to check that μ = 0 for σ > 1, and the functional equation of the zeta function implies that μ = μ − σ + 1/2. The Phragmén–Lindelöf theorem implies that μ is a convex function. The Lindelöf hypothesis states μ = 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 μ = 0 and μ = 1/2 implies that 0 ≤ μ ≤ 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:
μ ≤
μ ≤
Author
-
1/4
0.25
Convexity bound
1/6
0.1667
-
163/988
0.1650
-
27/164
0.1647
-
229/1392
0.164512
-
0.164511
-
19/116
0.1638
-
15/92
0.1631
-
6/37
0.16217
-
173/1067
0.16214
-
35/216
0.16204
-
139/858
0.16201
-
32/205
0.1561
-
53/342
0.1550
-
13/84
0.1548
-
Relation to the Riemann hypothesis
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 + 1 is o 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 + 1 is known to be O, 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 for all positive integersk and all positive real numbers ε. This has been proved for k = 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 for some constants ck,j. This has been proved by Littlewood for k = 1 and by for k = 2 . suggested the value for the leading coefficient when k is 6, and 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 by nYoung tableaux given by the sequence
Other consequences
Denoting by pn the n-thprime number, a result by Albert Ingham shows that the Lindelöf hypothesis implies that, for any ε > 0, if n is sufficiently large. However, this result is much worse than that of the large prime gap conjecture.