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. 46-47
|
Let be a period lattice in with matrix A, and let be the lattice reciprocal to , with period matrix . Let be defined similarly, and let us suppose that is a sublattice of , i.e. that as a set.
The relation between and may be described in two different fashions: (i) multiplicatively, and (ii) additively.
Let us now consider the two reciprocal lattices and . Their period matrices and are related by: , where is an integer matrix; or equivalently by . This shows that the roles are reversed in that is a sublattice of , which we may write:
The above relations between lattices may be rewritten in terms of the corresponding lattice distributions as follows: where and are (finite) residual-lattice distributions. We may incorporate the factor in (i) and into these distributions and define
Since , convolution with and has the effect of averaging the translates of a distribution under the elements (or `cosets') of the residual lattices and , respectively. This process will be called `coset averaging'. Eliminating and between (i) and (ii), and and between and , we may write: These identities show that period subdivision by convolution with (respectively ) on the one hand, and period decimation by `dilation' by on the other hand, are mutually inverse operations on and (respectively and ).
Finally, let us consider the relations between the Fourier transforms of these lattice distributions. Recalling the basic relation of Section 1.3.2.6.5, i.e. and similarly:
Thus (respectively ), a decimated version of (respectively ), is transformed by into a subdivided version of (respectively ).
The converse is also true: i.e. and similarly
Thus (respectively ), a subdivided version of (respectively ) is transformed by into a decimated version of (respectively ). Therefore, the Fourier transform exchanges subdivision and decimation of period lattices for lattice distributions.
Further insight into this phenomenon is provided by applying to both sides of (iv) and (v) and invoking the convolution theorem: These identities show that multiplication by the transform of the period-subdividing distribution (respectively ) has the effect of decimating to (respectively to ). They clearly imply that, if and , then Therefore, the duality between subdivision and decimation may be viewed as another aspect of that between convolution and multiplication.
There is clearly a strong analogy between the sampling/periodization duality of Section 1.3.2.6.6 and the decimation/subdivision duality, which is viewed most naturally in terms of subgroup relationships: both sampling and decimation involve restricting a function to a discrete additive subgroup of the domain over which it is initially given.
The usual presentation of this duality is not in terms of lattice distributions, but of periodic distributions obtained by convolving them with a motif.
Given , let us form , then decimate its transform by keeping only its values at the points of the coarser lattice ; as a result, is replaced by , and the reverse transform then yields which is the coset-averaged version of the original . The converse situation is analogous to that of Shannon's sampling theorem. Let a function whose transform has compact support be sampled as at the nodes of . Then is periodic with period lattice . If the sampling lattice is decimated to , the inverse transform becomes hence becomes periodized more finely by averaging over the cosets of . With this finer periodization, the various copies of Supp Φ may start to overlap (a phenomenon called `aliasing'), indicating that decimation has produced too coarse a sampling of φ.