Exercise 14.3.9

Let G be a group of order n . In Section 7.4 we constructed a subgroup H S n isomorphic to G . Prove that H is regular in S n .

Answers

Proof. Recall the construction of G H S n (see ex. 7.4.4, 7.4.6).

Let f : { 1 , , n } G be a bijection, and write g i = f ( i ) , so that G = { g 1 , , g n } .

For each i { 1 , , n } there is some permutation σ i such that

g i g j = g σ i ( j ) .

Consider the maps

{ 1 , , n } f G ϕ G = { ϕ g g G } ψ H i g = g i σ = ϕ g { G G h gh f 1 ϕ g f ,

where G = { ϕ g g G } S ( G ) , H S n , and G H . Here f , ϕ , ψ are bijective, and ϕ , ψ are group isomorphisms (Ex .7.4.4).

Note that, as already seen in ex. 7.4.4, for all j { 1 , , n } ,

( f 1 ϕ g i f ) ( j ) = ( f 1 ϕ g i ) ( g j ) = f 1 ( g i g j ) = f 1 ( g σ i ( j ) ) = σ i ( j ) ,

thus

σ i = f 1 ϕ g i f ,

and H = { σ 1 , , σ n } .

Write δ = ψ ϕ f , so that δ ( i ) = ( ψ ϕ f ) ( i ) = f 1 ϕ g i f , i = 1 , , n .

We define γ = δ 1 , thus for all i { 1 , , n } ,

γ ( f 1 ϕ g i f ) = i .

Here T = { 1 , , n } , since H S ( { 1 , , n } ) . Then γ : G T induces an isomorphism γ ^ : S ( G ) S ( T ) = S n defined by

γ ^ ( σ ) = γ σ γ 1 .

Now we compute γ ^ ( φ h ) , where h H is a permutation, and φ h ( k ) = hk = h k , k H . Since h H , there is some i { 1 , , n } such that h = f 1 ϕ g i f = σ i .

For all j { 1 , , n } ,

γ ^ ( φ h ) ( j ) = ( γ φ h γ 1 ) ( j ) = ( γ φ h ) ( f 1 ϕ g j f ) = γ ( h f 1 ϕ g j f ) = γ ( f 1 ϕ g i f f 1 ϕ g j f ) = γ ( f 1 ϕ g i ϕ g j f ) = γ ( f 1 ϕ g i g j f ) = γ ( f 1 ϕ g σ i ( j ) f ) = σ i ( j ) .

Therefore γ ^ ( φ h ) = σ i = h H .

We have proved that the isomorphism γ ^ takes { φ h h H } in H , and since these two subgroups have same order n ,

γ ^ ( { φ h h H } ) = H .

The definition of a regular subgroup of S ( T ) is satisfied, so H is a regular subgroup of S n . □

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