Positive univariate trace polynomials

From MaRDI portal



Abstract: A univariate trace polynomial is a polynomial in a variable x and formal trace symbols Tr(x^j). Such an expression can be naturally evaluated on matrices, where the trace symbols are evaluated as normalized traces. This paper addresses global and constrained positivity of univariate trace polynomials on symmetric matrices of all finite sizes. A tracial analog of Artin's solution to Hilbert's 17th problem is given: a positive semidefinite univariate trace polynomial is a quotient of sums of products of squares and traces of squares of trace polynomials.


The focus of the paper is to present a sort of Positivstellensatz for univariate trace polynomials. And as a consequence a characterisation of positive univariate trace polynomials restricted to symmetric matrices. The authors first present some interesting basic results on trace polynomials which are almost immediate from a much older and more abstract result in the 70's which dealt with multivariate trace polynomials [\textit{C. Procesi}, Adv. Math. 19, 306--381 (1976; Zbl 0331.15021)]. For instance, we have a nice characterization of when a function between symmetric matrices is actually a univariate trace polynomial (see Prop. 2.1 of the paper). These are not directly used in the main result but are of interest to readers interested in trace polynomials. The proof of the main result can be found in Section 3 where the authors characterise trace polynomials that are positive when restricted to symmetric matrices in a positivity set defined by a finite set of pure trace polynomials. They also give examples and remarks why some of these conditions are indispensible in this characterization.



Cites work









This page was built for publication: Positive univariate trace polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019288)