The UCT for $C^*$-algebras with finite complexity
Rufus Willett, Guoliang Yu

TL;DR
This paper introduces the concept of finite complexity for $C^*$-algebras and proves that those with finite complexity satisfy the Universal Coefficient Theorem (UCT), advancing understanding of the UCT's validity for nuclear $C^*$-algebras.
Contribution
It defines finite complexity for $C^*$-algebras and proves that all such algebras satisfy the UCT, providing a new approach to the UCT problem.
Findings
$C^*$-algebras with finite complexity satisfy the UCT.
Decomposability over nuclear UCT $C^*$-algebras implies UCT.
Finite complexity class includes many $C^*$-algebras and is characterized by an ordinal invariant.
Abstract
A -algebra satisfies the Universal Coefficient Theorem (UCT) of Rosenberg and Schochet if it is equivalent in Kasparov's -theory to a commutative -algebra. This paper is motivated by the problem of establishing the range of validity of the UCT, and in particular, whether the UCT holds for all nuclear -algebras. We introduce the idea of a -algebra that "decomposes" over a class of -algebras. Roughly, this means that locally, there are approximately central elements that approximately cut the -algebra into two -subalgebras from that have well-behaved intersection. We show that if a -algebra decomposes over the class of nuclear, UCT -algebras, then it satisfies the UCT. The argument is based on controlled -theory, as introduced by the authors in earlier work. Nuclearity is used via Kasparov's Hilbert module…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Operator Algebra Research · Algebraic structures and combinatorial models · Advanced Algebra and Logic
