Characterizing graph C*-correspondences
S. Kaliszewski (1), Nura Patani (1), John Quigg (1) ((1) Arizona State, University)
TL;DR
This paper establishes that all separable nondegenerate C*-correspondences over a commutative C*-algebra with discrete spectrum are equivalent to graph correspondences, providing a classification framework.
Contribution
It proves an isomorphism between such C*-correspondences and graph correspondences, extending the understanding of their structure.
Findings
Separable nondegenerate C*-correspondences over discrete spectrum are isomorphic to graph correspondences.
Provides a classification framework for these C*-correspondences.
Enhances understanding of the structure of C*-correspondences over commutative algebras.
Abstract
Every separable nondegenerate C*-correspondence over a commutative C*-algebra with discrete spectrum is isomorphic to a graph correspondence.
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 · Noncommutative and Quantum Gravity Theories · Algebraic structures and combinatorial models