All-arity identities of two-generated metabelian groups via (n,I)(n,I) in Z[X±1,Y±1]\mathbb Z[X^{\pm1},Y^{\pm1}]

8.54(b)

Problem

Describe all identities of groups generated by at most two elements with abelian derived subgroup; equivalently, classify the varieties they generate.

G=⟨x,y⟩,G′′=1,Id⁡(G)⊆⋃n<ωFn.G=\langle x,y\rangle,\quad G''=1, \qquad \operatorname{Id}(G)\subseteq\bigcup_{n<\omega}F_n.

Identities in every finite number of variables are required, not only words in the chosen two generators.

Setup and result

For a group GG, let Id(G)\mathrm{Id}(G) denote the set of all group words, in arbitrary finite numbers of variables, that are identities in GG. The variety var(G)\mathrm{var}(G) consists of the groups satisfying Id(G)\mathrm{Id}(G). Kourovka Problem 8.54(b), posed by Olshanskii, asks for a description of the identities of two-generated metabelian groups, or equivalently for a classification of the varieties they generate (4). Throughout, two-generated means generated by at most two elements.

Cohen proved that every metabelian variety has a finite basis of identities (3); Vaughan-Lee subsequently extended the finite-basis argument to other varieties (5). A finite basis need not consist of words in two variables. The present restriction concerns the number of generators of a group generating the variety, while the identities under consideration retain arbitrary finite arity. Bryce’s structural work on metabelian varieties separates torsion-free and finite-exponent components (2). Here the parameters are an exponent and an ideal in an integral Laurent ring, with explicit conditions for their admissibility.

Put M=F2/F2′′M=F_2/F_2'', with generators a,ba,b, and use the convention [x,y]=xyx−1y−1[x,y]=xyx^{-1}y^{-1}. Its derived subgroup is a free cyclic module over

R=Z[X±1,Y±1],R=\mathbb Z[X^{\pm1},Y^{\pm1}],

where XX and YY act by conjugation by aa and bb, respectively. Write cfc^f for the element corresponding to f∈Rf\in R, with c=[a,b]c=[a,b]. The Laurent description of M′M' is classical; a treatment through the winding invariant is given in (1, Theorem 14).

The classification has two steps. First, full invariance of cI≤M′c^I\le M' becomes three substitution conditions on II. Although the substitutions involve four arbitrary integers, two-sided recurrences reduce them to finitely many tests for each generator of II. Second, a fully invariant subgroup of MM may also contain powers outside M′M'. Four integral conditions specify exactly when these powers can be imposed without changing the ideal II.

For r∈Zr\in\mathbb Z and a unit UU, define

Sr(U)={1+U+⋯+Ur−1,r>0,0,r=0,−UrS−r(U),r<0.(U−1)Sr(U)=Ur−1.(2) \tag{2} S_r(U)= \begin{cases} 1+U+\cdots+U^{r-1},&r>0,\\ 0,&r=0,\\ -U^r S_{-r}(U),&r<0. \end{cases} \qquad (U-1)S_r(U)=U^r-1.

For p=(s,t,u,v)∈Z4p=(s,t,u,v)\in\mathbb Z^4, set

αp=XsYt,βp=XuYv,Dp=XuSs(X)Sv(Y)−XsSu(X)St(Y).(3) \tag{3} \alpha_p=X^sY^t,\qquad \beta_p=X^uY^v,\qquad D_p=X^uS_s(X)S_v(Y)-X^sS_u(X)S_t(Y).

Define Tn∈RT_n\in R for n≥0n\ge0 recursively by

T0=0,Tn+1=Sn(X)+XYTn.(4) \tag{4} T_0=0,\qquad T_{n+1}=S_n(X)+XYT_n.

Definition 1. A pair (n,I)(n,I), with n≥0n\ge0 and I⊲RI\lhd R, is admissible if

n,Sn(X),Sn(Y),Tn ∈I(5) \tag{5} n,\quad S_n(X),\quad S_n(Y),\quad T_n\ \in I

and, for every f∈If\in I and p∈Z4p\in\mathbb Z^4,

Dpf(αp,βp)∈I,(αp−1)f(αp,βp)∈I,(βp−1)f(αp,βp)∈I.(6) \tag{6} \begin{aligned} D_p f(\alpha_p,\beta_p)&\in I,\\ (\alpha_p-1)f(\alpha_p,\beta_p)&\in I,\\ (\beta_p-1)f(\alpha_p,\beta_p)&\in I. \end{aligned}

For an admissible pair, put

G(n,I)=M/⟨ ⁣⟨cI,an,bn⟩ ⁣⟩.(7) \tag{7} G(n,I)=M/\langle\!\langle c^I,a^n,b^n\rangle\!\rangle.

The power conditions are vacuous when n=0n=0.

Here f(αp,βp)f(\alpha_p,\beta_p) is evaluation in RR; both arguments are units. The notation cIc^I denotes the subgroup {cf:f∈I}\{c^f:f\in I\}. The normal closure in (7) is taken in MM.

Theorem 2. Every two-generated metabelian group HH has the same identities as G(n,I)G(n,I) for a unique admissible pair (n,I)(n,I). Conversely, each admissible pair defines a two-generated metabelian group. Moreover,

Id(G(n,I))=Id(G(m,J))⟺n=m and I=J.\mathrm{Id}(G(n,I))=\mathrm{Id}(G(m,J)) \quad\Longleftrightarrow\quad n=m\ \text{and}\ I=J.

The derived subgroup of G(n,I)G(n,I) is isomorphic to the additive group of R/IR/I. If n>0n>0, then G(n,I)G(n,I) has exponent exactly nn; if n=0n=0, the image of aa has infinite order.

Theorem 3. Every ideal I⊲RI\lhd R has a finite set of generators EE. In Definition 1, condition (6) is equivalent to its restriction to

f∈E,p∈{0,…,6∣supp(f)∣−1}4.(9) \tag{9} f\in E,\qquad p\in\{0,\ldots,6|\mathrm{supp}(f)|-1\}^4.

Thus admissibility of the finite data (n,E)(n,E) is specified by finitely many memberships in the ideal (E)(E). Two such data define the same identities precisely when their integers and their generated ideals agree.

The tests retain the integral ideal II throughout. In particular, no saturation or extension of scalars occurs in the passage from (6) to (9).

Coordinates in the free metabelian group

Consider triples (z;p,q)(z;p,q) with z∈R×z\in R^\times and p,q∈Rp,q\in R, under multiplication

(z;p,q)(w;r,s)=(zw;p+zr,q+zs).(10) \tag{10} (z;p,q)(w;r,s)=(zw;p+zr,q+zs).

The images of the free generators are

a=(X;1,0),b=(Y;0,1).a=(X;1,0),\qquad b=(Y;0,1).

They satisfy the row relation

(X−1)p+(Y−1)q=z−1.(12) \tag{12} (X-1)p+(Y-1)q=z-1.

Their commutator is (1;1−Y,X−1)(1;1-Y,X-1).

Lemma 4. For p,q∈Rp,q\in R,

(X−1)p+(Y−1)q=0⟺(p,q)=((1−Y)f,(X−1)f)(X-1)p+(Y-1)q=0 \quad\Longleftrightarrow\quad (p,q)=((1-Y)f,(X-1)f)

for a unique f∈Rf\in R.

Proof. Reduce the equation modulo X−1X-1. The quotient is Z[Y±1]\mathbb Z[Y^{\pm1}], an integral domain, and Y−1Y-1 is nonzero in it. Hence q=(X−1)fq=(X-1)f for some f∈Rf\in R. Substitution and cancellation of X−1X-1 give p=(1−Y)fp=(1-Y)f. Cancellation also gives uniqueness. The reverse implication follows by multiplication. ◻

Proposition 5. The above homomorphism from F2F_2 has kernel F2′′F_2''. Its image consists exactly of the triples satisfying (12) with z=XrYsz=X^rY^s, r,s∈Zr,s\in\mathbb Z. Under this identification,

cf=(1;(1−Y)f,(X−1)f),M′={cf:f∈R},(14) \tag{14} c^f=(1;(1-Y)f,(X-1)f),\qquad M'=\{c^f:f\in R\},

and every element of MM has a unique expression arbscfa^r b^s c^f.

Proof. The kernel assertion is the rank-two case of the Magnus embedding theorem, equivalently the kernel theorem for the winding invariant (1, Theorem 14). We describe the image explicitly. The powers of the generators give

arbs=(XrYs;Sr(X),XrSs(Y)).a^r b^s=(X^rY^s;S_r(X),X^rS_s(Y)).

For any triple satisfying (12) with this linear coordinate, division by arbsa^r b^s on the left gives a triple with linear coordinate 11. Lemma 4 identifies it uniquely with cfc^f.

The elements in (14) belong to the subgroup generated by a,ba,b: integer multiples and sums of Laurent monomials correspond to products of conjugates of cc and their inverses. Thus every compatible triple is in the image. The linear coordinate is abelian, so M′M' is contained in its kernel. Conversely, all cfc^f lie in M′M', giving (14). Injectivity of (r,s)↦XrYs(r,s)\mapsto X^rY^s and Lemma 4 give uniqueness of the normal form. ◻

In particular,

cf+g=cfcg,acfa−1=cXf,bcfb−1=cYf.(16) \tag{16} c^{f+g}=c^fc^g,\qquad ac^fa^{-1}=c^{Xf},\qquad bc^fb^{-1}=c^{Yf}.

It follows that I↦cII\mapsto c^I is a bijection between ideals of RR and normal subgroups of MM contained in M′M'.

Lemma 6. Every endomorphism ϕ\phi of MM has the form

ϕ(a)=asbtch,ϕ(b)=aubvck\phi(a)=a^s b^t c^h,\qquad \phi(b)=a^u b^v c^k

for p=(s,t,u,v)∈Z4p=(s,t,u,v)\in\mathbb Z^4 and h,k∈Rh,k\in R. On M′M' it acts by

ϕ(cf)=c f(αp,βp)[Dp+αp(1−βp)h+βp(αp−1)k].(18) \tag{18} \phi(c^f)=c^{\,f(\alpha_p,\beta_p) [D_p+\alpha_p(1-\beta_p)h+\beta_p(\alpha_p-1)k]}.

Proof. The normal form gives the stated images, and the universal property of MM allows every such choice. Formula (10) gives

[(z;p,q),(w;r,s)]=(1;(1−w)p+(z−1)r,(1−w)q+(z−1)s).[(z;p,q),(w;r,s)] =(1;(1-w)p+(z-1)r,(1-w)q+(z-1)s).

Applying this first to asbt,aubva^s b^t,a^u b^v gives cDpc^{D_p}. Adding the two commutator factors gives

ϕ(c)=cDp+αp(1−βp)h+βp(αp−1)k.\phi(c)=c^{D_p+\alpha_p(1-\beta_p)h+\beta_p(\alpha_p-1)k}.

Conjugation by ϕ(a)\phi(a) and ϕ(b)\phi(b) multiplies Laurent coordinates by αp\alpha_p and βp\beta_p. Extend from Laurent monomials to their integral linear combinations using (16) to obtain (18). ◻

Proposition 7. The subgroup cIc^I is fully invariant in MM if and only if (6) holds. For I=(E)I=(E), it is enough to impose those conditions for f∈Ef\in E.

Proof. If the conditions hold, formula (18) places every ϕ(cf)\phi(c^f) in cIc^I. Conversely, take (h,k)=(0,0),(1,0),(0,1)(h,k)=(0,0),(1,0),(0,1) and subtract the resulting Laurent coefficients. Since αp\alpha_p and βp\beta_p are units, one obtains all three memberships in (6).

For fixed pp, each multiplier in (6) is fixed, and Laurent evaluation is a ring homomorphism. If a condition holds for f1,f2f_1,f_2, it holds for f1+f2f_1+f_2 and for rf1rf_1, r∈Rr\in R. The polynomials satisfying all conditions therefore form an ideal. This proves the assertion about generators. ◻

Finite substitution boxes

We use a recurrence argument over a general integral domain AA. Let J⊲AJ\lhd A, let uji∈A×u_{ji}\in A^\times, and put

E(x)=∑j=1daj∏i=1kujixi(x∈Zk).(21) \tag{21} E(x)=\sum_{j=1}^{d} a_j\prod_{i=1}^{k}u_{ji}^{x_i} \qquad(x\in\mathbb Z^k).

Lemma 8. Suppose F:Zk→AF:\mathbb Z^k\to A and 0≠δ∈A0\ne\delta\in A satisfy δF(x)=E(x)\delta F(x)=E(x). If F(x)∈JF(x)\in J for all x∈{0,…,d−1}kx\in\{0,\ldots,d-1\}^k, then F(x)∈JF(x)\in J for every x∈Zkx\in\mathbb Z^k.

Proof. Let τi\tau_i denote translation by the iith coordinate vector. The monic polynomial

Pi(T)=∏j=1d(T−uji)P_i(T)=\prod_{j=1}^{d}(T-u_{ji})

annihilates EE under T=τiT=\tau_i. Its constant coefficient is a unit. From

δPi(τi)F=Pi(τi)E=0\delta P_i(\tau_i)F=P_i(\tau_i)E=0

we obtain Pi(τi)F=0P_i(\tau_i)F=0 by cancellation in AA. Thus FF satisfies a recurrence of length dd in each coordinate, with unit first and last coefficients. Membership of dd consecutive values in JJ propagates forward using the leading coefficient and backward using the constant coefficient. Apply this successively in all coordinates. If d=0d=0, then E=0E=0 and cancellation gives F=0F=0 directly. ◻

Cancellation here precedes reduction modulo JJ. No regularity of the image of δ\delta in A/JA/J is required.

Proof of Theorem 3. The ring RR is Noetherian: it is the image of the polynomial ring Z[U1,U2,U3,U4]\mathbb Z[U_1,U_2,U_3,U_4] under

(U1,U2,U3,U4)⟼(X,Y,X−1,Y−1).(U_1,U_2,U_3,U_4)\longmapsto(X,Y,X^{-1},Y^{-1}).

Choose a finite ideal generating set EE. Proposition 7 reduces (6) to these generators.

Fix f∈Ef\in E and write m=∣supp(f)∣m=|\mathrm{supp}(f)|. Each monomial of f(αp,βp)f(\alpha_p,\beta_p) is an exponential term in the four integer coordinates s,t,u,vs,t,u,v. There are mm such terms. Multiplication by αp−1\alpha_p-1 or βp−1\beta_p-1 gives a sum of 2m2m exponential terms, all with unit rates.

For the remaining multiplier, put δ=(X−1)(Y−1)≠0\delta=(X-1)(Y-1)\ne0. Direct expansion of (3) yields

δDp=Xs+uYv−XuYv+Xu−Xs+uYt+XsYt−Xs.(25) \tag{25} \begin{aligned} \delta D_p={}&X^{s+u}Y^v-X^uY^v+X^u\\ &-X^{s+u}Y^t+X^sY^t-X^s. \end{aligned}

Consequently, δDpf(αp,βp)\delta D_p f(\alpha_p,\beta_p) is a sum of 6m6m exponential terms. Apply Lemma 8 with A=RA=R and J=IJ=I to Dpf(αp,βp)D_p f(\alpha_p,\beta_p). Apply it with δ=1\delta=1 to the other two expressions. The box of side 6m6m includes the needed boxes of side 2m2m, proving sufficiency. Necessity is immediate. The uniqueness assertion follows from Theorem 2. ◻

Power relations and fully invariant subgroups

Let NN be a fully invariant subgroup of MM. It is normal because inner automorphisms are endomorphisms. Define

n=ord⁡M/N(aN),I={f∈R:cf∈N},(26) \tag{26} n=\operatorname{ord}_{M/N}(aN),\qquad I=\{f\in R:c^f\in N\},

where order zero denotes infinite order. Substitution a↦g,b↦1a\mapsto g,b\mapsto1 shows that

gn∈N(g∈M).(27) \tag{27} g^n\in N\qquad(g\in M).

Lemma 9. With the parameters in (26),

arbscf∈N⟺n∣r,n∣s,f∈I.(28) \tag{28} a^r b^s c^f\in N \quad\Longleftrightarrow\quad n\mid r,\quad n\mid s,\quad f\in I.

Here 0∣r0\mid r means r=0r=0. In particular, NN is determined by (n,I)(n,I).

Proof. Apply the retractions (a,b)↦(a,1)(a,b)\mapsto(a,1) and (a,b)↦(1,a)(a,b)\mapsto(1,a) to an element of NN in normal form. They kill M′M' and give ar,as∈Na^r,a^s\in N. Hence n∣r,sn\mid r,s. Substitution also gives bs∈Nb^s\in N, and cancellation in NN gives cf∈Nc^f\in N. Conversely, if n∣r,sn\mid r,s and cf∈Nc^f\in N, the two power factors belong to NN by (27), so their product with cfc^f belongs to NN. ◻

The intersection N∩M′=cIN\cap M'=c^I is fully invariant. Thus II satisfies (6) by Proposition 7. To recover the remaining conditions, we use the exact power formula.

Lemma 10. For every n≥0n\ge0,

[an,b]=cSn(X),[a,bn]=cSn(Y),(ab)n=c−XTnanbn.(29) \tag{29} [a^n,b]=c^{S_n(X)},\qquad [a,b^n]=c^{S_n(Y)},\qquad (ab)^n=c^{-XT_n}a^nb^n.

Proof. The commutator formulas follow from the affine coordinates of an,bna^n,b^n. For the product power, define over a commutative ring

C0(U,V)=0,Cn+1(U,V)=Sn(U)+UVCn(U,V).C_0(U,V)=0,\qquad C_{n+1}(U,V)=S_n(U)+UV C_n(U,V).

Induction on nn gives

Sn(UV)=Sn(U)+U(V−1)Cn(U,V),USn(UV)=UnSn(V)−U(U−1)Cn(U,V).\begin{align*} S_n(UV)&=S_n(U)+U(V-1)C_n(U,V),\\ U S_n(UV)&=U^nS_n(V)-U(U-1)C_n(U,V). \end{align*}

Now (ab)n=(XnYn;Sn(XY),XSn(XY))(ab)^n=(X^nY^n;S_n(XY),X S_n(XY)). Since Cn(X,Y)=TnC_n(X,Y)=T_n, the two displayed identities identify this with c−XTnanbnc^{-XT_n}a^nb^n. ◻

Proposition 11. The parameters recovered from a fully invariant subgroup are admissible.

Proof. Apply (27) to cc: since cn=cn⋅1c^n=c^{n\cdot1}, we obtain n∈In\in I. The first two formulas in (29), together with an,bn∈Na^n,b^n\in N, give Sn(X),Sn(Y)∈IS_n(X),S_n(Y)\in I. The third gives −XTn∈I-XT_n\in I because (ab)n,an,bn∈N(ab)^n,a^n,b^n\in N. As −X-X is a unit, Tn∈IT_n\in I. Full invariance of cIc^I supplies the substitution conditions. ◻

Proposition 12. For every admissible pair (n,I)(n,I), the subgroup

N(n,I)=⟨ ⁣⟨cI,an,bn⟩ ⁣⟩N(n,I)=\langle\!\langle c^I,a^n,b^n\rangle\!\rangle

is fully invariant. Its recovered parameters are (n,I)(n,I), and

N(n,I)∩M′=cI.N(n,I)\cap M'=c^I.

Proof. First form Q=M/cIQ=M/c^I. By Proposition 7, cIc^I is fully invariant. The conditions Sn(X),Sn(Y)∈IS_n(X),S_n(Y)\in I and Lemma 10 show that an,bna^n,b^n are central in QQ. Let C=⟨an,bn⟩≤QC=\langle a^n,b^n\rangle\le Q.

The linear-coordinate homomorphism Q→R×Q\to R^\times sends

(an)r(bn)s⟼XnrYns.(34) \tag{34} (a^n)^r(b^n)^s\longmapsto X^{nr}Y^{ns}.

Its restriction to CC is injective. For n>0n>0, a trivial image forces r=s=0r=s=0; for n=0n=0, C=1C=1. Every element of Q′Q' has trivial linear coordinate. Therefore C∩Q′=1C\cap Q'=1, and quotienting by CC introduces no additional relations in the image of M′M'. This proves N(n,I)∩M′=cIN(n,I)\cap M'=c^I and the derived-subgroup assertion of Theorem 2.

Since Tn∈IT_n\in I, the last formula in (29) gives (ab)n=anbn(ab)^n=a^nb^n in QQ. Full invariance of cIc^I permits substitution of arbitrary elements of MM for a,ba,b. Hence

(xy)n=xnyn(x,y∈Q).(xy)^n=x^ny^n\qquad(x,y\in Q).

Thus x↦xnx\mapsto x^n is a homomorphism on QQ. After passage to Q/CQ/C, it kills both generators and is therefore trivial. It follows that gn∈N(n,I)g^n\in N(n,I) for all g∈Mg\in M.

An endomorphism of MM preserves cIc^I and sends each of an,bna^n,b^n into N(n,I)N(n,I). It therefore preserves their normal closure, proving full invariance. Finally, if az∈N(n,I)a^z\in N(n,I), then its image in QQ lies in CC. Comparing linear coordinates in (34) gives n∣zn\mid z. The reverse implication is immediate. Thus the image of aa in G(n,I)=Q/CG(n,I)=Q/C has order exactly nn, with the stated convention at zero. ◻

Propositions 11 and 12, together with Lemma 9, give a bijection between fully invariant subgroups of MM and admissible pairs. This also treats the infinite-order case: when n=0n=0, formula (28) gives N=cIN=c^I.

Identities in arbitrary numbers of variables

For a set L\mathcal L of group identities, write VL(M)V_{\mathcal L}(M) for the normal subgroup of MM generated by all values of words in L\mathcal L. This subgroup is fully invariant, and M/VL(M)M/V_{\mathcal L}(M) satisfies every identity in L\mathcal L.

Lemma 13. If NN is fully invariant in MM, then

VId(M/N)(M)=N.(36) \tag{36} V_{\mathrm{Id}(M/N)}(M)=N.

Proof. Every value in MM of an identity of M/NM/N belongs to NN, proving one inclusion. For the reverse inclusion, take g∈Ng\in N and a word w(a,b)w(a,b) representing it. Given any two elements of M/NM/N, lift them to x,y∈Mx,y\in M. The endomorphism sending a,ba,b to x,yx,y sends gg into NN. Consequently ww is a two-variable identity of M/NM/N, and its value gg belongs to the left side of (36). ◻

Proof of Theorem 2. Let HH be a two-generated metabelian group and choose an epimorphism M→HM\to H. Put N=VId(H)(M)N=V_{\mathrm{Id}(H)}(M). The quotient M/NM/N satisfies Id(H)\mathrm{Id}(H) by construction. The epimorphism to HH factors through M/NM/N, so every identity of M/NM/N is also an identity of HH. Hence

Id(M/N)=Id(H).\mathrm{Id}(M/N)=\mathrm{Id}(H).

The subgroup NN is fully invariant, so it equals N(n,I)N(n,I) for its unique admissible pair. This proves existence.

If two admissible pairs give the same identities, Lemma 13 shows that their fully invariant kernels in MM coincide. Recovering the exponent and the ideal gives equality of the pairs. Conversely, equal pairs define the same quotient. Every such quotient is metabelian and two-generated. The exact exponent and the isomorphism G(n,I)′≅(R/I,+)G(n,I)'\cong(R/I,+) were proved in Proposition 12. ◻

References

Preprint · Lean (GitHub)

  1. J. A. Barmak, The winding invariant, arXiv:1904.10072.
  1. R. A. Bryce, Metabelian groups and varieties, Bull. Austral. Math. Soc. 1 (1969), 15–25.
  1. D. E. Cohen, On the laws of a metabelian variety, J. Algebra 5 (1967), 267–273.
  1. E. I. Khukhro and V. D. Mazurov (eds.), The Kourovka Notebook: Unsolved Problems in Group Theory, 21st ed., September 2026 update, Problem 8.54(b), arXiv:1401.0300.
  1. M. R. Vaughan-Lee, On the laws of some varieties of groups, J. Austral. Math. Soc. 11 (1970), 353–356.