Exact direct-space asymmetric units for the 230 crystallographic space groups.

It is well known that the direct-space asymmetric unit definitions found in the International Tables for Crystallography, Volume A, are inexact at the borders. Face- and edge-specific sub-conditions have to be added to remove parts redundant under symmetry. This paper introduces a concise geometric notation for asymmetric unit conditions. The notation is the foundation for a reference table of exact direct-space asymmetric unit definitions for the 230 crystallographic space-group types. The change-of-basis transformation law for the conditions is derived, which allows the information from the reference table to be used for any space-group setting. We also show how the vertices of an asymmetric unit can easily be computed from the information in the reference table.

Introduction

In the presence of symmetry, the concept of an asymmetric unit (also known as fundamental region in mathematics) is important for many practical applications, for example to avoid time-consuming redundant calculations or to suppress redundant output. International Tables for Crystallography, Volume A (ITA) (Hahn, 2005 ▸) defines the direct-space asymmetric unit of a crystallographic space group (DAU) as ‘the smallest part of space from which, by application of all symmetry operations of the space group, the whole of space is filled exactly’ (ITA §2.2.8). This paper focuses on definitions of exact DAUs. These are refinements of the ITA conditions, which are sets of inequalities for each space group that must be true simultaneously for a point with fractional coordinates to be inside the DAU, for example ; ; for space group . The ITA conditions define the DAU shapes but are inexact for the borders. For example, the ITA conditions are true for all eight vertices of the DAU parallelepiped, but according to the definition in ITA §2.2.8 only two of these points can be in the exact asymmetric unit. To make a DAU exact, sub-conditions have to be added to the shape conditions, specific to faces and edges. Koch & Fischer (1974 ▸) published exact DAU definitions for the cubic space groups. In Grosse-Kunstleve et al. (2003 ▸) we presented an overview of an online gallery of exact DAUs for all 230 crystallographic space groups. Chapter 1.5 of Shmueli (2008 ▸) and the KVEC server at http://www.cryst.ehu.es also offer exact DAU definitions, but the DAU shapes are partially incompatible with those of ITA. In this paper we introduce a concise geometric notation which is the foundation for a reference table of exact DAUs, using the same definitions as in our previous work, which are fully compatible with those of ITA.

Geometric cut notation and expressions

This section defines a concise geometric notation that has greatly accelerated the progress of this work. As will become apparent below, the notation enables a systematic, intuitive labelling of planes that define an exact DAU.

Similar to the ITA approach, a DAU shape is defined by a list of inequalities. We work with the general form or are Miller indices that define the normal vector of a plane, is a scalar constant which determines the distance of the plane from the origin, and are fractional coordinates in direct space. We call both equations a cut since the geometric interpretation is a division of direct space into two halves. The left-hand side of the equations is exactly zero for points inside the cut plane. The inequalities are defined to be true for points inside the DAU. Equation (1) is used if a region of the cut plane is inside the DAU and equation (2) is used if the entire plane is outside. To facilitate a concise representation of DAU definitions, we introduce a cut notation. The general form is orcorresponding to equations (1) and (2), respectively. To obtain intuitive labels for DAU cut planes, we use the geometric cut symbols defined in Table 1 ▸, for example . Relationships between cuts can be formalized via cut expressions using unary and binary operators defined as follows: The variable is a scalar value. Each of the operators defined in equations (5) –(8) has a simple geometric interpretation. The ‘−’ operator defined by equation (5) corresponds to a reversal of ‘inside’ and ‘outside’. The ‘~’ operator defined by equation (6) acts like a centre of inversion at the origin; see Figs. 1 ▸(b) and 1 ▸(c) for an example. The multiplication and division operators defined by equations (7) and (8) provide a notation for parallel shifts, as highlighted by Fig. 1 ▸(a).

Table 1

Definition of geometric cut symbols used in Table 2 ▸

See Fig. 1 ▸ for geometric illustrations of the main symbols.

Symbol	h, k, l	c	Expression
x 1	(1, 0, 0)	1
x 0			x 10
x 2			x 1/2
x 3			x 1/3
x 4			x 1/4
x 8			x 1/8
x 34			x 13/4
y 1	(0, 1, 0)	1
y 0			y 10
y 2			y 1/2
y 3			y 1/3
y 4			y 1/4
y 8			y 1/8
z 1	(0, 0, 1)	1
z 0			z 10
z 2			z 1/2
z 3			z 1/3
z 4			z 1/4
z 6			z 1/6
z 8			z 1/8
z 12			z 1/12
p 1	(1, 1, 0)	1
p 0			p 10
p 2			p 1/2
p 3			p 1/3
p 4			p 1/4
m 1	(1, 1, 0)	1
m 0			m 10
m 2			m 1/2
m 4			m 1/4
h 1	(1, 2, 0)	1
h 0			h 10
k 1	(2, 1, 0)	1
k 0			k 10
xz 1	(1, 0, 1)	1
xz 0			xz 10
xz 2			xz 1/2
xz 4			xz 1/4
zx 1	(1, 0, 1)	1
zx 0			zx 10
zx 2			zx 1/2
yz 1	(0, 1, 1)	1
yz 0			yz 10
yz 2			yz 1/2
yz 4			yz 1/4
zy 1	(0, 1, 1)	1
zy 0			zy 10
zy 2			zy 1/2
zy 4			zy 1/4
dy 8	(1, 1, 1)	1/8
tx 0	(2, 1, 1)	0
ty 0	(1, 2, 1)	0
tz 2	(2, 1, 1)	1/2

Primary geometric cut symbols are defined directly by a normal and constant. Secondary geometric cut symbols are defined by a cut expression based on a primary symbol. Note that the normal vector of all cuts with a ‘0’ subscript in the geometric cut symbol is the opposite of the normal vector of the other cut planes in the same flock. This convention greatly reduces the number of minus signs in the exact DAU definitions of Table 2 ▸.

Figure 1

Illustrations of selected cut planes with geometric cut symbols x , p , m , h and k . The (x, y, 0) plane of a unit cell is outlined with thin lines. The unit-cell origin is labelled with 0, the basis vectors with a and b. The traces of cut planes are indicated with thick lines; small attached triangles indicate the ‘inside’ direction. (a) Geometric interpretation of equations (7) and (8) using the x flock as an example. (b) Cut planes in the p and m flocks as they appear in a tetragonal system. The p 2 and ~ p 2 cut planes illustrate the geometric interpretation of equation (6). (c) Cut planes in the p , m , h and k flocks as they appear in a trigonal or hexagonal system.

The DAU conditions of ITA have a straightforward correspondence to our cut definition. We call the ITA conditions shape cuts. We employ the concept of context to avoid redundancy in the definition of sub-conditions specific to a given DAU face by appending the sub-conditions to the corresponding shape cut, surrounded by parentheses; such a cut is a face cut. Similarly, sub-conditions specific to a given edge are appended to a corresponding face cut, again surrounded by parentheses, and are called edge cuts. In some cases, the DAU choices of ITA necessitate the combination of cuts via logical conjunction or disjunction. Following common practice, we chose the symbol ‘&’ for conjunction and ‘|’ for disjunction. To give an example, the cut expression appears for space group (No. 112), using the geometric cut notation of Table 1 ▸. Here is a shape cut. The expression in the outer pair of parentheses is a face cut, composed of the logical conjunction z 4 & z 0. The expression in the inner pair of parentheses () is an edge cut. As an example, a full step-by-step interpretation of equation (9) is shown in Appendix A .

The symbols in Table 1 ▸ include seven main flocks of parallel planes: x , y , z , p , m , h , k . The position of a cut plane relative to the origin of the coordinate system is indicated with the index d = 1/c, with c as defined in equations (3) and (4), except if c = 0 or c = 3/4. Fig. 1 ▸ illustrates the geometric interpretation of the main geometric cut symbols. A large majority of the cut planes needed in the DAU definitions presented below can be labelled intuitively with these symbols. The remaining symbols in Table 1 ▸ were introduced primarily to condense the DAU definitions in Table 2 ▸ below.

Table 2

Exact DAU definitions for the 230 space groups, based on the geometric cut definitions of Table 1 ▸

Following International Tables, Vol. B (Shmueli, 2001 ▸) Table A1.4.2.7, the first column, n:c, lists the space-group numbers and setting codes separated by a colon. For monoclinic space groups, the setting code ‘b’ indicates ‘unique axis b’; ‘b1’ indicates ‘unique axis b, cell choice 1’. For orthorhombic, tetragonal and cubic space groups, ‘2’ indicates ‘origin choice 2’. For rhombohedral space groups, ‘h’ indicates ‘hexagonal axes’. The conditions for space groups 78, 95, 145, 154, 170, 172, 181 and 213 are defined by change-of-basis operations transforming the conditions of the enantiomorphic mates.

n:c	Cuts
1	x 0; +x 1; y 0; +y 1; z 0; +z 1
2	x 0(y 0(z 2) y 2(z 2)); x 2(y 0(z 2) y 2(z 2)); y 0; +y 1; z 0; +z 1
3:b	x 0; +x 1; y 0; +y 1; z 0(x 2); z 2(x 2)
4:b	x 0; +x 1; y 0; +y 1; z 0(x 0(+y 2) x 2(+y 2)); z 2(x 0(+y 2) x 2(+y 2))
5:b1	x 0(z 2); x 2(z 2); y 0; +y 2; z 0; +z 1
6:b	x 0; +x 1; y 0; y 2; z 0; +z 1
7:b1	x 0; +x 1; y 0(+z 2); y 2(+z 2); z 0; +z 1
8:b1	x 0; +x 1; y 0; y 4(+x 2); z 0; +z 1
9:b1	x 0; +x 1; y 0(+z 2); y 4(+z 2); z 0; +z 1
10:b	x 0(z 2); x 2(z 2); y 0; y 2; z 0; +z 1
11:b	x 0; +x 1; y 0(z 0(x 2) z 2(x 2)); y 4; z 0; +z 1
12:b1	x 0(z 2); x 2(z 2); y 0; y 4(x 4(z 2)); z 0; +z 1
13:b1	x 0(z 0(y 2) z 4); x 2(z 0(y 2) z 4); y 0; +y 1; z 0; +z 2
14:b1	x 0(y 0(z 2)); +x 1; y 0(x 2(z 2)); y 4(+z 2); z 0; +z 1
15:b1	x 0(z 4); x 2(z 4); y 0; +y 2; z 0(y 4(x 4)); z 2(-y 4(x 4))
16	x 0(z 2); x 2(z 2); y 0(z 2); y 2(z 2); z 0; +z 1
17	x 0(z 4 z 13/4); x 2(z 4 z 13/4); y 0(z 2); y 2(z 2); z 0; +z 1
18	x 0; x 2(y 0); y 0; +y 2; z 0; +z 1
19	x 0; +x 2; y 0(z 2); y 2(z 2); z 0(+y 2); +z 1
20	x 0(z 4); x 2(z 4); y 0; y 2(z 0); z 0; +z 2
21	x 0(z 2); x 4(y 4); y 0(z 2); y 2(z 2); z 0; +z 1
22	x 0(z 2); x 4(z 4 z 13/4); y 0(z 2); y 4(z 4 z 13/4); z 0; +z 1
23	x 0; x 2(y 0); y 0; y 2(z 0); z 0; z 2(x 0)
24	x 0(y 4); x 2(y 4); y 0(z 4); y 2(z 4); z 0(x 4); z 2(x 4)
25	x 0; x 2; y 0; y 2; z 0; +z 1
26	x 0; x 2; y 0(+z 2); y 2(+z 2); z 0; +z 1
27	x 0(+z 2); x 2(+z 2); y 0(+z 2); y 2(+z 2); z 0; +z 1
28	x 0(y 2); x 4; y 0; +y 1; z 0; +z 1
29	x 0(+z 2); x 4(+z 2); y 0; +y 1; z 0; +z 1
30	x 0(y 2); x 2(y 2); y 0; +y 1; z 0; +z 2
31	x 0; x 2; y 0(+z 2); y 2(+z 2); z 0; +z 1
32	x 0; x 2(y 0); y 0; +y 2; z 0; +z 1
33	x 0; +x 2; y 0(+z 2); y 2(+z 2); z 0; +z 1
34	x 0; x 2(y 0); y 0; +y 2; z 0; +z 1
35	x 0; x 4(y 4); y 0; y 2; z 0; +z 1
36	x 0; x 2; y 0; +y 2; z 0; +z 2
37	x 0(+z 2); x 4(y 4); y 0(+z 2); y 2(+z 2); z 0; +z 1
38	x 0; x 2; y 0; y 2; z 0; +z 2
39	x 0(+z 2); x 2(+z 2); y 0(+z 2); y 4; z 0; +z 1
40	x 0(+z 2); x 4; y 0(+z 2); y 2(+z 2); z 0; +z 1
41	x 0; x 2(y 0); y 0; +y 2; z 0; +z 2
42	x 0; x 4(+z 2); y 0; y 4(+z 2); z 0; +z 1
43	x 0; x 4(-y 0(+z 2)); y 0; +y 4; z 0; +z 1
44	x 0; x 2; y 0; y 2; z 0; +z 2
45	x 0; x 2(y 0); y 0; +y 2; z 0; +z 2
46	x 0(y 2); x 4; y 0; +y 1; z 0; +z 2
47	x 0; x 2; y 0; y 2; z 0; z 2
48:2	x 0(y 0(z 2)); x 4(z 4 z 13/4); ~ y 4(z 4 z 13/4); y 4(z 4 z 13/4); z 0; +z 1
49	x 0(z 4); x 2(z 4); y 0(z 4); y 2(z 4); z 0; z 2
50:2	x 0(y 2); x 4(y 4 y 13/4); y 0; +y 1; z 0(y 4 y 13/4); z 2(y 4 y 13/4)
51	x 0(z 2); x 4; y 0; y 2; z 0; +z 1
52	x 0; +x 1; y 0(x 4 x 34); y 4(z 4); z 0(x 2); z 2(x 2)
53	x 0; x 2; y 0; +y 1; z 0(y 2); z 4(x 4)
54	x 0(z 4); x 2(z 4); y 0(x 4); y 2(x 4); z 0; +z 2
55	x 0; x 2(y 0); y 0; +y 2; z 0; z 2
56	x 0(y 2(z 0)); x 4(y 4 y 13/4); y 0; +y 1; z 0; +z 2
57	x 0(y 2); x 2(y 2); y 0; +y 1; z 0(y 4 y 13/4); z 4
58	x 0; x 2(y 0); y 0; +y 2; z 0; z 2
59:2	x 0(y 0(z 2)); x 4; ~ y 4; y 4; z 0; +z 1
60	x 0(z 4); x 2(z 4); y 0; y 2(x 0(z 0)); z 0; +z 2
61	x 0; x 2(y 0(z 0)); y 0; +y 2; z 0; +z 2
62	x 0; x 2(y 0(z 0)); y 0(+z 2); y 4; z 0; +z 1
63	x 0; x 2; y 0; +y 2; z 0(y 4(x 4)); z 4
64	x 0; x 4(z 4); y 0; +y 2; z 0(y 4); z 2(+y 4)
65	x 0; x 4(y 4); y 0; y 2; z 0; z 2
66	x 0(z 4); x 4(y 4); y 0(z 4); y 2(z 4); z 0; z 2
67	x 0; x 2; y 0(x 4); y 4; z 0(x 4); z 2(x 4)
68:2	x 0(z 4); x 2(z 4); y 0(x 4); y 4(z 4); z 0(+x 2 y 4(x 4)); +z 2
69	x 0; x 4(z 4); y 0; y 4(z 4); z 0; z 2
70:2	x 0(y 0(z 2)); x 8(z 8 z 15/8); ~ y 8(z 13/8 z 17/8); y 8(z 8 z 15/8); z 0; +z 1
71	x 0; x 4(y 4(z 4)); y 0; y 2; z 0; z 2
72	x 0(z 4); x 4(y 4(z 4)); y 0(z 4); y 2(z 4); z 0; z 2
73	x 0(y 4); x 4(z 4(y 4)); y 0(z 4); y 2(z 4); z 0; +z 2
74	x 0; x 4(z 4 z 13/4); y 0(z 2); y 4; z 0; +z 1
75	x 0(y 0); x 2; y 0; y 2(x 2); z 0; +z 1
76	x 0(+z 4); x 2(+z 4); y 0(+z 13/4); y 2(+z 13/4); z 0; +z 1
77	x 0(+z 2); x 2(+z 2); y 0(+z 2); y 2(+z 2); z 0; +z 1
78	76 a, b, c + 1
79	x 0(y 0); x 2; y 0; y 2(x 2); z 0; +z 2
80	x 0(y 2); x 2(y 2); y 0; +y 1; z 0; +z 4
81	x 0(y 0(z 2)); x 2; y 0; y 2(x 2(z 2)); z 0; +z 1
82	x 0(z 0(y 0)); x 2(y 0(z 4)); y 0; y 2(x 0(z 4)); z 0; z 2(y 0)
83	x 0(y 0); x 2; y 0; y 2(x 2); z 0; z 2
84	x 0(y 0(z 4)); x 2; y 0; y 2(x 2(z 4)); z 0; z 2
85:2	~ x 4(~ y 4); x 4(z 0(~ y 4) z 2(~ y 4)); ~ y 4; y 4(x 4); z 0(y 0(x 0)); z 2(y 0(x 0))
86:2	~ x 4(~ y 4(z 4)); x 4(z 0(~ y 4) z 2(+~ y 4)); ~ y 4; y 4(x 4(z 4)); z 0(y 0(x 0)); z 2(y 0(x 0))
87	x 0(y 0); x 2; y 0; y 2(x 2); z 0; z 4(y 4(x 4) x 2(y 0))
88:2	x 0; x 4; y 0(x 0(z 2) | x 4(+z 4)); y 4(x 0(z 8 z 15/8)); z 0; +z 1
89	x 0(p 0); x 2; y 0; y 2(x 2); z 0(p 0); z 2(p 0)
90	x 0; x 2(y 0); y 0; y 2(x 0); z 0(p 0); z 2(p 0)
91	x 0(z 8(y 0)); +x 1; y 0; +y 1; z 0(x 2); z 8(m 1)
92	x 0; +x 1; y 0; +y 1; z 0(p 0); z 8(y 2)
93	x 0(y 2); x 2(y 2); y 0; +y 1; z 0(y 2); z 4(p 0 m 1)
94	x 0(y 0); x 2(z 2(y 2)); y 0(z 2(x 0)); +y 2; z 0(p 0); z 2(p 0)
95	91 a + 1, b, c
96	x 0; +x 1; y 0; +y 1; z 0(p 0); z 8(x 2)
97	x 0(y 0); x 2; y 0; y 2(x 2); z 0(p 0); z 4(m 2)
98	x 0(y 2); x 2(y 2); y 0; +y 1; z 0(m 1 p 0); z 8(y 4 y 13/4)
99	x 0; y 2; z 0; +z 1; p 0
100	x 0(y 0); y 0; z 0; +z 1; m 2
101	x 0(+z 2); y 2(+z 2); z 0; +z 1; p 0
102	x 0(+z 2); y 2(+z 2); z 0; +z 1; p 0
103	x 0(y 0); x 2; y 0; y 2(x 2); z 0; +z 2
104	x 0(y 0); x 2; y 0; y 2(x 2); z 0; +z 2
105	x 0; x 2; y 0; y 2; z 0; +z 2
106	x 0(y 0); x 2; y 0; +y 2; z 0; +z 2
107	x 0; y 2; z 0; +z 2; p 0
108	x 0(y 0); y 0; z 0; +z 2; m 2
109	x 0; x 2; y 0; y 2; z 0; +z 4
110	x 0(y 0); x 2; y 0; +y 2; z 0; +z 4
111	x 0(z 2); y 2(z 2); z 0; +z 1; p 0
112	x 0(z 4 z 0(y 0)); x 2(z 4); y 0(z 4); y 2(z 4 z 0(x 2)); z 0; +z 2
113	x 0(y 0(z 2)); y 0; z 0; +z 1; m 2
114	x 0(y 0); x 2; y 0; y 2(x 2(z 0)); z 0; +z 2
115	x 0; x 2; y 0; y 2; z 0(p 0); z 2(p 0)
116	x 0(y 2); x 2(y 2 z 0(y 2)); y 0; +y 1; z 0(y 2 y 0(x 0)); z 4(m 1 p 0)
117	x 0(z 0(y 0) z 2(y 0)); x 2(y 0); y 0; +y 2; z 0(m 2); z 2(m 2)
118	x 0(y 2); x 2(y 2); y 0; +y 1; z 0(y 2(x 2) x 0(y 0)); z 4(~ p 2 m 2)
119	x 0; x 2; y 0; y 2; z 0(p 0); z 4(m 2)
120	x 0(z 0(y 0)); x 2(y 0); y 0; +y 2; z 0(m 2); z 4(p 0)
121	x 0; y 2(x 0(z 4)); z 0; z 2(x 0); p 0
122	x 0(y 2 z 0(y 0)); x 2(y 2); y 0; +y 1; z 0(y 2(x 2)); z 8(y 4 y 13/4)
123	x 0; y 2; z 0; z 2; p 0
124	x 0(y 0); x 2; y 0; y 2(x 2); z 0; z 4(p 0)
125:2	~ x 4(~ y 4); ~ y 4; z 0(p 0); z 2(p 0); m 0
126:2	~ x 4( ~ y 4); x 4; ~ y 4; y 4(x 4); z 0(y 0(x 0) x 4(~ y 4)); z 4(p 0)
127	x 0(y 0); y 0; z 0; z 2; m 2
128	x 0(y 0); x 2; y 0; y 2(x 2); z 0; z 4(m 2)
129:2	~ x 4; y 4; z 0(m 0); z 2(m 0); p 0
130:2	~ x 4(~ y 4); x 4(z 0(~ y 4)); ~ y 4; y 4(x 4); z 0(y 0(x 0)); z 4(m 0)
131	x 0; x 2; y 0; y 2; z 0; z 4(p 0)
132	x 0(z 4); y 2(z 4); z 0; z 2; p 0
133:2	~ x 4; x 4(z 0 | ~ y 4); ~ y 4; +y 4; z 0(y 0(x 0)); z 4(p 0)
134:2	~ x 4(z 4); ~ y 4(z 4); z 0(p 0); z 2(p 0); m 0
135	x 0(z 4(y 0)); x 2(y 0); y 0; +y 2; z 0; z 4(m 2)
136	x 0(z 4); y 2(z 4(x 0)); z 0; z 2; p 0
137:2	~ x 4; x 4; ~ y 4; y 4; z 0(y 0(x 0)); z 4(m 0)
138:2	~ x 4; y 4(~ x 4(z 4)); z 0(m 0); z 2(m 0 ~ x 4(y 4)); p 0
139	x 0; y 2; z 0; z 4(m 2); p 0
140	x 0(y 0); y 0; z 0; z 4(p 0); m 2
141:2	x 0; x 2; ~ y 4; y 4; z 0(y 0); z 8(p 4)
142:2	x 0(z 8( ~ y 4) z 0(y 0)); x 2( ~ y 4); ~ y 4; +y 4; z 0(x 4); z 8(m 4)
143	x 0(y 0); y 0; z 0; +z 1; k 1; m 1(h 1 | k 1); h 1
144	x 0; +x 1; y 0; +y 1; z 0; +z 3
145	144 b, a, c
146:h	x 0(y 0); y 0; z 0; +z 3; k 1; m 1(h 1 | k 1); h 1
147	x 0(y 0); y 0; z 0(p 0(y 0)); z 2(p 0(y 0)); k 1; m 1(h 1 | k 1); h 1
148:h	x 0(y 0); y 0; z 0(p 0(y 0)); z 6(h 0(x 3) | k 0(y 0 | m 1)); k 1; m 1(h 1 | k 1); h 1
149	x 0(y 0); y 0; z 0(h 0 | k 0); z 2(h 0 | k 0); k 1; m 1(h 1 | k 1); h 1
150	x 0(y 0); y 0; z 0(p 0); z 2(p 0); k 1; m 1(h 1 | k 1); h 1
151	x 0; +x 1; y 0; +y 1; z 0(h 0 | h 1); z 6(k 0 | k 1)
152	x 0; +x 1; y 0; +y 1; z 0(p 0); z 6(p 0)
153	x 0; +x 1; y 0; +y 1; z 0(h 0 | h 1); z 6(x 0(y 0) m 1)
154	152 b, a, c
155:h	x 0(y 0); y 0; z 0(p 0); z 6(x 3 ~ p 3); k 1; m 1(h 1 | k 1); h 1
156	z 0; +z 1; h 0; m 1; k 0
157	y 0; z 0; +z 1; k 1; m 1(y 3); p 0
158	x 0(y 0); y 0; z 0; +z 2; k 1; m 1(h 1 | k 1); h 1
159	x 0(y 0); y 0; z 0; +z 2; k 1; m 1(h 1 | k 1); h 1
160:h	z 0; +z 3; h 0; m 1; k 0
161:h	x 0(y 0); y 0; z 0; +z 6; k 1; m 1(h 1 | k 1); h 1
162	y 0; z 0(h 0); z 2(h 0); k 1; m 1(y 3); p 0
163	x 0(y 0); y 0; z 0(p 0(y 0)); z 4(h 0 | k 0); k 1; m 1(h 1 | k 1); h 1
164	y 0(z 2); z 0; +z 1; k 1; h 0
165	x 0(y 0); y 0; z 0(p 0(y 0)); z 4(p 0); k 1; m 1(h 1 | k 1); h 1
166:h	z 0(p 0); z 6(x 3); h 0; m 1; k 0
167:h	x 0(y 0); y 0; z 0(p 0(y 0)); z 12(y 3 p 3); k 1; m 1(h 1 | k 1); h 1
168	y 0; z 0; +z 1; k 1; m 1(y 3); p 0(y 0)
169	x 0; +x 1; y 0; +y 1; z 0; +z 6
170	169 b, a, c
171	x 1(y 2); y 0(x 2); z 0; +z 3; p 0(y 2)
172	171 b + 1, a + 1, c
173	x 0(y 0); y 0; z 0; +z 2; k 1; m 1(h 1 | k 1); h 1
174	x 0(y 0); y 0; z 0; z 2; k 1; m 1(h 1 | k 1); h 1
175	y 0; z 0; z 2; k 1; m 1(y 3); p 0(y 0)
176	x 0(y 0); y 0; z 0(p 0(y 0)); z 4; k 1; m 1(h 1 | k 1); h 1
177	y 0; z 0(h 0); z 2(h 0); k 1; m 1(y 3); p 0(y 0)
178	x 0; +x 1; y 0; +y 1; z 0(p 0); z 12(h 0 | h 1)
179	x 0; +x 1; y 0; +y 1; z 0(p 0); z 12(m 1 x 0(y 0))
180	x 1(y 2); y 0(x 2); z 0(k 1); z 6(h 0); p 0(y 2)
181	180 b + 1, a b, c + 1/6
182	x 0(y 0); y 0; z 0(p 0); z 4(h 0 | k 0); k 1; m 1(h 1 | k 1); h 1
183	y 0; z 0; +z 1; k 1; h 0
184	y 0; z 0; +z 2; k 1; m 1(y 3); p 0(y 0)
185	y 0; z 0; +z 2; k 1; m 1(y 3); p 0
186	y 0(+z 2); z 0; +z 1; k 1; h 0
187	z 0; z 2; h 0; m 1; k 0
188	x 0(y 0); y 0; z 0(h 0 | k 0); z 4; k 1; m 1(h 1 | k 1); h 1
189	y 0; z 0; z 2; k 1; m 1(y 3); p 0
190	x 0(y 0); y 0; z 0(p 0); z 4; k 1; m 1(h 1 | k 1); h 1
191	y 0; z 0; z 2; k 1; h 0
192	y 0; z 0; z 4(h 0); k 1; m 1(y 3); p 0(y 0)
193	y 0; z 0(h 0); z 4; k 1; m 1(y 3); p 0
194	z 0(p 0); z 4; h 0; m 1; k 0
195	z 0(y 2 x 2); m 1(y 2); zy 0(zx 0); zx 0
196	p 0(m 2); ~ xz 2(zy 0); zx 2(yz 0); yz 0; zy 0
197	z 0(x 2); p 0(zy 0); +m 1; zy 0
198	x 0(y 0); x 2; y 2(+z 0 x 2(+z 2)); zx 2(m 2); zx 0(p 0); yz 0; zy 0
199	x 2(y 4); y 2(z 4); z 0(x 4); zx 0(zy 0(+x 2)); zy 0
200	x 2; y 2; z 0; zx 0(zy 0); zy 0
201:2	~ z 4(x 4); p 0(zy 0(x 0)); m 2(zy 0(x 2)); zy 0
202	z 0; p 0(x 4); ~ xz 2(zy 0); zy 0
203:2	p 0(zy 0(x 0)); m 4(zy 0 | yz 4( ~ z 4)); zy 0; yz 4
204	x 2; z 0; p 0(zy 0(x 4)); zy 0
205	x 2(z 0(zy 0)); y 2(zy 0); z 0; zx 0(zy 0); zy 0
206	z 0(x 4); zx 0(zy 0); ~ xz 2; zy 0; ~ yz 2(zx 0)
207	z 0(x 2); p 0; m 1(p 0); zy 0(x 2)
208	zx 0(zy 0); xz 0(yz 0); zx 2(y 4); ~ xz 2(y 4); zy 0; yz 0; zy 2(x 4); ~ yz 2(x 4)
209	p 0(z 0); m 2(z 0); zy 0; yz 0(zy 0)
210	y 8( ~ xz 4); z 8(m 4); p 0(zx 0); m 2(~ xz 2); yz 0(z 0); zx 0; ~ xz 2
211	z 0(p 0); zx 0(zy 0); ~ xz 2(y 4); zy 0; ~ yz 2(x 4)
212	zx 2; yz 0(zx 2); ~ yz 2(tx 0); tx 0(x 8); ty 0(y 8); tz 2(x 13/8)
213	212 b, c + 1/2, a 1/2
214	x 8(~ yz 4); y 8(~ xz 4); ~ y 8(~ zx 1/4); zx 0(zy 0); zy 0; ~ zy 4(y 0); dy 8(~ p 4)
215	z 0(x 2); p 0; m 1; zy 0
216	p 0; m 2; zy 0; yz 0
217	x 2(z 0(y 4)); z 0; p 0; zy 0
218	x 2(z 0(y 4)); y 2(z 0(x 4)); z 0; zx 0(zy 0); zy 0
219	p 0; m 2(p 0(z 0)); zy 0; yz 0(p 0 | zy 0(x 4))
220	x 4(z 0(y 13/8)); x 2; y 4(x 2(z 8)); y 2(z 4); z 0; zx 0(zy 0); zy 0
221	x 2; z 0; p 0; zy 0
222:2	x 34(z 4(y 2) | zy 0); z 4; p 0(zy 0(z 2)); zy 0
223	z 0; zx 0(zy 0); ~ xz 2(y 4); zy 0; ~ yz 2(x 4)
224:2	p 0; ~ xz 1(y 2); zx 2(y 2); ~ yz 2; zy 0
225	z 0; p 0; m 2; zy 0
226	z 0; p 0; m 2(p 0); zy 0(x 4)
227:2	y 0(xz 0); p 0; m 4; yz 4; zy 0
228:2	y 0(zx 1/4); p 0(zy 0); m 4; yz 4(zy 0(x 8)); zy 0
229	z 0; p 0; ~ xz 2(y 4); zy 0
230	x 8(~ zy 4 ~ yz 4); ~ x 8(y 0(z 4)); y 8(~ xz 4); ~ y 8(~ zx 1/4); z 4(y 0); zx 0; xz 0(z 0); zy 0(zx 0); yz 0

Methods

Change-of-basis transformation law

In many situations it is essential to be able to transform variables from one basis system to another. Giacovazzo (1992 ▸) includes a table of transformation laws (Table 2.E.1) for commonly used variables, for example fractional coordinates, Miller indices or anisotropic displacement parameters. This list can be extended by a transformation law for DAU definitions based on equations (1) and (2). Borrowing the conventions of ITA, let () be a change-of-basis matrix with a (3 × 3) rotation part and translation vector , and let () be its inverse. A column vector of fractional coordinates in a first basis system is transformed to coordinates in a second basis system via We also define the row vector = () in the first basis system. The corresponding in the second basis system is given by The determination of the scalar constant is based on the rationale that must hold for all solutions of Setting , substituting equations (10) and (11), and solving for yields the second part of the transformation law for DAU cuts:

Determination of vertices

Given a list of shape cuts, the DAU vertices can be computed by solving equation (13) for all unique ordered triplets of cuts. Let and be the cut normal vectors of such a triplet. The three cut planes intersect in a point if the determinant of is not zero. Under this condition the point is found by solving = 0: is a vertex of the DAU if all inequalities given by the shape cuts are also simultaneously true. If more than three planes intersect in a given vertex it is obtained multiple times and duplicates are discarded. We note that the largest number of shape cuts using the ITA definitions is nine, for space group (No. 230). In this case the determinant of is evaluated 84 times, equation (16) is evaluated 56 times and the final number of unique vertices is nine, in accordance with ITA.

Validation of exact conditions

The exact conditions shown in Table 2 ▸ are validated with a sampling procedure to establish that the DAU is neither too small nor too large. The procedure is intentionally unsophisticated to maximize robustness. It is intrinsically highly inefficient, which is compounded by the use of a dynamically typed scripting language for its implementation. Nonetheless, given current computing hardware, the entire Table 2 ▸ can be re-validated in less than 2 min.

The first part of the validation procedure samples the DAU conditions using two grids over the unit cell, given a user-defined number of sampling points N per unit in fractional coordinate space. To simplify this presentation, without loss of generality, we assume that N is identical in all three dimensions. N is always chosen to be even. The first ugrid covers the unit cell from 0 to N − 1, corresponding to the range [0.0, 1.0[ in fractional coordinate space. All ugrid points are initialized with zero. The second rgrid covers space more redundantly from −N/2 to N, corresponding to the range [−0.5, 1.0]. The vertex determination of §3.2 is used to assure that the DAU to be validated falls entirely into the rgrid. For each rgrid point, the inequalities defined by the DAU cuts are evaluated. A value of one is assigned if the point is inside the DAU (all inequalities are true) and zero otherwise. If the point is inside the DAU, the crystallographic unit translations, in the form of the modulus operation, are applied to the grid indices of the point to determine the symmetry-equivalent grid point in the ugrid, which is then also set to one. If it was set already, an error message reports that the point is redundant.

At the end of the first part of the validation procedure the ugrid has a value of one for all grid points inside the DAU and zero for all points outside; note that the ugrid has disconnected regions of grid points with value one if the DAU has points with negative coordinates. The second part of the validation procedure visits each point in the ugrid. The symmetry operations of the space group, taking the crystallographic unit translations and any centring translations into account, are applied to enumerate all equivalent points in the ugrid. If a point is flagged as inside the DAU, all equivalent points must be flagged as outside; otherwise an error message reports that the DAU has redundant points. For each point flagged as outside the DAU, one equivalent point must be flagged as inside; otherwise an error message reports that the point has no equivalent in the DAU.

If no error messages are shown, the validation procedure establishes conclusively that the DAU conditions have complete coverage and that the covered space is non-redundant under symmetry. The only critical parameter is the number N of sampling points per unit in fractional space. Based on an inspection of the locations of the symmetry elements, we found that N = 24 is sufficiently large for all space groups. However, as a final validation we also ran the procedure for all space groups with N = 72, which takes about 45 min on a current 48-core system.

Visually assisted determination of exact conditions

The exact DAU conditions shown in Table 2 ▸ were determined manually. Progress was greatly accelerated by visual tools developed specifically for this purpose. A full presentation of these tools is beyond the scope of this paper [Grosse-Kunstleve et al. (2003 ▸) includes pointers to the openly available implementation]. The main idea is to colour-code pairs of redundant points on the DAU surface as they are detected in the sampling procedure described in §3.3; for example, the first point is coloured dark blue and the equivalent redundant point light blue. A very simple colour-selection procedure using only a small palette of colours was found to be sufficient in practice. An example is shown in Fig. 2 ▸. We added the face- or edge-specific cuts one at a time, updating the visualization after each step. In this way we could determine exact DAU definitions in a matter of a few minutes for most space groups.

Figure 2

Visualization of redundant pairs of points at the surface of the DAU of space group (No. 77). Colour-coded pairs of redundant points on the DAU surface are shown as they are detected in the sampling procedure described in §3.3. For example, the first point is coloured dark blue and the equivalent redundant point light blue. With the help of the colours it is immediately obvious how the redundant points are related and where to place the missing face cuts to obtain the exact DAU.

Results

Table 2 ▸ defines exact DAUs for 230 reference settings, chosen to be compatible with the reference settings used in the IUCr symCIF dictionary (Brown, 2005 ▸). Using the change-of-basis transformation law of §3.1 in combination with the algorithms of Grosse-Kunstleve (1999 ▸), it is possible to automatically obtain an exact DAU for any setting.

Koch & Fischer (1974 ▸) and ITA §2.8 explain that the shape for a DAU is not uniquely determined and that the best choice is application specific. Similarly, the face- and edge-specific sub-conditions required for an exact DAU are also not uniquely determined. The choices we made for Table 2 ▸ aim at obtaining compact sets of sub-conditions, which is also expected to minimize the runtime needed for evaluating if a given point is inside the DAU. For the cubic space groups, we attempted to adopt the sub-conditions of Koch & Fischer (1974 ▸) but it turned out to be challenging in some cases. In six cases (space-group numbers 195, 198, 210, 220, 227, 228) the ITA shape conditions are incompatible with those of Koch & Fischer (1974 ▸). In some other cases their sub-conditions lead to complicated cut expressions. Using the approach of §3.4 it was only a small effort to determine simpler alternatives for Table 2 ▸.

For eight enantiomorphic space groups (the numbers are listed in the caption of Table 2 ▸) the exact DAU is defined through a change-of-basis transformation of the DAU of the enantiomorphic mate. The three remaining enantiomorphic pairs of space groups cannot be handled in this way because the ITA shape DAU conditions are pairwise incompatible. The change-of-basis matrices in Table 2 ▸ are expressed using the notation as defined in Zwart et al. (2008 ▸).

Conclusion

Table 2 ▸ is the first complete and uniform definition of exact DAUs for all 230 space-group types. The table is concise owing to the geometric cut notation introduced in this work. At the same time, the cut expressions lend themselves to automatic processing, with results as demonstrated already in Grosse-Kunstleve et al. (2003 ▸). In the meantime we have found other practical uses in the context of the PHENIX suite (Adams et al., 2010 ▸), such as the search for interactions between pairs of atoms (Grosse-Kunstleve et al., 2004 ▸) and a bulk-solvent-mask determination procedure.

In this work we have used a manual approach for the determination of the face- and edge-specific sub-conditions required for exact DAUs. We believe an algorithmic approach is possible but will require significantly more initial effort than our manual approach. The cut plane formalism presented here could serve as a basis for future automation work.