# Strong conciseness in profinite groups

**Authors:** Eloisa Detomi, Benjamin Klopsch, Pavel Shumyatsky

arXiv: 1907.01344 · 2020-05-27

## TL;DR

This paper proves that certain classes of words in profinite groups are strongly concise, meaning small value sets imply finite verbal subgroups, advancing understanding of word behavior in profinite and nilpotent groups.

## Contribution

The paper introduces a new approach via parametrised words, proving multilinear commutator words are strongly concise in all profinite groups and all words are strongly concise in nilpotent profinite groups.

## Key findings

- Multilinear commutator words are strongly concise in all profinite groups.
- Every group word is strongly concise in nilpotent profinite groups.
- Certain specific words like x^2, x^3, and their variants are strongly concise in all profinite groups.

## Abstract

A group word $w$ is said to be strongly concise in a class $\mathcal{C}$ of profinite groups if, for every group $G$ in $\mathcal{C}$ such that $w$ takes less than $2^{\aleph_0}$ values in $G$, the verbal subgroup $w(G)$ is finite. Detomi, Morigi and Shumyatsky established that multilinear commutator words -- and the particular words $x^2$ and $[x^2,y]$ -- have the property that the corresponding verbal subgroup is finite in a profinite group $G$ whenever the word takes at most countably many values in $G$. They conjectured that, in fact, this should be true for every word. In particular, their conjecture included as open cases power words and Engel words.   In the present paper, we take a new approach via parametrised words that leads to stronger results. First we prove that multilinear commutator words are strongly concise in the class of all profinite groups. Then we establish that every group word is strongly concise in the class of nilpotent profinite groups. From this we deduce, for instance, that, if $w$ is one of the group words $x^2$, $x^3$, $x^6$, $[x^3,y]$ or $[x,y,y]$, then $w$ is strongly concise in the class of all profinite groups. Indeed, the same conclusion can be reached for all words of the infinite families $[x^m,z_1,\ldots,z_r]$ and $[x,y,y,z_1,\ldots,z_r]$, where $m \in \{2,3\}$ and $r \ge 1$.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1907.01344/full.md

## References

19 references — full list in the complete paper: https://tomesphere.com/paper/1907.01344/full.md

---
Source: https://tomesphere.com/paper/1907.01344