Homepage › Solution manuals › David S. Dummit › Abstract Algebra › Problem 5.1.9 (Permutation matrices)

Problem 5.1.9 (Permutation matrices)

Let G i be a field F for all i and use the preceding exercise to show that the set of n × n matrices with one 1 in each row and each column is a subgroup of GL n ( F ) isomorphic to S n (these matrices are called permutation matrices since they simply permute the standard basis e 1 , … , e n (as above) of the n -dimensional vector space F × F × ⋯ × F ).

Answers

Proof. Here G = F n . By Exercises 7 and 8, if χ is defined by

χ { S n → Aut ( G ) π ↦ φ π ,

where

φ π { F n → F n ( g 1 , g 2 , … , g n ) ↦ ( g π − 1 ( 1 ) , g π − 1 ( 2 ) , … , g π − 1 ( n ) ) ,

then χ is a homomorphism. In other words, S n acts on G = F n for the action defined by

π ⋅ ( g 1 , g 2 , … , g n ) = ( g π − 1 ( 1 ) , g π − 1 ( 2 ) , … , g π − 1 ( n ) ) . (1)

If B = ( e i ) 1 ≤ i ≤ n is the natural basis of F n , then e i = ( δ 1 , i , δ 2 , i , … , δ n , i ) , where δ i , j is the Kronecker’s symbol defined by

δ i , j = { 1 if  i = j , 0 if  i ≠ j .

Then

π ⋅ e i = π ⋅ ( δ 1 , i , δ 2 , i … , δ n , i ) = ( δ π − 1 ( 1 ) , i , δ π − 1 ( 2 ) , i , … , δ π − 1 ( n ) , i ) = ( h 1 , h 2 , … , h n ) ,

where

h j = δ π − 1 ( j ) , i = 1 ⟺ i = π − 1 ( j ) ⟺ j = π ( i ) ,

and h j = 0 otherwise. Therefore

π ⋅ e i = e π ( i ) . (2)

Then (1) can be rewritten as

π ⋅ ( g 1 e 1 + g 2 e 2 + ⋯ + g n e n ) = g π − 1 ( 1 ) e 1 + g π − 1 ( 2 ) e 2 + ⋯ + g π − 1 ( n ) e n = g 1 e π ( 1 ) + g 2 e π ( 2 ) + ⋯ + g n e π ( n ) = g 1 π ⋅ e 1 + g 2 π ⋅ e 2 + ⋯ g n π ⋅ e n .

This means that

φ π ( g 1 e 1 + g 2 e 2 + ⋯ + g n e n ) = g 1 π ⋅ e 1 + g 2 π ⋅ e 2 + ⋯ g n π ⋅ e n ,

thus φ π is linear. Since

φ π ( e j ) = e π ( j ) = ∑ i = 1 n δ i , π ( j ) e i

for all j ∈ [ [ 1 , n ] ] , its matrix relative to B is

ℳ B ( φ π ) = ( δ i , π ( j ) ) ( i , j ) ∈ [ [ 1 , n ] ] 2 = ( δ 1 , π ( 1 ) δ 1 , π ( 2 ) ⋯ δ n , π ( 1 ) δ 2 , π ( 1 ) δ 2 , π ( 2 ) ⋯ δ 2 , π ( 1 ) ⋮ δ n , π ( 1 ) δ n , π ( 2 ) ⋯ δ n , π ( 1 ) )

For all π ∈ S n φ π ∈ GL ( F n ) (the group of linear automorphisms of F n ), we obtain a homomorphism of S n to GL n ( F ) by composing the two homomorphisms

λ { S n → GL ( F n ) → GL n ( F ) π ↦ φ π ↦ ℳ B ( φ π ) = ( δ i , π ( j ) ) ( i , j ) ∈ [ [ 1 , n ] ] 2

Moreover, if λ ( π ) = ( δ i , π ( j ) ) ( i , j ) ∈ [ [ 1 , n ] ] 2 = I , then δ i , π ( j ) = δ i , j for all i , j , thus π ( j ) = j for all j , and so π = id S n = ( ) . This shows that λ is injective. Therefore S n is isomorphic to the subgroup im ( λ ) of GL n ( F ) .

Since ( δ i , π ( j ) ) ( i , j ) ∈ [ [ 1 , n ] ] 2 is a permutation matrix for every π ∈ S n , the image of λ is contained in the set P of permutations matrices. Since | S n | = | P | = n ! , we obtain im ( λ ) = P .

In conclusion, S n is isomorphic to the group of permutation matrices P = im ( λ ) . □

User profile picture
2026-09-05 12:14
Comments