betaFeedback

WorksMathematics

Effectively nuclear C*-algebras

Abstract

We study the computable content of nuclearity for C∗C^*-algebras. We show that nuclearity effectivizes automatically: a presentation of a C∗C^*-algebra is effectively nuclear, in the sense that the completely positive approximations witnessing nuclearity can be computed uniformly from the data they approximate, if and only if it is a computable presentation of a nuclear C∗C^*-algebra, and likewise for the effectivization of the Choi–Effros form of nuclearity. The main tool is an effective version of the Arveson extension theorem: we prove that the nn-th matrix numerical range of a tuple from a computable presentation is computably compact, uniformly in all of its data, and deduce an algorithm which converts an approximately attainable tuple of matrices into a computable unital completely positive map attaining it. A byproduct is that the computable states of any computable presentation of a unital C∗C^*-algebra are weak∗^*-dense in its state space. We also prove that the Cuntz algebras On\mathcal{O}_n are computably categorical and obtain an effective form of Kirchberg–Phillips absorption. By contrast with the conditions above, we do not know whether every computable presentation of a nuclear C∗C^*-algebra admits a computable embedding into O2\mathcal{O}_2 with a computable conditional expectation; we answer this affirmatively for commutative C∗C^*-algebras, for AF algebras, and, by a dynamical argument using invariant states, for the group C∗C^*-algebras of a class of amenable groups including all finitely presented residually finite ones. Finally, we show that the set of indices of computable presentations of nuclear C∗C^*-algebras is Π20Π^0_2, and that the corresponding set for c.e. presentations is Π20Π^0_2-hard; the latter rests on a result of independent interest, namely that amenability of computable groups is Π20Π^0_2-complete within the class of computable groups.

Introduction

A C∗^*-algebra AA is nuclear if the identity map on AA is the point-norm limit of maps that factor through finite-dimensional matrix algebras by unital completely positive (ucp) maps, that is, for every finite tuple a⃗\vec{a} from AA and every ϵ>0\epsilon> 0, there are n≥1n \ge1 and ucp maps ϕ:A→Mn(C)\phi: A \to M_n(\mathbb{C}) and ψ:Mn(C)→A\psi: M_n(\mathbb{C}) \to A satisfying max⁡i∥(ψ∘ϕ)(ai)−ai∥<ϵ\max_i \|(\psi\circ\phi)(a_i) - a_i\| < \epsilon. Nuclearity is one of the central finiteness conditions in operator algebras: it is equivalent to the uniqueness of the C∗^*-norm on algebraic tensor products A⊙BA \odot B, it is the C∗^*-algebraic analogue of amenability for groups (a discrete group GG being amenable exactly when Cr∗(G)C_r^*(G) is nuclear), and it is a standing hypothesis in the Elliott classification programme. This paper is concerned with the computable content of nuclearity. The setting is the computable structure theory of C∗C^*-algebras developed by Fox [11], in which a presentation A#A^\# of a C∗C^*-algebra AA consists of a distinguished sequence of points whose rational ∗*-polynomial combinations are dense; the presentation is c.e. if the norms of these generated points are uniformly right-c.e., and computable if they are uniformly computable. In our previous papers [10, 8], we began a programme of computable KK-theory for C∗C^*-algebras, carried out in detail for UHF and AF algebras; several of the tools developed there—the uniformly computable presentations of matrix amplifications [8 Proposition 1.7], the passage from computably weakly stable relations to c.e. closed sets [8 Theorem 1.12], and computable AF-certificates [10 Main Theorem 1]—are used throughout the present paper. The index set computations of [10], showing that the set of indices of computable presentations of UHF algebras, and likewise of (simple) AF algebras, are Π20\Pi^0_2-complete, are the direct precursors of Section 6 below.

The basic question we address is: what does it mean for a presentation to be nuclear in an effective way, and is this stronger than being a computable presentation of a nuclear algebra? Given that our earlier works considered very special subclasses of the class of nuclear algebras, zooming out and considering the broader class as a whole is a natural next step. There are several reasonable ways to effectivize the definition above. The most direct is to ask that the ucp maps witnessing the completely positive approximation property be computable and be produced by an algorithm; we call such a presentation effectively nuclear (Definition 3.1(1)). One may instead effectivize the Choi–Effros form of nuclearity, asking for a uniformly computable sequence of finite-rank ucp maps A#→A#A^\# \to A^\# with computably bounded ranks converging computably pointwise to the identity; we call this effectively Choi–Effros nuclear (Definition 3.1(2)). Our first main result is that none of these distinctions is real: nuclearity effectivizes automatically.

Theorem A (Theorem 3.5). Let A#A^\# be a presentation of a C∗C^*-algebra AA. The following are equivalent:

(1) A#A^\# is computable and AA is nuclear;

(2) A#A^\# is effectively nuclear;

(3) A#A^\# is computable and effectively Choi–Effros nuclear.

Moreover, the passage from (1) to (2) is uniform in a unital index for A#A^\#.

We note that the implication (2) ⇒\Rightarrow (1) contains the observation that effective nuclearity already forces the presentation to be computable (Lemma 3.2). It is natural to compare Theorem A with the situation for groups, where the analogous phenomenon holds: a computable presentation of a group admits a computable Følner sequence precisely when the group is amenable (see [6]).

The engine behind Theorem A is an effective form of the Arveson extension theorem, which we believe is of independent interest and which occupies § 3. Given a tuple a⃗=(a1,…,ak)\vec{a}=(a_1,\ldots,a_k) in AA and n≥1n\geq1, consider the nn-th matrix numerical range

Ka⃗,n:={(Φ(a1),…,Φ(ak)):Φ:A→Mn(C) ucp},K_{\vec{a},n}:=\{(\Phi(a_1),\ldots,\Phi(a_k)):\Phi:A\to M_n(\mathbb{C})\ \mathrm{ucp}\},

a compact convex subset of the finite-dimensional space Ek,n=(Mn(C))kE_{k,n}=(M_n(\mathbb{C}))^k; for n=1n=1 this is the classical joint numerical range. The key technical point is that Ka⃗,nK_{\vec{a},n} is computably compact, uniformly in all of its data. This is proved by identifying, via Choi’s correspondence, the support function of Ka⃗,nK_{\vec{a},n} with a constrained supremum over the state space of Mn(A)M_n(A), and then dualising: the constrained supremum is shown to equal an infimum of a computable quantity over a computably bounded set of self-adjoint matrices (Lemma 2.4). With computable compactness in hand, one can decide whether a prescribed tuple b⃗\vec b of matrices is approximately attainable, and then produce an actual computable ucp map attaining it:

Theorem B (Theorem 2.8). There is an algorithm which, on input a unital index for a computable presentation A#A^\# of a unital C∗C^*-algebra AA, integers n,k≥1n,k \ge1, codes for generated points a⃗\vec a of A#A^\#, a code for a rational b⃗∈Ek,n\vec b \in E_{k,n}, and a rational δ>0\delta> 0 such that d(b⃗,Ka⃗,n)<δd(\vec b,K_{\vec a,n}) < \delta, outputs an index for a computable ucp map Φ:A→Mn(C)\Phi:A \to M_n(\mathbb{C}) with max⁡1≤i≤k∥Φ(ai)−bi∥<δ\max_{1\le i\le k}\|\Phi(a_i)-b_i\| < \delta.

The apparent uncomputability of the Arveson extension theorem is what obstructs the naive attempts to prove Theorem A, and Theorem B removes that obstruction in exactly the approximate, matrix-valued form that the definition of nuclearity requires. A pleasant byproduct of the case n=1n=1 is that the computable states of any computable presentation of a unital C∗C^*-algebra are weak∗^*-dense in its state space (Corollary 2.9); in particular, every such presentation has a computable state, a fact we use repeatedly and which was previously available to us only through ad hoc constructions in concrete examples.

Sections 4 and 5 turn to the Cuntz algebra O2O_2 and to the strongest of the effective nuclearity conditions we consider. In Section 4 we prove:

Theorem C (Theorem 4.4). For every n≥2n \ge2, the Cuntz algebra OnO_n is computably categorical, that is, any two computable presentations of OnO_n are computably isomorphic.

The proof combines an effective Baire category theorem with the fact that every computable presentation of OnO_n contains a computable generating Cuntz nn-tuple; the genericity input is a density theorem of Rørdam [21] on unitaries inducing inner automorphisms. Theorem C allows us to speak of the computable presentation of O2O_2, and it yields an effective form of the Kirchberg-Phillips absorption theorem: for a simple, separable C∗C^*-algebra AA with computable presentation A#A^\#, the algebra AA is nuclear if and only if the tensor product presentation (A⊗O2)#(A\otimes O_2)^\# is computably isomorphic to O2O_2 (Corollary 4.5).

Kirchberg’s theorem also characterises nuclearity of a separable unital C∗C^*-algebra by the existence of a unital embedding into O2O_2 whose image is the range of a conditional expectation. Effectivizing this characterisation seems more challenging than those conditions considered in Theorem A, and so we isolate it as Definition 5.1: A#A^\# is effectively Kirchberg nuclear if there is a computable embedding A#↪O2A^\# \hookrightarrow O_2 admitting a computable conditional expectation O2→A#O_2 \to A^\#. Unlike the conditions in Theorem A, we do not know whether this one is automatic:

Question A (Question 5.4). Is every computable presentation of a nuclear C∗C^*-algebra effectively Kirchberg nuclear?

The difficulty is that the classical proof of Kirchberg’s theorem is of a quite different character from the approximation arguments underlying Theorem A and we see no route to effectivizing it directly. We offer a useful reformulation of this property, namely that A#A^\# is effectively Kirchberg nuclear if and only if it embeds computably, with computable expectation, into some computable presentation of a simple nuclear C∗C^*-algebra (Lemma 5.2(3)). We then exhibit such an ambient algebra in several classes of interest. In the commutative case, the ambient algebra is the CAR algebra, reached through an effective version of the Miljutin–Pełczyński theorem [19, 20] on embeddings of C(X)C(X) into C(2N)C(2^{\mathbb{N}}) with expectation; in the AF case it is a UHF algebra built from a computable AF-certificate.

Theorem D. (Corollary 5.8, Proposition 5.9). Every computable presentation of a commutative unital C∗C^*-algebra is effectively Kirchberg nuclear, and so is every computable presentation of an AF algebra.

Since commutative C∗C^*-algebras other than C\mathbb{C} are never simple, Theorem D is not a consequence of the (straightforward) fact that computable presentations of simple nuclear algebras are effectively Kirchberg nuclear.

For group C∗C^*-algebras, our approach is dynamical and the point of entry is the observation that the conditional expectation one needs comes from an invariant state. Precisely, if G#↷αA#G^\# \curvearrowright_\alpha A^\# is a computable action and φ\varphi is an α\alpha-invariant state on AA which is computable on A#A^\#, then ∑sasus↦∑sφ(as)us\sum_s a_su_s \mapsto\sum_s\varphi(a_s)u_s is a computable conditional expectation from A⋊αGA\rtimes_\alpha G onto C∗(G)C^*(G) (Lemma 5.12). (In fact, the existence of some conditional expectation onto C∗(G)C^*(G) forces the existence of an invariant state, so the hypothesis is necessary and sufficient.) Invariant states form a co-c.e. closed set in the (computably compact) state space of a computably presented nuclear C∗C^*-algebra (Lemma 5.14), and amenability of GG guarantees that this class is nonempty; when it is moreover a singleton, its unique member is computable member. This yields:

Theorem E. (Theorem 5.15, Corollaries 5.18 and 5.19). Let G#G^\# be a computable presentation of an amenable group GG, and suppose GG admits a computable action on a computably compact presentation of a compact metric space which is topologically free, minimal, and uniquely ergodic. Then C∗(G)#C^*(G)^\# is effectively Kirchberg nuclear. In particular, this holds whenever GG admits a computable descending chain of finite-index normal subgroups with trivial intersection, and hence for every finitely presented, residually finite, amenable group.

Section 6 concerns the complexity of nuclearity as a property of indices. Writing Nuc for the set of indices of computable presentations of nuclear C∗C^*-algebras, the proof of Theorem A shows in particular that Nuc is Π20\Pi^0_2 (Proposition 6.1); we conjecture that it is Π20\Pi^0_2-complete (Question 6.2). Towards this end, we settle the analogous question for groups, in the sharper form that the hardness is visible already within the class of (indices of) groups:

Theorem F. (Theorems 6.5 and 6.9). The set Amen of indices of computable amenable groups is Π20\Pi^0_2-complete within the class Grp of indices of computable groups. The same is true of the set InnAmen of indices of computable inner amenable groups.

The construction interleaves two strategies: at stages where a fixed c.e. set WeW_e receives no new element, we build one more step of a copy of the free group F2F_2 (respectively, of SL2(F2(t))SL_2(\mathbb{F}_2(t))), and at stages where WeW_e grows, we collapse the fragment built so far into a finite group. That the second strategy is always available rests on a theorem of Iwasawa [17] to the effect that the finite-index normal subgroups of a free group intersect trivially.

Transferring this through the universal group C∗C^*-algebra construction gives the hardness half of the picture for C∗C^*-algebras:

Theorem G (Corollary 6.10). The set of indices of c.e. presentations of nuclear C∗^*-algebras is Π20\Pi^0_2-hard.

The gap between Theorem G and a complete answer to Question 6.2 is precisely the question of whether that set is Π20\Pi^0_2 (Question 6.11); the proof that Nuc is Π20\Pi^0_2 uses computability of the presentation in an essential way, through the effective Arveson extension theorem, and so does not apply to merely c.e. presentations.

The paper is organised as follows. Section 2 develops the effective Arveson extension theorem and the computable compactness of matrix numerical ranges. Section 3 introduces the effective forms of nuclearity and proves Theorem A. Section 4 proves the computable categoricity of On\mathcal{O}_n and deduces an effective Kirchberg–Phillips absorption result. Section 5 treats effective Kirchberg nuclearity, with subsections on commutative algebras, AF algebras, and group C∗^*-algebras. Section 6 is devoted to the Π20\Pi^0_2 complexity results.

We assume familiarity with the basics of computable presentations of metric structures as it pertains to C∗^*-algebras; our earlier papers [10] and [8] as well as the recent textbook [13] are suitable references. A good source for the requisite C∗^*-algebra theory is [3].

Conventions

Conventions. Throughout the paper, all C∗^*-algebras are assumed to be unital and all presentations of C∗^*-algebras are assumed to be computably unital, meaning that the unit is a computable point of the presentation. Note that a computably unital presentation need not be computable. A unital index for a computable and computably unital presentation consists of an index for the presentation together with an index for the unit. Since we will be assuming presentations are computably unital, when we say a presentation is computable we mean it is computable and computably unital.

AI Declaration Statement

While working on an initial draft of the paper, we uploaded our results to Claude Opus 5 for its opinion. It suggested an improvement to our results via the Effective Arveson Extension Theorem that is proved in Section 2. The arguments were reworked and rewritten to accommodate this suggestion. Also, it suggested an extension and application of our work on computability of crossed products (Proposition 5.11) which we then incorporated into Section 5. All of the writing of this paper was done by the authors and as such we take full responsibility for the contents of the paper.

Effective Arveson Extension

Throughout this section, we set Ek,n:=(Mn(C))kE_{k,n} := (M_n(\mathbb{C}))^k, which we view as a real vector space equipped with the real inner product

⟨b⃗,c⃗⟩:=Re⁡∑i=1kTr⁡(ci∗bi)\langle\vec{b},\vec{c}\rangle:= \operatorname{Re}\sum_{i=1}^{k}\operatorname{Tr}(c_i^*b_i)

and associated norm ∣⋅∣\lvert\cdot\rvert. Recall that for a matrix b∈Mn(C)b \in M_n(\mathbb{C}), the Hilbert-Schmidt norm ∥b∥HS=Tr⁡(b∗b)1/2\lVert b\rVert_{\mathrm{HS}} = \operatorname{Tr}(b^*b)^{1/2} satisfies ∥b∥op≤∥b∥HS\lVert b\rVert_{\mathrm{op}} \le\lVert b\rVert_{\mathrm{HS}}, so bounds measured in ∣⋅∣\lvert\cdot\rvert give bounds in operator norm coordinatewise. We view Ek,nE_{k,n} as equipped with its obvious standard presentation (see also [8 Subsection 1.2]).

We write UCP⁡(A,Mn(C))\operatorname{UCP}(A,M_n(\mathbb{C})) for the set of ucp maps A→Mn(C)A \to M_n(\mathbb{C}). Given a tuple a⃗=(a1,…,ak)\vec{a}=(a_1,\ldots,a_k) in AA, set

Ka⃗,n:={(Φ(a1),…,Φ(ak)):Φ∈UCP⁡(A,Mn(C))}⊆Ek,n,K_{\vec{a},n}:=\{(\Phi(a_1),\ldots,\Phi(a_k)):\Phi\in\operatorname{UCP}(A,M_n(\mathbb{C}))\}\subseteq E_{k,n},

References

  1. [1]Robert J Archbold and Jack S Spielberg, Topologically free actions and ideals in discrete C*-dynamical systems, Proceedings of the Edinburgh Mathematical Society 37 (1994), no. 1, 119–124.DOI
  2. [2]Ola Bratteli and Akitaka Kishimoto, Homogeneity of the pure state space of the Cuntz algebra, J. Funct. Anal. 171 (2000), no. 2, 331–345. MR 1745632DOI
  3. [3]Nathaniel P. Brown and Narutaka Ozawa, C*-algebras and finite-dimensional approximations, Graduate Studies in Mathematics, vol. 88, American Mathematical Society, Providence, RI, 2008. MR 2391387DOI
  4. [4]Peter Burton, Christopher Eagle, Alec Fox, Isaac Goldbring, Matthew Harrison-Trainor, Timothy McNicholl, Alexander Melnikov, and Teerawat Thewmorakot, Computable Gelfand duality, Proc. Amer. Math. Soc. 155 (2027), no. 1, 393–409. MR 5146032arxiv.org/abs/2402.16672
  5. [5]Rodney G. Downey and Alexander G. Melnikov, Computably compact metric spaces, Bull. Symb. Log. 29 (2023), no. 2, 170–263. MR 4616053DOI
  6. [6]Karol Duda and Aleksander Ivanov, On decidability of amenability in computable groups, Arch. Math. Logic 61 (2022), 891–902.DOI
  7. [7]Christopher J. Eagle, Computability of states and traces on nuclear C*-algebras, preprint.
  8. [8]Christopher J. Eagle, Isaac Goldbring, Timothy H. McNicholl, and Russell Miller, Computable K-theory for C*-algebras: UHF algebras, Trans. Amer. Math. Soc. 379 (2026), no. 10, 7179–7208. MR 5123701arxiv.org/abs/2501.08526
  9. [9]Christopher J. Eagle and Timothy H. McNicholl, The computable functional calculus, arXiv preprint arXiv:2606.05456.arxiv.org/abs/2606.05456
  10. [10]C.J. Eagle, I. Goldbring, and T.H. McNicholl, Computable K-theory for C*-algebras II: AF algebras, arXiv preprint arXiv:2602.06882.arxiv.org/abs/2602.06882
  11. [11]Alec Fox, Computable presentations of C*-algebras, The Journal of Symbolic Logic (2022), 1–26.arxiv.org/abs/2206.01415
  12. [12]Alec Fox, Isaac Goldbring, and Bradd Hart, Locally universal C*-algebras with computable presentations, Journal of Functional Analysis 287 (2024), no. 12, 110652.arxiv.org/abs/2303.02301
  13. [13]Johanna N. Y. Franklin, Isaac Goldbring, and Timothy H. McNicholl, Effective metric structure theory, Springer Monographs in Mathematics, Springer, Cham, 2026.DOI
  14. [14]Isaac Goldbring, A non-uniformly inner amenable group, Journal of Algebra 653 (2024), 102–108.arxiv.org/abs/2311.15409
  15. [15]Isaac Goldbring, ————, Computably strongly self-absorbing C*-algebras, Theoret. Comput. Sci. 1060 (2026), Paper No. 115647, 9. MR 4989813arxiv.org/abs/2409.18834
  16. [16]Mathieu Hoyrup and Cristóbal Rojas, Computability of probability measures and Martin-Löf randomness over metric spaces, Inform. and Comput. 207 (2009), no. 7, 830–847. MR 2519075arxiv.org/abs/0709.0907
  17. [17]Ken’ichi Iwasawa, Einige Sätze über freie Gruppen, Proc. Imp. Acad. Tokyo 19 (1943), no. 6, 272–274.DOI
  18. [18]Timothy H. McNicholl, Evaluative presentations, J. Logic Comput. 35 (2025), no. 5, Paper No. exaf036, 11.arxiv.org/abs/2403.13616
  19. [19]A. A. Miljutin, Isomorphism of the spaces of continuous functions over compact sets of the cardinality of the continuum, Teor. Funkcĭi Funkcional. Anal. i Priložen. (1966), no. 2, 150–156. (1 foldout). MR 206695
  20. [20]A. Pełczyński, Linear extensions, linear averagings, and their applications to linear topological classification of spaces of continuous functions, Dissertationes Math. (Rozprawy Mat.) 58 (1968), 92. MR 227751
  21. [21]Mikael Rørdam, Classification of inductive limits of Cuntz algebras, J. Reine Angew. Math. 440 (1993), 175–200. MR 1225963DOI
  22. [22]Diego A. Rojas, Effective weak convergence and tightness of measures in computable Polish spaces, Theory Comput. Syst. 70 (2026), no. 2, Paper No. 36, 23. MR 5079441arxiv.org/abs/2410.21609
  23. [23]Robert I. Soare, Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Springer-Verlag, New York Berlin Heidelberg, 1987.
  24. [24]Mariko Yasugi, Takakazu Mori, and Yoshiki Tsujii, Effective properties of sets and functions in metric spaces with computability structure, vol. 219, 1999, Computability and complexity in analysis (Castle Dagstuhl, 1997), pp. 467–486. MR 1694444DOI

Paper details

vlnc:W_pwqxtykj
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents