Computable $K$-theory for $\mathrm{C}^*$-algebras: UHF algebras
Abstract
We initiate the study of the effective content of -theory for -algebras. We prove that there are computable functors which associate, to a computably enumerable presentation of a -algebra , computably enumerable presentations of the abelian groups and . When is stably finite, we show that the positive cone of is computably enumerable. We strengthen the results in the case that is a UHF algebra by showing that the aforementioned presentation of is actually computable. In the UHF case, we also show that has a computable presentation precisely when has a computable presentation, which in turn is equivalent to the supernatural number of being lower semicomputable; we give an example that shows that this latter equivalence cannot be improved to requiring that the supernatural number of is computable. Finally, we prove that every UHF algebra is computably categorical.
Keywords
Cite
@article{arxiv.2501.08526,
title = {Computable $K$-theory for $\mathrm{C}^*$-algebras: UHF algebras},
author = {Christopher Eagle and Isaac Goldbring and Timothy McNicholl and Russell Miller},
journal= {arXiv preprint arXiv:2501.08526},
year = {2025}
}