Universal embedding theorem

From testwiki
Jump to navigation Jump to search

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 ϕ(g).h=ϕ(gh1), where ϕK, 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 AH. The group Template:Math (which is isomorphic to {(fx,1)AH:xK}) 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 θ:GAH 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 ψ:GH whose kernel is Template:Math Choose a set T={tu:uH} of (right) coset representatives of Template:Math in Template:Math where ψ(tu)=u. Then for all Template:Math in Template:Math tuxtuψ(x)1kerψ=A. For each Template:Math in Template:Math we define a function Template:Math such that fx(u)=tuxtuψ(x)1. Then the embedding θ is given by θ(x)=(fx,ψ(x))AH.

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

fx(u)(fy(u).ψ(x))=tuxtuψ(x)1tuψ(x)ytuψ(x)ψ(y)1=tuxytuψ(xy)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 tuxtuψ(x)1=tuytuψ(y)1, but we can cancel Template:Math and tuψ(x)1=tuψ(y)1 from both sides, so Template:Math hence θ is injective. Finally, θ(x)K precisely when ψ(x)=1, in other words when xA (as A=kerψ).

References

Template:Reflist

Bibliography