Manuscript OpenAI@2026-10-07 · OpenAI.tex · remark · 6a931f8f
Remark: Family 294. A counterexample to Kaplansky's quasitrace conjecture
Family claims › Operator algebras · lines 1933–1938
OpenAI@2026-10-07#rem:oai-294
Disproves Kaplansky's quasitrace conjecture by constructing a separable unital complex -algebra admitting normalized -quasitraces, all of which are nonadditive. As a consequence, two unital simple stably finite -algebras can have a properly infinite minimal tensor product, with one factor .
The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.
Nearby in this section
- remark: Remark: Family 285. Counterexamples to Baum–Connes and Kadison–Kaplansky
- remark: Remark: Family 286. Arithmetic rigidity of lattice von Neumann algebras
- remark: Remark: Family 287. All nonabelian free group factors are isomorphic
- remark: Remark: Family 288. Kadison's similarity conjecture
- remark: Remark: Family 289. The strong Kadison–Kastler conjecture
- remark: Remark: Family 290. Connes' bicentralizer conjecture and relative bicentralizers
- remark: Remark: Family 291. Toms–Winter and equivariant Jiang–Su stability
- remark: Remark: Family 292. A counterexample to Kirchberg's norm-ultrapower embedding problem