C*-simplicity and the unique trace property for discrete groups
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.010 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it