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.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

The universal embedding theorem, or Krasner–Kaloujnine universal embedding theorem, is a theorem from the mathematical discipline of group theory first published in 19511 by Marc Krasner and Lev Kaluznin. The theorem states that any group extension of a group by a group is isomorphic to a subgroup of the regular wreath product The theorem is named for the fact that the group is said to be universal with respect to all extensions of by

Statement

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

The Krasner–Kaloujnine universal embedding theorem states that if has a normal subgroup and then there is an injective homomorphism of groups \theta:G\to A\wr H such that maps surjectively onto \text{im}(\theta)\cap K. This is equivalent to the wreath product having a subgroup isomorphic to where is any extension of by

Proof

This proof comes from Dixon–Mortimer. Define a homomorphism \psi:G\to H whose kernel is Choose a set T=\{t_u:u\in H\} of (right) coset representatives of in where \psi(t_u)=u. Then for all in t_u^{-1} x t_{\psi(x)^{-1}u}\in\ker \psi=A. For each in we define a function f_x:H\to A such that f_x(u)=t_u^{-1} x t_{\psi(x)^{-1}u}.

Then the embedding \theta is given by \theta(x)=(f_x,\psi(x))\in A\wr H. We now prove that this is a homomorphism. If and are in then \theta(x)\theta(y)=(f_x(\psi(x).f_y),\psi(xy)).

Now \psi(x).f_y(u)=f_y(\psi(x)^{-1}u), so for all in f_x(u)(\psi(x).f_y(u)) = t_u^{-1} x t_{\psi(x)^{-1}u} t_{\psi(x)^{-1}u}^{-1} y t_{\psi(y)^{-1}\psi(x)^{-1}u}=t_u xy t^{-1}_{\psi(xy)^{-1}u}, so Hence \theta is a homomorphism as required. The homomorphism is injective.

If \theta(x)=\theta(y), then both (for all u) and \psi(x)=\psi(y). Then t_u^{-1} x t_{\psi(x)^{-1}u}=t_u^{-1} y t_{\psi(y)^{-1}u}, but we can cancel t^{-1}_{u} and t_{\psi(x)^{-1}u}=t_{\psi(y)^{-1}u} from both sides, so hence \theta is injective. Finally, \theta(x)\in K precisely when \psi(x)=1, in other words when x\in A (as A=\ker\psi ).

The Krohn–Rhodes theorem is a statement similar to the universal embedding theorem, but for semigroups. A semigroup is a divisor of a semigroup if it is the image of a subsemigroup of under a homomorphism.

The theorem states that every finite semigroup is a divisor of a finite alternating wreath product of finite simple groups (each of which is a divisor of ) and finite aperiodic semigroups. An alternate version of the theorem exists which requires only a group and a subgroup (not necessarily normal). In this case, is isomorphic to a subgroup of the regular wreath product

Text derived from https://en.wikipedia.org/w/index.php?oldid=1304650438 under CC BY-SA 4.0; modifications have been made.

References

  1. ↩Wikipedia “Universal embedding theorem” revision 1304650438 · retrieved 2026-10-20 publication date (×1) · confidence 0.95 revision URL

Provenance

snapshot enwiki-001304650438 · captured 1754551702.0 · version history

Cite this page as: encyclopegia.org, “Universal embedding theorem”, snapshot enwiki-001304650438. https://encyclopegia.org/a/universal-embedding-theorem