Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 3.5.14 ($A_4 = \langle \sigma, \tau \rangle $, where $|\sigma| = 3$, $|\tau| = 2$.)

Exercise 3.5.14 ($A_4 = \langle \sigma, \tau \rangle $, where $|\sigma| = 3$, $|\tau| = 2$.)

Prove that the subgroup of A 4 generated by any element of order 2 and any element of order 3 is all of A 4 .

Answers

First solution (short solution)

Proof. Let H = σ , τ , where | σ | = 2 and | τ | = 2 .

Let n = | H | . By Lagrange’s Theorem, n 12 = | A 4 | , and

2 n and 3 n .

Therefore 6 n , and n 12 , so

n = 6 or n = 12 .

But we know that A 4 has no subgroup of order 6 (see Exercise 6). Therefore n = 12 , so | H | = | A 4 | , where H A 4 . This proves H = A 4 :

4 = σ , τ ( | σ | = 3 , | τ | = 2 ) .

Second solution (constructive solution)

Proof. First we show that

A 4 = ( 1 2 3 ) , ( 1 2 ) ( 3 4 ) . (1)

Set H = ( 1 2 3 ) , ( 1 2 ) ( 3 4 ) . Then ( 1 3 2 ) = ( 1 2 3 ) 1 H , so

( 1 2 3 ) [ ( 1 2 ) ( 3 4 ) ] ( 1 2 3 ) 1 = ( 2 3 ) ( 1 4 ) H , ( 1 3 2 ) [ ( 1 2 ) ( 3 4 ) ] ( 1 3 2 ) 1 = ( 3 1 ) ( 2 4 ) H

(see the Lemma of Exercise 3.5.4).

Therefore

( 1 2 ) ( 3 4 ) , ( 1 3 ) ( 2 4 ) H , ( 1 2 3 ) H .

The lattice of subgroups of A 4 given in the text shows that the only subgroup containing ( 1 2 ) ( 3 4 ) , ( 1 3 ) ( 2 4 ) and ( 1 2 3 ) is A 4 . So (1) is proven.

Now take any element σ A 4 of order 3 , and any element τ A 4 of order 2 . Then σ = ( a b c ) , where { a , b , c } { 1 , 2 , 3 , 4 } , and τ is the product of two disjoint transpositions, hence the support of one of them is included in { a , b , c } . So we can write without loss of generality τ = ( a b ) ( c d ) , where a , b , c , d are distinct, so { a , b , c , d } = { 1 , 2 , 3 , 4 } .

Consider le permutation

α = ( 1 2 3 4 a b c d ) S 4 .

By the Lemma of Exercise 3.5.3,

α ( 1 2 ) ( 3 4 ) α 1 = ( a b ) ( c d ) = τ , α ( 1 2 3 ) α 1 = ( a b c ) = σ .

Let f be the map defined by γ α ( δ ) = α δ α 1 for every permutation δ A 4 (then α δ α 1 is even). Then f is an automorphism of A 4 (but not necessarily an inner automorphism).

Let ξ by any permutation in S n . Since f is an automorphism, there is some permutation ζ A 4 such that ξ = 𝛼𝜁 α 1 = f ( ζ ) . Since A 4 = ( 1 2 3 ) , ( 1 2 ) ( 3 4 ) , by Proposition 9,

ζ = σ 1 𝜀 1 σ 2 𝜀 2 σ k 𝜀 k ,

where 𝜀 i { 1 , 1 } and σ i { ( 1 2 3 ) , ( 1 2 ) ( 3 4 ) } for i [ [ 1 , k ] ] . Therefore

ξ = f ( ζ ) = f ( σ 1 𝜀 1 σ 2 𝜀 2 σ k 𝜀 k ) = τ 1 𝜀 1 τ 2 𝜀 2 τ 1 𝜀 k ,

where τ i = f ( σ i ) { σ , τ } . This shows that

A 4 = σ , τ .

A 4 is generated by σ , τ , where τ is any element of order 2 and σ is any element of order 3 . □

User profile picture
2025-12-22 09:45
Comments