Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 3.2.2 (Lattice of subgroups of $S_3$)

Exercise 3.2.2 (Lattice of subgroups of $S_3$)

Prove that the lattice of subgroups of S 3 in Section 2.5 is correct (i.e., prove that it contains all subgroups of S 3 and that their pairwise joins and intersections are correctly drawn).

Answers

Proof. We must justify the following lattice:

The order of the elements of S 3 are

σ | σ | ( ) 1 ( 1 2 ) 2 ( 1 3 ) 2 ( 2 3 ) 2 ( 1 2 3 ) 3 ( 1 3 2 ) 3

By Lagrange’s Theorem, a proper non trivial subgroup of S 3 has order 2 or 3 . Since 2 and 3 are prime numbers, such a subgroup is cyclic. So a subgroup of order 2 is generated by one of the three elements of order 2 , and these subgroups are distinct.

A subgroup of order 3 is generated by a 3 -cycle. Since ( 1 3 2 ) = ( 1 2 3 ) 1 , there is only one subgroup of order 3 , which is ( 1 2 3 ) . Therefore there is no subgroup other than the 6 subgroups of the preceding lattice.

Since a subgroup of order 2 cannot be a subgroup of ( 1 2 3 ) of order 3 , there are no other inclusion than those given, so the lattice is complete. □

User profile picture
2025-12-06 12:12
Comments