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-28
Section 1.3.2. 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 |
A crystal pattern is defined to be periodic in three linearly independent directions, which means that it is invariant under translations in three linearly independent directions. This periodicity implies that the crystal pattern extends infinitely in all directions. Since the atoms of a crystal form a discrete pattern in which two different points have a certain minimal distance, the translations that fix the crystal pattern as a whole cannot have arbitrarily small lengths. If is a vector such that the crystal pattern is invariant under a translation by , the periodicity implies that the pattern is invariant under a translation by for every integer m. Furthermore, if a crystal pattern is invariant under translations by and , it is also invariant by the composition of these two translations, which is the translation by . This shows that the set of vectors by which the translations in a space group move the crystal pattern is closed under taking integral linear combinations. This property is formalized by the mathematical concept of a lattice and the translation subgroups of space groups are best understood by studying their corresponding lattices. These lattices capture the periodic nature of the underlying crystal patterns and reflect their geometric properties.
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 .
In the three-dimensional vector space , the norm or length of a vector is (due to Pythagoras' theorem) given by From this, the scalar product is derived, which allows one to express angles by
The definition of a norm function for the vectors turns into a Euclidean space. A lattice that is contained in inherits the metric properties of this space. But for the lattice, these properties are most conveniently expressed with respect to a lattice basis. It is customary to choose basis vectors a, b, c which define a right-handed coordinate system, i.e. such that the matrix with columns a, b, c has a positive determinant.
Definition
For a lattice with lattice basis the metric tensor of is the 3 × 3 matrix If is the 3 × 3 matrix with the vectors as its columns, then the metric tensor is obtained as the matrix product . It follows immediately that the metric tensor is a symmetric matrix, i.e. .
Example
Letbe the basis of a lattice . Then the metric tensor of (with respect to the given basis) is
With the help of the metric tensor the scalar products of arbitrary vectors, given as linear combinations of the lattice basis, can be computed from their coordinate columns as follows: If and , then
From this it follows how the metric tensor transforms under a basis transformation . If , then the metric tensor of with respect to the new basis is given by
An alternative way to specify the geometry of a lattice in is using the cell parameters, which are the lengths of the lattice basis vectors and the angles between them.
Definition
For a lattice in with lattice basis the cell parameters (also called lattice parameters, lattice constants or metric parameters) are given by the lengths of the basis vectors and by the interaxial angles
Owing to the relation for the scalar product of two vectors, one can immediately write down the metric tensor in terms of the cell parameters:
A lattice can be used to subdivide into cells of finite volume which all have the same shape. The idea is to define a suitable subset of such that the translates of by the vectors in cover without overlapping. Such a subset is called a unit cell of L, or, in the more mathematically inclined literature, a fundamental domain of with respect to . Two standard constructions for such unit cells are the primitive unit cell and the Voronoï domain (which is also known by many other names).
Definition
Let be a lattice in with lattice basis .
See Fig. 1.3.2.2 for examples of these two types of unit cells in two-dimensional space.
It should be noted that the attribute `primitive' for a unit cell is often omitted. The term `unit cell' then either denotes a primitive unit cell in the sense of the definition above or a slight generalization of this, namely a cell spanned by vectors a, b, c which are not necessarily a lattice basis. This will be discussed in detail in the next section. If a unit cell in the even more general sense of a cell whose translates cover the whole space without overlap (thus including e.g. Voronoï domains) is meant, this should be indicated by the context.
The construction of the Voronoï domain is independent of the basis of , as the Voronoï domain is bounded by planes bisecting the line segment between the origin and a lattice point and perpendicular to this segment. In two-dimensional space, the Voronoï domain is simply bounded by lines, in three-dimensional space it is bounded by planes and more generally it is bounded by (n − 1)-dimensional hyperplanes in n-dimensional space.
The boundaries of the Voronoï domain and its translates overlap, thus in order to get a proper fundamental domain, part of the boundary has to be excluded from the Voronoï domain.
The volume V of the unit cell can be expressed both via the metric tensor and via the cell parameters. One has and thus Although the cell parameters depend on the chosen lattice basis, the volume of the unit cell is not affected by a transition to a different lattice basis . As remarked in Section 1.3.2.1, two lattice bases are related by an integral basis transformation of determinant and therefore , i.e. the determinant of the metric tensor is the same for all lattice bases.
Assuming that the vectors form a right-handed system, the volume can also be obtained via
The definition of a lattice as given in Section 1.3.2.1 states that a lattice consists precisely of the integral linear combinations of the vectors in a lattice basis. However, in crystallographic applications it has turned out to be convenient to work with bases that have particularly nice metric properties. For example, many calculations are simplified if the basis vectors are perpendicular to each other, i.e. if the metric tensor has all non-diagonal entries equal to zero. Moreover, it is preferable that the basis vectors reflect the symmetry properties of the lattice. By a case-by-case analysis of the different types of lattices a set of rules for convenient bases has been identified and bases conforming with these rules are called conventional bases. The conventional bases are chosen such that in all cases the integral linear combinations of the basis vectors are lattice vectors, but it is admitted that not all lattice vectors are obtained as integral linear combinations.
To emphasize that a basis has the property that the vectors of a lattice are precisely the integral linear combinations of the basis vectors, such a basis is called a primitive basis for this lattice.
If the conventional basis of a lattice is not a primitive basis for this lattice, the price to be paid for the transition to the conventional basis is that in addition to the integral linear combinations of the basis vectors one requires one or more centring vectors in order to obtain all lattice vectors. These centring vectors have non-integral (but rational) coordinates with respect to the conventional basis. The name centring vectors reflects the fact that the additional vectors are usually the centres of the unit cell or of faces of the unit cell spanned by the conventional basis.
Definition
Let be linearly independent vectors in .
Typically, the basis is a conventional basis and in this case one often briefly says that a lattice is a primitive lattice or a centred lattice without explicitly mentioning the conventional basis.
Example
A rectangular lattice has as conventional basis a vector of minimal length and a vector of minimal length amongst the vectors perpendicular to . The resulting primitive lattice is indicated by the filled nodes in Fig. 1.3.2.3. Now consider the lattice having both the filled and the open nodes in Fig. 1.3.2.3 as its lattice nodes. One sees that , is a primitive basis for , but it is more convenient to regard as a centred lattice with respect to the basis with centring vector . The filled nodes then show the sublattice of , the open nodes are the translate and is the union .
Recalling that a lattice is in particular a group (with addition of vectors as operation), the sublattice spanned by the basis of a centred lattice is a subgroup of the centred lattice . Together with the zero vector , the centring vectors form a set of coset representatives of relative to and the index [i] of in is s + 1. In particular, the sum of two centring vectors is, up to a vector in , again a centring vector, i.e. for centring vectors , there is a unique centring vector (possibly 0) such that for a vector .
The concepts of primitive and centred lattices suggest corresponding notions of primitive and centred unit cells. If is a primitive basis for the lattice , then the parallelepiped spanned by is called a primitive unit cell (or primitive cell); if spans a proper sublattice of index [i] in , then the parallelepiped spanned by is called a centred unit cell (or centred cell). Since translating a centred cell by translations from the sublattice covers the full space, the centred cell contains one representative from each coset of the centred lattice relative to . This means that the centred cell contains [i] lattice vectors of the centred lattice and due to this a centred cell is also called a multiple cell. As a consequence, the volume of the centred cell is [i] times as large as that of a primitive cell for .
For a conventional basis of the lattice , the parallelepiped spanned by is called a conventional unit cell (or conventional cell) of . Depending on whether the conventional basis is a primitive basis or not, i.e. whether the lattice is primitive or centred, the conventional cell is a primitive or a centred cell.
Remark: It is important to note that the cell parameters given in the description of a crystallographic structure almost always refer to a conventional cell. When in the crystallographic literature the term `unit cell' is used without further attributes, in most cases a conventional unit cell (as specified by the cell parameters) is meant, which is a primitive or centred (multiple) cell depending on whether the lattice is primitive or centred.
Example (continued)
In the example of a centred rectangular lattice, the conventional basis spans the centred unit cell indicated by solid lines in Fig. 1.3.2.4, whereas the primitive basis , spans the primitive unit cell indicated by dashed lines. One observes that the centred cell contains two lattice vectors, and , whereas the primitive cell only contains the zero vector (note that due to the condition for the points in the unit cell the other vertices of the cell are excluded). The volume of the centred cell is clearly twice as large as that of the primitive cell.
Figures displaying the different primitive and centred unit cells as well as tables describing the metric properties of the different primitive and centred lattices are given in Section 3.1.2 .
Examples
Remark: In three-dimensional space , the conventional bases have been chosen in such a way that any isometry of a centred lattice maps the sublattice generated by the conventional basis to itself. This means that the matrices of the isometries of the lattice are not only integral with respect to a primitive basis, but also when written with respect to the conventional basis. The advantage of the conventional basis is that the matrices are much simpler.
In dimensions , such a choice of a conventional basis is in general no longer possible. For example, one will certainly regard the standard orthonormal basisof the four-dimensional hypercubic lattice as a conventional basis. The body-centred lattice with centring vector is invariant under all the isometries of the hypercubic lattice, but the body-centred lattice itself allows isometries that do not leave the hypercubic lattice invariant. Thus, not all isometries of the body-centred lattice are integral with respect to the conventional basis of the hypercubic lattice.
For crystallographic applications, a lattice related to is of utmost importance. If the atoms are placed at the nodes of a lattice , then the diffraction pattern will have sharp Bragg peaks at the nodes of the reciprocal lattice . More generally, if the crystal pattern is invariant under translations from , then the locations of the Bragg peaks in the diffraction pattern will be invariant under translations from .
Definition
Let be a lattice with lattice basis . Then the reciprocal basis is defined by the properties andwhich can conveniently be written as the matrix equation
This means that is perpendicular to the plane spanned by and and its projection to the line along has length . Analogous properties hold for and .
The reciprocal lattice of is defined to be the lattice with lattice basis .
In three-dimensional space , the reciprocal basis can be determined via the vector product. Assuming that form a right-handed system that spans a unit cell of volume V, the relation and the defining conditions , imply that . Analogously, one has and .
The reciprocal lattice can also be defined independently of a lattice basis by stating that the vectors of the reciprocal lattice have integral scalar products with all vectors of the lattice:
Owing to the symmetry of the scalar product, the roles of the basis and its reciprocal basis can be interchanged. This means that , i.e. taking the reciprocal lattice of the reciprocal lattice results in the original lattice again.
Remark: In parts of the literature, especially in physics, the reciprocal lattice is defined slightly differently. The condition there is that if and 0 otherwise and thus the reciprocal lattice is scaled by the factor 2π as compared to the above definition. By this variation the exponential function is changed to , which simplifies the formulas for the Fourier transform.
Example
Let be the lattice basis of a primitive cubic lattice. Then the body-centred cubic lattice with centring vector is the reciprocal lattice of the rescaled face-centred cubic lattice , i.e. the lattice spanned by and the centring vectors , , .
This example illustrates that a lattice and its reciprocal lattice need not have the same type. The reciprocal lattice of a body-centred cubic lattice is a face-centred cubic lattice and vice versa. However, the conventional bases are chosen such that for a primitive lattice with a conventional basis as lattice basis, the reciprocal lattice is a primitive lattice of the same type. Therefore the reciprocal lattice of a centred lattice is always a centred lattice for the same type of primitive lattice.
The reciprocal basis can be read off the inverse matrix of the metric tensor : We denote by the matrix containing the coordinate columns of with respect to the basis , so that etc. Recalling that scalar products can be computed by multiplying the metric tensor from the left and right with coordinate columns with respect to the basis , the conditionsdefining the reciprocal basis result in the matrix equation , since the coordinate columns of the basis with respect to itself are the rows of the identity matrix , and was just defined to contain the coordinate columns of . But means that and thus the coordinate columns of with respect to the basis are precisely the columns of the inverse matrix of the metric tensor .
From one also derives that the metric tensor of the reciprocal basis is This means that the metric tensors of a basis and its reciprocal basis are inverse matrices of each other. As a further consequence, the volume of the unit cell spanned by the reciprocal basis is , i.e. the inverse of the volume of the unit cell spanned by .
Of course, the reciprocal basis can also be computed from the vectors directly. If and are the matrices containing as ith column the vectors and , respectively, then the relation defining the reciprocal basis reads as , i.e. . Thus, the reciprocal basis vector is the ith column of the transposed matrix of and thus the ith row of the inverse of the matrix containing the as columns.
The relations between the parameters of the unit cell spanned by the reciprocal basis vectors and those of the unit cell spanned by the original basis can either be obtained from the vector product expressions for , , or by explicitly inverting the metric tensor (e.g. using Cramer's rule). The latter approach would also be applicable in n-dimensional space. Either way, one finds
Examples
References
Armstrong, M. A. (1997). Groups and Symmetry. New York: Springer.Google Scholar