Universal embedding theorem

From testwiki
Jump to navigation Jump to search

Template:Short description 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 multiplication. This action extends naturally to an action of Template:Math on Template:Math, defined as (h⋅ϕ)(g)=ϕ(h−1g), where ϕ∈K, and Template:Math and Template:Math are both in Template:Math This is an automorphism of Template:Math so we can construct the semidirect product Template:Math, which is termed the regular wreath product, and denoted Template:Math or A≀H. The group Template:Math (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 Template:Math has a normal subgroup Template:Math and Template:Math then there is an injective homomorphism of groups θ:G→A≀H such that Template:Math maps surjectively onto im(θ)∩K.[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 ψ:G→H whose kernel is Template:Math Choose a set T={tu:u∈H} of (right) coset representatives of Template:Math in Template:Math where ψ(tu)=u. Then for all Template:Math in Template:Math tu−1xtψ(x)−1u∈ker⁡ψ=A. For each Template:Math in Template:Math 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 Template:Math and Template:Math are in Template:Math then θ(x)θ(y)=(fx(ψ(x).fy),ψ(xy)). Now ψ(x).fy(u)=fy(ψ(x)−1u), so for all Template:Math in Template:Math

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

so Template:Math Hence θ is a homomorphism as required.

The homomorphism is injective. If θ(x)=θ(y), then both Template:Math (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 Template:Math hence θ is injective. Finally, θ(x)∈K precisely when ψ(x)=1, in other words when x∈A (as A=ker⁡ψ).

References

Template:Reflist

Bibliography