C*-simplicity and the unique trace property for discrete groups
Bibliographic record
Abstract
A discrete group is said to be C*-simple if its reduced C*-algebra is simple, and is said to have the unique trace property if its reduced C*-algebra has a unique tracial state. A dynamical characterization of C*-simplicity was recently obtained by the second and third named authors. In this paper, we introduce new methods for working with group and crossed product C*-algebras that allow us to take the study of C*-simplicity a step further, and in addition to settle the longstanding open problem of characterizing groups with the unique trace property. We give a new and self-contained proof of the aforementioned characterization of C*-simplicity. This yields a new characterization of C*-simplicity in terms of the weak containment of quasi-regular representations. We introduce a convenient algebraic condition that implies C*-simplicity, and show that this condition is satisfied by a vast class of groups, encompassing virtually all previously known examples as well as many new ones. We also settle a question of Skandalis and de la Harpe on the simplicity of reduced crossed products. Finally, we introduce a new property for discrete groups that is closely related to C*-simplicity, and use it to prove a broad generalization of a theorem of Zimmer, originally conjectured by Connes and Sullivan, about amenable actions.
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.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.004 |
| 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.002 | 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".