2000 character limit reached
Spectral linear matrix inequalities
Published 31 Aug 2020 in math.AG, math.OC, and math.RT | (2008.13452v2)
Abstract: We prove, under a certain representation theoretic assumption, that the set of real symmetric matrices, whose eigenvalues satisfy a linear matrix inequality, is itself a spectrahedron. The main application is that derivative relaxations of the positive semidefinite cone are spectrahedra. From this we further deduce statements on their Wronskians. These imply that Newton's inequalities, as well as a strengthening of the correlation inequalities for hyperbolic polynomials, can be expressed as sums of squares.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.