Problem
Describe the images of Merzlyakov’s canonical embeddings of semidirect products, and determine when two such images are conjugate in the ambient group.
B⋊αA↪A×Aut(BC⋊C),C=1.
This is the Cartesian regular wreath-product formulation, with the coordinate and action conventions specified below.
The canonical images
Let A,B,C be arbitrary groups, with C=1. We use left conjugation cx(y)=xyx−1 and composition as multiplication of automorphisms. Put
F=BC,W=F⋊C,(f,c)(h,k)=(fTch,ck),(Tch)(x)=h(c−1x).(1)
Thus F is the full function group, including when C is infinite. Write ec=(1,c) and identify F with {(f,1):f∈BC}. For b∈B, let
δ(b)(x)={b,1,x=1,x=1,ub=c(δ(b),1)∈Aut(W).
For β∈Aut(B), define
dβ(f,c)=(β∘f,c).(3)
Put
T=Aut(W),U={ub:b∈B},D={dβ:β∈Aut(B)},L=UD.(4)
Lemma 3 proves that L is a subgroup and that its displayed factorization is unique.
For an action α:A→Aut(B), use the convention
(b,a)(b′,a′)=(bαa(b′),aa′)in B⋊αA.
The canonical map and its image are
Φα(b,a)=(a,ubdαa),Hα=Φα(B⋊αA)≤A×T.(6)
Merzlyakov’s unified embedding construction gives these maps; see (2, §3, Theorem 4). Problem 4.40 of the Kourovka Notebook asks how the resulting subgroups are situated in the ambient direct product (1). We consider its Cartesian wreath product version, with the coordinate and complement conventions specified in (1)–(6).
Theorem 1. A subgroup H≤A×T has the form H=Hα for a unique action α:A→Aut(B) if and only if
H≤A×L,pA(H)=A,H∩({1}×T)={1}×U.(7)
The subgroups U,D,L depend only on B and C.
Theorem 2. For actions α,γ:A→Aut(B),
Hα and Hγ are conjugate in A×T⟺∃ρ∈Aut(B)∀a∈A,γa=ραaρ−1.(8)
When these conditions hold, an element of {1}×D conjugates Hα to Hγ.
The faithful wreath construction
Lemma 3. The maps b↦ub and β↦dβ are injective homomorphisms, and
dβubdβ−1=uβ(b).(9)
The group L=UD is isomorphic to B⋊Aut(B) via (b,β)↦ubdβ.
Proof. The map b↦(δ(b),1) is a homomorphism, so conjugation gives a homomorphism b↦ub. The maps dβ are automorphisms by (1), and dβdη=dβη. Moreover,
dβ(δ(b),1)=(δ(β(b)),1),which gives (9).
Fix c=1 in C. Direct multiplication yields
ub(ec)=(δ(b)Tcδ(b−1),c),(ub(ec))base(1)=b.(11)Since every dβ fixes ec, an equality ubdβ=ub′dβ′ implies b=b′ by (11). Cancellation gives dβ=dβ′; applying these automorphisms to (δ(x),1) and evaluating at 1 gives β(x)=β′(x) for all x∈B.
Thus the factors in UD are unique. Equation (9) gives
(ubdβ)(ub′dβ′)=ubβ(b′)dββ′,so the map from the holomorph is a homomorphism. Its injectivity was just proved, and its image is L. ◻
Proposition 4. The map Φα in (6) is an injective homomorphism. For every a∈A,
Hα∩({a}×T)={a}×Udαa.(13)
Proof. By (9),
Φα(b,a)Φα(b′,a′)=(aa′,ubdαaub′dαa′)=(aa′,ubαa(b′)dαaa′)=Φα(bαa(b′),aa′).If two images are equal, their first coordinates are equal; uniqueness of UD factors then gives equality of their B coordinates. This proves injectivity. Formula (13) follows from (6). ◻
Recognition and intersections
Proof of Theorem 1. Formula (13) gives all three conditions in (7). Conversely, assume those conditions. Given a∈A, choose (a,t)∈H. Write t=ubdβ using t∈L. The kernel condition gives (1,ub−1)∈H, and hence
(a,dβ)=(1,ub−1)(a,ubdβ)∈H.There is only one such β. If (a,dβ) and (a,dη) both belong to H, then
(1,dβ−1η)∈H,dβ−1η∈U∩D=1.Thus β=η.
Define αa to be this unique diagonal representative. The identity of H gives α1=1, while
(a,dαa)(a′,dαa′)=(aa′,dαaαa′)∈Hgives αaa′=αaαa′. Hence α is an action. The prescribed kernel now shows that the entire fibre of H over a is {a}×Udαa. Therefore H=Hα. Uniqueness of the diagonal representative also proves uniqueness of α. ◻
Proposition 5. For actions α,γ:A→Aut(B),
Hα∩(A×{1})Hα∩({1}×T)Hα∩(A×D)Hα∩Hγ=(kerα)×{1},={1}×U,={(a,dαa):a∈A},={(a,ubdαa):αa=γa, b∈B}.(18a)(18b)(18c)(18d)
Furthermore,
Hα≤Hγ⟺α=γ.(19)
Proof. In (13), equality ubdαa=1 forces b=1 and αa=1, proving (18a). Setting a=1 gives (18b). If ubdαa=dβ, uniqueness of the factors gives b=1 and β=αa; this proves (18c).
If ubdαa=ub′dγa, the same uniqueness gives b=b′ and αa=γa, proving (18d). If Hα≤Hγ, apply that formula to (a,dαa)∈Hα for each a. Then αa=γa for every a, so α=γ. The converse is immediate. ◻
Preservation of the Cartesian base
Normalizers in this section are taken in T=Aut(W).
Lemma 6. Suppose B=1. If θ∈NT(U), then θ(F)=F.
Proof. For w=(f,c)∈W,
(cw(δ(b),1))base(x)=f(x)δ(b)(c−1x)f(x)−1.(20)First, if cw∈U, then c=1. Indeed, suppose c=1 and choose b=1 in B. Write cw=ud. Evaluating both sides on (δ(b),1) at coordinate c, the left side is f(c)bf(c)−1 by (20); the right side is 1. This contradicts b=1. Naturality of inner conjugation,
θcwθ−1=cθ(w),(21)therefore shows that
θ(δ(b),1)∈F(b∈B),(22)since θubθ−1∈U.
Second, suppose C has at least three elements. Then
cw∈NT(U)⟺w∈F.(23)For w=(f,1), formula (20) gives
cw(δ(b),1)=(δ(f(1)bf(1)−1),1),so cw normalizes U. Conversely, suppose cw∈NT(U) and c=1. Choose b=1 and k∈C∖{1,c}. There is d∈B such that
ccw(δ(b),1)=cwubcw−1=ud.The element cw(δ(b),1) is supported at coordinate c, where its value is f(c)bf(c)−1. Evaluate the last equality on ek at coordinate c. On the left the value is f(c)bf(c)−1, since k=1; on the right it is 1, since c=1 and c=k. Again b=1, a contradiction. This proves (23).
If C has at least three elements and w∈F, then cw∈NT(U). Since θ∈NT(U), (21) gives cθ(w)∈NT(U). Equation (23) yields θ(w)∈F.
It remains to treat C={1,c}. Every (f,1)∈F has the decomposition
(f,1)=(δ(f(1)),1)ec(δ(f(c)),1)ec−1.(26)By (22), both coordinate elements have images in F. The group F is normal in W, so applying θ to (26) shows θ(f,1)∈F.
Thus θ(F)≤F in both cases. The same argument applies to θ−1∈NT(U) and gives equality. ◻
Corollary 7. Under the hypotheses of Lemma 6, if c=1 and θ(ec)=(f,k), then k=1.
Proof. If k=1, then θ(ec)∈F. Applying θ−1(F)=F gives ec∈F, contrary to c=1. ◻
Full ambient conjugacy
Proof of Theorem 2. If B=1, there is just one action and one image, so the result holds. Assume B=1, and suppose
(g,θ)Hα(g,θ)−1=Hγ.(27)Intersecting with the second direct factor and using (18b) gives θUθ−1=U. Since b↦ub is an isomorphism B→U, conjugation by θ induces β∈Aut(B) with
θubθ−1=uβ(b)(b∈B).(28)For a∈A, set φa=γgag−1. The image of (a,dαa) in (27) lies over gag−1. By (13), there is a unique t(a)∈B such that
θdαaθ−1=ut(a)dφa.(29)Taking the induced conjugation actions on U, equations (9) and (28) give
βαaβ−1=ct(a)φain Aut(B).(30)Indeed, for b∈B we have
β(αa(b))=t(a)φa(β(b))t(a)−1,obtained by conjugating ub with both sides of (29) and using injectivity of b↦ub.
We claim that t(a)=qφa(q)−1 for a fixed q∈B. Fix c=1 and write
θ(ec)=(f,k),q=f(1).Corollary 7 gives k=1. Every dαa fixes ec, so (29) implies
ut(a)dφa(f,k)=(f,k).The base component on the left is
δ(t(a))(φa∘f)Tkδ(t(a)−1).At coordinate 1, the last factor is 1 because k=1. Therefore
q=t(a)φa(q),t(a)=qφa(q)−1(a∈A).(35)In particular, q is independent of a.
For any automorphism φ of B,
cqφ(q)−1φ=cqφcq−1.Substituting (35) into (30) consequently gives
(cq−1β)αa(cq−1β)−1=φa=γgγaγg−1.Thus
ρ=γg−1cq−1βsatisfiesγa=ραaρ−1(a∈A).(38)Conversely, suppose the right side of (8) holds. Equation (9) gives
dρ(ubdαa)dρ−1=uρ(b)dραaρ−1=uρ(b)dγa.Since ρ is bijective, this maps the entire fibre over a onto the corresponding fibre of Hγ. Hence (1,dρ)Hα(1,dρ)−1=Hγ, proving both assertions. ◻
References
Preprint · Lean (GitHub)
- E. I. Khukhro and V. D. Mazurov (eds.), Unsolved Problems in Group Theory: The Kourovka Notebook, 21st ed., 2026, Problem 4.40. arXiv:1401.0300.
- Yu. I. Merzlyakov, Integral representation of holomorphs of polycyclic groups, Algebra and Logic 9 (1970), 326–337. Russian original: Algebra i Logika 9, no. 5 (1970), 539–558. doi:10.1007/BF02321896.