Universal embedding theorem

From The Right Wiki
Jump to navigationJump 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 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 right multiplication. This action extends naturally to an action of H on K defined by ϕ(g).h=ϕ(gh1), where ϕK, and g and h are both in H. This is an automorphism of K, so we can define the semidirect product K ⋊ H called the regular wreath product, and denoted A Wr H or AH. The group K = AH (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 G has a normal subgroup A and H = G/A, then there is an injective homomorphism of groups θ:GAH such that A maps surjectively onto im(θ)K.[2] 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.[3] Define a homomorphism ψ:GH whose kernel is A. Choose a set T={tu:uH} of (right) coset representatives of A in G, where ψ(tu)=u. Then for all x in G, tuxtuψ(x)1kerψ=A. For each x in G, we define a function fxH → A 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 x and y are in G, then θ(x)θ(y)=(fx(fy.ψ(x)1),ψ(xy)). Now fy(u).ψ(x)1=fy(uψ(x)), so for all u in H,

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

Generalizations and related results

  • The Krohn–Rhodes theorem is a statement similar to the universal embedding theorem, but for semigroups. A semigroup S is a divisor of a semigroup T if it is the image of a subsemigroup of T under a homomorphism. The theorem states that every finite semigroup S is a divisor of a finite alternating wreath product of finite simple groups (each of which is a divisor of S) and finite aperiodic semigroups.
  • An alternate version of the theorem exists which requires only a group G and a subgroup A (not necessarily normal).[4] In this case, G is isomorphic to a subgroup of the regular wreath product A Wr (G/Core(A)).

References

Bibliography

  • Dixon, John; Mortimer, Brian (1996). Permutation Groups. Springer. ISBN 978-0387945996.
  • Kaloujnine, Lev; Krasner, Marc (1951a). "Produit complet des groupes de permutations et le problème d'extension de groupes II". Acta Sci. Math. Szeged. 14: 39–66.
  • Kaloujnine, Lev; Krasner, Marc (1951b). "Produit complet des groupes de permutations et le problème d'extension de groupes III". Acta Sci. Math. Szeged. 14: 69–82.
  • Praeger, Cheryl; Schneider, Csaba (2018). Permutation groups and Cartesian Decompositions. Cambridge University Press. ISBN 978-0521675062.