Duality, extreme points and hulls for noncommutative partial convexity
Abstract
This article studies generalizations of (matrix) convexity, including partial convexity and biconvexity, under the umbrella of -convexity. Here is a tuple of free symmetric polynomials determining the geometry of a -convex set. The paper introduces the notions of -operator systems and -ucp maps and establishes a Webster-Winkler type categorical duality between -operator systems and -convex sets. Next, a notion of an extreme point for -convex sets is defined, paralleling the concept of a free extreme point for a matrix convex set. To ensure the existence of such points, the matricial sets considered are extended to include an operator level. It is shown that the -extreme points of an operator -convex set K are in correspondence with the free extreme points of the operator convex hull of (K). From this result, a Krein-Milman theorem for -convex sets follows. Finally, relying on the results of Helton and the first two authors, a construction of an approximation scheme for the -convex hull of the matricial positivity domain (also known as a free semialgebraic set) Dp of a free symmetric polynomial p is given. The approximation consists of a decreasing family of -analogs of free spectrahedra, whose projections, under mild assumptions, in the limit yield the -convex hull of Dp.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.