International
Tables for Crystallography Volume A Spacegroup symmetry Edited by Th. Hahn © International Union of Crystallography 2006 
International Tables for Crystallography (2006). Vol. A, ch. 8.3, pp. 732740
doi: 10.1107/97809553602060000516 Chapter 8.3. Special topics on space groups^{a}Institut für Kristallographie, Universität, D76128 Karlsruhe, Germany Part 8 provides the theoretical background to the data in the tables and diagrams of Volume A. Chapter 8.3 is devoted to special topics on space groups. The reader finds sections on the conventional crystallographic coordinate systems, on crystallographic point orbits and their distribution into Wyckoff positions according to their site symmetries, on sub and supergroups of space groups, on the spacegroup generators used in Volume A and on normalizers of space groups. 
The matrices W and the columns w of crystallographic symmetry operations depend on the choice of the coordinate system. A suitable choice is essential if W and w are to be obtained in a convenient form.
Example
In a space group I4mm, the matrix part of a clockwise fourfold rotation around the c axis is described by the W matrix if referred to the conventional crystallographic basis a, b, c. Correspondingly, the matrix represents a reflection in a plane parallel to b and c. These matrices are easy to handle and their geometrical significance is evident. Referred to the primitive basis , , , defined by , , , the matrices representing the same symmetry operations would be These matrices are more complicated to work with, and their geometrical significance is less obvious.
The conventional coordinate systems obey rules concerning the vector bases and the origins.

A change of the coordinate system, i.e. referring the crystal pattern and its symmetry operations to a new coordinate system, results in new coordinates and new matrices ; cf. Section 5.1.3 .
The concept of positions and their site symmetries is fundamental for the determination and description of crystal structures. Let, for instance, be the space group of a crystal structure with tetrahedral and triangular groups. Then the atoms A and B cannot be located at centres of inversion, as the symmetry of tetrahedra and triangles is incompatible with site symmetry . If the space group is , again the points with site symmetry cannot be the loci of A or B, but points with site symmetries 2, m or 1 can.
The relations between `site symmetry' and `positions' can be formulated in a rather general way.
Definition: The set of all symmetry operations of a space group that leave a point X invariant forms a finite group, the sitesymmetry group of X with respect to .^{2}
With regard to the symmetry operations of a space group , two kinds of points are to be distinguished. A point X is called a point of general position with respect to a space group if there is no symmetry operation of (apart from the identity operation) that leaves X fixed, i.e. if . A point X is called a point of special position with respect to a space group if there is at least one other symmetry operation of , in addition to the identity operation, that leaves X fixed, i.e. if .
The subdivision of the set of all points into two classes, those of general and those of special position with respect to a space group , constitutes only a very coarse classification. A finer classification is obtained as follows.
Definition: A Wyckoff position (for short, position; in German, Punktlage) consists of all points X for which the sitesymmetry groups are conjugate subgroups^{3} of .
For practical purposes, each Wyckoff position of a space group is labelled by a letter which is called the Wyckoff letter (Wyckoff notation in earlier editions of these Tables). Wyckoff positions without variable parameters (e.g. ) and with variable parameters (e.g. ) have to be distinguished.
The number of different Wyckoff positions of each space group is finite, the maximal numbers being nine for plane groups (realized in p2mm) and 27 for space groups (realized in Pmmm).
A finer classification of the points of with respect to , which always results in an infinite number of classes, is the subdivision of all points into sets of symmetrically equivalent points. In the following, these sets will be called crystallographic orbits according to the following definition.
Definition: The set of all points that are symmetrically equivalent to a point X with respect to a space group is called the crystallographic orbit of X with respect to .
Example
Described in a conventional coordinate system, the crystallographic orbit of a point X of general position with respect to a plane group p2 consists of the points ; ; ; ; ; ; ; ; ; ; ; etc.
Crystallographic orbits are infinite sets of points due to the infinite number of translations in each space group. Any one of its points may represent the whole crystallographic orbit, i.e. may be the generating point X of a crystallographic orbit.^{4}
Because the sitesymmetry groups of different points of the same crystallographic orbit are conjugate subgroups of , a crystallographic orbit consists either of points of general position or of points of special position only. Therefore, one can speak of `crystallographic orbits of general position' or general crystallographic orbits and of `crystallographic orbits of special position' or special crystallographic orbits with respect to . Because all points of a crystallographic orbit belong to the same Wyckoff position of , one also can speak of Wyckoff positions of crystallographic orbits.^{5}
The points of each general crystallographic orbit of a space group are in a onetoone correspondence with the symmetry operations of . Starting with the generating point X (to which the identity operation corresponds), to each point of the crystallographic orbit belongs exactly one symmetry operation of such that is the image of X under . This onetoone correspondence is the reason why the `coordinates' listed for the general position in the spacegroup tables may be interpreted in two different ways, either as the coordinates of the image points of X under or as a shorthand notation for the pairs (W, w) of the symmetry operations of ; cf. Sections 8.1.6 and 11.1.1 . Such a onetoone correspondence does not exist for the special crystallographic orbits, where each point corresponds to a complete coset of a left coset decomposition of with respect to the sitesymmetry group of X. Thus, the data listed for the special positions are to be understood only as the coordinates of the image points of X under .
Space groups with no special crystallographic orbits are called fixedpointfree space groups. The following types of fixedpointfree space groups occur: p1 and pg in ; (No. 1), (No. 4), (No. 7), (No. 9), (No. 19), (No. 29), (No. 33), (No. 76), (No. 78), (No. 144), (No. 145), (No. 169) and (No. 170) in .
Though the classification of the points of space into Wyckoff positions of a space group is unique, the labelling of the Wyckoff positions by Wyckoff letters (Wyckoff notation) is not.
Example
In a space group there are eight classes of centres of inversion , represented in the spacegroup tables by ; ; . The sitesymmetry groups within each class are `symmetrically equivalent', i.e. they are conjugate subgroups of . The groups of different classes, however, are not `symmetrically equivalent' with respect to . Each class is labelled by one of the Wyckoff letters . This letter depends on the choice of origin and on the choice of coordinate axes. Cyclic permutation of the labels of the basis vectors a, b, c, for instance, induces a cyclic permutation of Wyckoff positions b–c–d and e–f–g; origin shift from 0, 0, 0 to the point results in an exchange of Wyckoff letters in the pairs a–d, b–f, c–e and g–h. Even if the coordinate axes are determined by some extra condition, e.g. , there exist no rules for fixing the origin in when describing a crystal structure. The eight classes of centres of inversion of are well established but none of them is inherently distinguished from the others.
The example shows that the different Wyckoff positions of a space group may permute under an isomorphic mapping of onto itself, i.e. under an automorphism of . Accordingly, it is useful to collect into one set all those Wyckoff positions of a space group that may be permuted by automorphisms of . These sets are called `Wyckoff sets'. The Wyckoff letters belonging to the different Wyckoff positions of the same Wyckoff set are listed by Koch & Fischer (1975); changes in Wyckoff letters caused by changes of the coordinate system have been listed by Boyle & Lawrenson (1973, 1978).
To introduce `Wyckoff sets' more formally, it is advantageous to use the concept of normalizers; cf. Ledermann (1976). The affine normalizer ^{6} of a space group in the group of all affine mappings is the set of those affine mappings which map onto itself. The space group is a normal subgroup of , itself is a subgroup of . The mappings of which are not symmetry operations of may transfer one Wyckoff position of onto another Wyckoff position.
Definition: Let be the normalizer of a space group in the group of all affine mappings. A Wyckoff set with respect to consists of all points X for which the sitesymmetry groups are conjugate subgroups of .
The difference between Wyckoff positions and Wyckoff sets of may be explained as follows. Any Wyckoff position of is transformed onto itself by all elements of , but not necessarily by the elements of the (larger) group . Any Wyckoff set, however, is transformed onto itself even by those elements of which are not contained in .
Remark: A Wyckoff set of is a set of points. Obviously, with each point X it contains all points of the crystallographic orbit of X and all points of the Wyckoff position of X. Accordingly, one can speak not only of `Wyckoff sets of points', but also of `Wyckoff sets of crystallographic orbits' and `Wyckoff sets of Wyckoff positions' of . Wyckoff sets of crystallographic orbits have been used in the definition of lattice complexes (Gitterkomplexe), under the name Konfigurationslage, by Fischer & Koch (1974); cf. Part 14 .
The concepts `crystallographic orbit', `Wyckoff position' and `Wyckoff set' have so far been defined for individual space groups only. It is no problem, but is of little practical interest, to transfer the concept of `crystallographic orbit' to spacegroup types. It would be, on the other hand, of great interest to transfer `Wyckoff positions' from individual space groups to spacegroup types. As mentioned above, however, such a step is not unique. For this reason, the concept of `Wyckoff set' has been introduced to replace `Wyckoff positions'. Different space groups of the same spacegroup type have corresponding Wyckoff sets, and one can define `types of Wyckoff sets' (consisting of individual Wyckoff sets) in the same way that `types of space groups' (consisting of individual space groups) were defined in Section 8.2.2 .
Definition: Let the space groups and belong to the same spacegroup type. The Wyckoff sets of and of belong to the same type of Wyckoff sets if the affine mappings which transform onto also transform onto .
Types of Wyckoff sets have been used by Fischer & Koch (1974), under the name Klasse von Konfigurationslagen, when defining lattice complexes. There are 1128 types of Wyckoff sets of the 219 (affine) spacegroup types and 51 types of Wyckoff sets of the 17 planegroup types [Koch & Fischer (1975) and Chapter 14.1 ].
Relations between crystal structures imply relations between their space groups, which can often be expressed by group–subgroup relations. These group–subgroup relations may be recognized from relations between the lattices and between the point groups of the crystal structures.
Example
The crystal structures of silicon, Si, and sphalerite, ZnS, belong to spacegroup types (No. 227) and (No. 216) with lattice constants and . The structure of sphalerite is obtained from that of silicon by replacing alternately half of the Si atoms by Zn and half by S, and by adjusting the lattice constant. The strong connection between the two crystal structures is reflected in the relation between their space groups: the space group of sphalerite is a subgroup (of index 2) of that of silicon (ignoring the small difference in lattice constants).
Data on sub and supergroups of the space groups are useful for the discussion of structural relations and phase transitions. It must be kept in mind, however, that group–subgroup relations only describe symmetry relations. It is important, therefore, to ascertain that the consequential relations between the atomic coordinates of the particles of the crystal structures also hold, before a structural relation can be deduced from a symmetry relation.
Examples
NaCl and CaF_{2} belong to the same spacegroup type (No. 225) and have lattice constants and , respectively. The ions, however, occupy unrelated positions and so the symmetry relation does not express a structural relation. Pyrite, FeS_{2}, and solid carbon dioxide, CO_{2}, belong to the same spacegroup type (No. 205). They have lattice constants and , respectively, and the particles occupy analogous Wyckoff positions. Nevertheless, the structures of these compounds are not related because the positional parameters of S in FeS_{2} and of O in CO_{2} differ so much that the coordinations of corresponding atoms are dissimilar.
To formulate group–subgroup relations some definitions are necessary:
Definitions: A set of symmetry operations of a space group is called a subgroup of if obeys the group conditions, i.e. is a symmetry group. The subgroup is called a proper subgroup of if there are symmetry operations of not contained in . A subgroup of a space group is called a maximal subgroup of if there is no proper subgroup of such that is a proper subgroup of , i.e. .
Examples:
Maximal subgroups of a space group P1 with lattice vectors a, b, c are, among others, subgroups P1 for which , , , p prime. If p is not a prime number, e.g. , the subgroup is not maximal, because a proper subgroup exists with , , . again has as a proper subgroup with .
has maximal subgroups , Pc and with the same unit cell, whereas P1 is obviously not a maximal subgroup of .
A threedimensional space group may have subgroups with no translations (sitesymmetry groups; cf. Section 8.3.2), with one or twodimensional lattices of translations (line groups, frieze groups, rod groups, plane groups and layer groups), or with a threedimensional lattice of translations (space groups). The number of subgroups of a space group is always infinite.
In this section, only those subgroups of a space group will be considered which are also space groups. This includes all maximal subgroups because a maximal subgroup of a space group is itself a space group. To simplify the discussion, we suppose the set of all maximal subgroups of every space group to be known. In this case, any subgroup of a given space group may be obtained via a chain of maximal subgroups such that where is a maximal subgroup of of index , with ; for the term `index' see below and Section 8.1.6 . There may be many such chains between and . On the other hand, all subgroups of of a given index [i] are obtained if all chains are constructed for which holds.
For example, , , are all possible chains of maximal subgroups for if the original translations are retained completely. The seven subgroups of index [4] with the same translations as the original space group are obtained via the 21 different chains of Fig. 8.3.3.1.

Space group with t subgroups of index [2] and [4]. All 21 possible subgroup chains are displayed by lines. 
Not only the number of all subgroups but even the number of all maximal subgroups of a given space group is infinite. This infinite number, however, only occurs for a certain kind of subgroup and can be reduced as described below. It is thus useful to consider the different kinds of subgroups of a space group in a way introduced by Hermann (1929).
It should be kept in mind that all group–subgroup relations considered here are relations between individual space groups but they are valid for all space groups of a spacegroup type, as the following example shows. A particular space group P2 has a subgroup P1 which is obtained from P2 by retaining all translations but eliminating all rotations and combinations of rotations with translations. For every space group of spacegroup type P2 such a subgroup P1 exists. Thus the relationship exists, in an extended sense, for the two spacegroup types involved. One can, therefore, list these relationships by means of the symbols of the spacegroup types.
For every subgroup of a space group , a `right coset decomposition' of relative to can be defined as The elements of are such that is contained only in the coset . The integer [i], i.e. the number of cosets, is called the index of in ; cf. the footnote to Section 8.1.6.
The index [i] of a subgroup has a geometric significance. It determines the `dilution' of symmetry operations of compared with those of . This dilution can occur in essentially three different ways:
Subgroups of the first kind (i) are called translationengleiche or t subgroups^{7} because the set of all (pure) translations is retained. In case (ii), the point group and thus the crystal class of the space group is unchanged. These subgroups are called klassengleiche or k subgroups. In the general case (iii), both the translation subgroup of and the point group are changed; the subgroup has lost translations and belongs to a crystal class of lower order.
Obviously the third kind (iii) of subgroups is more difficult to survey than kinds (i) and (ii). Fortunately, a theorem of Hermann states that the maximal subgroups of a space group are of type (i) or (ii).
Theorem of Hermann (1929). A maximal subgroup of a space group is either a t subgroup or a k subgroup of .
According to this theorem, subgroups of kind (iii) can never occur among the maximal subgroups. They can, however, be derived by a stepwise process of linking maximal subgroups of types (i) and (ii), as has been shown by the chains discussed above.
The `point group' of a given space group is a finite group. Hence, the number of subgroups and consequently the number of maximal subgroups of is finite. There exist, therefore, only a finite number of maximal t subgroups of . All maximal t subgroups of every space group are listed in the spacegroup tables of this volume; cf. Section 2.2.15 . The possible t subgroups were first listed by Hermann (1935); corrections have been reported by Ascher et al. (1969).
Every space group has an infinite number of maximal k subgroups. For dimensions 1, 2 and 3, however, it can be shown that the number of maximal k subgroups is finite, if subgroups belonging to the same affine spacegroup type as are excluded. The number of maximal subgroups of belonging to the same affine spacegroup type as is always infinite. These subgroups are called maximal isomorphic subgroups. In Part 13 isomorphic subgroups are treated in detail. In the spacegroup tables, only data on the isomorphic subgroups of lowest index are listed. The way in which the isomorphic and nonisomorphic k subgroups are listed in the spacegroup tables is described in Section 2.2.15 .
Remark: Enantiomorphic space groups have an infinite number of maximal isomorphic subgroups of the same type and an infinite number of maximal isomorphic subgroups of the enantiomorphic type.
Example
All k subgroups of a given space group , with basis vectors being any prime number except 3, are maximal isomorphic subgroups. They belong to spacegroup type if any integer. They belong to the enantiomorphic spacegroup type if .
Even though in the spacegroup tables some kinds of maximal subgroups are listed completely whereas others are listed only partly, it must be emphasized that in principle there is no difference in importance between t, nonisomorphic k and isomorphic k subgroups. Roughly speaking, a group–subgroup relation is `strong' if the index [i] of the subgroup is low. All maximal t and maximal nonisomorphic k subgroups have indices less than four in and five in , index four already being rather exceptional. Maximal isomorphic k subgroups of arbitrarily high index exist for every space group.
Sometimes a space group is known and the possible space groups , of which is a subgroup, are of interest.
Definition: A space group is called a minimal supergroup of a space group if is a maximal subgroup of .
Examples
In Fig. 8.3.3.1, the space group is a minimal supergroup of is a minimal supergroup of and P312; etc.
If is a maximal t subgroup of then is a minimal t supergroup of . If is a maximal k subgroup of then is a minimal k supergroup of . Finally, if is a maximal isomorphic subgroup of , then is a minimal isomorphic supergroup of . Data on minimal t and minimal nonisomorphic k supergroups are listed in the spacegroup tables; cf. Section 2.2.15 . Data on minimal isomorphic supergroups are not listed because they can be derived easily from the corresponding subgroup relations.
The complete data on maximal subgroups of plane and space groups are listed in Volume A1 of International Tables for Crystallography (2004). For each space group, all maximal subgroups of index [2], [3] and [4] are listed individually. The infinitely many maximal isomorphic subgroups are listed as members of a few (infinite) series. The main parameter in these series is the index p, or , where p runs through the infinite number of primes.
The sequence of spacegroup entries in the spacegroup tables follows that introduced by Schoenflies (1891) and is thus established historically. Within each geometric crystal class, Schoenflies has numbered the spacegroup types in an obscure way. As early as 1919, Niggli (1919) considered this Schoenflies sequence to be unsatisfactory and suggested that another sequence might be more appropriate. Fedorov (1891) used a different sequence in order to distinguish between symmorphic, hemisymmorphic and asymmorphic space groups.
The basis of the Schoenflies symbols and thus of the Schoenflies listing is the geometric crystal class. For the present Tables, a sequence might have been preferred in which, in addition, spacegroup types belonging to the same arithmetic crystal class were grouped together. It was decided, however, that the longestablished sequence in the earlier editions of International Tables should not be changed.
In Table 8.3.4.1, those geometric crystal classes are listed in which the Schoenflies sequence separates space groups belonging to the same arithmetic crystal class. The space groups are rearranged in such a way that space groups of the same arithmetic crystal class are grouped together. The arithmetic crystal classes are separated by rules spanning the first three columns of the table and the geometric crystal classes are separated by rules spanning the full width of the table. In all cases not listed in Table 8.3.4.1, the Schoenflies sequence, as used in these Tables, does not break up arithmetic crystal classes. Nevertheless, some rearrangement would be desirable in other arithmetic crystal classes too. For example, the symmorphic space group should always be the first entry of each arithmetic crystal class.

In group theory, a set of generators of a group is a set of group elements such that each group element may be obtained as an ordered product of the generators. For space groups of one, two and three dimensions, generators may always be chosen and ordered in such a way that each symmetry operation can be written as the product of powers of h generators . Thus, where the powers are positive or negative integers (including zero).
Description of a group by means of generators has the advantage of compactness. For instance, the 48 symmetry operations in point group can be described by two generators. Different choices of generators are possible. For the present Tables, generators and generating procedures have been chosen such as to make the entries in the blocks General position (cf. Section 2.2.11 ) and Symmetry operations (cf. Section 2.2.9 ) as transparent as possible. Space groups of the same crystal class are generated in the same way (for sequence chosen, see Table 8.3.5.1), and the aim has been to accentuate important subgroups of space groups as much as possible. Accordingly, a process of generation in the form of a `composition series' has been adopted, see Ledermann (1976). The generator is defined as the identity operation, represented by (1) x, y, z. , and are the translations with translation vectors a, b and c, respectively. Thus, the coefficients , and may have any integral value. If centring translations exist, they are generated by translations (and in the case of an F lattice) with translation vectors d (and e). For a C lattice, for example, d is given by . The exponents (and ) are restricted to the following values:

Lattice letter A, B, C, I: or 1.
Lattice letter R (hexagonal axes): , 1 or 2.
Lattice letter F: or 1; or 1.
As a consequence, any translation of with translation vector can be obtained as a product where are integers determined by . and are enclosed between parentheses because they are effective only in centred lattices.
The remaining generators generate those symmetry operations that are not translations. They are chosen in such a way that only terms or occur. For further specific rules, see below.
The process of generating the entries of the spacegroup tables may be demonstrated by the example of Table 8.3.5.2, where denotes the group generated by . For , the next generator has always been taken as soon as , because in this case no new symmetry operation would be generated by . The generating process is terminated when there is no further generator. In the present example, completes the generation: .

For the nontranslational generators, the following sequence has been adopted:

For the space groups with lattice symbol P, the generation procedure has given the same triplets (except for their sequence) as in IT (1952). In nonP space groups, the triplets listed sometimes differ from those of IT (1952) by a centring translation.
The concept of normalizers, well known to mathematicians since the nineteenth century, is finding more and more applications in crystallography. Normalizers play an important role in the general theory of space groups of ndimensional space. By the socalled Zassenhaus algorithm, one can determine the spacegroup types of ndimensional space, provided the arithmetic crystal classes and for each arithmetic crystal class a representative integral matrix group are known. The crucial step is then to determine for these matrix groups their normalizers in GL(n, Z). This was done for by Brown et al. (1978) in the derivation of the 4894 spacegroup types. Now, the program package Carat solves this problem and was used, among others, for the enumeration of the 28 927 922 affine spacegroup types for sixdimensional space, see Table 8.1.1.1 .
Crystallographers have been applying normalizers in their practical work for some time without realizing this fact, and only in the last decades have they become aware of the importance of normalizers. Normalizers first seem to have been derived visually, see Hirshfeld (1968). A derivation of the normalizers of the space groups using matrix methods is found in a paper by Boisen et al. (1990).
For the practical application of normalizers in crystallographic problems, see Part 15 , which also contains detailed lists of normalizers of the point groups and space groups, as well as of space groups with special metrics. In this section, a short elementary introduction to normalizers will be presented.
In Section 8.1.6 , the elements of a space group have been divided into classes with respect to the subgroup of all translations of ; these classes have been called cosets. `Coset decomposition' can be performed for any pair `group and subgroup '. The subgroup is called normal if the decomposition of into right and left cosets results in the same cosets.
The decomposition of the elements of a group into `conjugacy classes' is equally important in crystallography. These classes are defined as follows:
Definition: The elements and of a group are said to be conjugate in , if there exists an element such that .
Example
The symmetry group 4mm of a square consists of the symmetry operations 1, 2, 4, , , , and , see Fig. 8.3.6.1. Vertex 1 is left invariant by 1 and , vertex 2 by 1 and . The operations and are conjugate, because 4 holds, as are and , or 4 and . The operations 1 and 2 have no conjugates.
As proved in mathematical textbooks, e.g. Ledermann (1976), conjugacy indeed subdivides a group into classes of elements. The unit element 1 always forms a conjugacy class for itself, as does any element that commutes with every other element of the group. For finite groups, the number of elements in a conjugacy class is a factor of the group order. In infinite groups, such as space groups, conjugacy classes may contain an infinite number of elements.
Conjugacy can be transferred from elements to groups. Let be a subgroup of . Then another subgroup of is said to be conjugate to in , if there exists an element , such that . In this way, the set of all subgroups of a group is divided into classes of conjugate subgroups or conjugacy classes of subgroups. Conjugacy classes may contain different numbers of subgroups but, for finite groups, the number of subgroups in each class is always a factor of the order of the group. Conjugacy classes which contain only one subgroup are of special interest; they are called normal subgroups. There are always two trivial normal subgroups of a group : the group itself and the group consisting of the unit element 1 only. For space groups, the group of all translations of the group always forms a normal subgroup of .
In the abovementioned example of the square, the subgroups and as well as and each form conjugate pairs, whereas the subgroups , , and are normal subgroups.
The characterization of normal subgroups, must obey the condition for all elements , is identical with the one used in Section 8.1.6 . This relation can also be expressed as which means that the right and left cosets coincide. Thus each subgroup of index [2] is normal, because there is only one coset in addition to itself which is then necessarily the right as well as the left coset.
If is not a normal subgroup of , then cannot hold for all , because there is at least one subgroup of which is conjugate to . This situation leads to the introduction of the normalizer of a subgroup of .
The normalizer is always a group and thus a subgroup of which obeys the relation . The symbol means that is a normal subgroup of . The subgroup is normal in if its normalizer coincides with . Otherwise, other subgroups conjugate to exist. To determine the number of conjugate subgroups of , one decomposes into cosets relative to . The elements of each such coset transform into a conjugate subgroup , such that the number of conjugates (including itself) equals the index of in .
Examples

Obviously, it would be impractical to list the normalizer for each type of group–subgroup pair. There are, however, some normalizers of outstanding importance from which, moreover, the normalizers determining the usual conjugacy relations can be obtained easily. Since space groups are groups of motions and spacegroup types are affine equivalence classes of space groups, cf. Sections 8.1.6 and 8.2.2 , the groups of all motions and of all affine mappings are groups of special significance for any space group. The normalizers of a space group relative to these two groups are considered now. Part 15 contains lists of these normalizers with detailed comments.
The normalizer of a space group in the group of all affine mappings is called the affine normalizer of the space group . The affine normalizers of space groups of the same spacegroup type are affinely equivalent. One thus can speak of the `type of normalizers of a spacegroup type'. In many cases, these normalizers are either space groups or isomorphic to space groups, but they may also be other groups due to arbitrarily small translations (for polar space groups) and/or due to noncrystallographic point groups (for triclinic and monoclinic space groups).
Affine normalizers are of more theoretical interest. For example, they determine the occurrence of enantiomorphism of space groups, cf. Section 8.2.2 . A spacegroup type splits into a pair of enantiomorphic spacegroup types, if and only if its normalizers are contained in , the group of all affine mappings with positive determinant.
The normalizer of a space group in the group of all motions (Euclidean group) is called the Euclidean normalizer of the space group . For all trigonal, tetragonal, hexagonal and cubic space groups, holds. In these cases, as well as in any context in which statements are valid for both normalizers, the abbreviated form is frequently used.
The group of all translations of is the same for both normalizers, and , because any translation is a motion. It can be calculated easily: To be an element of , the translation (I, t) has to satisfy the equation for any operation (W, w) of . This results in or and . From this follows, i.e. must be a lattice translation of . To determine , it is sufficient to apply this equation to the of the generators of .
The conditions for the groups are the same for all space groups of the same arithmetic crystal class, because those space groups are generated by symmetry operations with the same matrix parts, and their lattices belong to the same centring type, if referred to conventional coordinate systems. The other elements of the normalizer are not obtained as easily.
In contrast to , the type of is not a property of the spacegroup type, as the following example shows. The Euclidean normalizer of a space group P222 is an orthorhombic space group Pmmm if . It is a tetragonal space group if accidentally (or or ), and it is even cubic if accidentally . The listings in Part 15 also contain the normalizers for the case of lattices with accidental symmetries.
Acknowledgements
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 LooijengaVos, 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 and Part 15 . L. Laurence Boyle, Canterbury, improved the English style and made constructive remarks.
References
Ascher, E., Gramlich, V. & Wondratschek, H. (1969). Korrekturen zu den Angaben `Untergruppen' in den Raumgruppen der Internationalen Tabellen zur Bestimmung von Kristallstrukturen (1935), Band 1. Acta Cryst. B25, 2154–2156.Boisen, M. B. Jr, Gibbs, G. V. & Wondratschek, H. (1990). Derivation of the normalizers of the space groups. Acta Cryst. A46, 545–552.
Boyle, L. L. & Lawrenson, J. E. (1973). The origin dependence of the Wyckoff site description of a crystal structure. Acta Cryst. A29, 353–357.
Boyle, L. L. & Lawrenson, J. E. (1978). The dependence of the Wyckoff site description of a crystal structure on the labelling of the axes. Comm. R. Soc. Edinburgh (Phys. Sci.), 1, 169–175.
Brown, H., Bülow, R., Neubüser, J., Wondratschek, H. & Zassenhaus, H. (1978). Crystallographic groups of fourdimensional space. New York: Wiley.
Burzlaff, H. & Zimmermann, H. (1980). On the choice of origins in the description of space groups. Z. Kristallogr. 153, 151–179.
Fedorov, E. S. (1891). The symmetry of regular systems of figures. (In Russian.) [English translation by D. & K. Harker (1971). Symmetry of crystals, pp. 50–131. American Crystallographic Association, Monograph No. 7.]
Fischer, W. & Koch, E. (1974). Eine Definition des Begriffs `Gitterkomplex'. Z. Kristallogr. 139, 268–278.
Fischer, W. & Koch, E. (1978). Limiting forms and comprehensive complexes for crystallographic point groups, rod groups and layer groups. Z. Kristallogr. 147, 255–273.
Hermann, C. (1929). Zur systematischen Strukturtheorie. IV. Untergruppen. Z. Kristallogr. 69, 533–555.
Hermann, C. (1935). Internationale Tabellen zur Bestimmung von Kristallstrukturen, Band 1. Berlin: Borntraeger.
Hirshfeld, F. L. (1968). Symmetry in the generation of trial structures. Acta Cryst. A24, 301–311.
International Tables for Crystallography (2004). Vol. A1, Symmetry relations between space groups, edited by H. Wondratschek & U. Müller. Dordrecht: Kluwer Academic Publishers.
International Tables for Xray Crystallography (1952). Vol. I. Symmetry groups, edited by N. F. M. Henry & K. Lonsdale. Birmingham: Kynoch Press.
Koch, E. & Fischer, W. (1975). Automorphismengruppen von Raumgruppen und die Zuordnung von Punktlagen zu Konfigurationslagen. Acta Cryst. A31, 88–95.
Ledermann, W. (1976). Introduction to group theory. London: Longman.
Matsumoto, T. & Wondratschek, H. (1979). Possible superlattices of extraordinary orbits in 3dimensional space. Z. Kristallogr. 150, 181–198.
Niggli, P. (1919). Geometrische Kristallographie des Diskontinuums. Leipzig: Borntraeger. [Reprint: Sändig, Wiesbaden (1973).]
Schoenflies, A. (1891). Krystallsysteme und Krystallstructur. Leipzig: Teubner. [Reprint: Springer, Berlin (1984).]
Sohncke, L. (1879). Entwickelung einer Theorie der Krystallstruktur. Leipzig: Teubner.
Wondratschek, H. (1976). Extraordinary orbits of space groups. Theoretical considerations. Z. Kristallogr. 143, 460–470.
Wondratschek, H. (1980). Crystallographic orbits, lattice complexes, and orbit types. Match, 9, 121–125.