Pith. sign in

REVIEW 2 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2501.08526 v1 pith:SR2MOJUY submitted 2025-01-15 math.LO math.OA

classification math.LOmath.OA
keywords boldacomputablecomputablypresentationalgebraalgebrasenumerablemathrm
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Computable presentations of randomizations

    math.LO 2025-06 conditional novelty 7.0 of 10

    A countable structure has a decidable presentation exactly when its Borel randomization has an aware computable presentation, and effectively ω-categorical structures have computably categorical randomizations.

  2. Non-computability of $K$-theory for computably presented C*-algebras

    math.OA 2026-02 conditional novelty 6.0 of 10

    There exists a unital, nuclear C*-algebra that a computer can present, yet neither its K0 nor K1 group can be presented by a computer.

Pith tools