A stop sign is a regular octagon. Take one that has been unbolted from its post, lift it, move it about, and lay it back in its outline. The motions that end with the sign covering the outline exactly, regarded only for where they leave it, are its symmetries. Turning it through any multiple of 45 degrees works, which gives eight. Flipping it over about a line through the center also works, provided the line passes through two opposite corners or through the midpoints of two opposite sides. That gives eight more. Are these sixteen motions all of them, and what is the rule for combining two of them?
The motions can be combined, one after another, and each can be undone, so by the definition they form a group. It is the dihedral group $D_8$. The regular polygon with $n$ sides has in the same way a dihedral group $D_n$ with $2n$ elements. The dihedral groups are the simplest nonabelian groups to picture, and also the simplest to compute in, because a single idea does all the work. Number the corners $0, 1, \ldots, n - 1$ around the polygon and treat the numbers as elements of $\mathbb{Z}_n$. Every rotation then adds a constant, every reflection subtracts from a constant, and composing symmetries becomes arithmetic modulo $n$.
First we prove that there are exactly $2n$ symmetries. Then we derive the rules for multiplying them from two generators, and read off the Cayley table and the orders of elements. Finally we locate the mirror lines and describe the symmetries as matrices and as permutations of the corners. The stop sign, the octagon, is the running example throughout.
This is the second article of Groups, and it assumes the definition and the order of an element from Groups: Definition and First Examples. The course text introduces the symmetries of the square and the dihedral groups among the examples of §7.1 (Hungerford, 2014). Judson (2026, §5.2) treats them as permutation groups.
Symmetries of a regular polygon
Fix $n \ge 3$ and let $P$ be the regular $n$-gon centered at the origin of the plane with vertices
$$v_k = \left(\cos \tfrac{2\pi k}{n}, \; \sin \tfrac{2\pi k}{n}\right), \qquad k = 0, 1, \ldots, n - 1,$$
numbered counterclockwise. Vertex labels are read modulo $n$, so that vertex $n$ is vertex 0 and vertex $-1$ is vertex $n - 1$; the neighbors of vertex $k$ are $k + 1$ and $k - 1$. A symmetry of $P$ is a distance-preserving map of the plane onto itself that carries $P$ onto $P$. The symmetries of $P$ form a group under composition (see groups of transformations), called the dihedral group $D_n$. The product $fg$ of two symmetries is the composite $f \circ g$: first $g$, then $f$.
Two kinds of symmetry are visible at once.
- Rotations about the origin through the angles $2\pi k/n$, for $k = 0, 1, \ldots, n - 1$. The rotation through $2\pi k/n$ moves each vertex $k$ places counterclockwise, so it sends vertex $x$ to vertex $x + k$.
- Reflections in the lines through the origin at the angles $\pi k/n$, for $k = 0, 1, \ldots, n - 1$. Reflection in the line at angle $\alpha$ sends the point at angle $\theta$ on the unit circle to the point at angle $2\alpha - \theta$; with $\alpha = \pi k/n$ it sends $v_x$, at angle $2\pi x/n$, to the point at angle $2\pi(k - x)/n$, which is $v_{k - x}$.
These are $2n$ maps, and each carries the set of vertices onto itself, hence the polygon onto itself. Could some cleverer motion be a symmetry too? The theorem below shows that there are no others.
Here is the idea. A symmetry is pinned down by where it puts vertices 0 and 1, and two neighbors can only go to two neighbors, which leaves $n \cdot 2$ choices. Two geometric facts make this precise.
Symmetries are determined by two vertices. The proof needs one fact from plane geometry, which is taken as known. Every distance-preserving map of the plane has the form $y \mapsto Ay + c$ for an invertible $2 \times 2$ matrix $A$ and a vector $c$, and one that fixes the origin is linear (Judson, 2026, §12.2 and Lemma 12.2.2). Such a map carries line segments onto line segments. The vertices of $P$ are its corners, the points of $P$ that do not lie strictly inside a segment joining two other points of $P$. A symmetry of $P$ carries $P$ onto $P$ and segments onto segments, so it carries vertices to vertices.
A further consequence is that every symmetry $f$ of $P$ fixes the center. The map $f$ permutes the vertices, and a map of the form $y \mapsto Ay + c$ sends the average of points to the average of their images. So it sends the average of the vertices, which is the origin, to the average of the same vertices in another order, which is again the origin. So $f$ is linear. A linear map of the plane is determined by its values on two vectors that are not multiples of each other, here $v_0$ and $v_1$. A symmetry is therefore determined by where it sends vertices 0 and 1.
Symmetries preserve adjacency. Two vertices are neighbors exactly when their distance is the side length of $P$, the smallest distance between distinct vertices, and distances are preserved.
Theorem. For $n \ge 3$ the dihedral group $D_n$ has exactly $2n$ elements. Each symmetry acts on the vertex labels by one of the maps
$$x \mapsto x + k \quad \text{or} \quad x \mapsto k - x \qquad (\text{modulo } n),$$
for some $k$ in $\{0, 1, \ldots, n - 1\}$; the first is the rotation through $2\pi k/n$ and the second is the reflection in the line at angle $\pi k/n$.
Proof. Let $f$ be a symmetry and let $\phi$ be the permutation of $\mathbb{Z}_n$ it induces, $f(v_x) = v_{\phi(x)}$. Put $k = \phi(0)$. Since vertex 1 is a neighbor of vertex 0, $\phi(1)$ is a neighbor of $k$, so $\phi(1) = k + 1$ or $\phi(1) = k - 1$; these are different vertices because $n \ge 3$.
Suppose $\phi(1) = k + 1$. Then $\phi$ agrees with the map $x \mapsto x + k$ at 0 and at 1, and so $f$ agrees with the rotation through $2\pi k/n$ at $v_0$ and $v_1$. Both are symmetries, so by the observation in bold above they are equal. If instead $\phi(1) = k - 1$, then $f$ agrees with the reflection $x \mapsto k - x$ at $v_0$ and $v_1$, and so $f$ is that reflection.
So every symmetry is one of the $2n$ rotations and reflections listed above. These $2n$ maps are different from each other, because they differ in where they send vertex 0 or vertex 1. The rotation $x \mapsto x + k$ sends $(0, 1)$ to $(k, k + 1)$ and the reflection $x \mapsto k - x$ sends $(0, 1)$ to $(k, k - 1)$, and the $2n$ pairs $(k, k \pm 1)$ are distinct. Hence $\lvert D_n \rvert = 2n$. $\blacksquare$
The count has a simple reading. A symmetry may put vertex 0 at any of the $n$ vertices, and vertex 1 at either neighbor of that one, after which there is no further freedom. For the stop sign that is $8 \cdot 2 = 16$, the sixteen motions of the opening. The script for this article confirms the theorem's combinatorial core for $n = 3, \ldots, 10$ by listing every permutation of $\mathbb{Z}_n$ that preserves adjacency. There are exactly $2n$, and they are exactly the maps $x \mapsto \pm x + k$.
Check your understanding. A symmetry of the octagon sends vertex 0 to vertex 3 and vertex 1 to vertex 2. Which symmetry is it, and does it fix any vertex?
It is the reflection $x \mapsto 3 - x$, since $\phi(1) = k - 1$ with $k = 3$; its mirror line is at angle $3\pi/8$, or 67.5 degrees. It fixes no vertex, because $3 - x = x$ would need $2x \equiv 3 \pmod 8$, and $2x$ is always even modulo 8. Its mirror line passes through the midpoints of two sides, a pattern explained in the section on mirror lines below.
Two generators and their relations
Sixteen symmetries are too many to multiply one pair at a time. Can two of them, and a few rules, do all the work? Let $r$ be the rotation through $2\pi/n$ and $s$ the reflection in the horizontal axis (the line through vertex 0). On labels,
$$r(x) = x + 1, \qquad s(x) = -x.$$
The rotation $x \mapsto x + k$ is $r^k$, since applying $r$ $k$ times adds $k$. The reflection $x \mapsto k - x$ is $r^k s$, since $r^k(s(x)) = -x + k$. So
$$D_n = \{\, 1, r, r^2, \ldots, r^{n-1}, \; s, rs, r^2 s, \ldots, r^{n-1} s \,\},$$
with every element written uniquely as $r^a$ or $r^a s$ for $0 \le a \le n - 1$. Here $1$ denotes the identity.
Every computation in $D_n$ follows from the formula for composing two maps of the form $x \mapsto \varepsilon x + k$, where $\varepsilon = \pm 1$. If $f(x) = \varepsilon_1 x + k_1$ and $g(x) = \varepsilon_2 x + k_2$, then
$$(fg)(x) = f(\varepsilon_2 x + k_2) = \varepsilon_1 \varepsilon_2 \, x + (\varepsilon_1 k_2 + k_1).$$
Proposition. In $D_n$,
$$r^n = 1, \qquad s^2 = 1, \qquad s r = r^{-1} s,$$
and more generally $s r^k = r^{-k} s$ for every integer $k$. Every product of the form $(r^a s^i)(r^b s^j)$, with $i, j \in \{0, 1\}$, equals
$$r^{\,a + (-1)^i b} \, s^{\,i + j},$$
where the exponent of $r$ is read modulo $n$ and that of $s$ modulo 2.
The idea: each relation is an identity between maps $x \mapsto \pm x + k$ on $\mathbb{Z}_n$, checked by evaluating both sides at $x$. Flipping first negates whatever rotation follows it, which is the relation $sr = r^{-1}s$.
Proof. $r^n(x) = x + n = x$ in $\mathbb{Z}_n$, and $s^2(x) = -(-x) = x$. For the third relation, $(s r^k)(x) = s(x + k) = -x - k$, while $(r^{-k} s)(x) = r^{-k}(-x) = -x - k$; with $k = 1$ this is $sr = r^{-1}s$. For the product rule: if $i = 0$, then $r^a r^b s^j = r^{a + b} s^j$. If $i = 1$, then $r^a s r^b s^j = r^a r^{-b} s \, s^j = r^{a - b} s^{1 + j}$, using $s r^b = r^{-b} s$. In both cases the exponent of $r$ is $a + (-1)^i b$. Finally $s^{i + j}$ depends only on $i + j$ modulo 2, because $s^2 = 1$. $\blacksquare$
The relation $s r = r^{-1} s$ is the whole content of the group's multiplication. An $s$ can be moved past a power of $r$ from left to right at the cost of inverting the power. Combined with $r^n = 1$ and $s^2 = 1$ it reduces any word in $r$ and $s$ to the form $r^a$ or $r^a s$. The script checks the product rule for all $4n^2$ products in $D_8$. For this reason $D_n$ is often described by the presentation
$$D_n = \langle\, r, s \mid r^n = s^2 = 1, \; s r s = r^{-1} \,\rangle,$$
meaning that $D_n$ is generated by $r$ and $s$ and that every relation between them follows from these three. Judson (2026, Theorem 5.2.3) describes $D_n$ by the same generators and relations.
What the relations say geometrically
The product rule turns any word in $r$ and $s$ into arithmetic, but its most useful consequences are general identities with a geometric meaning.
Inverses come first. A rotation $r^a$ has inverse $r^{-a} = r^{n - a}$. A reflection is its own inverse: $(r^a s)(r^a s) = r^{a - a} s^2 = 1$.
A reflection reverses every rotation. For any reflection $r^a s$ and any rotation $r^k$, the product rule gives
$$(r^a s)\, r^k \,(r^a s)^{-1} = (r^a s \cdot r^k)(r^a s) = r^{a - k} s \cdot r^a s = r^{(a - k) - a} = r^{-k}.$$
Flip the sign over, turn it, and flip it back: the result is the same turn in the opposite direction, whichever mirror line is used. On the stop sign, flipping, making a quarter turn and flipping back is a quarter turn the other way.
A rotation turns every mirror line. For a rotation $r^j$ and a reflection $r^a s$,
$$r^j \,(r^a s)\, r^{-j} = r^{j + a} s \, r^{-j} = r^{j + a + j} s = r^{a + 2j} s.$$
The reflection $r^a s$ has its mirror line at angle $\pi a/n$, and $r^{a + 2j}s$ at angle $\pi a/n + 2\pi j/n$. So turning the polygon, reflecting and turning back is reflection in the mirror line turned through the same angle. In the octagon the rotations carry $s$ only to the reflections $r^{2j}s$ with even exponent, and $rs$ only to those with odd exponent. The eight reflections fall into two families of four, a split that the section on mirror lines below explains. The script checks both identities for every rotation and reflection of $D_8$.
Check your understanding. Moving $s$ past $r$ inverts it. Does the half turn $r^4$ of the octagon commute with $s$, and why does $r$ not?
The half turn does: $s r^4 = r^{-4} s = r^4 s$, because $r^8 = 1$. In general $s r^k = r^k s$ exactly when $r^{2k} = 1$, which in $D_8$ happens only for $k = 0$ and $k = 4$. For $r$ itself $r^{-1} \neq r$, so $sr \neq rs$.
$D_n$ is not abelian
Proposition. For $n \ge 3$, $rs \neq sr$; so $D_n$ is nonabelian.
The idea: $rs$ and $sr$ are two different reflections, and evaluating both at vertex 0 shows it.
Proof. $rs$ is the map $x \mapsto 1 - x$ and $sr = r^{-1} s$ is the map $x \mapsto -1 - x$. They differ at $x = 0$, since $1 \neq -1$ in $\mathbb{Z}_n$ when $n \ge 3$. $\blacksquare$
Geometrically, $rs$ and $sr$ are both reflections, but in different lines: $rs = r^1 s$ reflects in the line at angle $\pi/n$, and $sr = r^{n-1} s$ in the line at angle $-\pi/n$.
The Cayley table
The product rule produces the whole Cayley table of $D_8$ at once. Its structure is visible when the rotations are listed first and the reflections second.
- A product of two rotations or of two reflections is a rotation.
- A product of a rotation and a reflection, in either order, is a reflection.
This is the product rule's statement that the exponent of $s$ adds modulo 2. It says that the map sending rotations to $+1$ and reflections to $-1$ turns products into products, the first example in this unit of a homomorphism.
Orders of elements
The Cayley table shows every product once. How often must one symmetry be repeated before the sign is back where it started?
Proposition. In $D_n$ the rotation $r^k$ has order $n/\gcd(n, k)$, and every reflection has order 2.
The idea: $(r^k)^m$ is the identity when the total turn of $km$ steps is a whole number of revolutions, that is, when $n \mid km$. The gcd removes the factors that $k$ already shares with $n$.
Proof. Let $d = \gcd(n, k)$. For a positive integer $m$, $(r^k)^m = r^{km}$ is the identity exactly when $n$ divides $km$. Write $n = d n'$ and $k = d k'$, where $\gcd(n', k') = 1$. Then $n \mid km$ means $n' \mid k' m$. Since $n'$ and $k'$ are relatively prime, this happens exactly when $n' \mid m$, by the theorem in Divisibility and the Euclidean Algorithm that $a \mid bc$ and $\gcd(a, b) = 1$ imply $a \mid c$. The smallest such positive $m$ is $n' = n/d$. For a reflection, $(r^a s)^2 = 1$ was shown above, and $r^a s \neq 1$, so its order is 2. $\blacksquare$
In particular $r$ itself has order $n$, and the rotations of order $n$ are the powers $r^k$ with $\gcd(k, n) = 1$, of which there are $\varphi(n)$, the number of units of $\mathbb{Z}_n$. More generally, for each divisor $m$ of $n$ the rotations of order $m$ are the $r^k$ with $\gcd(n, k) = n/m$, and there are $\varphi(m)$ of them. The script checks these counts for $n = 3$ to 12. No element of $D_n$ has order larger than $n$: rotations have orders dividing $n$, and reflections order 2.
Check your understanding. How many elements of order 2 does $D_n$ have? Does the answer depend on whether $n$ is odd or even?
It does. All $n$ reflections have order 2. A rotation $r^k$ has order 2 exactly when $n/\gcd(n, k) = 2$, which needs $n$ even and $k = n/2$, the half turn. So $D_n$ has $n$ elements of order 2 when $n$ is odd and $n + 1$ when $n$ is even. The script confirms both counts for $n = 3$ to 12.
For the stop sign this gives nine elements of order 2, and no element of order 16, since the largest order is 8. This settles a question raised in Groups: Definition and First Examples. $D_8$ and the additive group $\mathbb{Z}_{16}$ have the same order but are different groups: $\mathbb{Z}_{16}$ has an element of order 16 (the class of 1) and an abelian table, and $D_8$ has neither.
The mirror lines
The opening said that the stop sign's mirror lines run through opposite corners or through midpoints of opposite sides. Which reflections are which? The reflection $r^k s$ is $x \mapsto k - x$, and it fixes vertex $x$ exactly when $k - x = x$, that is, when
$$2x \equiv k \pmod n.$$
This is a linear congruence, and the theory of $ax = b$ in $\mathbb{Z}_n$ counts its solutions. There are $\gcd(2, n)$ of them if $\gcd(2, n)$ divides $k$, and none otherwise.
- $n$ odd. Then $\gcd(2, n) = 1$, so 2 is a unit modulo $n$ and every reflection fixes exactly one vertex. Its mirror line runs from that vertex through the center to the midpoint of the opposite side. In the heptagon, for example, $r s$ fixes vertex 4, since $2 \cdot 4 = 8 \equiv 1 \pmod 7$.
- $n$ even. Then $\gcd(2, n) = 2$. For even $k$ the reflection $r^k s$ fixes the two opposite vertices $k/2$ and $k/2 + n/2$. For odd $k$ it fixes no vertex, and its mirror line joins the midpoints of two opposite sides. So half of the $n$ reflections are of each kind.
Check your understanding. In the regular decagon ($n = 10$), does the reflection $r^3 s$ fix a vertex? Which vertices does $r^4 s$ fix?
Since 10 is even, the parity of $k$ decides. $2x \equiv 3 \pmod{10}$ has no solution, so $r^3 s$ fixes no vertex. $2x \equiv 4$ has the solutions 2 and 7, two opposite vertices.
Two reflections make a rotation
A tempting guess is that combining two symmetries of order 2 gives another symmetry of order 2, or the identity. The reflections $s$ and $rs$ both have order 2. Their product is $(rs)s = r$, the turn through 45 degrees, of order 8.
The product rule gives $(r^a s)(r^b s) = r^{a - b}$ in general. The first factor reflects in the line at angle $\pi a/n$, the second in the line at angle $\pi b/n$. The product rotates through $2\pi(a - b)/n$, which is twice the angle from the second mirror line to the first. This is the classical fact that reflecting in two lines through a point, one after the other, rotates about that point through twice the angle between the lines. In the octagon, $(r^3 s)(r s) = r^2$: the mirror lines at $67.5$ and $22.5$ degrees are 45 degrees apart, and the product is the quarter turn. In the other order, $(r s)(r^3 s) = r^{-2} = r^6$, the quarter turn the other way.
A consequence is that $D_n$ is generated by its reflections alone: $r = (rs)s$ is the product of two reflections, so every rotation is too.
Matrices
So far symmetries have been maps on vertex labels. The geometry gives a second description, since every symmetry is linear and so has a matrix. The rotation $r$ and the reflection $s$ are
$$R = \begin{pmatrix} \cos \frac{2\pi}{n} & -\sin \frac{2\pi}{n} \\ \sin \frac{2\pi}{n} & \cos \frac{2\pi}{n} \end{pmatrix}, \qquad S = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix},$$
and composing symmetries multiplies their matrices. The $2n$ matrices $R^a$ and $R^a S$ form a group of order $2n$ inside $GL_2(\mathbb{R})$, a copy of $D_n$. For the square, $n = 4$, the rotation matrix is $\begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix}$, which is the matrix $A$ of Rings: Definition and Examples, and $S$ is its matrix $B$. The calculation there that $AB \neq BA$ was a calculation in $D_4$. $AB = rs$ is the reflection in the line $y = x$ (at angle $\pi/4$), and $BA = sr = r^3 s$ is the reflection in the line $y = -x$.
Symmetries as permutations of the vertices
A third description needs no geometry at all. The proof of the theorem identified each symmetry with the permutation of the vertex labels that it induces, and those permutations can be described by their shapes, the cycle types of Symmetric Groups and Permutations, without writing any of them out.
- Rotations. The rotation $r^k$ is $x \mapsto x + k$. Following a label, $x \to x + k \to x + 2k \to \cdots$, it returns after $n/\gcd(n, k)$ steps, the order of $r^k$. So $r^k$ splits the $n$ labels into $\gcd(n, k)$ cycles, each of length $n/\gcd(n, k)$.
- Reflections. The reflection $r^k s$ is $x \mapsto k - x$, which pairs each label $x$ with $k - x$ and is its own inverse. So it consists of 2-cycles, together with the labels it fixes, the solutions of $2x \equiv k$ found in the section on mirror lines: one fixed label when $n$ is odd, two when $n$ and $k$ are even, none when $n$ is even and $k$ odd.
For the octagon the shapes are an 8-cycle for the four rotations of order 8, two 4-cycles for the quarter turns, four 2-cycles for the half turn, and for the reflections either three 2-cycles with two fixed labels or four 2-cycles. The script lists all 16 permutations and confirms every shape, and checks the rule for rotations for $n = 3$ to 12. Only 16 of the $8! = 40{,}320$ permutations of eight labels arise, since a symmetry must preserve adjacency. The assignment of a permutation to each symmetry respects composition and sends different symmetries to different permutations. So $D_n$ appears as a group of permutations of $n$ objects. Maps of this kind are homomorphisms, and Cayley's theorem shows that every group can be realized as a group of permutations in a similar way.
Check your understanding. How many of the sixteen symmetries of the stop sign leave no corner where it was?
Eleven. A rotation other than the identity moves every corner, since $x + k = x$ needs $k \equiv 0$, which accounts for seven. A reflection $r^k s$ with $k$ odd fixes no corner, because $2x \equiv k \pmod 8$ has no solution, which accounts for four more. The identity and the four reflections through opposite corners each fix at least one. The script finds the same eleven.
Rotations alone, and other figures
What if a figure cannot be flipped? The $n$ rotations $1, r, \ldots, r^{n-1}$ form a group by themselves, since products and inverses of rotations are rotations. It is a group inside $D_n$ of half its size, all of whose elements are powers of the single element $r$. Such a group is cyclic, and groups inside groups are the subject of Subgroups and Cyclic Groups. It is the full symmetry group of a figure that can be turned but not flipped, such as a pinwheel with $n$ identical bent blades.
Polygons and pinwheels exhaust the possibilities. Every finite group of symmetries of a figure in the plane is either a group of $n$ rotations or a dihedral group $D_n$ (Judson, 2026, Theorem 12.2.4). Judson's historical note credits Leonardo da Vinci as probably the first to know all of these groups. Snowflakes, starfish and the floor plans of many buildings have dihedral symmetry. A figure in three dimensions can have more varied symmetry. The rotations of a cube, for example, form a group of order 24 (Judson, 2026, Proposition 5.2.8). Its layers, when they can be turned separately, generate the far larger Rubik's cube group.
Where it leads
- The first theorems about groups, including the facts about orders used informally here, are in Basic Properties of Groups.
- The rotations form a cyclic subgroup of $D_n$, and the reflections each generate a subgroup of order 2. Subgroups and cyclic groups are in Subgroups and Cyclic Groups.
- The rotation/reflection sign and the vertex permutations are homomorphisms (Group Homomorphisms and Isomorphisms).
- Permutations and their cycle notation are developed in Symmetric Groups and Permutations, and every group is a permutation group by Cayley's Theorem.
- The rotations of $D_n$ make up half of the group, and the two halves, rotations and reflections, are the cosets of the rotation subgroup in Cosets and Lagrange's Theorem.
What we have learned
The stop sign has exactly the sixteen symmetries of the opening, and the regular $n$-gon has $2n$: every symmetry is $x \mapsto x + k$ or $x \mapsto k - x$ on the corners numbered by $\mathbb{Z}_n$. Two of them, $r$ and $s$, with $r^n = s^2 = 1$ and $sr = r^{-1}s$, generate the group and decide every product. Rotations have order $n/\gcd(n, k)$ and reflections order 2, so $D_8$ has no element of order 16. The parity of $n$ and $k$ decides which mirror lines pass through corners.
What happens when a solid is cut into layers that turn separately? The next article, The Rubik's Cube Group, studies the group generated by six turns of a cube's faces.
References
- Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §7.1. Brooks/Cole, Cengage Learning. The course text: the group of symmetries of the square as a first nonabelian group, and the dihedral group $D_n$ of a regular polygon with $n$ sides. record · 44 pages
- Judson, T. W. (2026). Abstract Algebra: Theory and Applications (annual edition, August 2026). Free online at judsonbooks.org. §5.2 (the dihedral groups: Theorem 5.2.2, $D_n$ has order $2n$; Theorem 5.2.3, $D_n$ consists of products of $r$ of order $n$ and $s$ of order 2 with $srs = r^{-1}$; Proposition 5.2.8, the rigid motions of a cube); §12.2 (isometries of the plane: Lemma 12.2.2, an isometry fixing the origin is linear; Theorem 12.2.4, the only finite symmetry groups in the plane are the cyclic and dihedral groups; §12.2.2, historical note on Leonardo da Vinci). record · 44 pages