Tables for
Volume D
Physical properties of crystals
Edited by A. Authier

International Tables for Crystallography (2006). Vol. D, ch. 3.2, pp. 379-390

Section 3.2.3. Mathematical tools

V. Janovec,a* Th. Hahnb and H. Klapperc

aDepartment of Physics, Technical University of Liberec, Hálkova 6, 461 17 Liberec 1, Czech Republic,bInstitut für Kristallographie, Rheinisch–Westfälische Technische Hochschule, D-52056 Aachen, Germany, and cMineralogisch-Petrologisches Institut, Universität Bonn, D-53113 Bonn, Germany
Correspondence e-mail:

3.2.3. Mathematical tools

| top | pdf |

Analysis of domain structures and twins does not deal primarily with single-crystal structures, as does classical crystallography, but studies collections of several crystal structures – which usually differ in orientation and position in space – and examines relations between these structures and their coexistence. The exact formulation of such an analysis uses mathematical concepts that are not yet quite common in crystallography. Thus, e.g., a collection of crystallographic objects has to be decomposed into equivalence classes called orbits and strata, or the symmetry of an object (structure, domain wall, twin) has to be described with respect to a given group, which necessitates replacing the usual notion of a symmetry group by a `stabilizer' (isotropy group). A prerequisite of introducing these terms is the concept of group action, which provides a basic and efficient tool for domain-structure analysis.

Another special feature of domain studies is that one can associate with a ferroic structure under study another structure, called the parent (prototypic) structure, from which the ferroic structure can be derived by small microscopic distortions. The fact that the symmetry of the ferroic phase is lower than that of the parent phase invokes the notion of a subgroup. Associated notions such as conjugate subgroups, normalizers and decomposition of a group into left and double cosets of a subgroup play an important role in the analysis.

Since some of these concepts are not available in standard texts, we present in this section the necessary mathematical background and explanation of terms and relations that appear in Chapters 3.3[link] and 3.4[link] .

Section[link] introduces the basic concepts of set theory and explains the notion of unordered and ordered pairs, mappings of sets and the partition of a set into equivalence classes. Section[link] deals with basic group theory and is devoted mainly to group–subgroup relations and relevant notions, of which the coset decompositions are of central importance. In Section[link], group theory is combined with set theory in the `action of a group on a set' (for short, `group action'). Notions of stabilizer, orbit and stratum are explained and their significance is illustrated by several examples.

A simple exposition of the main group-theoretical concepts, including group action and orbits, can be found in the book by Hahn & Wondratschek (1994[link]). A concise presentation of group actions and related notions with many examples has been given by Michel (1980[link]). Other more detailed references are given at the end of each of the following sections. Sets, pairs, mappings and equivalence classes

| top | pdf | Sets

| top | pdf |

Definition A set is a collection of distinguishable objects. The objects constituting a set are called elements (or points) of the set.

In Chapter 3.4[link] we encounter mainly two types of sets: sets the elements of which are crystalline objects (domain states, domain twins, domain walls etc.), and sets, like groups, with elements of mathematical nature, e.g. rotations, transformations, operations etc. The sets of crystalline objects will be denoted by capital sans-serif letters, e.g. [{\sf A},{\sf B},\ldots], and capital bold letters, e.g. [\bf{S}, \bf{M}, \bf{N},\ldots] or [{\bf S}_1, {\bf S}_2, {\bf S}_3,\ldots], will be used to denote elements of such sets. Groups will be denoted by capital italic letters, e.g. G, F etc., and their elements by lower-case italic letters, e.g. [g, h,\ldots]. The exposition of this section is given for sets the elements of which are (crystalline) objects, but all notions and relations hold for any other sets.

If an element [\bf{S}] belongs to the set [{\sf A}], one writes [{\bf S} \in {\sf A}], in the opposite case [{\bf S} \not\in {\sf A}]. Sets consisting of a small number of elements can be expressed explicitly by writing their elements between curly braces, [{\sf A}=\{{\bf S}, {\bf M}, {\bf N}, {\bf Q}\}]. The order of elements in the symbol of the set is irrelevant. From the definition of a set it follows that there are no equal elements in the set, or in other words, any two equal elements coalesce into one:[\{{\bf S},{\bf S}\}=\{{\bf S}\}.\eqno(]If a set contains many (or an infinite number of) elements, the elements are specified in another way, e.g. by stating that they have a certain property in common.

The number of elements in a set is the order of the set. A finite set [{\sf A}] consists of a finite number of elements and this number is denoted by [|{\sf A}|]. An infinite set contains infinite number of elements and an empty set, denoted by [\emptyset], contains no element. In what follows, the term `set' will mean a `finite nonempty set' unless explicitly stated otherwise.

A set [{\sf B}] is a subset of [{\sf A}], [{\sf B} \subseteq {\sf A}] or [{\sf A} \supseteq {\sf B} ], if every element of [{\sf B}] is an element of [{\sf A}]. If each element of [{\sf B}] is an element of [{\sf A}], and vice versa, then [{\sf B}] is equal to or identical with [{\sf A}], [{\sf B}={\sf A}] or [{\sf A}={\sf B}]. If there exists at least one element of [{\sf A}] which is not contained in [{\sf B}], then [{\sf B}] is a proper subset of [{\sf A}], [{\sf B} \subset {\sf A}] or [{\sf A} \supset {\sf B}]. The subset [{\sf B}] is often defined by a restriction that specifies only some elements of [{\sf A}] as elements of [{\sf B}]. This is written in short as [{\sf B} =] [\{{\bf S} \in {\sf A}|\hbox{restriction on } {\bf S}\}]; the expression means that [{\sf B}] consists of all elements of [{\sf A}] that satisfy the restriction given behind the sign |.

The intersection of two sets [{\sf A}] and [{\sf B}], [{\sf A} \cap {\sf B}] or [{\sf B} \cap {\sf A}], is a set comprising all elements that belong both to [{\sf A}] and to [{\sf B}]. If the sets [{\sf A}] and [{\sf B}] have no element in common, [{\sf A} \cap {\sf B} = \emptyset], then one says that the sets [{\sf A}] and [{\sf B}] are disjoint. The union of sets [{\sf A}] and [{\sf B}], [{\sf A} \cup {\sf B}] or [{\sf B} \cup {\sf A}], is a set consisting of all elements that belong either to [{\sf A}] or to [{\sf B}]. Sometimes the symbol [+] is used instead of the symbol [\cup]. The difference of set [{\sf A}] and [{\sf B}], or the complement of [{\sf B}] in [{\sf A}], [{\sf A}-{\sf B}], comprises those elements of [{\sf A}] that do not belong to [{\sf B}]. Pairs

| top | pdf |

A collection of two objects [{\bf S}_i] and [{\bf S}_k] constitutes an unordered pair. The objects of an unordered pair are called elements or points. A trivial unordered pair consists of two identical elements. A non-trivial unordered domain pair comprises two non-identical elements and is identical with a set of order two.

Note that we do not identify an unordered pair with a set of order two where, according to ([link]), two equal objects coalesce into one. In spite of this difference we shall use the same symbol for the unordered pair as for the set of order two, but reverse the symbol [\{{\bf S},{\bf S}\}] for the trivial unordered pair. With this reservation, the identity[\{{\bf S}_i,{\bf S}_k\} = \{{\bf S}_k,{\bf S}_i\} \eqno(]holds for both unordered pairs and for sets of order two.

An ordered pair, denoted [({\bf S}_i,{\bf S}_k)], consists of the first and the second member of the pair. If [{\bf S}_i={\bf S}_k], the ordered pair is called a trivial ordered pair, [({\bf S}_i,{\bf S}_i)]; if [{\bf S}_i \neq {\bf S}_k] the pair [({\bf S}_i,{\bf S}_k)] is a non-trivial ordered pair. The ordered pair [({\bf S}_k,{\bf S}_i)] with a reversed order of elements is called a transposed pair. In contrast to unordered pairs, initial and transposed non-trivial ordered pairs are different objects, [({\bf S}_i,{\bf S}_k) \neq ({\bf S}_k,{\bf S}_i) \,\,\hbox{ for } \,\,{\bf S}_i\neq {\bf S}_k. \eqno(]

The members [{\bf S}_i] and [{\bf S}_k] of an ordered pair [({\bf S}_i,{\bf S}_k)] can either belong to one set, [{\bf S}_i \in {\sf A}, {\bf S}_k \in {\sf A}], or each to a different set, [{\bf S}_i \in {\sf A}, {\bf S}_k \in {\sf B}].

Two ordered pairs [({\bf S}_i,{\bf S}_k)] and [({\bf S}_m,{\bf S}_p)] are equal, [({\bf S}_i,{\bf S}_k)=({\bf S}_m,{\bf S}_p)], if and only if [{\bf S}_i={\bf S}_m] and [{\bf S}_k={\bf S}_p].

We shall encounter ordered and unordered pairs in Sections 3.4.3[link] and 3.4.4[link] , where the members of pairs are domain states or domain twins. However, pairs are also essential in introducing further concepts of set theory. The starting point is the following construction of a set of pairs that are formed from two sets:

A Cartesian product [{\sf A} \times {\sf B}] of two sets [{\sf A}] and [{\sf B}] is a set of all ordered pairs [({\bf S},{\bf M})], where [{\bf S} \in {\sf A}, {\bf M} \in {\sf B}]. The sets [{\sf A}] and [{\sf B}] can be different or identical sets. If the sets [{\sf A}] and [{\sf B}] are finite, then the Cartesian product [{\sf A} \times {\sf B}] consists of [|{\sf A}|\cdot|{\sf B}|] ordered pairs. Mappings

| top | pdf |

A mapping [\varphi] of a set [{\sf A}] into a set [{\sf B}] is a rule which assigns to each element [{\bf S} \in {\sf A}] a unique element [{\bf M} \in {\sf B}]. This is written symbolically as [\varphi:{\bf S} \,\mapsto\,{ \bf M}] or [{\bf M}= \varphi({\bf S})], and one says that [\bf{S}] is mapped to [\bf{M}] under the mapping [\varphi]. The element [\bf{M}] is called the image of the element S under [\varphi]. The assignment [\varphi:{\bf S} \,\mapsto\, {\bf M}] can be expressed by an ordered pair [({\bf S},{\bf M})], if one ascribes [\bf{S}] to the first member of the pair and the element [\bf{M}] to the second member of the pair [({\bf S},{\bf M})]. Then the mapping [\varphi] of a set [{\sf A}] into a set [{\sf B}], symbolically written as [\varphi:{\sf A} \rightarrow {\sf B}], can be identified with such a subset of ordered pairs of the Cartesian product [{\sf A} \times {\sf B}] in which each element [\bf{S}] of [{\sf A}] occurs exactly once as the first member of the pair [({\bf S},{\bf M})]. If [{\sf A}] is a finite set, then [\varphi] consists of [|{\sf A}|] ordered pairs.

We note that in a mapping [\varphi:{\sf A} \rightarrow {\sf B}] several elements of [{\sf A}] may be mapped to the same element of [{\sf B}]. In such a case, the mapping [\varphi] is called a many-to-one mapping. If the mapping [\varphi:{\sf A} \rightarrow {\sf B}] is such that each element of [{\sf B}] is the image of some element of [{\sf A}], then the mapping [\varphi] is called a mapping of [{\sf A}] onto [{\sf B}]. If [\varphi] is a mapping of [{\sf A}] onto [{\sf B}] and, moreover, each element of [{\sf B}] is the image of exactly one element of [{\sf A}], then the mapping [\varphi] becomes a one-to-one correspondence between [{\sf A}] and [{\sf B}], [\varphi:{\sf A} \leftrightarrow {\sf B}]. In this case, [{\sf A}] and [{\sf B}] are of the same order.

One often encounters a situation in which one assigns to each ordered pair [({\bf S},{\bf M})] an element [\bf{N}], where all three elements [{\bf S}, {\bf M}, {\bf N}] are elements from the same set [{\sf A}], symbolically [\varphi:({\bf S},{\bf M}) \,\mapsto\, {\bf N}]; [{\bf S}, {\bf M}, {\bf N} \in {\sf A}] or [\varphi:{\sf A} \times {\sf A} \rightarrow {\sf A}]. Such a mapping is called a binary operation or a composition law on the set [{\sf A}]. A sum of two numbers [a+b=c] or a product of two numbers [a\cdot b=c], where [a,b,c] belong to the set of all real numbers, are elementary examples of binary operations. Equivalence relation on a set, partition of a set

| top | pdf |

The notion of the ordered pair allows one to introduce another useful concept, namely the relation on a set. An example will illustrate this notion. Let [{\bb Z}] be a set of integers, [{\bb Z}=\{\ldots,-2,-1,0,1,2,\ldots\}]. For each ordered pair [(m,n)], [m,n\in {\bb Z}], one can decide whether m is smaller than n, [m \,\lt\, n], or not. All pairs [(m,n)] that fulfil the condition [m \,\lt\, n] form a subset [{\sf R}] of all possible ordered pairs [{\bb Z} \times {\bb Z}]. In other words, the relation [m \,\lt\, n] defines a subset [{\sf R}] of the set [{\bb Z} \times {\bb Z}], [{\sf R} \subset {\bb Z} \times {\bb Z}]. Similarly, the relation [|m|=|n|] ([|n|] denotes absolute value of n) defines another subset of [{\bb Z} \times {\bb Z}].

To indicate that an element [{\bf S}] is related to [\bf M] by [\lower2pt\hbox{${{\buildrel {\sf R}\over{\sim}}}$}], where [{\bf S},{\bf M} \in {\sf A}], one writes [{\bf S}\,\lower2pt\hbox{${\buildrel{\sf R}\over {\sim}}$}\, {\bf M}], where the relation [{\sf R}] defines a subset [{\sf R}] of all ordered pairs [{\sf A} \times {\sf A}], [{\sf R} \subset {\sf A} \times {\sf A}] (the same letter [{\sf R}] is used for the subset and for the relation on [{\sf A}]). The opposite also holds: Each subset [{\sf R}] of [{\sf A} \times {\sf A}] defines a certain relation [\lower2pt\hbox{${\buildrel{\sf R}\over {\sim}}$}] on [{\sf A}].

A relation [\lower2pt\hbox{${\buildrel{\sf R}\over {\sim}}$}] is called an equivalence relation on the set [{\sf A}] if it satisfies three conditions: [\displaylines{\hfill{\bf S}\,\,{\buildrel{\sf R}\over{\sim}}\,\,{\bf S} \,\, \hbox{for all} \,\,{ \bf S} \in {\sf A} \,\,(reflexivity), \hfill(\cr \hfill{\rm if} \,\, {\bf S}, {\bf M} \in {\sf A} \,\, {\rm and} \,\,{\bf S}\,\,{\buildrel{\sf R}\over{\sim}}\,\,{\bf M}, \,\, {\rm then} \,\, {\bf M}\,\,{\buildrel{\sf R}\over{\sim}}\,\,{\bf S} \,\, (symmetry), \hfill(\cr \hfill{\rm if} \,\,{\bf S}, {\bf M}, {\bf N} \in {\sf A}, \,\, {\bf S}\,\,{\buildrel{\sf R}\over{\sim}}\,\,{\bf M} \,\, {\rm and} \,\, {\bf M}\,\,{\buildrel{\sf R}\over{\sim}}\,\,{\bf N}, {\rm then} \,\, {\bf S}\,\,{\buildrel{\sf R}\over{\sim}}\,\,{\bf N}\,\, (transitivity).\hfill\cr\hfill(}%fd3.2.3.5]Thus, for example, it is easy to corroborate that the relation [|m|=|n|] on the set of integers [{\bb Z}] fulfils all three conditions ([link] to ([link] and is, therefore, an equivalence relation on the set [{\bb Z}]. On the other hand, the relation [m \,\lt\, n] is not an equivalence relation on [{\bb Z}] since it fulfils neither the reflexivity ([link] nor the symmetry condition ([link].

Let [\lower2pt\hbox{${\buildrel{\sf R}\over {\sim}}$}] be an equivalence relation on [{\sf A}] and [{\bf S} \in {\sf A}]; all elements [{\bf M} \in {\sf A}] such that [{\bf M}\,\lower2pt\hbox{${\buildrel{\sf R}\over{\sim}}$}\,{\bf S}] constitute a subset of [{\sf A}] denoted [[{\bf S}]_{\sf R}] and called the equivalence class of [{\bf S}] with respect to [\lower2pt\hbox{${\buildrel{\sf R}\over {\sim}}$}] (or the [{\sf R}]-equivalence class of S). The element [{\bf S}] is called the representative of the class [[{\bf S}]_{\sf R}]. Any other member of the class can be chosen as its representative. Any two elements of the equivalence class [[{\bf S}]_{\sf R}] are [{\sf R}]-equivalent elements of [{\sf A}].

From the definition of the equivalence class, it follows that any two elements [{\bf M}, {\bf N} \in {\sf A}] are either [{\sf R}]-equivalent elements of [{\sf A}], [{\bf M}\,\lower2pt\hbox{${\buildrel{\sf R}\over{\sim}}$}\,{\bf N}], and thus belong to the same class, [[{\bf M}]_{\sf R}=[{\bf N}]_{\sf R}], or are not [{\sf R}]-equivalent, and thus belong to two different classes that are disjoint, [[{\bf M}]_{\sf R} \cap [{\bf N}]_{\sf R}=\emptyset]. In this way, the equivalence relation [\lower2pt\hbox{${\buildrel{\sf R}\over {\sim}}$}] divides the set [{\sf A}] into disjoint subsets (equivalence classes), the union of which is equal to the set itself. Such a decomposition is called a partition of the set [{\sf A}] associated with the equivalence relation [\lower2pt\hbox{${\buildrel{\sf R}\over {\sim}}$}]. For a finite set [{\sf A}] this decomposition can be expressed as a union of equivalence classes, [{\sf A}=[{\bf S}]_{\sf R} \cup [{\bf M}]_{\sf R} \cup\ldots \cup [{\bf Q}]_{\sf R}, \eqno(]where [{\bf S}, {\bf M},\ldots , {\bf Q}] are representatives of the equivalence classes.

Generally, any decomposition of a set into a system of disjoint non-empty subsets such that every element of the set is a member of just one subset is called a partition of the set. To any partition of a set [{\sf A}] there corresponds an equivalence relation [\lower2pt\hbox{${\buildrel{\sf R}\over {\sim}}$}] such that the [{\sf R}]-equivalence classes of [{\sf A}] form that partition. This equivalence relation defines two elements as equivalent if and only if they belong to the same subset.

The term `equivalent' is often used when it is clear from the context what the relevant equivalence relation is. Similarly, the term `class' is used instead of `equivalence class'. Sometimes equivalence classes have names that do not explicitly indicate that they are equivalence classes. For example, in group theory, conjugate subgroups, left, right and double cosets form equivalence classes (see Section[link]). Often instead of the expression `partition of a set [{\sf A}]' an equivalent expression `classification of the elements of a set [{\sf A}]' is used. The most important equivalence classes in the symmetry analysis of domain structures are called orbits and will be discussed in Section[link]

More details on set theory can be found in Kuratowski & Mostowski (1968[link]), Lipschutz (1981[link]), and Opechowski (1986[link]). Groups and subgroups

| top | pdf | Groups

| top | pdf |

Operations (isometries) that act on a body without changing its form and internal state combine in the same way as do elements of a group. Group theory is, therefore, the main mathematical tool for examining transformation properties – symmetry properties in particular – of crystalline objects. The basic concept of group theory is that of a group.

Definition A group G is a set that satisfies four postulates:

  • (1) To each ordered pair [(g_i,g_j)] of two elements of G, there corresponds a unique element [g_k] of G, i.e. a binary operation (composition law) is defined on the set G. Usually, one writes the ordered pair simply as a `product' [g_ig_j] and the composition law as an equation, [ g_ig_j=g_k, \quad g_i, g_j, g_k \in G.\eqno(] This condition is referred to as closure of G under multiplication.

  • (2) The multiplication is associative, i.e. for any three elements [g_i, g_j, g_k] of G it holds that if [g_ig_j=g_l] and [g_jg_k=g_m] then [g_lg_k = g_ig_m]. This condition is usually written as one equation, [(g_ig_j)g_k=g_i(g_jg_k),\eqno(]which expresses the requirement that the product of any three elements of G is the same, no matter which two of the three one multiplies first, as long as the order in which they stand is not changed. From postulate (2) it follows that the product of any finite sequence of group elements is determined uniquely if the order in which the elements are placed is preserved.

  • (3) The set G contains an identity or unit element e such that [ eg=ge=g \hbox{ for any element } g \in G.\eqno(]

  • (4) For any element [g \in G] there exists an inverse element [g^{-1}] such that [ gg^{-1}=g^{-1}g=e.\eqno(]

The number of elements of a group G is called the order of the group. If the order of the group is finite, it is denoted by [|G|].

The multiplication of group elements is, in general, not commutative, i.e. [g_{i}g_{j} \neq g_{j}g_{i}] may hold for some [g_{i}, g_{j} \in G]. If the multiplication is commutative, i.e. if [g_{i}g_{j} = g_{j}g_{i}] for all [g_{i}, g_{j} \in G], then the group G is called a commutative or Abelian group. All groups of orders 1 to 5 are Abelian. In Abelian groups, an additive notation is sometimes used instead of the multiplicative notation, i.e. if [g_{i}] and [g_{k}] are elements of an Abelian group G then one writes [g_{i}+g_{k}] instead of [g_{i}g_{k}]. Additive notation is usually used in groups of translations.

The nth power [g^n] of an element [g\in G], where n is a positive integer, is defined recursively in the following manner:

  • (i) [g^0=e, \ g^1=g], where e is a unit element of G;

  • (ii) [g^{n+1}=g^ng];

  • (iii) [g^{-n}=(g^n)^{-1}].

If G is written additively, one writes [ng] instead of [g^n] and speaks of a multiple of g.

If m and n are integers and g is an element of G then the following laws of exponents hold: [\eqalignno{g^mg^n&=g^{m+n}=g^ng^m, &(\cr (g^m)^n&=g^{mn}=(g^n)^m. &(}%fd3.2.3.12]

A set of elements [\{g_1, g_2,\ldots\}] of a group G is called a set of generators of G if any element of the group G can be written as a product of powers of these generators. In general, a group may have several sets of generators.

The order of an element g is the smallest positive integer m such that [g^{m}=e]. An element g and the inverse element [g^{-1}] have the same order. The order m of any element g of a finite group G is a factor of the order [|G|].

Two groups G and [G'] with elements [g_{1},g_{2},\ldots, g_{i},\ldots] and [g'_{1},g'_{2},\ldots,g'_{i},\ldots], respectively, are isomorphic if there is an one-to-one correspondence [\varphi] between G and [G'], [\varphi: g_{i}\leftrightarrow g'_{i} \hbox{ for each } \ g_{i} \in G, \eqno(]such that[\hbox{whenever } \varphi:g_{i}\leftrightarrow g'_{i} \hbox{ and } \varphi:g_{j} \leftrightarrow g'_{j}, \hbox{ then } \varphi:g_{i}g_{j} \leftrightarrow g'_{i}g'_{j}.\eqno(]In other words, the isomorphism of two groups G and [G'] is a one-to-one mapping of G onto [G'] [([link]] which preserves the products of the elements of the two groups [([link]]. Two isomorphic groups G and [G'] are denoted as [G \cong G'].

Isomorphism is an equivalence relation that divides the set of all groups into classes of isomorphic groups. Between two groups G and [G'] there may exist several isomorphisms.

Groups that appear in Chapters 3.3[link] and 3.4[link] are mostly crystallographic groups [for their definition and properties see Bradley & Cracknell (1972[link]), Hahn & Wondratschek (1994[link]), IT A (2005[link]), IT A1 (2004[link]), Janssen (1973[link]), Opechowski (1986[link]), and Vainshtein (1994[link])]. Elements of these groups are distance-preserving transformations (mappings) called isometries, Euclidean transformations, motions or crystallographic operations. Whenever we encounter crystallographic groups we shall use the term `crystallographic operation' or just `operation' or `isometry' instead of `element'.

In what follows, the group G may be a crystallographic point group or a crystallographic space group. Since we shall be mainly concerned with a continuum approach, we shall have in mind point groups. When we consider space groups, we shall mention this explicitly and, if possible, use calligraphic letters, e.g. [{\cal G}], [{\cal F}] etc. for space groups.

Crystallographic operations of crystallographic point groups and products of these operations can be found by means of the multiplication calculator in the software GI[\star]KoBo-1 under the menu item Group Elements (see the manual for GI[\star]KoBo-1). Subgroups

| top | pdf |

Definition Let G be a group. A subset F of G is a subgroup of G if it forms a group under the product rule of G, i.e. if it fulfils the group postulates (1)[link] to (4)[link].

For finite groups these requirements can be replaced by a single condition [see e.g. Opechowski (1986[link])]: The product of any two elements [f_{i}, f_{j}] of F belongs to F, [f_{i}f_{j}=f_{k}, \quad f_{k} \in F \hbox{ for any } f_{i}, f_{j} \in F. \eqno(]

The groups G and F are denoted the high-symmetry group and the low-symmetry group, respectively. The pair `group G – subgroup F' is called the symmetry descent [G \supset F], dissymmetrization [G\supset F] or symmetry reduction [G\supset F]. A symmetry descent is a basic specification of a phase transition and corresponding domain structure (see Chapters 3.1[link] and 3.4[link] ).

Each group G always has at least two subgroups: the group G itself (sometimes called the improper subgroup) and the trivial subgroup consisting of the unit element only. The symbol [F \subseteq G] signifies that F is a subgroup of G including the improper subgroup G, whereas [F \subset G] means that F is a proper subgroup of G which differs from G. By this definition, the trivial subgroup is a proper subgroup. This definition of a proper subgroup [used e.g. in Volume A of the present series (IT A, 2005[link]) and by Opechowski (1986[link])] is convenient for our purposes, although often by the term `proper subgroup' one understands a subgroup different from G and from the trivial subgroup.

A proper subgroup F of G is a maximal subgroup of G if it is not a proper subgroup of some other proper subgroup H, i.e. if there exists no group H such that [F \subset H \subset G.] A group can have more than one maximal subgroup.

A group P for which G is subgroup is called a supergroup of G, [G\subseteq P]. If G is a proper subgroup of Q, [G\subset Q], then Q is a proper supergroup of G. If G is a maximal subgroup of P, then P is called a minimal supergroup of G.

Let a group L be a proper supergroup of a group F, [F\subset L], and simultaneously a proper subgroup of a group G, [L\subset G]. Then the sequence of subgroups [F\subset L\subset G\eqno(]will be called a group–subgroup chain and the group L an intermediate group of the chain ([link].

Subgroups of crystallographic point groups are listed in Table[link] and are displayed in Figs.[link] and[link] (see also the software GI[\star]KoBo-1, menu item Subgroups). Left and right cosets

| top | pdf |

If [F_{1}] is a proper subgroup of G and [g_i] is a fixed element of G, then the set of all products [g_{i}f], where f runs over all elements of the subgroup [F_1], is denoted [g_iF_1] and is called the left coset of [F_{1}] in G, [g_iF_1=\{g_if|\, \forall f\in F_1\}, \quad g_i\in G, \quad F_1\subset G, \eqno(]where the sign [\forall] means `for all'. Similarly, one defines a right coset of [F_{1}] in G: [F_1g_i=\{fg_i|\, \forall f\in F_1\}, \quad g_i\in G, \quad F_1\subset G. \eqno(][Some authors, e.g. Hall (1959[link]), call the set [g_{i}F_1] a right coset of [F_{1}] in G and the set [F_{1}g_i] a left coset of [F_{1}] in G.] Since in the application of cosets in the symmetry analysis of domain structures left cosets are used almost exclusively, all statements that follow are formulated for left cosets. Each statement about left cosets has a complementary statement about right cosets which can in most cases be obtained by replacing `left' with `right'.

The element [g_i ] which appears explicitly in the symbol [g_iF_{1}] of the left coset of [F_{1}] is called a representative of the left coset [g_iF_{1}]. Any element of a left coset can be chosen as its representative.

Left coset criterion: Two elements [g_i] and [g_j] belong to the same left coset, [g_iF_1=g_jF_1], if and only if [g_i^{-1}g_j] belongs to the subgroup [F_{1}], [g_i^{-1}g_j \in F_1].

The property of `belong to the same left coset' is an equivalence relation, therefore two left cosets of the same subgroup are either identical or have no elements in common.

Proposition The union of all distinct left cosets of [F_{1}] in G constitutes a partition of G and is called the decomposition of G into the left cosets of [F_{1}]. If the set of left cosets of [F_{1}] in G is finite, then the decomposition of G into the left cosets of [F_{1}] can be expressed as[G=g_1F_{1} \cup g_2F_{1} \cup\ldots \cup g_nF_{1}= \bigcup_{i=1}^ng_iF_{1}, \eqno(]where the symbol [\cup] is the set-theoretical union (see Section[link]). For the representative [g_1] of the first left coset the unit element e is usually chosen, [g_1=e]. Then the first left coset is identical with the subgroup [F_{1}]. The number of elements in each left coset of the decomposition is equal to the order of the group [F_1].

The set of left-coset representatives [\{g_1, g_2,\ldots g_n\}] is sometimes called a left transversal to [F_1] in G.

The number n of distinct left cosets is called the index of the subgroup [F_{1}] in the group G and is denoted by the symbol [[G:F_{1}]]. If the groups G and [F_{1}] are of finite order then [n=[G:F_{1}]=|G|:|F_{1}|, \eqno(]where [|G|] and [|F_{1}|] are the orders of G and [F_{1}], respectively. From this equation follows:

Lagrange's theorem : the order of a finite group is a multiple of the order of each of its subgroups. Alternatively, the index of a subgroup and the order of a finite subgroup are divisors of the group order.

We note that an infinite subgroup of an infinite group can have a finite index. Important examples are subgroups of translational groups of crystallographic space groups and subgroups of space groups (see Example [oC][link] in Section[link]).

The decompositions of crystallographic point groups into left and right cosets are available in the software GI[\star]KoBo-1, under Subgroups\View\Twinning Group.

Proposition Let [L_{1}] be an intermediate group [F_{1}\subset L_{1}\subset G]. The group G can be decomposed into left cosets of [L_{1}], [G=h_1L_{1} \cup h_2L_{1} \cup\ldots \cup h_mL_{1}= \bigcup_{j=1}^mh_jL_{1}, \eqno(] where [m=[G:L_{1}]=|G|:|L_{1}|, \eqno(] and the group [L_{1}] into left cosets of [F_{1}], [L_{1}=p_1F_{1} \cup p_2F_{1} \cup\ldots \cup p_dF_{1}= \bigcup_{k=1}^dp_kF_{1}, \eqno(]where [d=[L_1:F_{1}]=|L_1|:|F_{1}|. \eqno(]Then the decomposition of G into left cosets of [F_{1}] can be written in the form [G=\bigcup_{j=1}^m\bigcup_{k=1}^dh_jp_kF_{1} \eqno(]and the index n of [F_{1}] in G can be expressed as a product of indices m and d, [n=[G:F_1]=[G:L_{1}][L_{1}:F_{1}]=md. \eqno(]

Decompositions ([link]) and ([link]) of a group into left cosets enable one to divide a set of objects into classes of symmetrically equivalent objects (see Section[link]). The concept of domain states is based on this result (see Section 3.4.2[link] ). Conjugate subgroups

| top | pdf |

Two subgroups [F_i] and [F_k] are conjugate subgroups if there exists an element g of G such that [ gF_ig^{-1}=F_k, \quad g \in G.\eqno(] More explicitly, one says that the subgroup [F_k] is conjugate by g (or conjugate under G) to the subgroup [F_i]. Conjugate subgroups are isomorphic.

The property of `being conjugate' is an equivalence relation. The set of all subgroups of a group G can therefore be partitioned into disjoint classes of conjugate subgroups. Conjugate subgroups of crystallographic point groups are given in Table[link] and in the software GI[\star]KoBo-1, under Subgroups\View\Twinning Group. Normalizers

| top | pdf |

The collection of all elements g that fulfil the relation [gF_{i}g^{-1}=F_{i}, \ \ g \in G, \eqno(]constitutes a group denoted by [N_{G}(F_{i})] and is called the normalizer of [F_{i}] in G. The normalizer [N_{G}(F_{i})] is a subgroup of G and a supergroup of [F_i], [F_i\subseteq N_{G}(F_{i})\subseteq G. \eqno(]

The normalizer [N_{G}(F_{i})] determines the subgroups conjugate to [F_i] under G (see Example[link]). The number m of subgroups conjugate to a subgroup [F_{i}] under G equals the index of [N_{G}(F_{i})] in G: [ m=[G:N_{G}(F_i)]=|G|:|N_{G}(F_i)|, \eqno(] where the last equation holds for finite G and [F_i].

Normalizers of the subgroups of crystallographic point groups are available in Table[link] and in the software GI[\star]KoBo-1 under Subgroups\View\Twinning Group. Normal subgroups

| top | pdf |

Among subgroups of a group, a special role is played by normal subgroups. A subgroup H of G is a normal (invariant, self-conjugate) subgroup of G if and only if it fulfils any of the following conditions:

  • (1) The subgroup H of G has no conjugate subgroups under G. (No subscript is therefore needed in the symbol of a normal subgroup H.)

  • (2) The normalizer [N_{G}(H)] of H equals the group G, [ N_{G}(H)=G . \eqno(]

  • (3) Every element g of G commutes with H, or, equivalently, each left coset [gH] equals the right coset [Hg]: [ gH=Hg \hbox{ for every } \ g \in G . \eqno(]

For a normal subgroup H of a group G a special symbol [\triangleleft] is often used instead of [\subset], [H\triangleleft G]. Halving subgroups and dichromatic (black-and-white) groups

| top | pdf |

Any subgroup H of a group G of index 2, called a halving subgroup, is a normal subgroup. The decomposition of G into left cosets of H consists of two left cosets, [G=H\cup gH . \eqno(]Sometimes it is convenient to distinguish elements of the coset [gH] from elements of the halving subgroup H. This can be achieved by attaching a sign (usually written as a superscript) to all elements of the coset. We shall use for this purpose the sign [^\spadesuit]. To aid understanding, we shall also mark for a while the elements of the group H with another sign, [^\heartsuit]. The multiplication law for these `decorated elements' can be written in the following form:[g_1^\heartsuit g_2^\heartsuit=g_3^\heartsuit,\quad g_4^\heartsuit g_5^\spadesuit=g_6^\spadesuit,\quad g_7^\spadesuit g_8^\heartsuit=g_9^\spadesuit,\quad g_{10}^\spadesuit g_{11}^\spadesuit=g_{12}^\heartsuit. \eqno(]Now we replace the label [^\heartsuit] by a dummy `no mark' sign (i.e. we remove [^\heartsuit]), but we still keep in mind the multiplication rules ([link]). Then the decomposition ([link]) becomes[G=H\cup g^\spadesuit H,\eqno(]since the coset [g^\spadesuit H] assembles all marked elements and H consists of all bare elements of the group G.

The sign [^\spadesuit] can carry useful additional information, e.g. the application of labelled operations [g^\spadesuit] is connected with some changes or new effects, whereas the application of a bare operation brings about no such changes or effects.

The label [^\spadesuit] can be replaced by various signs which can have different meanings. Thus in Chapter 3.3[link] a prime ['] signifies a nontrivial twinning operation, in Chapter 1.5[link] it is associated with time inversion in magnetic structures, and in black-and-white patterns or structures a prime denotes an operation which exchanges black and white `colours' (the qualifier `black-and-white' concerns group operations, but not the black-and-white pattern itself). In Chapter 3.4[link] , a star [^\star] denotes a transposing operation which exchanges two domain states, while underlining signifies an operation exchanging two sides of an interface and underlined operations with a star signify twinning operations of a domain twin. Various interpretations of the label attached to the symbol of an operation have given rise to several designations of groups with partition ([link]): black-and-white, dichromatic, magnetic, anti-symmetry, Shubnikov or Heech–Shubnikov and other groups. For more details see Opechowski (1986[link]). Double cosets

| top | pdf |

Let [F_{1}] and [H_{1}] be two proper subgroups of the group G. The set of all distinct products [hg_{j}f], where [g_{j}] is a fixed element of the group G and f and h run over all elements of the subgroups [F_{1}] and [H_{1}], respectively, is called a double coset of [F_{1}] and [H_{1}] in G. The symbol of this double coset is [H_{1}g_{j}F_{1}], [\displaylines{F_1g_jH_1=\{fg_jh|\, \forall f\in F_1, \forall h\in H_1\}, \cr\hfill \hfill g_j\in G, \, F_1\subset G, \, H_1\subset G, \hfill(}] where the sign [\forall] means `for all'.

In the symmetry analysis of domain structures, only double cosets with [H_{1}=F_{1}] are used. We shall, therefore, formulate subsequent definitions and statements only for this special type of double coset.

The fixed element [g_{j}] is called the representative of the double coset [F_{1}g_{j}F_{1}]. Any element of a double coset can be chosen as its representative.

Two double cosets are either identical or disjoint.

Proposition The union of all distinct double cosets constitutes a partition of G and is called the decomposition of the group G into double cosets of [F_{1}], since [F_1F_1=F_1]. If the set of double cosets of [F_{1}] in G is finite, then the decomposition of G into the double cosets of [F_{1}] can be written as[G=F_{1}g_1F_{1} \cup F_{1}g_2F_{1} \cup\ldots\cup F_{1}g_qF_{1}. \eqno(]For the representative [g_1] of the first double coset [F_{1}g_{j}F_{1}] the unit element e is usually chosen, [g_1=e]. Then the first double coset is identical with the subgroup [F_{1}].

A double coset [F_{1}g_jF_{1}] consists of left cosets of the form [fg_{j}F_{1}], where [f \in F_{1}]. The number r of left cosets of [F_{1}] in the double coset [F_{1}g_{j}F_{1}] is (Hall, 1959[link]) [ r=[F_{1}:F_{1j}], \eqno(] where [F_{1j}=F_{1} \cap g_{j}F_{1}g_{j}^{-1}. \eqno(]

The following definitions and statements are used in Chapter 3.4[link] for the double cosets [F_{1}g_jF_{1}] [for derivations and more details, see Janovec (1972[link])].

The inverse [(F_{1}g_jF_{1})^{-1}] of a double coset [F_{1}g_jF_{1}] is a double coset [F_{1}g_j^{-1}F_{1}], which is either identical or disjoint with the double coset [F_{1}g_jF_{1}]. The double coset that is its own inverse is called an invertible (self-inverse, ambivalent) double coset. The double coset that is disjoint with its inverse is called a non-invertible (polar) double coset and the double cosets [F_{1}g_jF_{1}] and [(F_{1}g_jF_{1})^{-1}= F_{1}g_j^{-1}F_{1}] are called complementary polar double cosets.

The inverse left coset [(g_jF_{1})^{-1}] contains representatives of all left cosets of the double coset [F_{1}g_j^{-1}F_{1}]. If a left coset [g_jF_{1}] belongs to an invertible double coset, then [(g_{j}F_{1})^{-1}] contains representatives of left cosets constituting the double coset [F_{1}g_{j}F_{1}]. If a left coset [g_jF_{1}] belongs to a non-invertible double coset, then [(g_{j}F_{1})^{-1}] contains representatives of left cosets constituting the complementary double coset [(F_{1}g_{j}F_{1})^{-1}].

A double coset consisting of only one left coset, [F_{1}g_{j}F_{1}=g_{j}F_{1}, \eqno(] is called a simple double coset. A double coset [F_{1}g_{j}F_{1}] is simple if and only if the inverse [(g_{j}F_{1}) ^{-1}] of the left coset [g_{j}F_{1}] is again a left coset. For an invertible simple double coset [g_{j}F_{1}=(g_{j}F_{1})^{-1}].

The union of all simple double cosets [F_{1}g_{j}F_{1}=g_{j}F_{1}] in the double coset decomposition of G ([link] constitutes the normalizer [N_{G}(F_{1})] (Speiser, 1927[link]).

A double coset that comprises more than one left coset will be called a multiple double coset. Four types of double cosets [FgF] are displayed in Table[link]. The double coset decompositions of all crystallographic point groups are available in the software GI[\star]KoBo-1 under Subgroups\View\Twinning Group.

Table| top | pdf |
Four types of double cosets

 [FgF=gF][FgF\neq gF ]
[FgF=(FgF)^{-1}] Invertible simple Invertible multiple
[FgF \cap (FgF)^{-1}=\emptyset] Non-invertible simple Non-invertible multiple

Double cosets and the decomposition ([link]) of a group in double cosets are mathematical tools for partitioning a set of pairs of objects into equivalent classes (see Section[link]). Such a division enables one to find possible twin laws and different types of domain walls that can appear in a domain structure resulting from a phase transition with a given symmetry descent (see Chapters 3.3[link] and 3.4[link] ).

More detailed introductions to group theory can be found in Budden (1972[link]), Janssen (1973[link]), Ledermann (1973[link]), Rosen (1995[link]), Shubnikov & Koptsik (1974[link]), Vainshtein (1994[link]) and Vainshtein et al. (1995[link]). More advanced books on group theory are, for example, Bradley & Cracknell (1972[link]), Hall (1959[link]), Lang (1965[link]), Opechowski (1986[link]), Robinson (1982[link]) and Speiser (1927[link]). Parts of group theory relevant to phase transitions and tensor properties are treated in the manual of the software GI[\star]KoBo-1. Representations of the crystallographic groups are presented in Chapter 1.2[link] of this volume and in the software GI[\star]KoBo-1 (see the manual). Action of a group on a set

| top | pdf | Group action

| top | pdf |

A direct application of the set and group theory to our studies would hardly justify their presentation in the last two sections. However, an appropriate combination of these theories, called group action, forms a very useful tool for examining crystalline materials and domain structures in particular. In this section, the main concepts (action of a group on a set [a], orbits [o], stabilizers [s]) are explained and their application is illustrated with examples from crystallography, where the group G is either a crystallographic point group or space group (denoted [\cal G], if necessary), and the set is the three-dimensional point space [E(3)] [P], a crystal [C], a property tensor [T] and a subgroup of G [S]. Letters in square brackets in front of the sequential number of examples and definitions should aid navigation in the text.

Example [aP] . Crystals are objects in a three-dimensional space called point space. Points of this space form an infinite set which we denote [E(3)]. If one chooses a point O as the origin, then to each point [X \in E(3)] one can assign the position vector [OX={\bf r}] of a vector space [V(3)] [see, for example, IT A (2005)[link], Part 8[link] ]. There is a one-to-one correspondence between points of the point space and corresponding position vectors of the vector space, [X \leftrightarrow OX={\bf r}. \eqno(]If one further selects three non-coplanar basic vectors [\bf{e}_1, {\bf e}_2, \bf{e}_3], then the position vector r can be written as [{\bf r}=x_1{\bf e}_1 + x_2{\bf e}_2 + x_3{\bf e}_3, \eqno(]where [x_1, x_2, x_3] are coordinates of the point X.

Let G be a point group. An operation (isometry) [g\in G] transforms (moves) the point X to a point [X'] with the position vector [{\bf r'}=x'_1{\bf e}_1 + x'_2{\bf e}_2 + x'_3{\bf e}_3.\eqno(]Coordinates of this image point are related to coordinates of the initial point by a linear relation, [x'_i=\textstyle\sum\limits_{j=1}^{3}D(g)_{ij}x_j, \quad i=1,2,3,\eqno(]where [D(g)_{ij}] are components of a [3\times 3] matrix representing the operation g.

The described motion of the point X under the operation g can be formally expressed as a simple relation [gX=X', \quad g\in G, \quad X, X' \in E(3),\eqno(]the exact meaning of which can be formulated in terms introduced in Section[link] as a mapping [\varphi] that assigns to an ordered pair [(g,X)] a point [X'] of the set [E(3)], [\varphi: (g,X)\,\mapsto\, X', \quad g\in G \hbox{ and } X, X' \in {\sf A}. \eqno(]The mapping [\varphi]i.e. a prescription for how to determine from g and X the resulting point [X'] – is defined by ([link] to ([link]. The relation ([link] should be considered as only a shorthand version of the explicit relation ([link].

The action of a group on a set generalizes the described procedure to any group and any set. In this section, we shall use the term `object' for an element of a set and the term `operation' for an element of a group.

Definition [a] . Let G be a group, [{\sf A}] a set of objects [{\bf S}_i, {\bf S}_j, {\bf S}_k,\ldots ] and [\varphi:G\times{{\sf A}} \rightarrow {\sf A}] a mapping that assigns to an ordered pair [(g,{\bf S}_i)], where [g\in G, S_i] and [S_i] are objects of the set [{\sf A}]: [\varphi: (g,{\bf S}_i)\,\mapsto\, {\bf S}_k, \quad g\in G, \quad {\bf S}_i,{\bf S}_k \in {\sf A}. \eqno(]The ordered pair [(g, {\bf S}_i)] can often be written simply as a product [g{\bf S}_i] and the mapping as an equation. Then the relation ([link] can be expressed in a simpler form: [g{\bf S}_i={\bf S}_k, \quad g\in G, \,\,{\bf S}_i,{\bf S}_k \in {\sf A}. \eqno(]If the mapping ([link], expressed in this condensed way, fulfils two additional conditions, [e{\bf S}_i={\bf S}_i \hbox{ for any } {\bf S}_i \in {\sf A}, \eqno(]where e is the identity operation (unit element) of G, and[h(g{\bf S}_i)=(hg){\bf S}_i \hbox{ for any } h,g\in G \hbox{ and any } {\bf S}_i \in {\sf A}, \eqno(]then the mapping [\varphi] is called an action (or operation) of a group G on a set [{\sf A}], or just a group action.

We must note that the replacement of the explicit mapping ([link]) by a contracted version ([link]) is not always possible (see Example [aS][link]).

The condition ([link] requires that the first action [g{\bf S}_i= {\bf S}_k] followed by the second action [h{\bf S}_k={\bf S}_m] gives the same result as if one first calculates the product [hg=p] and then applies it to [{\bf S}_i], [p{\bf S}_i={\bf S}_m].

When a group G, a set [{\sf A}], and a mapping [\varphi] fulfil the requirements ([link] to ([link], one says that G acts or operates on [{\sf A}] and the set [{\sf A}] is called a G-set.

Example [aC] . We shall examine the action of an isometry g on an ideal infinite crystal in the three-dimensional space. Let us choose four points (atoms) of the crystal that define three non-coplanar vectors [{\bf a}_1, {\bf a}_2, {\bf a}_3] (e.g. basic lattice translations). These vectors will specify the orientation of the crystal in space. Let g be a point-group operation. This isometry g transforms (moves) points of the crystal to new positions and changes the orientation of the crystal to a new orientation specified by vectors [{\bf a}'_1, {\bf a}'_2, {\bf a}'_3], [{\bf a}'_i=\textstyle\sum\limits_{j=3}^{3}D(g)_{ji}{\bf a}_j, \quad i=1,2,3,\eqno(]where [D(g)_{ji}] are coefficients of a [3\times 3] matrix representing the operation g. For non-trivial operations g, the resulting vectors [{\bf a}'_1, {\bf a}'_2, {\bf a}'_3] always differ from the initial ones. If g is an improper rotation (rotoinversion), then these vectors have an opposite handedness to the vectors [{\bf a}_1, {\bf a}_2, {\bf a}_3] of the initial orientation and, for enantiomorphous crystals, the transformed crystal is an enantiomorphous form of the crystal in the initial orientation.

We choose a reference coordinate system defined by the origin O and by three non-coplanar basis vectors [{\bf e}_1, {\bf e}_2, {\bf e}_3]. By the state S of a crystal we shall understand, in a continuum description, the set of all its properties expressed by components of physical property (matter) tensors in the reference coordinate system or, in a microscopic description, the positions of atoms in the elementary unit cell expressed in the reference coordinate system. States defined in this way may change with temperature and external fields, and also with the orientation of the crystal in space. At constant temperature and external fields, the states are in one-to-one correspondence with the orientations of the crystal.

Application of an isometry on a state of a crystal can be treated as a group action: Let G be a point group and [{\sf A}] a set of all conceivable states of a crystal. We denote by [{\bf S}_i ] the state of the crystal in an initial orientation. An operation g of G changes the orientation of the crystal and the resulting state [{\bf S} _k] of the crystal in a new orientation is determined by [{\bf S}_i] and g. This is, in mathematical terms, a mapping of a pair [(g,{\bf S}_i)] on a state [{\bf S}_k] from the set [{\sf A}], [\varphi: (g,{\bf S}_i)\,\mapsto\, {\bf S}_k], or in the shorthand notation, [g{\bf S}_i={\bf S}_k, \quad g\in G,\,\, {\bf S}_i,{\bf S}_k \in {\sf A}. \eqno(]Since this mapping fulfils conditions ([link] and ([link], it is a group action. We note that for some g the resulting state [{\bf S} _k] can be identical with the initial state [{\bf S} _i] and that several operations can produce the same resulting state [{\bf S} _k].

Group action of an isometry on a crystal applies in a natural way to domain structures, where the group G describes the symmetry of the parent (high-symmetry) phase and the states [{\bf S}_i, {\bf S}_k] are crystallographically equivalent (G-equivalent) states of the distorted (low-symmetry) phase called domain states. This means that domain states are states that are crystallographically equivalent in G. In a continuum description, domain states differ in orientation and are called ferroic domain states or orientation states (see Section[link] ).

Example [aT] . Let us consider a property tensor [\tau] (e.g. polarization, permittivity, piezoelectric coefficients) and let us denote by [\tau^{(i)}] components of this tensor expressed in a fixed reference coordinate system. This set can be represented by a point in the corresponding tensor space. Let us denote by [{\sf B}] the set of all points of this tensor space and by G a point group. The mapping [g{\tau}^{(i)}={\tau}^{(k)}, \quad g \in G, \quad {\tau}^{(i)}, {\tau}^{(k)}\in {\sf B}, \eqno(] is defined by the transformation law of the tensor components (see Chapter 1.1[link] ). This mapping fulfils conditions ([link] and ([link], and can therefore be treated as a group action.

Example [aS] . Let G be a group, F a subgroup of G, [F\subset G], and [{\sf C}] the set of all subgroups of G. The group G can act on the set [{\sf C}] by conjugation: [ \varphi: \ (g,F)\,\mapsto\, gFg^{-1}, \quad g\in G, F\in {\sf C}. \eqno(]In this case, one has to write the mapping explicitly since the abbreviated form [gF] would mean a left coset and not a conjugate subgroup [gFg^{-1}]. One also has to corroborate the validity of condition ([link]: [(h,(g,F))] [\mapsto] [(h,(gFg^{-1}))] [\mapsto] [h(gFg^{-1})h^{-1} =] [hgF(hg)^{-1}], which is the image of [((hg),F)].

An action of a group G on a set [{\sf A}] introduces two basic notions, namely stabilizers and orbits. Stabilizers (isotropy groups)

| top | pdf |

The concept of a stabilizer is closely connected with the notion of the symmetry group of an object. Under the symmetry group F of an object [{\bf S}] one understands the set of all operations (isometries) that map the object onto itself, i.e. leave this object [{\bf S}] invariant. In this approach, one usually `attaches' the symmetry elements to the object. Then the symmetry group F of the object is its inherent property which does not depend on the orientation and position of the object in space. The term eigensymmetry is used in Chapter 3.3[link] for symmetry groups defined in this way.

The notion of a stabilizer describes the symmetry properties of an object from another standpoint, in which the object and the group of isometries are decoupled and introduced independently. One chooses a reference coordinate system and a group G of isometries, the operations of which have a defined orientation in this reference system. Usually, it is convenient to choose as the reference system the standard coordinate system (crystallographic or crystallophysical) of the group G. The object [{\bf S}_i] under consideration is specified not only per se but also by its orientation in the reference system. Those operations of G that map the object in this orientation onto itself form a group called the stabilizer of [{\bf S}_i] in the group G. An algebraic definition is formulated in the following way:

Definition [s] . The stabilizer (isotropy group) [I_G({\bf S}_i)] of an object [{\bf S}_i] of a G-set [{\sf A}] in group G is that subgroup of G comprised of all operations of G that do not change [{\bf S}_i], [I_G({\bf S}_i)=\{g \in G|g{\bf S}_i={\bf S}_i\}, \quad g\in G, \ {\bf S}_i\in {\sf A}. \eqno(]

Unlike the `eigensymmetry', the stabilizer [I_G({\bf S}_i)] depends on the group G, is generally a subgroup of G, [I_G({\bf S}_i)\subseteq G], and may change with the orientation of the object [{\bf S}_i].

There is an important relation between stabilizers of two objects from a G-set (see e.g. Aizu, 1970[link]; Kerber, 1991[link]):

Proposition . Consider two objects [{\bf S}_i, {\bf S}_k] from a G-set related by an operation g from the group G. The respective stabilizers [I_G({\bf S}_i), I_G({\bf S}_k)] are conjugate by the same operation g, [\hbox{if } {\bf S}_k=g{\bf S}_i, \hbox{ then } I_G({\bf S}_k)=gI_G({\bf S}_i)g^{-1}. \eqno(]

Let us illustrate the meaning of stabilizers with four examples of group action considered above.

Example [sP] . Let [\cal G] be a crystallographic space group and X a point of the three-dimensional point space [E(3)] (see Example[link]). The stabilizer [{\cal I_G}(X)], called the site-symmetry group of the point X in [\cal G], consists of all symmetry operations of [\cal G] that leave the point X invariant. Consequently, the stabilizer [{\cal I_G}(X)] is a crystallographic point group. If the stabilizer [{\cal I_G}(X)] consists only of the identity operation, then the point X is called a point of general position. If [{\cal I_G}(X)] is a non-trivial point group, X is called a point of special position (IT A , 2005[link]).

Example [sC] . The symmetry of domain states [{\bf S}_i, {\bf S}_k,\ldots], treated in Example [sP][link], is adequately expressed by their stabilizers in the group G of the parent (high-symmetry) phase, [I_G({\bf S}_i) = F_i], [I_G({\bf S}_k) = F_k,\ldots]. These groups are called symmetry groups of domain states. If domain states [{\bf S}_i, {\bf S}_k] are related by an operation [g\in G], then their symmetry groups are, according to ([link], conjugate by g, [\hbox{if } {\bf S}_k=g{\bf S}_i \hbox{ then } F_k= gF_ig^{-1}. \eqno(]

Symmetry characterization of domain states by their stabilizers properly reflects a difference between ferroelastic single domain states and ferroelastic disoriented domain states (see Sections 3.4.3[link] and 3.4.4[link] ).

Example [sT] . The notion of the stabilizer enables one to formulate a basic relation between the symmetry group of the parent phase, the symmetry group of the first domain state [{\bf S}_1] and order parameters of the transition. In a microscopic description, the symmetry of the parent phase is described by a space group [\cal G] and the symmetry of the first basic (microscopic) single domain state [{\sf S}_1] by the stabilizer [{\cal I}_{\cal G}({\sf S}_1)={\cal F}_1]. The stabilizer of the primary order parameter [{\eta}^{(1)}] must fulfil the condition [I_{\cal G}({\eta}^{(1)})=I_{\cal G}({\sf S}_1)={\cal F}_1. \eqno(]The appearance of nonzero [{\eta}^{(1)}] in the ferroic phase thus fully accounts for the symmetry descent [{\cal G}\supset {\cal F}_1] at the transition.

In a continuum description, a role analogous to [{\eta}^{(1)}] is played by a principal tensor parameter [\mu^{(1)}] (see Section 3.1.3[link] ). Its stabilizer [I_G({\mu}^{(1)})] in the parent point group G equals the point group [F_1] of the first single domain state [{\sf S}_1], [I_G({\mu}^{(1)})=I_G({\bf S}_1)=F_1. \eqno(]

This contrasts with the secondary order parameter [\lambda^{(1)}] (secondary tensor parameter in a continuum description). Its stabilizer [I_G({\lambda}^{(1)})=L_1\eqno(] is an intermediate group [F_1\subset L_1\subset G], i.e. the appearance of [{\lambda}^{(1)}] would lead only to a partial symmetry descent [G \supset L_1] with [L_1 \supset F_1].

Example [sS] . The stabilizer of a subgroup [F_i\subset G] from Example [aS][link] is the normalizer [N_G(F_i)] defined in Section[link]: [I_G(F_i)=\{g\in G|gF_ig^{-1}=F_i\}=N_G(F_i).\eqno(]

In general, a stabilizer, which is a subgroup of G, is an example of a structure which is induced by a group action on the group G. On the other hand, a group action exerts a partition of the set [{\sf A}] into equivalence classes called orbits. Orbits

| top | pdf |

The group action allows one to specify the equivalence relation and the partition of a set into equivalence classes introduced in Section[link] [see ([link]]. If G is a group and [{\bf S}_i,{\bf S}_k] are two objects of a G-set [{\sf A}], then one says that the objects [{\bf S}_i,{\bf S}_k] are G-equivalent, [{\bf S}_i\,\lower2pt\hbox{${\buildrel{G}\over{\sim}}$}\,{\bf S}_k], if there exists an operation [g \in G] that transforms [{\bf S}_i] into [{\bf S}_k], [ {\bf S}_k=g{\bf S}_i, \quad {\bf S}_i,{\bf S}_k \in {\sf A}, \,\,g\in G. \eqno(]In our applications, the group G is most often a crystallographic group. In this situation we shall speak about crystallographically equivalent objects. Exceptionally, G will be the group of all isometries [O(3)] (full orthogonal group in three dimensions); then we shall talk about symmetrically equivalent objects.

The relation [\lower2pt\hbox{$\buildrel{G}\over{\sim}$}] is an equivalence relation on a set [{\sf A}] and therefore divides a set [{\sf A}] into G-equivalence classes. These classes are called orbits and are defined in the following way:

Definition [o] . Let [{\sf A}] be a G-set and [{\bf S}_i] an object of the set [{\sf A}]. A G orbit of [{\bf S}_i], denoted [G{\bf S}_i], is a set of all objects of [{\sf A}] that are G-equivalent with [{\bf S}_i], [G{\bf S}_i=\{g{\bf S}_i|{\forall g} \in G\}, \quad{\bf S}_i\in {\sf A}. \eqno(]

Important note: The object [{\bf S}_i] of the orbit [G{\bf S}_i] is called the representative of the orbit [G{\bf S}_i]. If the group G is known from the context, one simply speaks of an orbit of [{\bf S}_i].

Any two objects of an orbit are G-equivalent and any object of the orbit can be chosen as a representative of this orbit. Two G orbits [G{\bf S}_r], [G{\bf S}_s] of a G-set [{\sf A}] are either identical or disjoint. The set [{\sf A}] can therefore be partitioned into disjoint orbits, [{\sf A}=G{\bf S}_i \cup G{\bf S}_k \cup\ldots \cup G{\bf S}_q.\eqno(] Different groups G produce different partitions of the set [{\sf A}].

Example [oP] . If X is a point in three-dimensional point space and G is a crystallographic point group (see Example [aP][link]), then the orbit [G(X)] consisting of all crystallographically equivalent points is called a point form [see IT A (2005[link]), Part 10[link] ]. If the group is a space group [\cal G], then [{\cal G}(X)] is called the a crystallographic orbit of X with respect to [{\cal G}]. In this case, the crystallographic orbit is an infinite set of points due to the infinite number of translations in the space group [{\cal G}] [see IT A (2005[link]), Part 8[link] ]. In this way, the infinite set of points of the point space is divided into an infinite number of disjoint orbits.

Example [oC] . Let [{\bf S}_1] be a domain state from Example [aC][link]. The orbit [G{\bf S}_1], where G is the parent phase symmetry, assembles all G-equivalent domain states, [G{\bf S}_1=\{{\bf S}_1, {\bf S}_2,\ldots, {\bf S}_n\}. \eqno(]The existence of several equivalent states is the main characteristic feature of domain states. Domain states of the orbit [G{\bf S}_1] represent all possible variants of the low-symmetry phase with the same energy and the same chance of appearance in the domain structure. Structurally, they represent the crystal structure [{\bf S}_1] in all distinguishable orientations (and also positions in a microscopic description) related by isometries of the group G. If G contains rotoinversions and if [{\bf S}_1] is an enantiomorphic structure, then the orbit [G{\bf S}_1] also comprises the enantiomorphic form of [{\bf S}_1].

Example [oT] . Let [{\mu}^{(1)}] be a principal tensor parameter of the point-group-symmetry descent [G \supset F_1] (see Example [sT][link]). The orbit [G{\mu}^{(1)}] consists of all points in the tensor space of the principal tensor parameter that are crystallographically equivalent with respect to G, [G{\mu}^{(1)}=\{{\mu}^{(1)}, {\mu}^{(2)},\ldots, {\mu}^{(n)}\}. \eqno(]

Example [oS] . The orbit [GF_1] of a subgroup [F_1] in Example [aS][link] is the set of all subgroups conjugate under G to [F_1], [GF_1=\{F_1, g_2F_1g_2^{-1},\ldots, g_mF_1g_m^{-1}\}.\eqno(]

From Proposition[link] and from Example [oS][link], it follows that stabilizers of objects from one orbit [G{\bf S}_i] constitute the orbit ([link] of all subgroups conjugate under G. One can thus associate with each orbit [G{\bf S}_i] an orbit [GF_i] of conjugate subgroups of G. The set of all objects with stabilizers from one orbit [GF_i] of conjugate subgroups is called a stratum of [F_i] in the set [{\sf A}] (Michel, 1980[link]; Kerber, 1999[link]). In crystallography, the term Wyckoff position is used for the stratum of points of the point space (IT A , 2005[link]).

The notion of a stratum can be also applied to the classification of orbits of domain states treated in Example [oC][link]. Let G be the symmetry of the parent phase and [{\sf A}] the set of all states of the crystal. Orbits [G{\bf S}_i] of domain states with stabilizers from one orbit [GF_i] of conjugate subgroups of G, [F_i=I_G({\bf S}_i)], are of the `same type' and form a stratum of domain states. Domain states of different orbits belonging to the same stratum differ in the numerical values of parameters describing the states but have the same crystallographic and topological properties. All possible strata that can be formed from a given parent phase with symmetry G can be identified with all different orbits of subgroups of G.

In a similar manner, points of the order-parameter space and tensor-parameter space from Examples [sC][link] and [oT][link] can be divided into strata which are characterized by the orbits of possible stabilizers.

Next, we formulate three propositions that are essential in the symmetry analysis of domain structures presented in Section 3.4.2[link] . Orbits and left cosets

| top | pdf |

Proposition . Let G be a finite group, [{\sf A}] a G-set and [I_G({\bf S}_1)\equiv F_1] the stabilizer of an object [{\bf S}_1] of the set [{\sf A}, {\bf S}_1 \in {\sf A}]. The objects of the orbit [G{\bf S}_1=\{{\bf S}_1, {\bf S}_2,\ldots, {\bf S}_j,\ldots, {\bf S}_n\}\eqno(]and the left cosets [g_{j}F_1] of the decomposition of G, [ G=g_1F_{1} \cup g_2F_{1} \cup\ldots\cup g_jF_{1}\cup\ldots\cup g_nF_{1}= \bigcup_{j=1}^ng_jF_{1}, \eqno(]are in a one-to-one correspondence, [{\bf S}_j\leftrightarrow g_{j}F_1, \quad F_1= I_G({\bf S}_1), \ j=1,2,\ldots, n. \eqno(]

(See e.g. Kerber, 1991[link], 1999[link]; Kopský, 1983[link]; Lang, 1965[link].) The derivation of the bijection ([link] consists of two parts:

  • (i) All operations of a left coset [g_jF_1] transform [{\bf S}_1] into the same [{\bf S}_j=g_j{\bf S}_1], since [g_j{\bf S}_1=g_j(F_1{\bf S}_1)=(g_jF_1){\bf S}_1], where we use the relation[\eqalignno{F_1{\bf S}_1&=\{f_1, f_2,\ldots, f_q\}{\bf S}_1&\cr&= \{f_1{\bf S}_1, f_2{\bf S}_1,\ldots, f_q{\bf S}_1\}&\cr&= \{{\bf S}_1, {\bf S}_1,\ldots, {\bf S}_1\}=\{{\bf S}_1\}={\bf S}_1, &(}]which in the second line contains a generalization of the group action and in the third line reflects Definition[link] of a set as a collection of distinguishable objects, [\{{\bf S}_1, {\bf S}_1,\ldots, {\bf S}_1\} =] [{\bf S}_1\cup {\bf S}_1\ldots\cup {\bf S}_1 =] [{\bf S}_1].

  • (ii) Any [g_r \in G] that transforms [{\bf S}_1] into [{\bf S}_j=g_j{\bf S}_1] belongs to the left coset [g_jF_1], since from [g_j{\bf S}_1=g_r{\bf S}_1] it follows that [g_r^{-1}g_j{\bf S}_1={\bf S}_1], i.e. [g_r^{-1}g_j\in F_1], which, according to the left coset criterion, holds if and only if [g_r] and [g_j] belong to the same left coset [g_jF_1].

We note that the orbit [G{\bf S}_1] depends on the stabilizer [I_G({\bf S}_1)=F_1] of the object [{\bf S}_1] and not on the `eigensymmetry' of [{\bf S}_1].

From Proposition[link] follow two corollaries:

Corollary . The order n of the orbit [G{\bf S}_1] equals the index of the stabilizer [I_G({\bf S}_1)=F_1] in G, [n=[G:I_{G}({\bf S}_1)]=[G:F_1]=|G|:|F_1|, \eqno(] where the last part of the equation applies to point groups only.

Corollary . All objects of the orbit [G{\bf S}_1] can be generated by successive application of representatives of all left cosets [g_{j}F_1] in the decomposition of G [see ([link]] to the object [{\bf S}_1], [{\bf S}_j=g_{j}{\bf S}_1, \ j=1,2,\ldots, n]. The orbit [G{\bf S}_1] can therefore be expressed explicitly as[G{\bf S}_1=\{{\bf S}_1, g_2{\bf S}_1,\ldots, g_j{\bf S}_1,\ldots, g_n{\bf S}_1\}, \eqno(]where the operations [g_1=e, g_2,\ldots, g_j,\ldots, g_n] (left transversal to [F_1] in G) are the representatives of left cosets in the decomposition ([link].

Example [oP] . The number of equivalent points of the point form [GX] (G orbit of the point X) is called a multiplicity [m_G(X)] of this point, [m_G(X)=|G|:|I_G(X)|. \eqno(]The multiplicity of a point of general position equals the order [|G|] of the group G, since in this case [I_G(X)=e], a trivial group. Then points of the orbit [GX] and the operations of G are in a one-to-one correspondence. The multiplicity of a point of special position is smaller than the order [|G|], [m_G(X) \,\lt\, |G|], and the operations of G and the points of the orbit [GX] are in a many-to-one correspondence. Points of a stratum have the same multiplicity; one can, therefore, talk about the multiplicity of the Wyckoff position [see IT A (2005[link])]. If G is a space group, the point orbit has to be confined to the volume of the primitive unit cell (Wondratschek, 1995[link]).

Example [oC] . Corollaries[link] and[link] applied to domain states represent the basic relations of domain-structure analysis. According to ([link], the index n of the stabilizer [I_G({\bf S}_1)] in the parent group G gives the number of domain states in the orbit [G{\bf S}_1] and the relations ([link] and ([link] give a recipe for constructing domain states of this orbit.

Example [oT] . If [{\mu}^{(1)}] is a principal tensor parameter associated with the symmetry descent [G \supset F_1 ], then there is a one-to-one correspondence between the elements of the orbit of single domain states [G{\bf S}_1=\{{\bf S}_1, {\bf S}_2,\ldots, {\bf S}_j,\ldots, {\bf S}_n\}] and the elements of the orbit of the principal order parameter (points) [G{\mu}^{(1)}=\{{\mu}^{(1)}, {\mu}^{(2)},\ldots, {\mu}^{(j)},\ldots, {\mu}^{(n)}\}] (see Example [oT][link]), [ {\bf S}_j\leftrightarrow g_{j}F_1\leftrightarrow {\mu}^{(j)}, \quad j=1,2,\ldots, n. \eqno(] Therefore, single domain states of the orbit [G{\bf S}_1] can be represented by the principal tensor parameter of the orbit [G{\mu}^{(1)}].

Example [oS] . Consider a subgroup [F_1] of a group G. Since the stabilizer of [F_1] in G is the normalizer [N_G(F_1)] (see Example [sS][link]), the number m of conjugate subgroups is, according to ([link], [m=[G:N_G(F_1)]=|G|:|N_G(F_1)|,\eqno(]where the last part of the equation applies to point groups only. The orbit of conjugate subgroups is [\displaylines{GF_1=\{F_{1}, h_2F_{1}h_2^{-1},\ldots, h_jF_{1}h_j^{-1},\ldots h_mF_{1}h_m^{-1}\}, \cr\hfill\hfill j=1,2,\ldots, m, \hfill(}]where the operations [h_1=e, h_2,\ldots, h_j,\ldots, h_m] are the representatives of left cosets in the decomposition [G=N_G(F_1) \cup h_2N_G(F_1) \cup\ldots \cup h_jN_G(F_1)\cup\ldots\cup h_mN_G(F_1).\eqno(] Intermediate subgroups and partitions of an orbit into suborbits

| top | pdf |

Proposition . Let [G{\bf S}_1] be a G orbit from Proposition[link] and [L_1] an intermediate group, [F_1 \subset L_1 \subset G. \eqno(]A successive decomposition of G into left cosets of [L_1] and [L_1] into left cosets of [F_1] [see ([link]] introduces a two-indices relabelling of the objects of a G orbit defined by the one-to-one correspondence [h_jp_kF_1 \leftrightarrow {\bf S}_{jk}, \quad j=1,2,\ldots m, \quad k=1,2,\ldots, d, \eqno(]where [\{h_1,h_2,\ldots,h_m\}] are the representatives of the decompositions of G into left cosets of [L_1], [G=h_1L_{1} \cup h_2L_{1} \cup\ldots\cup h_jL_{1}\cup\ldots \cup h_mL_{1}, \quad m=[G:L_1], \eqno(]and [\{p_1,p_2,\ldots,p_d\}] are the representatives of the decompositions of [L_1] into left cosets of [F_1], [L_{1}=p_1F_{1} \cup p_2F_{1} \cup\ldots \cup p_kF_{1}\cup\ldots \cup p_dF_{1}, \quad d=[L_1:F_1]. \eqno(]

The index n of [F_{1}] in G can be expressed as a product of indices m and d [see ([link]], [n=[G:F_1]=[G:L_{1}][L_{1}:F_{1}]=md. \eqno(]If G is a finite group, then the index n can be expressed in terms of orders of groups G, [F_1] and [L_1]: [n=|G|:|F_1|=(|G|:|L_{1}|)(|L_{1}|:|F_{1}|)=md. \eqno(]

When one chooses [{\bf S}_{1} ={\bf S}_{11}], then the members of the orbit [G{\bf S}_{11}] can be arranged into an [m\times d] array, [\matrix{{\bf S}_{11} & {\bf S}_{12} &\ldots &{\bf S}_{1k} &\ldots&{\bf S}_{1d} \cr {\bf S}_{21} & {\bf S}_{22} &\ldots &{\bf S}_{2k} &\ldots &{\bf S}_{2d} \cr\vdots &\vdots&\ddots &\vdots &\ddots &\vdots\cr{ \bf S}_{j1} &{ \bf S}_{j2} &\ldots &{\bf S}_{jk} &\ldots &{\bf S}_{jd} \cr\vdots &\vdots &\ddots &\vdots &\ddots &\vdots\cr {\bf S}_{m1} & {\bf S}_{m2} &\ldots &{\bf S}_{mk} &\ldots &{\bf S}_{md}} \eqno(]

The set of objects of the jth row of this array forms an [L_j] orbit with the representative [{\bf S}_{j 1}], [\eqalignno{ &\{ {\bf S}_{j1}, {\bf S}_{j2},\ldots, {\bf S}_{jk},\ldots, {\bf S}_{jd}\}&\cr&\quad = \{h_jp_1{\bf S}_{11}, h_jp_2{\bf S}_{11},\ldots, h_jp_k{\bf S}_{11},\ldots, h_jp_d{\bf S}_{11}\}&\cr&\quad= L_j{\bf S}_{j 1},&(}] where [L_j=h_jL_1h_j^{-1}, \quad {\bf S}_{j 1}=h_j{\bf S}_{11}, \quad j=1,2,\ldots, m. \eqno(]The intermediate group [L_1] thus induces a splitting of the orbit [G{\bf S}_{11}] into m suborbits [L_j{\bf S}_{j 1}], [j=1,2,\ldots,m]: [G{\bf S}_{11}=L_1{\bf S}_{11} \cup L_2{\bf S}_{21} \cup\ldots\cup L_j{\bf S}_{j1}\cup\ldots\cup L_m{\bf S}_{m1}, \quad m=[G:L_1]. \eqno(]Aizu (1972[link]) denotes this partitioning factorization of species.

The relation ([link] is just the application of the correspondence ([link] of Proposition[link] on the successive decomposition ([link]. Derivation of the second part of Proposition[link] can be sketched in the following way: [\eqalignno{\{ {\bf S}_{j1}, {\bf S}_{j2},\ldots, {\bf S}_{jd}\}&= h_j\{p_1{\bf S}_{11},p_2{\bf S}_{11},\ldots, p_d{\bf S}_{11}\}&\cr&=h_j\{p_1, p_2,\ldots, p_d\}F_1{\bf S}_{11}&\cr &= h_jL_1{\bf S}_{11} = h_jL_1h_j^{-1}{\bf S}_{j1} =L_j{\bf S}_{j1}, &\cr j&=1,2,\ldots, m, &(}]where the relation ([link] is used.

We note that the described partitioning of an orbit into suborbits depends on the choice of representative of the first suborbit [{\bf S}_{11}] and that the number of conjugate subgroups [L_j] may be equal to or smaller than the number m of suborbits (see Example [oS][link]).

Each intermediate group [L_1] in Proposition[link] can usually be associated with a certain attribute, e.g. a secondary order parameter, which specifies the suborbits.

Example [oP] . Let G be a point group and [X_1] a point of general position [(I_G(X_1)=e)] in the point space. A symmetry descent to a subgroup [L_1\subset G] is accompanied by a splitting of the orbit [GX_1] of [|G|] equivalent points into [m=|G|:|L_1|] suborbits each consisting of [|L_1|] equivalent points. The first suborbit is [L_1X_1], the others are [L_jX_j], [L_j=h_jL_1h_j^{-1}], [X_j=h_jX_1], [j=1,2,\ldots,m], where [h_j] are representatives of left cosets of [L_1] in the decomposition of G [see ([link]].

Splitting of orbits of points of general position is a special case in which [I_L(X_1)=I_G(X_1)]. Splitting of orbits of points of special position is more complicated if [I_L(X_1)\subset I_G(X_1)] (see Wondratschek, 1995[link]).

Example [oC] . Let us consider a phase transition accompanied by a lowering of space-group symmetry from a parent space group [\cal G] with translation subgroup T and point group G to a low-symmetry space group [\cal F] with translation subgroup U and point group F. There exists a unique intermediate group [\cal M], called the group of Hermann, which has translation subgroup T and point group [M=F] (see e.g. Hahn & Wondratschek, 1994[link]; Wadhawan, 2000[link]; Wondratschek & Aroyo, 2001[link]).

The decomposition of [{\cal G}] into left cosets of [{\cal M}], corresponding to ([link], is in a one-to-one correspondence with the decomposition of G into left cosets of F, since [{\cal G}] and [{\cal M}] have the same translation subgroup [\bf{T}] and [{\cal M}] and [{\cal F}] have the same point group. Therefore, the index [n\equiv [{\cal G}:{\cal M}]=[G:F]=|G|:|F|].

Since [{\cal M}] and [{\cal F}] have the same point group F, the decomposition of [{\cal M}] into left cosets of [{\cal F}], corresponding to ([link], is in a one-to-one correspondence with the decomposition of [\bf{T}] into left cosets of [\bf{U}], [{\bf T}={\bf t}_1{\bf U}+{\bf t}_2{\bf U}+\ldots+ {\bf t}_d{\bf U}. \eqno(]Representatives [{\bf t}_1, {\bf t}_2,\ldots {\bf t}_d] are translations. The corresponding vectors lead from the origin of a `superlattice' primitive unit cell of the low-symmetry phase to lattice points of [\bf{T}] located within or on the side faces of this `superlattice' primitive unit cell (Van Tendeloo & Amelinckx, 1974[link]). The number [d_t] of these vectors is equal to the ratio [v_{\cal F}:v_{\cal G}=Z_{\cal F}:Z_{\cal G}], where [v_{\cal F}] and [v_{\cal G}] are the volumes of the primitive unit cell of the low-symmetry phase and the parent phase, respectively, and [Z_{\cal F}] and [Z_{\cal G}] are the number of chemical formula units in the primitive unit cell of the low-symmetry phase and the parent phase, respectively.

There is another useful formula for expressing [d_t=[{\bf T}:{\bf U}]]. The primitive basis vectors [{\bf b}_1, {\bf b}_2, {\bf b}_3] of [\bf U] are related to the primitive basis vectors [{\bf a}_1, {\bf a}_2, {\bf a}_3] of [\bf{T}] by a linear relation, [{\bf b}_i=\textstyle\sum\limits_{j=1}^{3}{\bf a}_jm_{ji}, \quad i=1,2,3, \eqno(]where [m_{ji}] are integers. The volumes of primitive unit cells are [v_{\cal G}={\bf a}_1({\bf a}_2\times {\bf a}_3)] and [v_{\cal F}={\bf b}_1({\bf b}_2\times {\bf b}_3)]. Using ([link], one gets [v_{\cal F}={\rm det}(m_{ij})v_{\cal G}], where [ {\rm det}(m_{ij})] is the determinant of the [(3\times 3)] matrix of the coefficients [m_{ij}]. Hence the index [d_t=(v_{\cal F}:v_{\cal G})={\rm det}(m_{ij})].

Thus we get for the index N of [{\cal F}] in [{\cal G}] [\eqalignno{N&= [{\cal G}:{\cal F}]= [G:F][{\bf T}:{\bf U}]&\cr &= (|G|:|F|)(v_{\cal F}:v_{\cal G})=(|G|:|F|)(Z_{\cal F}:Z_{\cal G})&\cr&= (|G|:|F|) {\rm det}(m_{ij})=nd_t. &(}]

Each suborbit, represented by a row in the array ([link], contains all basic (microscopic) domain states that are related by pure translations. These domain states exhibit the same tensor properties, i.e. they belong to the same ferroic domain state.

Example [sT] . Let us consider a phase transition with a symmetry descent [G \supset F_1] with an orbit [G{\bf S}_{11}] of domain states. Let [L_1] be an intermediate group, [F_1 \subset L_1 \subset G], and [{\lambda}^{(1)}] the principal order parameter associated with the symmetry descent [G \supset L_1] [cf. ([link]], [I_G({\lambda}^{(1)})=L_1]. Since [L_1] is an intermediate group, the quantity [{\lambda}^{(1)}] represents a secondary order parameter of the symmetry descent [G \supset F_1]. The G orbit of [{\lambda}^{(1)}] is [G{\lambda}^{(1)} =\{{\lambda}^{(1)}, {\lambda}^{(2)},\ldots, {\lambda}^{(m)}\}, \quad m=[G:L_1]. \eqno(]As in Example [oT][link], there is a bijection between left cosets of the decomposition of G into left cosets of [L_1] [see ([link]] and the G orbit of secondary order parameters ([link]. One can, therefore, associate with the suborbit [L_j{\bf S}_{j1}] the value [{\lambda}^{(j)}] of the secondary order parameter [\lambda], [L_j{\bf S}_{j1} \leftrightarrow {\lambda}^{(j)}, \quad j=1,2,\ldots, m. \eqno(]A suborbit [L_j{\bf S}_{j1}] is thus comprised of objects of the orbit [G{\bf S}_{11}] with the same value of the secondary order parameter [\lambda^{(j)}].

Example [oS] . Let us choose for the intermediate group [L_1] the normalizer [N_G(F_1)]. Then the suborbits equal [\displaylines{N_G(F_j){\bf S}_{j1}=\{h_j{\bf S}_{11},h_jp_{2}{\bf S}_{11},\ldots, h_jp_{d}{\bf S}_{11}\},\cr\hfill\hfill j=1,2,\ldots, m=[G:N_G(F_1)], \hfill(}]where [p_{1}=e,p_{2},\ldots, p_{d}] are representatives of left cosets [p_{k}F_1] in the decomposition of [N_G(F_1)], [N_G(F_{1})=p_1F_{1} \cup p_2F_{1} \cup\ldots \cup p_dF_{1}, \quad d=[N_G(F_1):F_1], \eqno(]and [h_j] are representatives of the decomposition ([link]. The suborbit [ F_j{\bf S}_{j1}] consists of all objects with the same stabilizer [F_j], [\displaylines{I_G({\bf S}_{j1})=I_G({\bf S}_{j2})=\ldots= I_G({\bf S}_{jd})=F_j, \cr j=1,2,\ldots, m=[G:N_G(F_1)]. \cr\hfill(}]

Propositions[link] and[link] are examples of structures that a group action induces from a group G on a G-set. Another important example is a permutation representation of the group G which associates operations of G with permutations of the objects of the orbit [G{\bf S}_i] [see e.g. Kerber (1991[link], 1999[link]); for application of the permutation representation in domain-structure analysis and domain engineering, see e.g. Fuksa & Janovec (1995[link], 2002[link])]. Orbits of ordered pairs and double cosets

| top | pdf |

An ordered pair [({\bf S}_i,{\bf S}_k)] is formed by two objects [{\bf S}_i, {\bf S}_k] from the orbit [G{\bf S}_1]. Let [{\sf P}] denote the set of all ordered pairs that can be formed from the objects of the orbit [G{\bf S}_1]. The group action [\varphi] of group G on the set [{\sf P}] is defined by the following relation:[\displaylines{\varphi:g({\bf S}_i,{\bf S}_k)=(g{\bf S}_i,g{\bf S}_k)=({\bf S}_r,{\bf S}_s), \cr \hfill \hfill g\in G,\quad ({\bf S}_i,{\bf S}_k), ({\bf S}_r, {\bf S}_s)\in {\sf P}.\hfill(}]The requirements ([link] to ([link] are fulfilled, mapping ([link] defines an action of group G on the set [\sf P].

The group action ([link] introduces the G-equivalence of ordered pairs: Two ordered pairs [({\bf S}_i,{\bf S}_k)] and [({\bf S}_r,{\bf S}_s)] are crystallographically equivalent (with respect to the group G), [({\bf S}_i,{\bf S}_k)\,\lower2pt\hbox{${\buildrel{G}\over{\sim}}$}\,({\bf S}_r,{\bf S}_s)], if there exists an operation [g\in G] that transforms [({\bf S}_i,{\bf S}_k)] into [({\bf S}_r,{\bf S}_s)], [g \in G\,\, (g{\bf S}_i,g{\bf S}_k)=({\bf S}_r,{\bf S}_s), \quad ({\bf S}_i,{\bf S}_k), ({\bf S}_r, {\bf S}_s)\in {\sf P}.\eqno(]

An orbit of ordered pairs [G({\bf S}_i,{\bf S}_k)] comprises all ordered pairs crystallographically equivalent with [({\bf S}_i,{\bf S}_k)]. One can choose as a representative of the orbit [G({\bf S}_i,{\bf S}_k)] an ordered pair [({\bf S}_1,{\bf S}_j)] with the first member [{\bf S}_1] since there is always an operation [g_{1i}\in G] such that [g_{i1}{\bf S}_i={\bf S}_1]. The orbit [F_1({\bf S}_1,{\bf S}_j)] assembles all ordered pairs with the first member [{\bf S}_1]. This orbit can be expressed as[\eqalignno{F_1({\bf S}_1,{\bf S}_j)&=(F_1{\bf S}_1,F_1{\bf S}_j)=({\bf S}_1,F_1(g_j{\bf S}_1))&\cr&=({\bf S}_1,(F_1g_j)(F_1{\bf S}_1))=({\bf S}_1,(F_1g_jF_1){\bf S}_1),&\cr&&(}]where the identity [F_1{\bf S}_1={\bf S}_1] [see relation ([link]] has been used.

Thus the double coset [F_1g_jF_1] contains all operations from G that produce all ordered pairs with the first member [{\bf S}_1] that are G-equivalent with [({\bf S}_1,{\bf S}_j=g_j{\bf S}_1)]. If one chooses [g_r\in G] that is not contained in the double coset [F_1g_jF_1], then the ordered pair [({\bf S}_1,{\bf S}_r=g_r{\bf S}_1)] must belong to another orbit [G({\bf S}_1,{\bf S}_r)] [\neq] [G({\bf S}_1,{\bf S}_j)]. Hence to distinct double cosets there correspond distinct classes of ordered pairs with the first member [{\bf S}_1], i.e. distinct orbits of ordered pairs. Since the group G can be decomposed into disjoint double cosets [see ([link]], one gets

Proposition . Let G be a group and [{\sf P}] a set of all ordered pairs that can be formed from the objects of the orbit [G{\bf S}_1]. There is a one-to-one correspondence between the G orbits of ordered pairs of the set [{\sf P}] and the double cosets of the decomposition [\displaylines{G=F_{1} \cup F_{1}g_2F_{1} \cup\ldots\cup F_{1}g_jF_{1}\cup\ldots\cup F_{1}g_qF_{1},\cr\hfill\hfill j=1,2,\ldots q. \hfill(\cr\hfill\hfill G({\bf S}_1,{\bf S}_j)\leftrightarrow F_{1}g_jF_{1} \hbox{ where } {\bf S}_j=g_j{\bf S}_1.\hfill(}%fd3.2.3.101]This bijection allows one to express the partition of the set [\sf P] of all ordered pairs into G orbits, [{\sf P} = G({\bf S}_1,{\bf S}_1) \cup G({\bf S}_1,g_2{\bf S}_1) \cup\ldots \cup ({\bf S}_1,{\bf S}_j) \cup\ldots\cup G({\bf S}_1,g_q{\bf S}_1), \eqno(]where [\{g_1=e, g_2,\ldots g_j,\ldots g_q\}] is the set of representatives of double cosets in the decomposition ([link] (Janovec, 1972[link]).

Proposition[link] applies directly to pairs of domain states (domain pairs) and allows one to find transposition laws that can appear in the low-symmetry phase (see Section 3.4.3[link] ).

For more details and other applications of group action see e.g. Kopský (1983[link]), Lang (1965[link]), Michel (1980[link]), Opechowski (1986[link]), Robinson (1982[link]), and especially Kerber (1991[link], 1999[link]).


International Tables for Crystallography (2004). Vol. A1. Symmetry relations between space groups, edited by H. Wondratschek & U. Müller. Dordrecht: Kluwer Academic Publishers.
International Tables for Crystallography (2005). Vol. A. Space-group symmetry, 5th edition, edited by Th. Hahn. Heidelberg: Springer.
Aizu, K. (1970). Possible species of ferromagnetic, ferroelectric and ferroelastic crystals. Phys. Rev. B, 2, 754–772.
Aizu, K. (1972). Electrical, mechanical and electromechanical orders of state shifts in nonmagnetic ferroic crystals. J. Phys. Soc. Jpn, 32, 1287–1301.
Bradley, C. J. & Cracknell, A. P. (1972). The mathematical theory of symmetry in solids. Oxford: Clarendon Press.
Budden, F. J. (1972). Fascination of groups. Cambridge University Press.
Fuksa, J. & Janovec, V. (1995). Permutation classification of domain pairs. Ferroelectrics, 172, 343–350.
Fuksa, J. & Janovec, V. (2002). Macroscopic symmetries and domain configurations of engineered domain structures. J. Phys. Condens. Matter, 14, 3795–3812.
Hahn, Th. & Wondratschek, H. (1994). Symmetry of crystals. Sofia: Heron Press Ltd.
Hall, M. Jr (1959). The theory of groups. New York: The Macmillan Company.
Janovec, V. (1972). Group analysis of domains and domain pairs. Czech. J. Phys. B, 22, 974–994.
Janssen, T. (1973). Crystallographic groups. Amsterdam: North-Holland.
Kerber, A. (1991). Algebraic combinatorics via finite group action. Mannheim: B. I. Wissenschaftsverlag.
Kerber, A. (1999). Applied finite group actions. Berlin: Springer.
Kopský, V. (1983). Algebraic investigations in Landau model of structural phase transitions, I, II, III. Czech. J. Phys. B, 33, 485–509, 720–744, 845–869.
Kuratowski, K. & Mostowski, A. (1968). Set theory. Amsterdam: North-Holland.
Lang, S. (1965). Algebra. Reading, MA: Addison-Wesley.
Ledermann, W. (1973). Introduction to group theory. London: Longman Group Ltd.
Lipschutz, S. (1981). Theory and problems of set theory and related topics. Singapore: McGraw-Hill.
Michel, L. (1980). Symmetry defects and broken symmetry. Configurations. Hidden symmetry. Rev. Mod. Phys. 52, 617–651.
Opechowski, W. (1986). Crystallographic and metacrystallographic groups. Amsterdam: North-Holland.
Robinson, D. J. S. (1982). A course in the theory of groups. New York: Springer.
Rosen, J. (1995). Symmetry in science. Berlin: Springer.
Shubnikov, A. V. & Koptsik, V. A. (1974). Symmetry in science and art, pp. 348, 372. New York: Plenum.
Speiser, A. (1927). Theorie der Gruppen von endlicher Ordnung. Berlin: Springer.
Vainshtein, B. K. (1994). Modern crystallography I. Symmetry of crystals, 2nd edition. Berlin: Springer.
Vainshtein, B. K., Fridkin, V. M. & Indenbom, V. L. (1995). Modern crystallography II. Structure of crystals, 2nd edition, Section 5.7. Berlin: Springer.
Van Tendeloo, G. & Amelinckx, S. (1974). Group-theoretical considerations concerning domain formation in ordered alloys. Acta Cryst. A30, 431–440.
Wadhawan, V. K. (2000). Introduction to ferroic materials. Amsterdam: Gordon and Breach.
Wondratschek, H. (1995). Splitting of Wyckoff positions (orbits). Z. Kristallogr. 210, 567–573.
Wondratschek, H. & Aroyo, M. (2001). The application of Hermann's group [\cal M] in group–subgroup relations between space groups. Acta Cryst. A57, 311–320.

to end of page
to top of page