Review exercise 1.20. The set of by permutation matrices constitute a group.
(a) How many 4 by 4 permutation matrices are there? How many by permutation matrices are there?
(b) For the group of 3 by 3 permutation matrices, what does have to be in order for for all matrices P in the group?
Answer: (a) A permutation matrix has a single 1 entry in each row (with all the other entries in that row being zero) and each row must have that single 1 entry in a different column.
If we construct a 4 by 4 permutation matrix, we have 4 choices for the column in which the 1 entry can be in the first row. Having chosen that column, we have only 3 choices for the column having the 1 entry in the second row (because we cannot choose the same column as in the first row). Having chosen the columns in which the 1 entry is placed in rows 1 and 2, we then have only 2 choices for the column in row 3, and then only 1 choice for the column in row 4 (all the other columns already having been used). The number of possible 4 by 4 permutation matrices is therefore .
Similarly, for the group of by permutation matrices we have choices for where to put the 1 entry in row 1, choices for where to put the 1 entry in row 2, choices for where to put the 1 entry in row 3, and so on until we have only 1 choice for where to put the 1 entry in row . The number of possible by permutation matrices is therefore .
(b) There are or six 3 by 3 permutation matrices, of which one is the identity matrix for which for any .
Of the remaining five 3 by 3 permutation matrices, three do simple row exchanges:
- exchange row 1 and row 2
- exchange row 1 and row 3
- exchange row 2 and row 3
For each of these matrices repeating the operation reverses the effect of the exchange, so we have . We then also have and in general for any even .
The remaining two 3 by 3 permutation matrices do forward and reverse shifts of rows:
- move row 1 to row 2, row 2 to row 3, and row 3 to row 1
- move row 1 to row 3, row 2 to row 1, and row 3 to row 2
Applying each of these permutation matrices three times shifts all rows back into their original places, so we have . We then have , and in general for any that is a multiple of 3.
Combining the results above, we see that is the smallest for which for all 3 by 3 permutation matrixes .
NOTE: This continues a series of posts containing worked out exercises from the (out of print) book Linear Algebra and Its Applications, Third Edition by Gilbert Strang.
If you find these posts useful I encourage you to also check out the more current Linear Algebra and Its Applications, Fourth Edition, Dr Strang’s introductory textbook Introduction to Linear Algebra, Fourth Edition and the accompanying free online course, and Dr Strang’s other books.