Problem
Which elements lie in the image of the Magnus–Shmelkin embedding?
F/V(R)↪B⋊(F/R),F=F(X),R⊴F.
Here V is an arbitrary group variety and B 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) be free on X={xi:i∈I}, let R⊴F, and write
Q=F/R,π:F⟶Q,ai=π(xi).
Fix a variety V of groups. Its verbal subgroup in a group H is denoted by V(H). Let
B=FV({eg,i:g∈Q, i∈I}),h⋅eg,i=ehg,i.
The verbal wreath product has the model W=B⋊Q, with multiplication
(b,q)(c,r)=(b(q⋅c),qr).(3)
The assignment xi↦(e1,i,ai) defines a homomorphism
η0:F⟶W,η0(f)=(d(f),π(f)).(4)
The Magnus–Shmelkin theorem identifies its kernel with 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 W 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). 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 R. 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 B and prove the resulting equality criterion directly. The proof uses only the universal property of relatively free groups and the cocycle identity for d.
Choose a set-theoretic section s:Q→F satisfying
π(s(g))=g,s(1)=1,(5)
and put τg=d(s(g)). Since B∈V, the assignment
ρs(eg,i)=τgeg,iτgai−1(6)
extends uniquely to an endomorphism ρs:B→B.
Theorem 1. The map η0 induces an embedding
η:F/V(R)↪B⋊Q,xiV(R)⟼(e1,i,ai).
For every section satisfying (5),
(b,q)∈η(F/V(R))⟺ρs(b)=bτq−1.(8)
Moreover, ρs2=ρs and ρs(B)=d(R).
The criterion is an equality in the given relatively free base. Neither the definition of ρs nor that of τ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)d(fh)=1,=d(f)(π(f)⋅d(h)),d(xi)d(f−1)=e1,i,=π(f)−1⋅d(f)−1.(9a)(9b)
In particular, d∣R:R→B is a homomorphism and τ1=1.
Lemma 2. For f∈F and g∈Q,
ρs(g⋅d(f))=τg(g⋅d(f))τgπ(f)−1.(10)
Consequently,
ρs(d(f))=d(f)τπ(f)−1,ρs(τg)=1.(11)
Proof. For f=xi, equation (10) is (6). For f=xi−1, the inverse identity in (9b) gives
g⋅d(xi−1)=egai−1,i−1,whose image under ρs is
(τgai−1egai−1,iτg−1)−1=τgegai−1,i−1τgai−1−1.If (10) holds for f and h, then (9b) and multiplicativity of ρ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.Word induction proves the formula. Taking g=1 gives the first identity in (11); taking f=s(g) there gives the second. ◻
Lemma 3. The endomorphism ρs is idempotent, and
ρs(B)=d(R)={b∈B:ρs(b)=b}.(15)
Proof. For g∈Q and i∈I, define the section loop
rg,i=s(g)xis(gai)−1∈R.(16)Using (9b) and (5), we obtain
d(rg,i)=τgeg,iτgai−1=ρs(eg,i).(17)The subgroup d(R) therefore contains the images under ρs of all generators of B, and hence ρs(B)⊆d(R). For r∈R, equation (11) gives ρs(d(r))=d(r). This proves both inclusions in (15) and shows that ρs fixes its image. Thus ρs2=ρs. ◻
Proof of the image criterion. If (b,q)=η0(f), then (11) gives ρs(b)=bτq−1. Conversely, suppose this equality holds. By Lemma 3, choose r∈R with d(r)=ρs(b). Then
d(rs(q))=d(r)d(s(q))=ρs(b)τq=b,π(rs(q))=q.Hence (b,q)=η0(rs(q)). This proves (8) for the image of η0; the kernel calculation below identifies that image with the stated quotient. ◻
The exact embedding kernel
We write N=V(R) as a subgroup of F. Verbal subgroups are fully invariant, so N⊴F. Let
κ:F⟶F/N,U=R/V(R),
and let j:U→F/N be the homomorphism induced by inclusion of R in F. Since U∈V, the assignment
eg,i⟼rg,iV(R)
extends to a homomorphism λ:B→U. Set L=jλ. Thus
L(eg,i)=κ(s(g))κ(xi)κ(s(gai))−1.(21)
Lemma 4. For g∈Q and f∈F,
L(g⋅d(f))=κ(s(g))κ(f)κ(s(gπ(f)))−1.(22)
Proof. For f=1 both sides are 1, and for f=xi 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.For a product fh, the cocycle identity expresses the left side as
L(g⋅d(f))L(gπ(f)⋅d(h)).The two middle factors κ(s(gπ(f)))−1 and κ(s(gπ(f))) cancel. Word induction gives (22). ◻
Proposition 5. The kernel of η0 is V(R).
Proof. The restriction d∣R is a homomorphism into the group B∈V, so it kills V(R). The second coordinate π kills R. Hence N⊆kerη0.
Conversely, if η0(f)=1, then d(f)=1 and π(f)=1. Taking g=1 in (22) and using s(1)=1 gives
1=L(d(f))=κ(f).Thus f∈N. The induced map F/N→W is injective, completing the proof of Theorem 1. ◻
References
Preprint · Lean (GitHub)
- J. McCool, On the Magnus–Smelkin embedding, Proc. Edinburgh Math. Soc. (2) 30 (1987), no. 1, 133–142, doi:10.1017/S0013091500018058.
- 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.
- 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.