Countable internal central factors in arbitrary locally normal groups
Problem
If is locally normal, must be an internal central product of countable subgroups?
No bound on is imposed; intersections of the central factors may be nontrivial.
The decomposition theorem
A group is locally normal if, for every finite subset , there is a finite normal subgroup containing . Write for the derived subgroup, for the centralizer of , and .
Theorem 1. Let be locally normal. There is a family of countable subgroups of such that
Here countable includes finite. Equation (1) expresses 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, is fixed and locally normal, and . Normality of a subgroup always means normality in , unless another ambient group is specified.
Uniform commutator corrections
Definition 2. A normal subgroup is admissible if
Thus every conjugation induced by an element of on such an is induced by an element of . Both and are admissible.
Lemma 3. Let , let be finite, and let be a predicate for and . Suppose that, for each finite normal subgroup , some satisfies for all . Then some satisfies for all .
Proof. Otherwise, choose with for each . Local normality puts the finite set in a finite normal subgroup of . The subgroup is finite and normal and contains every , contradicting the hypothesis for . This also covers , since the hypothesis for requires an element of . ◻
Lemma 4. If is admissible and , there exists such that
Proof. For every finite normal , admissibility gives with . Since is normal, so is . In the quotient , the images of and are equal; hence
Choose a finite normal subgroup containing . Every lies in , so is finite. Apply Lemma 3 to the condition that commute with , using (4) for its local hypothesis. The resulting belongs to , since is normal, and satisfies (3). ◻
Proposition 5. For every admissible ,
Proof. The two factors on the right commute, and their product is a subgroup of . Lemma 4 places every commutator in that product. Since commutators generate , equality follows. ◻
Countable admissible enlargements
If is finite and normal, conjugation defines a homomorphism with kernel . In particular,
For normal subgroups, products below are subgroup products; they agree with the corresponding joins in the subgroup lattice.
Lemma 6. Let be admissible, let be finite and normal, and let be finite and normal. Then
Lemma 7. Let be admissible and finite and normal. There is a finite normal subgroup such that
Proof. For such , put . Lemma 6 bounds all indices by the same finite number. Choose for which this index is maximal. For any , the product is again a finite normal subgroup of , and
If were properly contained in , its index would be strictly larger. Therefore , and consequently for every .
Choose a finite transversal for in . Local normality provides a finite normal subgroup containing . It follows that , proving (9). ◻
Proposition 8. If is admissible and , there is a countable normal subgroup containing such that is admissible.
Proof. Choose a finite normal subgroup containing . Repeatedly apply Lemma 7 to obtain finite normal subgroups such that, for every finite normal ,
Then is countable and normal and contains .
Let be finite and normal. For each , choose and with . The finitely many lie in some . The finitely many lie in a finite normal subgroup : take a finite normal subgroup of containing them and intersect it with . Hence . By (11),
This proves admissibility of . ◻
Adding a countable central factor
Lemma 9. Suppose is admissible and is a countable subgroup. Put . There is a countable subgroup such that
Proof. The image of in is countable, since is the image of . Choose one over each element of that image. By Proposition 5, write with and . Here and . Let be generated by the resulting countably many elements . A subgroup generated by a countable set is countable, because its elements are finite words in that set and its inverses. Thus is countable, lies in , and centralizes . Its image in equals that of , which gives (13). ◻
Lemma 10. A nonempty directed union of admissible subgroups is admissible.
Proof. Let , where the are admissible and directed by inclusion. The union is normal. Every finite normal subgroup is contained in one . Thus . ◻
Proof of the decomposition theorem
Proof of Theorem 1. A stage is a pair in which is admissible, is a set of countable subgroups of , and
Order stages by inclusion in both coordinates. The pair 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,
so the union is a stage. Zorn’s lemma gives a maximal stage .
Fix . Proposition 8 provides a countable normal with and admissible. Lemma 9 provides a countable centralizing , with . Every lies in , so . Therefore is a stage extending . Maximality implies , whence . Since was arbitrary, , and (14) is (1). ◻
References
- 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.