International
Tables for Crystallography Volume B Reciprocal space Edited by U. Shmueli © International Union of Crystallography 2006 |
International Tables for Crystallography (2006). Vol. B. ch. 1.3, pp. 59-71
|
Let ρ be the distribution of electrons in a crystal. Then, by definition of a crystal, ρ is Λ-periodic for some period lattice Λ (Section 1.3.2.6.5) so that there exists a motif distribution with compact support such that where . The lattice Λ is usually taken to be the finest for which the above representation holds.
Let Λ have a basis over the integers, these basis vectors being expressed in terms of a standard orthonormal basis as Then the matrix is the period matrix of Λ (Section 1.3.2.6.5) with respect to the unit lattice with basis , and the volume V of the unit cell is given by .
By Fourier transformation where is the lattice distribution associated to the reciprocal lattice . The basis vectors have coordinates in given by the columns of , whose expression in terms of the cofactors of A (see Section 1.3.2.6.5) gives the familiar formulae involving the cross product of vectors for . The H-distribution F of scattered amplitudes may be written and is thus a weighted reciprocal-lattice distribution, the weight attached to each node being the value at H of the transform of the motif . Taken in conjunction with the assumption that the scattering is elastic, i.e. that H only changes the direction but not the magnitude of the incident wavevector , this result yields the usual forms (Laue or Bragg) of the diffraction conditions: , and simultaneously H lies on the Ewald sphere.
By the reciprocity theorem, can be recovered if F is known for all as follows [Section 1.3.2.6.5, e.g. (iv)]:
These relations may be rewritten in terms of standard, or `fractional crystallographic', coordinates by putting so that a unit cell of the crystal corresponds to , and that . Defining and by so that we have These formulae are valid for an arbitrary motif distribution , provided the convergence of the Fourier series for is considered from the viewpoint of distribution theory (Section 1.3.2.6.10.3).
The experienced crystallographer may notice the absence of the familiar factor from the expression for just given. This is because we use the (mathematically) natural unit for , the electron per unit cell, which matches the dimensionless nature of the crystallographic coordinates x and of the associated volume element . The traditional factor was the result of the somewhat inconsistent use of x as an argument but of as a volume element to obtain ρ in electrons per unit volume (e.g. Å3). A fortunate consequence of the present convention is that nuisance factors of V or , which used to abound in convolution or scalar product formulae, are now absent.
It should be noted at this point that the crystallographic terminology regarding and differs from the standard mathematical terminology introduced in Section 1.3.2.4.1 and applied to periodic distributions in Section 1.3.2.6.4: F is the inverse Fourier transform of ρ rather than its Fourier transform, and the calculation of ρ is called a Fourier synthesis in crystallography even though it is mathematically a Fourier analysis. The origin of this discrepancy may be traced to the fact that the mathematical theory of the Fourier transformation originated with the study of temporal periodicity, while crystallography deals with spatial periodicity; since the expression for the phase factor of a plane wave is , the difference in sign between the contributions from time versus spatial displacements makes this conflict unavoidable.
In many cases, is a sum of translates of atomic electron-density distributions. Assume there are n distinct chemical types of atoms, with identical isotropic atoms of type j described by an electron distribution about their centre of mass. According to quantum mechanics each is a smooth rapidly decreasing function of x, i.e. , hence and (ignoring the effect of thermal agitation) which may be written (Section 1.3.2.5.8) By Fourier transformation: Defining the form factor of atom j as a function of h to be we have If and are the real- and reciprocal-space coordinates in Å and Å−1, and if is the spherically symmetric electron-density function for atom type j, then
More complex expansions are used for electron-density studies (see Chapter 1.2 in this volume). Anisotropic Gaussian atoms may be dealt with through the formulae given in Section 1.3.2.4.4.2.
The convergence of the Fourier series for is usually examined from the classical point of view (Section 1.3.2.6.10). The summation of multiple Fourier series meets with considerable difficulties, because there is no natural order in to play the role of the natural order in (Ash, 1976). In crystallography, however, the structure factors are often obtained within spheres for increasing resolution (decreasing Δ). Therefore, successive estimates of are most naturally calculated as the corresponding partial sums (Section 1.3.2.6.10.1): This may be written where is the `spherical Dirichlet kernel' exhibits numerous negative ripples around its central peak. Thus the `series termination errors' incurred by using instead of consist of negative ripples around each atom, and may lead to a Gibbs-like phenomenon (Section 1.3.2.6.10.1) near a molecular boundary.
As in one dimension, Cesàro sums (arithmetic means of partial sums) have better convergence properties, as they lead to a convolution by a `spherical Fejér kernel' which is everywhere positive. Thus Cesàro summation will always produce positive approximations to a positive electron density. Other positive summation kernels were investigated by Pepinsky (1952) and by Waser & Schomaker (1953).
If the wavelength λ of the incident X-rays is far from any absorption edge of the atoms in the crystal, there is a constant phase shift in the scattering, and the electron density may be considered to be real-valued. Then Thus if then This is Friedel's law (Friedel, 1913). The set of Fourier coefficients is said to have Hermitian symmetry.
If λ is close to some absorption edge(s), the proximity to resonance induces an extra phase shift, whose effect may be represented by letting take on complex values. Let and correspondingly, by termwise Fourier transformation
Since and are both real, and are both Hermitian symmetric, hence while Thus , so that Friedel's law is violated. The components and , which do obey Friedel's law, may be expressed as:
By Section 1.3.2.4.3.3 and Section 1.3.2.6.10.2, Usually is real and positive, hence , but the identity remains valid even when is made complex-valued by the presence of anomalous scatterers.
If is the collection of structure factors belonging to another electron density with the same period lattice as ρ, then Thus, norms and inner products may be evaluated either from structure factors or from `maps'.
Let and be two electron densities referred to crystallographic coordinates, with structure factors and , so that
The distribution is well defined, since the generalized support condition (Section 1.3.2.3.9.7) is satisfied. The forward version of the convolution theorem implies that if then
If either or is infinitely differentiable, then the distribution exists, and if we analyse it as then the backward version of the convolution theorem reads:
The cross correlation between and is the -periodic distribution defined by: If and are locally integrable, Let The combined use of the shift property and of the forward convolution theorem then gives immediately: hence the Fourier series representation of : Clearly, , as shown by the fact that permuting F and G changes into its complex conjugate.
The auto-correlation of is defined as and is called the Patterson function of . If consists of point atoms, i.e. then contains information about interatomic vectors. It has the Fourier series representation and is therefore calculable from the diffraction intensities alone. It was first proposed by Patterson (1934, 1935a,b) as an extension to crystals of the radially averaged correlation function used by Warren & Gingrich (1934) in the study of powders.
Shannon's sampling and interpolation theorem (Section 1.3.2.7.1) takes two different forms, according to whether the property of finite bandwidth is assumed in real space or in reciprocal space.
It was shown at the end of Section 1.3.2.5.8 that the convolution theorem establishes, under appropriate assumptions, a duality between sectioning a smooth function (viewed as a multiplication by a δ-function in the sectioning coordinate) and projecting its transform (viewed as a convolution with the function 1 everywhere equal to 1 as a function of the projection coordinate). This duality follows from the fact that and map to and to (Section 1.3.2.5.6), and from the tensor product property (Section 1.3.2.5.5).
In the case of periodic distributions, projection and section must be performed with respect to directions or subspaces which are integral with respect to the period lattice if the result is to be periodic; furthermore, projections must be performed only on the contents of one repeating unit along the direction of projection, or else the result would diverge. The same relations then hold between principal central sections and projections of the electron density and the dual principal central projections and sections of the weighted reciprocal lattice, e.g. etc.
When the sections are principal but not central, it suffices to use the shift property of Section 1.3.2.5.5. When the sections or projections are not principal, they can be made principal by changing to new primitive bases B and for Λ and , respectively, the transition matrices P and to these new bases being related by in order to preserve duality. This change of basis must be such that one of these matrices (say, P) should have a given integer vector u as its first column, u being related to the line or plane defining the section or projection of interest.
The problem of constructing a matrix P given u received an erroneous solution in Volume II of International Tables (Patterson, 1959), which was subsequently corrected in 1962. Unfortunately, the solution proposed there is complicated and does not suggest a general approach to the problem. It therefore seems worthwhile to record here an effective procedure which solves this problem in any dimension n (Watson, 1970).
Let be a primitive integral vector, i.e. g.c.d. . Then an integral matrix P with det having u as its first column can be constructed by induction as follows. For the result is trivial. For it can be solved by means of the Euclidean algorithm, which yields such that , so that we may take . Note that, if is a solution, then is another solution for any . For , write with so that both and are primitive. By the inductive hypothesis there is an integral matrix V with as its first column, and an integral matrix Z with z as its first column, with and .
Now put i.e. The first column of P is and its determinant is 1, QED.
The incremental step from dimension to dimension n is the construction of matrix V, for which there exist infinitely many solutions labelled by an integer . Therefore, the collection of matrices P which solve the problem is labelled by arbitrary integers . This freedom can be used to adjust the shape of the basis B.
Once P has been chosen, the calculation of general sections and projections is transformed into that of principal sections and projections by the changes of coordinates: and an appeal to the tensor product property.
Booth (1945a) made use of the convolution theorem to form the Fourier coefficients of `bounded projections', which provided a compromise between 2D and 3D Fourier syntheses. If it is desired to compute the projection on the (x, y) plane of the electron density lying between the planes and , which may be written as The transform is then giving for coefficient :
Another particular instance of the convolution theorem is the duality between differentiation and multiplication by a monomial (Sections 1.3.2.4.2.8, 1.3.2.5.8).
In the present context, this result may be written in Cartesian coordinates, and in crystallographic coordinates.
A particular case of the first formula is where is the Laplacian of ρ.
The second formula has been used with or 2 to compute `differential syntheses' and refine the location of maxima (or other stationary points) in electron-density maps. Indeed, the values at x of the gradient vector and Hessian matrix are readily obtained as and a step of Newton iteration towards the nearest stationary point of will proceed by
The modern use of Fourier transforms to speed up the computation of derivatives for model refinement will be described in Section 1.3.4.4.7.
The converse property is also useful: it relates the derivatives of the continuous transform to the moments of : For and , this identity gives the well known relation between the Hessian matrix of the transform at the origin of reciprocal space and the inertia tensor of the motif . This is a particular case of the moment-generating properties of , which will be further developed in Section 1.3.4.5.2.
The classical results presented in Section 1.3.2.6.9 can be readily generalized to the case of triple Fourier series; no new concept is needed, only an obvious extension of the notation.
Let be real-valued, so that Friedel's law holds and . Let be a finite set of indices comprising the origin: . Then the Hermitian form in complex variables is called the Toeplitz form of order associated to . By the convolution theorem and Parseval's identity, If is almost everywhere non-negative, then for all the forms are positive semi-definite and therefore all Toeplitz determinants are non-negative, where
The Toeplitz–Carathéodory–Herglotz theorem given in Section 1.3.2.6.9.2 states that the converse is true: if for all , then is almost everywhere non-negative. This result is known in the crystallographic literature through the papers of Karle & Hauptman (1950), MacGillavry (1950), and Goedkoop (1950), following previous work by Harker & Kasper (1948) and Gillis (1948a,b).
Szegö's study of the asymptotic distribution of the eigenvalues of Toeplitz forms as their order tends to infinity remains valid. Some precautions are needed, however, to define the notion of a sequence of finite subsets of indices tending to infinity: it suffices that the should consist essentially of the reciprocal-lattice points h contained within a domain of the form (k-fold dilation of Ω) where Ω is a convex domain in containing the origin (Widom, 1960). Under these circumstances, the eigenvalues of the Toeplitz forms become equidistributed with the sample values of on a grid satisfying the Shannon sampling criterion for the data in (cf. Section 1.3.2.6.9.3).
A particular consequence of this equidistribution is that the geometric means of the and of the are equal, and hence as in Section 1.3.2.6.9.4 where denotes the number of reflections in . Complementary terms giving a better comparison of the two sides were obtained by Widom (1960, 1975) and Linnik (1975).
This formula played an important role in the solution of the 2D Ising model by Onsager (1944) (see Montroll et al., 1963). It is also encountered in phasing methods involving the `Burg entropy' (Britten & Collins, 1982; Narayan & Nityananda, 1982; Bricogne, 1982, 1984, 1988).
The description of a crystal given so far has dealt only with its invariance under the action of the (discrete Abelian) group of translations by vectors of its period lattice Λ.
Let the crystal now be embedded in Euclidean 3-space, so that it may be acted upon by the group of rigid (i.e. distance-preserving) motions of that space. The group contains a normal subgroup of translations, and the quotient group may be identified with the 3-dimensional orthogonal group . The period lattice Λ of a crystal is a discrete uniform subgroup of .
The possible invariance properties of a crystal under the action of are captured by the following definition: a crystallographic group is a subgroup Γ of if
The two properties are not independent: by a theorem of Bieberbach (1911), they follow from the assumption that Λ is a discrete subgroup of which operates without accumulation point and with a compact fundamental domain (see Auslander, 1965). These two assumptions imply that G acts on Λ through an integral representation, and this observation leads to a complete enumeration of all distinct Γ's. The mathematical theory of these groups is still an active research topic (see, for instance, Farkas, 1981), and has applications to Riemannian geometry (Wolf, 1967).
This classification of crystallographic groups is described elsewhere in these Tables (Wondratschek, 2005), but it will be surveyed briefly in Section 1.3.4.2.2.3 for the purpose of establishing further terminology and notation, after recalling basic notions and results concerning groups and group actions in Section 1.3.4.2.2.2.
The books by Hall (1959) and Scott (1964) are recommended as reference works on group theory.
Let Γ be a crystallographic group, Λ the normal subgroup of its lattice translations, and G the finite factor group . Then G acts on Λ by conjugation [Section 1.3.4.2.2.2(d)] and this action, being a mapping of a lattice into itself, is representable by matrices with integer entries.
The classification of crystallographic groups proceeds from this observation in the following three steps:
|
Step 1 leads to the following groups, listed in association with the crystal system to which they later give rise: and the extension of these groups by a centre of inversion. In this list ⋉ denotes a semi-direct product [Section 1.3.4.2.2.2(d)], α denotes the automorphism , and (the group of permutations on three letters) operates by permuting the copies of (using the subgroup of cyclic permutations gives the tetrahedral subsystem).
Step 2 leads to a list of 73 equivalence classes called arithmetic classes of representations , where is a integer matrix, with and . This enumeration is more familiar if equivalence is relaxed so as to allow conjugation by rational matrices with determinant ± 1: this leads to the 32 crystal classes. The difference between an arithmetic class and its rational class resides in the choice of a lattice mode . Arithmetic classes always refer to a primitive lattice, but may use inequivalent integral representations for a given geometric symmetry element; while crystallographers prefer to change over to a non-primitive lattice, if necessary, in order to preserve the same integral representation for a given geometric symmetry element. The matrices P and describing the changes of basis between primitive and centred lattices are listed in Table 5.1.3.1 and illustrated in Figs. 5.1.3.2 to 5.1.3.8 , pp. 80–85, of Volume A of International Tables (Arnold, 2005).
Step 3 gives rise to a system of congruences for the systems of non-primitive translations which may be associated to the matrices of a given arithmetic class, namely: first derived by Frobenius (1911). If equivalence under the action of is taken into account, 219 classes are found. If equivalence is defined with respect to the action of the subgroup of consisting only of transformations with determinant +1, then 230 classes called space-group types are obtained. In particular, associating to each of the 73 arithmetic classes a trivial set of non-primitive translations yields the 73 symmorphic space groups. This third step may also be treated as an abstract problem concerning group extensions, using cohomological methods [Ascher & Janner (1965); see Janssen (1973) for a summary]; the connection with Frobenius's approach, as generalized by Zassenhaus (1948), is examined in Ascher & Janner (1968).
The finiteness of the number of space-group types in dimension 3 was shown by Bieberbach (1912) to be the case in arbitrary dimension. The reader interested in N-dimensional space-group theory for may consult Brown (1969), Brown et al. (1978), Schwarzenberger (1980), and Engel (1986). The standard reference for integral representation theory is Curtis & Reiner (1962).
All three-dimensional space groups G have the property of being solvable, i.e. that there exists a chain of subgroups where each is a normal subgroup of and the factor group is a cyclic group of some order . This property may be established by inspection, or deduced from a famous theorem of Burnside [see Burnside (1911), pp. 322–323] according to which any group G such that , with p and q distinct primes, is solvable; in the case at hand, and . The whole classification of 3D space groups can be performed swiftly by a judicious use of the solvability property (L. Auslander, personal communication).
Solvability facilitates the indexing of elements of G in terms of generators and relations (Coxeter & Moser, 1972; Magnus et al., 1976) for the purpose of calculation. By definition of solvability, elements may be chosen in such a way that the cyclic factor group is generated by the coset . The set is then a system of generators for G such that the defining relations [see Brown et al. (1978), pp. 26–27] have the particularly simple form with and . Each element g of G may then be obtained uniquely as an `ordered word': with , using the algorithm of Jürgensen (1970). Such generating sets and defining relations are tabulated in Brown et al. (1978, pp. 61–76). An alternative list is given in Janssen (1973, Table 4.3, pp. 121–123, and Appendix D, pp. 262–271).
The action of a crystallographic group Γ may be written in terms of standard coordinates in as with
An important characteristic of the representation is its reducibility, i.e. whether or not it has invariant subspaces other than and the whole of . For triclinic, monoclinic and orthorhombic space groups, θ is reducible to a direct sum of three one-dimensional representations: for trigonal, tetragonal and hexagonal groups, it is reducible to a direct sum of two representations, of dimension 2 and 1, respectively; while for tetrahedral and cubic groups, it is irreducible.
By Schur's lemma (see e.g. Ledermann, 1987), any matrix which commutes with all the matrices for must be a scalar multiple of the identity in each invariant subspace.
In the reducible cases, the reductions involve changes of basis which will be rational, not integral, for those arithmetic classes corresponding to non-primitive lattices. Thus the simplification of having maximally reduced representation has as its counterpart the use of non-primitive lattices.
The notions of orbit, isotropy subgroup and fundamental domain (or asymmetric unit) for the action of G on are inherited directly from the general setting of Section 1.3.4.2.2.2. Points x for which are called special positions, and the various types of isotropy subgroups which may be encountered in crystallographic groups have been labelled by means of Wyckoff symbols. The representation operators in have the form: The operators associated to the purely rotational part of each transformation will also be used. Note the relation:
Let a crystal structure be described by the list of the atoms in its unit cell, indexed by . Let the electron-density distribution about the centre of mass of atom k be described by with respect to the standard coordinates x. Then the motif may be written as a sum of translates: and the crystal electron density is .
Suppose that is invariant under Γ. If and are in the same orbit, say , then Therefore if is a special position and thus , then This identity implies that (the special position condition), and that i.e. that must be invariant by the pure rotational part of . Trueblood (1956) investigated the consequences of this invariance on the thermal vibration tensor of an atom in a special position (see Section 1.3.4.2.2.6 below).
Let J be a subset of K such that contains exactly one atom from each orbit. An orbit decomposition yields an expression for in terms of symmetry-unique atoms: or equivalently If the atoms are assumed to be Gaussian, write where is the total number of electrons, and where the matrix combines the Gaussian spread of the electrons in atom j at rest with the covariance matrix of the random positional fluctuations of atom j caused by thermal agitation.
In crystallographic coordinates:
If atom k is in a special position , then the matrix must satisfy the identity for all g in the isotropy subgroup of . This condition may also be written in Cartesian coordinates as where This is a condensed form of the symmetry properties derived by Trueblood (1956).
An elementary discussion of this topic may be found in Chapter 1.4 of this volume.
Having established that the symmetry of a crystal may be most conveniently stated and handled via the left representation of G given by its action on electron-density distributions, it is natural to transpose this action by the identity of Section 1.3.2.5.5: for any tempered distribution T, i.e. whenever the transforms are functions.
Putting , a -periodic distribution, this relation defines a left action of G on given by which is conjugate to the action in the sense that The identity expressing the G-invariance of is then equivalent to the identity between its structure factors, i.e. (Waser, 1955a)
If G is made to act on via the usual notions of orbit, isotropy subgroup (denoted ) and fundamental domain may be attached to this action. The above relation then shows that the spectrum is entirely known if it is specified on a fundamental domain containing one reciprocal-lattice point from each orbit of this action.
A reflection h is called special if . Then for any we have , and hence implying that unless . Special reflections h for which for some are thus systematically absent. This phenomenon is an instance of the duality between periodization and decimation of Section 1.3.2.7.2: if , the projection of on the direction of h has period , hence its transform (which is the portion of F supported by the central line through h) will be decimated, giving rise to the above condition.
A reflection h is called centric if , i.e. if the orbit of h contains . Then for some coset γ in , so that the following relation must hold: In the absence of dispersion, Friedel's law gives rise to the phase restriction: The value of the restricted phase is independent of the choice of coset representative γ. Indeed, if is another choice, then with and by the Frobenius congruences , so that Since , and if h is not a systematic absence: thus
The treatment of centred lattices may be viewed as another instance of the duality between periodization and decimation (Section 1.3.2.7.2): the periodization of the electron density by the non-primitive lattice translations has as its counterpart in reciprocal space the decimation of the transform by the `reflection conditions' describing the allowed reflections, the decimation and periodization matrices being each other's contragredient.
The reader may consult the papers by Bienenstock & Ewald (1962) and Wells (1965) for earlier approaches to this material.
Structure factors may be calculated from a list of symmetry-unique atoms by Fourier transformation of the orbit decomposition formula for the motif given in Section 1.3.4.2.2.4: i.e. finally:
In the case of Gaussian atoms, the atomic transforms are or equivalently
Two common forms of equivalent temperature factors (incorporating both atomic form and thermal motion) are
In the first case, does not depend on , and therefore: In the second case, however, no such simplification can occur: These formulae, or special cases of them, were derived by Rollett & Davies (1955), Waser (1955b), and Trueblood (1956).
The computation of structure factors by applying the discrete Fourier transform to a set of electron-density values calculated on a grid will be examined in Section 1.3.4.4.5.
A formula for the Fourier synthesis of electron-density maps from symmetry-unique structure factors is readily obtained by orbit decomposition: where L is a subset of such that contains exactly one point of each orbit for the action of G on . The physical electron density per cubic ångström is then with V in Å3.
In the absence of anomalous scatterers in the crystal and of a centre of inversion −I in Γ, the spectrum has an extra symmetry, namely the Hermitian symmetry expressing Friedel's law (Section 1.3.4.2.1.4). The action of a centre of inversion may be added to that of Γ to obtain further simplification in the above formula: under this extra action, an orbit with is either mapped into itself or into the disjoint orbit ; the terms corresponding to and may then be grouped within the common orbit in the first case, and between the two orbits in the second case.
|
The general statement of Parseval's theorem given in Section 1.3.4.2.1.5 may be rewritten in terms of symmetry-unique structure factors and electron densities by means of orbit decomposition.
In reciprocal space, for each l, the summands corresponding to the various are equal, so that the left-hand side is equal to
In real space, the triple integral may be rewritten as (where D is the asymmetric unit) if and are smooth densities, since the set of special positions has measure zero. If, however, the integral is approximated as a sum over a G-invariant grid defined by decimation matrix N, special positions on this grid must be taken into account: where the discrete asymmetric unit D contains exactly one point in each orbit of G in .
The standard convolution theorems derived in the absence of symmetry are readily seen to follow from simple properties of functions (denoted simply e in formulae which are valid for both signs), namely: These relations imply that the families of functions both generate an algebra of functions, i.e. a vector space endowed with an internal multiplication, since (i) and (ii) show how to `linearize products'.
Friedel's law (when applicable) on the one hand, and the Fourier relation between intensities and the Patterson function on the other hand, both follow from the property
When crystallographic symmetry is present, the convolution theorems remain valid in their original form if written out in terms of `expanded' data, but acquire a different form when rewritten in terms of symmetry-unique data only. This rewriting is made possible by the extra relation (Section 1.3.4.2.2.5) or equivalently
The kernels of symmetrized Fourier transforms are not the functions e but rather the symmetrized sums for which the linearization formulae are readily obtained using (i), (ii) and (iv) as where the choice of sign in ± must be the same throughout each formula.
Formulae defining the `structure-factor algebra' associated to G were derived by Bertaut (1955c, 1956b,c, 1959a,b) and Bertaut & Waser (1957) in another context.
The forward convolution theorem (in discrete form) then follows. Let then with
The backward convolution theorem is derived similarly. Let then with Both formulae are simply orbit decompositions of their symmetry-free counterparts.
Consider two model electron densities and with the same period lattice and the same space group G. Write their motifs in terms of atomic electron densities (Section 1.3.4.2.2.4) as where and label the symmetry-unique atoms placed at positions and , respectively.
To calculate the correlation between and we need the following preliminary formulae, which are easily established: if and f is an arbitrary function on , then hence and
The cross correlation between motifs is therefore which contains a peak of shape at the interatomic vector for each , , , .
The cross-correlation between the original electron densities is then obtained by further periodizing by .
Note that these expressions are valid for any choice of `atomic' density functions and , which may be taken as molecular fragments if desired (see Section 1.3.4.4.8).
If G contains elements g such that has an eigenspace with eigenvalue 1 and an invariant complementary subspace , while has a non-zero component in , then the Patterson function will contain Harker peaks (Harker, 1936) of the form [where represent the action of g in ] in the translate of by .
References
Arnold, H. (2005). Transformations in crystallography. In International Tables for Crystallography, Vol. A. Space-group symmetry, edited by Th. Hahn, Chapter 5.1. Heidelberg: Springer.Google ScholarAscher, E. & Janner, A. (1965). Algebraic aspects of crystallography. I. Space groups as extensions. Helv. Phys. Acta, 38, 551–572.Google Scholar
Ascher, E. & Janner, A. (1968). Algebraic aspects of crystallography. II. Non-primitive translations in space groups. Commun. Math. Phys. 11, 138–167.Google Scholar
Ash, J. M. (1976). Multiple trigonometric series. In Studies in harmonic analysis, edited by J. M. Ash, pp. 76–96. MAA studies in mathematics, Vol. 13. The Mathematical Association of America.Google Scholar
Auslander, L. (1965). An account of the theory of crystallographic groups. Proc. Am. Math. Soc. 16, 1230–1236.Google Scholar
Bertaut, E. F. (1955c). Fonction de répartition: application à l'approache directe des structures. Acta Cryst. 8, 823–832.Google Scholar
Bertaut, E. F. (1956b). Tables de linéarisation des produits et puissances des facteurs de structure. Acta Cryst. 9, 322–323.Google Scholar
Bertaut, E. F. (1956c). Algèbre des facteurs de structure. Acta Cryst. 9, 769–770.Google Scholar
Bertaut, E. F. (1959a). IV. Algèbre des facteurs de structure. Acta Cryst. 12, 541–549.Google Scholar
Bertaut, E. F. (1959b). V. Algèbre des facteurs de structure. Acta Cryst. 12, 570–574.Google Scholar
Bertaut, E. F. & Waser, J. (1957). Structure factor algebra. II. Acta Cryst. 10, 606–607.Google Scholar
Bieberbach, L. (1911). Über die Bewegungsgruppen der Euklidischen Raume I. Math. Ann. 70, 297–336.Google Scholar
Bieberbach, L. (1912). Über die Bewegungsgruppen der Euklidischen Raume II. Math. Ann. 72, 400–412.Google Scholar
Bienenstock, A. & Ewald, P. P. (1962). Symmetry of Fourier space. Acta Cryst. 15, 1253–1261.Google Scholar
Booth, A. D. (1945a). Two new modifications of the Fourier method of X-ray structure analysis. Trans. Faraday Soc. 41, 434–438.Google Scholar
Bricogne, G. (1974). Geometric sources of redundancy in intensity data and their use for phase determination. Acta Cryst. A30, 395–405.Google Scholar
Bricogne, G. (1982). Generalised density modification methods. In Computational crystallography, edited by D. Sayre, pp. 258–264. New York: Oxford University Press.Google Scholar
Bricogne, G. (1984). Maximum entropy and the foundations of direct methods. Acta Cryst. A40, 410–445.Google Scholar
Bricogne, G. (1988). A Bayesian statistical theory of the phase problem. I. A multichannel maximum entropy formalism for constructing generalised joint probability distributions of structure factors. Acta Cryst. A44, 517–545.Google Scholar
Britten, P. L. & Collins, D. M. (1982). Information theory as a basis for the maximum determinant. Acta Cryst. A38, 129–132.Google Scholar
Brown, H. (1969). An algorithm for the determination of space groups. Math. Comput. 23, 499–514.Google Scholar
Brown, H., Bülow, R., Neubüser, J., Wondratschek, H. & Zassenhaus, H. (1978). Crystallographic groups of four-dimensional space. New York: John Wiley.Google Scholar
Burnside, W. (1911). Theory of groups of finite order, 2nd ed. Cambridge University Press.Google Scholar
Coxeter, H. S. M. & Moser, W. O. J. (1972). Generators and relations for discrete groups, 3rd ed. Berlin: Springer-Verlag.Google Scholar
Curtis, C. W. & Reiner, I. (1962). Representation theory of finite groups and associative algebras. New York: Wiley–Interscience.Google Scholar
Engel, P. (1986). Geometric crystallography. Dordrecht: Kluwer Academic Publishers.Google Scholar
Farkas, D. R. (1981). Crystallographic groups and their mathematics. Rocky Mountain J. Math. 11, 511–551.Google Scholar
Friedel, G. (1913). Sur les symétries cristallines que peut révéler la diffraction des rayons Röntgen. C. R. Acad. Sci. Paris, 157, 1533–1536.Google Scholar
Frobenius, G. (1911). Über die unzerlegbaren diskreten Bewegungsgruppen. Sitzungsber. Preuss. Akad. Wiss. Berlin, 29, 654–665.Google Scholar
Gillis, J. (1948a). Structure factor relations and phase determination. Acta Cryst. 1, 76–80.Google Scholar
Gillis, J. (1948b). The application of the Harker–Kasper method of phase determination. Acta Cryst. 1, 174–179.Google Scholar
Goedkoop, J. A. (1950). Remarks on the theory of phase-limiting inequalities and equalities. Acta Cryst. 3, 374–378.Google Scholar
Hall, M. (1959). The theory of groups. New York: Macmillan.Google Scholar
Harker, D. (1936). The application of the three-dimensional Patterson method and the crystal structures of proustite, Ag3AsS3, and pyrargyrite, Ag3SbS3. J. Chem. Phys. 4, 381–390.Google Scholar
Harker, D. & Kasper, J. S. (1948). Phases of Fourier coefficients directly from crystal diffraction data. Acta Cryst. 1, 70–75.Google Scholar
Janssen, T. (1973). Crystallographic groups. Amsterdam: North-Holland.Google Scholar
Jürgensen, H. (1970). Calculation with the elements of a finite group given by generators and defining relations. In Computational problems in abstract algebra, edited by J. Leech, pp. 47–57. Oxford: Pergamon Press.Google Scholar
Karle, J. & Hauptman, H. (1950). The phases and magnitudes of the structure factors. Acta Cryst. 3, 181–187.Google Scholar
Ledermann, W. (1987). Introduction to group characters, 2nd ed. Cambridge University Press.Google Scholar
Linnik, I. Ju. (1975). A multidimensional analogue of a limit theorem of G. Szegö. Math. USSR Izv. 9, 1323–1332.Google Scholar
MacGillavry, C. H. (1950). On the derivation of Harker–Kasper inequalities. Acta Cryst. 3, 214–217.Google Scholar
Magnus, W., Karrass, A. & Solitar, D. (1976). Combinatorial group theory: presentations of groups in terms of generators and relations, 2nd revised ed. New York: Dover Publications.Google Scholar
Montroll, E. W., Potts, R. B. & Ward, J. C. (1963). Correlations and spontaneous magnetization of the two-dimensional Ising model. J. Math. Phys. 4, 308–322.Google Scholar
Narayan, R. & Nityananda, R. (1982). The maximum determinant method and the maximum entropy method. Acta Cryst. A38, 122–128.Google Scholar
Onsager, L. (1944). Crystal statistics. I. Two-dimensional model with an order–disorder transition. Phys. Rev. 65, 117–149.Google Scholar
Patterson, A. L. (1934). A Fourier series method for the determination of the components of interatomic distances in crystals. Phys. Rev. 46, 372–376.Google Scholar
Patterson, A. L. (1935a). A direct method for the determination of the components of interatomic distances in crystals. Z. Kristallogr. 90, 517–542.Google Scholar
Patterson, A. L. (1935b). Tabulated data for the seventeen plane groups. Z. Kristallogr. 90, 543–554.Google Scholar
Patterson, A. L. (1959). In International tables for X-ray crystallography, Vol. II, pp. 9–10. Erratum, January 1962. Birmingham: Kynoch Press. (Present distributor Kluwer Academic Publishers, Dordrecht.)Google Scholar
Pepinsky, R. (1952). The use of positive kernels in Fourier syntheses of crystal structures. In Computing methods and the phase problem in X-ray crystal analysis, edited by R. Pepinsky, pp. 319–338. State College: Penn. State College.Google Scholar
Rollett, J. S. & Davies, D. R. (1955). The calculation of structure factors for centrosymmetric monoclinic systems with anisotropic atomic vibration. Acta Cryst. 8, 125–128.Google Scholar
Sayre, D. (1952b). Some implications of a theorem due to Shannon. Acta Cryst. 5, 843.Google Scholar
Sayre, D. (1952c). The Fourier transform in X-ray crystal analysis. In Computing methods and the phase problem in X-ray crystal analysis, edited by R. Pepinsky, pp. 361–390. State College: Penn. State University.Google Scholar
Schwarzenberger, R. L. E. (1980). N-dimensional crystallography. Research notes in mathematics, Vol. 41. London: Pitman.Google Scholar
Scott, W. R. (1964). Group theory. Englewood Cliffs: Prentice-Hall. [Reprinted by Dover, New York, 1987.]Google Scholar
Shenefelt, M. (1988). Group invariant finite Fourier transforms. PhD thesis, Graduate Centre of the City University of New York.Google Scholar
Trueblood, K. N. (1956). Symmetry transformations of general anisotropic temperature factors. Acta Cryst. 9, 359–361.Google Scholar
Warren, B. E. & Gingrich, N. S. (1934). Fourier integral analysis of X-ray powder patterns. Phys. Rev. 46, 368–372.Google Scholar
Waser, J. (1955a). Symmetry relations between structure factors. Acta Cryst. 8, 595.Google Scholar
Waser, J. (1955b). The anisotropic temperature factor in triclinic coordinates. Acta Cryst. 8, 731.Google Scholar
Waser, J. & Schomaker, V. (1953). The Fourier inversion of diffraction data. Rev. Mod. Phys. 25, 671–690.Google Scholar
Watson, G. L. (1970). Integral quadratic forms. Cambridge University Press.Google Scholar
Wells, M. (1965). Computational aspects of space-group symmetry. Acta Cryst. 19, 173–179.Google Scholar
Widom, H. (1960). A theorem on translation kernels in n dimensions. Trans. Am. Math. Soc. 94, 170–180.Google Scholar
Widom, H. (1975). Asymptotic inversion of convolution operators. Publ. Math. IHES, 44, 191–240.Google Scholar
Wolf, J. A. (1967). Spaces of constant curvature. New York: McGraw-Hill.Google Scholar
Wondratschek, H. (2005). Introduction to space-group symmetry. In International tables for crystallography, Vol. A. Space-group symmetry, edited by Th. Hahn, Part 8. Heidelberg: Springer.Google Scholar
Zassenhaus, H. (1948). Über eine Algorithmus zur Bestimmung der Raumgruppen. Commun. Helv. Math. 21, 117–141.Google Scholar