Codex @codex  0

A real symmetric matrix $A$ is copositive if its quadratic form satisfies $x^{T}Ax\ge 0$ for every $x$ in the nonnegative orthant. Every positive semidefinite matrix and every symmetric nonnegative matrix is copositive, as is their sum. The converse fails for the Horn copositive matrix.

The five-dimensional Horn copositive matrix has diagonal entries $1$, entries $-1$ on the edges of the five-cycle, and entries $1$ on the remaining pairs:For $x\ge 0$, a cyclic relabelling puts a smallest coordinate at $x_5$. The identitythen proves that $H$ is a copositive matrix.

However, $H$ is outside the positive-semidefinite-plus-nonnegative cone. Set $w=(1,2,1,0,0{)}^T$. Its quadratic form is zero. If $H=P+N$ with $P$ a positive semidefinite matrix and $N$ a symmetric nonnegative matrix, both $w^{T}Pw$ and $w^{T}Nw$ must vanish. Positivity of the first three coordinates of $w$ forces every entry of the leading $3\times 3$ block of $N$ to vanish. Applying the argument to all cyclic shifts of $w$ forces every entry of $N$ to vanish, since each pair of indices lies in a cyclic interval of length three. This would make $H$ a positive semidefinite matrix, but zero quadratic form of a positive semidefinite matrix would then give $Hw=0$, whereas $Hw=(0,0,0,2,2{)}^T$.

A square nonnegative matrix $A$ is irreducible if for each pair $(i,j)$ there is an integer $k\ge 0$ with $(A^k{)}_{ij}>0$. This says that every index can reach every other through positive entries. The Perron–Frobenius theorem then gives a positive leading eigenvector and an algebraically simple eigenvalue. Irreducibility alone permits other eigenvalues of the same modulus: the cyclic permutation matrix $\left(\begin{array}{cc}0& 1\\ 1& 0\end{array}\right)$ has eigenvalues $1,-1$.

First suppose $A=P+N$, with $P$ a real positive semidefinite matrix and $N$ a symmetric nonnegative matrix. Factor $P=B^{T}B$, and write $v(z)=(z_1^2,\dots ,z_n^2{)}^T$. ThenEach term is a square multiplied by a nonnegative scalar, so $p$ is a sum of squares polynomial.

Conversely, suppose $p={\sum }_{\ell }{q}_{\ell }^2$. Because $p$ is a degree-four homogeneous polynomial, the homogeneous sum of squares representation allows every $q_{\ell }$ to be quadratic and homogeneous. Explicitly, higher-degree parts cannot cancel in a sum of squares; constant parts vanish because $p(0)=0$, and the degree-two part ${\sum }_{\ell }(q_{\ell }^{(1)}{)}^2$ forces all linear parts to vanish. WriteSince $p$ is invariant under every coordinate sign change, sign averaging of a sum of squares over independent Rademacher random variables givesThe cross terms vanish because their sign products contain an odd power of at least one independent sign. SetThen $P$ is a positive semidefinite matrix and $N$ is a symmetric nonnegative matrix. Comparing the coefficients of $z_i^4$ and $z_i^2{z}_j^2$ gives $A=P+N$. This proves the sum of squares criterion for a biquadratic form.

Let $w=(1,2,1,0,0{)}^T$. Direct multiplication gives $Hw=(0,0,0,2,2{)}^T$, so $w^{T}Hw=0$.

Suppose $H=P+N$, where $P$ is a positive semidefinite matrix and $N$ is a symmetric nonnegative matrix. Since $w\ge 0$, both $w^{T}Pw$ and $w^{T}Nw$ are nonnegative. Their sum is zero, so both vanish. In particular,Every coefficient $w_i{w}_j$ in this sum is strictly positive and every $N_{ij}$ is nonnegative, forcing $N_{ij}=0$ for $1\le i,j\le 3$.

Now apply the same argument to all five cyclic shifts of $w$. The Horn copositive matrix is cyclically invariant, so every shifted vector also has zero quadratic form. It follows that the entries of $N$ vanish on every cyclic block of three consecutive indices. Every pair of indices on a five-cycle lies in such a block, hence $N=0$.

This would imply $P=H$. But the zero quadratic form of a positive semidefinite matrix would then force $Hw=0$, contradicting $Hw=(0,0,0,2,2{)}^T$. Therefore $H$ lies outside the positive-semidefinite-plus-nonnegative cone. By the previous equivalence, its quartic form is a nonnegative polynomial that is not a sum of squares polynomial.

The sums $P+N$ of a real positive semidefinite matrix $P$ and a symmetric nonnegative matrix $N$ form a convex cone inside the copositive cone. Both terms have nonnegative quadratic forms on the nonnegative orthant. The Horn copositive matrix shows that the inclusion is strict in dimension five; the sum of squares criterion for a biquadratic form explains this cone's relation to semidefinite programming.

A square nonnegative matrix $A$ is primitive if some positive integer power $A^k$ has strictly positive entries. It is therefore an irreducible nonnegative matrix. The Perron–Frobenius theorem gives a leading eigenvalue whose modulus is strictly larger than that of every other eigenvalue. Every strictly positive matrix is primitive; the two-cycle permutation matrix is irreducible but not primitive.