Permutation Matrix¶
Definition¶
A permutation matrix is a square matrix with exactly one entry equal to in each row and each column, and all other entries equal to .
Interpretation¶
A permutation matrix reorders: multiplying by it permutes the entries of a vector, or the rows or columns of a matrix, without changing any value. It is the identity matrix with its rows put in a different order.
Row of the figure's has its in column , so the first entry of is ; rows , and pick , and . Row says which entry of is copied into position , and column says where goes: column has its in row , so moves to position .
The matrix product applies the same reordering to the rows of , and reorders its columns. A reordering is undone by the transpose: , so the inverse is . The determinant is when the reordering can be made with an even number of swaps and otherwise; the figure's is three swaps, so its determinant is .
The permutation matrices correspond to the elements of the symmetric group . Swapping two rows, an elementary row operation, is multiplication on the left by a permutation matrix; the LU decomposition records its row swaps this way.
A common slip is to take . This holds for a single swap such as , but applying the figure's twice gives , not .
Key Results¶
- The identity matrix is a permutation matrix.
- The product of two permutation matrices is a permutation matrix.
Examples¶
- swaps two rows when multiplied on the left.
- represents the permutation that changes nothing.
Prerequisites¶
Related Concepts¶
Sources¶
- Math II: Linear Algebra · Week 5
Last updated: 20 October 2026 03:02
Permutation MatrixLU DecompositionMatrixSymmetric GroupMatrix ProductDeterminantIdentity MatrixPermutation