Perfect Copositive Matrices

Abstract

In this paper we give a first study of perfect copositive $n \times n$ matrices. They can be used to find rational certificates for completely positive matrices. We describe similarities and differences to classical perfect, positive definite matrices. Most of the differences occur only for $n \geq 3$, where we find for instance lower rank and indefinite perfect matrices. Nevertheless, we find for all $n$ that for every classical perfect matrix there is an arithmetically equivalent one which is also perfect copositive. Furthermore we study the neighborhood graph and polyhedral structure of perfect copositive matrices. As an application we obtain a new characterization of the cone of completely positive matrices: It is equal to the set of nonnegative matrices having a nonnegative inner product with all perfect copositive matrices.

Figures (1)

• Figure 1: The copositive (black) and classical (black and grey) Ryshkov polyhedron for the case $n=2$, projected onto the hyperplane $\operatorname{Trace}Q=2$. Cartesian axes are $x=q_{11}-q_{22}$ and $y=q_{12}$ for $Q=(q_{ij})\in{\mathcal{S}}^{2}$.

Theorems & Definitions (10)

• proof
• proof
• proof : Proof of Lemma \ref{['lem:lifting']}
• proof
• proof
• proof : Proof of Theorem \ref{['thm:embedding']}
• proof
• proof
• proof
• proof : Proof of Theorem \ref{['thm:rcop-poly']}