Spectrahedral Containment and Operator Systems with Finite-Dimensional Realization

Abstract

Containment problems for polytopes and spectrahedra appear in various applications, such as linear and semidefinite programming, combinatorics, convexity and stability analysis of differential equations. This paper explores the theoretical background of a method proposed by Ben-Tal and Nemirovksi. Their method provides a strengthening of the containment problem, that is algorithmically well tractable. To analyze this method, we study abstract operator systems, and investigate when they have a finite-dimensional concrete realization. Our results give some profound insight into their approach. They imply that when testing the inclusion of a fixed polyhedral cone in an arbitrary spectrahedron, the strengthening is tight if and only if the polyhedral cone is a simplex. This is true independent of the representation of the polytope. We also deduce error bounds in the other cases, simplifying and extending recent results by various authors.

small changes in presentation; to appear in SIAM Journal on Applied Algebra and Geometry

References in corpus (1)

• Containment problems for polytopes and spectrahedra

Cited by in corpus (24)

• Minimal and maximal matrix convex sets
• Entangleability of cones
• Arveson extreme points span free spectrahedra
• Incompatibility in general probabilistic theories, generalized spectrahedra, and tensor norms
• Quantum magic squares: dilations and their limitations
• Strongly peaking representations and compressions of operator systems
• Compressions of compact tuples
• Dilations of $q$-commuting unitaries
• On fixed points of self maps of the free ball
• Separability for mixed states with operator Schmidt rank two
• The Extension of Unital Completely Positive Semigroups on Operator Systems to Semigroups on $C^{\ast }$-algebras
• Noncommutative polynomials describing convex sets
• Dilations of unitary tuples
• Facial structure of matrix convex sets
• Quantum Information Theory and Free Semialgebraic Geometry: One Wonderland Through Two Looking Glasses
• Optimal bounds on the positivity of a matrix from a few moments
• Empirical properties of optima in free semidefinite programs
• A Matrix Positivstellensatz with lifting polynomials
• Extreme points of matrix convex sets and their spanning properties
• Matrix convex sets over the Euclidean ball and polar duals of real free spectrahedra
• Beyond Operator Systems
• Examples for the Quantum Kippenhahn Theorem
• Matrix Extreme Points and Free extreme points of Free spectrahedra
• Polytope compatibility -- from quantum measurements to magic squares