arXiv · 2005.11582
Strongly peaking representations and compressions of operator systems
Abstract
We use Arveson's notion of strongly peaking representation to generalize uniqueness theorems for free spectrahedra and matrix convex sets which admit minimal presentations. A fully compressed separable operator system necessarily generates the C*-envelope and is such that the identity is the direct sum of strongly peaking representations. In particular, a fully compressed presentation of a separable operator system is unique up to unitary equivalence. Under various additional assumptions, minimality conditions are sufficient to determine a separable operator system uniquely.
Explore related subjects
Keep this discovery
Kenneth R. Davidson, Benjamin Passer. 2020-05-23. Strongly peaking representations and compressions of operator systems. https://doi.org/10.1093/imrn/rnaa228
Cite the original work for its findings. Save a collection to share your selection of sources.