One signal, every pattern?
A claimed smooth volume-preserving map of the three-torus whose iterates of one observable form an orthonormal basis of all mean-zero functions
Covers result 144 in OpenAI’s catalog: its one paper. See its connections to other results and the work it cites.
6:19. English captions available. The video loads from YouTube when you press play.
Chapters
The claim, in plain words
Take a map T that moves the points of a space while preserving volume, and an observable f. The functions …, f∘T−1, f, f∘T, f∘T2, … form a sequence. If they are orthonormal and together build every square-integrable function of mean zero, then the dynamics, seen through functions, is exactly a shift: one signal, moved back and forth in time, builds every pattern. That is simple Lebesgue spectrum: Lebesgue, because that one signal’s spectrum is perfectly flat, and simple, because a single orbit suffices.
Familiar maps fall short in opposite ways. An irrational rotation of the circle only multiplies the wave e(x) by a phase, so its correlations never decay. The cat map on the two-torus moves Fourier modes along infinite orbits, each of them an orthonormal sequence, so its spectrum is Lebesgue, but there are infinitely many independent orbits. As the paper recounts the history, Banach’s question, recorded by Ulam, was set on the real line, and the paper says its probability-space version is distinct from it; Rokhlin asked in 1949 for ergodic maps with simple, or at least finite-multiplicity, Lebesgue spectrum; Mathew and Nadkarni found a Lebesgue component of multiplicity two; Fayad built smooth torus maps with simple spectrum, with no claim of Lebesgue type; and a nonzero time map of a flow with simple Lebesgue spectrum has infinite multiplicity. The paper does not call the problem open; as far as we know, no such map of a probability space had been found before, even without smoothness.
Result 144 is one OpenAI preprint (30 pages, September 23, 2026). Theorem 1.1 claims a C∞ volume-preserving diffeomorphism T of the three-torus, with smooth inverse, and a real square-integrable f of mean zero such that {f∘Tn : n ∈ ℤ} is an orthonormal basis of the mean-zero space. So T is ergodic, and on that space its Koopman operator is unitarily equivalent to multiplication by w on L2 of the circle. The paper calls this a solution of “the probability-preserving form of Banach’s simple Lebesgue-spectrum problem in smooth dynamics.” It also derives mixing, zero entropy, and all three Lyapunov exponents equal to zero almost everywhere; mixing of all orders uses release result 145, another unreviewed paper.
What it doesn’t claim
A formula. T is a smooth limit of infinitely many explicit steps, each with a sufficiently large parameter, and f is only square-integrable, not claimed smooth or even continuous. The map is on the three-torus and smooth, with no claim that it is analytic. Lebesgue spectrum here does not mean chaos: with zero entropy and zero Lyapunov exponents, nothing is stretched at an exponential rate, unlike the cat map. The paper does not address the historical real-line question.
Where it stands
- Posted as a preprint
- OpenAI, 30 pages, dated September 23, 2026
- Peer reviewed
- Not yet
- Checked in Lean
- The main theorem, with a statement matching the paper. We have not run the check
Last checked October 19, 2026. The preprint has not been revised. OpenAI published a Lean formalization of Theorem 1.1, added to the repository in its initial commit on October 6, 2026 (comparator statement, which matches the theorem; 37 files and 33,818 lines, with no unproved steps that we could find). We have not run the check. The corollary on mixing, entropy and Lyapunov exponents is not formalized. The paper is not among those OSVerify reviewed, and we have seen no expert review.
How the proof goes
- Twists and flat vectors. In a twist (θ, u, a) ↦ (θ + φ(u), u, a), each circle rotates at its own speed, and a wave in θ times a bump in u picks up a phase at each step. With the bump’s square proportional to the slope of φ, over a stretch where the wave’s speed rises by exactly one turn, the spectral density is exactly one: an orthonormal orbit. But a twist leaves every function of u unchanged, so one orbit cannot reach most of the space.
- Passages. A passage is a map very close to the twist that, in new coordinates (θ′, u′, a′) = (u, a, θ − HN(u)), is again a twist, much slower, with the three coordinates trading roles. By stationary phase, each old wave spreads over a band of new frequencies near N times its speed, with the same spectral density, now resolved on a finer scale. In our reading, the spare coordinate becoming the new speed variable is why three dimensions are needed.
- Ripples that carry labels. A spare coordinate jitters the new speed. Choosing its law, a positive density with compact Fourier support combined with a prime sieve, writes a tiny ripple into each piece’s spectral density, encoding a label.
- Blocks. One ripple is far too weak to read, so ripples are stacked at huge, well-separated frequencies, and enormous numbers of blocks are averaged. Each block is centered on the average label, so the total density barely moves while a combination of iterates learns to predict the target.
- Whitening and the limit. Dividing by the square root of the density restores density exactly one at a small cost. A diagonal limit treats every sine and cosine on the torus again and again; the maps converge in every derivative, orthonormality survives, and the orbit becomes complete.
The numbers in the video
- The cat map’s Fourier modes with coordinates up to 80 in size (25,920 modes) lie on 12,960 different orbits.
- A flat vector for the twist with φ(u) = sin(2πu)/π: correlations 1, 0, 0, 0, … to eight decimals.
- The passage map with V = 3 + φ is within 0.193, 0.0191 and 0.0019 of the twist at N = 10, 100 and 1000, and is exactly a slower twist in the new coordinates.
- At N = 200, one old wave’s energy lands on about a hundred new frequencies near 600, matching the stationary-phase prediction (ratio 0.9986 at the center).
- One block of 25 ripples predicts a ±1 label with mean-square error about 100; for a modest target (ε = 0.1, τ = 0.01), the paper’s bounds call for about 4 × 1010 blocks, by our arithmetic.
Read the source
- A smooth three-torus diffeomorphism with simple Lebesgue spectrum (PDF), 30 pages.
- The Lean scope note.
- The collection’s catalog, where this is result 144.
The paper
OpenAI groups related papers into one result; this one has a single paper.
Transcript
Read the full script
0:00One signal, every pattern
Take a map that moves the points of a space while preserving volume, and a function on that space, an observable. Composing with the map again and again, forward and backward in time, gives a sequence of observables. Could they form a perfect coordinate system: unit vectors, each orthogonal to all the others, that together build every square-integrable function of mean zero? Then the dynamics, seen through functions, is exactly a shift: one signal, moved back and forth in time, builds every pattern. This is simple Lebesgue spectrum: Lebesgue, because that one signal’s spectrum is perfectly flat; simple, because a single orbit suffices. Two familiar maps fail in opposite ways. An irrational rotation of the circle only multiplies the wave e(x) by a phase, so its correlations never decay: the spectrum is discrete. The cat map on the two-torus pushes Fourier modes along infinite orbits, and each orbit is a perfectly orthonormal sequence, so its spectrum is Lebesgue. But there are infinitely many independent orbits; the modes up to 80 already lie on 12,960 different orbits. One orbit is never enough. The question has a long history. Banach’s version, recorded by Ulam, was set on the real line, and the paper says its own version, on a probability space, is distinct from it. Rokhlin asked in 1949 for ergodic maps with simple, or at least finite-multiplicity, Lebesgue spectrum. As the paper recounts, Mathew and Nadkarni found a Lebesgue component of multiplicity two, Fayad built smooth torus maps with simple spectrum, with no claim of Lebesgue type, and flows with simple Lebesgue spectrum do not help, because each nonzero time map of such a flow has infinite multiplicity.
1:51The claim
Result 144 is one OpenAI preprint, 30 pages, dated September 23. It claims a smooth, volume-preserving diffeomorphism of the three-dimensional torus, with smooth inverse, and one real square-integrable function f, such that the iterates of f, over all integer times, form an orthonormal basis of the whole space of mean-zero functions. So on that space the map acts exactly like the shift, and it is ergodic. The paper calls this a solution of the probability-preserving form of Banach’s problem in smooth dynamics. It also derives mixing, zero entropy, and all three Lyapunov exponents equal to zero almost everywhere; mixing of all orders uses result 145, another unreviewed paper in the release. There is no formula for the map: it is a smooth limit of infinitely many explicit steps, each with a sufficiently large parameter, and the function f is only square-integrable, not claimed smooth or even continuous. The result is for the three-torus, and the map is smooth, with no claim that it is analytic. And Lebesgue spectrum here does not mean chaos: with zero entropy and zero exponents, nothing is stretched at an exponential rate, unlike the cat map. The paper does not call the problem open; as far as we know, no such map of a probability space had been found before, even without smoothness. The theorem is formalized in Lean.
3:22How the proof goes
The construction starts from a twist: each circle rotates at its own speed, θ goes to θ + φ(u). A wave in θ, times a bump in u, picks up a phase at each step, so its correlations are averages of phases. Make the bump’s square proportional to the slope of φ, over a stretch where the wave’s speed climbs by exactly one turn, and the spectral density is exactly one: an orthonormal orbit. In our run, the correlations come out 1, 0, 0, 0, to eight decimals. But a twist leaves every function of u unchanged, so one orbit can never reach most of the space. The fix is a passage: a map very close to the twist, within about 2/N in our run, which in new coordinates is again a twist, now much slower, with the three coordinates trading roles. In our reading, that is why three dimensions are needed: the spare coordinate becomes the variable that sets the new speed. By stationary phase, each old wave spreads over a band of new frequencies, about a hundred in our run, near N times the old wave’s speed, with the same spectral density, now resolved on a finer scale. A spare coordinate jitters the new speed, and by choosing its law, a positive density with compact Fourier support combined with a prime sieve, the paper writes a tiny ripple into each piece’s density, a ripple that encodes a label. One ripple is far too weak to read: in our toy, even a block of 25 ripples predicts a label of ±1 with a mean-square error of about 100. So the paper stacks ripples at huge, well-separated frequencies, averages enormous numbers of blocks, tens of billions by our arithmetic for one modest target, and gets a combination of iterates that predicts the target while the total density barely moves, because each block is centered on the average label. Whitening then divides by the square root of the density, restoring density exactly one at a small cost. A diagonal limit treats every sine and cosine on the torus, again and again; the maps converge in every derivative, orthonormality survives, and the orbit becomes complete.
5:35Where it stands
The preprint is not peer reviewed and has not been revised. The theorem is formalized in Lean, with a statement matching the paper, in 37 files and about 34,000 lines, with no unproved steps that we found; we have not run the check. The corollary about mixing, entropy and exponents is not formalized. The paper is not among those OSVerify reviewed, and we have seen no expert review. If it holds, a smooth volume-preserving map of the three-torus behaves, on every mean-zero function, exactly like a shift: one signal, moved through time, builds every pattern, with no chaos in the usual sense.
Spot a mistake?
This episode simplifies on purpose, but it shouldn’t be wrong. If something is, open an issue on GitHub or leave a comment on YouTube. Corrections are noted here with a date.