my-server
← Wiki

Wreath product

In group theory, the wreath product is a special combination of two groups based on the semidirect product. It is formed by the action of one group on many copies of another group, somewhat analogous to exponentiation. Wreath products are used in the classification of permutation groups and also provide a way of constructing interesting examples of groups.

Given two groups and (sometimes known as the bottom and top), there exist two variants of the wreath product: the unrestricted wreath product and the restricted wreath product . The general form, denoted by or respectively, requires that acts on some set ; when unspecified, usually (a regular wreath product), though a different is sometimes implied. The two variants coincide when , , and are all finite. Either variant is also denoted as (with \wr for the LaTeX symbol) or A Ã¢Â‰Â€ H (Unicode U+2240).

The notion generalizes to semigroups and, as such, is a central construction in the Krohn–Rhodes structure theory of finite semigroups.

Definition

Let be a group and let be a group acting on a set (on the left). The direct product of with itself indexed by is the set of sequences in , indexed by , with a group operation given by pointwise multiplication. The action of on can be extended to an action on by reindexing, namely by defining

for all and all .

Then the unrestricted wreath product of by is the semidirect product with the action of on given above. The subgroup of is called the base of the wreath product.

The restricted wreath product is constructed in the same way as the unrestricted wreath product except that one uses the direct sum as the base of the wreath product. In this case, the base consists of all sequences in with finitely many non-identity entries. The two definitions coincide when is finite.

In the most common case, , and acts on itself by left multiplication. In this case, the unrestricted and restricted wreath product may be denoted by and respectively. This is called the regular wreath product.

Notation and conventions

The structure of the wreath product of by depends on the -set and in case is infinite it also depends on whether one uses the restricted or unrestricted wreath product. However, in literature the notation used may be deficient and one needs to pay attention to the circumstances.

  • In literature, may stand for the unrestricted wreath product or the restricted wreath product .
  • In literature, the -set may be omitted from the notation even if .
  • In the special case that is the symmetric group of degree , it is common in the literature to assume that (with the natural action of ) and then omit from the notation. That is, commonly denotes instead of the regular wreath product . In the first case the base group is the product of copies of , in the latter it is the product of n! copies of .

Properties

Agreement of unrestricted and restricted wreath product on finite Ω

Since the finite direct product is the same as the finite direct sum of groups, it follows that the unrestricted wreath product and the restricted wreath product are equal if is finite. In particular, this is true when and is finite.

Subgroup

is always a subgroup of .

Cardinality

If , and are finite, then

.

Universal embedding theorem

If is an extension of by , then there exists a subgroup of the unrestricted wreath product which is isomorphic to . This is also known as the Krasner–Kaloujnine embedding theorem. The Krohn–Rhodes theorem involves what is basically the semigroup equivalent of this.

Canonical actions of wreath products

If the group acts on a set then there are two canonical ways to construct sets from and on which (and therefore also ) can act.

  • The imprimitive wreath product action on :
  • : If and , then
  • ::
  • The primitive wreath product action on :
  • : An element in is a sequence indexed by the -set . Given an element , its operation on is given by
  • ::

Examples

  • The smallest non-trivial wreath product is , which is the two-dimensional case of the above hyperoctahedral group. It is the symmetry group of the square, also called , the dihedral group of order 8.
  • Let be a prime and let . Let be a Sylow p-subgroup of the symmetric group . Then is isomorphic to the iterated regular wreath product of copies of . Here and for all . For instance, the Sylow 2-subgroup of is the above group.
  • The Rubik's Cube group is a normal subgroup of index 12 in the product of wreath products, , the factors corresponding to the symmetries of the 8 corners and 12 edges.
  • The Sudoku validity-preserving transformations (VPT) group contains the double wreath product , where the factors are the permutation of rows/columns within a 3-row or 3-column band or stack (), the permutation of the bands/stacks themselves () and the transposition, which interchanges the bands and stacks (). Here, the two index sets are firstly the set of bands (resp. stacks), so , and secondly the set {bands, stacks} (so ). Accordingly, and .
  • Wreath products arise naturally in the symmetries of complete rooted trees and their graphs. For example, the repeated (iterated) wreath product is the automorphism group of a complete binary tree.

References

External links