# The generator problem for finite factors > Every type II₁ factor with separable predual is generated by a single operator. Plain-English explainer, Lean status and sources. Canonical: https://closedform.nishachay.tech/e/openai-math-2026-296/ Last updated: 2026-10-11 **Every type II₁ factor with separable predual is generated by a single operator.** **Trust:** Formal proof listed · **Papers:** 1 · **First paper:** September 23, 2026 · **Field:** Operator algebras · **Entry:** 296 *Explained by AI.* Drafted by one AI model and checked sentence by sentence against the paper by a different one. Spot a mistake? Report an error. A von Neumann algebra is a family of operators closed under sums, products, adjoints and limits. The generator problem asks whether one operator always generates the whole family. Earlier work settled many classes, and reduced the rest to type II₁ factors. This paper proves the answer is yes for every type II₁ factor with separable predual (Lean proof listed). It also proves that almost every unitary, with any irreducible subfactor (a smaller factor that only plain numbers commute with), generates the factor. ## At a glance - **First step:** 1962 (Carl Pearcy, type I case) - **Significance:** Major. It answers the generator problem, where earlier work covered only special classes of type II₁ factors. - **Trust:** Formal proof listed - **Field:** Operator algebras (1 paper) ## The explanation Take the 2-by-2 matrix x with rows (0, 1) and (0, 0). On its own it reaches very little. Its square is the zero matrix. So sums and products of x give only matrices of the form a·I + b·x. That is a family described by two numbers, while a 2-by-2 matrix has four entries. Now also allow the adjoint x* (flip the matrix across its diagonal and conjugate any complex entries). Here x* has rows (0, 0) and (1, 0). The product x·x* has rows (1, 0) and (0, 0). The product x*·x has rows (0, 0) and (0, 1). With x and x*, these give the four basic building blocks. Every 2-by-2 matrix is a mix of them. The matrix with rows (3, 7) and (5, 2) is 3·xx* + 7·x + 5·x* + 2·x*x. So one matrix, with its adjoint, generates all 2-by-2 matrices. One generator is the same as two self-adjoint ones. A self-adjoint matrix equals its own adjoint. Put a = (x + x*)/2 and b = (x − x*)/(2i). Then a has rows (0, 0.5) and (0.5, 0). And b has rows (0, −0.5i) and (0.5i, 0). Both are self-adjoint, and a + i·b gives back x. The generator problem asks the same question in infinite dimensions. The setting is a von Neumann algebra. That is a family of operators closed under sums, products, adjoints and limits. Operators act like infinite matrices. Generated by x means: start from x and x*, take sums and products, then take limits. A separable predual is a size condition. Roughly, countably many pieces of data pin the algebra down. The question is whether every such algebra is generated by one operator. Many cases were settled long ago. Pearcy, Suzuki and Saitô, and Wogen handled three large classes of algebras in 1962, 1963 and 1969. In 1974 Willig reduced the whole question to type II₁ factors. A factor is an algebra that cannot be split into independent pieces. A type II₁ factor is infinite-dimensional but carries a trace. The trace gives each piece a size from 0 to 1. In the 2-by-2 example, the normalized trace gives x·x* size 1/2. Type II₁ factors then resisted a general answer. Progress used extra structure each time. Behncke handled tensor products of two such factors in 1972. A tensor product joins two factors into one, with each acting independently of the other. Popa handled factors with Cartan subalgebras in 1985. These are large commutative pieces that sit inside the factor in a special, maximal way. Ge and Popa handled factors with property Γ in 1998. Such a factor has nontrivial elements that almost commute with everything in it. Shen's generator invariant, from 2009, unified these and other classes. It is a number that measures, roughly, how many generators a factor needs. In 2012 Sherman showed that finitely many generators for every such factor would be enough. No method covered every factor. This paper proves that every type II₁ factor with separable predual is generated by one operator[1]. With Willig's reduction, every von Neumann algebra with separable predual follows[2]. The paper first proves a stronger result. Take a smaller factor P inside M, so that only plain numbers in M commute with all of P[3]. Then almost every unitary u, together with P, generates M[4]. A unitary is an operator that preserves lengths, like a rotation. Here almost every means a dense G_δ set: a generic set, found arbitrarily close to any unitary. The difficulty sits in long products. The proof nudges u a little at each of its many appearances in a long word. Small nudges usually pile up as the word grows[5]. The paper finds a bound on their total effect that does not grow with the length[6]. Then it picks P generated by two self-adjoint elements, giving four for M[7]. The 2-by-2 matrix trick from the start, with operators as entries, cuts four down to two[8]. The result has limits. It concerns one factor at a time. It says nothing about generators that vary smoothly across a family of factors. Hayes built a continuous family where no finite set of continuous choices generates every member[9]. The paper also claims a consequence for Voiculescu's free entropy dimensions[10]. These numbers measure, roughly, how much room there is to approximate a list of generators by matrices. The paper says they can change when one generating list replaces another for the same algebra. How sure is this? A computer proof checker called Lean has checked formal versions of two statements. One is single generation of type II₁ factors with separable predual. The other is the dense G_δ relative generation theorem. The step to all von Neumann algebras rests on Willig's older reduction. That step and the free entropy consequence are outside the Lean scope note. No specialist review has been published yet. **What it doesn't show.** This does not give generators that vary continuously across a family of factors; Hayes showed that can fail. ## Where it came from This result comes from an unreleased OpenAI model, published in the openai/math release on 6 October 2026. ## Hype check Major if the proof holds. Lean formalizations of the two main theorems are listed. The step to all von Neumann algebras and the free entropy consequence lie outside that scope note. No specialist review has been published. ## Words used - **Adjoint:** The operator version of flipping a matrix across its diagonal and conjugating its complex entries. - **Von Neumann algebra:** A family of operators closed under sums, products, adjoints and a kind of limit. - **Generator:** An operator whose sums, products, adjoints and limits produce the whole algebra. - **Separable predual:** A size condition: roughly, countably many pieces of data pin the algebra down. - **Type II₁ factor:** An infinite-dimensional algebra that cannot be split into independent pieces and has a trace measuring pieces from 0 to 1. - **Self-adjoint:** An operator equal to its own adjoint, the operator version of a real number. - **Unitary:** An operator that preserves lengths, like a rotation. - **Dense G_δ set:** A generic set: it comes arbitrarily close to every point, in a precise topological sense. ## The original paper - [Relative generation and the generator problem for finite factors](https://github.com/openai/math/blob/main/preprints/Relative-generation-and-the-generator-problem-for-finite-factors-September-23-2026/paper.pdf) - September 23, 2026 · Formal proof listed - [Lean notes](https://github.com/openai/math/blob/main/lean/docs/296.md) ## Quoted lines from the paper (10) [1] From [Relative generation and the generator problem for finite factors](https://github.com/openai/math/blob/main/preprints/Relative-generation-and-the-generator-problem-for-finite-factors-September-23-2026/paper.pdf): > Every type $\mathrm{II}_1$ factor $M$ with separable predual is generated by two self-adjoint elements. [2] From [Relative generation and the generator problem for finite factors](https://github.com/openai/math/blob/main/preprints/Relative-generation-and-the-generator-problem-for-finite-factors-September-23-2026/paper.pdf): > Consequently, Theorem … also gives single generation of every von Neumann algebra with separable predual. [3] From [Relative generation and the generator problem for finite factors](https://github.com/openai/math/blob/main/preprints/Relative-generation-and-the-generator-problem-for-finite-factors-September-23-2026/paper.pdf): > An inclusion $P\subset M$ is \emph{irreducible} when $P'\cap M=\mathbb C1$. [4] From [Relative generation and the generator problem for finite factors](https://github.com/openai/math/blob/main/preprints/Relative-generation-and-the-generator-problem-for-finite-factors-September-23-2026/paper.pdf): > The set \[ \{u\in\mathcal U(M):W^*(P,u)=M\} \] is a dense $G_\delta$ subset of the unitary group $\mathcal U(M)$ for the trace $2$-norm topology. [5] From [Relative generation and the generator problem for finite factors](https://github.com/openai/math/blob/main/preprints/Relative-generation-and-the-generator-problem-for-finite-factors-September-23-2026/paper.pdf): > An operator-norm bound on each perturbation separately would grow with the length of the product. [6] From [Relative generation and the generator problem for finite factors](https://github.com/openai/math/blob/main/preprints/Relative-generation-and-the-generator-problem-for-finite-factors-September-23-2026/paper.pdf): > The essential estimate is uniform in $\ell$. An operator-norm bound on each perturbation separately would grow with the length of the product. [7] From [Relative generation and the generator problem for finite factors](https://github.com/openai/math/blob/main/preprints/Relative-generation-and-the-generator-problem-for-finite-factors-September-23-2026/paper.pdf): > Relative generation then gives four self-adjoint generators for every separable-predual $\mathrm{II}_1$ factor. [8] From [Relative generation and the generator problem for finite factors](https://github.com/openai/math/blob/main/preprints/Relative-generation-and-the-generator-problem-for-finite-factors-September-23-2026/paper.pdf): > Applying this uniform bound to a half-trace corner, and using an explicit two-by-two matrix encoding, gives Theorem …. [9] From [Relative generation and the generator problem for finite factors](https://github.com/openai/math/blob/main/preprints/Relative-generation-and-the-generator-problem-for-finite-factors-September-23-2026/paper.pdf): > Hayes constructed a $W^*$-bundle---a continuous family of tracial von Neumann algebras---over a compact metrizable base, with separable-predual $\mathrm{II}_1$ fibers, for which no finite family of continuous sections generates every fiber. [10] From [Relative generation and the generator problem for finite factors](https://github.com/openai/math/blob/main/preprints/Relative-generation-and-the-generator-problem-for-finite-factors-September-23-2026/paper.pdf): > In particular, neither dimension is determined by the generated tracial von Neumann algebra. ## Other sources - [C. Pearcy, “W*-algebras with a single generator”, Proceedings of the American Mathematical Society 13 (1962), 831–832](https://doi.org/10.2307/2034069) - [N. Suzuki and T. Saitô, “On the operators which generate continuous von Neumann algebras”, Tohoku Mathematical Journal 15 (1963), 277–280](https://doi.org/10.2748/tmj/1178243811) - [W. Wogen, “On generators for von Neumann algebras”, Bulletin of the American Mathematical Society 75 (1969), 95–99](https://doi.org/10.1090/S0002-9904-1969-12157-9) - [P. Willig, “Generators and direct integral decompositions of W*-algebras”, Tohoku Mathematical Journal 26 (1974), 35–37](https://doi.org/10.2748/tmj/1178241231) - [H. Behncke, “Generators of finite W*-algebras”, Tohoku Mathematical Journal 24 (1972), 401–408](https://doi.org/10.2748/tmj/1178241478) - [S. Popa, “Notes on Cartan subalgebras in type II1 factors”, Mathematica Scandinavica 57 (1985), 171–188](https://doi.org/10.7146/math.scand.a-12110) - [L. Ge and S. Popa, “On some decomposition properties for factors of type II1”, Duke Mathematical Journal 94 (1998), 79–101](https://doi.org/10.1215/S0012-7094-98-09405-4) - [J. Shen, “Type II1 factors with a single generator”, Journal of Operator Theory 62 (2009), 421–438](https://arxiv.org/abs/math/0511327) - [D. Sherman, “On cardinal invariants and generators for von Neumann algebras”, Canadian Journal of Mathematics 64 (2012), 455–480](https://arxiv.org/abs/0908.4565) - [B. Hayes, “On Generators for W*-bundles”, arXiv:2609.16428 (2026)](https://arxiv.org/abs/2609.16428) - [D. Voiculescu, “Free entropy”, Bulletin of the London Mathematical Society 34 (2002), 257–278](https://arxiv.org/abs/math/0103168v1) - [U. Haagerup, “An example of a non nuclear C*-algebra, which has the metric approximation property”, Inventiones Mathematicae 50 (1979), 279–293](https://doi.org/10.1007/BF01410082) - [openai/math, “Relative generation and the generator problem for finite factors” (2026)](https://github.com/openai/math/blob/main/preprints/Relative-generation-and-the-generator-problem-for-finite-factors-September-23-2026/paper.pdf): “We prove that every type $\mathrm{II}_1$ factor with separable predual is” ## Related - [The Kadison–Ringrose cohomology conjecture](https://closedform.nishachay.tech/e/openai-math-2026-295/) - Operator algebras - [A ZFC counterexample to Naimark's problem](https://closedform.nishachay.tech/e/openai-math-2026-297/) - Operator algebras - [Kaplansky's quasitrace conjecture and failure of tensor-product stable finiteness](https://closedform.nishachay.tech/e/openai-math-2026-294/) - Operator algebras - [Two notions of free entropy differ even when both are finite](https://closedform.nishachay.tech/e/openai-math-2026-298/) - Operator algebras - [Invariant projections, hyperinvariant subspaces, and transitive algebras](https://closedform.nishachay.tech/e/openai-math-2026-293/) - Operator algebras - [Operator algebras](https://closedform.nishachay.tech/science/mathematics/operator-algebras/) - Field · 19 results - [Open since the 1960s](https://closedform.nishachay.tech/open-since/1960s/) - Era · 33 results - [Lean-checked results](https://closedform.nishachay.tech/trust/lean-checked/) - Trust · 242 results - [Report an error](https://github.com/nishachay/closed-form/issues/new?template=report-error.yml&labels=entry-error&title=%5Bentry%20296%5D%20)