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. 9.3, pp. 756760
https://doi.org/10.1107/97809553602060000519 Chapter 9.3. Further properties of lattices^{a}Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostranské nám. 25, CZ11800 Prague 1, Czech Republic In this chapter, several less well known aspects of lattices, concerning mainly their classification, are treated. In Section 9.3.1, the fact that the cell fulfilling a + b + c = min (Buerger cell) is generally not unique in the lattice is discussed. To achieve uniqueness, various additional conditions must be added. Four of them are shown. They minimize or maximize either the surface or the `deviation' 90° − α + 90° − β + 90° − γ of the cell given above. One of these unique cells coincides with the generally used Niggli cell, which thus has a significant geometrical property. In Section 9.3.2, the 44 lattice characters (see Section 9.2.5 ) are discussed. These lattice characters represent a finer partition of lattices that the 14 Bravais types. Although the original definition of lattice characters is perhaps rather vague, they can be rigorously introduced using the topological concepts of connectedness and convexity. In Section 9.3.3, another important division of lattices, into the 24 Delaunay sorts (symmetrische Sorten) is discussed. However, the Delaunay sorts are not compatible with the lattice characters. The search for a common subdivision of both leads finally to a very detailed division of lattices into 127 genera. Their definition is based on the decomposition of fivedimensional polyhedra into their interior, hyperfaces, edges and vertices. Genera form a remarkably strong bond between lattices and can be considered as building blocks for various classifications of lattices. In Section 9.3.4, it is found that the conditions characterizing the conventional cells of the 14 Bravais types (see Section 9.1.7 ) are only necessary. To make them sufficient as well, they have to be extended to a more comprehensive system. Particularly interesting relations appear between Bravais types mI and hR. In Section 9.3.5, topological methods (connectedness) are used for the set of points whose coordinates are parameters of the conventional cell to obtain a subdivision of the Bravais types into 22 conventional characters. They form a superdivision of the lattice characters. The concept of convexity, however, is not applicable in this case. In Section 9.3.6, a simple formula for the number of sublattices of arbitrary index of an ndimensional (n ≥ 1) lattice is given. Keywords: reduced bases; lattices; Niggli cell; Buerger cell; reduced cells; Niggli images; lattice characters; conventional characters; symmetrische Sorten; conventional cells; sublattices. 
In Section 9.2.2, a `reduced basis' of a lattice is defined which permits a unique representation of this lattice. It was introduced into crystallography by Niggli (1928) and incorporated into International Tables for Xray Crystallography (1969), Vol. I. Originating from algebra (Eisenstein, 1851), a reduced basis is defined in a rather complicated manner [conditions (9.2.2.2a ) to (9.2.2.5f) in Section 9.2.2 ] and lacks any geometrical meaning. A cell spanned by a reduced basis is called the Niggli cell.
However, unique primitive cells may be introduced also in other ways that – unlike the Niggli cell^{1} – have significant geometrical features based mainly on extremal principles (Gruber, 1989). We shall describe some of them below.
If a (primitive) cell of the lattice L fulfils the condition on the set of all primitive cells of L, we call it a Buerger cell. This cell need not be unique with regard to its shape in the lattice. There exist lattices with 1, 2, 3, 4 and 5 (but not more) Buerger cells differing in shape. The uniqueness can be achieved by various additional conditions. In this way, we can arrive at the following four reduced cells:
Equivalent definitions can be obtained by replacing the term `surface' in (i) and (ii) by the expression or and by replacing the `deviation' in (iii) and (iv) by or A Buerger cell can agree with more than one of the definitions For example, if a lattice has only one Buerger cell, then this cell agrees with all the definitions in (9.3.1.1). However, there exist also Buerger cells that are in agreement with none of them. Thus, the definitions (9.3.1.1) do not imply a partition of Buerger cells into classes.
It appears that case (iv) coincides with the Niggli cell. This is important because this cell can now be defined by a simple geometrical property instead of a complicated system of conditions.
Further reduced cells can be obtained by applying the definitions (9.3.1.1) to the reciprocal lattice. Then, to a Buerger cell in the reciprocal lattice, there corresponds a primitive cell with absolute minimum surface^{4} in the direct lattice.
The reduced cells according to the definitions (9.3.1.1) can be recognized by means of a table and found in the lattice by means of algorithms. Detailed mutual relationships between them have been ascertained.
In his thorough analysis of lattice characters, de Wolff (1988) remarks that so far they have not been defined as clearly as the Bravais types and that an exact general definition does not exist. Gruber (1992) tried to base such a definition on topological concepts.
The crucial notion is the decomposition of a set M of points of the ndimensional Euclidean space into equivalence classes called components of the set M. They can be defined as follows: Two points X,Y of the set M belong to the same component if they can be connected by a continuous path which lies entirely in the set M (Fig. 9.3.2.1). This partition of the set M into components is unique and is determined solely by the set M.
Now let us return to lattices. To any lattice L there is attached a point in called the Niggli point of L. It is the point provided that the vectors a, b, c describe the Niggli cell of L and fulfil the conditions (9.2.2.2a ) to (9.2.2.5f) of Section 9.2.2 . If is a set of lattices then the set of Niggli points of all lattices of is called the Niggli image of .
Thus we can speak about the Niggli image of a Bravais type . This Niggli image is a part of and so can be partitioned into components. This division of Niggli points induces back a division of lattices of the Bravais type . It turns out that this division is identical with the division of into lattice characters as introduced in Section 9.2.5 . This fact, used conversely, can be considered an exact definition of the lattice characters: Two lattices of Bravais type are said to be of the same lattice character if their Niggli points lie in the same component of the Niggli image of .
We can, of course, also speak about Niggli images of particular lattice characters. According to their definition, these images are connected sets. However, much more can be stated about them: these sets are even convex (Fig. 9.3.2.2). This means that any two points of the Niggli image of a lattice character can be connected by a straight segment lying totally in this Niggli image. From this property, it follows that the lattice characters may be defined also in the following equivalent way:
We say that two lattices of the same Bravais type belong to the same lattice character if one of them can be deformed into the other in such a way that the Niggli point of the deformed lattice moves linearly from the initial to the final position while the Bravais type of the lattice remains unchanged.
Unlike convexity, nothing can be said whether the Niggli images of lattice characters are open sets (with regard to their dimension) or not. Both cases occur.
The lattice character of a lattice L can also be recognized [instead of by means of Table 9.2.5.1 or by Tables 1 and 3 in Gruber (1992)] by perpendicular projection of the c vector onto the ab plane provided the vectors a, b, c describe the Niggli cell of L and fulfil the conditions (9.2.2.2a ) to (9.2.2.5f) in Section 9.2.2 (de Wolff & Gruber, 1991). See also Figs. 9.2.4.1 to 9.2.4.5 .
The 44 lattice characters form a subdivision of the 14 Bravais types. There is another commonly known subdivision of the Bravais types, namely the 24 Delaunay sorts (symmetrische Sorten) (Delaunay, 1933; International Tables for Xray Crystallography, 1952, Vol. I; cf. Section 9.1.8 ). However, both divisions, being based on quite different principles, are incompatible: the 44 lattice characters do not form a subdivision of the 24 Delaunay sorts.
A natural problem arises to construct a division of lattices which would be a subdivision of both the lattice characters and the Delaunay sorts. However, we do not admit a purely mechanical intersection of both these divisions; we insist that their common subdivision be crystallographically meaningful.
Such a division was proposed recently (Gruber, 1997a). It uses the fact that the Niggli points of all lattices lie in two fivedimensional polyhedra, say and . The underlying idea, originating from H. Wondratschek, is based on the distribution of Niggli points among the vertices, edges, faces, three and fourdimensional hyperfaces, and the interior of and . This leads to a natural division of Niggli points and further to a division of lattices. This division has 67 classes, but is not suitable for crystallography because it does not constitute a subdivision of the Bravais types.
A modification of the idea is necessary. It consists of representing a lattice L by several points (instead of by one Niggli point) and the addition of two minor conditions. One of them concerns the diagonals of the Niggli cell and the other the bases of L which describe the Niggli cell.
Though these conditions are of little importance in themselves, they lead to a very useful notion, viz the division of all lattices into 127 classes which is a subdivision of both the lattice characters and the Delaunay sorts. The equivalence classes of this division are called genera. They form, in a certain sense, building blocks of both lattice characters and Delaunay sorts and show their mutual relationship.
The distribution of genera along the Bravais types is the following (the number of genera is given in parentheses): cP(1), cI(1), cF(1), tP(2), tI(5), oP(1), oC(8), oI(7), oF(3), hP(3), hR(4), mP(5), mC(43), aP(43). Thus, genera seem to be especially suitable for a finer classification of lattices of low symmetry.
The genus of a given lattice L can be determined – provided that the Niggli point of L is known – by means of a table containing explicit descriptions of all genera. These descriptions are formed by open linear systems of inequalities. Consequently, the ranges of conventional parameters of genera are open unlike those concerning the lattice characters.
Genera are denoted by symbols derived from the geometrical shape of and . They can be visualized in the threedimensional cross sections of these bodies. This gives a fairly good illustration of the relationships between genera.
However, the most important feature of genera seems to be the fact that lattices of the same genus agree in a surprisingly great number of crystallographically significant properties, such as the number of Buerger cells, the densest directions and planes, the symmetry of these planes etc. Even the formulae for the conventional cells are the same. The genus appears to be a remarkably strong bond between lattices.
Conventional cells are dealt with in Chapter 9.1 . They are illustrated in Fig. 9.1.7.1 and described in Table 9.1.7.2 . This description, however, is not exhaustive enough for determining the Bravais type. In mathematical terms, the conditions in Table 9.1.7.2 are necessary but not sufficient. For example, the Ccentred cell with has the typical shape of a conventional cell of an mC lattice. But the lattice generated by the Ccentred cell (9.3.4.1) is actually hR with the conventional rhombohedral basis vectors
It is a natural goal to establish a system of conditions for the conventional cells which would be not only necessary but also sufficient. This is done in Table 9.3.4.1. In order to make the conditions as simple as possible, the usual mC description of the monoclinic centred lattices is replaced by the mI description. The relation between the two descriptions is simple: The exact meaning of Table 9.3.4.1 is as follows: Suppose that a Bravais type different from aP is given and that its symbol appears in column 1 in the ith entry of Table 9.3.4.1. Then a lattice L is of this Bravais type if and only if there exists a cell (a, b, c) in L such that

Lattice characters were defined in Section 9.3.2 by dividing the Niggli image of a certain Bravais type into components. Doing the same – instead of with the Niggli points – with the parameters of conventional cells^{5} of lattices of the Bravais type we obtain a division of the range^{6} of these parameters into components. This leads to a further division of lattices of the Bravais type into equivalence classes. We call these classes – in analogy to the Niggli characters – conventional characters. There are 22 of them.
Two lattices of the same Bravais type belong to the same conventional character if and only if one lattice can be deformed into the other in such a way that the conventional parameters of the deformed lattice change continuously from the initial to the final position without change of the Bravais type. The word `continuously' cannot be replaced by the stronger term `linearly' because the range of conventional parameters of the monoclinic centred lattices is not convex.
Conventional characters form a superdivision of the lattice characters. Therefore, no special notation of conventional characters need be invented: we write them simply as sets of lattice characters which constitute the conventional character. Denoting the lattice characters by integral numbers from 1 to 44 (according to the convention in Section 9.2.5 ), we obtain for the conventional characters symbols like or .
Conventional characters are described in Table 9.3.5.1.

A sublattice of an ndimensional lattice L is a proper subset of L which itself is a lattice of the same dimension as L. A sublattice of L causes a decomposition of the set L into, say, i mutually congruent sublattices, itself being one of them (Fig. 9.3.6.1). The number i is called the index of the sublattice and indicates how many times is `diluted' with respect to L.
Sublattices are defined in a natural way in those lattices that have centred conventional cells, being generated by the vertices of these cells (`decentring'). They are primitive and belong to the same crystal family as the given lattice. Thus, in the cI, cF, tI, oI, oF, oC, mC and hR ^{7} lattices, we can meet sublattices of indices 2, 4, 2, 2, 4, 2, 2 and 3, respectively.
Theoretically (though hardly in crystallographic practice), the Bravais type of centred lattices can also be determined by testing all their sublattices with the suspected index and finding in any of these sublattices the Niggli cell.
All sublattices of index i of an ndimensional lattice L can be constructed by a procedure suggested by Cassels (1971). If is a primitive basis of the lattice L then primitive bases of all sublattices of index i of the lattice L can be found by the relations where the matrix fulfils The number of these matrices is equal to the number of decompositions of an ndimensional lattice L into sublattices of index i. To determine this number, it is not necessary to construct explicitly the matrices fulfilling (9.3.6.1). The following formulae (Gruber, 1997b) can be used:
For example, for and i = 2, 3, 4 and 6, we obtain for the values 7, 13, 35 and 91, respectively.
In all considerations so far, the symmetry of the lattice L was irrelevant. We took L simply as a set of points and its sublattices as its subsets. (Thus, for illustrating sublattices, the `triclinic' lattices are most apt; cf. `derivative lattices' in Chapter 13.2 .)
However, this is not exactly the crystallographic point of view. If, for example, the mesh of the lattice L in Fig. 9.3.6.1 were a square, the sublattices in cases (a) and (b) would have the same symmetry (though being different subsets of L) and therefore would be considered by crystallographers as one case only. The number would be reduced. From this aspect, the problem is treated in Chapter 13.1 in grouptheoretical terms which are more suitable for this purpose than the settheory language used here.
References
Cassels, J. W. S. (1971). An introduction to the geometry of numbers, p. 13. Berlin: Springer.Google ScholarDelaunay, B. N. (1933). Neuere Darstellung der geometrischen Kristallographie. Z. Kristallogr. 84, 109–149.Google Scholar
Eisenstein, G. (1851). Tabelle der reducierten positiven quadratischen Formen nebst den Resultaten neuer Forschungen über diese Formen, insbesondere Berücksichtigung auf ihre tabellarische Berechung. J. Math. (Crelle), 41, 141–190.Google Scholar
Gruber, B. (1989). Reduced cells based on extremal principles. Acta Cryst. A45, 123–131.Google Scholar
Gruber, B. (1992). Topological approach to the Niggli lattice characters. Acta Cryst. A48, 461–470.Google Scholar
Gruber, B. (1997a). Classification of lattices: a new step. Acta Cryst. A53, 505–521.Google Scholar
Gruber, B. (1997b). Alternative formulae for the number of sublattices. Acta Cryst. A53, 807–808.Google Scholar
International Tables for Xray Crystallography (1952). Vol. I, edited by N. F. M. Henry & K. Lonsdale, pp. 530–535. Birmingham: Kynoch Press.Google Scholar
International Tables for Xray Crystallography (1969). Vol. I, 3rd ed., edited by N. F. M. Henry & K. Lonsdale, pp. 530–535. Birmingham: Kynoch Press.Google Scholar
Niggli, P. (1928). Kristallographische und strukturtheoretische Grundbegriffe. Handbuch der Experimentalphysik, Vol. 7, Part 1. Leipzig: Akademische Verlagsgesellschaft.Google Scholar
Wolff, P. M. de (1988). Definition of Niggli's lattice characters. Comput. Math. Appl. 16, 487–492.Google Scholar
Wolff, P. M. de & Gruber, B. (1991). Niggli lattice characters: definition and graphical representation. Acta Cryst. A47, 29–36.Google Scholar