Canonical images of B⋊AB\rtimes A in A×Aut⁡(BC⋊C)A\times\operatorname{Aut}(B^C\rtimes C) and ambient conjugacy

4.40

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.B\rtimes_\alpha A\hookrightarrow A\times\operatorname{Aut}(B^C\rtimes C),\qquad C\ne1.

This is the Cartesian regular wreath-product formulation, with the coordinate and action conventions specified below.

The canonical images

Let A,B,CA,B,C be arbitrary groups, with C≠1C\ne1. We use left conjugation cx(y)=xyx−1\mathrm c_x(y)=xyx^{-1} and composition as multiplication of automorphisms. Put

F=BC,W=F⋊C,(f,c)(h,k)=(f Tch,ck),(Tch)(x)=h(c−1x).(1) \tag{1} F=B^C,\qquad W=F\rtimes C,\qquad (f,c)(h,k)=\bigl(f\,T_ch,ck\bigr),\qquad (T_ch)(x)=h(c^{-1}x).

Thus FF is the full function group, including when CC is infinite. Write ec=(1,c)e_c=(1,c) and identify FF with {(f,1):f∈BC}\{(f,1):f\in B^C\}. For b∈Bb\in B, let

δ(b)(x)={b,x=1,1,x≠1,ub=c(δ(b),1)∈Aut⁡(W).\delta(b)(x)= \begin{cases}b,&x=1,\\1,&x\ne1,\end{cases} \qquad u_b=\mathrm c_{(\delta(b),1)}\in\operatorname{Aut}(W).

For β∈Aut⁡(B)\beta\in\operatorname{Aut}(B), define

dβ(f,c)=(β∘f,c).(3) \tag{3} d_\beta(f,c)=(\beta\circ f,c).

Put

T=Aut⁡(W),U={ub:b∈B},D={dβ:β∈Aut⁡(B)},L=UD.(4) \tag{4} T=\operatorname{Aut}(W),\qquad U=\{u_b:b\in B\},\qquad D=\{d_\beta:\beta\in\operatorname{Aut}(B)\}, \qquad L=UD.

Lemma 3 proves that LL is a subgroup and that its displayed factorization is unique.

For an action α:A→Aut⁡(B)\alpha:A\to\operatorname{Aut}(B), use the convention

(b,a)(b′,a′)=(bαa(b′),aa′)in B⋊αA.(b,a)(b',a')=(b\alpha_a(b'),aa') \quad\text{in }B\rtimes_\alpha A.

The canonical map and its image are

Φα(b,a)=(a,ubdαa),Hα=Φα(B⋊αA)≤A×T.(6) \tag{6} \Phi_\alpha(b,a)=(a,u_bd_{\alpha_a}),\qquad H_\alpha=\Phi_\alpha(B\rtimes_\alpha A)\le A\times T.

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×TH\le A\times T has the form H=HαH=H_\alpha for a unique action α:A→Aut⁡(B)\alpha:A\to\operatorname{Aut}(B) if and only if

H≤A×L,pA(H)=A,H∩({1}×T)={1}×U.(7) \tag{7} H\le A\times L,\qquad p_A(H)=A,\qquad H\cap(\{1\}\times T)=\{1\}\times U.

The subgroups U,D,LU,D,L depend only on BB and CC.

Theorem 2. For actions α,γ:A→Aut⁡(B)\alpha,\gamma:A\to\operatorname{Aut}(B),

Hα and Hγ are conjugate in A×T⟺∃ρ∈Aut⁡(B)∀a∈A,γa=ραaρ−1.(8) \tag{8} \begin{aligned} H_\alpha\text{ and }H_\gamma\text{ are conjugate in }A\times T \quad\Longleftrightarrow\quad &\exists\rho\in\operatorname{Aut}(B)\\[-2pt] &\forall a\in A,\quad\gamma_a=\rho\alpha_a\rho^{-1}. \end{aligned}

When these conditions hold, an element of {1}×D\{1\}\times D conjugates HαH_\alpha to HγH_\gamma.

The faithful wreath construction

Lemma 3. The maps b↦ubb\mapsto u_b and β↦dβ\beta\mapsto d_\beta are injective homomorphisms, and

dβubdβ−1=uβ(b).(9) \tag{9} d_\beta u_b d_\beta^{-1}=u_{\beta(b)}.

The group L=UDL=UD is isomorphic to B⋊Aut⁡(B)B\rtimes\operatorname{Aut}(B) via (b,β)↦ubdβ(b,\beta)\mapsto u_bd_\beta.

Proof. The map b↦(δ(b),1)b\mapsto(\delta(b),1) is a homomorphism, so conjugation gives a homomorphism b↦ubb\mapsto u_b. The maps dβd_\beta are automorphisms by (1), and dβdη=dβηd_\beta d_\eta=d_{\beta\eta}. Moreover,

dβ(δ(b),1)=(δ(β(b)),1),d_\beta(\delta(b),1)=(\delta(\beta(b)),1),

which gives (9).

Fix c≠1c\ne1 in CC. Direct multiplication yields

ub(ec)=(δ(b)Tcδ(b−1),c),(ub(ec))base(1)=b.(11) \tag{11} u_b(e_c)=\bigl(\delta(b)T_c\delta(b^{-1}),c\bigr), \qquad \bigl(u_b(e_c)\bigr)_{\mathrm{base}}(1)=b.

Since every dβd_\beta fixes ece_c, an equality ubdβ=ub′dβ′u_bd_\beta=u_{b'}d_{\beta'} implies b=b′b=b' by (11). Cancellation gives dβ=dβ′d_\beta=d_{\beta'}; applying these automorphisms to (δ(x),1)(\delta(x),1) and evaluating at 11 gives β(x)=β′(x)\beta(x)=\beta'(x) for all x∈Bx\in B.

Thus the factors in UDUD are unique. Equation (9) gives

(ubdβ)(ub′dβ′)=ubβ(b′)dββ′,(u_bd_\beta)(u_{b'}d_{\beta'}) =u_{b\beta(b')}d_{\beta\beta'},

so the map from the holomorph is a homomorphism. Its injectivity was just proved, and its image is LL. ◻

Proposition 4. The map Φα\Phi_\alpha in (6) is an injective homomorphism. For every a∈Aa\in A,

Hα∩({a}×T)={a}×Udαa.(13) \tag{13} H_\alpha\cap(\{a\}\times T)=\{a\}\times Ud_{\alpha_a}.

Proof. By (9),

Φα(b,a)Φα(b′,a′)=(aa′,ubdαaub′dαa′)=(aa′,ubαa(b′)dαaa′)=Φα(bαa(b′),aa′).\begin{aligned} \Phi_\alpha(b,a)\Phi_\alpha(b',a') &=\bigl(aa',u_b d_{\alpha_a}u_{b'}d_{\alpha_{a'}}\bigr)\\ &=\bigl(aa',u_{b\alpha_a(b')}d_{\alpha_{aa'}}\bigr) =\Phi_\alpha\bigl(b\alpha_a(b'),aa'\bigr). \end{aligned}

If two images are equal, their first coordinates are equal; uniqueness of UDUD factors then gives equality of their BB 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∈Aa\in A, choose (a,t)∈H(a,t)\in H. Write t=ubdβt=u_bd_\beta using t∈Lt\in L. The kernel condition gives (1,ub−1)∈H(1,u_b^{-1})\in H, and hence

(a,dβ)=(1,ub−1)(a,ubdβ)∈H.(a,d_\beta)=(1,u_b^{-1})(a,u_bd_\beta)\in H.

There is only one such β\beta. If (a,dβ)(a,d_\beta) and (a,dη)(a,d_\eta) both belong to HH, then

(1,dβ−1η)∈H,dβ−1η∈U∩D=1.(1,d_{\beta^{-1}\eta})\in H, \qquad d_{\beta^{-1}\eta}\in U\cap D=1.

Thus β=η\beta=\eta.

Define αa\alpha_a to be this unique diagonal representative. The identity of HH gives α1=1\alpha_1=1, while

(a,dαa)(a′,dαa′)=(aa′,dαaαa′)∈H(a,d_{\alpha_a})(a',d_{\alpha_{a'}}) =(aa',d_{\alpha_a\alpha_{a'}})\in H

gives αaa′=αaαa′\alpha_{aa'}=\alpha_a\alpha_{a'}. Hence α\alpha is an action. The prescribed kernel now shows that the entire fibre of HH over aa is {a}×Udαa\{a\}\times Ud_{\alpha_a}. Therefore H=HαH=H_\alpha. Uniqueness of the diagonal representative also proves uniqueness of α\alpha. ◻

Proposition 5. For actions α,γ:A→Aut⁡(B)\alpha,\gamma:A\to\operatorname{Aut}(B),

Hα∩(A×{1})=(ker⁡α)×{1},Hα∩({1}×T)={1}×U,Hα∩(A×D)={(a,dαa):a∈A},Hα∩Hγ={(a,ubdαa):αa=γa, b∈B}.\begin{align*} H_\alpha\cap(A\times\{1\}) &=(\ker\alpha)\times\{1\},\tag{18a}\\ H_\alpha\cap(\{1\}\times T) &=\{1\}\times U,\tag{18b}\\ H_\alpha\cap(A\times D) &=\{(a,d_{\alpha_a}):a\in A\},\tag{18c}\\ H_\alpha\cap H_\gamma &=\{(a,u_bd_{\alpha_a}):\alpha_a=\gamma_a,\ b\in B\}. \tag{18d} \end{align*}

Furthermore,

Hα≤Hγ⟺α=γ.(19) \tag{19} H_\alpha\le H_\gamma\quad\Longleftrightarrow\quad\alpha=\gamma.

Proof. In (13), equality ubdαa=1u_bd_{\alpha_a}=1 forces b=1b=1 and αa=1\alpha_a=1, proving (18a). Setting a=1a=1 gives (18b). If ubdαa=dβu_bd_{\alpha_a}=d_\beta, uniqueness of the factors gives b=1b=1 and β=αa\beta=\alpha_a; this proves (18c).

If ubdαa=ub′dγau_bd_{\alpha_a}=u_{b'}d_{\gamma_a}, the same uniqueness gives b=b′b=b' and αa=γa\alpha_a=\gamma_a, proving (18d). If Hα≤HγH_\alpha\le H_\gamma, apply that formula to (a,dαa)∈Hα(a,d_{\alpha_a})\in H_\alpha for each aa. Then αa=γa\alpha_a=\gamma_a for every aa, so α=γ\alpha=\gamma. The converse is immediate. ◻

Preservation of the Cartesian base

Normalizers in this section are taken in T=Aut⁡(W)T=\operatorname{Aut}(W).

Lemma 6. Suppose B≠1B\ne1. If θ∈NT(U)\theta\in N_T(U), then θ(F)=F\theta(F)=F.

Proof. For w=(f,c)∈Ww=(f,c)\in W,

(cw(δ(b),1))base(x)=f(x)δ(b)(c−1x)f(x)−1.(20) \tag{20} \bigl(\mathrm c_w(\delta(b),1)\bigr)_{\mathrm{base}}(x) =f(x)\delta(b)(c^{-1}x)f(x)^{-1}.

First, if cw∈U\mathrm c_w\in U, then c=1c=1. Indeed, suppose c≠1c\ne1 and choose b≠1b\ne1 in BB. Write cw=ud\mathrm c_w=u_d. Evaluating both sides on (δ(b),1)(\delta(b),1) at coordinate cc, the left side is f(c)bf(c)−1f(c)bf(c)^{-1} by (20); the right side is 11. This contradicts b≠1b\ne1. Naturality of inner conjugation,

θ cw θ−1=cθ(w),(21) \tag{21} \theta\,\mathrm c_w\,\theta^{-1}=\mathrm c_{\theta(w)},

therefore shows that

θ(δ(b),1)∈F(b∈B),(22) \tag{22} \theta(\delta(b),1)\in F\qquad(b\in B),

since θubθ−1∈U\theta u_b\theta^{-1}\in U.

Second, suppose CC has at least three elements. Then

cw∈NT(U)⟺w∈F.(23) \tag{23} \mathrm c_w\in N_T(U)\quad\Longleftrightarrow\quad w\in F.

For w=(f,1)w=(f,1), formula (20) gives

cw(δ(b),1)=(δ(f(1)bf(1)−1),1),\mathrm c_w(\delta(b),1) =(\delta(f(1)bf(1)^{-1}),1),

so cw\mathrm c_w normalizes UU. Conversely, suppose cw∈NT(U)\mathrm c_w\in N_T(U) and c≠1c\ne1. Choose b≠1b\ne1 and k∈C∖{1,c}k\in C\setminus\{1,c\}. There is d∈Bd\in B such that

ccw(δ(b),1)=cwubcw−1=ud.\mathrm c_{\mathrm c_w(\delta(b),1)} =\mathrm c_wu_b\mathrm c_w^{-1}=u_d.

The element cw(δ(b),1)\mathrm c_w(\delta(b),1) is supported at coordinate cc, where its value is f(c)bf(c)−1f(c)bf(c)^{-1}. Evaluate the last equality on eke_k at coordinate cc. On the left the value is f(c)bf(c)−1f(c)bf(c)^{-1}, since k≠1k\ne1; on the right it is 11, since c≠1c\ne1 and c≠kc\ne k. Again b=1b=1, a contradiction. This proves (23).

If CC has at least three elements and w∈Fw\in F, then cw∈NT(U)\mathrm c_w\in N_T(U). Since θ∈NT(U)\theta\in N_T(U), (21) gives cθ(w)∈NT(U)\mathrm c_{\theta(w)}\in N_T(U). Equation (23) yields θ(w)∈F\theta(w)\in F.

It remains to treat C={1,c}C=\{1,c\}. Every (f,1)∈F(f,1)\in F has the decomposition

(f,1)=(δ(f(1)),1) ec(δ(f(c)),1)ec−1.(26) \tag{26} (f,1)=(\delta(f(1)),1)\, e_c(\delta(f(c)),1)e_c^{-1}.

By (22), both coordinate elements have images in FF. The group FF is normal in WW, so applying θ\theta to (26) shows θ(f,1)∈F\theta(f,1)\in F.

Thus θ(F)≤F\theta(F)\le F in both cases. The same argument applies to θ−1∈NT(U)\theta^{-1}\in N_T(U) and gives equality. ◻

Corollary 7. Under the hypotheses of Lemma 6, if c≠1c\ne1 and θ(ec)=(f,k)\theta(e_c)=(f,k), then k≠1k\ne1.

Proof. If k=1k=1, then θ(ec)∈F\theta(e_c)\in F. Applying θ−1(F)=F\theta^{-1}(F)=F gives ec∈Fe_c\in F, contrary to c≠1c\ne1. ◻

Full ambient conjugacy

Proof of Theorem 2. If B=1B=1, there is just one action and one image, so the result holds. Assume B≠1B\ne1, and suppose

(g,θ)Hα(g,θ)−1=Hγ.(27) \tag{27} (g,\theta)H_\alpha(g,\theta)^{-1}=H_\gamma.

Intersecting with the second direct factor and using (18b) gives θUθ−1=U\theta U\theta^{-1}=U. Since b↦ubb\mapsto u_b is an isomorphism B→UB\to U, conjugation by θ\theta induces β∈Aut⁡(B)\beta\in\operatorname{Aut}(B) with

θubθ−1=uβ(b)(b∈B).(28) \tag{28} \theta u_b\theta^{-1}=u_{\beta(b)}\qquad(b\in B).

For a∈Aa\in A, set φa=γgag−1\varphi_a=\gamma_{gag^{-1}}. The image of (a,dαa)(a,d_{\alpha_a}) in (27) lies over gag−1gag^{-1}. By (13), there is a unique t(a)∈Bt(a)\in B such that

θdαaθ−1=ut(a)dφa.(29) \tag{29} \theta d_{\alpha_a}\theta^{-1}=u_{t(a)}d_{\varphi_a}.

Taking the induced conjugation actions on UU, equations (9) and (28) give

βαaβ−1=ct(a)φain Aut⁡(B).(30) \tag{30} \beta\alpha_a\beta^{-1}=\mathrm c_{t(a)}\varphi_a \quad\text{in }\operatorname{Aut}(B).

Indeed, for b∈Bb\in B we have

β(αa(b))=t(a)φa(β(b))t(a)−1,\beta(\alpha_a(b)) =t(a)\varphi_a(\beta(b))t(a)^{-1},

obtained by conjugating ubu_b with both sides of (29) and using injectivity of b↦ubb\mapsto u_b.

We claim that t(a)=qφa(q)−1t(a)=q\varphi_a(q)^{-1} for a fixed q∈Bq\in B. Fix c≠1c\ne1 and write

θ(ec)=(f,k),q=f(1).\theta(e_c)=(f,k),\qquad q=f(1).

Corollary 7 gives k≠1k\ne1. Every dαad_{\alpha_a} fixes ece_c, so (29) implies

ut(a)dφa(f,k)=(f,k).u_{t(a)}d_{\varphi_a}(f,k)=(f,k).

The base component on the left is

δ(t(a)) (φa∘f) Tkδ(t(a)−1).\delta(t(a))\,(\varphi_a\circ f)\,T_k\delta(t(a)^{-1}).

At coordinate 11, the last factor is 11 because k≠1k\ne1. Therefore

q=t(a)φa(q),t(a)=qφa(q)−1(a∈A).(35) \tag{35} q=t(a)\varphi_a(q),\qquad t(a)=q\varphi_a(q)^{-1}\quad(a\in A).

In particular, qq is independent of aa.

For any automorphism φ\varphi of BB,

cqφ(q)−1φ=cqφcq−1.\mathrm c_{q\varphi(q)^{-1}}\varphi =\mathrm c_q\varphi\mathrm c_q^{-1}.

Substituting (35) into (30) consequently gives

(cq−1β)αa(cq−1β)−1=φa=γgγaγg−1.(\mathrm c_q^{-1}\beta)\alpha_a(\mathrm c_q^{-1}\beta)^{-1} =\varphi_a=\gamma_g\gamma_a\gamma_g^{-1}.

Thus

ρ=γg−1cq−1βsatisfiesγa=ραaρ−1(a∈A).(38) \tag{38} \rho=\gamma_g^{-1}\mathrm c_q^{-1}\beta \quad\text{satisfies}\quad \gamma_a=\rho\alpha_a\rho^{-1}\quad(a\in A).

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.\begin{aligned} d_\rho(u_bd_{\alpha_a})d_\rho^{-1} &=u_{\rho(b)}d_{\rho\alpha_a\rho^{-1}}\\ &=u_{\rho(b)}d_{\gamma_a}. \end{aligned}

Since ρ\rho is bijective, this maps the entire fibre over aa onto the corresponding fibre of HγH_\gamma. Hence (1,dρ)Hα(1,dρ)−1=Hγ(1,d_\rho)H_\alpha(1,d_\rho)^{-1}=H_\gamma, proving both assertions. ◻

References

Preprint · Lean (GitHub)

  1. 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.
  1. 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.