Rigidity of operator systems: tight extensions and noncommutative measurable structures
Rapha\"el Clou\^atre, Ian Thompson

TL;DR
This paper revises Arveson's conjecture on hyperrigidity of operator systems within $C^*$-algebras, linking boundary representations to unique tight extensions and noncommutative measurable structures.
Contribution
It establishes a new equivalence between boundary representations and tight extensions, extending classical approximation principles to noncommutative settings.
Findings
All irreducible representations are boundary representations iff all admit a unique tight extension.
Proves equivalence between tight extension uniqueness and rigidity of CP approximations.
Extends classical Korovkin--Saskin principle to nuclear $C^*$-algebras.
Abstract
Let be a unital -algebra generated by some separable operator system . More than a decade ago, Arveson conjectured that is hyperrigid in if all irreducible representations of are boundary representations for . Recently, a counterexample to the conjecture was found by Bilich and Dor-On. To circumvent the difficulties hidden in this counterexample, we exploit some of Pedersen's seminal ideas on noncommutative measurable structures and establish an amended version of Arveson's conjecture. More precisely, we show that all irreducible representations of are boundary representations for precisely when all representations of admit a unique "tight" completely positive extension from . In addition, we prove an equivalence between uniqueness of such tight extensions and rigidity of completely positive approximations for representations of nuclear…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Operator Algebra Research · Holomorphic and Operator Theory · Mathematical Analysis and Transform Methods
