49
$\begingroup$

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?

$\endgroup$
8
  • 9
    $\begingroup$ i would bet five hundred dollars that this is wide open, and won't be resolved until RH itself is resolved. $\endgroup$ Dec 23, 2010 at 0:09
  • 2
    $\begingroup$ 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. $\endgroup$
    – Ian Agol
    Dec 23, 2010 at 1:05
  • 1
    $\begingroup$ @David: Yes, I meant off the critical line - they are actually real zeroes. $\endgroup$
    – Ian Agol
    Dec 23, 2010 at 3:28
  • 10
    $\begingroup$ What we need is a proof that not-RH => finitely many, and another proof that not-RH => infinitely many. :-) $\endgroup$ Dec 24, 2010 at 0:34
  • 1
    $\begingroup$ @Agol: The Selberg Zeta function, which you mention, is of different type as the Riemann Zeta function, e.g. exponential order two. Many people are searching for this analogy. E.g., Alain Connes sketched a Selberg tarce formula type computation for the ax+b group in his approach to RH. $\endgroup$
    – Marc Palm
    Apr 10, 2011 at 11:03

4 Answers 4

30
$\begingroup$

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.

$\endgroup$
5
  • $\begingroup$ Very nice insight! $\endgroup$
    – timur
    Dec 23, 2010 at 16:47
  • $\begingroup$ My answer was refused so I comment here. If we have a finite number of exceptions, as Riemann zeros are symmetrical, the second term in your second equation would have some zeroes $\frac{x^{\rho}}{\rho}$ with real part forming $x^d,d>\frac{1}{2}$. Closing infinity these zeros would dominate all others that would fall under $O(x^{\frac1{2}})$ (ignoring $\log$ as it adds nothing to discussion), so it is unclear how these isolated few faster growing factors A. may create staircase, and B. how other zeros could compensate faster growing term(s) while being themselves under $O(x^{\frac1{2}})$. $\endgroup$
    – user524860
    yesterday
  • $\begingroup$ To continue: von Mangoldt function expressed using Riemann zeta zeros alike $$\lim _{T \rightarrow+\infty} \frac{1}{T} \sum_{0<\gamma \leq T} \cos (\alpha \log t)=-\frac{\Lambda(t)}{2 \pi \sqrt{t}}, \alpha=-i(\rho-1 / 2)$$ although there are other similar expressions, remains the same if we exclude a finite number of Riemann zeta zeros. Exclude all finite number of zeros off critical line: you obtain von Mangoldt with zeros that are on critical line; add all zeros, you obtain von Mangoldt with zeros that are on and off critical line. That is a very strange possibility. $\endgroup$
    – user524860
    yesterday
  • $\begingroup$ (I would not add these two last comments as I am a bit sick of this site and instant knee-jerk reaction, yet AI insisted that my reasoning is more than plausible and needs further attention.) $\endgroup$
    – user524860
    yesterday
  • 2
    $\begingroup$ @alex.peter What do you mean by “AI insisted that my reasoning is more than plausible”? AI can’t reason about math. It just estimates the probability one word follows another word. I’ve seen the latest version of ChatGPT still answer freshman calculus test problems incorrectly. $\endgroup$
    – KConrad
    yesterday
29
$\begingroup$

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.

$\endgroup$
0
14
$\begingroup$

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.

$\endgroup$
2
  • 1
    $\begingroup$ So, this doesn't actually answer the question, right? $\endgroup$ Dec 22, 2010 at 22:19
  • $\begingroup$ 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. $\endgroup$ Dec 22, 2010 at 22:29
12
$\begingroup$

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.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.