reducible matrix
An matrix is said to be a reducible matrix if and only if for some permutation matrix
, the matrix is block upper triangular.If a square matrix
is not reducible, it is said to be an irreducible matrix.
The following conditions on an matrix are equivalent.
- 1.
is an irreducible matrix.
- 2.
The digraph
associated to is strongly connected.
- 3.
For each and , there exists some such that .
- 4.
For any partition
of the index set
, there exist and such that .
For certain applications, irreducible matrices are more useful than reducible matrices. In particular, the Perron-Frobenius theorem gives more information about the spectra of irreducible matrices than of reducible matrices.