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 that preserves Euclidean distance:
for all .
Theorem 12.2. The set of all plane isometries forms a group under composition.
Proof
We verify the group axioms.
Closure. If and are distance-preserving bijections, then is also a bijection (composition of bijections), and
So is an isometry.
Associativity. Composition of functions is always associative.
Identity. The identity map is trivially an isometry.
Inverses. Since is a bijection, it has an inverse . For any , apply to the points and :
Hence also preserves distance, so it is an isometry.
This group is called the Euclidean group of the plane, or the isometry group .
Theorem 12.3 (Affine form of an isometry)
Every plane isometry can be written in the form
where is an orthogonal matrix (satisfying ) and .
Proof outline
Step 1. An isometry that fixes the origin is linear. If and preserves all distances, then it preserves all inner products (by the polarization identity ). A linear map preserving the inner product is orthogonal, so with .
Step 2. For a general isometry , define . Then is an isometry fixing the origin, so for some . Setting , we get .
Since , we have . 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:
| Type | Orientation | Fixed points |
|---|---|---|
| Translation | Preserving () | None (unless , i.e., identity) |
| Rotation | Preserving () | Exactly one (the center) |
| Reflection | Reversing () | An entire line (the axis) |
| Glide reflection | Reversing () | None |
Proof outline via fixed-point analysis
Let be a plane isometry.
Case 1: and . Then , which is a translation.
Case 2: and . Then is a nontrivial rotation matrix . The fixed-point equation becomes . Since and , one checks that for . Hence there is a unique fixed point, and is a rotation about that point.
Case 3: and has a fixed point . Conjugating by the translation , we may assume , so with , . Such has eigenvalues and , so is a reflection across the eigenspace for .
Case 4: and has no fixed point. Then is a glide reflection: a reflection across some line followed by a nonzero translation parallel to that line. (The glide component is the part of parallel to the reflection axis; if it were zero, would have fixed points.)
This classification is exhaustive and mutually exclusive. The identity map is conventionally grouped with translations () or with rotations (); either convention is harmless.
§12.3 Translations
Definition 12.5 (Translation)
For , the translation by is
Theorem 12.6. The set of translations forms a subgroup isomorphic to .
Proof
Define . We verify:
- Closure: .
- Identity: .
- Inverses: .
The map is a group isomorphism since .
Remark 12.7
The group of translations is abelian (since vector addition is commutative) and is a normal subgroup of : for any isometry ,
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 about point is the isometry
where is the standard rotation matrix. In the special case :
Theorem 12.9. The rotations about the origin form a group isomorphic to .
Proof
The set is closed under composition (), has identity , and inverses . The map is a surjective homomorphism with kernel , so
where is the circle group (unit complex numbers under multiplication).
Remark 12.10
A rotation has a unique fixed point, namely . The order of in is finite if and only if is rational. Concretely, has order and generates a cyclic subgroup .
§12.5 Reflections
Definition 12.11 (Reflection)
The reflection across a line is the isometry that sends each point to its mirror image across . In coordinates, if passes through the origin at angle from the -axis, then
Theorem 12.12. Every reflection has order .
Proof
(direct computation, or: reflecting twice across the same line returns every point to its original position). Hence and (it moves points not on ), so .
The fixed-point set of a reflection is exactly the line .
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.
Case 1: Parallel lines yield a translation
Choose coordinates so the two parallel lines are and . Then:
Their composition is
This is translation by , a vector perpendicular to the lines with magnitude twice the distance between them.
Case 2: Intersecting lines yield a rotation
Let two lines and meet at a point with angle between them. In coordinates centered at with along the -axis:
Their composition is:
This is rotation by about the intersection point .
Corollary 12.14
Every plane isometry is a product of at most three reflections.
Proof sketch
- A reflection is itself one reflection.
- A rotation is a composition of two reflections (in intersecting lines).
- A translation is a composition of two reflections (in parallel lines).
- A glide reflection is a composition of three reflections (a reflection plus a translation, which is itself two reflections).
§12.6 Glide reflections
Definition 12.15 (Glide reflection)
A glide reflection is the composition of a reflection across a line with a nonzero translation where is parallel to :
Remark 12.16
A glide reflection has no fixed points: if , then . But maps to and moves points off to the opposite side, so would have to lie on and simultaneously satisfy , contradicting .
The requirement is essential: with the map reduces to a reflection.
Example 12.17. The map is a glide reflection: it reflects across the -axis and then translates by .
§12.7 Orientation
Definition 12.18 (Orientation of an isometry)
An isometry is called:
- Orientation-preserving if .
- Orientation-reversing if .
Theorem 12.19. The orientation-preserving isometries form a normal subgroup of index in .
Proof
The map is a group homomorphism (since ). Its kernel is the set of orientation-preserving isometries, hence a normal subgroup. Its image is , so the index is .
Summary table
| Type | Orientation | Fixed points | |
|---|---|---|---|
| Translation () | Preserving | None | |
| Rotation () | Preserving | One point (center) | |
| Reflection | Reversing | A line (axis) | |
| Glide reflection | Reversing | None |
§12.8 Finite subgroups of the isometry group
Theorem 12.20 (Leonardo’s theorem)
Every finite subgroup of is isomorphic to either:
- a cyclic group (consisting of rotations about a common center), or
- a dihedral group (consisting of rotations and reflections).
Proof outline
Let be a finite subgroup of .
Step 1. contains no translations (other than the identity) and no glide reflections. A nonidentity translation has infinite order (applying repeatedly never returns to the identity), so it cannot belong to a finite group. Similarly, a glide reflection satisfies , so it also generates an infinite subgroup.
Step 2. Therefore consists only of rotations and reflections. All rotations in share a common fixed point (the center), and all reflection axes pass through this point. (If two rotations had different centers, their composition would produce translations.)
Step 3. The subgroup of rotations in is a finite subgroup of , hence cyclic: for some .
Step 4. If contains no reflections, then . If contains at least one reflection , then and the relation gives the presentation of .
Definition 12.21 (Dihedral group, geometric definition)
The dihedral group is the group of all symmetries of a regular -gon. It has order and is generated by a rotation and a reflection subject to:
The elements are .
Example 12.22 (Symmetry groups of familiar figures)
| Figure | Symmetry group | Order | Generators |
|---|---|---|---|
| Equilateral triangle | Rotation , any reflection | ||
| Square | Rotation , any reflection | ||
| Regular -gon | Rotation , any reflection | ||
| Circle | All rotations, any one reflection |
The orientation-preserving symmetries of a regular -gon form the cyclic subgroup , which has index and is therefore normal.
§12.9 Connection to Chapter 8: as a permutation group
Label the vertices of the regular -gon as . Each symmetry permutes these vertices, giving a faithful action . This embeds as a subgroup of .
Example 12.23 ()
Label the vertices of the triangle (clockwise). Then:
| Symmetry | Permutation |
|---|---|
| Identity | |
| Rotation () | |
| Rotation () | |
| Reflection (axis through vertex ) | |
| Reflection (axis through vertex ) | |
| Reflection (axis through vertex ) |
Since and is injective, we have .
Example 12.24 ()
Label the vertices of a square (clockwise). Then the rotation and the reflection (across the vertical axis through vertices and ) generate . Since , the embedding is proper. is a subgroup of but not the whole group.
The relation can be verified in cycle notation:
§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 and be groups, and let
be a homomorphism describing an action of on by automorphisms. The semidirect product is the set with multiplication
If the action is trivial, so that for every , then this reduces to the direct product:
So semidirect products are the correct generalization of direct products when one factor twists the other by conjugation.
Theorem 12.26. .
Here the action of on is the obvious linear action:
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.
Proof of Theorem 12.26
By Theorem 12.3, every isometry has a unique affine form
with and .
Define
Homomorphism. Compute:
This is exactly
so the multiplication law in the semidirect product is
Injective. If is the identity isometry, then
Setting gives , and then for all , so .
Surjective. Every isometry is of the form by Theorem 12.3, so every isometry lies in the image of .
Therefore is an isomorphism.
Why this is not a direct product
The distinction matters. Let be rotation by about the origin, and let be translation by .
Then
while
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 in the semidirect product law.
The normal subgroup and the quotient
Let
be the translation subgroup. We already know from Remark 12.7 that .
The quotient by translations is
because the quotient remembers only the linear part . So the Euclidean group sits in a short exact sequence
The semidirect product description says this sequence splits: there is an actual subgroup of isomorphic to , namely the origin-fixing isometries.
Orientation-preserving isometries
The determinant separates the full Euclidean group into two large pieces:
- : translations and rotations;
- : reflections and glide reflections.
So the orientation-preserving subgroup is
This is the subgroup of all isometries of the form
Why this viewpoint is worth keeping
The semidirect product structure explains several earlier facts at once:
- translations are normal because ;
- rotations about the origin form the complementary subgroup ;
- finite dihedral groups fit the same pattern: where the nontrivial element of acts on 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:
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 together with
- the dihedral group together with
The key structural point is that both quotient maps admit sections:
- the subgroup of origin-fixing orthogonal maps inside ;
- the reflection subgroup inside .
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 be reflection across the line and be reflection across the line .
and .
Their composition:
This is translation by . Note , twice the distance between the lines.
Example 12.28 (Composing two reflections in intersecting lines)
Let be reflection across the -axis and be reflection across the line (which makes with the -axis).
and .
Their composition:
Indeed, .
Example 12.29 (Identifying an isometry)
The map can be written as
Here , so and . By the classification, is a rotation. The center is the fixed point, found by solving :
So is rotation by about .
§12.13 Flashcard-ready summary
Key facts to memorize
- Isometry: distance-preserving bijection ; always has the form with .
- Classification: every plane isometry is exactly one of: translation, rotation, reflection, or glide reflection.
- Orientation: (translations, rotations) or (reflections, glide reflections).
- Two parallel reflections translation (by twice the distance between the lines).
- Two intersecting reflections rotation (by twice the angle between the lines).
- Every isometry = product of at most 3 reflections.
- Reflection has order 2. Glide reflection has infinite order.
- Translations form a normal subgroup .
- Rotations about the origin: .
- Leonardo’s theorem: every finite subgroup of is or .
- : symmetry group of regular -gon, order , relations , .
- and by labeling vertices.
- Euclidean group: (semidirect product).
What should be mastered before leaving Chapter 12
- State the definition of a plane isometry and its affine form
- Classify a given isometry into translation, rotation, reflection, or glide reflection
- Use orientation () 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 -gon as and its rotation subgroup as
- State and justify Leonardo’s theorem (finite subgroups are or )
- Write elements of as permutations in by labeling vertices
- Explain the semidirect product structure
- Solve classification and composition problems in coordinates