Couniversality and controlled maps on product systems over right LCM semigroups
Bibliographic record
Abstract
We study the structure of C*-algebras associated with compactly aligned product systems over group embeddable right LCM-semigroups. Towards this end we employ controlled maps and a controlled elimination method that associates the original cores to those of the controlling pair, and we combine with applications of the C*-envelope theory for cosystems of nonselfadjoint operator algebras recently produced. We derive several applications of these methods that generalize results on single C*-correspondences. First we show that if the controlling group is exact then the co-universal C*-algebra of the product system coincides with the quotient of the Fock C*-algebra by the ideal of strong covariance relations. We show that if the controlling group is amenable then the product system is amenable. In particular if the controlling group is abelian then the co-universal C*-algebra is the C*-envelope of the tensor algebra. Secondly we give necessary and sufficient conditions for the Fock C*-algebra to be nuclear and exact. When the controlling group is amenable we completely characterize nuclearity and exactness of any equivariant injective Nica-covariant representation of the product system. Thirdly we consider controlled maps that enjoy a saturation property. In this case we induce a compactly aligned product system over the controlling pair that shares the same Fock representation, and preserves injectivity. By using co-universality, we show that they share the same reduced covariance algebras. If in addition the controlling pair is a total order then the fixed point algebra of the controlling group induces a super-product system that has the same reduced covariance algebra and is moreover reversible.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.000 | 0.002 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".