A real matrix is nonnegative when every entry is nonnegative. This entrywise condition differs from being a positive semidefinite matrix: the symmetric matrix is nonnegative but has eigenvalues and .
A square nonnegative matrix is irreducible if for each pair there is an integer with . 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 has eigenvalues .
A square nonnegative matrix is primitive if some positive integer power 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.
The strictly positive case states that a real square matrix with has a positive simple eigenvalue and positive left and right eigenvectors, with all other eigenvalues strictly smaller in modulus. The Brouwer fixed-point theorem applied to on the nonnegative unit simplex gives and . For another eigenvector , maximize ; the triangle inequality gives . Equality forces every modulus ratio and complex argument to agree because every entry is positive, so is proportional to and . Apply the same argument to for a positive left eigenvector; its positive pairing with rules out a generalized eigenvector at , establishing algebraic simplicity. For merely nonnegative matrices a nonnegative leading eigenvector exists. An irreducible nonnegative matrix has a positive leading eigenvector and simple Perron eigenvalue; a primitive nonnegative matrix has the strict modulus gap.

Articles by others on the same topic (1)

A nonnegative matrix is a type of matrix in which all the elements are greater than or equal to zero.