The crystallographic restriction theorem in its basic form was based on the observation that the rotational symmetries of a crystal are usually limited to 2-fold, 3-fold, 4-fold, and 6-fold. However, quasicrystals can occur with other diffraction pattern symmetries, such as 5-fold; these were not discovered until 1982 by Dan Shechtman.[1]
Crystals are modeled as discrete lattices, generated by a list of independent finite translations . Because discreteness requires that the spacings between lattice points have a lower bound, the group of rotational symmetries of the lattice at any point must be a finite group (alternatively, the point is the only system allowing for infinite rotational symmetry). The strength of the theorem is that not all finite groups are compatible with a discrete lattice; in any dimension, we will have only a finite number of compatible groups.
The special cases of 2D (wallpaper groups) and 3D (space groups) are most heavily used in applications, and they can be treated together.
A rotation symmetry in dimension 2 or 3 must move a lattice point to a succession of other lattice points in the same plane, generating a regular polygon of coplanar lattice points. We now confine our attention to the plane in which the symmetry acts, illustrated with lattice vectors in the figure.
Now consider an 8-fold rotation, and the displacement vectors between adjacent points of the polygon. If a displacement exists between any two lattice points, then that same displacement is repeated everywhere in the lattice. So collect all the edge displacements to begin at a single lattice point. The edge vectors become radial vectors, and their 8-fold symmetry implies a regular octagon of lattice points around the collection point. But this is impossible, because the new octagon is about 80% as large as the original. The significance of the shrinking is that it is unlimited. The same construction can be repeated with the new octagon, and again and again until the distance between lattice points is as small as we like; thus no discrete lattice can have 8-fold symmetry. The same argument applies to any k-fold rotation, for k greater than 6.
A shrinking argument also eliminates 5-fold symmetry. Consider a regular pentagon of lattice points. If it exists, then we can take every other edge displacement and (head-to-tail) assemble a 5-point star, with the last edge returning to the starting point. The vertices of such a star are again vertices of a regular pentagon with 5-fold symmetry, but about 60% smaller than the original.
Thus the theorem is proved.
The existence of quasicrystals and Penrose tilings shows that the assumption of a linear translation is necessary. Penrose tilings may have 5-fold rotational symmetry and a discrete lattice, and any local neighborhood of the tiling is repeated infinitely many times, but there is no linear translation for the tiling as a whole. And without the discrete lattice assumption, the above construction not only fails to reach a contradiction, but produces a (non-discrete) counterexample. Thus 5-fold rotational symmetry cannot be eliminated by an argument missing either of those assumptions. A Penrose tiling of the whole (infinite) plane can only have exact 5-fold rotational symmetry (of the whole tiling) about a single point, however, whereas the 4-fold and 6-fold lattices have infinitely many centres of rotational symmetry.
Consider two lattice points A and B separated by a translation vector r. Consider an angle α such that a rotation of angle α about any lattice point is a symmetry of the lattice. Rotating about point B by α maps point A to a new point A'. Similarly, rotating about point A by α maps B to a point B'. Since both rotations mentioned are symmetry operations, A' and B' must both be lattice points. Due to periodicity of the crystal, the new vector r' which connects them must be equal to an integer multiple of r:
r'=mr
with
m
r=|r|
r'=|r'|
r'=2r\cos\alpha-r.
Combining the two equations gives:
\cos\alpha=
| m+1 | |
| 2 |
=
| M | |
| 2 |
where
M=m+1
|\cos\alpha|\le1
M\in\{-2,-1,0,1,2\}
\alpha
Consider a line of atoms A-O-B, separated by distance a. Rotate the entire row by θ = +2π/n and θ = −2π/n, with point O kept fixed. After the rotation by +2π/n, A is moved to the lattice point C and after the rotation by -2π/n, B is moved to the lattice point D. Due to the assumed periodicity of the lattice, the two lattice points C and D will be also in a line directly below the initial row; moreover C and D will be separated by r = ma, with m an integer. But by trigonometry, the separation between these points is:
2a\cos{\theta}=2a\cos{
| 2\pi | |
| n |
Equating the two relations gives:
| 2\cos{ | 2\pi |
| n |
This is satisfied by only n = 1, 2, 3, 4, 6.
For an alternative proof, consider matrix properties. The sum of the diagonal elements of a matrix is called the trace of the matrix. In 2D and 3D every rotation is a planar rotation, and the trace is a function of the angle alone. For a 2D rotation, the trace is 2 cos θ; for a 3D rotation, 1 + 2 cos θ.
Examples
\begin{bmatrix}{1/2}&-{\sqrt{3}/2}\ {\sqrt{3}/2}&{1/2}\end{bmatrix}
The trace is precisely 1, an integer.
\begin{bmatrix}{1/\sqrt{2}}&-{1/\sqrt{2}}\ {1/\sqrt{2}}&{1/\sqrt{2}}\end{bmatrix}
The trace is 2/, not an integer.
Selecting a basis formed from vectors that spans the lattice, neither orthogonality nor unit length is guaranteed, only linear independence. However the trace of the rotation matrix is the same with respect to any basis. The trace is a similarity invariant under linear transformations. In the lattice basis, the rotation operation must map every lattice point into an integer number of lattice vectors, so the entries of the rotation matrix in the lattice basis – and hence the trace – are necessarily integers. Similar as in other proofs, this implies that the only allowed rotational symmetries correspond to 1,2,3,4 or 6-fold invariance. For example, wallpapers and crystals cannot be rotated by 45° and remain invariant, the only possible angles are: 360°, 180°, 120°, 90° or 60°.
Example
\begin{bmatrix}0&-1\ 1&1\end{bmatrix}
The trace is still 1. The determinant (always +1 for a rotation) is also preserved.
The general crystallographic restriction on rotations does not guarantee that a rotation will be compatible with a specific lattice. For example, a 60° rotation will not work with a square lattice; nor will a 90° rotation work with a rectangular lattice.
When the dimension of the lattice rises to four or more, rotations need no longer be planar; the 2D proof is inadequate. However, restrictions still apply, though more symmetries are permissible. For example, the hypercubic lattice has an eightfold rotational symmetry, corresponding to an eightfold rotational symmetry of the hypercube. This is of interest, not just for mathematics, but for the physics of quasicrystals under the cut-and-project theory. In this view, a 3D quasicrystal with 8-fold rotation symmetry might be described as the projection of a slab cut from a 4D lattice.
The following 4D rotation matrix is the aforementioned eightfold symmetry of the hypercube (and the cross-polytope):
A=\begin{bmatrix}0&0&0&-1\ 1&0&0&0\ 0&-1&0&0\ 0&0&-1&0\end{bmatrix}.
B=\begin{bmatrix}-1/2&0&-1/2&\sqrt2/2\ 1/2&\sqrt2/2&-1/2&0\ -1/2&0&-1/2&-\sqrt2/2\ -1/2&\sqrt2/2&1/2&0\end{bmatrix}
BAB-1=\begin{bmatrix}\sqrt2/2&\sqrt2/2&0&0\ -\sqrt2/2&\sqrt2/2&0&0\ 0&0&-\sqrt2/2&\sqrt2/2\ 0&0&-\sqrt2/2&-\sqrt2/2\end{bmatrix}.
The A4 lattice and F4 lattice have order 10 and order 12 rotational symmetries, respectively.
To state the restriction for all dimensions, it is convenient to shift attention away from rotations alone and concentrate on the integer matrices . We say that a matrix A has order k when its k-th power (but no lower), Ak, equals the identity. Thus a 6-fold rotation matrix in the equilateral triangle basis is an integer matrix with order 6. Let OrdN denote the set of integers that can be the order of an N×N integer matrix. For example, Ord2 = . We wish to state an explicit formula for OrdN.
Define a function ψ based on Euler's totient function φ; it will map positive integers to non-negative integers. For an odd prime, p, and a positive integer, k, set ψ(pk) equal to the totient function value, φ(pk), which in this case is pk−pk−1. Do the same for ψ(2k) when k > 1. Set ψ(2) and ψ(1) to 0. Using the fundamental theorem of arithmetic, we can write any other positive integer uniquely as a product of prime powers, m = Πα pα
k α; set ψ(m) = Σα ψ(pαk α). This differs from the totient itself, because it is a sum instead of a product.The crystallographic restriction in general form states that OrdN consists of those positive integers m such that ψ(m) ≤ N.
| m | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | |
| ψ(m) | 0 | 0 | 2 | 2 | 4 | 2 | 6 | 4 | 6 | 4 | 10 | 4 | 12 | 6 | 6 | 8 | 16 | 6 | 18 | 6 | 8 | 10 | 22 | 6 | 20 | 12 | 18 | 8 | 28 | 6 | 30 |
For m>2, the values of ψ(m) are equal to twice the algebraic degree of cos(2π/m); therefore, ψ(m) is strictly less than m and reaches this maximum value if and only if m is a prime.
These additional symmetries do not allow a planar slice to have, say, 8-fold rotation symmetry. In the plane, the 2D restrictions still apply. Thus the cuts used to model quasicrystals necessarily have thickness.
Integer matrices are not limited to rotations; for example, a reflection is also a symmetry of order 2. But by insisting on determinant +1, we can restrict the matrices to proper rotations.
The crystallographic restriction theorem can be formulated in terms of isometries of Euclidean space. A set of isometries can form a group. By a discrete isometry group we will mean an isometry group that maps each point to a discrete subset of RN, i.e. the orbit of any point is a set of isolated points. With this terminology, the crystallographic restriction theorem in two and three dimensions can be formulated as follows.
For every discrete isometry group in two- and three-dimensional space which includes translations spanning the whole space, all isometries of finite order are of order 1, 2, 3, 4 or 6.Isometries of order n include, but are not restricted to, n-fold rotations. The theorem also excludes S8, S12, D4d, and D6d (see point groups in three dimensions), even though they have 4- and 6-fold rotational symmetry only.Rotational symmetry of any order about an axis is compatible with translational symmetry along that axis.
The result in the table above implies that for every discrete isometry group in four- and five-dimensional space which includes translations spanning the whole space, all isometries of finite order are of order 1, 2, 3, 4, 5, 6, 8, 10, or 12.
All isometries of finite order in six- and seven-dimensional space are of order 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 18, 20, 24 or 30 .