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. 74-76
|
Suppose, as in Section 1.3.3.3.2.1, that the decimation matrix N may be factored as . Then any grid point index in real space may be written with and determined by These relations establish a one-to-one correspondence between and the Cartesian product of and , and hence as a set. However as an Abelian group, since in general because there can be a `carry' from the addition of the first components into the second components; therefore, as a -module, which shows that the incorporation of symmetry into the Cooley–Tukey algorithm is not a trivial matter.
Let act on I through and suppose that N `integerizes' all the non-primitive translations so that we may write with and determined as above. Suppose further that N, and commute with for all , i.e. (by Schur's lemma, Section 1.3.4.2.2.4) that these matrices are integer multiples of the identity in each G-invariant subspace. The action of g on leads to which we may decompose as with and
Introducing the notation the two components of may be written with
The term is the geometric equivalent of a carry or borrow: it arises because , calculated as a vector in , may be outside the unit cell , and may need to be brought back into it by a `large' translation with a non-zero component in the space; equivalently, the action of g may need to be applied around different permissible origins for different values of , so as to map the unit cell into itself without any recourse to lattice translations. [Readers familiar with the cohomology of groups (see e.g. Hall, 1959; MacLane, 1963) will recognize as the cocycle of the extension of G-modules described by the exact sequence .]
Thus G acts on I in a rather complicated fashion: although does define a left action in alone, no action can be defined in alone because depends on . However, because , and are left actions, it follows that satisfies the identity for all g, in G and all in . In particular, for all , and
This action will now be used to achieve optimal use of symmetry in the multidimensional Cooley–Tukey algorithm of Section 1.3.3.3.2.1. Let us form an array Y according to for all but only for the unique under the action of G in . Except in special cases which will be examined later, these vectors contain essentially an asymmetric unit of electron-density data, up to some redundancies on boundaries. We may then compute the partial transform on : Using the symmetry of in the form yields by the procedure of Section 1.3.3.3.2 the transposition formula
By means of this identity we can transpose intermediate results initially indexed by so as to have them indexed by We may then apply twiddle factors to get and carry out the second transform The final results are indexed by which yield essentially an asymmetric unit of structure factors after unscrambling by:
The transposition formula above applies to intermediate results when going backwards from F to , provided these results are considered after the twiddle-factor stage. A transposition formula applicable before that stage can be obtained by characterizing the action of G on h (including the effects of periodization by ) in a manner similar to that used for m.
Let with We may then write with Here and are defined by and
Let us then form an array according to for all but only for the unique under the action of G in , and transform on to obtain Putting and using the symmetry of F in the form where yields by a straightforward rearrangement
This formula allows the transposition of intermediate results Z from an indexing by to an indexing by We may then apply the twiddle factors to obtain and carry out the second transform on The results, indexed by yield essentially an asymmetric unit of electron densities by the rearrangement
The equivalence of the two transposition formulae up to the intervening twiddle factors is readily established, using the relation which is itself a straightforward consequence of the identity
To complete the characterization of the effect of symmetry on the Cooley–Tukey factorization, and of the economy of computation it allows, it remains to consider the possibility that some values of may be invariant under some transformations under the action .
Suppose that has a non-trivial isotropy subgroup , and let . Then each subarray defined by satisfies the identity so that the data for the transform on have residual symmetry properties. In this case the identity satisfied by simplifies to which shows that the mapping satisfies the Frobenius congruences (Section 1.3.4.2.2.3). Thus the internal symmetry of subarray with respect to the action of G on is given by acting on via
The transform on needs only be performed for one out of distinct arrays (results for the others being obtainable by the transposition formula), and this transforms is -symmetric. In other words, the following cases occur:
The symmetry properties of the -transform may themselves be exploited in a similar way if can be factored as a product of smaller decimation matrices; otherwise, an appropriate symmetrized DFT routine may be provided, using for instance the idea of `multiplexing/demultiplexing' (Section 1.3.4.3.5). We thus have a recursive descent procedure, in which the deeper stages of the recursion deal with transforms on fewer points, or of lower symmetry (usually both).
The same analysis applies to the -transforms on the subarrays , and leads to a similar descent procedure.
In conclusion, crystallographic symmetry can be fully exploited to reduce the amount of computation to the minimum required to obtain the unique results from the unique data. No such analysis was so far available in cases where the asymmetric units in real and reciprocal space are not parallelepipeds. An example of this procedure will be given in Section 1.3.4.3.6.5.
References
Hall, M. (1959). The theory of groups. New York: Macmillan.Google ScholarMacLane, S. (1963). Homology. Berlin: Springer-Verlag.Google Scholar