Countable internal central factors G′=⟨Hi⟩G^\prime=\langle H_i\rangle in arbitrary locally normal groups

6.9

Problem

If GG is locally normal, must G′G' be an internal central product of countable subgroups?

∀X⊆G finite,∃K⊴G: X⊆K, ∣K∣<∞,G′=?⟨Hi:i∈I⟩,∣Hi∣≤ℵ0,[Hi,Hj]=1(i≠j).\begin{gathered} \forall X\subseteq G\text{ finite},\quad\exists K\trianglelefteq G:\ X\subseteq K,\ |K|<\infty,\\ G'\stackrel{?}{=}\langle H_i:i\in I\rangle,\qquad |H_i|\le\aleph_0,\quad[H_i,H_j]=1\quad(i\ne j). \end{gathered}

No bound on ∣G∣|G| is imposed; intersections of the central factors may be nontrivial.

The decomposition theorem

A group GG is locally normal if, for every finite subset X⊆GX\subseteq G, there is a finite normal subgroup K⊴GK\trianglelefteq G containing XX. Write G′G' for the derived subgroup, CG(X)C_G(X) for the centralizer of XX, and [a,b]=aba−1b−1[a,b]=aba^{-1}b^{-1}.

Theorem 1. Let GG be locally normal. There is a family (Hi)i∈I(H_i)_{i\in I} of countable subgroups of G′G' such that

[Hi,Hj]=1(i≠j),G′=⟨Hi:i∈I⟩.(1) \tag{1} [H_i,H_j]=1\quad(i\ne j),\qquad G'=\langle H_i:i\in I\rangle.

Here countable includes finite. Equation (1) expresses G′G' as an internal central product: each element belongs to a product of finitely many factors, and distinct factors commute. Their intersections need not be trivial. Theorem 1 answers Problem 6.9 of the Kourovka Notebook (1).

Throughout the proof, GG is fixed and locally normal, and D=G′D=G'. Normality of a subgroup always means normality in GG, unless another ambient group is specified.

Uniform commutator corrections

Definition 2. A normal subgroup N⊴GN\trianglelefteq G is admissible if

G=NCG(L)for every finite L⊴G with L≤N.(2) \tag{2} G=N C_G(L) \quad\text{for every finite }L\trianglelefteq G\text{ with }L\le N.

Thus every conjugation induced by an element of GG on such an LL is induced by an element of NN. Both 11 and GG are admissible.

Lemma 3. Let N⊴GN\trianglelefteq G, let SS be finite, and let P(s,x)P(s,x) be a predicate for s∈Ss\in S and x∈Nx\in N. Suppose that, for each finite normal subgroup L≤NL\le N, some s∈Ss\in S satisfies P(s,x)P(s,x) for all x∈Lx\in L. Then some s∈Ss\in S satisfies P(s,x)P(s,x) for all x∈Nx\in N.

Proof. Otherwise, choose xs∈Nx_s\in N with ¬P(s,xs)\neg P(s,x_s) for each s∈Ss\in S. Local normality puts the finite set {xs:s∈S}\{x_s:s\in S\} in a finite normal subgroup KK of GG. The subgroup L=K∩NL=K\cap N is finite and normal and contains every xsx_s, contradicting the hypothesis for LL. This also covers S=∅S=\varnothing, since the hypothesis for L=1L=1 requires an element of SS. ◻

Lemma 4. If NN is admissible and a,b∈Ga,b\in G, there exists s∈D∩Ns\in D\cap N such that

[a,b]s−1∈CG(N).(3) \tag{3} [a,b]s^{-1}\in C_G(N).

Proof. For every finite normal L≤NL\le N, admissibility gives n∈Nn\in N with an−1∈CG(L)an^{-1}\in C_G(L). Since LL is normal, so is CG(L)C_G(L). In the quotient G/CG(L)G/C_G(L), the images of aa and nn are equal; hence

[a,b][n,b]−1∈CG(L).(4) \tag{4} [a,b][n,b]^{-1}\in C_G(L).

Choose a finite normal subgroup KK containing bb. Every [n,b][n,b] lies in KK, so S={[n,b]:n∈N}S=\{[n,b]:n\in N\} is finite. Apply Lemma 3 to the condition that [a,b]s−1[a,b]s^{-1} commute with xx, using (4) for its local hypothesis. The resulting s∈Ss\in S belongs to D∩ND\cap N, since NN is normal, and satisfies (3). ◻

Proposition 5. For every admissible NN,

D=(D∩N)CD(N).(5) \tag{5} D=(D\cap N)C_D(N).

Proof. The two factors on the right commute, and their product is a subgroup of DD. Lemma 4 places every commutator in that product. Since commutators generate DD, equality follows. ◻

Countable admissible enlargements

If KK is finite and normal, conjugation defines a homomorphism G→Aut⁡(K)G\to\operatorname{Aut}(K) with kernel CG(K)C_G(K). In particular,

[G:CG(K)]<∞.(6) \tag{6} [G:C_G(K)]<\infty.

For normal subgroups, products below are subgroup products; they agree with the corresponding joins in the subgroup lattice.

Lemma 6. Let NN be admissible, let L≤NL\le N be finite and normal, and let KK be finite and normal. Then

[G:NCG(LK)]≤[G:CG(K)]<∞.(7) \tag{7} [G:N C_G(LK)]\le [G:C_G(K)]<\infty.

Proof. Put C=CG(L)C=C_G(L), E=CG(K)E=C_G(K) and Q=N(C∩E)Q=N(C\cap E). We have CG(LK)=C∩EC_G(LK)=C\cap E and NC=GNC=G by admissibility. Thus CQ=GCQ=G, and

[G:Q]=[C:C∩Q]≤[C:C∩E]≤[G:E].[G:Q]=[C:C\cap Q] \le [C:C\cap E]\le [G:E].

The final index is finite by (6). ◻

Lemma 7. Let NN be admissible and KK finite and normal. There is a finite normal subgroup J≥KJ\ge K such that

G=NJCG(LK)for every finite normal L≤N.(9) \tag{9} G=NJ C_G(LK) \quad\text{for every finite normal }L\le N.

Proof. For such LL, put QL=NCG(LK)Q_L=N C_G(LK). Lemma 6 bounds all indices [G:QL][G:Q_L] by the same finite number. Choose L0L_0 for which this index is maximal. For any LL, the product L0LL_0L is again a finite normal subgroup of NN, and

QL0L≤QL0∩QL.Q_{L_0L}\le Q_{L_0}\cap Q_L.

If QL0LQ_{L_0L} were properly contained in QL0Q_{L_0}, its index would be strictly larger. Therefore QL0L=QL0Q_{L_0L}=Q_{L_0}, and consequently QL0≤QLQ_{L_0}\le Q_L for every LL.

Choose a finite transversal TT for QL0Q_{L_0} in GG. Local normality provides a finite normal subgroup JJ containing K∪TK\cup T. It follows that G=JQL0≤JQL=NJCG(LK)G=JQ_{L_0}\le JQ_L=NJ C_G(LK), proving (9). ◻

Proposition 8. If NN is admissible and g∈Gg\in G, there is a countable normal subgroup BB containing gg such that NBNB is admissible.

Proof. Choose a finite normal subgroup K0K_0 containing gg. Repeatedly apply Lemma 7 to obtain finite normal subgroups K0≤K1≤K2≤⋯K_0\le K_1\le K_2\le\cdots such that, for every finite normal L≤NL\le N,

G=NKm+1CG(LKm)(m≥0).(11) \tag{11} G=NK_{m+1}C_G(LK_m)\qquad(m\ge0).

Then B=⋃m≥0KmB=\bigcup_{m\ge0}K_m is countable and normal and contains gg.

Let F≤NBF\le NB be finite and normal. For each x∈Fx\in F, choose nx∈Nn_x\in N and bx∈Bb_x\in B with x=nxbxx=n_xb_x. The finitely many bxb_x lie in some KmK_m. The finitely many nxn_x lie in a finite normal subgroup L≤NL\le N: take a finite normal subgroup of GG containing them and intersect it with NN. Hence F≤LKmF\le LK_m. By (11),

G=NKm+1CG(LKm)≤NBCG(F)≤G.G=NK_{m+1}C_G(LK_m)\le NB C_G(F)\le G.

This proves admissibility of NBNB. ◻

Adding a countable central factor

Lemma 9. Suppose NN is admissible and BB is a countable subgroup. Put M=NBM=NB. There is a countable subgroup H≤D∩MH\le D\cap M such that

[H,N]=1,D∩M=(D∩N)H.(13) \tag{13} [H,N]=1,\qquad D\cap M=(D\cap N)H.

Proof. The image of D∩MD\cap M in G/NG/N is countable, since M/NM/N is the image of BB. Choose one d∈D∩Md\in D\cap M over each element of that image. By Proposition 5, write d=ucd=uc with u∈D∩Nu\in D\cap N and c∈CD(N)c\in C_D(N). Here c=u−1d∈Mc=u^{-1}d\in M and cN=dNcN=dN. Let HH be generated by the resulting countably many elements cc. A subgroup generated by a countable set is countable, because its elements are finite words in that set and its inverses. Thus HH is countable, lies in D∩MD\cap M, and centralizes NN. Its image in G/NG/N equals that of D∩MD\cap M, which gives (13). ◻

Lemma 10. A nonempty directed union of admissible subgroups is admissible.

Proof. Let N=⋃iNiN=\bigcup_i N_i, where the NiN_i are admissible and directed by inclusion. The union is normal. Every finite normal subgroup L≤NL\le N is contained in one NiN_i. Thus G=NiCG(L)=NCG(L)G=N_iC_G(L)=NC_G(L). ◻

Proof of the decomposition theorem

Proof of Theorem 1. A stage is a pair (N,H)(N,\mathcal H) in which NN is admissible, H\mathcal H is a set of countable subgroups of D∩ND\cap N, and

[H,K]=1(H,K∈H, H≠K),⟨H⟩=D∩N.(14) \tag{14} [H,K]=1\quad(H,K\in\mathcal H,\ H\ne K),\qquad \langle\mathcal H\rangle=D\cap N.

Order stages by inclusion in both coordinates. The pair (1,∅)(1,\varnothing) is a stage.

Every nonempty chain of stages has an upper bound obtained by taking the union in each coordinate. The subgroup coordinate is admissible by Lemma 10. Any two factors occur together in one stage of the chain and hence commute when distinct. Finally,

D∩⋃iNi=⋃i(D∩Ni)=⟨⋃iHi⟩,D\cap\bigcup_i N_i=\bigcup_i(D\cap N_i) =\left\langle\bigcup_i\mathcal H_i\right\rangle,

so the union is a stage. Zorn’s lemma gives a maximal stage (N,H)(N,\mathcal H).

Fix g∈Gg\in G. Proposition 8 provides a countable normal BB with g∈Bg\in B and NBNB admissible. Lemma 9 provides a countable H≤D∩NBH\le D\cap NB centralizing NN, with D∩NB=(D∩N)HD\cap NB=(D\cap N)H. Every K∈HK\in\mathcal H lies in NN, so [H,K]=1[H,K]=1. Therefore (NB,H∪{H})(NB,\mathcal H\cup\{H\}) is a stage extending (N,H)(N,\mathcal H). Maximality implies NB=NNB=N, whence g∈Ng\in N. Since gg was arbitrary, N=GN=G, and (14) is (1). ◻

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 6.9. arXiv:1401.0300.