The Cuntz Semigrop of C(X,A)
Bibliographic record
Abstract
The Cuntz semigroup is an isomorphism invariant for C*-algebras consisting of a semigroup with a compatible (though not algebraic) ordering. Its construction is similar to that of the Murray-von Neumann semigroup (from which the ordered K_0-group arises by the Grothendieck construction), but using positive elements in place of projections. Both rich in structure and sensitive to subtleties of the C*-algebra, the Cuntz semigroup promises to be a useful tool in the classification program for nuclear C*-algebras. It has already delivered on this promise, particularly in the study of regularity properties and the classification of nonsimple C*-algebras. The first part of this thesis introduces the Cuntz semigroup, highlights structural properties, and outlines some applications. The main result of this thesis, however, contributes to the understanding of what the Cuntz semigroup looks like for particular examples of (nonsimple) C*-algebras. We consider separable C*-algebras given as the tensor product of a commutative C*-algebra C_0(X) with a simple, approximately subhomogeneous algebra A, under the regularity hypothesis that A is Z-stable. (The Z-stability hypothesis is needed even to describe of the Cuntz semigroup of A.) For these algebras, the Cuntz semigroup is described in terms of the Cuntz semigroup of A and the Murray-von Neumann semigroups of C(K,A) for compact subsets K of X. This result is a marginal improvement over one proven by the author in [Tikuisis, A. "The Cuntz semigroup of continuous functions into certain simple C*-algebras." Internat. J. Math., to appear] (there, A is assumed to be unital), although improvements have been made to the techniques used. The second part of this thesis provides the basic theory of approximately subhomogeneous algebras, including the important computational concept of recursive subhomogeneous algebras. Theory to handle nonunital approximately subhomogeneous algebras is novel here. In the third part of this thesis lies the main result. The Cuntz semigroup computation is achieved by defining a Cuntz-equivalence invariant I(.) on the positive elements of the C*-algebra, picking out certain data from a positive element which obviously contribute to determining its Cuntz class. The proof of the main result has two parts: showing that the invariant I(.) is (order-)complete, and describing its range.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.002 | 0.005 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.008 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".