← All problems

Monotone completeness conjecture and Kaplansky’s AW*-factor problem

For every AW∗\mathrm{AW}^*-algebra AA, every bounded increasing net (ai)i∈I(a_i)_{i\in I} in the ordered self-adjoint part AsaA_{\mathrm{sa}} has a least upper bound in AsaA_{\mathrm{sa}}; equivalently, sup⁡i∈Iai\sup_{i\in I}a_i exists in AsaA_{\mathrm{sa}}.

References

Progress summary

Refreshed
Open · progress reported

Recent papers clarify logical relationships between the two conjectures, but neither conjecture has been decided.

The monotone completeness conjecture asks whether every AW∗\mathrm{AW}^*-algebra is monotone complete; Kaplansky’s problem asks whether every type II1\mathrm{II}_1 AW∗\mathrm{AW}^*-factor is a von Neumann algebra. Both remain open.

Known results

  • A C∗C^*-algebra is an AW∗\mathrm{AW}^*-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 II1\mathrm{II}_1 AW∗\mathrm{AW}^*-factors, and shows that this case and Kaplansky’s problem are equivalent to Π20\Pi^0_2 arithmetic sentences in ZFC\mathrm{ZFC}. A September 9, 2026 paper claims that every AW∗\mathrm{AW}^*-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.

Sources

Solutions 0

No solutions have been posted yet.