Universal embedding theorem
The universal embedding theorem, or Krasner–Kaloujnine universal embedding theorem, is a theorem from the mathematical discipline of group theory first published in 1951 by Marc Krasner and Lev Kaluznin.[1] The theorem states that any group extension of a group Template:Math by a group Template:Math is isomorphic to a subgroup of the regular wreath product Template:Math The theorem is named for the fact that the group Template:Math is said to be universal with respect to all extensions of Template:Math by Template:Math
Statement
Let Template:Math and Template:Math be groups, let Template:Math be the set of all functions from Template:Math to Template:Math and consider the action of Template:Math on itself by right multiplication. This action extends naturally to an action of Template:Math on Template:Math defined by where and Template:Math and Template:Math are both in Template:Math This is an automorphism of Template:Math so we can define the semidirect product Template:Math called the regular wreath product, and denoted Template:Math or The group Template:Math (which is isomorphic to ) is called the base group of the wreath product.
The Krasner–Kaloujnine universal embedding theorem states that if Template:Math has a normal subgroup Template:Math and Template:Math then there is an injective homomorphism of groups such that Template:Math maps surjectively onto [2] This is equivalent to the wreath product Template:Math having a subgroup isomorphic to Template:Math where Template:Math is any extension of Template:Math by Template:Math
Proof
This proof comes from Dixon–Mortimer.[3]
Define a homomorphism whose kernel is Template:Math Choose a set of (right) coset representatives of Template:Math in Template:Math where Then for all Template:Math in Template:Math For each Template:Math in Template:Math we define a function Template:Math such that Then the embedding is given by
We now prove that this is a homomorphism. If Template:Math and Template:Math are in Template:Math then Now so for all Template:Math in Template:Math
so Template:Math Hence is a homomorphism as required.
The homomorphism is injective. If then both Template:Math (for all u) and Then but we can cancel Template:Math and from both sides, so Template:Math hence is injective. Finally, precisely when in other words when (as ).
Generalizations and related results
- The Krohn–Rhodes theorem is a statement similar to the universal embedding theorem, but for semigroups. A semigroup Template:Math is a divisor of a semigroup Template:Math if it is the image of a subsemigroup of Template:Math under a homomorphism. The theorem states that every finite semigroup Template:Math is a divisor of a finite alternating wreath product of finite simple groups (each of which is a divisor of Template:Math) and finite aperiodic semigroups.
- An alternate version of the theorem exists which requires only a group Template:Math and a subgroup Template:Math (not necessarily normal).[4] In this case, Template:Math is isomorphic to a subgroup of the regular wreath product Template:Math