Crystal patterns, vector lattices and point lattices

Wondratschek, H.

doi:10.1107/97809553602060000514

RELATED SITES: IUCr | IUCr Journals

| previous | next |

International
Tables for
Crystallography
Volume A
Space-group symmetry
Edited by Th. Hahn

International Tables for Crystallography (2006). Vol. A. ch. 8.1, pp. 722-723

Section 8.1.4. Crystal patterns, vector lattices and point lattices

H. Wondratschek^a ^*

^a Institut für Kristallographie, Universität, D-76128 Karlsruhe, Germany
Correspondence e-mail: [email protected]

8.1.4. Crystal patterns, vector lattices and point lattices

| top | pdf |

Crystals are finite real objects in physical space which may be idealized by infinite three-dimensional periodic `crystal structures' in point space. Three-dimensional periodicity means that there are translations among the symmetry operations of the object with the translation vectors spanning a three-dimensional space. Extending this concept of crystal structure to more general periodic objects and to n-dimensional space, one obtains the following definition:

Definition: An object in n-dimensional point space $[E^{n}]$ is called an n-dimensional crystallographic pattern or, for short, crystal pattern if among its symmetry operations

(i) there are n translations, the translation vectors $[{\bf t}_{1}, \ldots, {\bf t}_{n}]$ of which are linearly independent,
(ii) all translation vectors, except the zero vector o, have a length of at least $[d \;\gt\; 0]$ .

Condition (i) guarantees the n-dimensional periodicity and thus excludes subperiodic symmetries like layer groups, rod groups and frieze groups. Condition (ii) takes into account the finite size of atoms in actual crystals.

Successive application of two translations of a crystal pattern results in another translation, the translation vector of which is the (vector) sum of the original translation vectors. Consequently, in addition to the n linearly independent translation vectors $[{\bf t}_{1}, \ldots, {\bf t}_{n}]$ , all (infinitely many) vectors $[{\bf t} = u_{1} {\bf t}_{1}\!\!\; + \ldots +\!\; u_{n}{\bf t}_{n}]$ ( $[u_{1}, \ldots, u_{n}]$ arbitrary integers) are translation vectors of the pattern. Thus, infinitely many translations belong to each crystal pattern. The periodicity of crystal patterns is represented by their lattices. It is useful to distinguish two kinds of lattices: vector lattices and point lattices. This distinction corresponds to that between vector space and point space, discussed above. The vector lattice is treated first.

Definition: The (infinite) set of all translation vectors of a crystal pattern is called the lattice of translation vectors or the vector lattice L of this crystal pattern.

In principle, any set of n linearly independent vectors may be used as a basis of the vector space $[{\bf V}^{n}]$ . Most of these sets, however, result in a rather complicated description of a given vector lattice. The following theorem shows that among the (infinitely many) possible bases of the vector space $[{\bf V}^{n}]$ special bases always exist, referred to which the survey of a given vector lattice becomes particularly simple.

Definitions: (1) A basis of n vectors $[{\bf a}_{1},\ldots,{\bf a}_{n}]$ of $[{\bf V}^{n}]$ is called a crystallographic basis of the n-dimensional vector lattice L if every integral linear combination $[{\bf t} = u_{1}{\bf a}_{1}\!\!\!\; + \ldots +\!\!\; u_{n}{\bf a}_{n}]$ is a lattice vector of L. (2) A basis is called a primitive crystallographic basis of L or, for short, a primitive basis if it is a crystallographic basis and if, furthermore, every lattice vector t of L may be obtained as an integral linear combination of the basis vectors.

The distinction between these two kinds of bases can be expressed as follows. Referred to a crystallographic basis, the coefficients of each lattice vector must be either integral or rational. Referred to a primitive crystallographic basis, only integral coefficients occur. It should be noted that nonprimitive crystallographic bases are used conventionally for the description of `centred lattices', whereas reduced bases are always primitive; see Chapter 9.2 .

Example

The basis used conventionally for the description of the `cubic body-centred lattice' is a crystallographic basis because the basis vectors a, b, c are lattice vectors. It is not a primitive basis because lattice vectors with non-integral but rational coefficients exist, e.g. the vector $[{1 \over 2}{\bf a} + {1 \over 2}{\bf b} + {1 \over 2}{\bf c}]$ . The bases $[{\bf a}' = {1 \over 2}(- {\bf a} + {\bf b} + {\bf c})]$ , $[{\bf b}' = {1 \over 2}({\bf a} - {\bf b} + {\bf c})]$ , $[{\bf c}' = {1 \over 2}({\bf a} + {\bf b} - {\bf c})]$ or $[{\bf a}'' = {\bf a}]$ , $[{\bf b}'' = {\bf b}]$ , $[{\bf c}'' = {1 \over 2}({\bf a} + {\bf b} + {\bf c})]$ are primitive bases. In the first of these bases, the vector $[{1 \over 2}({\bf a} + {\bf b} + {\bf c})]$ is given by $[{\bf a}' + {\bf b}' + {\bf c}']$ , in the second basis by $[{\bf c}'']$ , both with integral coefficients only.

Fundamental theorem on vector lattices: For every vector lattice L primitive bases exist.

It can be shown that (in dimensions $[n \gt 1]$ ) the number of primitive bases for each vector lattice is infinite. There exists, however, a procedure called `basis reduction' (cf. Chapter 9.2 ), which uniquely selects one primitive basis from this infinite set, thus permitting unambiguous description and comparison of vector lattices. Although such a reduced primitive basis always can be selected, in many cases conventional coordinate systems are chosen with nonprimitive rather than primitive crystallographic bases. The reasons are given in Section 8.3.1 . The term `primitive' is used not only for bases of lattices but also with respect to the lattices themselves, as in the crystallographic literature a vector lattice is frequently called primitive if its conventional basis is primitive.

With the help of the vector lattices defined above, the concept of point lattices will be introduced.

Definition: Given an arbitrary point $[X_{0}]$ in point space and a vector lattice L consisting of vectors $[{\bf t}_{j}]$ , the set of all points $[X_{j}]$ with $[\overrightarrow{X_{0}X}_{j} = {\bf t}_{j}]$ is called the point lattice belonging to $[X_{0}]$ and L.

A point lattice can be visualized as the set of end-points of all vectors of L, where L is attached to an arbitrary point $[X_{0}]$ of point space. Because each point X of point space could be chosen as the point $[X_{0}]$ , an infinite set of point lattices belongs to each vector lattice. Frequently, the point $[X_{0}]$ is chosen as the origin of the coordinate system of the point space.

An important aspect of a lattice is its unit cell.

Definition: If $[{\bf a}_{1},\ldots,{\bf a}_{n}]$ is a crystallographic basis of a vector lattice L, the set of all vectors $[x_{1}{\bf a}_{1} \;{+} \ldots {+}\; x_{n}{\bf a}_{n}]$ with $[0 \;{\leq}\; x_{i} \;{\lt}\; 1]$ is called a unit cell of the vector lattice.

The concept of a `unit cell' is not only applied to vector lattices in vector space but also more often to crystal structures or crystal patterns in point space. Here the coordinate system $[(O,{\bf a}_{1},\ldots,{\bf a}_{n})]$ and the origin $[X_{0}]$ of the unit cell have to be chosen. In most cases $[X_{0} = O]$ is taken, but in general we have the following definition:

Definition: Given a crystallographic coordinate system $[(O,{\bf a}_{1},\ldots,{\bf a}_{n})]$ of a crystal pattern and a point $[X_{0}]$ with coordinates $[x_{0i}]$ , a unit cell of the crystal pattern is the set of all points X with coordinates $[x_{i}]$ such that the equation $[0 \leq x_{i} - x_{0i} \lt 1]$ $[(i = 1,\ldots,n)]$ holds.

Obviously, the term `unit cell' may be transferred to real crystals. As the volume of the unit cell and the volumes of atoms are both finite, only a finite number N of atoms can occur in a unit cell of a crystal. A crystal structure, therefore, may be described in two ways:

(a) One starts with an arbitrary unit cell and builds up the whole crystal structure by infinite repetition of this unit cell. The crystal structure thus consists of an infinite number of finite `building blocks', each building block being a unit cell.
(b) One starts with a point $[X_{1}]$ representing the centre of an atom. To this point belong an infinite number of translationally equivalent points $[X_{j}]$ , i.e. points for which the vectors $[\overrightarrow{X_{1}X_{j}}]$ are lattice vectors. In this way, from each of the points $[X_{i}\ (i = 1,\ldots,N)]$ within the unit cell a point lattice of translationally equivalent points is obtained. The crystal structure is then described by a finite number of interpenetrating infinite point lattices.

In most cases, one is not interested in the orientation of the vector lattice or the point lattices of a crystal structure in space, but only in the shape and size of a unit cell. From this point of view, a three-dimensional lattice is fully described by the lengths a, b and c of the basis vectors a, b and c and by the three interaxial angles α, β and γ. These data are called the lattice parameters , cell parameters or lattice constants of both the vector lattice and the associated point lattices of the crystal structure.

References

International Tables for Crystallography (2006). Vol. A. ch. 8.1, pp. 722-723