## If the Riemann Hypothesis fails, must it fail infinitely often?

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

That is must there either be no non-trivial zeros off the critical line or infinitely many?

I'm sure that no one believes otherwise, but I've never seen a theorem in the literature addressing this. Folklore perhaps?

-

4
i would bet five hundred dollars that this is wide open, and won't be resolved until RH itself is resolved. – David Hansen Dec 23 2010 at 0:09

1
I think it is true that certain L-functions can have only finitely many zeroes on the critical line, although it is well-understood where the zeroes come from. One may construct L-functions associated to the Laplacian on an arithmetic manifold, and the zeroes come from small eigenvalues of the Laplace operator. I'm not sure if there is any proposed analogy though in the case of the Riemann-zeta function. – Agol Dec 23 2010 at 1:05
Agol, do you mean "off the critical line"? – David Hansen Dec 23 2010 at 2:33

1
@David: Yes, I meant off the critical line - they are actually real zeroes. – Agol Dec 23 2010 at 3:28

3
What we need is a proof that not-RH => finitely many, and another proof that not-RH => infinitely many. :-) – Mitchell Porter Dec 24 2010 at 0:34
show 3 more comments

## 4 Answers

To elaborate on my comment, I really do think this won't be resolved until RH itself is resolved, or at least until new tools are brought onto the scene, because it's so far from what we know about the zeros by current technology. All the theorems we have about zeros of the zeta function - e.g., the zero-free region, the zero-density theorems, Montgomery's conditional results on pair correlation, Selberg's theorems on $S(t)$ - are either incredibly weak compared to what we expect to be true (Iwaniec often refers to zero-density theorems as "estimates for the cardinality of the empty set"), or are theorems "in the large", that is to say they deal in whole masses of zeros as opposed to individual zeros. Conventional harmonic analysis is simply unable to grasp individual zeros, for reasons of the uncertainty principle.

The closest reference I know to your question is a paper of Bombieri, "Remarks on Weil's quadratic functional in the theory of prime numbers", where he shows that if the RH is false for only a finite number of zeros, then very odd things follow...

Edit: Thinking about this question a bit more has led me to a conjecture seems quite a bit weaker than anything approaching RH and which essentially implies the impossibility of finitely many failures.

-

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

This does not answer your question, but recall that the explicit formula reads

$$\psi(x) = x - \sum_{\rho} \frac{x^{\rho}}{\rho} - \log(2 \pi) - \log(1 - x^{-2})/2.$$

On RH, this implies that $\psi(x) = x + O(x^{1/2} \log^2 x)$. If RH were false with infinitely many exceptions, you'd get a bigger error term which would potentially behave erratically and "randomly". But if RH were false with finitely many exceptions, then you would get

$$\psi(x) = x - \sum_{\rho} \frac{x^{\rho}}{\rho} + O(x^{1/2} \log^2 x),$$

with the sum over the exceptions -- a distinct secondary term and therefore weird oscillatory behavior in the frequency of the primes. Although this has not been ruled out to my knowledge (for example you see terms for Siegel zeroes of Dirichlet $L$-functions all over the literature), it does seem unlikely.

-

Very nice insight! – timur Dec 23 2010 at 16:47

To quote from "Problems of the Millennium: the Riemann Hypothesis" by Bombieri:

It is known that hypothetical exceptions to the Riemann hypothesis must be rare if we move away from the line $\Re(s) = \frac{1}{2}$.

Let $N(\alpha, T)$ be the number of zeros of $\zeta(s)$ in the rectangle $\alpha \leq \Re(s) \leq 2$, $0 \leq \Im(s) \leq T$. The prototype result goes back to Bohr and Landau in 1914, namely $N(\alpha, T) = O(T)$ for any fixed $\alpha$ with $\frac{1}{2} < \alpha < 1$. A significant improvement of the result of Bohr and Landau was obtained by Carlson in 1920, obtaining the density theorem $N(\alpha, T) = O(T^{4\alpha(1−\alpha)+\epsilon})$ for any fixed $\epsilon > 0$. The fact that the exponent here is strictly less than $1$ is important for arithmetic applications, for example in the study of primes in short intervals. The exponent in Carlson’s theorem has gone through several successive refinements for various ranges of $\alpha$, in particular in the range $\frac{3}{4} < \alpha < 1$. Curiously enough, the best exponent known up to date in the range $\frac{1}{2} < \alpha \leq \frac{3}{4}$ remains Ingham’s exponent $3(1 − \alpha)/(2 − \alpha)$, obtained in 1940.

-

So, this doesn't actually answer the question, right?  – Gerry Myerson Dec 22 2010 at 22:19
Sure. It might well be an open and very difficult question. I would love to see an expert answer clarifying the issue a bit more.  – Andrey Rekalo Dec 22 2010 at 22:29

On a somewhat related note I would like to call attention to the following papers:

A. Booker, Poles of Artin $L$-functions and the strong Artin conjecture, Annals of Math. 158 (2003), 1089-1098.

Here the author proves that for 2-dimensional Galois representations $\rho$ the Artin conjecture implies the strong Artin conjecture by showing that if some character twist $L(s,\rho\otimes\chi)$ has a pole then $L(s,\rho)$ has infinitely many poles (hence in fact all twists have infinitely many poles).

P. Sarnak, A. Zaharescu, Some remarks on Landau-Siegel zeros, Duke Math. J. 111 (2002), 495-507.

Here the authors prove that if all zeros of all quadratic Dirichlet $L$-functions are on the critical line or on the real axis, then the possible real zeros are much farther from $s=1$ than we can prove at present without any hypothesis.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 24, "mathjax_display_tex": 2, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9416524171829224, "perplexity_flag": "middle"}