A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
The generator problem for finite factors
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Color the Plane <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:infinite matrices Levels:1
Category:Operator algebras Lean version:YES! ✔
Rate this game! 4.6 out of 5 (3,718 votes)

>>> How to Play <<<
The generator problem for finite factors. Proves that every type II1 factor with separable predual is generated by a single operator, equivalently by two self-adjoint operators, resolving the generator problem. More strongly, for every irreducible inclusion $P\subset M$ of such factors, the unitaries u with $M=W^*(P,u)$ form a dense Gδ subset in the trace 2-norm topology.

>>> Level Select <<<
released 2026-09-23  |  4 theorems · 8 lemmas · 13 proofs · 6,924 words  |  PLAY LEVEL 1 »  (pdf)
We prove that every type II1 factor with separable predual is generated by one operator, equivalently by two self-adjoint operators. Combined with the established direct-integral reduction to this case, this gives an affirmative solution of the generator problem for von Neumann algebras with separable predual.

More Operator algebras Games!
A counterexample to Kirchberg's norm-ultrapower embedding problemA counterexample to the hyperinvariant-subspace problem HOT!A counterexample to Kaplansky's quasitrace conjectureThe Kadison–Ringrose cohomology conjecture
A ZFC counterexample to Naimark's problemA counterexample to Voiculescu’s free-entropy equality conjectureThe Kirchberg–Rørdam character criterionThe Popa–Vaes quadratic strong-operator paving conjecture

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games