Dihedral groups
A square can be turned or flipped onto itself in eight ways. How many symmetries does a regular polygon with n sides have, how do two of them combine, and why does the order of the two moves matter?
Where you are 6 in Groups
Why this exists
The symmetries of a rectangle form an abelian group of order 4 (Integers mod n, symmetries and matrices as groups, Example 3). Make it a square and the count doubles to eight, and order starts to matter: a quarter turn then a flip is not a flip then a quarter turn. Every regular polygon gives such a group, built from one rotation and one reflection: the standard non-abelian example for the course.
Definition
Identify the plane with \mathbb{C} (Complex numbers), with center O = 0. Fix n \ge 3 and let \displaystyle \omega = \operatorname{cis}\frac{2\pi}{n} = e^{2\pi i/n} (Roots of a complex number and roots of unity). The regular n-gon has vertices v_j = \omega^{j - 1} for j = 1, \dots, n, the nth roots of unity, numbered counterclockwise from v_1 = 1. Indices are read mod n, so v_{n + 1} = v_1 and v_0 = v_n. Let V_n = \{v_1, \dots, v_n\}.
The dihedral group D_n is the symmetry group \mathcal{S}(V_n): all bijective isometries f of the plane with f(V_n) = V_n, under composition (Integers mod n, symmetries and matrices as groups, Theorem 4). Two of its elements are
the counterclockwise rotation about O through \displaystyle \frac{2\pi}{n} (Rotational and point symmetry) and the reflection in the real axis, the line through O and v_1 (Line symmetry). The elements r^k are the rotations and the elements r^k s the reflections of D_n. By Theorem 1 the group has order 2n; some books, Dummit and Foote among them, write D_{2n} for it.
Each element of D_n is real linear (Theorem 1), so it maps the filled polygon onto itself; conversely a symmetry of the filled polygon permutes its corners, as in Example 3 of Integers mod n, symmetries and matrices as groups. So D_n is also the symmetry group of the polygon.
Intuition
A symmetry keeps distances, so it sends neighboring vertices to neighboring vertices: v_1 can go to any of n vertices, then v_2 to either neighbor of that image, 2n choices in all.
The n axes cut the polygon into 2n triangles, one for each element.
The rule srs = r^{-1} says a mirror reverses the sense of turning: flip, turn counterclockwise, flip back, and the net effect is a clockwise turn. Two reflections in axes at angle \displaystyle \frac{\pi}{n} compose to a turn through \displaystyle \frac{2\pi}{n} (Two reflections in a row): (rs)s = r.
Results
Theorem 1 (the elements). Let n \ge 3. Then |D_n| = 2n and
these 2n elements being distinct. For 0 \le k < n, r^k(z) = \omega^k z is the rotation about O through \displaystyle \frac{2\pi k}{n}, and r^k s(z) = \omega^k \bar z is the reflection in the line through O at angle \displaystyle \frac{\pi k}{n}.
Theorem 2 (the rule for products). \operatorname{ord}(r) = n, s^2 = e, srs = r^{-1}, and sr^k = r^{-k}s for every integer k. Hence, with exponents read mod n,
So every reflection is its own inverse, and D_n is not abelian.
Theorem 3 (vertices and permutations). r^k(v_j) = v_{j + k} and r^k s(v_j) = v_{k + 2 - j}. Writing f(v_j) = v_{\pi_f(j)}, the map f \mapsto \pi_f from D_n to S_n is injective with \pi_{fg} = \pi_f \pi_g, and its image is a subgroup of S_n of order 2n containing \pi_r = (1\ 2\ \cdots\ n) and \pi_s : j \mapsto 2 - j. The reflection r^k s fixes v_j if and only if 2(j - 1) \equiv k \pmod{n}. So for odd n each reflection fixes exactly one vertex. For even n, r^k s fixes two opposite vertices when k is even, and none when k is odd, its axis then passing through the midpoints of two opposite edges.
Theorem 4 (orders and center). \displaystyle \operatorname{ord}(r^k) = \frac{n}{\gcd(n, k)}, and every reflection has order 2. The center is Z(D_n) = \{e\} for odd n and Z(D_n) = \{e, r^{n/2}\} for even n.
Theorem 5 (recognizing a dihedral group). Let G be a group and a, b \in G with \operatorname{ord}(a) = n \ge 3, \operatorname{ord}(b) = 2, bab = a^{-1} and b \notin \langle a \rangle. Then \langle a, b \rangle, the smallest subgroup containing a and b (the intersection of all of them, Subgroups, Theorem 6), equals \{a^i, a^i b : 0 \le i < n\}, with 2n distinct elements, and the bijection f : D_n \to \langle a, b \rangle, f(r^i) = a^i, f(r^i s) = a^i b, has f(xy) = f(x)f(y) for all x, y: the same operation table after renaming, an isomorphism in the sense of Isomorphisms.
Why it is true
Proof of Theorem 1. Let |u| = 1. The maps z \mapsto uz and z \mapsto u\bar z are bijections (with inverses z \mapsto \bar u z and z \mapsto u\bar z) and keep distances, as |uz - uw| = |z - w| and |u\bar z - u\bar w| = |\overline{z - w}| = |z - w|. By induction r^k(z) = \omega^k z, so r^k s(z) = \omega^k \bar z. As \bar\omega = \omega^{-1}, r^k(v_j) = \omega^{j + k - 1} = v_{j + k} and r^k s(v_j) = \omega^{k - (j - 1)} = v_{k + 2 - j}. So the 2n maps lie in D_n. They are distinct: r^k sends the pair (v_1, v_2) to (v_{k + 1}, v_{k + 2}) and r^k s sends it to (v_{k + 1}, v_k), and v_{k + 2} \ne v_k as n \ge 3.
Now let f \in D_n. If j - i \equiv m \pmod{n}, then \displaystyle |v_j - v_i| = |\omega^m - 1| = 2\left|\sin\frac{\pi m}{n}\right|, and for 1 \le m \le n - 1 this is least exactly when m = 1 or m = n - 1, since \displaystyle \sin\frac{\pi m}{n} = \sin\frac{\pi (n - m)}{n} and sine increases on \displaystyle [0, \frac{\pi}{2}]. So the pairs of vertices at least distance are the neighbors v_i, v_{i \pm 1}, and f, which permutes V_n and keeps distances, maps neighbors to neighbors. If f(v_1) = v_{k + 1}, then f(v_2) is v_{k + 2} or v_k; let g be r^k or r^k s accordingly, so f and g agree at v_1 and v_2. The neighbors of v_2 are v_1 and v_3, so f(v_3) is the neighbor of f(v_2) other than f(v_1), and so is g(v_3). Three distinct points of a circle are not on one line, so f = g by Lemma 5 of Integers mod n, symmetries and matrices as groups. Hence |D_n| = 2n.
Finally write u = e^{2i\theta}. For z = e^{i\theta}w, u\bar z = e^{2i\theta}e^{-i\theta}\bar w = e^{i\theta}\bar w: in coordinates turned through \theta the map is w \mapsto \bar w, the reflection in the line through O at angle \theta. For u = \omega^k, \displaystyle \theta = \frac{\pi k}{n}. \square
Proof of Theorem 2. r^n(z) = \omega^n z = z, while r^k(1) = \omega^k \ne 1 for 0 < k < n; so \operatorname{ord}(r) = n. Next s^2(z) = \bar{\bar z} = z, and for every integer k, sr^ks(z) = \overline{\omega^k \bar z} = \bar\omega^k z = \omega^{-k}z = r^{-k}(z). Multiplying sr^ks = r^{-k} on the right by s gives sr^k = r^{-k}s. The four rules follow by associativity: (r^i s)r^j = r^i(sr^j) = r^{i - j}s and (r^i s)(r^j s) = r^{i - j}s^2 = r^{i - j}. Exponents are read mod n by Cyclic groups, Theorem 4(a), and i = j gives (r^i s)^2 = e. Finally sr = r^{-1}s \ne rs, as r^{-1} \ne r for n \ge 3. \square
Proof of Theorem 3. The formulas were found in the proof of Theorem 1. For f, g \in D_n, fg(v_j) = f(v_{\pi_g(j)}) = v_{\pi_f(\pi_g(j))}, so \pi_{fg} = \pi_f\pi_g. An element is fixed by its values at v_1, v_2, v_3 (Lemma 5 there), so f \mapsto \pi_f is injective. Its image is closed under products, as D_n is, and under inverses, as \pi_{f^{-1}}\pi_f = \pi_e = e; so it is a subgroup of order 2n (Subgroups, Theorem 2). Next, r^k s fixes v_j exactly when k + 2 - j \equiv j, that is, 2(j - 1) \equiv k \pmod{n}. For odd n, 2 has an inverse mod n (Modular inverses and linear congruences), so there is one solution. For even n a solution needs k even, and then \displaystyle j - 1 \equiv \frac{k}{2} \pmod{\frac{n}{2}} has two solutions j and \displaystyle j + \frac{n}{2}, with v_{j + n/2} = -v_j. For odd k the axis, at angle \displaystyle \frac{\pi k}{n}, bisects the directions of the neighbors v_{(k + 1)/2} and v_{(k + 3)/2}, so it meets the midpoint of their edge, and of the opposite edge. \square
Proof of Theorem 4. The order of r^k is Cyclic groups, Theorem 8; a reflection is not e and squares to e (Theorem 2). A rotation r^k commutes with every rotation, and with r^j s exactly when r^{k + j}s = r^{j - k}s, that is, r^{2k} = e, or n \mid 2k. For 0 \le k < n that means k = 0, or \displaystyle k = \frac{n}{2} when n is even. No reflection is central: r(r^k s) = r^{k + 1}s and (r^k s)r = r^{k - 1}s differ, as r^2 \ne e. \square
Proof of Theorem 5. From bab = a^{-1} and b^2 = e, induction gives ba^kb = (bab)^k = a^{-k} for k \ge 0, and inverting both sides gives it for k < 0; so ba^k = a^{-k}b. Then the four rules of Theorem 2 hold with a, b for r, s, by the same associativity steps. So T = \{a^i, a^i b\} is closed under products; it contains e, and inverses, as (a^i)^{-1} = a^{-i} and (a^i b)^{-1} = a^i b. Hence T \le G (Subgroups, Theorem 2). It contains a and b, and any subgroup containing them contains every a^i and a^i b; so T = \langle a, b \rangle. The a^i with 0 \le i < n are distinct (Cyclic groups, Theorem 4), hence so are the a^i b, and a^i = a^j b would put b = a^{i - j} \in \langle a \rangle. So |T| = 2n and f is a bijection. Products of r^i, r^i s in D_n and of a^i, a^i b in T follow the same four rules with the same exponents mod n (and a^n = e), so f(xy) = f(x)f(y). \square
Worked examples
The hexagon as permutations
In D_6, write r, s, r^2 s and r^5 s as permutations of the vertex numbers, locate the axes of the reflections, and compute (r^2 s)(r^5 s) by Theorem 2 and by the permutations.
SolutionBy Theorem 3, r adds 1 to each index: r = (1\ 2\ 3\ 4\ 5\ 6), and r^k s sends j to k + 2 - j mod 6. For s, j \mapsto 2 - j gives s = (2\ 6)(3\ 5), axis through v_1 and v_4. For r^2 s, j \mapsto 4 - j gives r^2 s = (1\ 3)(4\ 6), axis at angle \displaystyle \frac{2\pi}{6} through v_2 and v_5. For r^5 s, j \mapsto 7 - j gives r^5 s = (1\ 6)(2\ 5)(3\ 4), fixing no vertex as 5 is odd; its axis at angle \displaystyle \frac{5\pi}{6} bisects the directions of v_3 and v_4.
By Theorem 2, (r^2 s)(r^5 s) = r^{2 - 5} = r^{-3} = r^3, the half turn. With permutations, applying (1\ 6)(2\ 5)(3\ 4) first sends 1 \mapsto 6 \mapsto 4, 2 \mapsto 5 \mapsto 5 and 3 \mapsto 4 \mapsto 6, and 4, 5, 6 back to 1, 2, 3: the product is (1\ 4)(2\ 5)(3\ 6) = \pi_{r^3}.
Reducing a word
In D_8, write x = r^3 s\, r^5 s\, r^{-2} s\, r^6 in the form r^k or r^k s with 0 \le k < 8. Which vertices does x fix, and what is x^{-1}?
SolutionWork left to right with Theorem 2. (r^3 s)(r^5 s) = r^{3 - 5} = r^{-2}. Then r^{-2}r^{-2} = r^{-4}. Last, r^{-4}(s r^6) = r^{-4}r^{-6}s = r^{-10}s = r^6 s, as -10 \equiv 6 \pmod 8. So x = r^6 s, the reflection in the line at angle \displaystyle \frac{6\pi}{8}. It fixes v_j when 2(j - 1) \equiv 6 \pmod 8, that is, j - 1 \equiv 3 \pmod 4: the vertices v_4 and v_8. As a permutation, j \mapsto 8 - j gives (1\ 7)(2\ 6)(3\ 5). Being a reflection, x^{-1} = x = r^6 s.
Orders in D_12
Count the elements of each order in D_{12}, and find its center.
SolutionThe twelve reflections have order 2. By Theorem 4, \displaystyle \operatorname{ord}(r^k) = \frac{12}{\gcd(12, k)}: order 1 for k = 0; 2 for k = 6; 3 for k = 4, 8; 4 for k = 3, 9; 6 for k = 2, 10; 12 for k = 1, 5, 7, 11. So the orders 1, 2, 3, 4, 6, 12 occur 1, 13, 2, 2, 2, 4 times, 24 in all. As 12 is even, Z(D_{12}) = \{e, r^6\}.
Two triangles in a hexagon
The vertices v_1, v_3, v_5 of the hexagon form an equilateral triangle \Delta. Find the elements of D_6 that map \{v_1, v_3, v_5\} onto itself, and show that they form a subgroup with the same table as D_3.
SolutionBy Theorem 3, r^k sends v_j to v_{j + k}, which keeps the parity of the index (well defined mod 6) exactly when k is even. And r^k s sends v_j to v_{k + 2 - j}; for odd j, k + 2 - j is odd exactly when k is even. So the elements are
and the other six swap \Delta with the triangle v_2 v_4 v_6. Apply Theorem 5 in G = D_6 with a = r^2 and b = s: \displaystyle \operatorname{ord}(r^2) = \frac{6}{2} = 3, s has order 2, sr^2s = r^{-2} = a^{-1}, and s \notin \langle r^2 \rangle, which holds only rotations. So \langle r^2, s \rangle has the 6 elements of H, with the table of D_3.
Which pairs of reflections generate
Let n \ge 3 and 0 \le i, j < n with i \ne j. Prove that \langle r^i s, r^j s \rangle = D_n if and only if \gcd(i - j, n) = 1.
SolutionProof. Let d = \gcd(i - j, n), K = \langle r^i s, r^j s \rangle and T = \{r^{dm}, r^{dm + i}s : m \in \mathbb{Z}\}. By Theorem 2, (r^i s)(r^j s) = r^{i - j}, so K contains \langle r^{i - j} \rangle = \langle r^d \rangle (Cyclic groups, Theorem 8), and so contains T, as r^{dm}(r^i s) = r^{dm + i}s. Conversely, by Theorem 2, r^{dm}r^{dl + i}s = r^{d(m + l) + i}s, (r^{dm + i}s)r^{dl} = r^{d(m - l) + i}s and (r^{dm + i}s)(r^{dl + i}s) = r^{d(m - l)}, so T is closed under products, and it holds e and inverses (r^{-dm}, or the reflection itself). So T \le D_n, and it contains r^i s and r^j s = r^{i - (i - j)}s; hence K = T. T has \displaystyle \frac{n}{d} rotations and as many reflections, so \displaystyle |K| = \frac{2n}{d}, which is 2n exactly when d = 1. \square So D_n = \langle s, rs \rangle.
A mandala app
Isabel draws a mandala in an app that copies every stroke by each composite of reflections in two mirror lines through the center. She sets the mirrors at 30^\circ to each other. How many copies of each stroke appear, and what group does the app use?
SolutionPut the mirrors along the real axis and the line at angle \displaystyle \frac{\pi}{6}: m_0(z) = \bar z and m_1(z) = e^{i\pi/3}\bar z, by Theorem 1. The app uses G = \langle m_0, m_1 \rangle. Let a = m_1 m_0; then a(z) = e^{i\pi/3}z, the rotation through 60^\circ, of order 6. With b = m_0, bab(z) = \overline{e^{i\pi/3}\bar z} = e^{-i\pi/3}z = a^{-1}(z). And b \notin \langle a \rangle: b fixes 1 but not i, while a rotation about O fixing 1 is e. By Theorem 5, G has 12 elements; G = D_6, as a = r, b = s. So each stroke appears 12 times. The 30^\circ wedge W between the mirrors goes to r^kW, from 60k^\circ to 60k^\circ + 30^\circ, and to r^ksW, from 60k^\circ - 30^\circ to 60k^\circ: the twelve 30^\circ wedges around O, each once.
Boundaries
- Small n. For n = 2 the formulas give \{e, r, s, rs\} with r the half turn, so r = r^{-1} and the group is the abelian V_4.
- Theorem 5 needs its hypotheses. In a cyclic group \langle g \rangle of order 6, a = g^2 and b = g^3 meet all but bab = a^{-1}. In Q_8 = \{\pm 1, \pm i, \pm j, \pm k\} (i^2 = j^2 = k^2 = ijk = -1), jij^{-1} = i^{-1} with \operatorname{ord}(i) = 4, yet every element outside \langle i \rangle has order 4, so Q_8 is not D_4.
Where this goes next
The rotations and the reflections are the two Cosets of \langle r \rangle, and by Lagrange's theorem every subgroup of D_n has order dividing 2n. Conjugation keeps \langle r \rangle (Exercise 15), a first example of Normal subgroups. In Group actions, orbits and stabilizers, D_n acting on colorings counts necklaces up to turning and flipping.
Exercises
Products and permutations
- In D_5, write r, s, r^2 s and r^4 s as permutations of \{1, \dots, 5\}, and name the vertex on the axis of each reflection.
- In D_7, write each in the form r^k or r^k s with 0 \le k < 7: (a) r^3 s r^5; (b) s r^4 s r^2; (c) (r^2 s)(r^6 s)(rs).
- In D_{10}, find the inverses of r^3 s and of r^7, and solve r^4 x = sr for x.
- For which n \ge 3 do r^3 s and s commute in D_n?
- In D_8, which reflection r^k s has its axis through v_3, and which other vertex does it fix? Which reflection has its axis through the midpoint of the edge v_2 v_3? Write the second as a permutation.
Orders, centers and subgroups
- Count the elements of each order in D_9 and in D_{10}.
- Find Z(D_{14}) and Z(D_{15}).
- In D_8, let H = \langle r^2, rs \rangle. List its elements, show by Theorem 5 that it has the table of D_4, and show that no reflection in H fixes a vertex.
- For which n \ge 3 does D_n have an element of order 3? Of order 4? Of order 6?
Dihedral groups in other forms
- Let A = \begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix} and B = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix} in \operatorname{GL}_2(\mathbb{R}). Show that \langle A, B \rangle has order 8 with the table of D_4, and list its elements.
- In S_7 let \rho = (1\ 2\ 3\ 4\ 5\ 6\ 7) and \tau = (1\ 7)(2\ 6)(3\ 5). Show that \langle \rho, \tau \rangle has order 14, and say which \pi_{r^k s} the permutation \tau is.
- Identify D_5 with its permutations (Theorem 3). Which of these lie in it? (a) (1\ 3\ 5\ 2\ 4); (b) (1\ 2)(3\ 5); (c) (1\ 2); (d) (1\ 3)(2\ 4).
- Malik sets the mirrors of Isabel’s app at 40^\circ. Which group does the app use, how many copies of a stroke appear, and why do the copies of the wedge between the mirrors overlap?
Proofs
- Prove that every element of D_n is a product of at most two reflections, and that for each rotation \rho and each reflection t there is exactly one reflection t' with \rho = t't.
- Prove that xrx^{-1} \in \{r, r^{-1}\} for every x \in D_n, and deduce that xHx^{-1} = H for every x \in D_n and every subgroup H \le \langle r \rangle.
- Prove that a subgroup of D_n containing a reflection has as many reflections as rotations.
- Prove that every permutation in S_3 is \pi_f for some f \in D_3, but for n \ge 4 the transposition (1\ 2) is not \pi_f for any f \in D_n.
- Two mirrors through O meet at angle \displaystyle \theta = \frac{\pi p}{q}, where p, q are positive integers, \gcd(p, q) = 1 and q \ge 3. Prove that the reflections in them generate a group of order 2q, and that the images of the wedge between them under this group do not overlap (except along edges) if and only if p = 1.
- Prove that r^j s r^{-j} = r^{2j}s and (r^j s)s(r^j s)^{-1} = r^{2j}s. Deduce that every reflection of D_n has the form xsx^{-1} when n is odd, but not when n is even.
Answers
- r = (1\ 2\ 3\ 4\ 5). r^k s sends j to k + 2 - j mod 5: s = (2\ 5)(3\ 4), axis through v_1; r^2 s = (1\ 3)(4\ 5), axis through v_2; r^4 s = (1\ 5)(2\ 4), axis through v_3.
- (a) r^3(sr^5) = r^3r^{-5}s = r^5 s. (b) (sr^4s)r^2 = r^{-4}r^2 = r^5. (c) (r^2 s)(r^6 s) = r^{-4} = r^3, then r^3(rs) = r^4 s.
- (r^3 s)^{-1} = r^3 s and (r^7)^{-1} = r^3. x = r^{-4}sr = r^{-4}r^{-1}s = r^{-5}s = r^5 s.
- n = 3 and n = 6: (r^3 s)s = r^3 and s(r^3 s) = r^{-3}, equal exactly when r^6 = e, that is, n \mid 6.
- 2(3 - 1) \equiv k \pmod 8 gives r^4 s = (1\ 5)(2\ 4)(6\ 8), which also fixes v_7. The midpoint of v_2 v_3 lies at angle \displaystyle \frac{3\pi}{8}, so the reflection is r^3 s; j \mapsto 5 - j gives (1\ 4)(2\ 3)(5\ 8)(6\ 7).
- By Theorem 4. D_9: orders 1, 2, 3, 9 occur 1, 9, 2, 6 times (r^3, r^6 have order 3). D_{10}: orders 1, 2, 5, 10 occur 1, 11, 4, 4 times (r^5 and the ten reflections have order 2).
- By Theorem 4, Z(D_{14}) = \{e, r^7\} and Z(D_{15}) = \{e\}.
- H = \{e, r^2, r^4, r^6, rs, r^3 s, r^5 s, r^7 s\}: take a = r^2 of order 4 and b = rs; (rs)r^2(rs) = r^{-1}s\,rs = r^{-2} = a^{-1} and rs \notin \langle r^2 \rangle. Its reflections are r^k s with k odd, and 2(j - 1) \equiv k \pmod 8 has no solution for odd k.
- Reflections have order 2, and r^{n/d} has order d for each divisor d of n (Theorem 4), while every \operatorname{ord}(r^k) divides n. So: order 3 when 3 \mid n, order 4 when 4 \mid n, order 6 when 6 \mid n.
- A^2 = -I_2, so \operatorname{ord}(A) = 4; B^2 = I_2; BAB = \begin{pmatrix} 0 & 1 \\ -1 & 0 \end{pmatrix} = A^{-1}; and \det B = -1 while \det A^k = 1, so B \notin \langle A \rangle. By Theorem 5 the elements are I_2, A, -I_2, -A, B, AB, -B, -AB, with AB = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}.
- \tau = \pi_{r^6 s}, as \tau(j) = 8 - j = 6 + 2 - j, and \rho = \pi_r. As s = r(r^6 s), every element of D_7 is a product of r’s and (r^6 s)’s. As \pi_{fg} = \pi_f\pi_g and f \mapsto \pi_f is injective (Theorem 3), \langle \rho, \tau \rangle is the image of D_7, of order 14.
- (a) Yes, it is \pi_{r^2}, adding 2. (b) Yes: j \mapsto 3 - j mod 5 is (1\ 2)(3\ 5) = \pi_{rs}. (c) No: it fixes three vertices, while a non-identity element fixes at most one (Theorem 3). (d) No: the only element fixing v_5 other than e is r^3 s = (1\ 4)(2\ 3).
- \displaystyle 40^\circ = \frac{2\pi}{9}, so the mirrors compose to the turn through 80^\circ, of order 9, and the group is D_9 (Exercise 18, p = 2, q = 9): 18 copies. Eighteen 40^\circ wedges cover 720^\circ, so they overlap; the reflection in the 20^\circ line lies in the group and maps the wedge onto itself.
- Proof. By Theorem 2, r^k = (r^k s)s, and a reflection is a product of one. Given \rho = r^k and t = r^i s, \rho = t't forces t' = \rho t^{-1} = r^k r^i s = r^{k + i}s, a reflection; and (r^{k + i}s)(r^i s) = r^k. \square
- Proof. r^k r r^{-k} = r, and (r^k s)r(r^k s)^{-1} = r^k(srs)r^{-k} = r^k r^{-1}r^{-k} = r^{-1}, as (r^k s)^{-1} = s r^{-k}. Then xr^mx^{-1} = (xrx^{-1})^m = r^{\pm m}. By Cyclic groups, Theorem 6, H = \langle r^d \rangle, so xHx^{-1} \subseteq H; as h \mapsto xhx^{-1} is injective and H is finite, xHx^{-1} = H. \square
- Proof. Let t \in H be a reflection, R the rotations and F the reflections in H. By Theorem 2, x \mapsto tx sends rotations to reflections and reflections to rotations, so it maps R into F and F into R; applying it twice is the identity, as t^2 = e. So it is a bijection R \to F, and |R| = |F|. \square
- Proof. |D_3| = 6 = |S_3| and f \mapsto \pi_f is injective (Theorem 3), so its image is S_3. Let n \ge 4. A rotation other than e fixes no vertex, and a reflection fixes at most two, and then two opposite ones, v_j and -v_j. (1\ 2) fixes 3 and 4, but v_4 \ne -v_3 since n \ne 2; so it is no \pi_f. \square
- Proof. Put m_0(z) = \bar z, m_1(z) = e^{2i\theta}\bar z. Then a = m_1m_0 is z \mapsto e^{2\pi ip/q}z, of order q, as q \mid pk forces q \mid k. With b = m_0, bab = a^{-1} and b \notin \langle a \rangle, as in Example 6; by Theorem 5 the group G has order 2q. As \gcd(p, q) = 1, \langle a \rangle contains the turn r through \displaystyle \frac{2\pi}{q} (Cyclic groups, Corollary 9), so G = D_q with s = m_0. The 2q images of the wedge have total angle \displaystyle 2q \cdot \frac{\pi p}{q} = 2\pi p; for p \ge 2 this exceeds 2\pi, so two images overlap in a region of positive area. For p = 1 the images under r^k and r^k s are the 2q wedges between consecutive axes, each once, as in Example 6. \square
- Proof. By Theorem 2, r^j s r^{-j} = r^j r^{j}s = r^{2j}s, and (r^j s)s(r^j s) = r^j(r^j s) = r^{2j}s, as (r^j s)^{-1} = r^j s. So the elements xsx^{-1} are exactly the r^{2j}s. For odd n, 2 is invertible mod n, so 2j runs through every residue and every r^k s occurs. For even n, 2j mod n is always even, so rs is not of the form xsx^{-1}. \square