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.

Comment: 20 pages, 1 figure

• 05C50 - Graphs and linear algebra (matrices, eigenvalues, etc.)
• 15A23 - Factorization of matrices
• 15B48 - Positive matrices and their generalizations; cones of matrices
• 52B05 - Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)