Exercise 14.2.7

Let A G be as in Exercise 6, and let H be the set of all functions

ϕ : { 1 , , n } G .

(a)
Given ϕ , χ H , define ϕχ H by ( ϕχ ) ( i ) = ϕ ( i ) χ ( i ) . Prove that this makes H into a group isomorphic to the product group G n .
(b)
Elements of A G can be written ( τ , ϕ ) , where ϕ H . Prove that in this notation, (14.7) becomes ( τ , ϕ ) ( τ , ϕ ) = ( τ τ , ( ( τ ) 1 φ ) ϕ ) .

(c)
A S n acts on { 1 , , n } . Show that this induces an action of A on H via ( τ ϕ ) ( i ) = ϕ ( τ 1 ( i ) ) . Be sure you understand why the inverse is necessary.
(d)
The action of part (c) enable us to define the semidirect product H A . Using the description of A G given in part (b), prove that the map ( τ , ϕ ) ( τ ϕ , τ )

defines a group isomorphism A G H A . This shows that wreath products can be represented as semidirect products.

Answers

Proof.

(a)
Consider the two maps φ { H G n ϕ ( ϕ ( 1 ) , , ϕ ( n ) ) , ψ { G n H ( x 1 , , x n ) ξ { { 1 , , n } G i x i .

Then ψ φ = 1 H and φ ψ = 1 G n , therefore φ is bijective.

Moreover, for all ( ϕ , χ ) H ,

φ ( ϕχ ) = ( ( ϕχ ) ( 1 ) , , ( ϕχ ) ( n ) ) = ( ϕ ( 1 ) χ ( 1 ) , , ϕ ( n ) χ ( n ) ) = ( ϕ ( 1 ) , , ϕ ( n ) ) ( χ ( 1 ) , , χ ( n ) ) = φ ( ϕ ) φ ( χ ) ) .

Therefore H G n via φ .

(b,c)
If we define ϕ τ , for τ S n and ϕ H , by ( ϕ τ ) ( i ) = ϕ ( τ ( i ) ) , i = 1 , , n , we obtain a right action: if τ , τ S n , for all i { 1 , , n } , ( ( ϕ τ ) τ ) ( i ) = ( ϕ τ ) ( τ ( i ) ) = ϕ ( τ ( τ ( i ) ) ) = ϕ ( ( τ τ ) ( i ) ) = ϕ τ τ ( i ) ) ,

thus ( ϕ τ ) τ = ϕ τ τ . To obtain a left action, we must define, as in part (c),

( τ ϕ ) ( i ) = ϕ ( τ 1 ( i ) ) , i = 1 , , n .

Then

( τ ( τ ϕ ) ) ( i ) = ( τ ϕ ) ( τ 1 ( i ) ) = ϕ ( τ 1 ( τ 1 ( i ) ) ) = ϕ ( τ τ ) 1 ( i ) = ( ( τ τ ) ϕ ) ( i ) ,

so that τ ( τ ϕ ) = ( τ τ ) ϕ ) (and e τ = τ ).

This is a proof of part (c), and this explains the recurrent and stressful injonction from D.A.Cox “Be sure you understand why the inverse is necessary”.

Using this action for part (b), we define ( τ , ϕ ) for τ S n , ϕ H = G { 1 , , n } ,by

( τ , ϕ ) = ( τ ; ϕ ( 1 ) , , ϕ ( n ) ) ,

so that

( τ , ϕ ) = ( τ ; g 1 , , g n ) ϕ ( 1 ) = g 1 , , ϕ ( n ) = g n .

If ( τ , ϕ ) = ( τ ; g 1 , , g n ) , ( τ , ϕ ) = ( τ ; g 1 , , g n ) , then

( τ , ϕ ) ( τ , ϕ ) = ( τ ; g 1 , , g n ) ( τ ; g 1 , , g n ) = ( τ τ ; g τ ( 1 ) g 1 , , g τ ( n ) g n ) = ( τ τ ; ϕ ( τ ( 1 ) ) ϕ ( 1 ) , , ϕ ( τ ( n ) ) ϕ ( n ) ) = ( τ τ ; ( ( τ ) 1 ϕ ) ( 1 ) ϕ ( 1 ) , , ( ( τ ) 1 ϕ ) ( n ) ϕ ( n ) ) = ( τ τ , ( ( τ ) 1 ϕ ) ϕ ) .
(d)
Consider the map φ { A G H A ( τ , ϕ ) ( τ ϕ , τ ) .

If ψ : H A A G is defined by ψ ( χ , τ ) = ( τ , τ 1 χ ) , then, for all τ S n , ϕ , χ H ,

( ψ φ ) ( τ , ϕ ) = ψ ( τ ϕ , τ ) = ( τ , τ 1 ( τ ϕ ) = ( τ , ϕ ) , ( φ ψ ) ( χ , τ ) = φ ( τ , τ 1 χ ) = ( τ ( τ 1 χ ) , τ ) = ( χ , τ ) .

Thus ψ φ = 1 A G , φ ψ = 1 H A . This proves that φ is bijective.

Recall that the binary operation in H A is defined by (6.9):

( ϕ , τ ) ( ϕ , τ ) = ( ϕ ( τ ϕ ) , τ τ ) .

We verify that φ is a group homomorphism. Note first that, for τ S n , ϕχ H ,

τ ( ϕχ ) = ( τ ϕ ) ( τ χ ) .

Indeed, for all i { 1 , , n } ,

( τ ( ϕχ ) ) ( i ) = ( ϕχ ) ( τ 1 ( i ) ) = ϕ ( τ 1 ( i ) ) χ ( τ 1 ( i ) ) = ( τ ϕ ) ( i ) ( τ χ ) ( i ) = ( ( τ ϕ ) ( τ χ ) ) ( i ) .

Using this rule, we obtain

φ ( ( τ , ϕ ) ( τ , ϕ ) ) = φ ( τ τ ; ( ( τ ) 1 ϕ ) ϕ ) = ( ( τ τ ) ( ( τ ) 1 ϕ ) ϕ ) , τ τ ) = ( ( τ τ ) ( ( τ ) 1 ϕ ) ( ( τ τ ) ϕ ) , τ τ ) = ( ( τ ϕ ) ( ( τ τ ) ϕ ) , τ τ ) ,

and using the binary operation in H A ,

φ ( τ , ϕ ) φ ( τ , ϕ ) = ( τ ϕ , τ ) ( ( τ ϕ , τ ) = ( ( τ ϕ ) ( τ ( τ ϕ ) ) , τ τ ) = ( ( τ ϕ ) ( ( τ τ ) ϕ ) , τ τ ) ,

thus φ ( ( τ , ϕ ) ( τ , ϕ ) ) = φ ( τ , ϕ ) φ ( τ , ϕ ) . We have proved that φ is a group isomorphism, so

A G H A = G { 1 , , n } A .

Wreath products can be represented by semidirect products.

User profile picture
2022-07-19 00:00
Comments