Plane isometries are geometric realizations of group structure. Instead of manipulating abstract symbols, one composes rigid motions of the Euclidean plane. This chapter matters because it shows how algebra records symmetry, and because it gives concrete nonabelian groups that can actually be pictured. The classification of plane isometries into exactly four types is one of the cleanest theorems in elementary geometry, and the finite subgroups of the isometry group turn out to be precisely the cyclic and dihedral groups from earlier chapters.


§12.1 Isometries of the plane

Definition 12.1 (Plane isometry)

A plane isometry (or rigid motion) is a bijection ϕ:R2R2\phi : \mathbb{R}^2 \to \mathbb{R}^2 that preserves Euclidean distance:

ϕ(x)ϕ(y)=xy|\phi(\mathbf{x}) - \phi(\mathbf{y})| = |\mathbf{x} - \mathbf{y}|

for all x,yR2\mathbf{x}, \mathbf{y} \in \mathbb{R}^2.

Theorem 12.2. The set of all plane isometries forms a group under composition.

This group is called the Euclidean group of the plane, or the isometry group Isom(R2)\operatorname{Isom}(\mathbb{R}^2).

Theorem 12.3 (Affine form of an isometry)

Every plane isometry can be written in the form

ϕ(x)=Ax+b,\phi(\mathbf{x}) = A\mathbf{x} + \mathbf{b},

where AO(2)A \in O(2) is an orthogonal 2×22 \times 2 matrix (satisfying ATA=IA^T A = I) and bR2\mathbf{b} \in \mathbb{R}^2.

Since AO(2)A \in O(2), we have det(A)=±1\det(A) = \pm 1. This determinant is the key invariant that separates orientation-preserving from orientation-reversing isometries.


§12.2 The four types: classification theorem

Theorem 12.4 (Classification of plane isometries)

Every plane isometry is exactly one of the following:

TypeOrientationFixed points
TranslationPreserving (det=+1\det = +1)None (unless v=0\mathbf{v} = \mathbf{0}, i.e., identity)
RotationPreserving (det=+1\det = +1)Exactly one (the center)
ReflectionReversing (det=1\det = -1)An entire line (the axis)
Glide reflectionReversing (det=1\det = -1)None

This classification is exhaustive and mutually exclusive. The identity map is conventionally grouped with translations (v=0\mathbf{v} = \mathbf{0}) or with rotations (θ=0\theta = 0); either convention is harmless.


§12.3 Translations

Definition 12.5 (Translation)

For vR2\mathbf{v} \in \mathbb{R}^2, the translation by v\mathbf{v} is

Tv(x)=x+v.T_{\mathbf{v}}(\mathbf{x}) = \mathbf{x} + \mathbf{v}.

Theorem 12.6. The set of translations forms a subgroup isomorphic to (R2,+)(\mathbb{R}^2, +).

Remark 12.7

The group of translations is abelian (since vector addition is commutative) and is a normal subgroup of Isom(R2)\operatorname{Isom}(\mathbb{R}^2): for any isometry ϕ(x)=Ax+b\phi(\mathbf{x}) = A\mathbf{x} + \mathbf{b},

ϕTvϕ1=TAv,\phi \circ T_{\mathbf{v}} \circ \phi^{-1} = T_{A\mathbf{v}},

which is again a translation. This normality is fundamental to the semidirect product structure of the Euclidean group (see Section 12.10).


§12.4 Rotations

Definition 12.8 (Rotation)

The rotation by angle θ\theta about point PP is the isometry

Rθ,P(x)=Rθ(xP)+P,R_{\theta, P}(\mathbf{x}) = R_\theta(\mathbf{x} - P) + P,

where Rθ=(cosθsinθsinθcosθ)R_\theta = \begin{pmatrix} \cos\theta & -\sin\theta \\ \sin\theta & \cos\theta \end{pmatrix} is the standard rotation matrix. In the special case P=0P = \mathbf{0}:

Rθ,0(x)=Rθx.R_{\theta, \mathbf{0}}(\mathbf{x}) = R_\theta \mathbf{x}.

Theorem 12.9. The rotations about the origin form a group isomorphic to SO(2)S1SO(2) \cong S^1.

Remark 12.10

A rotation Rθ,PR_{\theta, P} has a unique fixed point, namely PP. The order of Rθ,0R_{\theta, \mathbf{0}} in SO(2)SO(2) is finite if and only if θ/(2π)\theta / (2\pi) is rational. Concretely, R2π/nR_{2\pi/n} has order nn and generates a cyclic subgroup CnSO(2)C_n \leq SO(2).


§12.5 Reflections

Definition 12.11 (Reflection)

The reflection across a line \ell is the isometry σ\sigma_\ell that sends each point x\mathbf{x} to its mirror image across \ell. In coordinates, if \ell passes through the origin at angle α\alpha from the xx-axis, then

σ(x)=Mαx,Mα=(cos2αsin2αsin2αcos2α).\sigma_\ell(\mathbf{x}) = M_\alpha \mathbf{x}, \qquad M_\alpha = \begin{pmatrix} \cos 2\alpha & \sin 2\alpha \\ \sin 2\alpha & -\cos 2\alpha \end{pmatrix}.

Theorem 12.12. Every reflection has order 22.

The fixed-point set of a reflection is exactly the line \ell.

Theorem 12.13 (Two reflections: the two key cases)

The composition of two reflections yields either a translation or a rotation, depending on whether the reflection axes are parallel or intersecting.

Corollary 12.14

Every plane isometry is a product of at most three reflections.


§12.6 Glide reflections

Definition 12.15 (Glide reflection)

A glide reflection is the composition of a reflection σ\sigma_\ell across a line \ell with a nonzero translation TvT_{\mathbf{v}} where v\mathbf{v} is parallel to \ell:

G=Tvσ,v,v0.G = T_{\mathbf{v}} \circ \sigma_\ell, \qquad \mathbf{v} \parallel \ell, \quad \mathbf{v} \neq \mathbf{0}.

Remark 12.16

A glide reflection has no fixed points: if G(x)=xG(\mathbf{x}) = \mathbf{x}, then σ(x)=xv\sigma_\ell(\mathbf{x}) = \mathbf{x} - \mathbf{v}. But σ\sigma_\ell maps \ell to \ell and moves points off \ell to the opposite side, so x\mathbf{x} would have to lie on \ell and simultaneously satisfy x=x+v\mathbf{x} = \mathbf{x} + \mathbf{v}, contradicting v0\mathbf{v} \neq \mathbf{0}.

The requirement v0\mathbf{v} \neq \mathbf{0} is essential: with v=0\mathbf{v} = \mathbf{0} the map reduces to a reflection.

Example 12.17. The map (x,y)(x+3,y)(x, y) \mapsto (x + 3, -y) is a glide reflection: it reflects across the xx-axis and then translates by (3,0)(3, 0).


§12.7 Orientation

Definition 12.18 (Orientation of an isometry)

An isometry ϕ(x)=Ax+b\phi(\mathbf{x}) = A\mathbf{x} + \mathbf{b} is called:

  • Orientation-preserving if det(A)=+1\det(A) = +1.
  • Orientation-reversing if det(A)=1\det(A) = -1.

Theorem 12.19. The orientation-preserving isometries form a normal subgroup of index 22 in Isom(R2)\operatorname{Isom}(\mathbb{R}^2).

Summary table

Typedet(A)\det(A)OrientationFixed points
Translation (v0\mathbf{v} \neq 0)+1+1PreservingNone
Rotation (θ0\theta \neq 0)+1+1PreservingOne point (center)
Reflection1-1ReversingA line (axis)
Glide reflection1-1ReversingNone

§12.8 Finite subgroups of the isometry group

Theorem 12.20 (Leonardo’s theorem)

Every finite subgroup of Isom(R2)\operatorname{Isom}(\mathbb{R}^2) is isomorphic to either:

  • a cyclic group CnC_n (consisting of nn rotations about a common center), or
  • a dihedral group DnD_n (consisting of nn rotations and nn reflections).

Definition 12.21 (Dihedral group, geometric definition)

The dihedral group DnD_n is the group of all symmetries of a regular nn-gon. It has order 2n2n and is generated by a rotation r=R2π/nr = R_{2\pi/n} and a reflection ss subject to:

rn=e,s2=e,srs1=r1(equivalently, sr=r1s).r^n = e, \qquad s^2 = e, \qquad srs^{-1} = r^{-1} \quad (\text{equivalently, } sr = r^{-1}s).

The elements are {e,r,r2,,rn1,s,sr,sr2,,srn1}\{e, r, r^2, \ldots, r^{n-1}, s, sr, sr^2, \ldots, sr^{n-1}\}.

Example 12.22 (Symmetry groups of familiar figures)

FigureSymmetry groupOrderGenerators
Equilateral triangleD3S3D_3 \cong S_366Rotation 120°120°, any reflection
SquareD4D_488Rotation 90°90°, any reflection
Regular nn-gonDnD_n2n2nRotation 2π/n2\pi/n, any reflection
CircleO(2)O(2)\inftyAll rotations, any one reflection

The orientation-preserving symmetries of a regular nn-gon form the cyclic subgroup Cn=rDnC_n = \langle r \rangle \leq D_n, which has index 22 and is therefore normal.


§12.9 Connection to Chapter 8: DnD_n as a permutation group

Label the vertices of the regular nn-gon as 1,2,,n1, 2, \ldots, n. Each symmetry permutes these vertices, giving a faithful action DnSnD_n \hookrightarrow S_n. This embeds DnD_n as a subgroup of SnS_n.

Example 12.23 (D3S3D_3 \hookrightarrow S_3)

Label the vertices of the triangle 1,2,31, 2, 3 (clockwise). Then:

SymmetryPermutation
Identity eeι\iota
Rotation rr (120°120°)(1  2  3)(1\;2\;3)
Rotation r2r^2 (240°240°)(1  3  2)(1\;3\;2)
Reflection ss (axis through vertex 11)(2  3)(2\;3)
Reflection srsr (axis through vertex 22)(1  3)(1\;3)
Reflection sr2sr^2 (axis through vertex 33)(1  2)(1\;2)

Since D3=6=S3|D_3| = 6 = |S_3| and D3S3D_3 \hookrightarrow S_3 is injective, we have D3S3D_3 \cong S_3.

Example 12.24 (D4S4D_4 \hookrightarrow S_4)

Label the vertices of a square 1,2,3,41, 2, 3, 4 (clockwise). Then the rotation r=(1  2  3  4)r = (1\;2\;3\;4) and the reflection s=(2  4)s = (2\;4) (across the vertical axis through vertices 11 and 33) generate D4D_4. Since D4=8<24=S4|D_4| = 8 < 24 = |S_4|, the embedding D4S4D_4 \hookrightarrow S_4 is proper. D4D_4 is a subgroup of S4S_4 but not the whole group.

The relation sr=r1ssr = r^{-1}s can be verified in cycle notation:

sr=(2  4)(1  2  3  4)=(1  4  3  2)(2  4)=r1s.sr = (2\;4)(1\;2\;3\;4) = (1\;4\;3\;2)(2\;4) = r^{-1}s. \quad\checkmark

§12.10 Lang’s perspective: the Euclidean group

From Lang’s viewpoint, this chapter is the first place where a naturally occurring nontrivial semidirect product becomes impossible to ignore.

Definition 12.25 (Semidirect product)

Let NN and HH be groups, and let

α:HAut(N)\alpha : H \to \operatorname{Aut}(N)

be a homomorphism describing an action of HH on NN by automorphisms. The semidirect product NαHN \rtimes_\alpha H is the set N×HN \times H with multiplication

(n1,h1)(n2,h2)=(n1α(h1)(n2), h1h2).(n_1,h_1)(n_2,h_2)=\bigl(n_1\,\alpha(h_1)(n_2),\ h_1h_2\bigr).

If the action is trivial, so that α(h)=idN\alpha(h)=\operatorname{id}_N for every hh, then this reduces to the direct product:

(n1,h1)(n2,h2)=(n1n2,h1h2).(n_1,h_1)(n_2,h_2)=(n_1n_2,h_1h_2).

So semidirect products are the correct generalization of direct products when one factor twists the other by conjugation.

Theorem 12.26. Isom(R2)R2O(2)\operatorname{Isom}(\mathbb{R}^2) \cong \mathbb{R}^2 \rtimes O(2).

Here the action of O(2)O(2) on R2\mathbb{R}^2 is the obvious linear action:

Av=Av.A \cdot \mathbf{v} = A\mathbf{v}.

Figure: the Euclidean group as a semidirect product.

Translations form the normal subgroup, orthogonal maps supply the linear part, and the action arrow records how rotations and reflections twist translations by conjugation.

Why this is not a direct product

The distinction matters. Let R=R90R=R_{90^\circ} be rotation by 9090^\circ about the origin, and let T=T(1,0)T=T_{(1,0)} be translation by (1,0)(1,0).

Then

RT(x)=R(x+(1,0))=R(x)+(0,1),R\circ T(\mathbf{x})=R(\mathbf{x}+(1,0))=R(\mathbf{x})+(0,1),

while

TR(x)=R(x)+(1,0).T\circ R(\mathbf{x})=R(\mathbf{x})+(1,0).

These are different isometries. So the rotation subgroup and translation subgroup do not commute elementwise, which rules out a direct product decomposition.

This is the concrete content of the twisting term A1v2A_1\mathbf{v}_2 in the semidirect product law.

The normal subgroup and the quotient

Let

T={Tv:vR2}R2\mathcal{T}=\{T_{\mathbf{v}}:\mathbf{v}\in \mathbb{R}^2\}\cong \mathbb{R}^2

be the translation subgroup. We already know from Remark 12.7 that TE(2)\mathcal{T}\trianglelefteq E(2).

The quotient by translations is

E(2)/TO(2),E(2)/\mathcal{T}\cong O(2),

because the quotient remembers only the linear part AA. So the Euclidean group sits in a short exact sequence

1R2E(2)O(2)1.1\to \mathbb{R}^2 \to E(2)\to O(2)\to 1.

The semidirect product description says this sequence splits: there is an actual subgroup of E(2)E(2) isomorphic to O(2)O(2), namely the origin-fixing isometries.

Orientation-preserving isometries

The determinant separates the full Euclidean group into two large pieces:

  • det(A)=+1\det(A)=+1: translations and rotations;
  • det(A)=1\det(A)=-1: reflections and glide reflections.

So the orientation-preserving subgroup is

E+(2)=R2SO(2).E^+(2)=\mathbb{R}^2\rtimes SO(2).

This is the subgroup of all isometries of the form

xRθx+v.\mathbf{x}\mapsto R_\theta \mathbf{x}+\mathbf{v}.

Why this viewpoint is worth keeping

The semidirect product structure explains several earlier facts at once:

  • translations are normal because ATvA1=TAvA T_{\mathbf{v}} A^{-1}=T_{A\mathbf{v}};
  • rotations about the origin form the complementary subgroup SO(2)SO(2);
  • finite dihedral groups fit the same pattern: DnCnC2,D_n \cong C_n \rtimes C_2, where the nontrivial element of C2C_2 acts on CnC_n by inversion;
  • Chapter 15’s extension language will repackage this as a split exact sequence.

So Lang’s lesson here is not only that plane isometries can be classified. It is that a natural geometric group already has an internal architecture:

translationstwisted byorthogonal linear symmetries.\text{translations} \quad \text{twisted by} \quad \text{orthogonal linear symmetries}.

Bridge to Chapter 15 — semidirect products become split exact sequences

Chapter 12 is the first place in these notes where a semidirect product is not an artificial construction but a naturally occurring answer.

The two guiding examples are:

  • the Euclidean group 1R2E(2)O(2)1,1\to \mathbb{R}^2 \to E(2)\to O(2)\to 1, together with E(2)R2O(2);E(2)\cong \mathbb{R}^2\rtimes O(2);
  • the dihedral group 1CnDnC21,1\to C_n\to D_n\to C_2\to 1, together with DnCnC2.D_n\cong C_n\rtimes C_2.

The key structural point is that both quotient maps admit sections:

  • the subgroup of origin-fixing orthogonal maps inside E(2)E(2);
  • the reflection subgroup inside DnD_n.

That is exactly the phenomenon Chapter 15 - Factor-Group Computations and Simple Groups will rename a split short exact sequence.

So the bridge is:

  • Chapter 12: geometry produces semidirect products;
  • Chapter 15: exact-sequence language explains why those semidirect products occur.

If you keep this bridge in mind, then Chapter 15 will feel like a clarification of Chapter 12 rather than a sudden new abstraction.


§12.11 Worked examples

Example 12.27 (Composing two reflections in parallel lines)

Let σ1\sigma_1 be reflection across the line y=1y = 1 and σ2\sigma_2 be reflection across the line y=4y = 4.

σ1(x,y)=(x,2y)\sigma_1(x, y) = (x, 2 - y) and σ2(x,y)=(x,8y)\sigma_2(x, y) = (x, 8 - y).

Their composition:

σ2σ1(x,y)=σ2(x,2y)=(x,8(2y))=(x,y+6).\sigma_2 \circ \sigma_1(x, y) = \sigma_2(x, 2 - y) = (x, 8 - (2 - y)) = (x, y + 6).

This is translation by (0,6)(0, 6). Note 6=2×36 = 2 \times 3, twice the distance between the lines. \checkmark

Example 12.28 (Composing two reflections in intersecting lines)

Let σx\sigma_x be reflection across the xx-axis and σ45\sigma_{45} be reflection across the line y=xy = x (which makes 45°45° with the xx-axis).

σx(x,y)=(x,y)\sigma_x(x, y) = (x, -y) and σ45(x,y)=(y,x)\sigma_{45}(x, y) = (y, x).

Their composition:

σ45σx(x,y)=σ45(x,y)=(y,x)=R90°(x,y).\sigma_{45} \circ \sigma_x(x, y) = \sigma_{45}(x, -y) = (-y, x) = R_{90°}(x, y).

Indeed, 2×45°=90°2 \times 45° = 90°. \checkmark

Example 12.29 (Identifying an isometry)

The map ϕ(x,y)=(y+2,x3)\phi(x, y) = (-y + 2, x - 3) can be written as

ϕ(x)=(0110)(xy)+(23).\phi(\mathbf{x}) = \begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix}\begin{pmatrix} x \\ y \end{pmatrix} + \begin{pmatrix} 2 \\ -3 \end{pmatrix}.

Here A=R90°A = R_{90°}, so det(A)=+1\det(A) = +1 and AIA \neq I. By the classification, ϕ\phi is a rotation. The center is the fixed point, found by solving (IA)x=b(I - A)\mathbf{x} = \mathbf{b}:

(1111)(xy)=(23)    x=52,y=12.\begin{pmatrix} 1 & 1 \\ -1 & 1 \end{pmatrix}\begin{pmatrix} x \\ y \end{pmatrix} = \begin{pmatrix} 2 \\ -3 \end{pmatrix} \implies x = \frac{5}{2},\quad y = -\frac{1}{2}.

So ϕ\phi is rotation by 90°90° about (52,12)\left(\frac{5}{2}, -\frac{1}{2}\right).


§12.13 Flashcard-ready summary

Key facts to memorize

  1. Isometry: distance-preserving bijection R2R2\mathbb{R}^2 \to \mathbb{R}^2; always has the form ϕ(x)=Ax+b\phi(\mathbf{x}) = A\mathbf{x} + \mathbf{b} with AO(2)A \in O(2).
  2. Classification: every plane isometry is exactly one of: translation, rotation, reflection, or glide reflection.
  3. Orientation: det(A)=+1\det(A) = +1 (translations, rotations) or det(A)=1\det(A) = -1 (reflections, glide reflections).
  4. Two parallel reflections \to translation (by twice the distance between the lines).
  5. Two intersecting reflections \to rotation (by twice the angle between the lines).
  6. Every isometry = product of at most 3 reflections.
  7. Reflection has order 2. Glide reflection has infinite order.
  8. Translations form a normal subgroup (R2,+)\cong (\mathbb{R}^2, +).
  9. Rotations about the origin: SO(2)S1R/2πZSO(2) \cong S^1 \cong \mathbb{R}/2\pi\mathbb{Z}.
  10. Leonardo’s theorem: every finite subgroup of Isom(R2)\operatorname{Isom}(\mathbb{R}^2) is CnC_n or DnD_n.
  11. DnD_n: symmetry group of regular nn-gon, order 2n2n, relations rn=s2=er^n = s^2 = e, sr=r1ssr = r^{-1}s.
  12. D3S3D_3 \cong S_3 and DnSnD_n \hookrightarrow S_n by labeling vertices.
  13. Euclidean group: E(2)=R2O(2)E(2) = \mathbb{R}^2 \rtimes O(2) (semidirect product).

What should be mastered before leaving Chapter 12

  • State the definition of a plane isometry and its affine form Ax+bA\mathbf{x} + \mathbf{b}
  • Classify a given isometry into translation, rotation, reflection, or glide reflection
  • Use orientation (det=±1\det = \pm 1) and fixed-point count to determine the type
  • Compute the composition of two reflections in both key cases (parallel / intersecting)
  • Know that every isometry decomposes into at most three reflections
  • Identify the symmetry group of a regular nn-gon as DnD_n and its rotation subgroup as CnC_n
  • State and justify Leonardo’s theorem (finite subgroups are CnC_n or DnD_n)
  • Write elements of DnD_n as permutations in SnS_n by labeling vertices
  • Explain the semidirect product structure E(2)=R2O(2)E(2) = \mathbb{R}^2 \rtimes O(2)
  • Solve classification and composition problems in coordinates