English

Shape, Scale, and Minimality of Matrix Ranges

Operator Algebras 2019-07-04 v2 Functional Analysis

Abstract

We study containment and uniqueness problems concerning matrix convex sets. First, to what extent is a matrix convex set determined by its first level? Our results in this direction quantify the disparity between two product operations, namely the product of the smallest matrix convex sets over KiCdK_i \subseteq \mathbb{C}^d, and the smallest matrix convex set over the product of KiK_i. Second, if a matrix convex set is given as the matrix range of an operator tuple TT, when is TT determined uniquely? We provide counterexamples to results in the literature, showing that a compact tuple meeting a minimality condition need not be determined uniquely, even if its matrix range is a particularly friendly set. Finally, our results may be used to improve dilation scales, such as the norm bound on the dilation of (non self-adjoint) contractions to commuting normal operators, both concretely and abstractly.

Keywords

Cite

@article{arxiv.1803.09212,
  title  = {Shape, Scale, and Minimality of Matrix Ranges},
  author = {Benjamin Passer},
  journal= {arXiv preprint arXiv:1803.09212},
  year   = {2019}
}

Comments

32 pages. Version 2 includes some updates to section 3. To appear in Transactions of the American Mathematical Society

R2 v1 2026-06-23T01:04:10.909Z