<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Number-Theory on Sebastian Spicker</title>
    <link>https://sebastianspicker.github.io/tags/number-theory/</link>
    <description>Recent content in Number-Theory on Sebastian Spicker</description>
    <image>
      <title>Sebastian Spicker</title>
      <url>https://sebastianspicker.github.io/og-image.png</url>
      <link>https://sebastianspicker.github.io/og-image.png</link>
    </image>
    <generator>Hugo -- 0.160.0</generator>
    <language>en</language>
    <lastBuildDate>Mon, 18 Nov 2024 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://sebastianspicker.github.io/tags/number-theory/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Primes Are Energy Levels: The Montgomery-Odlyzko Conjecture</title>
      <link>https://sebastianspicker.github.io/posts/riemann-primes-quantum-chaos/</link>
      <pubDate>Mon, 18 Nov 2024 00:00:00 +0000</pubDate>
      <guid>https://sebastianspicker.github.io/posts/riemann-primes-quantum-chaos/</guid>
      <description>In October 2024, the largest known prime was discovered — 41 million digits, found by a GPU cluster. But the deepest prime story is not about record-breaking numbers. It is about a 1972 teatime conversation at the Institute for Advanced Study, a pair correlation formula, and the suspicion — numerically confirmed to extraordinary precision — that the zeros of the Riemann zeta function are the energy levels of an undiscovered quantum system.</description>
      <content:encoded><![CDATA[<h2 id="a-very-large-prime">A Very Large Prime</h2>
<p>On 12 October 2024, a retired NVIDIA engineer named Luke Durant announced that he had found the 52nd known Mersenne prime. The number is $2^{136{,}279{,}841} - 1$, and writing it out in decimal requires 41,024,320 digits. Durant had organised a cloud network of GPU servers spread across 17 countries — essentially repurposing the hardware that normally trains language models to instead do modular arithmetic on numbers with tens of millions of digits. The verification alone took about 51 days of computation.</p>
<p>This is the kind of thing that makes headlines, and it deserves them. Mersenne primes are rare and verifying them is genuinely hard. But if I am honest, the more interesting prime story of the last half-century is not about the record-breaking number. It is about a conversation over tea in Princeton in 1972, and the increasingly hard-to-dismiss suspicion that the prime numbers are, in a precise statistical sense, quantum energy levels.</p>
<p>When I say &ldquo;quantum energy levels,&rdquo; I mean it almost literally — not as a metaphor. Let me explain.</p>
<h2 id="the-riemann-zeta-function-encodes-the-primes">The Riemann Zeta Function Encodes the Primes</h2>
<p>Start with the most famous function in number theory. For $\operatorname{Re}(s) > 1$, the Riemann zeta function is defined by the series</p>
$$\zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s}.$$<p>This converges nicely and defines an analytic function. But the real reason to care about it is Euler&rsquo;s product formula:</p>
$$\zeta(s) = \prod_{p \text{ prime}} \frac{1}{1 - p^{-s}}.$$<p>This is not obvious — it follows from unique prime factorisation, essentially — but its implications are enormous. The product runs over <em>all</em> primes, and each prime contributes a factor. The primes are encoded in the analytic structure of $\zeta$. If you know $\zeta$, you know the primes; if you understand the zeros of $\zeta$, you understand their distribution.</p>
<p>Riemann&rsquo;s 1859 paper made this explicit (<a href="#ref-Riemann1859">Riemann, 1859</a>). He showed that $\zeta$ extends analytically to the whole complex plane (minus a simple pole at $s = 1$), and he wrote down an explicit formula connecting the prime-counting function</p>
$$\pi(x) = \#\{p \leq x : p \text{ prime}\}$$<p>to the zeros of $\zeta$. The formula is</p>
$$\pi(x) \approx \operatorname{Li}(x) - \sum_{\rho} \operatorname{Li}(x^{\rho}) + \text{(lower-order terms)},$$<p>where $\operatorname{Li}(x) = \int_2^x \frac{dt}{\ln t}$ is the logarithmic integral and the sum runs over the <em>non-trivial zeros</em> $\rho$ of $\zeta$.</p>
<p>What are the non-trivial zeros? The zeta function has trivial zeros at the negative even integers $-2, -4, -6, \ldots$ — boring, understood. The non-trivial zeros lie in the <em>critical strip</em> $0 < \operatorname{Re}(s) < 1$, and their imaginary parts are what drive the oscillatory corrections to $\pi(x)$. Each zero $\rho = \frac{1}{2} + it_n$ contributes a term that oscillates like $x^{1/2} \cos(t_n \ln x)$. The prime distribution is a superposition of these oscillations, one per zero.</p>
<p>The Riemann Hypothesis is the claim that all non-trivial zeros lie on the <em>critical line</em> $\operatorname{Re}(s) = \frac{1}{2}$. It has been verified numerically for the first $10^{13}$ zeros (Gourdon, 2004; building on earlier high-height computations by <a href="#ref-Odlyzko1987">Odlyzko, 1987</a>). It has not been proved. It remains, after 165 years, the most important unsolved problem in mathematics.</p>
<h2 id="tea-with-dyson">Tea with Dyson</h2>
<p>In 1972, Hugh Montgomery was visiting the Institute for Advanced Study in Princeton. He was working on a specific question: if you take the imaginary parts of the non-trivial zeros of $\zeta$ and normalise them so that their mean spacing is 1, what is the distribution of spacings between them?</p>
<p>More precisely, he was computing the <em>pair correlation function</em> of the normalised zeros. If $\tilde{\gamma}_n$ are the normalised imaginary parts (ordered $\tilde{\gamma}_1 \leq \tilde{\gamma}_2 \leq \cdots$), the pair correlation function $R_2(r)$ measures the density of pairs $(\tilde{\gamma}_m, \tilde{\gamma}_n)$ with $\tilde{\gamma}_n - \tilde{\gamma}_m \approx r$.</p>
<p>Montgomery found — subject to certain assumptions about the behaviour of $\zeta$ — that</p>
$$R_2(r) = 1 - \left(\frac{\sin \pi r}{\pi r}\right)^2.$$<p>(<a href="#ref-Montgomery1973">Montgomery, 1973</a>)</p>
<p>He mentioned this to Freeman Dyson over tea. Dyson — who had spent years on quantum mechanics and random matrix theory — recognised the formula immediately. That expression, $1 - (\sin \pi r / \pi r)^2$, is exactly the pair correlation function of eigenvalues of random matrices drawn from the Gaussian Unitary Ensemble.</p>
<p>Montgomery had not been thinking about quantum mechanics. Dyson had not been thinking about primes. The formula matched.</p>
<h2 id="the-gaussian-unitary-ensemble">The Gaussian Unitary Ensemble</h2>
<p>Let me say a few words about where that formula comes from in physics, because it is not obvious.</p>
<p>The Gaussian Unitary Ensemble (GUE) is a probability distribution over $N \times N$ Hermitian matrices. Specifically, it is the distribution proportional to $e^{-\operatorname{tr}(H^2)}$ on the space of Hermitian matrices, which is invariant under conjugation $H \mapsto U H U^\dagger$ for any unitary $U$. The entries on the diagonal are real Gaussians; the off-diagonal entries are complex Gaussians with independent real and imaginary parts.</p>
<p>In the limit $N \to \infty$, the eigenvalues of a GUE matrix distribute globally according to Wigner&rsquo;s semicircle law. But the local statistics — the fine-grained distribution of spacings between nearby eigenvalues — follow a universal law. The pair correlation function is</p>
$$R_2^{\text{GUE}}(r) = 1 - \left(\frac{\sin \pi r}{\pi r}\right)^2.$$<p>This distribution has a crucial qualitative feature called <em>level repulsion</em>: as $r \to 0$, $R_2(r) \to 0$. Eigenvalues of random Hermitian matrices strongly avoid each other. A Poisson distribution — which is what you would get for eigenvalues that were statistically independent — would give $R_2(r) = 1$ everywhere, with no such repulsion. The GUE formula suppresses small gaps quadratically: $R_2(r) \sim \pi^2 r^2 / 3$ for small $r$.</p>
<p>Why does GUE statistics arise in physics? This is the content of the Bohigas-Giannoni-Schmit conjecture (1984), which by now has overwhelming numerical support: quantum systems whose classical limit is chaotic and which lack time-reversal symmetry have energy level statistics described by the GUE. Systems with time-reversal symmetry fall into the Gaussian Orthogonal Ensemble (GOE), which has a different but related formula. Nuclear energy levels, quantum billiards with the right shapes, molecular spectra — all of them, when appropriately normalised, show GUE or GOE statistics.</p>
<p>The universality is the point. It does not matter what the specific Hamiltonian is. If the system is sufficiently chaotic, the eigenvalue statistics are universal.</p>
<h2 id="odlyzkos-computation">Odlyzko&rsquo;s Computation</h2>
<p>Montgomery&rsquo;s result was conditional and covered only a limited range of $r$. The natural next step was numerical verification: actually compute a large number of Riemann zeros and measure their pair correlation.</p>
<p>Andrew Odlyzko did exactly this, in a series of computations beginning in the 1980s. The results were striking (<a href="#ref-Odlyzko1987">Odlyzko, 1987</a>). He computed millions of zeros with high precision and compared their empirical pair correlation to the GUE prediction. The agreement was not merely qualitative — it was quantitatively exact, to within the statistical error of the sample.</p>
<p>Odlyzko then pushed further. He computed zeros near the $10^{20}$-th zero, far out on the critical line. Same statistics. He computed zeros near the $10^{22}$-th zero. Same statistics. The agreement held regardless of how far up the critical line one went. This is not a small-sample artifact and it is not coincidence, or at least it would be an extraordinary coincidence of a kind that mathematics has never before encountered.</p>
<p>The plots from Odlyzko&rsquo;s computations are, in my view, some of the most beautiful images in mathematics. You draw the GUE prediction — a smooth curve, starting at zero, rising to approach 1 — and you overlay the empirical histogram from the Riemann zeros. They are the same curve.</p>
<h2 id="berry-keating-and-the-missing-hamiltonian">Berry, Keating, and the Missing Hamiltonian</h2>
<p>If the zeros of $\zeta$ are energy levels, there should be a Hamiltonian $H$ — a self-adjoint operator — whose spectrum is exactly $\{t_n\}$, the imaginary parts of the non-trivial zeros (assuming the Riemann Hypothesis, so that all zeros are of the form $\frac{1}{2} + it_n$).</p>
<p>In 1999, Michael Berry and Jon Keating proposed a candidate (<a href="#ref-BerryKeating1999">Berry &amp; Keating, 1999</a>). Their suggestion was the classical Hamiltonian</p>
$$H_{\text{cl}} = xp,$$<p>where $x$ is position and $p$ is momentum, quantized with appropriate symmetrization:</p>
$$\hat{H} = \frac{1}{2}(\hat{x}\hat{p} + \hat{p}\hat{x}).$$<p>Classically, $H = xp$ describes a system in which the phase-space trajectories are hyperbolas $xp = E = \text{const}$, and the motion is $x(t) = x_0 e^t$, $p(t) = p_0 e^{-t}$ — exponential expansion in position, contraction in momentum. This is essentially the dynamics of an unstable fixed point, and it is classically chaotic in the appropriate sense.</p>
<p>The semiclassical (WKB) approximation gives an eigenvalue counting function</p>
$$N(E) \approx \frac{E}{2\pi} \ln \frac{E}{2\pi} - \frac{E}{2\pi} + \frac{7}{8} + \cdots,$$<p>which matches Riemann&rsquo;s formula for the number of zeros of $\zeta$ with imaginary part up to $T$:</p>
$$N(T) = \frac{T}{2\pi} \ln \frac{T}{2\pi} - \frac{T}{2\pi} + \frac{7}{8} + O\!\left(\frac{\ln T}{T}\right).$$<p>This is not a coincidence: the correspondence is exact at the level of the smooth counting function. The hard part is the oscillatory corrections — and those require the specific eigenvalues, which requires knowing the boundary conditions.</p>
<p>The problem is that $\hat{H} = \frac{1}{2}(\hat{x}\hat{p} + \hat{p}\hat{x})$ as an operator on $L^2(\mathbb{R})$ is not bounded below and has a continuous spectrum, not a discrete one. Turning it into an operator with a discrete spectrum matching the Riemann zeros requires boundary conditions that have not been found. This is the crux: Berry and Keating have the right classical system, but the quantum boundary conditions are missing.</p>
<p>What would be profound about finding $\hat{H}$? If $\hat{H}$ is self-adjoint and bounded below ($\hat{H} \geq 0$), its eigenvalues are all non-negative real numbers. If those eigenvalues are the imaginary parts of the zeros, then all zeros have real part exactly $\frac{1}{2}$ — which is the Riemann Hypothesis. A proof of the existence of such a Hamiltonian would, in one stroke, resolve the most important open problem in mathematics.</p>
<h2 id="primes-as-periodic-orbits-the-gutzwiller-analogy">Primes as Periodic Orbits: The Gutzwiller Analogy</h2>
<p>The quantum chaos connection goes deeper than pair correlations. In semiclassical quantum mechanics, the Gutzwiller trace formula relates the density of quantum energy levels to a sum over classical periodic orbits:</p>
$$d(E) = \bar{d}(E) + \sum_{\gamma} A_\gamma \cos\!\left(\frac{S_\gamma}{\hbar} - \phi_\gamma\right),$$<p>where the sum runs over all classical periodic orbits $\gamma$, $S_\gamma$ is the classical action of the orbit, $A_\gamma$ is an amplitude, and $\phi_\gamma$ is a phase (Maslov index correction). The smooth part $\bar{d}(E)$ comes from the Thomas-Fermi approximation; the oscillatory part encodes quantum interference between orbits.</p>
<p>The direct analogue in number theory is the <em>explicit formula</em> for the prime-counting function. Written as a formula for the oscillatory part of the zero-counting function, it reads</p>
$$\psi(x) = x - \sum_{\rho} \frac{x^\rho}{\rho} - \ln(2\pi) - \frac{1}{2}\ln(1 - x^{-2}),$$<p>where $\psi(x) = \sum_{p^k \leq x} \ln p$ is the Chebyshev function and the sum is over non-trivial zeros $\rho$.</p>
<p>Comparing these two formulas term by term: the zeros $\rho$ of $\zeta$ play the role of the quantum energy levels $E_n$; the primes $p$ — and their prime powers $p^k$ — play the role of the classical periodic orbits $\gamma$. The &ldquo;action&rdquo; of the orbit corresponding to $p^k$ is $k \ln p$. The primes are the primitive periodic orbits; $p^k$ is the $k$-th traversal of that orbit.</p>
<p>This is not a metaphor or a loose analogy. The Selberg trace formula — developed for the Laplacian on hyperbolic surfaces — makes this correspondence rigorous in a related setting: the periodic geodesics on a hyperbolic surface play the role of primes, and the eigenvalues of the Laplacian play the role of Riemann zeros (<a href="#ref-RudnickSarnak1996">Rudnick &amp; Sarnak, 1996</a>). The Riemann zeta function is the limit of a family of such systems, in some sense that is still being made precise.</p>
<p>I find it remarkable that the logarithms of primes — the most elementary sequence in arithmetic — appear as lengths of orbits in what would be a quantum chaotic system. Each prime contributes an oscillation to $\psi(x)$ with &ldquo;frequency&rdquo; proportional to its logarithm. You are, in a sense, hearing the primes as quantum interference.</p>
<p>This connects to a theme that comes up elsewhere on this blog. The <a href="/posts/falling-cat-geometric-phase/">falling cat problem</a> involves Berry phase and geometric holonomy — again a situation where deep structure emerges from symmetry and topology. The <a href="/posts/schrodinger-cat-qubits/">Schrödinger cat in quantum computing</a> involves the spectacular fragility of quantum coherence. The Riemann zeros are, if the conjecture is right, a quantum system that has never decohered — a perfectly coherent spectrum hiding inside the most ancient problem in mathematics.</p>
<h2 id="a-brief-detour-maynard-and-primes-without-digits">A Brief Detour: Maynard and Primes Without Digits</h2>
<p>While we are talking about primes, I cannot resist a detour through two results of James Maynard, who received the Fields Medal in 2022.</p>
<p>The first concerns bounded gaps. Euclid proved that there are infinitely many primes. The Twin Prime Conjecture says there are infinitely many pairs of primes $(p, p+2)$. This remains open. But in 2013, Yitang Zhang proved something extraordinary: there are infinitely many pairs of primes differing by at most 70,000,000 (<a href="#ref-Zhang2014">Zhang, 2014</a>). The bound is large, but the qualitative statement — that gaps between primes are bounded infinitely often — was completely new. Shortly thereafter, Maynard independently proved a much stronger result using the Maynard-Tao sieve: infinitely many prime pairs with gap at most 600 (<a href="#ref-Maynard2015">Maynard, 2015</a>). A crowdsourced effort (Polymath8b) brought the bound down to 246. The Twin Prime Conjecture remains open, but 246 is a long way from 70,000,000.</p>
<p>The second result is stranger. Maynard proved in 2016 that for any decimal digit $d \in \{0, 1, \ldots, 9\}$, there are infinitely many primes whose decimal representation contains no instance of $d$. There are infinitely many primes with no $7$ in their decimal expansion. There are infinitely many primes with no $3$. The proof uses techniques from analytic number theory, specifically exponential sum estimates and sieve methods, and the result holds not just for base 10 but for any base.</p>
<p>This is one of those results that sounds impossible on first hearing. Surely removing an entire digit should make most large numbers unavailable, so the primes run out? Not so. The density of such &ldquo;digitless&rdquo; numbers thins out, but not fast enough to eliminate infinitely many primes.</p>
<h2 id="the-52nd-mersenne-prime-and-what-we-do-not-know">The 52nd Mersenne Prime and What We Do Not Know</h2>
<p>Return to $M_{136{,}279{,}841} = 2^{136{,}279{,}841} - 1$. Mersenne primes have the form $2^p - 1$ where $p$ is a prime (though not all such numbers are prime — $2^{11} - 1 = 2047 = 23 \times 89$). They are tested via the Lucas-Lehmer primality test: define the sequence</p>
$$s_0 = 4, \qquad s_{n+1} = s_n^2 - 2.$$<p>Then $M_p = 2^p - 1$ is prime if and only if $s_{p-2} \equiv 0 \pmod{M_p}$.</p>
<p>The test requires $p - 2$ squarings modulo $M_p$. Each squaring involves numbers with roughly $p$ digits, and modular reduction modulo $M_p = 2^p - 1$ is cheap because it reduces to bit-shifts. This is why GPU parallelism helps enormously: each squaring can be broken into many parallel multiplications of sub-blocks of digits. Durant&rsquo;s cloud network was, in effect, a massively distributed modular arithmetic engine.</p>
<p>We do not know if there are infinitely many Mersenne primes. The heuristic Lenstra-Pomerance-Wagstaff conjecture says yes: the expected number of Mersenne primes $2^p - 1$ with $p \leq x$ is approximately</p>
$$e^\gamma \ln x / \ln 2 \approx 1.78 \cdot \log_2 x,$$<p>where $\gamma \approx 0.5772$ is the Euler-Mascheroni constant. This predicts roughly logarithmic growth in the count — consistent with the 52 known examples — but is nowhere near proved.</p>
<p>The known Mersenne primes do not form a sequence with obviously regular gaps. The exponents $p$ are: 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, &hellip; and then larger, less predictable values. Whether their distribution has GUE-like statistics is not a standard research question (the sample is too small), but the question of whether the primes $p$ for which $2^p - 1$ is prime have any special structure is an active one. For now, the answer is: we do not know.</p>
<h2 id="why-this-matters-and-why-it-does-not-prove-anything">Why This Matters, and Why It Does Not Prove Anything</h2>
<p>Let me be precise about what has and has not been established.</p>
<p>What has been established:</p>
<ul>
<li>Montgomery proved (conditionally, assuming a form of the generalised Riemann Hypothesis) that the pair correlation of Riemann zeros, for a certain range of $r$, is given by $1 - (\sin \pi r / \pi r)^2$.</li>
<li>Odlyzko verified numerically — to extraordinary precision, over billions of zeros — that the full empirical pair correlation matches the GUE prediction.</li>
<li>The Gutzwiller/Selberg analogy between periodic orbits and primes is mathematically precise in related settings (hyperbolic surfaces, function fields over finite fields).</li>
<li>Rudnick and Sarnak proved that the $n$-point correlation functions of Riemann zeros match GUE for all $n$, subject to a plausible conjecture about $\zeta$ (<a href="#ref-RudnickSarnak1996">Rudnick &amp; Sarnak, 1996</a>).</li>
</ul>
<p>What has not been established:</p>
<ul>
<li>There is no known Hamiltonian $\hat{H}$ whose spectrum is the set of Riemann zeros.</li>
<li>The Riemann Hypothesis remains open.</li>
<li>There is no proof that the Montgomery-Odlyzko connection is anything more than an extraordinary numerical coincidence.</li>
</ul>
<p>The broader context is the Langlands program — a still-hypothetical grand unification of number theory, algebraic geometry, and representation theory, sometimes described as a &ldquo;grand unified theory of mathematics.&rdquo; The Langlands correspondence predicts deep connections between $L$-functions (generalisations of $\zeta$) and representations of algebraic groups. The spectral interpretation of Riemann zeros — if it could be made precise — would fit naturally into this framework. Some researchers believe that a proof of the Riemann Hypothesis will come from the Langlands side, not from analytic number theory or quantum mechanics. Others think the quantum chaos connection is the right road. Nobody knows.</p>
<p>What would it mean if the connection is real? It would mean that the prime numbers — discovered by Euclid, studied for two and a half millennia, used today in every TLS handshake and RSA key — are the eigenvalues of a physical Hamiltonian. The abstract number-theoretic structure and the physical quantum mechanical structure would be not merely analogous but identical. That is a claim of the same depth as the unexpected appearance of the same partial differential equations in heat flow, diffusion, and Brownian motion: a discovery that what seemed to be different phenomena are manifestations of the same underlying law.</p>
<p>Or it could be a very surprising coincidence. Mathematics has a long history of producing such coincidences — the same numbers appearing in unrelated contexts for reasons that, when understood, turned out not to be coincidences at all. I suspect this is not a coincidence. But suspicion is not proof.</p>
<h2 id="a-closing-reflection">A Closing Reflection</h2>
<p>I started this post with the 52nd Mersenne prime because it is the news item that prompted me to write. GPU clusters finding 41-million-digit primes are genuinely impressive technology. But I keep returning to the image of Montgomery and Dyson at tea in 1972, and the formula $1 - (\sin \pi r / \pi r)^2$ connecting two conversations that had nothing to do with each other.</p>
<p>I have spent some time with random matrix theory, and separately with the zeta function, and the thing that still strikes me is how <em>clean</em> the connection is. This is not a numerical coincidence of the form &ldquo;these two quantities agree to 3 decimal places.&rdquo; Odlyzko&rsquo;s plots show agreement across many orders of magnitude, for zeros computed billions of entries into the sequence. The GUE curve and the empirical histogram are, visually, the same curve.</p>
<p>As someone trained as a physicist, I find this both encouraging and slightly unsettling. Encouraging because it suggests that the primes are not random — they have a structure, one that matches the eigenvalue repulsion of quantum chaotic systems, and that structure might be the key to proving the Riemann Hypothesis. Unsettling because it means that the quantum mechanical formalism — which I always thought was a description of a physical world — seems to be reaching into pure arithmetic, where there is no wave function, no Hilbert space, no measurement. The primes do not know they are supposed to be energy levels. And yet, statistically, they are.</p>
<p>If you find a flaw in this picture, or know of a result I have missed, I am genuinely interested. Peer review is welcome — open an issue on <a href="https://github.com/sebastianspicker/sebastianspicker.github.io/issues">GitHub</a>.</p>
<hr>
<h2 id="references">References</h2>
<ul>
<li>
<p><span id="ref-Riemann1859"></span>Riemann, B. (1859). Über die Anzahl der Primzahlen unter einer gegebenen Grösse. <em>Monatsberichte der Berliner Akademie</em>.</p>
</li>
<li>
<p><span id="ref-Montgomery1973"></span>Montgomery, H. L. (1973). The pair correlation of zeros of the zeta function. <em>Analytic Number Theory</em>, Proc. Symp. Pure Math., 24, 181–193.</p>
</li>
<li>
<p><span id="ref-Odlyzko1987"></span>Odlyzko, A. M. (1987). On the distribution of spacings between zeros of the zeta function. <em>Mathematics of Computation</em>, 48, 273–308. <a href="https://doi.org/10.2307/2007890">DOI: 10.2307/2007890</a></p>
</li>
<li>
<p><span id="ref-BerryKeating1999"></span>Berry, M. V., &amp; Keating, J. P. (1999). The Riemann zeros and eigenvalue asymptotics. <em>SIAM Review</em>, 41(2), 236–266. <a href="https://doi.org/10.1137/S0036144598347497">DOI: 10.1137/S0036144598347497</a></p>
</li>
<li>
<p><span id="ref-Zhang2014"></span>Zhang, Y. (2014). Bounded gaps between primes. <em>Annals of Mathematics</em>, 179(3), 1121–1174. <a href="https://doi.org/10.4007/annals.2014.179.3.7">DOI: 10.4007/annals.2014.179.3.7</a></p>
</li>
<li>
<p><span id="ref-Maynard2015"></span>Maynard, J. (2015). Small gaps between primes. <em>Annals of Mathematics</em>, 181(1), 383–413. <a href="https://doi.org/10.4007/annals.2015.181.1.7">DOI: 10.4007/annals.2015.181.1.7</a></p>
</li>
<li>
<p><span id="ref-RudnickSarnak1996"></span>Rudnick, Z., &amp; Sarnak, P. (1996). Zeros of principal L-functions and random matrix theory. <em>Duke Mathematical Journal</em>, 81(2), 269–322. <a href="https://doi.org/10.1215/S0012-7094-96-08115-6">DOI: 10.1215/S0012-7094-96-08115-6</a></p>
</li>
<li>
<p><span id="ref-GIMPS2024"></span>GIMPS (2024). 2^136279841-1 is Prime! Great Internet Mersenne Prime Search. Retrieved from <a href="https://www.mersenne.org/primes/?press=M136279841">https://www.mersenne.org/primes/?press=M136279841</a></p>
</li>
</ul>
<hr>
<h2 id="changelog">Changelog</h2>
<ul>
<li><strong>2026-02-17</strong>: Corrected the date of the Montgomery-Dyson meeting from 1973 to 1972 (the paper was published in the 1973 proceedings volume, but the meeting at the IAS took place in April 1972).</li>
</ul>
]]></content:encoded>
    </item>
    <item>
      <title>Spiral Out: Tool&#39;s Lateralus, the Fibonacci Sequence, and the Mathematics of Musical Structure</title>
      <link>https://sebastianspicker.github.io/posts/fibonacci-lateralus/</link>
      <pubDate>Tue, 08 Nov 2022 00:00:00 +0000</pubDate>
      <guid>https://sebastianspicker.github.io/posts/fibonacci-lateralus/</guid>
      <description>Alongside physics and astronomy, two other things have occupied an unreasonable share of my attention since adolescence: mathematics and music. Lateralus by Tool — released 2001, still in rotation — is the piece that most conspicuously occupies the intersection. The song is structurally built around the Fibonacci sequence, from the syllable counts in Maynard Keenan&amp;rsquo;s vocals to the time signature pattern that concatenates to F(16). This post works through the mathematics in some detail and asks why it works musically.</description>
      <content:encoded><![CDATA[<h2 id="two-passions-one-song">Two Passions, One Song</h2>
<p>Physics training means coming to mathematics as a tool before arriving at it as
an object of aesthetic interest, and it
took me longer than it should have to notice that a proof can be
beautiful in the same way a piece of music can be beautiful — not
despite its rigour but because of it. Both reward attention to
structure. Both have surfaces accessible to a casual listener and depths
that only reveal themselves when you look harder.</p>
<p>Lateralus, the title track of Tool&rsquo;s 2001 album, is a convenient case
study for the overlap. It is not the only piece of music built around
Fibonacci numbers — Bartók made the connection decades earlier, and it
appears in scattered places across Western and non-Western traditions —
but it is among the most thoroughly and deliberately constructed, and
the mathematical structure is audible rather than merely theoretical.</p>
<p>What follows is an attempt to do justice to both dimensions: the
mathematics of the Fibonacci sequence and the golden ratio, and the
musical mechanics of how those structures show up and what they do.</p>
<hr>
<h2 id="the-fibonacci-sequence">The Fibonacci Sequence</h2>
<p>The sequence is defined by a recurrence relation. Starting from the
initial values $F(1) = 1$ and $F(2) = 1$, each subsequent term is the
sum of the two preceding ones:</p>
$$F(n) = F(n-1) + F(n-2), \quad n \geq 3$$<p>This gives:</p>
$$1,\; 1,\; 2,\; 3,\; 5,\; 8,\; 13,\; 21,\; 34,\; 55,\; 89,\; 144,\; 233,\; 377,\; 610,\; \mathbf{987},\; 1597,\; \ldots$$<p>The term $987$ is the sixteenth Fibonacci number, $F(16)$. Keep that
in mind.</p>
<p>The recurrence can be encoded compactly in a matrix formulation. For
$n \geq 1$:</p>
$$\begin{pmatrix} F(n+1) \\ F(n) \end{pmatrix} = \begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix}^n \begin{pmatrix} 1 \\ 0 \end{pmatrix}$$<p>This is more than notational tidiness — it connects the Fibonacci
sequence to the eigenvalues of the matrix
$\mathbf{A} = \bigl(\begin{smallmatrix}1 & 1 \\ 1 & 0\end{smallmatrix}\bigr)$,
which are exactly $\varphi$ and $-1/\varphi$ where $\varphi$ is the
golden ratio. That connection gives us Binet&rsquo;s formula, a closed-form
expression for the $n$-th Fibonacci number:</p>
$$F(n) = \frac{\varphi^n - \psi^n}{\sqrt{5}}, \quad \varphi = \frac{1+\sqrt{5}}{2},\quad \psi = \frac{1-\sqrt{5}}{2} = -\frac{1}{\varphi}$$<p>Since $|\psi| < 1$, the term $\psi^n / \sqrt{5}$ diminishes rapidly,
and for large $n$ we have the convenient approximation:</p>
$$F(n) \approx \frac{\varphi^n}{\sqrt{5}}$$<p>This means Fibonacci numbers grow <em>exponentially</em>, at a rate governed by
the golden ratio. The sequence does not grow linearly or polynomially; it
spirals outward.</p>
<hr>
<h2 id="the-golden-ratio">The Golden Ratio</h2>
<p>The golden ratio $\varphi$ appears as the limit of consecutive Fibonacci
ratios:</p>
$$\varphi = \lim_{n \to \infty} \frac{F(n+1)}{F(n)} = \frac{1+\sqrt{5}}{2} \approx 1.61803\ldots$$<p>It can be derived from a simple geometric proportion: divide a line
segment into two parts such that the ratio of the whole segment to the
longer part equals the ratio of the longer part to the shorter part.
Calling those ratios $r$:</p>
$$\frac{a+b}{a} = \frac{a}{b} = r \implies r^2 - r - 1 = 0 \implies r = \frac{1+\sqrt{5}}{2} = \varphi$$<p>What makes $\varphi$ mathematically distinctive is its continued fraction
representation:</p>
$$\varphi = 1 + \cfrac{1}{1 + \cfrac{1}{1 + \cfrac{1}{1 + \cdots}}}$$<p>This is the simplest possible infinite continued fraction. It is also, in
a precise sense, the <em>hardest</em> real number to approximate by rational
fractions. The convergents of a continued fraction are the best rational
approximations to a real number at each level of precision; the
convergents of $\varphi$ are exactly the ratios of consecutive Fibonacci
numbers: $1/1$, $2/1$, $3/2$, $5/3$, $8/5$, $13/8$, $\ldots$ These
converge more slowly to $\varphi$ than the convergents of any other
irrational number. $\varphi$ is, in this sense, maximally irrational.</p>
<p>That property has a physical consequence. In botanical phyllotaxis — the
arrangement of leaves, seeds, and petals on plants — structures that grow
by adding new elements at a fixed angular increment will pack most
efficiently when that increment is as far as possible from any rational
fraction of a full rotation. The optimal angle is:</p>
$$\theta = \frac{2\pi}{\varphi^2} \approx 137.508°$$<p>This is the <em>golden angle</em>, and it is the reason sunflower seed spirals
count $55$ and $89$ (consecutive Fibonacci numbers) in their two
counter-rotating sets. The mathematics of efficient growth in nature
and the mathematics of the Fibonacci sequence are the same mathematics.</p>
<p>The golden spiral — the logarithmic spiral whose growth factor per
quarter turn is $\varphi$ — is the visual representation of this: it
is self-similar, expanding without bound while maintaining constant
proportionality.</p>
<hr>
<h2 id="fibonacci-numbers-in-music-before-tool">Fibonacci Numbers in Music: Before Tool</h2>
<p>The connection between the Fibonacci sequence and musical structure is
not Tool&rsquo;s invention. The most carefully documented case is Béla
Bartók, whose Music for Strings, Percussion and Celesta (1936) has been
analysed exhaustively by Ernő Lendvai. In the first movement, the
climax arrives at bar 55 (a Fibonacci number), and Lendvai counted the
overall structure as 89 bars — the score has 88, but he added an implied
final rest bar to reach the Fibonacci number — dividing at bar 55 with
near-mathematical precision. Lendvai argued that Bartók consciously embedded Fibonacci
proportions into formal structure, tonal architecture, and thematic
development throughout much of his output.</p>
<p>Whether these proportions were conscious design or an instinct that
selected naturally resonant proportions is contested. The same question
applies to claims about Mozart and Chopin. What is more defensible is
a structural observation about the piano keyboard and Western scales
that requires no attribution of intent:</p>
<p>A single octave on the piano keyboard has <strong>13 keys</strong>, comprising <strong>8
white keys</strong> and <strong>5 black keys</strong>. The black keys are grouped as <strong>2</strong>
and <strong>3</strong>. The numbers $2, 3, 5, 8, 13$ are five consecutive Fibonacci
numbers — $F(3)$ through $F(7)$.</p>
<p>The standard Western scales make this concrete. The major scale
contains <strong>7 distinct pitches</strong> within an octave of <strong>12 semitones</strong>.
The pentatonic scale (ubiquitous in folk, blues, rock) contains <strong>5</strong>
pitches. The chromatic scale contains <strong>12</strong> pitch classes per octave;
counting both endpoints of the octave (C to C) gives <strong>13</strong> chromatic
notes, the next Fibonacci number.</p>
<p>Harmonic intervals in just intonation are rational approximations of
simple frequency ratios: the octave (2:1), the perfect fifth (3:2),
the perfect fourth (4:3), the major third (5:4), the minor third (6:5).
The numerators and denominators are small integers, often Fibonacci
numbers or their neighbours. The major triad — the structural foundation
of tonal Western music — consists of intervals in frequency ratios
$4:5:6$, three consecutive integers that bracket the Fibonacci-adjacent
range.</p>
<p>This does not mean that Western music is secretly Fibonacci. It means
that the integer frequency ratios that produce consonant intervals are
the small integers, and small integers include the small Fibonacci
numbers. The connection is genuine but not exclusive.</p>
<hr>
<h2 id="lateralus">Lateralus</h2>
<p>Tool&rsquo;s <em>Lateralus</em> (2001, album of the same name) is unusual in that
the Fibonacci construction is not an analytical inference applied after
the fact — it was discussed publicly by the band. Drummer Danny Carey has
spoken about his engagement with sacred geometry and mathematical
structure, and the song&rsquo;s construction has been described as intentional
by multiple band members.</p>
<p>There are two primary levels of Fibonacci structure in the song. The
third — the thematic content of the lyrics — makes the mathematical
frame explicit.</p>
<h3 id="the-syllable-count">The Syllable Count</h3>
<p>The opening verses are constructed so that successive lines contain
syllable counts following the Fibonacci sequence ascending:
$1, 1, 2, 3, 5, 8, 13$. The first syllable count is a single word.
The second is another. The third is a two-syllable phrase. The sequence
continues, each line adding the weight of the previous two, until the
thirteenth-syllable line, which in structure and delivery feels like the
crest of a wave.</p>
<p>The second half of the verse then descends: $13, 8, 5, 3, 2, 1, 1$.
Or, in some analyses, the chorus and pre-chorus sections begin a new
ascending Fibonacci run before the full descent, creating a nested
structure of expansions and contractions.</p>
<p>The audible effect of this design is not arbitrary. A sequence of lines
whose syllable counts follow $1, 1, 2, 3, 5, 8, 13$ creates a
consistently accelerating density of text over the same musical time.
The vocal line becomes more compressed as the syllable count rises,
building tension — and then the descent releases it. This is not how
most pop or rock lyrics are structured. It produces a breathing,
organic quality, the way a plant reaches toward light.</p>
<h3 id="the-time-signature-987">The Time Signature: 987</h3>
<p>The verse sections of the song cycle through three time signatures in
succession: $9/8$, then $8/8$, then $7/8$.</p>
$$9/8 + 8/8 + 7/8$$<p>This three-bar pattern repeats. Now: the sequence of numerators is $9$,
$8$, $7$. Written as a three-digit number: <strong>987</strong>. And as noted above,
$987 = F(16)$, the sixteenth Fibonacci number.</p>
<p>Whether this is a deliberate encoding or a remarkable coincidence is a
matter of interpretation. The time signature sequence is definitely
deliberate — asymmetric meters of this kind require careful compositional
choice. The fact that their numerators concatenate to a Fibonacci number
is either intentional and clever or accidental and still remarkable.
Either way, the time signature pattern has a musical function independent
of the Fibonacci reading.</p>
<p>In standard rock, time is almost always $4/4$: four even beats per bar,
a pulse that is maximally predictable and maximally amenable to groove.
The $9/8 + 8/8 + 7/8$ pattern is the opposite. Each bar has a different
length. The listener&rsquo;s internal metronome, calibrated to $4/4$, cannot
lock onto the pattern. The music generates forward momentum not through
a repeated downbeat but through the continuous, non-periodic unfolding
of measures whose lengths shift. This is the rhythmic analogue of a
spiral: no two revolutions are identical in length, but the growth is
consistent.</p>
<p>The chorus and other sections use different time signatures, including
stretches in $5/8$ and $7/8$ — Fibonacci numbers again, and specifically
the $5, 8, 13$ triplet that appears so often in this context.</p>
<h3 id="the-thematic-content">The Thematic Content</h3>
<p>The lyrics are explicitly about spirals, Fibonacci growth, and the
experience of reaching beyond a current state of development. They
reference the idea of expanding one&rsquo;s perception outward through
accumulating cycles, each containing and exceeding the previous one.
The chorus refrain — about spiralling outward — names the mathematical
structure of the golden spiral directly. The song is, in its own terms,
about the process that the mathematics describes.</p>
<p>This kind of thematic coherence between structure and content is what
makes the construction interesting rather than merely clever. The
Fibonacci structure is not decorative. It is the argument of the song
made manifest in its form.</p>
<hr>
<h2 id="why-fibonacci-structure-works-in-music">Why Fibonacci Structure Works in Music</h2>
<p>The most interesting question is not whether the Fibonacci structure is
there — it clearly is — but why it produces the musical effect it does.</p>
<p>Consider what the Fibonacci sequence represents physically. It is the
growth law of structures that build on their own preceding state:
$F(n) = F(n-1) + F(n-2)$. Unlike arithmetic growth (add a constant)
or geometric growth (multiply by a constant), Fibonacci growth is
<em>self-referential</em>. Each term contains the memory of the previous two.
The sequence is expansive but not uniform; it accelerates, but always
in proportion to what came before.</p>
<p>Musical tension and release are, in an important sense, the same
mechanism. A phrase creates an expectation; its continuation either
confirms or subverts that expectation; resolution reduces the tension.
What makes a musical phrase feel like it is building toward something
is precisely the progressive accumulation of expectation — each bar
adding its weight to the previous, the accumulated tension requiring
resolution at a scale proportional to the build-up. The Fibonacci
syllable structure in Lateralus generates this literally: each line is
denser than the previous two lines&rsquo; combined syllable count would
suggest is comfortable, until the structure has to breathe.</p>
<p>The time signature asymmetry works similarly. In $4/4$, the beat is
predictable, and the listener&rsquo;s body can lock to it and then coast on
that lock. In $9/8 + 8/8 + 7/8$, the beat is never fully locked — the
pattern is periodic (it repeats) but the internal structure of each
repetition is shifting. The listener is perpetually catching up,
perpetually leaning slightly into the music to find the next downbeat.
This is not discomfort — it is engagement. The mathematical reason is
that the pattern is large enough to be periodic (it does repeat) but
small enough to be audible as a unit. The brain can learn the 24-beat
super-pattern; it just requires attention that $4/4$ does not.</p>
<p>There is a deeper reason why golden-ratio proportions feel right in
musical form. The golden section of a piece — the point at which the
piece divides in the $\varphi : 1$ ratio — is the point of maximum
accumulated development before the final resolution. In a five-minute
piece, the golden section falls at roughly 3:05. This is, empirically,
where the emotional and structural climax tends to sit in a wide range
of well-regarded music, from Baroque to jazz. Whether composers
consciously target this proportion or whether the proportion is what
accumulated development looks like when done well is not easily
separable. But the mathematical reason it is <em>a</em> proportion worth
targeting is that $\varphi$ is the only division point that is
self-similar: the ratio of the whole to the longer part equals the ratio
of the longer part to the shorter part. There is no arbitrary scale
associated with the golden section; it is scale-invariant, the same
proportion at every level of analysis.</p>
<hr>
<h2 id="a-brief-note-on-binet-and-limits">A Brief Note on Binet and Limits</h2>
<p>The closed-form expression for Fibonacci numbers,</p>
$$F(n) = \frac{\varphi^n - \psi^n}{\sqrt{5}},$$<p>has a pleasing consequence for large $n$. Since $|\psi| \approx 0.618 < 1$,
the term $\psi^n \to 0$, and $F(n)$ is simply the nearest integer to
$\varphi^n / \sqrt{5}$. The integers produced by the Fibonacci recurrence
are the integers that $\varphi^n / \sqrt{5}$ passes closest to. The
exponential growth of $\varphi^n$ and the rounding to integers together
give the sequence.</p>
<p>This is also why the ratios $F(n+1)/F(n)$ converge to $\varphi$
exponentially fast — the error is $\mathcal{O}(|\psi/\varphi|^n)
= \mathcal{O}(\varphi^{-2n})$ — and why, for musical purposes, the
Fibonacci ratios $8:5$, $13:8$, $21:13$ are already excellent
approximations of the golden ratio, close enough that the ear cannot
distinguish them from $\varphi$ in any direct sense.</p>
<hr>
<h2 id="what-lateralus-is">What Lateralus Is</h2>
<p><em>Lateralus</em> is not a math lecture set to music. It is a nine-minute
progressive metal track that is physically involving, rhythmically
complex, and lyrically coherent. The Fibonacci structure would be
worthless if the song were not also, on purely musical terms, good.</p>
<p>What the mathematics adds is a vocabulary for something the song achieves
anyway: the sense of growing without ever arriving, of each section being
both a resolution of what came before and an opening toward something
larger. The golden spiral does not end. The Fibonacci sequence does not
converge. The song does not resolve in the sense that a classical sonata
resolves; it spirals to a close.</p>
<p>The reason this is worth writing about is that it makes concrete a
connection that is usually stated vaguely: mathematics and music are
similar. They are similar in specific and articulable ways. The
self-referential structure of the Fibonacci recurrence, the scale-
invariance of the golden ratio, the information-theoretic account of
tension and expectation — these are not metaphors for musical experience.
They are, in this case, the actual mechanism.</p>
<hr>
<h2 id="references">References</h2>
<p>Lendvai, E. (1971). <em>Béla Bartók: An Analysis of His Music.</em> Kahn &amp;
Averill.</p>
<p>Benson, D. J. (2006). <em>Music: A Mathematical Offering.</em> Cambridge
University Press. <em>(For an introduction to the general theory of tuning,
temperament, and harmonic series.)</em></p>
<p>Tool. (2001). <em>Lateralus.</em> Volcano Records.</p>
<p>Livio, M. (2002). <em>The Golden Ratio: The Story of Phi, the World&rsquo;s Most
Astonishing Number.</em> Broadway Books.</p>
<p>Knott, R. (2013). Fibonacci numbers and the golden section in art,
architecture and music. <em>University of Surrey Mathematics Department.</em>
<a href="https://r-knott.surrey.ac.uk/Fibonacci/fibInArt.html">https://r-knott.surrey.ac.uk/Fibonacci/fibInArt.html</a></p>
<hr>
<h2 id="changelog">Changelog</h2>
<ul>
<li><strong>2025-11-20</strong>: Clarified the Bartók bar count: the written score has 88 bars; Lendvai&rsquo;s analysis counted 89 by adding an implied final rest bar to reach the Fibonacci number. Previously stated as &ldquo;89 bars&rdquo; without qualification.</li>
</ul>
]]></content:encoded>
    </item>
  </channel>
</rss>
