Morita equivalence for operator systems
George K. Eleftherakis, Evgenios T.A. Kakariadis, Ivan G. Todorov

TL;DR
This paper introduces a new equivalence relation called $\Delta$-equivalence for operator systems, showing it aligns with stable isomorphism and preserves key properties like nuclearity and representation categories.
Contribution
It defines $\Delta$-equivalence, establishes its equivalence with stable isomorphism, and explores its implications for tensor products, order isomorphisms, and graph operator systems.
Findings
$\Delta$-equivalence coincides with stable isomorphism.
Nuclearity is invariant under $\Delta$-equivalence.
Graph operator systems' $\Delta$-equivalence characterized combinatorially.
Abstract
We define -equivalence for operator systems and show that it is identical to stable isomorphism. We define -contexts and bihomomorphism contexts and show that two operator systems are -equivalent if and only if they can be placed in a -context, equivalently, in a bihomomorphism context. We show that nuclearity for a variety of tensor products is an invariant for -equivalence and that function systems are -equivalent precisely when they are order isomorphic. We prove that -equivalent operator systems have equivalent categories of representations. As an application, we characterise -equivalence of graph operator systems in combinatorial terms. We examine a notion of Morita embedding for operator systems, showing that mutually -embeddable operator systems have orthogonally complemented -equivalent corners when…
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 · Advanced Topics in Algebra · Algebraic structures and combinatorial models
