3.15 (1969)

Solved

A group $G$ is said to be $U$-embeddable in a class $\mathfrak{K}$ of groups if, for any finite submodel $M \subset G$, there is a group $A \in \mathfrak{K}$ such that $M$ is isomorphic to some submodel of $A$. Are the following groups $U$-embeddable in the class of finite groups:
$\qquad$ a) every group with one defining relation?
$\qquad$ b) every group defined by one relation in the variety of soluble groups of a given derived length?

Progress

No, in both cases (A. I. Budkin, V. A. Gorbunov, Algebra and Logic, 14 (1975), 73–84). Another example. The group $G = \langle a, b \mid (b^2)^a = b^3 \rangle$ is non-Hopfian as proved in (G. Baumslag, D. Solitar, Bull. Amer. Math. Soc., 68, no. 3 (1962), 199–201) and therefore is not metabelian. We choose elements $a, b, x_1, x_2, x_3, x_4 \in G$ such that $w = [[x_1, x_2], [x_3, x_4]] \neq 1$, add to them 1, their inverses, and all the initial segments of the word $w$ in the alphabet $\{x_i\}$, and all the initial segments of the word $a^{-1} b^2 a b^{-3}$ and of each of the words $x_i$ in the alphabet of $\{a, b\}$. Let $M$ be the resulting model. If $M$ was embeddable into a finite group $G_0$, then $G_0$ would have to be metacyclic, and also would have to have elements satisfying $[[x_1, x_2], [x_3, x_4]] \neq 1$, which is impossible. Hence $G$ is not $U$-embeddable into finite groups. Since the group $G/G^{(k)}$ is also non-Hopfian for a suitable $k$ (ibid.), it is not $U$-embeddable into finite groups for similar reasons. (Yu. I. Merzlyakov, 1969.)

Comments

All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic. If you want to submit a proof (or a partial proof), please use the dedicated proof submission form rather than posting it in the comments.
Order by newest first or oldest first.

No comments yet. Be the first to comment.

Proof claims

Proof claims are the responsibility of the submitter. Appearance here does not mean the claim has been checked for mathematical correctness. Moderators only screen for spam, abuse, and obviously low-effort submissions.

No proof claims yet.