The Tracial Hahn-Banach Theorem, Polar Duals, Matrix Convex Sets, and Projections of Free Spectrahedra

TL;DR

This paper develops a duality theory for matrix convex sets and free spectrahedrops, extending classical convex analysis to the noncommutative setting with applications in quantum information and free convexity.

Contribution

It introduces tracial analogs of matrix convex sets, establishes duality and separation theorems for free spectrahedrops, and provides Positivstellensatz results for free polynomials.

Findings

Free spectrahedrops are more general than free spectrahedra but more tractable.

The free polar dual of a free spectrahedrop is also a free spectrahedrop.

A Positivstellensatz for free polynomials positive on free spectrahedrops is established.

Abstract

This article investigates matrix convex sets and introduces their tracial analogs which we call contractively tracial convex sets. In both contexts completely positive (cp) maps play a central role: unital cp maps in the case of matrix convex sets and trace preserving cp (CPTP) maps in the case of contractively tracial convex sets. CPTP maps, also known as quantum channels, are fundamental objects in quantum information theory. Free convexity is intimately connected with Linear Matrix Inequalities (LMIs) L(x) = A_0 + A_1 x_1 + ... + A_g x_g > 0 and their matrix convex solution sets { X : L(X) is positive semidefinite }, called free spectrahedra. The Effros-Winkler Hahn-Banach Separation Theorem for matrix convex sets states that matrix convex sets are solution sets of LMIs with operator coefficients. Motivated in part by cp interpolation problems, we develop the foundations of convex analysis and duality in the tracial setting, including tracial analogs of the Effros-Winkler Theorem. The projection of a free spectrahedron in g+h variables to g variables is a matrix convex set called a free spectrahedrop. As a class, free spectrahedrops are more general than free spectrahedra, but at the same time more tractable than general matrix convex sets. Moreover, many matrix convex sets can be approximated from above by free spectrahedrops. Here a number of fundamental results for spectrahedrops and their polar duals are established. For example, the free polar dual of a free spectrahedrop is again a free spectrahedrop. We also give a Positivstellensatz for free polynomials that are positive on a free spectrahedrop.