Minimal and maximal matrix convex sets
Abstract
To every convex body K ⊂eq Rd, one may associate a minimal matrix convex set Wmin(K), and a maximal matrix convex set Wmax(K), which have K as their ground level. The main question treated in this paper is: under what conditions on a given pair of convex bodies K,L ⊂eq Rd does Wmax(K) ⊂eq Wmin(L) hold? For a convex body K, we aim to find the optimal constant θ(K) such that Wmax(K) ⊂eq θ(K) · Wmin(K); we achieve this goal for all the p unit balls, as well as for other sets. For example, if Bp,d is the closed unit ball in Rd with the p norm, then \[ θ(Bp,d) = d1-|1/p - 1/2|. \] This constant is sharp, and it is new for all p ≠ 2. Moreover, for some sets K we find a minimal set L for which Wmax(K) ⊂eq Wmin(L). In particular, we obtain that a convex body K satisfies Wmax(K) = Wmin(K) if and only if K is a simplex. These problems relate to dilation theory, convex geometry, operator systems, and completely positive maps. We discuss and exploit these connections as well. For example, our results show that every d-tuple of self-adjoint operators of norm less than or equal to 1, can be dilated to a commuting family of self-adjoints, each of norm at most d. We also introduce new explicit constructions of these (and other) dilations.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.