Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 1.7.10 (For which values of $k$ are these actions faithful?)

Exercise 1.7.10 (For which values of $k$ are these actions faithful?)

With reference to the preceding two exercises determine

(a)
for which values of k the action of S n on k -elements subsets is faithful, and
(b)
for which values of k the action of S n on ordered k -tuples is faithful.

Answers

Proof. Let 𝒫 k ( A ) denote the set of all subsets of A of cardinality k .

(a)
In this part, S A acts on 𝒫 k ( A ) by σ { a 1 , a 2 , , a k } = { σ ( a 1 ) , σ ( a 2 ) , , σ ( a k ) } , where 1 k n .

(For clarity, I explain the method in the case k = 3 and A = { 1 , 2 , 3 , 4 , 5 } . Suppose that σ is an element of the kernel of the action. Then σ X = X for all X 𝒫 3 ( [ [ 1 , 5 ] ] ) . Since σ is injective,

σ ( 1 ) { σ ( 2 ) , σ ( 3 ) , σ ( 4 ) } = { 2 , 3 , 4 } σ ( 1 ) { σ ( 3 ) , σ ( 4 ) , σ ( 5 ) } = { 3 , 4 , 5 } ,

therefore σ ( 1 ) { 2 , 3 , 4 , 5 } so σ ( 1 ) = 1 , and similarly σ ( a ) = a for all a A , thus σ = Id A , so the kernel of the action is { Id A } and the action is faithful.)

We prove the generalization:

  • If k = n , then 𝒫 k ( A ) = 𝒫 n ( A ) = { A } . Therefore every σ S A satisfies σ A = A , so the kernel of the action is S A , and the action is not faithful.
  • Suppose now that 1 k < n . Let σ be in the kernel of the action, so that for all X 𝒫 k ( A ) , σ X = X . Let a be any element of A , and let b a be any other element. Since k < n , there is some subset X 𝒫 k ( A ) such that b X but a X (to obtain X , we take X = Y { b } , where Y 𝒫 k 1 ( A { a , b } ) : this is possible because k 1 n 2 so that 𝒫 k 1 ( A { a , b } ) is not empty).

    Since a X , σ ( a ) σ X = X , therefore σ ( a ) b . This is true for for every b A such that b a , therefore σ ( a ) = a , where a is an arbitrary element of A , so σ = Id A . This shows that the kernel of the action is { Id A } , so the action is faithful.

In conclusion, the values of k [ [ 1 , n ] ] such that the action of S n on 𝒫 k ( A ) is faithful are 1 , 2 , n 1 , but not n .

(b)
In part (b), S A acts on A k by σ ( a 1 , a 2 , , a k ) = ( σ ( a 1 ) , σ ( a 2 ) , , σ ( a k ) ) , where k , k 1 . Let σ S A be some permutation in the kernel of this action. Then for all X A k , σ X = X . In particular, if X = ( a , a , , a ) A k , then ( σ ( a ) , σ ( a ) , , σ ( a ) ) = ( a , a , , a ) , so σ ( a ) = a for every a A and σ = Id A . This shows that the kernel of this action is { Id A } thus the action is faithful for every n + .
User profile picture
2025-10-04 16:03
Comments