Bibliographic record
Abstract
ABSTRACT. We prove that the C ∗-algebra of a minimal diffeomorphism satisfies Blackadar’s Fundamental Comparability Property for positive elements. This leads to the classification, in terms of K-theory and traces, of the isomorphism classes of countably generated Hilbert modules over such algebras, and to a similar classification for the closures of unitary orbits of self-adjoint elements. We also obtain a structure theorem for the Cuntz semigroup in this setting, and prove a conjecture of Blackadar and Handelman: the lower semicontinuous dimension functions are weakly dense in the space of all dimension functions. These results continue to hold in the broader setting of unital simple ASH algebras with slow dimension growth and stable rank one. Our main tool is a sharp bound on the radius of comparison of a recursive subhomogeneous C ∗-algebra. This is also used to construct uncountably many non-Morita-equivalent simple separable amenable C ∗-algebras with the same K-theory and tracial state space, providing a C ∗-algebraic analogue of McDuff’s uncountable family of II1 factors. We prove in passing that the range of the radius of comparison is exhausted by simple C ∗-algebras. 1.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.000 |
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".