One operator for all?

0:00The question

One matrix can generate a whole matrix algebra. Our computer finds that a generic 8×8 matrix generates all 64 dimensions, while a normal one gives at most 8. Two random self-adjoint matrices do the same: the words in them span 1, 3, 7, 15 dimensions and onward until the space is full, and packing them as a + ib turns two self-adjoints into one generator. Among 2,000 random 4×4 matrices, none fails. Kadison’s generator problem, from an unpublished 1967 problem list, asks whether every von Neumann algebra with separable predual is generated by two self-adjoints, and names the free group factor on three generators. Type I, hyperfinite and properly infinite algebras were settled in the 1960s, and in 1974 Willig reduced the problem to type II₁ factors. Later work covered factors with a Cartan subalgebra and with property Γ, but not the free group factors on three or more generators. The free group factor on two generators is generated by two self-adjoints from the start; the question was the factors on three or more. Many experts expected a counterexample there, perhaps through Voiculescu’s free entropy dimension, and in September 2026 one wrote that the general belief is that there should be a separable von Neumann algebra which is not singly generated.

1:30The claim

Result 296 is one OpenAI paper, 18 pages, dated September 23 and published October 6, 2026. Its main theorem: for an irreducible inclusion of type II₁ factors with separable predual, the unitaries that, together with the smaller factor, generate the larger one form a dense G_δ set in the trace 2-norm. As a consequence, every type II₁ factor with separable predual is generated by two self-adjoint operators, so by a single operator. With the classical reductions, every von Neumann algebra with separable predual would be singly generated, and Voiculescu’s free entropy dimension would depend on the choice of generators for the free group factors on three or more. Not claimed: anything about whether free group factors are isomorphic, nonseparable preduals, or an explicit generator.

2:27How the proof goes

The proof uses Popa’s theorem that the ultrapower of the smaller factor contains unitaries free from any given separable piece. A tiny nudge to the unitary, spread across a long word, keeps a fixed correlation with any missing direction. Our random matrix model shows it with 400×400 matrices: the nudge shrinks from about 0.14 to 0.018 as the unitary appears 1 to 64 times in the word, yet the correlation stays near 0.1, while a random nudge of the same size gives almost nothing. Haagerup’s inequality keeps the error under control at every word length, and a Baire category argument then shows that a typical unitary generates. Our computer sees a finite stand-in: with the diagonal matrices as the smaller algebra, none of 1,000 random unitaries fails, and every bad unitary we tried is cured by a nudge of 0.001. Finally, Popa’s irreducible hyperfinite subfactor gives two self-adjoint generators and a typical unitary two more; on a half-size corner, a 2×2 matrix trick packs the four into two.

3:39Where it stands

The paper is unrefereed and unchanged since release. In Lean, both main statements are formalized and match the paper, together in about 36,000 lines; our scan finds no unproved steps, but we did not build them. OSVerify has not reviewed it, and we found no expert evaluation, though three later preprints already use it as an input. If it holds, every type II₁ factor with separable predual is generated by a single operator. On its own it says nothing about whether the free group factors are isomorphic, the question result 287 claims to settle.