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. The theorem states that any group extension of a group H by a group A is isomorphic to a subgroup of the regular wreath product A Wr H. The theorem is named for the fact that the group A Wr H is said to be universal with respect to all extensions of H by A.

Statement

Let H and A be groups, let K = AH be the set of all functions from H to A, and consider the action of H on itself by multiplication. This action extends naturally to an action of H on K, defined as (h⋅ϕ)(g)=ϕ(h−1g), where ϕ∈K, and g and h are both in H. This is an automorphism of K, so we can construct the semidirect product K ⋊ H, which is termed the regular wreath product, and denoted A Wr H or A≀H. The group K = AH (which is isomorphic to {(ϕ,1)∈A≀H:ϕ∈K}) is called the base group of the wreath product.

The Krasner–Kaloujnine universal embedding theorem states that if G has a normal subgroup A and H = G/A, then there is an injective homomorphism of groups θ:G→A≀H such that A maps surjectively onto im(θ)∩K. This is equivalent to the wreath product A Wr H having a subgroup isomorphic to G, where G is any extension of H by A.

Proof

This proof comes from Dixon–Mortimer.

Define a homomorphism ψ:G→H whose kernel is A. Choose a set T={tu:u∈H} of (right) coset representatives of A in G, where ψ(tu)=u. Then for all x in G, tu−1xtψ(x)−1u∈ker⁡ψ=A. For each x in G, we define a function fx:H→A such that fx(u)=tu−1xtψ(x)−1u. Then the embedding θ is given by θ(x)=(fx,ψ(x))∈A≀H.

We now prove that this is a homomorphism. If x and y are in G, then θ(x)θ(y)=(fx(ψ(x).fy),ψ(xy)). Now ψ(x).fy(u)=fy(ψ(x)−1u), so for all u in H,

fx(u)(ψ(x).fy(u))=tu−1xtψ(x)−1utψ(x)−1u−1ytψ(y)−1ψ(x)−1u=tuxytψ(xy)−1u−1,

so fx fy = fxy. Hence θ is a homomorphism as required.

The homomorphism is injective. If θ(x)=θ(y), then both fx(u) = fy(u) (for all u) and ψ(x)=ψ(y). Then tu−1xtψ(x)−1u=tu−1ytψ(y)−1u, but we can cancel tu−1 and tψ(x)−1u=tψ(y)−1u from both sides, so x = y, hence θ is injective. Finally, θ(x)∈K precisely when ψ(x)=1, in other words when x∈A (as A=ker⁡ψ).