Polynomial SOS

In mathematics, a form (i.e. a homogeneous polynomial) h(x) of degree 2m in the real n-dimensional vector x is sum of squares of forms (SOS) if and only if there exist forms $g_1(x),\dots ,g_k(x)$ of degree m such that $$h(x)=\sum _{i=1}^k{g}_i(x{)}^2.$$

Every form that is SOS is also a positive polynomial, although the converse is not always true in general. In the special cases of n = 2 and 2m = 2, or n = 3 and 2m = 4, Hilbert proved that a form is SOS if and only if it is positive. The same is also true for the analogous problem with positive symmetric forms.

Although not every form is SOS, there are efficiently testable sufficient conditions for a form to be SOS. Moreover, every real nonnegative form can be approximated as closely as desired (in the $l_1$-norm of its coefficient vector) by a sequence of forms $\{f_{ϵ}\}$ that are SOS.

Square matricial representation (SMR)

To establish whether a form Template:Math is SOS amounts to solving a convex optimization problem. Indeed, any Template:Math can be written as $$h(x)=(x^{\{m\}}{)}^T(H+L(\alpha ))x^{\{m\}}$$ where $x^{\{m\}}$ is a vector containing a basis for the space of forms of degree m in x (such as all monomials of degree m), H is any symmetric matrix satisfying $h(x)=(x^{\left\{m\right\}}{)}^{T}H{x}^{\{m\}}$, and $L(\alpha )$ is a linear parameterization of the linear subspace $$ℒ=\{L=L^{\prime }:x^{\{m{\}}^{\prime }}L{x}^{\{m\}}=0\}.$$

The dimension of the vector $x^{\{m\}}$ is given by $$\sigma (n,m)=(\genfrac{}{}{0ex}{}{n+m-1}{m}),$$ whereas the dimension of the vector $\alpha$ is given by $$\omega (n,2m)=\frac{1}{2}\sigma (n,m)(1+\sigma (n,m))-\sigma (n,2m).$$

The polynomial Template:Math is SOS if and only if there exists a vector $\alpha$ such that $H+L(\alpha )$ is a positive-semidefinite matrix. This is a linear matrix inequality (LMI), and the existence of $\alpha$ is a convex feasibility problem.

The expression $h(x)=x^{\{m{\}}^{\prime }}(H+L(\alpha ))x^{\{m\}}$ was introduced with the name square matricial representation (SMR) in order to establish whether a form is SOS via an LMI. The matrix $H+L(\alpha )$ is also known as a Gram matrix.

Examples

• Consider $m=2$ and the form $h(x)=x_1^4-x_1^2{x}_2^2+x_2^4$ of degree 4 in two variables. We have $$x^{\{m\}}=\left(\begin{array}{c}{x}_1^2\\ x_1{x}_2\\ x_2^2\end{array}\right),H+L(\alpha )=\left(\begin{array}{ccc}1& 0& -{\alpha }_1\\ 0& -1+2{\alpha }_1& 0\\ -{\alpha }_1& 0& 1\end{array}\right).$$ Since there exists α such that $H+L(\alpha )\ge 0$, namely $\alpha =1$, it follows that h(x) is SOS.
• Consider $m=2$ and the form $h(x)=2x_1^4-5x_1^3{x}_2/2+x_1^2{x}_2{x}_3-2x_1{x}_3^3+5x_2^4+x_3^4$ of degree 4 in three variables. We have $$x^{\{m\}}=\left(\begin{array}{c}{x}_1^2\\ x_1{x}_2\\ x_1{x}_3\\ x_2^2\\ x_2{x}_3\\ x_3^2\end{array}\right),H+L(\alpha )=\left(\begin{array}{cccccc}2& -5/4& 0& -{\alpha }_1& -{\alpha }_2& -{\alpha }_3\\ -5/4& 2{\alpha }_1& 1/2+{\alpha }_2& 0& -{\alpha }_4& -{\alpha }_5\\ 0& 1/2+{\alpha }_2& 2{\alpha }_3& {\alpha }_4& {\alpha }_5& -1\\ -{\alpha }_1& 0& {\alpha }_4& 5& 0& -{\alpha }_6\\ -{\alpha }_2& -{\alpha }_4& {\alpha }_5& 0& 2{\alpha }_6& 0\\ -{\alpha }_3& -{\alpha }_5& -1& -{\alpha }_6& 0& 1\end{array}\right).$$ Since $H+L(\alpha )\ge 0$ for $\alpha =(1.18,-0.43,0.73,1.13,-0.37,0.57)$, it follows that Template:Math is SOS.

Generalizations and analogs

Matrix SOS

A matrix form F(x) (i.e., a matrix whose entries are forms) of dimension r and degree 2m in the real n-dimensional vector x is SOS if and only if there exist matrix forms $G_1(x),\dots ,G_k(x)$ of degree m such that $$F(x)=\sum _{i=1}^k{G}_i(x{)}^T{G}_i(x).$$

Matrix SMR

To establish whether a matrix form F(x) is SOS amounts to solving a convex optimization problem. Indeed, similarly to the scalar case any F(x) can be written according to the SMR as $$F(x)={(x^{\{m\}}\otimes I_r)}^T(H+L(\alpha ))(x^{\{m\}}\otimes I_r)$$ where $\otimes$ is the Kronecker product of matrices, H is any symmetric matrix satisfying $$F(x)={(x^{\{m\}}\otimes I_r)}^{T}H(x^{\{m\}}\otimes I_r)$$ and $L(\alpha )$ is a linear parameterization of the linear space $$ℒ=\{L=L^T:{(x^{\{m\}}\otimes I_r)}^{T}L(x^{\{m\}}\otimes I_r)=0\}.$$

The dimension of the vector $\alpha$ is given by $$\omega (n,2m,r)=\frac{1}{2}r(\sigma (n,m)(r\sigma (n,m)+1)-(r+1)\sigma (n,2m)).$$

Then, Template:Math is SOS if and only if there exists a vector $\alpha$ such that the following LMI holds: $$H+L(\alpha )\ge 0.$$

The expression $F(x)={(x^{\{m\}}\otimes I_r)}^T(H+L(\alpha ))(x^{\{m\}}\otimes I_r)$ was introduced in order to establish whether a matrix form is SOS via an LMI.

Noncommutative polynomial SOS

Consider the free algebra R⟨X⟩ generated by the n noncommuting letters X = (X₁, ..., X_n) and equipped with the involution Template:Math, such that Template:Math fixes R and X₁, ..., X_n and reverses words formed by X₁, ..., X_n. We consider Hermitian noncommutative polynomials f, which are the noncommutative polynomials of the form Template:Math. When evaluating a Hermitian noncommutative polynomial f on any n-tuple of real matrices of any size r × r produces in a positive semi-definite matrix, f is said to be matrix-positive.

A noncommutative polynomial is SOS if there exists noncommutative polynomials $h_1,\dots ,h_k$ such that $$f(X)=\sum _{i=1}^k{h}_i(X{)}^T{h}_i(X).$$

Surprisingly, in the noncommutative scenario a noncommutative polynomial is SOS if and only if it is matrix-positive. Moreover, there exist algorithms available to decompose matrix-positive polynomials in sum of squares of noncommutative polynomials.

Polynomial HSOS

A complex polynomial $p(z_1,\dots ,z_n)$ in variables $z_1,\dots ,z_n$ and their conjugates $z_1^{\ast },\dots ,z_n^{\ast }$ is Hermitian if it takes on only real values, or equivalently if each term has an equal number of conjugated and un-conjugated variables. It is a hermitian sum-of-squares (HSOS) if there are complex polynomials $g_1,\dots ,g_k$, in only the un-conjugated variables $z_1,\dots ,z_n$, such that $$p(z)=\sum _{i=1}^k{g}_i^{\ast }(z)g_i(z).$$ A Hermitian square matricial representation of $p$ is a matrix $M$ such that $p(z)=(z^{\{m\}}{)}^{\ast }M{z}^{\{m\}}$, where $(z^{\{m\}}{)}^{\ast }$ is the Hermitian transpose of the vector $z^{\{m\}}$. As first observed by Putinar, there is a choice of the matrix $M$ having certain symmetry properties, which is in fact unique and can be written explicitly. Thus testing if a Hermitian polynomial is HSOS of degree $m$ can be done by testing if a single, fixed matrix is positive-semidefinite.

See also

• Sum-of-squares optimization
• Positive polynomial
• Hilbert's seventeenth problem
• SOS-convexity