Homepage › Solution manuals › David S. Dummit › Abstract Algebra › Problem 5.1.9 (Permutation matrices)
Problem 5.1.9 (Permutation matrices)
Let be a field for all and use the preceding exercise to show that the set of matrices with one in each row and each column is a subgroup of isomorphic to (these matrices are called permutation matrices since they simply permute the standard basis (as above) of the -dimensional vector space ).
Answers
Proof. Here . By Exercises 7 and 8, if is defined by
where
then is a homomorphism. In other words, acts on for the action defined by
If is the natural basis of , then , where is the Kronecker’s symbol defined by
Then
where
and otherwise. Therefore
Then (1) can be rewritten as
This means that
thus is linear. Since
for all , its matrix relative to is
For all (the group of linear automorphisms of ), we obtain a homomorphism of to by composing the two homomorphisms
Moreover, if , then for all , thus for all , and so . This shows that is injective. Therefore is isomorphic to the subgroup of .
Since is a permutation matrix for every , the image of is contained in the set of permutations matrices. Since , we obtain .
In conclusion, is isomorphic to the group of permutation matrices . □