Quasi-Convex Free Polynomials
Abstract
Let denote the ring of polynomials in g freely non-commuting variables x=(x1,...,xg). There is a natural involution * on determined by xj*=xj and (pq)*=q* p* and a free polynomial p∈ is symmetric if it is invariant under this involution. If X=(X1,...,Xg) is a g tuple of symmetric n× n matrices, then the evaluation p(X) is naturally defined and further p*(X)=p(X)*. In particular, if p is symmetric, then p(X)*=p(X). The main result of this article says if p is symmetric, p(0)=0 and for each n and each symmetric positive definite n× n matrix A the set X:A-p(X) 0 is convex, then p has degree at most two and is itself convex, or -p is a hermitian sum of squares.
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.