The wreath product of two groups and is constructed in the following way. Let be the set of all functions defined on with values in . With respect to componentwise multiplication, this set is a group which is the complete direct product of copies of ( denotes the number of elements in ); acts on as a group of automorphisms in the following way: if , , then for . With respect to this operation, one can form the semi-direct product of and , that is, the set of all pairs , where , , with multiplication operation given by
The resulting group is called the Cartesian (or complete) wreath product of and , and is denoted by (or , a denotation of Ph. Hall). If instead of one takes the smaller group consisting of all functions with finite support, that is, functions taking only non-identity values on a finite set of points, then one obtains a subgroup of called the wreath product (direct wreath product, discrete wreath product) of and ; it is denoted by (or ). Both wreath products are widely used for constructing various examples of groups.
|||H. Neumann, "Varieties of groups" , Springer (1967)|
|[2a]||M. Krasner, L. Kaloujnine, "Produit complet des groupes de permutations et problème d'extension de groupes I" Acta Sci. Math. Szeged , 13 (1950) pp. 208–230|
|[2b]||M. Krasner, L. Kaloujnine, "Produit complet des groupes de permutations et problème d'extension de groupes II" Acta Sci. Math. Szeged , 14 (1951) pp. 39–66; 69–82|
More generally, let be a group and a permutation group, i.e. a group acting on a set (not transitively or faithfully). Consider the set all pairs
A product on this set is defined by
where (and ). This defines a group structure and the resulting group is denoted and is called the (complete) wreath product of with . If is infinite, then by taking only mappings such that , the unit element in , for almost-all one obtains the (restricted) wreath product.
In the special case where with acting on itself by the right regular permutation representation , one obtains the wreath products described above. These are often called the standard wreath product or the regular wreath product.
If is also a permutation group acting on a set , then can be seen as a permutation group acting on the set with acting as
Many natural subgroups of the symmetric groups, such as centralizers of elements, normalizers of certain subgroups, Sylow subgroups, are direct products of wreath products. For instance, the normalizer of the Young subgroup, is the wreath product . The wreath product for an arbitrary group has been called the complete monomial group of degree of , or the symmetry of degree of . The wreath products and are sometimes termed generalized symmetric groups and generalized alternating groups; is a hyper-octahedral group.
A more general standard product is the twisted wreath product, which incorporates an action of a subgroup of on , cf. [a4].
|[a1]||B. Huppert, "Endliche Gruppen" , 1 , Springer (1967) pp. §15|
|[a2]||M. Hall jr., "The theory of groups" , Macmillan (1959) pp. 81ff|
|[a3]||A. Kerber, "Representations of permutation groups" , I-II , Springer (1971–1975)|
|[a4]||M. Suzuki, "Group theory" , 1 , Springer (1982)|
The wreath product of semi-groups is a construction assigning to two semi-groups a third in the following way: The wreath product of and has as underlying set , where is the semi-group of all mappings from into under pointwise multiplication, and the operation on is given by the formula: , where the mapping is defined by . The wreath product of and is written as . This is the standard wreath product; for other definitions and generalizations of the wreath product see , , –.
The question of when inherits various properties of and has been investigated mainly for various types of simplicity (see Simple semi-group). Some examples follow. If and are ideally-simple semi-groups and is a semi-group with right cancellation, then is an ideally-simple semi-group. If and are completely-simple semi-groups and is left-simple, then is completely simple . If and are semi-groups with completely-simple kernels (see Kernel of a semi-group), then has a completely-simple kernel , and, moreover, the kernel of is equal to the square of the wreath product of the kernels . If one of is regular and the other is left-simple, then is regular . Let ; then is an inverse semi-group (cf. Inversion semi-group) (or right group) if and only if is an inverse semi-group (or right group, respectively) and is a group .
Wreath products can be used to give a compact proof of Evan's theorem that every countable semi-group can be imbedded in a semi-group with two generators , and in the case when is finitely generated and periodic it can be imbedded in a periodic semi-group with two generators.
The wreath product and its generalizations play an important role in the algebraic theory of automata. For example, they can be used to prove the theorem on the decomposition of every finite semi-group automaton into a step-by-step combination of flip-flops and simple group automata (, see also ), the so-called Krohn–Rhodes theorem.
|||B.H. Neumann, "Embedding theorems for semigroups" J. London Math. Soc. , 35 : 138 (1960) pp. 184–192|
|||K. Krohn, J. Rhodes, "Algebraic theory of machines. I Prime decomposition theorem for finite semigroups and machines" Trans. Amer. Math. Soc. , 116 (1965) pp. 450–464|
|||R.P. Hunter, "Some results on wreath products of semigroups" Bull. Soc. Math. Belgique , 18 : 1 (1966) pp. 3–16|
|||J.D., jr. McKnight, E. Sadowski, "The kernel of the wreath product of semigroups" Semigroup Forum , 4 (1972) pp. 232–236|
|||M.A. Arbib (ed.) , Algebraic theory of machines, languages and semigroups , Acad. Press (1968)|
|||Yu.G. Koshelev, "Wreath products and equations in semigroups" Semigroup Forum , 11 : 1 (1975) pp. 1–13 (In Russian) ((English abstract.))|
|||S. Nakajima, "On the kernel of the wreath product of completely simple semigroups II" , Proc. First Symp. Semigroups (Shimane Univ. Matsue, 1977) , Shimane Univ. Matsue (1977) pp. 84–88|
E.A. GolubovL.N. Shevrin
Wreath product. A.L. Shmel'kin (originator), Encyclopedia of Mathematics. URL: http://www.encyclopediaofmath.org/index.php?title=Wreath_product&oldid=15776