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

International Tables for Crystallography (2006). Vol. A. ch. 8.1, pp. 720-725

Chapter 8.1. Basic concepts

H. Wondratscheka*

aInstitut für Kristallographie, Universität, D-76128 Karlsruhe, Germany
Correspondence e-mail:

Part 8 provides the theoretical background to the data in the tables and diagrams of Volume A. In Chapter 8.1, the basic concepts are treated, such as point and vector spaces; motions (isometries) and their description by matrices and augmented matrices; crystal patterns (as mathematical models of ideal crystals) with their point and vector lattices; crystallographic symmetry operations and symmetry groups as well as space groups (as symmetry groups of crystal patterns), point groups (as symmetry groups of macroscopic crystals) and their relations.

8.1.1. Introduction

| top | pdf |

The aim of this part is to define and explain some of the concepts and terms frequently used in crystallography, and to present some basic knowledge in order to enable the reader to make best use of the space-group tables.

The reader will be assumed to have some familiarity with analytical geometry and linear algebra, including vector and matrix calculus. Even though one can solve a good number of practical crystallographic problems without this knowledge, some mathematical insight is necessary for a more thorough understanding of crystallography. In particular, the application of symmetry theory to problems in crystal chemistry and crystal physics requires a background of group theory and, sometimes, also of representation theory.

The symmetry of crystals is treated in textbooks by different methods and at different levels of complexity. In this part, a mainly algebraic approach is used, but the geometric viewpoint is presented also. The algebraic approach has two advantages: it facilitates computer applications and it permits statements to be formulated in such a way that they are independent of the dimension of the space. This is frequently done in this part.

A great selection of textbooks and monographs is available for the study of crystallography. Only Giacovazzo (2002)[link] and Vainshtein (1994)[link] will be mentioned here.

Surveys of the history of crystallographic symmetry can be found in Burckhardt (1988)[link] and Lima-de-Faria (1990)[link].

In addition to books, many programs exist by which crystallographic computations can be performed. For example, the programs can be used to derive the classes of point groups, space groups, lattices (Bravais lattices) and crystal families; to calculate the subgroups of point groups and space groups, Wyckoff positions, irreducible representations etc. The mathematical program packages GAP (Groups, Algorithms and Programming), in particular CrystGap, and Carat (Crystallographic Algorithms and Tables) are examples of powerful tools for the solution of problems of crystallographic symmetry. For GAP, see ; for Carat, see . Other programs are provided by the crystallographic server in Bilbao: .

Essential for the determination of crystal structures are extremely efficient program systems that implicitly make use of crystallographic (and noncrystallographic) symmetries.

In this part, as well as in the space-group tables of this volume, `classical' crystallographic groups in three, two and one dimensions are described, i.e. space groups, plane groups, line groups and their associated point groups. In addition to three-dimensional crystallography, which is the basis for the treatment of crystal structures, crystallography of two- and one-dimensional space is of practical importance. It is encountered in sections and projections of crystal structures, in mosaics and in frieze ornaments.

There are several expansions of `classical' crystallographic groups (groups of motions) that are not treated in this volume but will or may be included in future volumes of the IT series.

  • (a) Generalization of crystallographic groups to spaces of dimension [n\gt 3] is the field of n-dimensional crystallography. Some results are available. The crystallographic symmetry operations for spaces of any dimension n have already been derived by Hermann (1949)[link]. The crystallographic groups of four-dimensional space are also completely known and have been tabulated by Brown et al. (1978)[link] and Schwarzenberger (1980)[link]. The present state of the art and results for higher dimensions are described by Opgenorth et al. (1998)[link], Plesken & Schulz (2000)[link] and Souvignier (2003[link]). Some of their results are displayed in Table[link].

    Table| top | pdf |
    Number of crystallographic classes for dimensions 1 to 6

    The numbers are those of the affine equivalence classes. The numbers for the enantiomorphic pairs are given in parentheses preceded by a + sign (Souvignier, 2003[link]).

    Dimension of spaceCrystal familiesLattice (Bravais) types(Geometric) crystal classesArithmetic crystal classesSpace-group types
    1 1 1 2 2 2
    2 4 5 10 13 17
    3 6 14 32 73 (+11) 219
    4 (+6) 23 (+10) 64 (+44) 227 (+70) 710 (+111) 4783
    5 32 189 955 6079 222018
    6 91 841 7104 (+30) 85311 (+7052) 28927922
  • (b) One can deal with groups of motions whose lattices of translations have lower dimension than the spaces on which the groups act. This expansion yields the subperiodic groups. In particular, there are frieze groups (groups in a plane with one-dimensional translations), rod groups (groups in space with one-dimensional translations) and layer groups (groups in space with two-dimensional translations). These subperiodic groups are treated in IT E (2002)[link] in a similar way to that in which line groups, plane groups and space groups are treated in this volume. Subperiodic groups are strongly related to `groups of generalized symmetry'.

  • (c) Incommensurate phases, e.g. modulated structures or inclusion compounds, as well as quasicrystals, have led to an extension of crystallography beyond periodicity. Such structures are not really periodic in three-dimensional space but their symmetry may be described as that of an n-dimensional periodic structure, i.e. by an n-dimensional space group. In practical cases, [n = 4], 5 or 6 holds. The crystal structure is then an irrational three-dimensional section through the n-dimensional periodic structure. The description by crystallographic groups of higher-dimensional spaces is thus of practical interest, cf. Janssen et al. (2004)[link], van Smaalen (1995)[link] or Yamamoto (1996)[link].

  • (d) Generalized symmetry. Other generalizations of crystallographic symmetry combine the geometric symmetry operations with changes of properties: black–white groups, colour groups etc. They are treated in the classical book by Shubnikov & Koptsik (1974)[link]. Janner (2001[link]) has given an overview of further generalizations.

8.1.2. Spaces and motions

| top | pdf |

Crystals are objects in the physical three-dimensional space in which we live. A model for the mathematical treatment of this space is the so-called point space, which in crystallography is known as direct or crystal space. In this space, the structures of finite real crystals are idealized as infinite perfect three-dimensional crystal structures (cf. Section 8.1.4[link]). This implies that for crystal structures and their symmetries the surfaces of crystals as well as their defects and imperfections are neglected; for most applications, this is an excellent approximation.

The description of crystal structures and their symmetries is not as simple as it appears at first sight. It is useful to consider not only the above-mentioned point space but also to introduce simultaneously a vector space which is closely connected with the point space. Crystallographers are used to working in both spaces: crystal structures are described in point space, whereas face normals, translation vectors, Patterson vectors and reciprocal-lattice vectors are elements of vector spaces.

In order to carry out crystallographic calculations it is necessary to have a metrics in point space. Metrical relations, however, are most easily introduced in vector space by defining scalar products between vectors from which the length of a vector and the angle between two vectors are derived. The connection between the vector space [{\bf V}^{n}] and the point space [E^{n}] transfers both the metrics and the dimension of [{\bf V}^{n}] onto the point space [E^{n}] in such a way that distances and angles in point space may be calculated.

The connection between the two spaces is achieved in the following way:

  • (i) To any two points P and Q of the point space [E^{n}] a vector [\overrightarrow{PQ} = {\bf r}] of the vector space [{\bf V}^{n}] is attached.

  • (ii) For each point P of [E^{n}] and each vector r of [{\bf V}^{n}] there is exactly one point Q of [E^{n}] for which [\overrightarrow{PQ} = {\bf r}] holds.

  • (iii) [\overrightarrow{PQ} + \overrightarrow{QR} = \overrightarrow{PR}].

The distance between two points P and Q in point space is given by the length [| \overrightarrow{PQ} | = (\overrightarrow{PQ}, \overrightarrow{PQ)}^{1/2}] of the attached vector [\overrightarrow{PQ}] in vector space. In this expression, [(\overrightarrow{PQ}, \overrightarrow{PQ})] is the scalar product of [\overrightarrow{PQ}] with itself.

The angle determined by P, Q and R with vertex Q is obtained from [\cos (P, Q, R) = \cos (\overrightarrow{QP}, \overrightarrow{QR}) = {(\overrightarrow{QP}, \overrightarrow{QR}) \over |\overrightarrow{QP}| \cdot |\overrightarrow{QR}|}.] Here, [(\overrightarrow{QP}, \overrightarrow{QR})] is the scalar product between [\overrightarrow{QP}] and [\overrightarrow{QR}]. Such a point space is called an n-dimensional Euclidean space.

If we select in the point space [E^{n}] an arbitrary point O as the origin, then to each point X of [E^{n}] a unique vector [\overrightarrow{OX}] of [{\bf V}^{n}] is assigned, and there is a one-to-one correspondence between the points X of [E^{n}] and the vectors [\overrightarrow{OX}] of [{\bf V}^{n}: X \leftrightarrow \overrightarrow{OX} = {\bf x}].

Referred to a vector basis [{\bf a}_{1}, \ldots, {\bf a}_{n}] of [{\bf V}^{n}], each vector x is uniquely expressed as [{\bf x} = x_{1}{\bf a}_{1} + \ldots + x_{n}{\bf a}_{n}] or, using matrix multiplication,1 [{\bf x} = ({\bf a}_{1}, \ldots, {\bf a}_{n}) \pmatrix{x_{1}\hfill\cr \vdots\cr x_{n}\hfill\cr}].

Referred to the coordinate system [(O, {\bf a}_{1}, \ldots, {\bf a}_{n})] of [E^{n}], Fig.[link], each point X is uniquely described by the column of coordinates [{\bi x} = \pmatrix{x_{1}\hfill\cr \vdots\cr x_{n}\hfill\cr}.] Thus, the real numbers [x_{i}] are either the coefficients of the vector x of [{\bf V}^{n}] or the coordinates of the point X of [E^{n}].


Figure | top | pdf |

Representation of the point X with respect to origin O by the vector [\overrightarrow{OX} = {\bf x}]. The vector x is described with respect to the vector basis [\{{\bf a}_{1},{\bf a}_{2}\}] of [{\bf V}^{2}] by the coefficients [x_{1},x_{2}]. The coordinate system [(O,{\bf a}_{1},{\bf a}_{2})] of the point space [E^{2}] consists of the point O of [E^{2}] and the vector basis [\{{\bf a}_{1},{\bf a}_{2}\}] of [{\bf V}^{2}].

An instruction assigning uniquely to each point X of the point space [E^{n}] an `image' point [\tilde{X}], whereby all distances are left invariant, is called an isometry, an isometric mapping or a motion [\hbox{\sf M}] of [E^{n}]. Motions are invertible, i.e., for a given motion [\hbox{\sf M}: X \rightarrow \tilde{X}], the inverse motion [\hbox{\sf M}^{-1}: \tilde{X} \rightarrow X] exists and is unique.

Referred to a coordinate system [(O, {\bf a}_{1}, \ldots, {\bf a}_{n})], any motion [X \rightarrow \tilde{X}] may be described in the form [\matrix{\tilde{x}_{1} &= &W_{11} x_{1} &+\ {\ldots}\ + &W_{1n} x_{n} &+ &w_{1}\hfill\cr \phantom{\;}\vdots\hfill &= &\vdots & &\vdots & &\phantom{\;}\vdots\hfill\cr \tilde{x}_{n} &= &W_{n1} x_{1} &+\ {\ldots}\ + &W_{nn} x_{n} &+ &w_{n}.\hfill\cr}] In matrix formulation, this is expressed as [\pmatrix{\tilde{x}_{1}\hfill\cr \vdots\cr \tilde{x}_{n}\cr} = \pmatrix{W_{11} &\ldots\hfill &W_{1n}\hfill\cr \vdots & &\vdots\cr W_{n1}\hfill &\ldots\hfill &W_{nn}\hfill\cr} \pmatrix{x_{1}\hfill\cr \vdots\cr x_{n}\hfill\cr} + \pmatrix{w_{1}\hfill\cr \vdots\cr w_{n}\hfill\cr}] or, in abbreviated form, as [\tilde{{\bi x}} = {\bi W}{\bi x} + {\bi w}], where [\tilde{\bi x}], x and w are all [(n \times 1)] columns and W is an [(n \times n)] square matrix. One often writes this in even more condensed form as [\tilde{{\bi x}} = ({\bi W}, {\bi w}){\bi x}], or [\tilde{{\bi x}} = ({\bi W}| {\bi w}){\bi x}]; here, [({\bi W}| {\bi w})] is called the Seitz symbol.

A motion consists of a rotation part or linear part and a translation part. If the motion is represented by (Ww), the matrix W describes the rotation part of the motion and is called the matrix part of (Ww). The column w describes the translation part of the motion and is called the vector part or column part of (Ww). For a given motion, the matrix W depends only on the choice of the basis vectors, whereas the column w in general depends on the choice of the basis vectors and of the origin O; cf. Section 8.3.1[link] .

It is possible to combine the [(n \times 1)] column and the [(n \times n)] matrix representing a motion into an [(n + 1) \times (n + 1)] square matrix which is called the augmented matrix. The system of equations [\tilde{{\bi x}} = {\bi W}{\bi x} + {\bi w}] may then be expressed in the following form: [\pmatrix{\tilde{x}_{1}\cr \vdots\cr \tilde{x}_{n}\cr-\, -\cr 1\cr} = \pmatrix{& & &| &w_{1}\cr & {\bi W}& &\raise3pt\hbox{$|$} &\vdots\cr & & & | &w_{n}\cr -& - & -& - & -\cr 0 &{\;\ldots\;}& 0 &| &1\cr} \pmatrix{x_{1}\cr \vdots\cr x_{n}\cr -\,-\cr 1\cr}] or, in abbreviated form, by [\specialfonts\tilde{\bbsf x} = {\bbsf W}{\bbsf x}]. The augmentation is done in two steps. First, the [(n \times 1)] column w is attached to the [(n \times n)] matrix and then the matrix is made square by attaching the [{[1 \times (n + 1)]}] row [(0 \ldots 0\;1)]. Similarly, the [(n \times 1)] columns [{\bi x}] and [\tilde{\bi x}] have to be augmented to [[(n + 1) \times 1]] columns [\specialfonts{\bbsf x}] and [\specialfonts\tilde{\bbsf x}]. The motion is now described by the one matrix [\specialfonts\bbsf{W}] instead of the pair (W, w).

If the motion [\hbox{\sf M}] is described by [\specialfonts\bbsf{W}], the `inverse motion' [\hbox{\sf M}^{-1}] is described by [\specialfonts{\bbsf W}^{-1}], where [({\bi W}, {\bi w})^{-1} = ({\bi W}^{-1}, - {\bi W}^{-1} {\bi w})]. Successive application of two motions, [\hbox{\sf W}_{1}] and [\hbox{\sf W}_{2}], results in another motion [\hbox{\sf W}_{3}]: [\tilde{X} = \hbox{\sf W}_{1} X \hbox{ and } \tilde{\tilde{X}} = \hbox{\sf W}_{2} \tilde{X} = \hbox{\sf W}_{2} \hbox{\sf W}_{1} X = \hbox{\sf W}_{3} X.] with [\hbox{\sf W}_{3} = \hbox{\sf W}_{2}\hbox{\sf W}_{1}].

This can be described in matrix notation as follows [\tilde{{\bi x}} = {\bi W}_{1} {\bi x} + {\bi w}_{1}] and [\tilde{\tilde{{\bi x}}} = {\bi W}_{2} \tilde{{\bi x}} + {\bi w}_{2} = {\bi W}_{2} {\bi W}_{1} {\bi x} + {\bi W}_{2} {\bi w}_{1} + {\bi w}_{2} = {\bi W}_{3} {\bi x} + {\bi w}_{3},] with [({\bi W}_{3}, {\bi w}_{3}) = ({\bi W}_{2} {\bi W}_{1}, {\bi W}_{2} {\bi w}_{1} + {\bi w}_{2})] or [\specialfonts\tilde{\bbsf x} = {\bbsf{W}}_{1} {\bbsf x} \hbox{ and } \tilde{\tilde{\bbsf x}} = {\bbsf{W}}_{2} \tilde{\bbsf x} = {\bbsf{W}}_{2} {\bbsf{W}}_{1} {\bbsf x} = {\bbsf{W}}_{3} {\bbsf x}] with [\specialfonts{\bbsf{W}}_{3} = {\bbsf{W}}_{2} {\bbsf{W}}_{1}].

It is a special advantage of the augmented matrices that successive application of motions is described by the product of the corresponding augmented matrices.

A point X is called a fixed point of the mapping [\hbox{\sf M}] if it is invariant under the mapping, i.e. [\tilde{X} = X.]

In an n-dimensional Euclidean space [E^{n}], three types of motions can be distinguished:

  • (1) Translation. In this case, [{\bi W} = {\bi I}], where I is the unit matrix; the vector [{\bf w} = w_{1}{\bf a}_{1} + \ldots + w_{n}{\bf a}_{n}] is called the translation vector.

  • (2) Motions with at least one fixed point. In [E^{1}], [E^{2}] and [E^{3}], such motions are called proper motions or rotations if [\det ({\bi W}) = + 1] and improper motions if [\det ({\bi W}) = - 1]. Improper motions are called inversions if [{\bi W} = - {\bi I}]; reflections if [{\bi W}^{2} = {\bi I}] and [{\bi W} \neq - {\bi I}]; and rotoinversions in all other cases. The inversion is a rotation for spaces of even dimension, but an (improper) motion of its own kind in spaces of odd dimension. The origin is among the fixed points if [{\bi w} = {\bi o}], where o is the [(n \times 1)] column consisting entirely of zeros.

  • (3) Fixed-point-free motions which are not translations. In [E^{3}], they are called screw rotations if [\det ({\bi W}) = + 1] and glide reflections if [\det ({\bi W}) = - 1]. In [E^{2}], only glide reflections occur. No such motions occur in [E^{1}].

In Fig.[link], the relations between the different types of motions in [E^{3}] are illustrated. The diagram contains all kinds of motions except the identity mapping [\hbox{\sf I}] which leaves the whole space invariant and which is described by [\specialfonts\bbsf{W} = \bbsf{I}]. Thus, it is simultaneously a special rotation (with rotation angle 0) and a special translation (with translation vector o).


Figure | top | pdf |

Relations between the different kinds of motions in E3; det l.p. = determinant of the linear part. The identity mapping does not fit into this scheme properly and hence has been omitted.

So far, motions [\hbox{\sf M}] in point space [E^{n}] have been considered. Motions give rise to mappings of the corresponding vector space [{\bf V}^{n}] onto itself. If [\hbox{\sf M}] maps the points [P_{1}] and [Q_{1}] of [E^{n}] onto [P_{2}] and [Q_{2}], the vector [\overrightarrow{P_{1}Q_{1}}] is mapped onto the vector [\overrightarrow{P_{2}Q_{2}}]. If the motion in [E^{n}] is described by [\tilde{{\bi x}} = {\bi W}{\bi x} + {\bi w}], the vectors v of [{\bf V}^{n}] are mapped according to [\tilde{{\bf v}} = {\bi W}{\bf v}]. In other words, of the linear and translation parts of the motion of [E^{n}], only the linear part remains in the corresponding mapping of [{\bf V}^{n}] (linear mapping). This difference between the mappings in the two spaces is particularly obvious for translations. For a translation [\hbox{\sf T}] with translation vector [{\bf t} \neq {\bf o}], no fixed point exists in [E^{n}], i.e. no point of [E^{n}] is mapped onto itself by [\hbox{\sf T}]. In [{\bf V}^{n}], however, any vector v is mapped onto itself since the corresponding linear mapping is the identity mapping.

8.1.3. Symmetry operations and symmetry groups

| top | pdf |

Definition: A symmetry operation of a given object in point space [E^{n}] is a motion of [E^{n}] which maps this object (point, set of points, crystal pattern etc.) onto itself.

Remark: Any motion may be a symmetry operation, because for any motion one can construct an object which is mapped onto itself by this motion.

For the set of all symmetry operations of a given object, the following relations hold:

  • (a) successive application of two symmetry operations of an object results in a third symmetry operation of that object;

  • (b) the inverse of a symmetry operation is also a symmetry operation;

  • (c) there exists an `identity operation' [\hbox{\sf I}] which leaves each point of the space fixed: [X \rightarrow X]. This operation [{\sf I}] is described (in any coordinate system) by [({\bi W},{\bi w}) = ({\bi I},{\bi o})] or by [\specialfonts\bbsf{W} = \bbsf{I}] and it is a symmetry operation of any object.

  • (d) The `associative law' [(\hbox{\sf W}_{3}\hbox{\sf W}_{2})\hbox{\sf W}_{1} = \hbox{\sf W}_{3}(\hbox{\sf W}_{2}\hbox{\sf W}_{1})] is valid.

One can show, however, that in general the `commutative law' [\hbox{\sf W}_{2}\hbox{\sf W}_{1} = \hbox{\sf W}_{1}\hbox{\sf W}_{2}] is not obeyed for symmetry operations.

The properties (a [link]) to (d[link][link][link]) are the group axioms. Thus, the set of all symmetry operations of an object forms a group, the symmetry group of the object or its symmetry. The mathematical theorems of group theory, therefore, may be applied to the symmetries of objects.

So far, only rather general objects have been considered. Crystallographers, however, are particularly interested in the symmetries of crystals. In order to introduce the concept of crystallographic symmetry operations, crystal structures, crystal patterns and lattices have to be taken into consideration. This will be done in the following section.

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[link] .


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[link] ), 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[link] . 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.

8.1.5. Crystallographic symmetry operations

| top | pdf |

Crystallographic symmetry operations are special motions.

Definition: A motion is called a crystallographic symmetry operation if a crystal pattern exists for which it is a symmetry operation.

We consider a crystal pattern with its vector lattice L referred to a primitive basis. Then, by definition, each vector of L has integral coefficients. The linear part of a symmetry operation maps L onto itself: [{\bf L} \rightarrow {\bi W}{\bf L} = {\bf L}]. Since the coefficients of all vectors of L are integers, the matrix W is an integral matrix, i.e. its coefficients are integers. Thus, the trace of W, [\hbox{tr}({\bi W}) = {\bi W}_{11} + \ldots + {\bi W}_{nn}], is also an integer. In [{\bf V}^{3}], by reference to an appropriate orthonormal (not necessarily crystallographic) basis, one obtains another condition for the trace, [\hbox{tr}({\bi W}) = \pm (1 + 2 \cos \varphi)], where ϕ is the angle of rotation or rotoinversion. From these two conditions, it follows that ϕ can only be 0, 60, 90, 120, 180° etc., and hence the familiar restriction to one-, two-, three-, four- and sixfold rotations and rotoinversions results.2 These results imply for dimensions 2 and 3 that the matrix W satisfies the condition [({\bi W})^{{\bi k}} = {\bi I}], with [k = 1], 2, 3, 4 or 6.3 Consequently, for the operation (W, w) in point space the relation [({\bi W}, {\bi w})^{\bi k} = [{\bi I}, ({\bi W}^{{\bi k} - 1} + {\bi W}^{{\bi k} - {\bf 2}} + \ldots + {\bi W} + {\bi I}) {\bi w}] = ({\bi I}, {\bi t})] holds.

For the motion described by (W, w), this implies that a k-fold application results in a translation [\hbox{\sf T}] (with translation vector t) of the crystal pattern. The (fractional) translation [(1/k) \hbox{\sf T}] is called the intrinsic translation part (screw or glide part) of the symmetry operation. Whereas the `translation part' of a motion depends on the choice of the origin, the `intrinsic translation part' of a motion is uniquely determined. The intrinsic translation vector [(1/k){\bf t}] is the shortest translation vector of the motion for any choice of the origin.

If [{\bi t} = {\bi o}], the symmetry operation has at least one fixed point and is a rotation, inversion, reflection or rotoinversion. If [{\bi t} \neq {\bi o}], the term [(1/k){\bf t}] is called the glide vector (for a reflection) or the screw vector (for a rotation) of the symmetry operation. Both types of operations, glide reflections and screw rotations, have no fixed point.

For the geometric visualization of symmetry, the concept of symmetry elements is useful.4 The symmetry element of a symmetry operation is the set of its fixed points, together with a characterization of the motion. For symmetry operations without fixed points (screw rotations or glide reflections), the fixed points of the corresponding rotations or reflections, described by [({\bi W}, {\bi w}')] with [{\bi w}' = {\bi w} - (1/k){\bi t}], are taken. Thus, in [E^{2}], symmetry elements are N-fold rotation points ([N = 2], 3, 4 or 6), mirror lines and glide lines. In [E^{3}], symmetry elements are rotation axes, screw axes, inversion centres, mirror planes and glide planes. A peculiar situation exists for rotoinversions (except [\bar{1}] and [\bar{2} \equiv m]). The symmetry element of such a rotoinversion consists of two components, a point and an axis. The point is the inversion point of the rotoinversion, and the axis of the rotoinversion is that of the corresponding rotation.

The determination of both the nature of a symmetry operation and the location of its symmetry element from the coordinate triplets, listed under Positions in the space-group tables, is described in Section 11.2.1 of Chapter 11.2[link] .

8.1.6. Space groups and point groups

| top | pdf |

As mentioned in Section 8.1.3[link], the set of all symmetry operations of an object forms a group, the symmetry group of that object.

Definition: The symmetry group of a three-dimensional crystal pattern is called its space group. In [E^{2}], the symmetry group of a (two-dimensional) crystal pattern is called its plane group. In [E^{1}], the symmetry group of a (one-dimensional) crystal pattern is called its line group. To each crystal pattern belongs an infinite set of translations [\hbox{\sf T}_{j}] which are symmetry operations of that pattern. The set of all [\hbox{\sf T}_{j}] forms a group known as the translation subgroup [{\cal T}] of the space group [{\cal G}] of the crystal pattern. Since the commutative law [\hbox{\sf T}_{j}\hbox{\sf T}_{k} = \hbox{\sf T}_{k}\hbox{\sf T}_{j}] holds for any two translations, [{\cal T}] is an Abelian group.

With the aid of the translation subgroup [{\cal T}], an insight into the architecture of the space group [{\cal G}] can be gained.

Referred to a coordinate system [(O,{\bf a}_{1},\ldots,{\bf a}_{n})], the space group [{\cal G}] is described by the set [\{({\bi W}, {\bi w})\}] of matrices W and columns w. The group [{\cal T}] is represented by the set of elements [({\bi I}, {\bi t}_{j})], where [{\bi t}_{j}] are the columns of coefficients of the translation vectors [{\bf t}_{j}] of the lattice L. Let (W, w) describe an arbitrary symmetry operation [\hbox{\sf W}] of [{\cal G}]. Then, all products [({\bi I}, {\bi t}_{j})({\bi W}, {\bi w}) = ({\bi W}, {\bi w} + {\bi t}_{j})] for the different j have the same matrix part W. Conversely, every symmetry operation [\hbox{\sf W}] of the space group with the same matrix part W is represented in the set [\{({\bi W}, {\bi w} + {\bi t}_{j})\}]. The corresponding set of symmetry operations can be denoted by [{\cal T} \hbox{\sf W}]. Such a set is called a right coset of [{\cal G}] with respect to [{\cal T}], because the element [\hbox{\sf W}] is the right factor in the products [{\cal T} \hbox{\sf W}]. Consequently, the space group [{\cal G}] may be decomposed into the right cosets [{\cal T}, {\cal T}\hbox{\sf W}_{2}, {\cal T}\hbox{\sf W}_{3},\ldots,{\cal T}\hbox{\sf W}_{i}], where the symmetry operations of the same column have the same matrix part W, and the symmetry operations [\hbox{\sf W}_{j}] differ by their matrix parts [{\bi W}_{j}]. This coset decomposition of [{\cal G}] with respect to [{\cal T}] may be displayed by the array [\matrix{\; \hbox{\sf I} \equiv \hbox{\sf W}_{1}\hfill &\quad \hbox{\sf W}_{2} &\quad \hbox{\sf W}_{3} &\ldots &\quad \hbox{\sf W}_{i}\cr \hbox{\sf T}_{1}\hfill &\hbox{\sf T}_{1}\hbox{\sf W}_{2} &\hbox{\sf T}_{1}\hbox{\sf W}_{3} &\ldots &\hbox{\sf T}_{1}\hbox{\sf W}_{i}\cr \hbox{\sf T}_{2}\hfill &\hbox{\sf T}_{2}\hbox{\sf W}_{2} &\hbox{\sf T}_{2}\hbox{\sf W}_{3} &\ldots &\hbox{\sf T}_{2}\hbox{\sf W}_{i}\cr \hbox{\sf T}_{3}\hfill &\hbox{\sf T}_{3}\hbox{\sf W}_{2} &\hbox{\sf T}_{3}\hbox{\sf W}_{3} &\ldots &\hbox{\sf T}_{3}\hbox{\sf W}_{i}\cr \phantom{a}\vdots\hfill &\phantom{a}\vdots\hfill &\phantom{a}\vdots\hfill & &\phantom{a}\vdots\hfill\cr}] Here, [\hbox{\sf W}_{1} = \hbox{\sf I}] is the identity operation and the elements of [{\cal T}] form the first column, those of [{\cal T}\hbox{\sf W}_{2}] the second column etc. As each column may be represented by the common matrix part W of its symmetry operations, the number i of columns, i.e. the number of cosets, is at the same time the number of different matrices W of the symmetry operations of [{\cal G}]. This number i is always finite, and is the order of the point group belonging to [{\cal G}], as explained below. Any element of a coset [{\cal T}\hbox{\sf W}_{j}] may be chosen as the representative element of that coset and listed at the top of its column. Choice of a different representative element merely results in a different order of the elements of a coset, but the coset does not change its content.5

Analogously, a coset [\hbox{\sf W}{\cal T}] is called a left coset of [{\cal G}] with respect to [{\cal T}], and [{\cal G}] can be decomposed into the left cosets [{\cal T}, \hbox{\sf W}_{2}{\cal T}, \hbox{\sf W}_{3}{\cal T}, \ldots, \hbox{\sf W}_{i}{\cal T}]. This left coset decomposition of a space group is always possible with the same [\hbox{\sf W}_{1},\hbox{\sf W}_{2}, \ldots, \hbox{\sf W}_{i}] as in the right coset decomposition. Moreover, both decompositions result in the same cosets, except for the order of the elements in each coset. A subgroup of a group with these properties is called a normal subgroup of the group; cf. Ledermann (1976)[link]. Thus, the translation subgroup [{\cal T}] is a normal subgroup of the space group [{\cal G}].

The decomposition of a space group into cosets is the basis of the description of the space groups in these Tables. The symmetry operations of the space group are referred to a `conventional' coordinate system (cf. Section 8.3.1[link] ) and described by [(n + 1) \times (n + 1)] matrices. In the space-group tables as general position (cf. Section 8.3.2[link] ) for each column, a representative is listed whose coefficients [w_{j}] obey the condition [0 \leq w_{j} \lt 1]. The matrix is not listed completely, however, but is given in a short-hand notation. In the expression [W_{j1}x_{1} + \ldots + W_{jn}x_{n} + w_{j}], all vanishing terms and all [W_{jk} = 1] are omitted, e.g. [\left.\matrix{1x + 0y + 0z + {1 \over 2}\hfill\cr 0x + 1y + 0z + 0\hfill\cr 0x + 0y - 1z + {1 \over 2}\hfill\cr}\right\}] is replaced by [x + {1 \over 2},y,\bar{z} + {1 \over 2}]. The first entry of the general position is always the identity mapping, listed as x, y, z. It represents all translations of the space group too.

As groups, some space groups are more complicated than others. Most easy to survey are the `symmorphic' space groups which may be defined as follows:

Definition: A space group is called symmorphic if the coset representatives [\hbox{\sf W}_{j}] can be chosen in such a way that they leave one common point fixed.

In this case, the representative symmetry operations [\hbox{\sf W}_{j}] of a symmorphic space group form a (finite) group. If the fixed point is chosen as the origin of the coordinate system, the column parts [{\bi w}_{j}] of the representative symmetry operations [\hbox{\sf W}_{j}] obey the equations [{{\bi w}_{j} = {\bi o}}.] Thus, for a symmorphic space group the representative symmetry operations may always be described by the special matrix–column pairs [({\bi W}_{j}, {\bi o})].

Symmorphic space groups may be easily identified by their Hermann–Mauguin symbols because these do not contain any glide or screw operation. For example, the monoclinic space groups with the symbols P2, C2, Pm, Cm, [P2/m] and [C2/m] are symmorphic, whereas those with the symbols [P2_{1}], Pc, Cc, [P2_{1}/m, P2/c, P2_{1}/c] and [C2/c] are not.

Unlike most textbooks of crystallography, in this section point groups are treated after space groups because the space group of a crystal pattern, and thus of a crystal structure, determines its point group uniquely.

The external shape (morphology) of a macroscopic crystal is formed by its faces. In order to eliminate the influence of growth conditions, the set of crystal faces is replaced by the set of face normals, i.e. by a set of vectors. Thus, the symmetry group of the macroscopic crystal is the symmetry group of the vector set of face normals. It is not the group of motions in point space, therefore, that determines the symmetry of the macroscopic crystal, but the corresponding group of linear mappings of vector space; cf. Section 8.1.2[link]. This group of linear mappings is called the point group of the crystal. Since to each macroscopic crystal a crystal structure corresponds and, furthermore, to each crystal structure a space group, the point group of the crystal defined above is also the point group of the crystal structure and the point group of its space group.

To connect more formally the concept of point groups with that of space groups in n-dimensional space, we consider the coset decomposition of a space group [{\cal G}] with respect to the normal subgroup [{\cal T}], as displayed above. We represent the right coset decomposition by [{\cal T}, {\cal T}\hbox{\sf W}_{2}, \ldots, {\cal T}\hbox{\sf W}_{i}] and the corresponding left coset decomposition by [{\cal T},\hbox{\sf W}_{2}{\cal T}, \ldots, \hbox{\sf W}_{i}{\cal T}]. If [{\cal G}] is referred to a coordinate system, the symmetry operations of [{\cal G}] are described by matrices W and columns w. As a result of the one-to-one correspondence between the i cosets [{\cal T}\hbox{\sf W}_{j} = \hbox{\sf W}_{j}{\cal T}] and the i matrices [{\bi W}_{j}], the cosets may alternatively be represented by the matrices [{\bi W}_{j}]. These matrices form a group of (finite) order i, and they describe linear mappings of the vector space [{\bf V}^{n}] connected with [E^{n}]; cf. Section 8.1.2[link]. This group (of order i) of linear mappings is the point group [{\cal P}] of the space group [{\cal G}], introduced above.

The difference between symmetry in point space and that in vector space may be exemplified again by means of some monoclinic space groups. Referred to conventional coordinate systems, space groups Pm, Pc, Cm and Cc have the same [(3 \times 3)] matrices [{\bi W}_{j}] of their symmetry operations. Thus, the point groups of all these space groups are of the same type m. The space groups themselves, however, show a rather different behaviour. In Pm and Cm reflections occur, whereas in Pc and Cc only glide reflections are present.

Remark: The usage of the term `point group' in connection with space groups is rather unfortunate as the point group of a space group is not a group of motions of point space but a group acting on vector space. As a consequence, the point group of a space group may contain operations which do not occur in the space group at all. This is apparent from the example of monoclinic space groups above. Nevertheless, the term `point group of a space group' is used here for historical reasons. A more adequate term would be `vector point group' of a space group or a crystal. It must be mentioned that the term `point group' is also used for the `site-symmetry group', defined in Section 8.3.2[link] . Site-symmetry groups are groups acting on point space.

It is of historic interest that the 32 types of three-dimensional crystallographic point groups were determined more than 50 years before the 230 (or 219) types of space group were known. The physical methods of the 19th century, e.g. the determination of the symmetry of the external shape or of tensor properties of a crystal, were essentially methods of determining the point group, not the space group of the crystal.


Part 8 is more than other parts of this volume the product of the combined efforts of many people. Most members of the IUCr Commission on International Tables made stimulating suggestions. Norman F. M. Henry, Cambridge, Theo Hahn, Aachen, and Aafje Looijenga-Vos, Groningen, have especially to be mentioned for their tireless efforts to find an intelligible presentation. Joachim Neubüser, Aachen, prepared the first draft for part 1 of the Pilot Issue (1972) under the title Mathematical Introduction to Symmetry. His article is the basis of the present text, to which again he made many valuable comments. J. Neubüser also stimulated the applications of normalizers in crystallography, outlined in Section 8.3.6[link] and Part 15[link] . L. Laurence Boyle, Canterbury, improved the English style and made constructive remarks.


First citationBrown, H., Bülow, R., Neubüser, J., Wondratschek, H. & Zassenhaus, H. (1978). Crystallographic groups of four-dimensional space. New York: Wiley.Google Scholar
First citationBurckhardt, J. J. (1988). Die Symmetrie der Kristalle. Basel: Birkhäuser.Google Scholar
First citationFlack, H. D., Wondratschek, H., Hahn, Th. & Abrahams, S. C. (2000). Symmetry elements in space groups and point groups. Addenda to two IUCr reports on the nomenclature of symmetry. Acta Cryst. A56, 96–98.Google Scholar
First citationGiacovazzo, C. (2002). Editor. Fundamentals of crystallography, 2nd ed. IUCr texts on crystallography, No. 7. Oxford University Press.Google Scholar
First citationHermann, C. (1949). Kristallographie in Räumen beliebiger Dimensionszahl. I. Die Symmetrieoperationen. Acta Cryst. 2, 139–145.Google Scholar
First citationInternational Tables for Crystallography (2002). Vol. E. Subperiodic groups, edited by V. Kopsky & D. B. Litvin. Dordrecht: Kluwer Academic Publishers.Google Scholar
First citationJanner, A. (2001). Introduction to a general crystallography. Acta Cryst. A57, 378–388.Google Scholar
First citationJanssen, T., Janner, A., Looijenga-Vos, A. & de Wolff, P. M. (2004). International tables for crystallography, Vol. C, 3rd ed., edited by E. Prince, ch. 9.8. Dordrecht: Kluwer Academic Publishers.Google Scholar
First citationLedermann, W. (1976). Introduction to group theory. London: Longman.Google Scholar
First citationLima-de-Faria, J. (1990). Historical atlas of crystallography. Dordrecht: Kluwer Academic Publishers.Google Scholar
First citationOpgenorth, J., Plesken, W. & Schulz, T. (1998). Crystallographic algorithms and tables. Acta Cryst. A54, 517–531.Google Scholar
First citationPlesken, W. & Schulz, T. (2000). Counting crystallographic groups in low dimensions. Exp. Math. 9, 407–411.Google Scholar
First citationSchwarzenberger, R. L. E. (1980). N-dimensional crystallography. San Francisco: Pitman.Google Scholar
First citationShubnikov, A. V. & Koptsik, V. A. (1974). Symmetry in science and art. New York: Plenum.Google Scholar
First citationSmaalen, S. van (1995). Incommensurate crystal structures. Crystallogr. Rev. 4, 79–202.Google Scholar
First citationSouvignier, B. (2003). Enantiomorphism of crystallographic groups in higher dimensions with results in dimensions up to 6. Acta Cryst. A59, 210–220.Google Scholar
First citationVainshtein, B. K. (1994). Fundamentals of crystals. Berlin: Springer-Verlag.Google Scholar
First citationWolff, P. M. de, Billiet, Y., Donnay, J. D. H., Fischer, W., Galiulin, R. B., Glazer, A. M., Hahn, Th., Senechal, M., Shoemaker, D. P., Wondratschek, H., Wilson, A. J. C. & Abrahams, S. C. (1992). Symbols for symmetry elements and symmetry operations. Acta Cryst. A48, 727–732.Google Scholar
First citationWolff, P. M. de, Billiet, Y., Donnay, J. D. H., Fischer, W., Galiulin, R. B., Glazer, A. M., Senechal, M., Shoemaker, D. P., Wondratschek, H., Hahn, Th., Wilson, A. J. C. & Abrahams, S. C. (1989). Definition of symmetry elements in space groups and point groups. Acta Cryst. A45, 494–499.Google Scholar
First citationYamamoto, A. (1996). Crystallography of quasiperiodic crystals. Acta Cryst. A52, 509–560.Google Scholar

to end of page
to top of page