Math 2.0

Functional analysis Definition

Elliott classification program

Builds on K0 of a C*-algebraK1 of a C*-algebraNuclear C*-algebraC*-algebra

Definition

Let AA be a unital, separable, simple, nuclear C*-algebra. Let T(A)T(A) be its set of tracial states, a compact convex set in the weak* topology. The Elliott invariant of AA is Ell⁡(A)=(K0(A),K0(A)+,[1A],K1(A),T(A),rA).\operatorname{Ell}(A) = \big(K_0(A), K_0(A)^+, [1_A], K_1(A), T(A), r_A\big). Here K0(A)K_0(A) is K0, with positive cone K0(A)+K_0(A)^+ given by classes of projections, and [1A][1_A] is the class of the unit. The group K1(A)K_1(A) is K1. The map rA ⁣:T(A)×K0(A)→ℝr_A \colon T(A) \times K_0(A) \to \R is the pairing rA(τ,[p]−[q])=τ(p)−τ(q)r_A(\tau, [p] - [q]) = \tau(p) - \tau(q), with τ\tau extended to matrices by the trace. An isomorphism of Elliott invariants has three parts, compatible with the pairings. They are an isomorphism of ordered groups preserving the unit class, an isomorphism of the K1K_1-groups, and an affine homeomorphism of the trace spaces. A class 𝒞\mathcal{C} of such algebras is classified if, for all A,B∈𝒞A, B \in \mathcal{C}, A≅BA \cong B if and only if Ell⁡(A)≅Ell⁡(B)\operatorname{Ell}(A) \cong \operatorname{Ell}(B). The Elliott classification program is the problem of finding classified classes and of determining which invariants occur in them.

Remarks

Example: the class of unital simple AF algebras is classified by Ell⁡\operatorname{Ell}, and there K1=0K_1 = 0 and the traces are determined by the ordered K0K_0-group, so this is Elliott's AF theorem. Example: for unital Kirchberg algebras in the UCT class, T(A)T(A) is empty and (K0(A),[1A],K1(A))(K_0(A), [1_A], K_1(A)) classifies, by the Kirchberg–Phillips theorem. Non-example: Toms constructed unital simple separable nuclear C*-algebras with the same Elliott invariant that are not isomorphic, so the class of all such algebras is not classified by Ell⁡\operatorname{Ell}. For non-unital algebras one uses a variant of the invariant with traces on the Pedersen ideal or with a scale.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. C*-algebra concept
  2. K0 of a C*-algebra concept
  3. K1 of a C*-algebra concept
  4. Nuclear C*-algebra concept
  5. Elliott classification program definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Approximately_finite-dimensional_C*-algebra
About this page
Tag60RY9VZ34E
URIm2://60RY9VZ34E
Kinddefinition
WritingW0 stub
MSC46L35, 46L80, 19K14
DefinesElliott classification program
UsesK0 of a C*-algebra, K1 of a C*-algebra, Nuclear C*-algebra, C*-algebra
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.