Classification of simple 𝐶*-algebras: inductive limits of matrix algebras over trees (Q4339906)

The goal of this book is to show that inductive limits of sequences of finite sums of matrix algebras over continuous functions on trees can be recovered from K-theoretic and tracial data. More precisely, let \(A\) and \(B\) be simple unital \(C^\ast\)-algebras that can be expressed as unital inductive limits of finite direct sums of matrix algebras over \(C(X_i)\), where the spaces \(X_i\) are trees. Suppose that there is an isomorphism of order groups \(\phi_0: K_0(A)\to K_0(B)\) preserving order unit, and that there is an isomorphism between compact convex sets \(\phi_T: T(B)\to T(A)\), where \(T(A), T(B)\) are tracial spaces of \(A\) and \(B\), respectively. Finally, assume that \(\langle\tau, \phi_0g\rangle=\langle\phi_T\tau, g\rangle\), \(g\in K_0(A), \tau\in T(B)\). It follows that there exists an isomorphism \(\phi: A\to B\) inducing \(\phi_0\) and \(\phi_T\). Besides, an example is given showing that the paring equality between \(\phi_0\) and \(\phi_T\) cannot be ommitted. The above stated result has been proved for \(X_i=[0,1]\) by G. A. Elliot. Elliot's proof is based on the fact that there is a total order on \([0,1]\). Since there is no total order on trees the author uses Berg's technique to overcome this difficulty. The results and techniques of the paper will have important applications in the program of classifying separable nuclear \(C^\ast\)-algebras. For instance, the main result has been already generalized by G. A. Elliot to include the case \(X_i=S^1\).