Hardy's Theorem
The
Riemann Hypothesis
says that every non-trivial zero of \zeta(s) sits exactly on the
critical line \Re(s) = \tfrac12. For fifty years after Riemann's 1859
paper, nobody could prove that even one zero lands there. Numerics found zeros on the line,
but a computed value near \tfrac12 is not a proof that the real
part is exactly \tfrac12 — it might be
0.5000001.
In 1914, G. H. Hardy broke the deadlock. He proved that
\zeta has infinitely many non-trivial zeros lying
precisely on the critical line. It was the first genuine progress toward the Riemann
Hypothesis, and — as we'll be careful to stress — it is dramatically weaker than the
Hypothesis itself. But the device Hardy invented to do it, a way of turning
\zeta on the line into an honest real-valued function, is
still the engine behind every large-scale zero computation today.
The obstacle: a complex value can't "cross" zero
Here is the difficulty. On the critical line we substitute
s = \tfrac12 + it and study
\zeta(\tfrac12 + it) as t runs up the line.
This is a complex number for each t. A complex-valued function of
a real variable traces a curve wandering around the plane; it can circle the origin, dodge it, brush
past it — but "it changed sign, so it must have passed through zero" is an argument available only
to a real function of a real variable. Complex numbers aren't ordered. There is no
Intermediate Value Theorem to lean on.
Hardy's idea was to rotate away the phase. At each height t,
\zeta(\tfrac12 + it) points in some direction in the complex plane; if we
can compute that direction and multiply by a unit complex number that cancels it exactly, we are
left with a real number of the same magnitude — which is zero iff
\zeta(\tfrac12 + it) was zero. That rotation is the
Riemann–Siegel theta function.
Hardy's Z-function
Define the Riemann–Siegel theta function
\theta(t) = \arg\Gamma\!\left(\tfrac14 + \tfrac{it}{2}\right) - \tfrac{t}{2}\ln\pi,
a smooth, real-valued function of t (its large-t
shape is \theta(t) \approx \tfrac{t}{2}\ln\tfrac{t}{2\pi} - \tfrac{t}{2} -
\tfrac{\pi}{8}). Now define Hardy's Z-function
(also called Hardy's function):
-
Z(t) = e^{i\theta(t)}\,\zeta\!\left(\tfrac12 + it\right).
-
For every real t, the value
Z(t) is a real number.
-
Its magnitude is unchanged: |Z(t)| = |\zeta(\tfrac12 + it)|, since
|e^{i\theta(t)}| = 1.
Why is Z(t) real? The functional equation makes
\zeta(\tfrac12+it) and its complex conjugate
\zeta(\tfrac12-it) = \overline{\zeta(\tfrac12+it)} related by exactly the
phase factor e^{2i\theta(t)}. The theta rotation is precisely tuned to
undo half of that phase, landing the product on the real axis. The factor
e^{i\theta(t)} is a pure "un-twist": it never vanishes and never changes
the size of anything, it only spins \zeta(\tfrac12+it) back onto the real
line.
The key equivalence: zeros become sign changes
Because e^{i\theta(t)} is never zero, the two functions vanish at exactly
the same places:
\zeta\!\left(\tfrac12 + it\right) = 0 \quad\Longleftrightarrow\quad Z(t) = 0.
-
A non-trivial zero of \zeta lies on the critical line
at height t if and only if the real function
Z(t) equals 0.
-
Z is real and continuous, so wherever it changes sign
it must pass through 0 — the Intermediate Value Theorem now
guarantees a genuine zero of \zeta exactly on the line.
This is the whole trick in one sentence: a sign change of the real function
Z is a certificate that \zeta has a zero
sitting precisely on \Re(s) = \tfrac12 — no rounding, no "close
to \tfrac12", but exactly on it. Counting on-line zeros up to height
T becomes counting sign changes of one real graph.
Seeing it: Z(t) crossing zero
Below is Hardy's Z(t) for real t, computed by
the Riemann–Siegel formula
(the same tool used in the record-breaking searches). It is a real, wiggling curve. Every time it
crosses the horizontal axis, that crossing is a non-trivial zero of
\zeta sitting exactly on the critical line.
Worked example — pinning the first zero. Evaluate the real number
Z(t) at two heights straddling t = 14. A short
computation gives Z(13) \approx -0.80 < 0 and
Z(15) \approx +0.72 > 0. Since Z is continuous
and has swapped from negative to positive, the Intermediate Value Theorem forces a
t^* \in (13,15) with Z(t^*) = 0 — and
therefore \zeta(\tfrac12 + it^*) = 0, a zero exactly on the
line. Refining the bracket lands on t^* = 14.1347\ldots, the famous first
non-trivial zero. Notice what we did not need: we never had to compute
\zeta off the line, and we never had to trust that a number was "close
enough" to \tfrac12. Two real evaluations and a sign flip did it.
Hardy's theorem, and the shape of the proof
-
The function Z(t) changes sign infinitely often as
t \to \infty.
-
Equivalently, \zeta(s) has infinitely many
non-trivial zeros with real part exactly \tfrac12 — infinitely many
zeros lie on the critical line.
The elegance is in how Hardy shows Z keeps changing sign without
ever locating a single zero exactly. Suppose, for contradiction, that
Z(t) were eventually one sign — say
Z(t) \ge 0 for all large t. Then averages
(integrals) of Z against smooth weights would settle into a predictable
one-sided behaviour. Hardy studied exactly such moments — integrals of the form
\int_0^{T} Z(t)\,\varphi(t)\,dt,
for cleverly chosen weights \varphi. Using the functional equation he
pinned down their size and — crucially — showed they take both positive and negative
values for arbitrarily large T. A function that stayed one sign could
never make its running averages swing both ways. The contradiction means
Z must go positive and negative infinitely often, i.e. it has infinitely
many sign changes — infinitely many on-line zeros. It is a pure "you can't have it both ways"
argument: the existence of zeros is forced, even though none is ever named.
This is the single most important thing to keep straight. Hardy proved infinitely many
zeros are on the critical line. The Riemann Hypothesis says all of them are. Those
are enormously different statements — because \zeta has
infinitely many non-trivial zeros in total.
An analogy: proving "there are infinitely many even numbers" tells you nothing about whether
every integer is even. You can have an infinite set sitting on the line and still an
infinite set lurking off it. In fact the number of zeros up to height T
grows like \tfrac{T}{2\pi}\ln\tfrac{T}{2\pi}, whereas Hardy's original
argument only guaranteed infinitely many on the line — which could still be a vanishing
fraction of the whole. Closing the gap between "infinitely many" and "all" (or even "most") is the
entire subsequent history of the problem, and the "all" end is still wide open.
Picture \zeta(\tfrac12 + it) as an arrow in the complex plane that swings
around as t increases. The theta function
\theta(t) is, essentially, a running record of how much that arrow
has rotated — it is (up to the \Gamma and
\pi book-keeping) the phase you'd need to unwind. Multiplying by
e^{i\theta(t)} spins the arrow back down onto the real axis at every
height at once.
Because |e^{i\theta(t)}|=1, the un-twist never stretches or
shrinks the arrow and never creates or destroys a zero — it only removes the phase. That is
why the trade is exact: Z(t)=0 precisely when
\zeta(\tfrac12+it)=0. The whole reason a real-analysis idea (sign
changes, the Intermediate Value Theorem) can say anything about a complex function is this one
phase-removing gadget.
After Hardy: from "infinitely many" toward "all"
Hardy's theorem opened a century-long campaign to enlarge the fraction of zeros proven to be
on the line. Write N(T) for the number of non-trivial zeros up to height
T, and N_0(T) for how many of those are on the
critical line. The milestones:
| Year | Who | Result about on-line zeros up to T |
| 1914 | Hardy | N_0(T) \to \infty — infinitely many are on the line |
| 1921 | Hardy & Littlewood | N_0(T) \ge cT for some c>0 — at least order T of them |
| 1942 | Selberg | N_0(T) > c\,N(T) — a positive proportion (the first!) |
| 1974 | Levinson | at least \tfrac13 of the zeros are on the line |
| 1989 | Conrey | more than \tfrac25 (about 40.9\%) are on the line |
Notice the qualitative jump at Selberg. Hardy–Littlewood's N_0(T) \ge cT
sounds strong, but since the total count N(T) grows like
T\ln T, a bound of order T is still a
vanishing fraction. Selberg was the first to prove a fixed percentage of
zeros lie on the line, and Levinson and Conrey pushed that percentage up toward a half. Even so,
Conrey's 2/5 is a long way from 100\% — the
Riemann Hypothesis remains unproven, and the ceiling on the proportion has crept up only slowly
since.
G. H. Hardy (1877–1947), of Cambridge and later Oxford, was one of the great English analysts and
the famous collaborator of both J. E. Littlewood and the self-taught genius Srinivasa Ramanujan. He
was a devout atheist with a running joke that he was locked in a feud with God. Legend has it that
before a stormy North Sea crossing he once sent a postcard claiming he had proved the Riemann
Hypothesis — reasoning that God, who he was sure existed only to spite him, would never let him die
with such undeserved glory to his name, and so would have to calm the sea. His 1914 theorem was a
real result of exactly the kind he loved: deep, clean, and about the deepest problem there is.