# Mertens conjecture

In mathematics, the Mertens conjecture is the statement that the Mertens function ${\displaystyle M(n)}$ is bounded by ${\displaystyle \pm {\sqrt {n}}}$. Although now disproven, it had been shown to imply the Riemann hypothesis. It was conjectured by Thomas Joannes Stieltjes, in an 1885 letter to Charles Hermite (reprinted in Stieltjes (1905)), and again in print by Franz Mertens (1897), and disproved by Andrew Odlyzko and Herman te Riele (1985). It is a striking example of a mathematical conjecture proven false despite a large amount of computational evidence in its favor.

## Definition

In number theory, the Mertens function is defined as

${\displaystyle M(n)=\sum _{1\leq k\leq n}\mu (k),}$

where μ(k) is the Möbius function; the Mertens conjecture is that for all n > 1,

${\displaystyle |M(n)|<{\sqrt {n}}.}$

## Disproof of the conjecture

Stieltjes claimed in 1885 to have proven a weaker result, namely that ${\displaystyle m(n):=M(n)/{\sqrt {n}}}$ was bounded, but did not publish a proof.[1] (In terms of ${\displaystyle m(n)}$, the Mertens conjecture is that ${\displaystyle -1.)

In 1985, Andrew Odlyzko and Herman te Riele proved the Mertens conjecture false using the Lenstra–Lenstra–Lovász lattice basis reduction algorithm:[2][3]

${\displaystyle \liminf m(n)<-1.009}$   and   ${\displaystyle \limsup m(n)>1.06.}$

It was later shown that the first counterexample appears below ${\displaystyle e^{3.21\times 10^{64}}\approx 10^{1.39\times 10^{64}}}$[4] but above 1016.[5] The upper bound has since been lowered to ${\displaystyle e^{1.59\times 10^{40}}}$[6] or approximately ${\displaystyle 10^{6.91\times 10^{39}},}$ and then again to ${\displaystyle e^{1.017\times 10^{29}}\approx 10^{4.416\times 10^{28}}}$,[7] but no explicit counterexample is known.

The law of the iterated logarithm states that if μ is replaced by a random sequence of +1s and −1s then the order of growth of the partial sum of the first n terms is (with probability 1) about n log log n, which suggests that the order of growth of m(n) might be somewhere around log log n. The actual order of growth may be somewhat smaller; in the early 1990s Steve Gonek conjectured[8] that the order of growth of m(n) was ${\displaystyle (\log \log \log n)^{5/4},}$ which was affirmed by Ng (2004), based on a heuristic argument, that assumed the Riemann hypothesis and certain conjectures about the averaged behavior of zeros of the Riemann zeta function.[8]

In 1979, Cohen and Dress[9] found the largest known value of ${\displaystyle m(n)\approx 0.570591}$ for M(7766842813) = 50286, and in 2011, Kuznetsov found the largest known negative value (in the sense of absolute value) ${\displaystyle m(n)\approx -0.585768}$ for M(11609864264058592345) = −1995900927.[10] In 2016, Hurst computed M(n) for every n ≤ 1016 but did not find larger values of m(n).[5]

In 2006, Kotnik and te Riele improved the upper bound and showed that there are infinitely many values of n for which m(n) > 1.2184, but without giving any specific value for such an n.[11] In 2016, Hurst made further improvements by showing

${\displaystyle \liminf m(n)<-1.837625}$   and   ${\displaystyle \limsup m(n)>1.826054.}$

## Connection to the Riemann hypothesis

The connection to the Riemann hypothesis is based on the Dirichlet series for the reciprocal of the Riemann zeta function,

${\displaystyle {\frac {1}{\zeta (s)}}=\sum _{n=1}^{\infty }{\frac {\mu (n)}{n^{s}}},}$

valid in the region ${\displaystyle {\mathcal {Re}}(s)>1}$. We can rewrite this as a Stieltjes integral

${\displaystyle {\frac {1}{\zeta (s)}}=\int _{0}^{\infty }x^{-s}dM(x)}$

and after integrating by parts, obtain the reciprocal of the zeta function as a Mellin transform

${\displaystyle {\frac {1}{s\zeta (s)}}=\left\{{\mathcal {M}}M\right\}(-s)=\int _{0}^{\infty }x^{-s}M(x)\,{\frac {dx}{x}}.}$

Using the Mellin inversion theorem we now can express M in terms of 1ζ as

${\displaystyle M(x)={\frac {1}{2\pi i}}\int _{\sigma -i\infty }^{\sigma +i\infty }{\frac {x^{s}}{s\zeta (s)}}\,ds}$

which is valid for 1 < σ < 2, and valid for 12 < σ < 2 on the Riemann hypothesis. From this, the Mellin transform integral must be convergent, and hence M(x) must be O(xe) for every exponent e greater than 1/2. From this it follows that

${\displaystyle M(x)=O{\Big (}x^{{\tfrac {1}{2}}+\epsilon }{\Big )}}$

for all positive ε is equivalent to the Riemann hypothesis, which therefore would have followed from the stronger Mertens hypothesis, and follows from the hypothesis of Stieltjes that

${\displaystyle M(x)=O{\Big (}x^{\tfrac {1}{2}}{\Big )}.}$

## References

1. ^ Borwein, Peter; Choi, Stephen; Rooney, Brendan; Weirathmueller, Andrea, eds. (2007). The Riemann hypothesis. A resource for the aficionado and virtuoso alike. CMS Books in Mathematics. New York, NY: Springer-Verlag. p. 69. ISBN 978-0-387-72125-5. Zbl 1132.11047.
2. ^ Odlyzko, A. M.; te Riele, H. J. J. (1985), "Disproof of the Mertens conjecture" (PDF), Journal für die reine und angewandte Mathematik, 1985 (357): 138–160, doi:10.1515/crll.1985.357.138, ISSN 0075-4102, MR 0783538, S2CID 13016831, Zbl 0544.10047
3. ^ Sandor et al (2006) pp. 188–189.
4. ^ Pintz, J. (1987). "An effective disproof of the Mertens conjecture" (PDF). Astérisque. 147–148: 325–333. Zbl 0623.10031.
5. ^ a b Hurst, Greg (2016). "Computations of the Mertens function and improved bounds on the Mertens conjecture". arXiv:1610.08551 [math.NT].
6. ^ Kotnik and Te Riele (2006).
7. ^ Rozmarynowycz, John; Kim, Seungki (2023). "A New Upper Bound On the Smallest Counterexample To The Mertens Conjecture".
8. ^ a b Ng, Nathan (2004). "The distribution of the summatory function of the Möbius function" (PDF).
9. ^ Cohen, H. and Dress, F. 1979. “Calcul numérique de Mx)” 11–13. [Cohen et Dress 1979], Rapport, de I'ATP A12311 ≪ Informatique 1975 ≫
10. ^ Kuznetsov, Eugene (2011). "Computing the Mertens function on a GPU". arXiv:1108.0135 [math.NT].
11. ^ Kotnik & te Riele (2006).