Completeness of the isomorphism problem for separable C*-algebras
Marcin Sabok
Abstract
Open-access reader
Marcin Sabok
Abstract
Open-access reader
We prove that the isomorphism problem for separable nuclear C*-algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of simple, separable AI C*-algebras is a complete orbit equivalence relation. This means that any isomorphism problem arsing from a continuous action of a separable completely metrizable group can be reduced to the isomorphism of simple, separable AI C*-algebras. As a consequence, we get that the isomorphism problems for separable nuclear C*-algebras and for separable C*-algebras have the same complexity. This answers questions posed by Elliott, Farah, Paulsen, Rosendal, Toms and Törnquist.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We prove that the isomorphism problem for separable nuclear C*-algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of simple, separable AI C*-algebras is a complete orbit equivalence relation. This means that any isomorphism problem arsing from a continuous action of a separable completely metrizable group can be reduced to the isomorphism of simple, separable AI C*-algebras. As a consequence, we get that the isomorphism problems for separable nuclear C*-algebras and for separable C*-algebras have the same complexity. This answers questions posed by Elliott, Farah, Paulsen, Rosendal, Toms and Törnquist.
Key concepts: Separable space, Isomorphism (crystallography), Mathematics, Metrization theorem, Equivalence relation, Isomorphism extension theorem, Equivalence (formal languages), Simple (philosophy)