Computable $K$-theory for $\mathrm{C}^*$-algebras: UHF algebras

TL;DR

This paper explores the effective aspects of $K$-theory for $ ext{C}^*$-algebras, establishing computability results for $K$-groups and their structures, especially focusing on UHF algebras and their computable presentations.

Contribution

It introduces computable functors for $K$-theory of $ ext{C}^*$-algebras, proves computability of $K$-groups for UHF algebras, and characterizes when these algebras have computable presentations.

Findings

Computable functors relate presentations of $ ext{C}^*$-algebras to their $K$-groups.

For UHF algebras, $K_0$-groups have computable presentations.

Every UHF algebra is computably categorical.

Abstract

We initiate the study of the effective content of $K$-theory for $\mathrm{C}^*$-algebras. We prove that there are computable functors which associate, to a computably enumerable presentation of a $\mathrm{C}^*$-algebra $\boldA$, computably enumerable presentations of the abelian groups $K_0(\boldA)$ and $K_1(\boldA)$. When $\boldA$ is stably finite, we show that the positive cone of $K_0(\boldA)$ is computably enumerable. We strengthen the results in the case that $\boldA$ is a UHF algebra by showing that the aforementioned presentation of $K_0(\boldA)$ is actually computable. In the UHF case, we also show that $\boldA$ has a computable presentation precisely when $K_0(\boldA)$ has a computable presentation, which in turn is equivalent to the supernatural number of $\boldA$ being lower semicomputable; we give an example that shows that this latter equivalence cannot be improved to requiring that the supernatural number of $\boldA$ is computable. Finally, we prove that every UHF algebra is computably categorical.