Generalized permutation matrix: Difference between revisions

Content deleted Content added
m rm unfinished sentence
add the deleted sentence back with a better wording.
Line 4:
:<math>\begin{bmatrix}0 & 0 & 3 & 0\\ 0 & -2 & 0 & 0\\
1 & 0 & 0 & 0\\ 0 & 0 & 0 & 1 \end{bmatrix}</math>
 
An interesting theorem states the following:
: If a nonsingular matrix and its inverse are both nonnegative matrices (i.e. matrices with nonnegative entries), then the matrix is a generalized permutation matrix.