Tables for
Volume A1
Symmetry relations between space groups
Edited by Hans Wondratschek and Ulrich Müller

International Tables for Crystallography (2006). Vol. A1, ch. 1.2, pp. 6-9   | 1 | 2 |

Section 1.2.2. Mappings and matrices

Hans Wondratscheka*

aInstitut für Kristallographie, Universität, D-76128 Karlsruhe, Germany
Correspondence e-mail:

1.2.2. Mappings and matrices

| top | pdf | Crystallographic symmetry operations

| top | pdf |

A crystal is a finite block of an infinite periodic array of atoms in physical space. The infinite periodic array is called the crystal pattern. The finite block is called the macroscopic crystal.

Periodicity implies that there are translations which map the crystal pattern onto itself. Geometric mappings have the property that for each point P of the space, and thus of the object, there is a uniquely determined point [\tilde{P}], the image point. The mapping is reversible if each image point [\tilde{P}] is the image of one point P only.

Translations belong to a special category of mappings which leave all distances in the space invariant (and thus within an object and between objects in the space). Furthermore, a mapping of an object onto itself (German: Deckoperation) is the basis of the concept of geometric symmetry. This is expressed by the following two definitions.

Definition A mapping is called a motion, a rigid motion or an isometry if it leaves all distances invariant (and thus all angles, as well as the size and shape of an object). In this volume the term `isometry' is used.

An isometry is a special kind of affine mapping. In an affine mapping, parallel lines are mapped onto parallel lines; lengths and angles may be distorted but quotients of lengths on the same line are preserved. In Section[link], the description of affine mappings is discussed, because this type of description also applies to isometries. Affine mappings are important for the classification of crystallographic symmetries, cf. Section[link].

Definition A mapping is called a symmetry operation of an object if

  • (1) it is an isometry,

  • (2) it maps the object onto itself.

Instead of `maps the object onto itself', one frequently says `leaves the object invariant (as a whole)'. This does not mean that each point of the object is mapped onto itself; rather, the object is mapped in such a way that an observer cannot distinguish the states of the object before and after the mapping.

Definition A symmetry operation of a crystal pattern is called a crystallographic symmetry operation.

The symmetry operations of a macroscopic crystal are also crystallographic symmetry operations, but they belong to another kind of mapping which will be discussed in Section[link].

There are different types of isometries which may be crystallographic symmetry operations. These types are described and discussed in many textbooks of crystallography and in mathematical, physical and chemical textbooks. They are listed here without further treatment. Fixed points are very important for the characterization of isometries.

Definition A point P is a fixed point of a mapping if it is mapped onto itself, i.e. the image point [\tilde{P}] is the same as the original point P: [\tilde{P} = P].

The set of all fixed points of an isometry may be the whole space, a plane in the space, a straight line, a point, or the set may be empty (no fixed point).

The following kinds of isometries exist:

  • (1) The identity operation, which maps each point of the space onto itself. It is a symmetry operation of every object and, although trivial, is indispensable for the group properties which are discussed in Section 1.2.3[link].

  • (2) A translation t which shifts every object. A translation is characterized by its translation vector t and has no fixed point: if x is the column of coordinates of a point P, then the coordinates [\tilde{x}] of the image point [\tilde{P}] are [{\tilde {\bi x}} = {\bi x} + {\bi t}]. If a translation is a symmetry operation of an object, the object extends infinitely in the directions of t and [-{\bf t}]. A translation preserves the `handedness' of an object, e.g. it maps any right-hand glove onto a right-hand one and any left-hand glove onto a left-hand one.

  • (3) A rotation is an isometry that leaves one line fixed pointwise. This line is called the rotation axis. The degree of rotation about this axis is described by its rotation angle [\varphi]. In particular, a rotation is called an N-fold rotation if the rotation angle is [\varphi = k \times 360^{\circ}/N], where k and N are relatively prime integers. A rotation preserves the `handedness' of any object.

  • (4) A screw rotation is a rotation coupled with a translation parallel to the rotation axis. The rotation axis is now called the screw axis. The translation vector is called the screw vector. A screw rotation has no fixed points. The screw axis is invariant as a whole under the screw rotation but not pointwise.

  • (5) An N-fold rotoinversion is an N-fold rotation coupled with inversion through a point on the rotation axis. This point is called the centre of the rotoinversion. For [N \neq 2] it is the only fixed point. The axis of the rotation is invariant as a whole under the rotoinversion and is called its rotoinversion axis. A rotoinversion changes the handedness by its inversion component: it maps any right-hand glove onto a left-hand one and vice versa. Performed twice it results in a rotation. Special rotoinversions are those for [N = 1] and [N = 2], which are dealt with separately.

  • (6) The inversion can be considered as a onefold rotoinversion ([N = 1]). The fixed point is called the inversion centre or the centre of symmetry.

  • (7) A twofold rotoinversion ([N = 2]) is called a reflection or a reflection through a plane. It is an isometry which leaves a plane perpendicular to the twofold rotoinversion axis fixed pointwise. This plane is called the reflection plane or mirror plane and it intersects the rotation axis in the centre of the rotoinversion. Its orientation is described by the direction of its normal vector, i.e. of the rotation axis. For a twofold rotoinversion, neither the rotation nor the inversion are symmetry operations themselves. As for any other rotoinversion, the reflection changes the handedness of an object.

  • (8) A glide reflection is a reflection through a plane coupled with a translation parallel to this plane. The translation vector is called the glide vector. A glide reflection changes the handedness and has no fixed point. The former reflection plane is now called the glide plane. Under a glide reflection, the glide plane is invariant as a whole but not pointwise.

Symmetry operations of crystal patterns may belong to any of these isometries. The set of all symmetry operations of a crystal pattern has the following properties: performing two (and thus more) symmetry operations one after the other results in another symmetry operation. Moreover, there is the identity operation in this set, i.e. an operation that leaves every point of the space and thus of the crystal pattern fixed. Finally, for any symmetry operation of an object there is an `inverse' symmetry operation by which its effect is reversed. These properties are necessary for the application of group theory, cf. Section 1.2.3[link]. Coordinate systems and coordinates

| top | pdf |

To describe mappings analytically, one introduces a coordinate system [\{O,\ {\bf a},\ {\bf b},\ {\bf c}\}], consisting of three linearly independent (i.e. not coplanar) basis vectors [{\bf a},\ {\bf b},\ {\bf c}] (or [{\bf a}_1,\ {\bf a}_2,\ {\bf a}_3]) and an origin O. For the plane (two-dimensional space) an origin and two linearly independent (i.e. not parallel) basis vectors [{\bf a},\ {\bf b}] (or [{\bf a}_1,\ {\bf a}_2]) are chosen. Referred to this coordinate system, each point P can be described by three (or two for the plane) coordinates [x,\,y,\,z] (or [x_1,\,x_2,\,x_3]). An object, e.g. a crystal, can now be described by a continuous or discontinuous function of the coordinates such as the electron density or the coordinates of the centres of the atoms. A mapping can be regarded as an instruction of how to calculate the coordinates [\tilde{x},\,\tilde{y},\,\tilde{z}] of the image point [\tilde{X}] from the coordinates [x,\,y,\,z] of the original point X.

In contrast to the practice in physics and chemistry, a non-Cartesian coordinate system is usually chosen in crystallography. The primary aim of the choice of the crystallographic coordinate system is to describe the crystal pattern and its set of all symmetry operations in a simple way. This aim holds in particular for the infinitely many symmetry translations of the crystal pattern, which form its translation group. Secondary to this aim are equality of the lengths of, and right angles between, the basis vectors.

The vector t belonging to the translation t is called a translation vector or a lattice vector. The set of all translation vectors of the crystal pattern is called its vector lattice L. Both the translation group and the vector lattice are useful tools for describing the periodicity of the crystals.

For the description of a vector lattice several kinds of bases are in use. Orthonormal bases are not the most convenient, because the coefficients of the lattice vectors may then be any real number. The coefficients of the lattice vectors are more transparent if the basis vectors themselves are lattice vectors.

Definition A basis which consists of lattice vectors of a crystal pattern is called a lattice basis or a crystallographic basis.

Referred to a lattice basis, each lattice vector [{\bi t} \in {\bf L}] is a linear combination of the basis vectors with rational coefficients. One can even select special bases such that the coefficients of all lattice vectors are integers.

Definition A crystallographic basis is called a primitive basis if every lattice vector has integer coefficients.

A fundamental feature of vector lattices is that for any lattice in a dimension greater than one an infinite number of primitive bases exists. With certain rules, the choice of a primitive basis can be made unique (reduced bases). In practice, however, the conventional bases are not always primitive; the choice of a conventional basis is determined by the matrix parts of the symmetry operations, cf. Section[link]. The description of mappings

| top | pdf |

The instruction for the calculation of the coordinates of [\tilde{X}] from the coordinates of X is simple for an affine mapping and thus for an isometry. The equations are [\eqalign{\tilde {x} &= W_{11}\,x + W_{12}\,y + W_{13}\,z + w_1 \cr \tilde{y} &= W_{21}\,x + W_{22}\,y + W_{23}\,z + w_2 \cr \tilde{z} &= W_{31}\,x + W_{32}\,y + W_{33}\,z + w_3, }\eqno(]where the coefficients [W_{ik}] and [w_j] are constant. These equations can be written using the matrix formalism: [ \left (\matrix{\tilde{x} \cr \tilde{y} \cr \tilde{z}}\right) = \left (\matrix{ W_{11} \,\, W_{12}\, \, W_{13} \cr W_{21}\, \, W_{22}\, \, W_{23} \cr W_{31}\, \, W_{32}\, \, W_{33}} \right) \left (\matrix{ x \cr y \cr z }\right) + \left (\matrix{ w_1 \cr w_2 \cr w_3} \right). \eqno (] This matrix equation is usually abbreviated by [{\tilde {\bi x}} = {{\bi W}} \, {{\bi x}} + {{\bi w}}, \eqno (]where [\tilde{{\bi x}} = \left (\matrix{\tilde{x} \cr \tilde{y} \cr \tilde{z}} \right)\!, \, \, {\bi x} = \left (\matrix{x \cr y \cr z}\right)\!, \, \, {\bi w} = \left (\matrix{w_1 \cr w_2 \cr w_3 } \right) \, {\rm and }\, \, {\bi W} = \left (\matrix{W_{11} & W_{12} & W_{13} \cr W_{21} & W_{22} & W_{23} \cr W_{31} & W_{32} & W_{33} } \right). ]

Definition The matrix W is called the linear part or matrix part, the column w is the translation part or column part of a mapping.

In equations ([link] and ([link], the coordinates are mixed with the quantities describing the mapping, designated by the letters [W_{ik}] and [w_j] or W and w. Therefore, one prefers to write equation ([link] in the form [{\tilde {\bi x}} = ({\bi W}, \, {\bi w}) \, {\bi x}\, \, {\rm or } \, \, {\tilde {\bi x}} = \{ {\bi W} \, | \, {\bi w} \} \, {\bi x}. \eqno (] The symbols ([{\bi W}, \, {\bi w}]) and {[{\bi W} \, | \, {\bi w}]} which describe the mapping referred to the chosen coordinate system are called the matrix–column pair and the Seitz symbol.

The formulae for the combination of affine mappings and for the inverse of an affine mapping (regular matrix W) are obtained by [\eqalign{{\tilde {\bi x}} &= {\bi W}_1 \, {\bi x} + {\bi w}_1, \, {\tilde {\tilde {\bi x}}} = {\bi W}_2 \, {\tilde {\bi x}} + {\bi w}_2 = {\bi W}_3 {\bi x} + {\bi w}_3 \cr {\tilde {\tilde {\bi x}}} &= {\bi W}_2 \, ({\bi W}_1 {\bi x} + {\bi w}_1) + {\bi w}_2 = {\bi W}_2 {\bi W}_1 {\bi x} \, + \, {\bi W}_2{\bi w}_1 + {\bi w}_2. } ]From [{\tilde {\bi x}} = {\bi Wx} + {\bi w}], it follows that [{\bi W}^{-1} \, {\tilde {\bi x}} = {\bi x} + {\bi W}^{-1} \, {\bi w}] or [{\bi x} = {\bi W}^{-1} \, {\tilde{\bi x}} - {\bi W}^{-1} \, {\bi w}.]

Using matrix–column pairs, this reads [({\bi W}_3, \, {\bi w}_3) = ({\bi W}_2, \, {\bi w}_2)\,({\bi W}_1, \, {\bi w}_1)= ({\bi W}_2{\bi W}_1, \, {\bi W}_2 {\bi w}_1 + {\bi w}_2) \eqno (]and [{\bi x} = ({\bi W}, \, {\bi w})^{-1} {\tilde{\bi x}} = ({\bi W}', \, {\bi w}') \tilde{ \it x}]or [({\bi W}', \, {\bi w}') = ({\bi W}, \, {\bi w})^{-1} = ({\bi W}^{-1}, \, -{\bi W}^{-1}{\bi w}). \eqno (]

One finds from equations ([link] and ([link] that the linear parts of the matrix–column pairs transform as one would expect:

  • (1) the linear part of the product of two matrix–column pairs is the product of the linear parts, i.e. if [({\bi W}_3, \, {\bi w}_3)=] [({\bi W}_2, \, {\bi w}_2) \, ({\bi W}_1, \, {\bi w}_1)] then [{\bi W}_3 = {\bi W}_2 \, {\bi W}_1];

  • (2) the linear part of the inverse of a matrix–column pair is the inverse of the linear part, i.e. if [({\bi X}, \, {\bi x}) = ({\bi W}, \, {\bi w})^{-1}], then [{\bi X} = {\bi W}^{-1}]. [This relation is included in the first one: from [({\bi W}, \, {\bi w}) \, ({\bi X}, \, {\bi x})=({\bi W}{\bi X}, {\bi Wx} + {\bi w}) =({\bi I}, \, {\bi o})] follows [{\bi X} = {\bi W}^{-1}]. Here I is the unit matrix and o is the column consisting of zeroes].

These relations will be used in Section[link].

For the column parts, equations ([link] and ([link] are less convenient: [(1) \,\, {\bi w}_3 = {\bi W}_2 \, {\bi w}_1 + {\bi w}_2; \, \, \qquad (2)\,\, {\bi w}' = - {\bi W}^{-1}{\bi w}.]

Because of the inconvenience of these relations, it is often preferable to use `augmented' matrices, by which one can describe the combination of affine mappings and the inverse mapping by the equations of the usual matrix multiplication. These matrices are introduced in the next section. Matrix–column pairs and [(n+1)\times(n+1)] matrices

| top | pdf |

It is natural to combine the matrix part and the column part describing an affine mapping to form a [(3\times4)] matrix, but such matrices cannot be multiplied by the usual matrix multiplication and cannot be inverted. However, if one supplements the [(3\times4)] matrix by a fourth row `0 0 0 1', one obtains a [(4\times4)] square matrix which can be combined with the analogous matrices of other mappings and can be inverted. These matrices are called augmented matrices and are designated by open-face letters in this volume:[\specialfonts{\bbsf W} = \left (\matrix{W_{11} & W_{12} & W_{13} & \vphantom{\big(^2}\vrule &w_1 \cr \noalign{\vskip-1.0em}\cr W_{21} & W_{22} & W_{23} & \vphantom{\big(^2}\vrule & w_2 \cr \noalign{\vskip-1.0em}\cr W_{31} & W_{32} & W_{33} & \vphantom{\big(^2_2}\vrule & w_3 \cr \noalign{\vskip-1.0em}\cr \noalign{\vskip.3em} \noalign{\hrule} \cr 0 & 0 & 0 & \vphantom{\big(^2}\vrule & 1 } \right), \,\,\, {\tilde{\bbsf x}} = \left (\matrix{\,\tilde{x}\, \cr \tilde{y} \cr \noalign{\vskip-1.0em}\cr \tilde{z}\cr \noalign{\vskip.3em} \noalign{\hrule} \cr 1} \right), \,\,\, {\bbsf x} = \left (\matrix{\,x\, \cr \noalign{\vskip-1.0em}\cr y \cr \noalign{\vskip-1.0em}\cr z \cr \noalign{\vskip.3em} \noalign{\hrule} \cr 1} \right). \eqno (]

In order to write equation ([link] as [\specialfonts\tilde{{\bbsf x}}= {\bbsf W}{\bbsf x}] with the augmented matrices [\specialfonts{\bbsf W}], the columns [\tilde{{\bi x}}] and x also have to be extended to the augmented columns [\specialfonts{\bbsf x}] and [\specialfonts\tilde{{\bbsf x}}]. Equations ([link] and ([link] then become [\specialfonts{\bbsf W}_{\rm 3} = {\bbsf W}_{\rm 2}\,{\bbsf W}_{\rm 1} { \rm\,\, and\,\, } ({\bbsf W})^{\rm -1}=({\bbsf W}^{\rm -1}). \eqno (]

The vertical and horizontal lines in the matrix have no mathematical meaning. They are simply a convenience for separating the matrix part from the column part and from the row `0 0 0 1', and could be omitted.

Augmented matrices are very useful when writing down general formulae which then become more transparent and more elegant. However, the matrix–column pair formalism is, in general, advantageous for practical calculations.

For the augmented columns of vector coefficients, see Section[link]. Isometries

| top | pdf |

Isometries are special affine mappings, as in Definition[link]. The matrix W of an isometry has to fulfil conditions which depend on the coordinate basis. These conditions are:

  • (1) A basis [{\bf a}_1, \, {\bf a}_2, \, {\bf a}_3] is characterized by the scalar products [({\bf a}_j \, {\bf a}_k)] of its basis vectors or by its lattice parameters [a,\,b,\,c,\,\alpha,\, \beta] and [\gamma]. Here [a,\,b,\,c] are the lengths of the basis vectors [{\bf a}_1,\,{\bf a}_2,\,{\bf a}_3] and [\alpha,\,\beta] and [\gamma] are the angles between [{\bf a}_2] and [{\bf a}_3,\, {\bf a}_3] and [{\bf a}_1,\,{\bf a}_1] and [{\bf a}_2], respectively. The metric matrix M (called G in IT A, Chapter 9.1[link] ) is the [(3\times3)] matrix which consists of the scalar products of the basis vectors: [{\bi M} = \left (\matrix{a^{2} & a\,b\,\cos\gamma & a\,c\,\cos\beta \cr b\,a\,\cos\gamma & b^{2} & b\,c\,\cos\alpha \cr c\,a\,\cos\beta & c\,b\,\cos\alpha & c^{2}} \right). ]If W is the matrix part of an isometry, referred to the basis ([{\bf a}_1,\ {\bf a}_2,\ {\bf a}_3]), then W must fulfil the condition [{\bi W}^{\rm T}\,\,{\bi M}\,{\bi W} = {\bi M}], where [{\bi W}^{\rm T}] is the transpose of W.

  • (2) For the determinant of W, [\det({\bi W}) = \pm{1}] must hold; [\det({\bi W}) = + 1] for the identity, translations, rotations and screw rotations; [\det({\bi W}) = -1] for inversions, reflections, glide reflections and rotoinversions.

  • (3) For the trace, [\rm{tr}({\bi W}) = W_{11} + W_{22} + W_{33} = \pm(1 + 2 \cos{\varphi})] holds, where [\varphi] is the rotation angle; the + sign applies if [\det({\bi W}) = + 1] and the − sign if [\det({\bi W}) = -1].

Algorithms for the determination of the kind of isometry from a given matrix–column pair and for the determination of the matrix–column pair for a given isometry can be found in IT A, Part 11[link] or in Hahn & Wondratschek (1994[link]). Vectors and vector coefficients

| top | pdf |

In crystallography, vectors and their coefficients as well as points and their coordinates are used for the description of crystal structures. Vectors represent translation shifts, distance and Patterson vectors, reciprocal-lattice vectors etc. With respect to a given basis a vector has three coefficients. In contrast to the coordinates of a point, these coefficients do not change if the origin of the coordinate system is shifted. In the usual description by columns, the vector coefficients cannot be distinguished from the point coordinates, but in the augmented-column description the difference becomes visible: the vector from the point P to the point Q has the coefficients [v_1=q_1-p_1], [v_2=q_2-p_2], [v_3=q_3-p_3], [1 - 1]. Thus, the column of the coefficients of a vector is not augmented by `1' but by `0'. Therefore, when the point P is mapped onto the point [\tilde{P}] by [\tilde{{\bi x}}= {\bi W}\,{\bi x} + {\bi w}] according to equation ([link], then the vector [{\bf v} = \overrightarrow{P\,Q}] is mapped onto the vector [ \tilde{\bf{v}} = \overrightarrow{\tilde{P}\,\tilde{Q}}] by transforming its coefficients by [\tilde{{\bi v}}={\bi W}\,{\bi v}], because the coefficients [w_j] are multiplied by the number `0' augmenting the column [{\bi v} = (v_j)]. Indeed, the distance vector [{\bf v} = \overrightarrow{P\,Q}] is not changed when the whole space is mapped onto itself by a translation.


  • (1) The difference in transformation behaviour between the point coordinates x and the vector coefficients v is not visible in the equations where the symbols [\specialfonts{\bbsf x}] and [\specialfonts{\bbsf v}] are used, but is obvious only if the columns are written in full, viz [ \left (\matrix{x_1 \cr x_2 \cr x_3\cr \noalign{\vskip.3em} \noalign {\hrule} \cr 1}\right) {\rm\,\,\, and\,\,\, } \left (\matrix{v_1 \cr v_2 \cr v_3\cr \noalign{\vskip.3em} \noalign {\hrule} \cr 0} \right).]

  • (2) The transformation behaviour of the vector coefficients is also apparent if the vector is understood to be a translation vector and the transformation behaviour of the translation is considered as in the last paragraph of the next section.

  • (3) The transformation [\tilde{{\bi v}}={\bi W}\,{\bi v}] is called an orthogonal mapping if W is the matrix part of an isometry. Origin shift and change of the basis

| top | pdf |

It is in general advantageous to refer crystallographic objects and their symmetries to the most appropriate coordinate system. The best coordinate system may be different for different steps of the calculations and for different objects which have to be considered simultaneously. Therefore, a change of the origin and/or the basis are frequently necessary when treating crystallographic problems. Here the formulae for the influence of an origin shift and a change of basis on the coordinates, on the matrix–column pairs of mappings and on the vector coefficients are only stated; the equations are derived in detail in IT A Chapters 5.1[link] and 5.2[link] , and in Hahn & Wondratschek (1994[link]).

Let a coordinate system be given with a basis [({\bf a}_1,\,{\bf a}_2,\, {\bf a}_3)^{\rm T}] and an origin O.1 Referred to this coordinate system, the column of coordinates of a point P is x; the matrix and column parts describing a symmetry operation are W and w according to equations ([link] to ([link], and the column of vector coefficients is v, see Section[link]. A new coordinate system may be introduced with the basis [({\bf a}'_1,\ {\bf a}'_2,\,{\bf a}'_3)^{\rm T}] and the origin [O']. Referred to the new coordinate system, the column of coordinates of the point P is [{\bi x}'], the symmetry operation is described by [{\bi W}'] and [{\bi w}'] and the column of vector coefficients is [{\bi v}'].

Let [{\bi p} = \overrightarrow{O\,O'}] be the column of coefficients for the vector from the old origin O to the new origin [O'] and let[{\bi P} = \left (\matrix{P_{11} & P_{12} & P_{13} \cr P_{21} & P_{22} & P_{23} \cr P_{31} & P_{32} & P_{33}} \right) \eqno (]be the matrix of a basis change, i.e. the matrix that relates the new basis [({\bf a}'_1,\,{\bf a}'_2,\,{\bf a}'_3)^{\rm T}] to the old basis [({\bf a}_1,\,{\bf a}_2,\,{\bf a}_3)^{\rm T}] according to [\left({\bf a}'_1,\,\! {\bf a}'_2,\,\! {\bf a}'_3\right)^{\rm T} = \left ({\bf a}_1,\,\! {\bf a}_2,\,\!{\bf a}_3\right)^{\rm T} {\bi P} = \left ({\bf a}_1,\!\ {\bf a}_2,\!\,{\bf a}_3\right)^{\rm T}\left (\!\matrix{P_{11}\!&P_{12}\!&P_{13} \cr P_{21}\!&P_{22}\!&P_{23} \cr P_{31}\!&P_{32}\!&P_{33}}\! \right)\!. \eqno (]Then the following equations hold: [{\bi x}' = {\bi P}^{-1}{\bi x}-{\bi P}^{-1}{\bi p} \, \, {\rm or }\, \, {\bi x}={\bi P}\,{\bi x}'+{\bi p}\semi \eqno (][{\bi W}\,'={\bi P}^{-1}\,{\bi W}\,{\bi P}\,\, {\rm or } \,\, {\bi W}={\bi P}\,{\bi W}\,'\,{\bi P}^{-1}\semi \eqno (][ {\bi w}'={\bi P}^{-1}({\bi w}+({\bi W}-{\bi I})\,{\bi p}) \,\, {\rm or }\,\, {\bi w}={\bi P}\,{\bi w}'-({\bi W}-{\bi I})\,{\bi p}. \eqno (]For the columns of vector coefficients v and [{\bi v}'], the following holds: [ {\bi v}'={\bi P}^{-1}{\bi v}\,\, {\rm or }\,\, {\bi v}={\bi P}\,{\bi v}', \eqno (]i.e. an origin shift does not change the vector coefficients.

These equations read in the augmented-matrix formalism [\specialfonts{\bbsf x}' = {\bbsf P}^{\rm -1}{\bbsf x};\ {\bbsf W}' = {\bbsf P}^{\rm -1}{\bbsf W}{\bbsf P}; \ {\bbsf v}' = {\bbsf P}^{\rm -1}{\bbsf v}. \eqno (]For the difference in the transformation behaviour of point coordinates and vector coefficients, see the remarks at the end of Section[link]. A vector v can be regarded as a translation vector; its translation is then described by (I, v), i.e. [{\bi W}={\bi I},\ {\bi w} = {\bi v}]. It can be shown using equation ([link]) that the translation and thus the translation vector are not changed under an origin shift, ([{\bi I},\,{\bi p}]), because [({\bi I},\,{\bi v})'=({\bi I},\,{\bi v})] holds. Moreover, under a general coordinate transformation the origin shift is not effective: in equation ([link]) only [{\bi v}'={\bi P}^{-1}{\bi v}] remains because of the equality [{\bi W}={\bi I}].


Hahn, Th. & Wondratschek, H. (1994). Symmetry of crystals. Introduction to International Tables for Crystallography, Vol. A. Sofia: Heron Press.

to end of page
to top of page