Noncommutative polynomials describing convex sets
J.W. Helton, I. Klep, S. McCullough, J. Vol\v{c}i\v{c}

TL;DR
This paper characterizes when free semialgebraic sets defined by noncommutative polynomials are convex, providing an algorithm to identify such sets as free spectrahedra and revealing that convex irreducible cases are quadratic and linked to linear pencils.
Contribution
It offers a complete characterization of convex free semialgebraic sets defined by noncommutative polynomials and introduces an efficient algorithm to recognize and construct their minimal linear matrix inequality representations.
Findings
Convexity of $D_f$ implies $f$ has degree at most two for irreducible polynomials.
Provides an algorithm to determine if $D_f$ is a free spectrahedron and to find the corresponding linear pencil.
Shows that convex irreducible polynomials are Schur complements of linear pencils.
Abstract
The free closed semialgebraic set determined by a hermitian noncommutative polynomial is the closure of the connected component of containing the origin. When is a hermitian monic linear pencil, the free closed semialgebraic set is the feasible set of the linear matrix inequality and is known as a free spectrahedron. Evidently these are convex and it is well-known that a free closed semialgebraic set is convex if and only it is a free spectrahedron. The main result of this paper solves the basic problem of determining those for which is convex. The solution leads to an efficient algorithm that not only determines if is convex, but if so, produces a minimal hermitian monic pencil such that . Of independent interest is a subalgorithm based on a Nichtsingul\"arstellensatz presented here: given a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
