Monotone completeness conjecture and Kaplansky’s AW*-factor problem
For every -algebra , every bounded increasing net in the ordered self-adjoint part has a least upper bound in ; equivalently, exists in .
References
- Model theory of quasitracial AW*-algebras and the absoluteness of monotone completeness — arXiv — Jananan Arulseelan
Source: arXiv
Progress summary
Recent papers clarify logical relationships between the two conjectures, but neither conjecture has been decided.
The monotone completeness conjecture asks whether every -algebra is monotone complete; Kaplansky’s problem asks whether every type -factor is a von Neumann algebra. Both remain open.
Known results
- A -algebra is an -algebra exactly when each maximal abelian self-adjoint subalgebra is monotone complete (2015).
September–October 2026 logical reductions
An October 2026 paper gives a separable coding reducing the finite case to monotone sequential completeness of -factors, and shows that this case and Kaplansky’s problem are equivalent to arithmetic sentences in . A September 9, 2026 paper claims that every -algebra is normal and derives a forcing reduction from general counterexamples to factor counterexamples; it does not claim a resolution.
Current status (as of October 2026): Both conjectures remain open; recent work supplies formal and forcing reductions, while the September claim is unverified.
Solutions 0
No solutions have been posted yet.