The Arveson boundary of a Free Quadrilateral is given by a noncommutative variety
Abstract
Let SMn(R)g denote g-tuples of n × n real symmetric matrices and set SM(R)g = n SMn(R)g. A free quadrilateral is the collection of tuples X ∈ SM(R)2 which have positive semidefinite evaluation on the linear equations defining a classical quadrilateral. Such a set is closed under a rich class of convex combinations called matrix convex combination. That is, given elements X=(X1, …, Xg) ∈ SMn1(R)g and Y=(Y1, …, Yg) ∈ SMn2(R)g of a free quadrilateral Q, one has \[ V1T X V1+V2T Y V2 ∈ Q \] for any contractions V1:Rn Rn1 and V2:Rn Rn2 satisfying V1T V1+V2T V2=In. These matrix convex combinations are a natural analogue of convex combinations in the dimension free setting. A natural class of extreme point for free quadrilaterals is free extreme points: elements of a free quadrilateral which cannot be expressed as a nontrivial matrix convex combination of elements of the free quadrilateral. These free extreme points serve as the minimal set which recovers a free quadrilateral through matrix convex combinations. In this article we show that the set of free extreme points of a free quadrilateral is determined by the zero set of a collection of noncommutative polynomials. More precisely, given a free quadrilateral Q, we construct noncommutative polynomials p1,p2,p3,p4 such that a tuple X ∈ SM (R)2 is a free extreme point of a Q if and only if X ∈ Q and pi(X) =0 for i=1,2,3,4 and X is irreducible. In addition we establish several basic results for projective maps of free spectrahedra and for homogeneous free spectrahedra.
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.