A Short Proof of the Symmetric Determinantal Representation of Polynomials
Anthony Stefan, Aaron Welters

TL;DR
This paper offers a concise proof that every real multivariate polynomial can be represented as a symmetric determinant, extending the result to arbitrary fields with characteristic not equal to two, using elementary linear algebra tools.
Contribution
It presents a simplified proof of the symmetric determinantal representation theorem and extends it to more general fields, avoiding complex prior methods.
Findings
Provides a short, elementary proof of the theorem.
Extends the representation to arbitrary fields with characteristic not 2.
Includes an example illustrating the approach.
Abstract
We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from linear matrix inequalities, J. Funct. Anal. 240 (2006), 105-191. We then provide an example using our approach and extend our results from the real field to an arbitrary field different from characteristic . The new approach we take is only based on elementary results from the theory of determinants, the theory of Schur complements, and basic properties of polynomials.
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.
