Coordinate retractions and the image of F/V(R)↪B⋊(F/R)F/\mathcal V(R)\hookrightarrow B\rtimes(F/R)

7.58

Problem

Which elements lie in the image of the Magnus–Shmelkin embedding?

F/V(R)↪B⋊(F/R),F=F(X),R⊴F.F/\mathcal V(R)\hookrightarrow B\rtimes(F/R), \qquad F=F(X),\quad R\trianglelefteq F.

Here V\mathcal V is an arbitrary group variety and BB is the corresponding relatively free verbal base. The requested criterion is structural; an algorithm requires additional effective hypotheses.

Setup and result

Let F=F(X)F=F(X) be free on X={xi:i∈I}X=\{x_i:i\in I\}, let R⊴FR\trianglelefteq F, and write

Q=F/R,π:F⟶Q,ai=π(xi).Q=F/R,\qquad \pi:F\longrightarrow Q,\qquad a_i=\pi(x_i).

Fix a variety V\mathcal V of groups. Its verbal subgroup in a group HH is denoted by V(H)\mathcal V(H). Let

B=FV({eg,i:g∈Q, i∈I}),h⋅eg,i=ehg,i.B=F_{\mathcal V}(\{e_{g,i}:g\in Q,\ i\in I\}), \qquad h\cdot e_{g,i}=e_{hg,i}.

The verbal wreath product has the model W=B⋊QW=B\rtimes Q, with multiplication

(b,q)(c,r)=(b(q⋅c),qr).(3) \tag{3} (b,q)(c,r)=(b(q\cdot c),qr).

The assignment xi↦(e1,i,ai)x_i\mapsto(e_{1,i},a_i) defines a homomorphism

η0:F⟶W,η0(f)=(d(f),π(f)).(4) \tag{4} \eta_0:F\longrightarrow W,\qquad \eta_0(f)=(d(f),\pi(f)).

The Magnus–Shmelkin theorem identifies its kernel with V(R)\mathcal V(R). We shall include a proof in Section “The exact embedding kernel”.

Problem 7.58 of the Kourovka Notebook (3) asks which elements of WW belong to the image of the induced embedding. McCool (1, pp. 139–140) reduces this question to membership in the base image of R/V(R)R/\mathcal V(R). His equation (3.2) is necessary in general and sufficient for the abelian variety; his Corollary 5 gives an algorithm under word-problem hypotheses. Romanovskii (2, Theorem 2) gives a criterion for abelian varieties in a more general free-product setting.

The construction below uses a retraction onto the base image of RR. McCool’s free-factor decomposition (1, Theorem 1(4)) already provides the underlying structural antecedent. Here we give the retraction on the original generators of BB and prove the resulting equality criterion directly. The proof uses only the universal property of relatively free groups and the cocycle identity for dd.

Choose a set-theoretic section s:Q→Fs:Q\to F satisfying

π(s(g))=g,s(1)=1,(5) \tag{5} \pi(s(g))=g,\qquad s(1)=1,

and put τg=d(s(g))\tau_g=d(s(g)). Since B∈VB\in\mathcal V, the assignment

ρs(eg,i)=τgeg,iτgai−1(6) \tag{6} \rho_s(e_{g,i})=\tau_g e_{g,i}\tau_{ga_i}^{-1}

extends uniquely to an endomorphism ρs:B→B\rho_s:B\to B.

Theorem 1. The map η0\eta_0 induces an embedding

η:F/V(R)↪B⋊Q,xiV(R)⟼(e1,i,ai).\eta:F/\mathcal V(R)\hookrightarrow B\rtimes Q, \qquad x_i\mathcal V(R)\longmapsto(e_{1,i},a_i).

For every section satisfying (5),

(b,q)∈η(F/V(R))⟺ρs(b)=bτq−1.(8) \tag{8} (b,q)\in\eta(F/\mathcal V(R)) \quad\Longleftrightarrow\quad \rho_s(b)=b\tau_q^{-1}.

Moreover, ρs2=ρs\rho_s^2=\rho_s and ρs(B)=d(R)\rho_s(B)=d(R).

The criterion is an equality in the given relatively free base. Neither the definition of ρs\rho_s nor that of τg\tau_g uses a membership test for the embedded subgroup. No effective section or decidable equality is assumed, so the theorem asserts no unrestricted decision procedure.

The coordinate retraction

The homomorphism (4) gives

d(1)=1,d(xi)=e1,i,d(fh)=d(f)(π(f)⋅d(h)),d(f−1)=π(f)−1⋅d(f)−1.\begin{align*} d(1)&=1,& d(x_i)&=e_{1,i},\tag{9a}\\ d(fh)&=d(f)(\pi(f)\cdot d(h)),& d(f^{-1})&=\pi(f)^{-1}\cdot d(f)^{-1}.\tag{9b} \end{align*}

In particular, d∣R:R→Bd|_R:R\to B is a homomorphism and τ1=1\tau_1=1.

Lemma 2. For f∈Ff\in F and g∈Qg\in Q,

ρs(g⋅d(f))=τg(g⋅d(f))τgπ(f)−1.(10) \tag{10} \rho_s(g\cdot d(f)) =\tau_g(g\cdot d(f))\tau_{g\pi(f)}^{-1}.

Consequently,

ρs(d(f))=d(f)τπ(f)−1,ρs(τg)=1.(11) \tag{11} \rho_s(d(f))=d(f)\tau_{\pi(f)}^{-1}, \qquad \rho_s(\tau_g)=1.

Proof. For f=xif=x_i, equation (10) is (6). For f=xi−1f=x_i^{-1}, the inverse identity in (9b) gives

g⋅d(xi−1)=egai−1,i−1,g\cdot d(x_i^{-1})=e_{ga_i^{-1},i}^{-1},

whose image under ρs\rho_s is

(τgai−1egai−1,iτg−1)−1=τgegai−1,i−1τgai−1−1.(\tau_{ga_i^{-1}}e_{ga_i^{-1},i}\tau_g^{-1})^{-1} =\tau_g e_{ga_i^{-1},i}^{-1}\tau_{ga_i^{-1}}^{-1}.

If (10) holds for ff and hh, then (9b) and multiplicativity of ρs\rho_s give

ρs(g⋅d(fh))=ρs(g⋅d(f))ρs(gπ(f)⋅d(h))=τg(g⋅d(f))τgπ(f)−1τgπ(f)(gπ(f)⋅d(h))τgπ(fh)−1=τg(g⋅d(fh))τgπ(fh)−1.\begin{align*} \rho_s(g\cdot d(fh)) &=\rho_s(g\cdot d(f))\rho_s(g\pi(f)\cdot d(h))\\ &=\tau_g(g\cdot d(f))\tau_{g\pi(f)}^{-1} \tau_{g\pi(f)}(g\pi(f)\cdot d(h))\tau_{g\pi(fh)}^{-1}\\ &=\tau_g(g\cdot d(fh))\tau_{g\pi(fh)}^{-1}. \end{align*}

Word induction proves the formula. Taking g=1g=1 gives the first identity in (11); taking f=s(g)f=s(g) there gives the second. ◻

Lemma 3. The endomorphism ρs\rho_s is idempotent, and

ρs(B)=d(R)={b∈B:ρs(b)=b}.(15) \tag{15} \rho_s(B)=d(R)=\{b\in B:\rho_s(b)=b\}.

Proof. For g∈Qg\in Q and i∈Ii\in I, define the section loop

rg,i=s(g)xis(gai)−1∈R.(16) \tag{16} r_{g,i}=s(g)x_i s(ga_i)^{-1}\in R.

Using (9b) and (5), we obtain

d(rg,i)=τgeg,iτgai−1=ρs(eg,i).(17) \tag{17} d(r_{g,i})=\tau_g e_{g,i}\tau_{ga_i}^{-1}=\rho_s(e_{g,i}).

The subgroup d(R)d(R) therefore contains the images under ρs\rho_s of all generators of BB, and hence ρs(B)⊆d(R)\rho_s(B)\subseteq d(R). For r∈Rr\in R, equation (11) gives ρs(d(r))=d(r)\rho_s(d(r))=d(r). This proves both inclusions in (15) and shows that ρs\rho_s fixes its image. Thus ρs2=ρs\rho_s^2=\rho_s. ◻

Proof of the image criterion. If (b,q)=η0(f)(b,q)=\eta_0(f), then (11) gives ρs(b)=bτq−1\rho_s(b)=b\tau_q^{-1}. Conversely, suppose this equality holds. By Lemma 3, choose r∈Rr\in R with d(r)=ρs(b)d(r)=\rho_s(b). Then

d(rs(q))=d(r)d(s(q))=ρs(b)τq=b,π(rs(q))=q.d(rs(q))=d(r)d(s(q))=\rho_s(b)\tau_q=b, \qquad \pi(rs(q))=q.

Hence (b,q)=η0(rs(q))(b,q)=\eta_0(rs(q)). This proves (8) for the image of η0\eta_0; the kernel calculation below identifies that image with the stated quotient. ◻

The exact embedding kernel

We write N=V(R)N=\mathcal V(R) as a subgroup of FF. Verbal subgroups are fully invariant, so N⊴FN\trianglelefteq F. Let

κ:F⟶F/N,U=R/V(R),\kappa:F\longrightarrow F/N, \qquad U=R/\mathcal V(R),

and let j:U→F/Nj:U\to F/N be the homomorphism induced by inclusion of RR in FF. Since U∈VU\in\mathcal V, the assignment

eg,i⟼rg,iV(R)e_{g,i}\longmapsto r_{g,i}\mathcal V(R)

extends to a homomorphism λ:B→U\lambda:B\to U. Set L=jλL=j\lambda. Thus

L(eg,i)=κ(s(g))κ(xi)κ(s(gai))−1.(21) \tag{21} L(e_{g,i})=\kappa(s(g))\kappa(x_i)\kappa(s(ga_i))^{-1}.

Lemma 4. For g∈Qg\in Q and f∈Ff\in F,

L(g⋅d(f))=κ(s(g))κ(f)κ(s(gπ(f)))−1.(22) \tag{22} L(g\cdot d(f))=\kappa(s(g))\kappa(f)\kappa(s(g\pi(f)))^{-1}.

Proof. For f=1f=1 both sides are 11, and for f=xif=x_i the formula is (21). For an inverse generator,

L(g⋅d(xi−1))=L(egai−1,i)−1=κ(s(g))κ(xi)−1κ(s(gai−1))−1.\begin{align*} L(g\cdot d(x_i^{-1})) &=L(e_{ga_i^{-1},i})^{-1}\\ &=\kappa(s(g))\kappa(x_i)^{-1}\kappa(s(ga_i^{-1}))^{-1}. \end{align*}

For a product fhfh, the cocycle identity expresses the left side as

L(g⋅d(f))L(gπ(f)⋅d(h)).L(g\cdot d(f))L(g\pi(f)\cdot d(h)).

The two middle factors κ(s(gπ(f)))−1\kappa(s(g\pi(f)))^{-1} and κ(s(gπ(f)))\kappa(s(g\pi(f))) cancel. Word induction gives (22). ◻

Proposition 5. The kernel of η0\eta_0 is V(R)\mathcal V(R).

Proof. The restriction d∣Rd|_R is a homomorphism into the group B∈VB\in\mathcal V, so it kills V(R)\mathcal V(R). The second coordinate π\pi kills RR. Hence N⊆ker⁡η0N\subseteq\ker\eta_0.

Conversely, if η0(f)=1\eta_0(f)=1, then d(f)=1d(f)=1 and π(f)=1\pi(f)=1. Taking g=1g=1 in (22) and using s(1)=1s(1)=1 gives

1=L(d(f))=κ(f).1=L(d(f))=\kappa(f).

Thus f∈Nf\in N. The induced map F/N→WF/N\to W is injective, completing the proof of Theorem 1. ◻

References

Preprint · Lean (GitHub)

  1. J. McCool, On the Magnus–Smelkin embedding, Proc. Edinburgh Math. Soc. (2) 30 (1987), no. 1, 133–142, doi:10.1017/S0013091500018058.
  1. N. S. Romanovskii, On Shmel’kin embeddings for abstract and profinite groups, Algebra i Logika 38 (1999), no. 5, 598–612 (Russian); English translation, Algebra and Logic 38 (1999), 326–334, https://www.mathnet.ru/eng/al2483.
  1. E. I. Khukhro and V. D. Mazurov (eds.), The Kourovka Notebook: Unsolved problems in group theory, 21st ed., September 2026 update, Problem 7.58, arXiv:1401.0300v46.