The Riemann hypothesis — walking both ways between primes and zeros. And Λ = 0 exactly, which is to say no slack at all
Do all the non-trivial zeros of the zeta function lie on the line with real part 1/2? Unsolved since 1859. This article is a record of running the explicit formula both ways: add up the zeros and the staircase of primes appears; from the primes alone, the heights of the zeros are recovered. And for the de Bruijn–Newman constant, Λ ≥ 0 is a theorem and Λ ≤ 0 is the conjecture — the Riemann hypothesis is equivalent to "exactly 0", with no slack at all. Only one side could be proved because only one side is a claim about a positive-proportion phenomenon.
Leanmachine-checked (Lean 4 + mathlib, standard axioms only, no sorryAx, no native_decide; theorem names given)
paperproved, not yet machine-checked
computationchecked on this machine, within the range stated; not a claim made to the outside
knowna restatement, a known theorem, or a check of the literature
- What this problem is
- How far the world has come
- What was done ①: three ways of escaping the complex numbers — what axis is 1/2?
- What was done ②: building the staircase of primes from the zeros (both ways)
- What was done ③: recounting the primes with the zeros
- What was done ④: the Riemann hypothesis is true only barely
- What comes into view when it is set beside Collatz
- What remains — why only one side could be proved
- Sources and reproduction
What this problem is
The Riemann hypothesis: the non-trivial zeros of the zeta function ζ(s) all lie on the line with real part 1/2.
A conjecture Riemann touched on in a single line of an 8-page paper in 1859. It is one of the Millennium Prize Problems, and it has gone unsolved for 167 years.
Why it is a problem about primes. The explicit formula Riemann wrote in the same paper is the reason.
The left side ψ(x) is the staircase of primes (the sum of log p over prime powers up to x). Not one prime appears on the right. What appears is ρ — the zeros of zeta, and nothing else.
How far the world has come
The proportion of zeros — that 67.250% lie on the critical line is a theorem
| Year | Who | Proportion of zeros on the critical line |
|---|---|---|
| 1942 | Selberg | a positive proportion (the value is small) |
| 1974 | Levinson | 1/3 |
| 1989 | Conrey | 2/5 |
| around 2020 | Pratt–Robles et al. | 0.6725 |
This needs to be read carefully.
"67.250% of the zeros lie on the critical line" is a theorem. "The Riemann hypothesis is 67.250% proved" is not.
The former is a theorem about a different proposition, and a state of being 67% proved does not exist.
What is more, this 67.250% has reached 98.6% of the ceiling of 68.185% for pair correlation at bandwidth 1. Which is to say we are just short of the limit of the present tools.
It can be counted — and that is decisive
The Riemann hypothesis has a formula for how many zeros there are up to height T (Riemann–von Mangoldt). So one can establish that "if there are as many sign changes as that count, nothing has been missed in that range". Confirmed on this machine as well. computation
| Height T | the formula N(T) | sign changes of Z(t) | agree |
|---|---|---|---|
| 100 | 28.13 | 29 | yes |
| 400 | 200.51 | 201 | yes |
| 800 | 490.66 | 491 | yes |
It can be written without complex numbers — Robin's criterion
The Riemann hypothesis has an equivalent form that uses no complex numbers at all.
σ(n) is the sum of divisors. A counterexample would be finite evidence — in logical terms it is Π₁. The margin is thin, though.
| n | σ(n)/(n ln ln n) | eγ | margin |
|---|---|---|---|
| 10080 | 1.7558 | 1.7811 | 1.42% |
The interval for Λ — a quantity whose being pushed down is itself the proof
| Year | Who | What | Interval for Λ |
|---|---|---|---|
| 1950 | de Bruijn | upper bound 1/2 | (−∞, 0.5] |
| 2018 | Rodgers–Tao | lower bound 0 (theorem) | [0, 0.5] |
| 2019 | Polymath 15 | upper bound 0.22 | [0, 0.22] |
| 2021 | Platt–Trudgian | upper bound 0.2 | [0, 0.2] |
| —— | —— | upper bound 0 = a proof of the Riemann hypothesis | [0, 0] |
This is treated in detail in §06. Making 67.250% into 100% does not give the Riemann hypothesis, but pushing the upper bound on Λ down to 0 is the proof of the Riemann hypothesis itself. The 2026 candidates that have not been peer-reviewed (0.1875, 0.1787854, 0.172422), and how far the public logs alone reach, are in How far the published logs alone reach.
What was done ① — three ways of escaping the complex numbers
The starting point is a single fact.
A computation with complex numbers has 2 dimensions of input and 2 of output, 4 in all. So a brain optimised for three dimensions cannot process it as it stands.
This is not a metaphor but an exact description. The graph of a complex function lives in 4 dimensions and does not fit into 3-dimensional space. So mathematics has invented ways of dropping a dimension. We apply three common ones to the same function.
Escape 01: narrow the input to a single line and draw it over time
Fix the real part σ and move only the imaginary part t, and the input becomes 1-dimensional, so only the 2 dimensions of output are left and a curve can be drawn in the complex plane.
| Line | minimum distance to the origin | |
|---|---|---|
| Re(s) = 1/2 | 0.00200 | passes through it (= there is a zero) |
| Re(s) = 0.85 | 0.24210 | does not |
| Re(s) = 0.30 | 0.17245 | does not |
* The 0.00200 on the critical line is a residue from sampling t discretely; refine the step and it goes as close to 0 as you like.
What was thrown away: one dimension of input. The part of the hypothesis that says "it does not pass through on the other lines" cannot be checked in this picture.
Escape 02: push the 2 dimensions of output into colour
Hue = the argument of the output (a quantity that rotates, so it suits a cyclic hue), lightness = the magnitude of the output (compressed logarithmically). Then a single picture can be drawn over the input plane.
A zero is visible as a point where all the hues meet. Such points line up along a single vertical line — that is Re(s) = 1/2. The evenly spaced dark points at the left edge (σ < 0) are the trivial zeros (the negative even integers), which are not what the hypothesis is about.
What was thrown away: the readability of magnitude in the output. Hue is cyclic, so "which is larger" cannot be read.
Escape 03: on the critical line alone, the 4 dimensions become a 1-dimensional wave
The Riemann–Siegel Z function. This happens only on the critical line.
Four dimensions have fallen to a single real wave. The zeros can be counted by eye as "sign changes" — this is the substance of "it can be counted" in §02.
What was thrown away: the freedom to leave the critical line. Z is not real off the critical line. This escape can only be used inside "the world in which the hypothesis holds", and cannot be used to look for a place where the hypothesis breaks.
None of the three actually sees four dimensions
| Escape | What was kept | What was thrown away | What it cannot do |
|---|---|---|---|
| narrow to a line | the whole 2 dimensions of output | 1 dimension of input | cannot examine every line |
| push into colour | the whole 2 dimensions of input | magnitude of the output | values cannot be read |
| make it a real wave | exactness of counting | freedom to leave the critical line | cannot look for a counterexample |
So what is 1/2?
1/2 is the position of a mirror. For a suitably normalised ξ(s), ξ(s) = ξ(1−s) holds, and the set of points left fixed by that exchange is Re(s) = 1/2 (the solutions of σ = 1−σ).
"It is symmetric" is the theorem; "it is on the axis" is the conjecture. Symmetry alone would allow zeros to exist as a pair at 0.3 and 0.7. The hypothesis says there is not one such pair.
The brain already does the same thing
And this constraint did not begin with four dimensions. What the eye receives is a 2-dimensional image, and the brain raises it into 3 dimensions from binocular disparity, from motion, and from the sense of distance in the hand.
| What is really there | What is received | What is done | |
|---|---|---|---|
| vision | a 3-dimensional world | a 2-dimensional retinal image | raised from binocular disparity, motion and the sense of distance in the hand |
| complex functions | a 4-dimensional graph | a 2-dimensional picture | raised from lines, colour and a phase factor |
Three dimensions are not seen directly either. Received after being dropped, then raised again from other cues — that is the normal state of perception, and four dimensions are not specially invisible.
What differs is the abundance of cues. The cues for raising three dimensions are built into the body; the cues for raising four have to be made oneself.
What was done ② — building the staircase of primes from the zeros (both ways)
The explicit formula from §01, run on this machine. Both ways. computation
Forwards: add up the zeros and the staircase appears
Pairing ρ = ½ ± iγ, the contribution of one zero becomes a wave of frequency γ.
With 0 zeros the right side is just a straight line. Add waves to it and steps rise exactly at the primes. 2, 3, 4, 5, 7, 8, 9, 11 — at the primes and prime powers, and nowhere else.
| number of zeros | mean error | number of zeros | mean error |
|---|---|---|---|
| 0 | 1.19905 | 100 | 0.28873 |
| 1 | 1.03142 | 500 | 0.10649 |
| 10 | 0.74969 | 1000 | 0.07010 |
| 50 | 0.41001 | 1499 | 0.05454 |
The crests and troughs of the waves line up in the same direction at the positions of the primes. Everywhere else they cancel. The height γ of a zero is a frequency encoding the positions of the primes.
Backwards: get the heights of the zeros from the primes alone
If it is a spectrum, the inverse transform ought to work too. Using the prime powers up to 2 million, the following sum is computed. No information about the zeros was put in.
| position of the peak | true γ | discrepancy |
|---|---|---|
| 14.161 | 14.134725 | 0.0267 |
| 21.023 | 21.022040 | 0.0009 |
| 32.936 | 32.935062 | 0.0006 |
| 37.587 | 37.586178 | 0.0005 |
| 43.328 | 43.327073 | 0.0010 |
10 out of 10. At best they agree to the fourth decimal place.
That is to say the heights of the zeros are right there in the sequence of the primes.
* A window function (a Fejér-type triangular window) is needed. In the raw sum the peaks are buried in the background made by the edge of the truncation.
What was done ③ — recounting the primes with the zeros
ψ(x) is "the sum over prime powers weighted by log p". This time it is π(x) — the number of primes up to x — itself.
First, count them ourselves
The values of π(10k) are famous, and copying them out takes a moment. They are sieved for anyway. Copying from memory has produced errors elsewhere in this section (verifying labels). What can be counted, count. computation
| k | π(10ᵏ) | li(10ᵏ) | li − π | R(10ᵏ) | R − π |
|---|
R is far closer than li
| k | |li − π| | |R − π| | how many times closer |
|---|
R is 4 to 31 times closer than li. It is better by exactly as much as it anticipates the correction coming from the zeros.
And looking at the table, one more thing stands out. li − π is positive at every k.
A famous example of "what the numbers show" disagreeing with "what the theorem says". li being always above up to 10⁸ guarantees nothing at all.
Add up the zeros and the staircase of π(x) appears
| number of zeros | mean error |
|---|
The π side is far heavier than the ψ side. R is an infinite Möbius sum, and the exponential integral has to be computed at a complex argument every time. 200 zeros take 2,203 seconds. Even for the same theorem, which quantity you choose changes the weight of the computation.
What was done ④ — the Riemann hypothesis is true only barely
This is not a metaphor. The "barely" part became a theorem in 2018.
Newman wrote in 1976: "even if the Riemann hypothesis is true, it is only barely true". Forty-two years later, Rodgers and Tao proved it.
What Λ is — seen in a small model
There is an operation of flowing heat into the zeros. Raise the time t and the zeros move, and at some time they all land on the real axis. That boundary is Λ.
The same happens with polynomials. Multiplying by e^(−t·d²/dx²) turns x²+a² into x²+a²−2t, and at t = a²/2 the complex roots become real.
The complex pair approaches the real axis and merges onto it at t ≈ 0.1020. This 0.1020 is the "Λ" of this polynomial. The Riemann hypothesis is "the Λ of zeta is at most 0" — that is, the claim that at t = 0 everything is already on the real axis. computation
The "barely" side became a theorem first
| Claim | Meaning | State |
|---|---|---|
| Λ ≤ 0 | at t=0 everything is already real = the Riemann hypothesis | unsolved |
| Λ ≥ 0 | before t=0 not everything is real = there is no slack | 2018, a theorem |
What was proved is the side that makes the problem harder. Had Λ < 0 there would be a safety margin and the road to a proof would have widened. Rodgers and Tao proved that no such margin exists. The way they did it is telling too: they use the "irregularity" of the zeros to deny the existence of slack.
Measuring that "barely"
| normalised gap | measured | random matrix (GUE) | if uncorrelated |
|---|---|---|---|
| [0, 0.2) (very close pairs) | 0.00267 | 0.00839 | 0.18127 |
| [0.8, 1.0) | 0.21348 | 0.18571 | 0.08145 |
| [2.0, 3.0) | 0.01001 | 0.01701 | 0.08555 |
Very close pairs are only 1/68 of what they would be if uncorrelated. The zeros repel one another. computation
The 1496th zero (at height 1977.17) has an index 1/229 of the median. Even at this modest height there is already a pair this close.
Λ is a gauge for the Riemann hypothesis itself
Proving Λ ≤ 0 is proving the Riemann hypothesis itself. Not a restatement — an equivalence.
The lower half is already closed. What remains is only "push the upper bound down to 0", and the moment that is done the Riemann hypothesis is proved.
This property is a rare one. "67.250% of the zeros lie on the critical line" does not automatically become the Riemann hypothesis when it reaches 100% (all the zeros being on the critical line and the proportion being 1 are different things). The upper bound on Λ is the only quantity whose being pushed down is itself the proof.
What comes into view when it is set beside Collatz
This section compares with the Collatz conjecture. The most important thing first.
On the single point of settlement, the two are in exactly the same place. Both are "unknown".
What the comparison below measures is not "the distance to a settlement" but "the amount and kind of knowledge accumulated".
And "more accumulated ⇒ settled sooner" is not guaranteed by history.
| Question | Riemann | Collatz |
|---|---|---|
| Proved? | no | no |
| Disproved? | no | no |
| Known around it | a lot | a little |
The first two rows are the goal, and there it is a dead heat. Only the third row differs. That third row splits into six axes.
| Axis | What it measures | Riemann | Collatz | Which knows more |
|---|---|---|---|---|
| 01 | logical form | Π₁ (Robin's criterion writes it without complex numbers. A counterexample is finite evidence) | the divergence side is Π₂ (a counterexample gives no finite evidence) | Riemann |
| 02 | partial results | 67.250% of the zeros on the critical line (theorem) | Krasikov–Lagarias' x0.84 falls to density 0. Stopped since 2003 | Riemann |
| 03 | mechanism of verification | the formula N(T) lets you say "everything up to height T" | there is no formula for "how many are above" | Riemann |
| 04 | a name for the obstacle | over finite fields it is a theorem (Weil / Deligne). The obstacle can be named: "not enough geometry" | we cannot even say what is missing | Riemann |
| 05 | confidence in the numbers | Robin's margin is measured at only 1.42% (n=10080) | measured up to 2⁷¹, with a wide margin | Collatz |
| 06 | shape of the wall | 67.250% is 98.6% of the pair-correlation ceiling 68.185% | the same shape (just below the ceiling of the tools) | the same |
Having accumulated more does not mean settling sooner
The two views from here on — "it cannot be crossed by accumulation" and "what can be proved is always the side with no slack" — turn up beyond this problem too. Five problems lined up against the same measure is Problems remain only at the exact edge.
| Example | What happened |
|---|---|
| Fermat's Last Theorem | 150 years' worth of partial results piled up, and Wiles' proof uses none of them |
| The sensitivity conjecture | With almost no scaffolding, it was solved in 2 pages in 2019 |
One thing, though, that has the same shape
In both problems, what was proved is the "no slack" side.
For Riemann it is Λ ≥ 0 (no slack); for Collatz, q = 3 is the only criticality.
Mathematics has succeeded, for both, in showing that there is nowhere to run, and has not succeeded in producing an answer.
And one more thing. In both, the object is "as irregular as possible". The number of divisions in Collatz is perfectly equidistributed (Terras), and the zeros repel one another perfectly (1/68 of uncorrelated, measured in this article). The irregularity is a theorem; the regularity is a conjecture. Both stop there.
An estimate (an unmeasurable prediction about unmeasurable things)
| Riemann | Collatz | |
|---|---|---|
| true | 98% | 99% |
| settled this century | 35% | under 10% |
The likelihood of truth is about the same. The difference is inside the resolution and means nothing. The numerical precedent (axis 05) is not a mark against Riemann — the Mertens conjecture is a strengthening of the Riemann hypothesis, and its failure says nothing about the Riemann hypothesis itself. If anything the marks against are on the Collatz side: the nearby 3n−1 has a cycle, and 5n+1 diverges.
What remains — why only one side could be proved
Where the open items that have moved now stand is in What remains. Only what is open at present is placed here.
| Content | |
|---|---|
| established | The explicit formula runs both ways (forwards: error 1.199→0.0545 / backwards: 10/10 recovered)computation |
| established | π(10ᵏ) counted up to k=8; R is 4 to 31 times closer than licomputation |
| established | The mechanism of Λ reproduced with a polynomial (the complex roots merge onto the real axis at t≈0.1020)computation |
| established | The zeros repel down to 1/68 of uncorrelated (1500 zeros)computation |
| not established | Whether the real part of the zeros really is 1/2. Every computation in this article puts in "the real part is 1/2" as an assumption |
| not established | Where the sign of li − π changes. Counted only up to 10⁸ |
| not established | The height at which the gaps between zeros start matching GUE. Up to height 2000 they are more regular than predicted (0.00267 against 0.00839 in [0, 0.2)); where the swap happens has not been measured |
| not established | The conjecture itself. There is no new mathematics in this article |
Why the two directions of Λ are asymmetric
The line by which Rodgers–Tao proved Λ ≥ 0 runs like this.
If Λ < 0, then at t = 0 the zeros would have to be more regular than they actually are.
But the zeros are not that regular — and that is already known. Hence Λ ≥ 0.
| What is to be shown | Information needed | In hand? |
|---|---|---|
| Λ ≥ 0 (no slack) | A lower bound on the irregularity of the zeros | yes (unconditionally) |
| Λ ≤ 0 (= the Riemann hypothesis) | An upper bound on the irregularity of the zeros | No. And that is as hard as the Riemann hypothesis itself |
known "Why only one side?" has a name one step further on. What the proved side says is "the zeros are not equally spaced in local average" — a claim about a positive proportion of the zeros, within reach of tools that take averages. What the unproved side says is "not one zero lies off the critical line" — a claim about the absence of a zero-proportion defect. Zeros off the line, if there were any, could have density 0, and something of density 0 is not seen by any correlation, any moment, or any asymptotic formula. Knowing that the zeros are perfectly regular by every measure would not give the Riemann hypothesis. Averages see what is crowded and not what is sparse; only one side could be proved because only one side is a claim about the crowded part. Logical form does not explain the direction — Λ ≤ 0 is Π₁ and Λ ≥ 0 is Π₂, and the one higher in the hierarchy is the one that is proved. Collatz has the same shape: "almost every orbit attains an almost bounded value" is a positive proportion; "there is no cycle" is a single orbit.
known The quantities that can be measured on the zeros themselves are all restatements. At a zero ρ = 1/2 + iγ on the critical line, Re ζ′(ρ) > 0 ⟺ |S(γ)| < 1/2 (S the argument function; an identity stated verbatim in arXiv:2305.14253). Moving the zeros of the Hurwitz zeta ζ(s, a) in a, the first-order perturbation is dρ/da|a=1 = ρζ(ρ+1)/ζ′(ρ) (elementary). Both restate analytic properties of ζ, and neither moves the direction of Λ.
One checkpoint. When a statistic measured on the zeros shows structure, first check whether a point process that does not use ζ (a uniform sequence of the same density, or the eigenvalues of GUE) gives the same value. If it does, it is an identity, not a discovery.
Sources and reproduction
| Thing | Kind | Source or tool |
|---|---|---|
| The explicit formula and the functional equation | theorem | Riemann (1859) / von Mangoldt (1895) |
| Z(t) is real on the critical line | theorem | Riemann–Siegel |
| The sign of li − π changes infinitely often | theorem | Littlewood (1914) |
| Robin's criterion | theorem | Robin (1984) |
| The Riemann hypothesis ⟺ Λ ≤ 0 | theorem | de Bruijn (1950) / Newman (1976) |
| Λ ≥ 0 | theorem | Rodgers–Tao (2018), arXiv:1801.05914 |
| Λ ≤ 0.22 | theorem | Polymath 15 (2019) |
| Λ ≤ 0.2 | theorem | Platt–Trudgian (2021), Bull. LMS |
| Re ζ′(ρ) > 0 ⟺ |S(γ)| < 1/2 | known | arXiv:2305.14253 |
| First-order perturbation of the zeros in the Hurwitz family | known (elementary) | dρ/da = ρζ(ρ+1)/ζ′(ρ) |
| γ for 1500 zeros | computed on this machine | mpmath |
| The three trajectories, the domain colouring, Z(t) | computed on this machine | mpmath at 25 digits |
| Reconstruction of ψ(x) (forwards and backwards) | computed on this machine | backwards uses pk < 2×10⁶, 149,235 terms plus a Fejér window |
| π(10ᵏ), k = 1–8 | computed on this machine | the sieve of Eratosthenes, 5 seconds |
| The heat flow of the polynomial (merging at 0.1020) | computed on this machine | a degree-6 polynomial, tracking the roots |
| The distribution of gaps between zeros, and Lehmer pairs | computed on this machine | with a comparison against GUE |
| N(T) against the sign changes of Z(t) | computed on this machine | exact agreement up to T=800 |
There is no new mathematics in this article. The explicit formula is from 1859, the three visualisations are standard techniques, and Λ and Rodgers–Tao are known. What this article did was actually run it, produce the numbers, and make the pictures. The heaviest fact in the computations is that the backwards direction works — a peak rises in a sum over the primes, and its position differs from 21.022040 by only 0.0009.