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 variations 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 variations coincide when , , and are all finite. Either variation is also denoted as (with \wr for the LaTeX symbol) or A ≀ H (Unicode U+2240).
The notion generalizes to semigroups and is a central construction in the Krohn–Rhodes structure theory of finite semigroups.
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.
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.
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.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications (1)
Related concepts (11)
The Rubik's Cube group is a group that represents the structure of the Rubik's Cube mechanical puzzle. Each element of the set corresponds to a cube move, which is the effect of any sequence of rotations of the cube's faces. With this representation, not only can any cube move be represented, but any position of the cube as well, by detailing the cube moves required to rotate the solved cube into that position. Indeed with the solved position as a starting point, there is a one-to-one correspondence between each of the legal positions of the Rubik's Cube and the elements of .
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 variations of the wreath product: the unrestricted wreath product and the restricted wreath product .
In mathematics, specifically group theory, given a prime number p, a p-group is a group in which the order of every element is a power of p. That is, for each element g of a p-group G, there exists a nonnegative integer n such that the product of pn copies of g, and not fewer, is equal to the identity element. The orders of different elements may be different powers of p. Abelian p-groups are also called p-primary or simply primary. A finite group is a p-group if and only if its order (the number of its elements) is a power of p.
Singular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative a
Explores constructing correlators using path integrals in quantum mechanics, focusing on the Euclidean and Minkowski spaces and the significance of imaginary time evolution.