Skip to main content
Logo image

Abstract Algebra: Theory and Applications

Thomas W. Judson

🔗

Section 5.2 Dihedral Groups

🔗
Another special type of permutation group is the dihedral group. Recall the symmetry group of an equilateral triangle in Chapter 3. Such groups consist of the rigid motions of a regular n-sided polygon or n-gon. For n=3,4,…, we define the nth dihedral group to be the group of rigid motions of a regular n-gon. We will denote this group by Dn. We can number the vertices of a regular n-gon by 1,2,…,n (Figure 5.19). Notice that there are exactly n choices to replace the first vertex. If we replace the first vertex by k, then the second vertex must be replaced either by vertex k+1 or by vertex k−1; hence, there are 2n possible rigid motions of the n-gon. We summarize these results in the following theorem.
An n-gon with vertex 1 at the top, followed by 2, 3, 4, ..., n - 1, n.
🔗
Figure 5.19. A regular n-gon

Proof.

The possible motions of a regular n-gon are either reflections or rotations (Figure 5.22). There are exactly n possible rotations:
id,360∘n,2⋅360∘n,…,(n−1)⋅360∘n.
We will denote the rotation 360∘/n by r. The rotation r generates all of the other rotations. That is,
rk=k⋅360∘n.
Rotations and reflections of an octagon. Where the top octagon (1 (top), 2, 3, 4, 5, 6, 7, 8) is rotated to an octagon (2 (top), 3, 4, 5, 6, 7, 8, 1), and the octagon below (1 (top), 2, 3, 4, 5, 6, 7, 8) is reflected about a vertical axis to (1 (top), 8, 7, 6, 5, 4, 3, 2).
Figure 5.22. Rotations and reflections of a regular n-gon
Label the n reflections s1,s2,…,sn, where sk is the reflection that leaves vertex k fixed. There are two cases of reflections, depending on whether n is even or odd. If there are an even number of vertices, then two vertices are left fixed by a reflection, and s1=sn/2+1,s2=sn/2+2,…,sn/2=sn. If there are an odd number of vertices, then only a single vertex is left fixed by a reflection and s1,s2,…,sn are distinct (Figure 5.23). In either case, the order of each sk is two. Let s=s1. Then s2=1 and rn=1. Since any rigid motion t of the n-gon replaces the first vertex by the vertex k, the second vertex must be replaced by either k+1 or by k−1. If the second vertex is replaced by k+1, then t=rk. If the second vertex is replaced by k−1, then t=rks.
 5 
Since we are in an abstract group, we will adopt the convention that group elements are multiplied left to right.
Hence, r and s generate Dn. That is, Dn consists of all finite products of r and s,
Dn={1,r,r2,…,rn−1,s,rs,r2s,…,rn−1s}.
We will leave the proof that srs=r−1 as an exercise.
The top hexagon (1 (top), 2, 3, 4, 5, 6) is relected to (1 (top), 6, 5, 4, 3,. 2). The bottom pentqgon (1 (top), 2, 3, 4, 5) is relected to become (1 (top), 5, 4, 3, 2).
Figure 5.23. Types of reflections of a regular n-gon
🔗

Example 5.24.

🔗
🔗
The group of rigid motions of a square, D4, consists of eight elements. With the vertices numbered 1, 2, 3, 4 (Figure 5.25), the rotations are
r=(1234)r2=(13)(24)r3=(1432)r4=(1)
🔗
and the reflections are
s1=(24)s2=(13).
🔗
The order of D4 is 8. The remaining two elements are
rs1=(12)(34)r3s1=(14)(23).
A square with diagonal lines of symmetries connecting opposite vertices, a horizontal line of symmetry that bisects the two vertical sides of the square and a vertical line of symmetry that bisects the two horizaontal sides of the square.
Figure 5.25. The group D4
🔗

Subsection The Motion Group of a Cube

🔗
We can investigate the groups of rigid motions of geometric objects other than a regular n-sided polygon to obtain interesting examples of permutation groups. Let us consider the group of rigid motions of a cube. By rigid motion, we mean a rotation with the axis of rotation about opposing faces, edges, or vertices. One of the first questions that we can ask about this group is “what is its order?” A cube has 6 sides. If a particular side is facing upward, then there are four possible rotations of the cube that will preserve the upward-facing side. Hence, the order of the group is 6⋅4=24. We have just proved the following proposition.

Proof.

From Proposition 5.26, we already know that the motion group of the cube has 24 elements, the same number of elements as there are in S4. There are exactly four diagonals in the cube. If we label these diagonals 1, 2, 3, and 4, we must show that the motion group of the cube will give us any permutation of the diagonals (Figure 5.28). If we can obtain all of these permutations, then S4 and the group of rigid motions of the cube must be the same. To obtain a transposition we can rotate the cube 180∘ about the axis joining the midpoints of opposite edges (Figure 5.29). There are six such axes, giving all transpositions in S4. Since every element in S4 is the product of a finite number of transpositions, the motion group of a cube must be S4.
A cube where the top vetices are labled 1, 2, 3, 4 and the bottom vertices are labled 3, 4, 1, 2. Diagonals connect vertex 1 on the top with vertex 1 on the bottom, vertex 2 on the top with vertex 2 on the bottom, vertex 3 on the top with vertex 3 on the bottom, and vertex 4 on the top with vertex 4 on the bottom,
Figure 5.28. The motion group of a cube
The top vertices of the left cube are labeled 1, 2, 3, 4 and the bottom vertices are labled 3, 4, 1, 2. Lines of symmetry connect the 12 edge on top with the 12 edge on the bottom.
The top vertices of the right cube are labeled 2, 1, 3, 4 and the bottom vertices are labeled 3, 4, 2, 1. Lines of symmetry connect the 12 edge on top with the 12 edge on the bottom.
Figure 5.29. Transpositions in the motion group of a cube
PrevTopNext