Wreath product

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Sidebar with collapsible lists 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 A and H (sometimes known as the bottom and top[1]), there exist two variants of the wreath product: the unrestricted wreath product A Wr H and the restricted wreath product A wr H. The general form, denoted by A WrΩH or A wrΩH respectively, requires that H acts on some set Ω; when unspecified, usually Ω=H (a regular wreath product), though a different Ω is sometimes implied. The two variants coincide when A, H, and Ω are all finite. Either variant is also denoted as A≀H (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 A be a group and let H be a group acting on a set Ω (on the left). The direct product AΩ of A with itself indexed by Ω is the set of sequences a‾=(aω)ω∈Ω in A, indexed by Ω, with a group operation given by pointwise multiplication. The action of H on Ω can be extended to an action on AΩ by reindexing, namely by defining

h⋅(aω)ω∈Ω:=(ah−1⋅ω)ω∈Ω

for all h∈H and all (aω)ω∈Ω∈AΩ.

Then the unrestricted wreath product A WrΩH of A by H is the semidirect product AΩ⋊H with the action of H on AΩ given above. The subgroup AΩ of AΩ⋊H is called the base of the wreath product.

The restricted wreath product A wrΩH 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 AΩ with finitely many non-identity entries. The two definitions coincide when Ω is finite.

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

Notation and conventions

The structure of the wreath product of A by H depends on the H-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, A≀ΩH may stand for the unrestricted wreath product AWrΩH or the restricted wreath product AwrΩH.
  • In literature, the H-set Ω may be omitted from the notation even if Ω≠H.
  • In the special case that H=Sn is the symmetric group of degree n, it is common in the literature to assume that Ω={1,…,n} (with the natural action of Sn) and then omit Ω from the notation. That is, A≀Sn commonly denotes A≀{1,…,n}Sn instead of the regular wreath product A≀SnSn. In the first case the base group is the product of n copies of A, in the latter it is the product of n! copies of A.

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 AWrΩH and the restricted wreath product AwrΩH are equal if Ω is finite. In particular, this is true when Ω=H and H is finite.

Subgroup

AwrΩH is always a subgroup of AWrΩH.

Cardinality

If A, H and Ω are finite, then

|A≀ΩH|=|A||Ω||H|.[2]

Universal embedding theorem

Template:Main If G is an extension of A by H, then there exists a subgroup of the unrestricted wreath product A≀H which is isomorphic to G.[3] This is also known as the Krasner–Kaloujnine embedding theorem. The Krohn–Rhodes theorem involves what is basically the semigroup equivalent of this.[4]

Canonical actions of wreath products

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

  • The imprimitive wreath product action on Λ×Ω:
    If ((aω),h)∈AWrΩH and (λ,ω′)∈Λ×Ω, then
    ((aω),h)⋅(λ,ω′):=(ah(ω′)λ,hω′).
  • The primitive wreath product action on ΛΩ:
    An element in ΛΩ is a sequence (λω) indexed by the H-set Ω. Given an element ((aω),h)∈AWrΩH, its operation on (λω)∈ΛΩ is given by
    ((aω),h)⋅(λω):=(ah−1ωλh−1ω).

Examples

  • The lamplighter group is the restricted wreath product C2≀ℤ.
  • The generalized symmetric group is Cm≀Sn. The base of this wreath product is the n-fold direct product Cmn=Cm×⋯×Cm, where the action ϕ:Sn→Aut(Cmn) of the symmetric group Sn is given by ϕ(σ)(α1,…,αn)=(ασ(1),…,ασ(n)).[5]
  • The smallest non-trivial wreath product is C2≀C2, which is the two-dimensional case of the above hyperoctahedral group. It is the symmetry group of the square, also called D8, the dihedral group of order 8.
  • Let p be a prime and let n≥1. Let P be a Sylow p-subgroup of the symmetric group Spn. Then P is isomorphic to the iterated regular wreath product Wn=Cp≀⋯≀Cp of n copies of Cp. Here W1=Cp and Wk=Wk−1≀Cp for all k≥2.[7][8] For instance, the Sylow 2-subgroup of S4 is the above C2≀C2 group.
  • The Rubik's Cube group is a normal subgroup of index 12 in the product of wreath products, (C3≀S8)×(C2≀S12), 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 (S3≀S3)≀S2, where the factors are the permutation of rows/columns within a 3-row or 3-column band or stack (S3), the permutation of the bands/stacks themselves (S3) and the transposition, which interchanges the bands and stacks (S2). Here, the two index sets Ω1,Ω2 are firstly the set of bands (resp. stacks), so |Ω1|=3, and secondly the set {bands, stacks} (so |Ω2|=2). Accordingly, |S3≀S3|=|S3|3|S3|=64 and |(S3≀S3)≀S2|=|S3≀S3|2|S2|=68×2.
  • Wreath products arise naturally in the symmetries of complete rooted trees and their graphs. For example, the repeated (iterated) wreath product S2≀S2≀⋯≀S2 is the automorphism group of a complete binary tree.

References

Template:Reflist

  1. ↑ Template:Citation
  2. ↑ Joseph J. Rotman, An Introduction to the Theory of Groups, p. 172 (1995)
  3. ↑ M. Krasner and L. Kaloujnine, "Produit complet des groupes de permutations et le problème d'extension de groupes III", Acta Sci. Math. 14, pp. 69–82 (1951)
  4. ↑ Template:Cite book
  5. ↑ J. W. Davies and A. O. Morris, "The Schur Multiplier of the Generalized Symmetric Group", J. London Math. Soc. (2), 8, (1974), pp. 615–620
  6. ↑ P. Graczyk, G. Letac and H. Massam, "The Hyperoctahedral Group, Symmetric Group Representations and the Moments of the Real Wishart Distribution", J. Theoret. Probab. 18 (2005), no. 1, 1–42.
  7. ↑ Joseph J. Rotman, An Introduction to the Theory of Groups, p. 176 (1995)
  8. ↑ L. Kaloujnine, "La structure des p-groupes de Sylow des groupes symétriques finis", Annales Scientifiques de l'École Normale Supérieure. Troisième Série 65, pp. 239–276 (1948)