A plane crystallographic group is a discrete subgroup of the Euclidean plane's isometry group with compact quotient; equivalently a compact set has translates covering the plane. We prove the crystallographic restriction theorem without assuming its conclusion. The orientation-preserving subgroup has index at most two and still has a cocompact group action. Its subgroup of translations is discrete as an additive subgroup of .
Suppose were trivial. Linear parts of orientation-preserving plane isometries commute, so every group commutator in is a translation. Thus would be an abelian group. Every member would then commute with the given nontrivial rotation and preserve its unique fixed point. A discrete subgroup of the compact rotation group about that point is finite. Then would be finite, contradicting cocompactness on the unbounded plane. Hence contains a nonzero vector .
If is a half-turn its order is already two. Otherwise its linear part rotates to a linearly independent vector , and conjugating translations shows that . Thus spans the plane and is a euclidean lattice. A discrete additive subgroup meets every bounded closed set in finitely many points: an accumulating sequence would give nonzero differences tending to zero, contradicting isolation of the identity. To see the euclidean lattice assertion directly, choose a shortest nonzero translation . Translations on its line are integer multiples of . Reducing all parallel components modulo shows that nonzero perpendicular components are bounded away from zero, since otherwise infinitely many translation vectors would accumulate in a compact rectangle. Choose a vector with the smallest positive perpendicular component; reducing by and then proves .
Conjugation by preserves this euclidean lattice. In its euclidean lattice basis, is therefore an invertible integer matrix with determinant one. Its trace is an integer and is also , where is the rotation angle. Since is nontrivial,
These values give angles of order respectively. Hence
For a plane crystallographic group, the translation subgroup consists of translations by vectors in a rank-two lattice ; the lattice is this additive group of translation vectors. The point group is the image under the linear-part homomorphism , equivalently . Conjugating a translation by an isometry with linear part gives translation by , so every point-group element preserves .
Choose a lattice basis. A point-group rotation is represented in that basis by an integral matrix, because it maps lattice vectors to lattice vectors, and its inverse does likewise. The trace is therefore an integer. In an orthonormal basis the same rotation has trace , which lies between minus two and two. Hence . The value two gives the identity, while the other values give angles , , , or . Thus every nonidentity rotation has order
This proves the crystallographic restriction theorem from the lattice action rather than assuming the classification of wallpaper groups.
A plane plane crystallographic group is a discrete subgroup of the Euclidean isometry group with compact quotient. Its translations form a normal rank-two Euclidean lattice ; this is the standard translation-lattice structure of a plane crystallographic group. Its point group is the finite group of linear parts, equivalently the quotient by those translations. Conjugating a translation by an isometry sends its translation vector to its image under the linear part, so every point-group element preserves .
Choose a Euclidean lattice basis. A rotational linear part is then represented by an integer matrix , since it sends the basis to Euclidean lattice vectors. In an orthonormal basis the same map has eigenvalues , and its trace is independent of basis. Thus
These possibilities give rotation angles, modulo a full turn, , , , , and , respectively. Consequently the crystallographic restriction theorem is
The restriction comes from integrality of the Euclidean lattice action, not simply from finiteness of the point group.