29
$\begingroup$

I've often seen it stated (in vague terms) that there's a Fourier duality between the set of prime numbers and the set of nontrivial Riemann zeta zeros.

Because there are various explicit formulae whereby prime counting functions can be expressed as infinite sums of sinusoidal functions over the set of zeta zeros, I had always assumed that the same thing would work in the opposite direction. That is, I imagined there was a well-known formula whereby the nontrivial-zeta-zeros-counting function could be expressed as an infinite sum of sinusoidal functions over the set of primes.

However, I've been unable to find such a formula. The only explicit formula I've found for this counting function looks like this:

$$f(E) = \frac{1}{\pi} \Im(\ln(\Gamma(1/4 + iE/2)) - \frac{E}{2\pi}\ln(\pi) + \frac{1}{\pi} \Im(\ln(\zeta(1/2 + iE)) + 1$$

where there's no explicit involvement of the primes.

Is anyone aware of a formula of the type I'm seeking? I'm quite sure such a thing must exist, since a programmer friend recently looked at this and got curious enough to "illegally" substitute the (truncated) Euler product expression for zeta in the above (it doesn't converge in the critical strip, hence such a substitution is not mathematically valid), just to see what the resulting function would look like. His plots of

$$N_m(E) = \frac{1}{\pi} \Im(\ln(\Gamma(1/4 + iE/2)) - \frac{E}{2\pi}\ln(\pi) - \frac{1}{\pi} \sum_{p < m} \Im(\ln(1-p^{-1/2-iE})) + 1$$

in three colours (corresponding to $m = 100$, $1000$ and $10000$, and where $E$ varies from $4$ to $60$) can be seen here:

plot

The positions of the zeta zeros are clearly visible, so even though this isn't a valid formula, I imagine that there must be something like this which is valid.

$\endgroup$
  • $\begingroup$ i found the formulas in the Riemann hypothesis confusing to read. The squiggy and chaotic nature is hidden in the equations $\endgroup$ – john mangual Jul 3 '16 at 2:31
18
$\begingroup$

It looks like the exact formula being sought here can be found in A.P. Guinand, "A summation formula in the theory of prime numbers", Proceedings of the London Mathematical Society (2) 50 (1948) 107--119. The first page is visible here without subscription:

http://plms.oxfordjournals.org/content/s2-50/1/107.extract


        Riemann Sum Formula


You can see the explicit formula in the abstract, although hard to see the fine detail without access to the full PDF. This is a general form involving a function $f$ and an integral transform thereof. The abstract mentions "appropriate conditions" on $f$: I can't see what these are, but with an appropriate choice of this function, the formula displayed would presumably reduce to a fairly straightforward relation between a sum over the primes and a sum over the nontrivial zeros.

$\endgroup$
10
$\begingroup$

Assuming the Riemann Hypothesis, you can use a smooth approximation to the characteristic function of an interval in the Guinand-Weil explicit formula to approximately count the number of zeros of the zeta-function in an interval on the critical line. This expresses the approximate number of such zeros in terms of an integral of your test function and a sum over primes, as you seek. In fact, this can be set-up in such a way that the sum over primes is finite. (This method can be used to give upper and lower bounds for the number of zeros, but not an exact formula.)

The details are (essentially) contained in a paper by Goldston & Gonek "A note on S(t) and the zeros of the Riemann zeta function" available on Dan Goldston's webpage: math.sjsu.edu/~goldston/publications.htm

$\endgroup$
10
$\begingroup$

The formula is given by Guinand as said in his answer by Matthew Watkins but it can be found in page 111 of the paper and reads: assuming Riemann Hypothesis and $T>0$ $$\frac12(N(T+0)+N(T-0))=\frac{T}{2\pi}\log\frac{T}{2\pi}-\frac{T}{2\pi}-$$ $$- \frac{1}{\pi}\lim_{N\to\infty}\Bigl[\sum_{n=1}^N\Lambda(n)\frac{\sin(T\log n)}{n^{1/2} \log n}-\int_1^N \frac{\sin(T\log t)}{t^{1/2}\log t}dt-$$ $$-\frac{\sin(T\log N)}{\log N}\Bigl(\sum_{n=1}^N\Lambda(n)n^{-1/2}-2N^{1/2} \Bigr)\Bigr]+$$ $$+\frac{1}{2\pi}\left(\operatorname{\rm am}\Gamma\left(\frac12+iT\right)-T\log T+T\right)+$$ $$+\frac{1}{\pi}\arctan(2T)-\frac{1}{4\pi}\arctan(\sinh(\pi T)),$$ where $\operatorname{\rm am} \Gamma(\frac12+it)$ is defined by making $\operatorname{\rm am} \Gamma(\frac12)=0$ and continuing analytically along any path not meeting the real axis.

Of course the sums where $\Lambda(n)$ appears can be considered sum about primes.

$\endgroup$
  • 1
    $\begingroup$ What is am? argument? $\endgroup$ – Marc Palm Feb 9 '14 at 11:55
  • 2
    $\begingroup$ @MarcPalm Yes, but I maintained the notation in Guinand $\endgroup$ – juan Feb 9 '14 at 19:54
9
$\begingroup$

Guinand's paper is accessible at archive.org (p.111)

$\endgroup$
1
$\begingroup$

This may not help you, but: With Excel I calculated the Discrete Fourier Transform of a function = unit spikes at locations of the logarithms of a few hundred primes. The zeta zeros (imaginary part) show up as spikes. But it only works for small numbers of primes and zeros. For a better approximation, I reversed the explicit formula in Riemann's, making the spike heights = ln(p)/sqrt(p), and included powers of primes at 1/exponent as much, like the Von Mangoldt function. That gave much cleaner results, valid for thousands of primes and zeros. However it does diverge (increasing oscillations) for really big values, because logs of primes get close (more than the zeta zeros in Reimann's formula). I'm leaving out some details. If you or anyone is interested, email me at robertjwalcott@yahoo.com for the spreadsheets or graphs.

$\endgroup$

protected by Lucia Jul 3 '16 at 11:18

Thank you for your interest in this question. Because it has attracted low-quality or spam answers that had to be removed, posting an answer now requires 10 reputation on this site (the association bonus does not count).

Would you like to answer one of these unanswered questions instead?

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