1.7: Permutation Matrices
( \newcommand{\kernel}{\mathrm{null}\,}\)
View Permutation Matrices on YouTube
A permutation matrix is another type of orthogonal matrix. When multiplied on the left, an n-by-n permutation matrix reorders the rows of an n-by-n matrix, and when multiplied on the right, reorders the columns. For example, let the string 12 represent the order of the rows (columns) of a two-by-two matrix. Then the permutations of the rows (columns) are given by 12 and 21. The first permutation is no permutation at all, and the corresponding permutation matrix is simply the identity matrix. The second permutation of the rows (columns) is achieved by
(0110)(abcd)=(cdab),(abcd)(0110)=(badc).
The rows (columns) of a 3-by-3 matrix has 3!=6 possible permutations, namely 123,132,213,231,312,321. For example, the row permutation 312 is obtained by
(001100010)(abcdefghi)=(ghiabcdef).
Evidently, the permutation matrix is obtained by permutating the corresponding rows of the identity matrix. Because the columns and rows of the identity matrix are orthonormal, the permutation matrix is an orthogonal matrix.