Abstract
To each semidefinite program (SDP) in primal form, we associate the matrix algebra generated by its constraint matrices. In this note, we show that this algebra is always a full matrix algebra for SDPs arising from (commutative or non-commutative) sum of squares (SOS) problems. For SDPs arising from non-commutative SOS and commutators problems, the situation is less clear. We identify an exceptional case, where the corresponding matrix algebra is not the full matrix algebra, and use it to reprove the Burgdorf–Klep non-commutative variant of Hilbert’s ternary quartics theorem: a bivariate non-commutative polynomial of degree at most is trace positive if it is a sum of four squares and commutators.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
