October 12, 2006
We give a short and elementary proof of a theorem of Procesi, Schacher and (independently) Gondard, Ribenboim that generalizes a famous result of Artin. Let $A$ be an $n \times n$ symmetric matrix with entries in the polynomial ring $\mathbb R[x_1,...,x_m]$. The result is that if $A$ is postive semidefinite for all substitutions $(x_1,...,x_m) \in \mathbb R^m$, then $A$ can be expressed as a sum of squares of symmetric matrices with entries in $\mathbb R(x_1,...,x_m)$. Moreover, our proof is constructive and gives explicit representations modulo the scalar case.
Similar papers 1
October 29, 2008
In 1976 Procesi and Schacher developed an Artin-Schreier type theory for central simple algebras with involution and conjectured that in such an algebra a totally positive element is always a sum of hermitian squares. In this paper elementary counterexamples to this conjecture are constructed and cases are studied where the conjecture does hold. Also, a Positivstellensatz is established for noncommutative polynomials, positive semidefinite on all tuples of matrices of a fixed...
July 26, 2017
We study sum-of-squares representations of symmetric univariate real matrix polynomials that are positive semidefinite along the real line. We give a new proof of the fact that every positive semidefinite univariate matrix polynomial of size $n\times n$ can be written as a sum of squares $M=Q^TQ$, where $Q$ has size $(n+1)\times n$, which was recently proved by Blekherman-Plaumann-Sinn-Vinzant. Our new approach using the theory of quadratic forms allows us to prove the conjec...
January 5, 2019
The paper proves sum-of-square-of-rational-function based representations (shortly, sosrf-based representations) of polynomial matrices that are positive semidefinite on some special sets: $\mathbb{R}^n;$ $\mathbb{R}$ and its intervals $[a,b]$, $[0,\infty)$; and the strips $[a,b] \times \mathbb{R} \subset \mathbb{R}^2.$ A method for numerically computing such representations is also presented. The methodology is divided into two stages: (S1) diagonalizing the initial polyno...
February 23, 2016
Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2^n$ squares are needed. In this paper, we investigate situations where Pfister's theorem may be improved. We show that a real polynomial of degree $d$ in $n$ variables that is positive semidefinite is a sum of $2^n-1$ squares of rational functions if $d\leq 2n-2$. If $n$ is even, or equal t...
March 30, 2019
In this paper we establish some applications of the Scherer-Hol's theorem for polynomial matrices. Firstly, we give a representation for polynomial matrices positive definite on subsets of compact polyhedra. Then we establish a Putinar-Vasilescu Positivstellensatz for homogeneous and non-homogeneous polynomial matrices. Next we propose a matrix version of the P\'olya-Putinar-Vasilescu Positivstellensatz. Finally, we approximate positive semi-definite polynomial matrices using...
January 7, 2021
This paper solves the rational noncommutative analog of Hilbert's 17th problem: if a noncommutative rational function is positive semidefinite on all tuples of hermitian matrices in its domain, then it is a sum of hermitian squares of noncommutative rational functions. This result is a generalization and culmination of earlier positivity certificates for noncommutative polynomials or rational functions without hermitian singularities. More generally, a rational Positivstellen...
August 17, 2012
Let $\Rx$ denote the ring of polynomials in $g$ freely non-commuting variables $x=(x_1,...,x_g)$. There is a natural involution * on $\Rx$ determined by $x_j^*=x_j$ and $(pq)^*=q^* p^*$ and a free polynomial $p\in\Rx$ is symmetric if it is invariant under this involution. If $X=(X_1,...,X_g)$ is a $g$ tuple of symmetric $n\times n$ matrices, then the evaluation $p(X)$ is naturally defined and further $p^*(X)=p(X)^*$. In particular, if $p$ is symmetric, then $p(X)^*=p(X)$. The...
January 31, 2023
Suppose $Q(x)$ is a real $n\times n$ regular symmetric positive semidefinite matrix polynomial. Then it can be factored as $$Q(x) = G(x)^TG(x),$$ where $G(x)$ is a real $n\times n$ matrix polynomial with degree half that of $Q(x)$ if and only if $\det(Q(x))$ is the square of a nonzero real polynomial. We provide a constructive proof of this fact, rooted in finding a skew-symmetric solution to a modified algebraic Riccati equation $$XSX - XR + R^TX + P = 0,$$ where $P,R,S$ are...
September 21, 2020
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 quoti...
December 7, 2020
In this work we study the problem of writing a Hermitian polynomial as a Hermitian sum of squares modulo a Hermitian ideal. We investigate a novel idea of Putinar-Scheiderer to obtain necessary matrix positivity conditions for Hermitian polynomials to be Hermitian sums of squares modulo Hermitian ideals. We show that the conditions are sufficient for a class of examples making a connection to the operator-valued Riesz-Fejer theorem and block Toeplitz forms. The work fits into...