A short proof of the symmetric determinantal representation of polynomials (Q2041765)

A recent theorem [\textit{J. W. Helton} et al., J. Funct. Anal. 240, No. 1, 105--191 (2006; Zbl 1135.47005)] asserts that a real, multivariate polynomial can be written as the determinant of an affine pencil of real, symmetric matrices. The proof by Helton et al. was derived from an elaborate construct of non-commutative algebra, in its turn inspired by control system theory. The note by Stefan and Welters offers an elementary proof of the same result. The authors ingeniously exploit Schur complement identities, allowing a generalization of the main result to certain fields of finite characteristic. The strong algorithmic flavor of the proof may appeal to wider groups of scientists touching numerical matrix analysis in their studies.