Papers
Topics
Authors
Recent
Search
2000 character limit reached

Minimal and maximal matrix convex sets

Published 18 Jun 2017 in math.OA | (1706.05654v2)

Abstract: To every convex body $K \subseteq \mathbb{R}d$, one may associate a minimal matrix convex set $\mathcal{W}{\textrm{min}}(K)$, and a maximal matrix convex set $\mathcal{W}{\textrm{max}}(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 \subseteq \mathbb{R}d$ does $\mathcal{W}{\textrm{max}}(K) \subseteq \mathcal{W}{\textrm{min}}(L)$ hold? For a convex body $K$, we aim to find the optimal constant $\theta(K)$ such that $\mathcal{W}{\textrm{max}}(K) \subseteq \theta(K) \cdot \mathcal{W}{\textrm{min}}(K)$; we achieve this goal for all the $\ellp$ unit balls, as well as for other sets. For example, if $\overline{\mathbb{B}}{p,d}$ is the closed unit ball in $\mathbb{R}d$ with the $\ellp$ norm, then [ \theta(\overline{\mathbb{B}}{p,d}) = d{1-|1/p - 1/2|}. ] This constant is sharp, and it is new for all $p \neq 2$. Moreover, for some sets $K$ we find a minimal set $L$ for which $\mathcal{W}{\textrm{max}}(K) \subseteq \mathcal{W}{\textrm{min}}(L)$. In particular, we obtain that a convex body $K$ satisfies $\mathcal{W}{\textrm{max}}(K) = \mathcal{W}{\textrm{min}}(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 $\sqrt{d}$. We also introduce new explicit constructions of these (and other) dilations.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.