A REPRESENTATION THEOREM FOR LOCALLY COMPACT QUANTUM GROUPS
Bibliographic record
Abstract
Recently, Neufang, Ruan and Spronk proved a completely isometric representation theorem for the measure algebra M(G) and for the completely bounded (Herz–Schur) multiplier algebra McbA(G) on [Formula: see text], where G is a locally compact group. We unify and generalize both results by extending the representation to arbitrary locally compact quantum groups 𝔾 = (M, Γ, φ, ψ). More precisely, we introduce the algebra [Formula: see text] of completely bounded right multipliers on L1(𝔾) and we show that [Formula: see text] can be identified with the algebra of normal completely bounded [Formula: see text]-bimodule maps on [Formula: see text] which leave the subalgebra M invariant. From this representation theorem, we deduce that every completely bounded right centralizer of L1(𝔾) is in fact implemented by an element of [Formula: see text]. We also show that our representation framework allows us to express quantum group "Pontryagin" duality purely as a commutation relation.
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.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 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".