Linear algebra (Osnabrück 2024-2025)/Part II/Lecture 51
- Numerical conditions for finite symmetry groups in space
Let be a finite subgroup of order of the group of proper, linear isometries of . Let be the different classes of semiaxes of , and for every class, let , , be the order of the stabilizer group , , which are, due to Lemma 50.9 , independent of . Then
For two opposite semiaxes and , we have . For two semiaxes and that do not belong to the same axis (in particular, they are different) we have the relation , because an isometry with two rotation axes is the identity. Since is the union of all , , we have a union
where every group element appears twice on the right-hand side. Therefore,
The classes contain elements. Hence,
Dividing by yields the claim.
and with
has the following integer solutions.- , and .
- In case
,
there are the possibilities
- , and ,
- , , and ,
- , , , and ,
- , , , and .
For , we muss have but this does not have a solution for . For , the condition becomes
with
.
The left-hand side is . Because of
,
at least one them is
.
So suppose
.
For
,
the right-hand side is again , so that
holds. The value
leads to the solution
,
the value
leads to the solution
,
and the value
leads to the solution
.
For
,
the right-hand side is again , so that there is no further solution.
For
,
the condition has the form
This has no solution, because the right-hand side is , since the first four summands yield at most , and the further summands can be bounded by .
- Geometric realizations of finite symmetry groups

The last lemma contains the decisive numerical conditions how a finite symmetry group in can look like. Besides the trivial group, where holds, this lemma encompasses all finite groups. The tuple consisting in the two or three orders of the stabilizer groups is also called the numerical type of the symmetry group. Every given condition can be realized essentially uniquely by a finite symmetry group. However, the geometric object is not uniquely determined, as already the "dual pair“ cube and octahedron shows.
Let be a finite subgroup of order of the group of proper linear isometries of , with two different classes of semiaxes for . Then is the cyclic group
of rotations around one fixed rotation axis for multiples of the angle .Because of Lemma 51.1 and Lemma 51.2 , we must have , and every class of semiaxes contains only one semiaxis. Therefore, there does only exist one rotation axis, and this symmetry group is, according to Lemma 34.1 , isomorphis to a symmetry group in the plane orthogonal to this axis. Due to Theorem 50.4 , this group is isomorphic to the cyclic group of order .
In this case, there are two classes of semiaxes, each consisting in one semiaxes.
Let be a finite subgroup of the group of proper linear isometries in of type . Then is isomorphic to the dihedral group
.There are three classes of semiaxes, say , , . Two of them have order (each class with semiaxes), and one has order and two semiaxes (the numbers of the semiaxes follow with from Lemma 51.2 ). For , the two semiaxes from the third class form a line, because the opposite semiaxis has the same ordwe. For , every semiaxis is equivalent to its opposite semiaxis. We denote the axis of by . Every group element with another rotation axis must transform the two semiaxes from into each other, so that all other axes are orthogonal to . Let denote a generating rotation around . For a semiaxis from , the
are exactly all semiaxes from . These (or rather the points on these axes of norm ) form a regular -gon in the plane orthogonal to . The same holds for with . Every rotation about degree around an axis from permutes the semiaxes from . Therefore, the semiaxes from yield a "bisection“ of the -gon. Hence, the group is the (improper) symmetry group of a regular -gon, or the proper symmetry group of a bipyramid over a regular -gon, that is, it is a dihedral group .
In this case, the two classes of order two consist, on one hand, in the vertices, and, on the other hand, in the centers of the edges of the underlying regular -gon. If is even, then the opposite semiaxes are equivalent, if is odd, then they are not equivalent. If , then the dihedral group (that is, ) is commutative, and isomorphic to the Klein four-group.
Let be a finite subgroup of the group of proper linear isometries in with a fixed class of semiaxes . Then the mapping
is a
group homomorphism.Due to the definition of a class of semiaxes, for we also have for all . Therefore, the mapping is well-defined. Let . Then we have
Let be a finite subgroup of the group of proper linear isometries in of type . Then is the tetrahedral group, and isomorphic to the alternating group
.Due to the condition, there are three classes of semiaxes of order and ; the number of elements in these classes is and . We consider a class of semiaxes of order , with the four equivalent semiaxes, and the corresponding group homomorphism
Let be a rotation by degree around a semiaxis . It fixes , and it gives a permutation of the three other semiaxes in the class. This permutation can not be the identity; otherwise, would fix two axes and then were the identity. Since has order , this permutation is a -cycle. In particular, the four semiaxes belong to different axes, and the rotation induces the other -cycle. Since we can perform this consideration with every semiaxis from , we can deduce that induces every -cycle of the permutation group of the four semiaxes. This means that the image of the group homomorphism is exactly the alternating group ; hence, . This group is isomorphic to the tetrahedral group, see Exercise 50.25 .
In the preceding statement, we can deduce directly that we are dealing with the group of the tetrahedron. To see this, we mark on every semiaxis the point with distance to the origin. The proof of the lemma implies that any two of these points have the same distance to each other (and that the angles between the semiaxes are always the samr). Hence, these four points form the vertices of a tetrahedron. The opposite semiaxes correspont to the centers of the faces of the tetrahedron. The semiaxes with order two correspond to the midpoints of the edges.
Let be a finite subgroup of the group of proper linear isometries in of type . Then is isomorphic to the permutation group , and to the
cube group.We consider the class of semiaxes of order , which contains semiaxes equivalent to each other. For such a semiaxis , the opposite semiaxis belongs also to a class of semiaxes with the same order. Therefore, belongs to , so that semiaxes of belong to four axes. We denote the set of these axes by . We consider the group homomorphism
Here, we look at the action on the axes, not at the action on the semiaxes. We claim that not three of these four axes lie in a plane. For if , then a rotation about degree around , call it , would produce the equivalent axes and , but these can not lie in the plane , and they can not both equal . Suppose that the element has the property, that is the identity. This means that all lines are mapped to themselves. Due to Exercise 51.15 , is the identity. Therefore, according to the kernel criterion, the group homomorphism is injective. Hence, we have an isomorphism. In particular, we can apply this reasoning for the cube group; this gives the isomorphism between the cube group and the permutation group .
With a similar but more complicated argument, one can show that the remaining numerical possibility, that is, a group with elements and with the rotation orders
and ,
is realized by just one type of isomorphy, namely that of the alternating group , and that it is isomorphic to the group of the dodecahedron and to the group of the icosahededron.
Altogether, we have proven (up to the case of the icosahedron) the following main theorem about finite (proper) symmetry groups in space.
Let be a finite subgroup of the group of proper linear isometries in . Then is one of the following groups.
- A cyclic group , ,
- A dihedral group , ,
- The tetrahedral group ,
- The cube group ,
- The icosahedron group .
| << | Linear algebra (Osnabrück 2024-2025)/Part II | >> PDF-version of this lecture Exercise sheet for this lecture (PDF) |
|---|