Kourovka Notebook Problem 7.5
Status Open · unsolvedmath.comLLM status Open unverified
Top Open Problems Not reported cataloguedOpenOpenStatement
Definitions and mathematical statement
Let $G$ be a group. For subgroups $H,K\leq G$, write $\langle H\cup K\rangle$ for the smallest subgroup of $G$ containing both. Following the source, call $G$ indecomposable if \[ \forall H,K\leq G,\qquad (H\neq G\ \text{and}\ K\neq G)\ \Longrightarrow\ \langle H\cup K\rangle\neq G. \] This is the source-specific meaning of indecomposable. A group is periodic if \[ \forall g\in G\ \exists n\in{\mathbb{Z}}_{\geq 1}\qquad g^n=1. \] Let \[ G'=\langle x^{-1}y^{-1}xy:x,y\in G\rangle \] be the commutator subgroup. The group $G$ is metabelian if $G'$ is abelian, equivalently $(G')'=\{1\}$.Classification problem. Describe all periodic metabelian groups that are indecomposable in the above sense. No finiteness, finite generation, or uniform bound on element orders is assumed. The supplied statement does not exclude the trivial group. It requests a description of this class without prescribing a particular form of classification.
Short English statement
Describe all groups in which every element has finite order, the commutator subgroup is abelian, and any two proper subgroups together generate a proper subgroup. Indecomposability has exactly the meaning specified in the source.Sources
- Supplied local UnsolvedMath registry record, permanent ID $700411$, exact source code
catalogue entry, titled Kourovka Notebook Problem 7.5; upstream revisiond371ee917ac9647fbb06cd6fc529deec6f3dda82. - Attributed in the supplied record to V. V. Belyaev, proposed in 1980; original problem number 7.5 in The Kourovka Notebook (Unsolved Problems in Group Theory), 7th issue (1980). The supplied background also identifies the 21st issue edition (2026),
arXiv:1401.0300v48. - The registry places this problem in Kourovka Notebook (Issues 1--21), whose supplied description names E. I. Khukhro and V. D. Mazurov as editors. The registry labels the problem open; this is supplied source metadata, not an independently verified assessment.
Statement licence: CC-BY-4.0 · Source file
Contributions 0
No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.