International
Tables for Crystallography Volume A Space-group symmetry Edited by M. I. Aroyo © International Union of Crystallography 2016 |
International Tables for Crystallography (2016). Vol. A. ch. 1.3, pp. 22-23
Section 1.3.2.1. Basic properties of lattices
^{
a
}
Radboud University Nijmegen, Faculty of Science, Mathematics and Computing Science, Institute for Mathematics, Astrophysics and Particle Physics, Postbus 9010, 6500 GL Nijmegen, The Netherlands |
The two-dimensional vector space is the space of columns with two real components and the three-dimensional vector space is the space of columns with three real components . Analogously, the -dimensional vector space is the space of columns with n real components.
For the sake of clarity we will restrict our discussions to three-dimensional (and occasionally two-dimensional) space. The generalization to n-dimensional space is straightforward and only requires dealing with columns of n instead of three components and with bases consisting of n instead of three basis vectors.
Definition
For vectors forming a basis of the three-dimensional vector space , the set of all integral linear combinations of is called a lattice in and the vectors are called a lattice basis of .
It is inherent in the definition of a crystal pattern that the translation vectors of the translations leaving the pattern invariant are closed under taking integral linear combinations. Since the crystal pattern is assumed to be discrete, it follows that all translation vectors can be written as integral linear combinations of a finite generating set. The fundamental theorem on finitely generated abelian groups (see e.g. Chapter 21 in Armstrong, 1997) asserts that in this situation a set of three translation vectors can be found such that all translation vectors are integral linear combinations of these three vectors. This shows that the translation vectors of a crystal pattern form a lattice with lattice basis in the sense of the definition above.
By definition, a lattice is determined by a lattice basis. Note, however, that every two- or three-dimensional lattice has infinitely many bases.
Example
The square latticein has the vectorsas its standard lattice basis. Butis also a lattice basis of : on the one hand and are integral linear combinations of and are thus contained in . On the other handandhence and are also integral linear combinations of and thus the two bases and both span the same lattice (see Fig. 1.3.2.1).
The example indicates how the different lattice bases of a lattice can be described. Recall that for a vector = the coefficients are called the coordinates and the vector is called the coordinate column of with respect to the basis . The coordinate columns of the vectors in with respect to a lattice basis are therefore simply columns with three integral components. In particular, if we take a second lattice basis of , then the coordinate columns of , , with respect to the first basis are columns of integers and thus the basis transformation such that is an integral 3 × 3 matrix. But if we interchange the roles of the two bases, they are related by the inverse transformation , i.e. , and the argument given above asserts that is also an integral matrix. Now, on the one hand and are both integers (being determinants of integral matrices), on the other hand . This is only possible if .
Summarizing, the different lattice bases of a lattice are obtained by transforming a single lattice basis with integral transformation matrices such that .
References
Armstrong, M. A. (1997). Groups and Symmetry. New York: Springer.Google Scholar