On finite-by-nilpotent groups

Eloisa Detomi; Guram Donadze; Marta Morigi; Pavel Shumyatsky

arxiv: 1907.02798 · v1 · pith:RO66637Hnew · submitted 2019-07-03 · 🧮 math.GR

On finite-by-nilpotent groups

Eloisa Detomi , Guram Donadze , Marta Morigi , Pavel Shumyatsky This is my paper

Pith reviewed 2026-05-25 09:20 UTC · model grok-4.3

classification 🧮 math.GR

keywords finite-by-nilpotent groupslower central wordsBFC-groupscommutator subgroupverbal subgroupsnilpotent groups

0 comments

The pith

If |g^{X_n}| ≤ m for all g then γ_{n+1}(G) has finite (m,n)-bounded order.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that whenever a group G has a fixed integer m such that every element g is conjugated by at most m distinct values of the nth lower central word, the next term γ_{n+1}(G) in the lower central series must be finite and its order depends only on m and n. This directly generalizes B. H. Neumann's theorem on BFC-groups, which is the special case n=1 asserting that bounded conjugacy classes force the commutator subgroup to be finite. A sympathetic reader cares because the result supplies a uniform local-to-global finiteness principle that controls the size of higher commutator subgroups from a single boundedness hypothesis on conjugation actions.

Core claim

Let γ_n = [x_1, …, x_n] be the nth lower central word and let X_n be the set of all γ_n-values in G. If there exists m such that |g^{X_n}| ≤ m for every g in G, then γ_{n+1}(G) has finite order bounded by a number depending only on m and n.

What carries the argument

The set X_n of γ_n-values together with the uniform bound m on the size of each conjugacy class g^{X_n}, which is used to control the order of the next lower central term γ_{n+1}(G).

If this is right

The case n=1 recovers Neumann's theorem that the commutator subgroup of any BFC-group is finite.
G is finite-by-nilpotent: the quotient G/γ_{n+1}(G) is nilpotent of class at most n.
The order of γ_{n+1}(G) is bounded by a function of m and n alone, independent of any other features of G.
The same bounded-conjugacy hypothesis on X_n forces the (n+1)th term of the lower central series to be finite.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same technique might apply to other verbal subgroups or to the derived series under analogous bounded-conjugacy hypotheses.
Concrete examples realizing the bound, such as certain finite p-groups or wreath products, could be examined to test sharpness.
The result suggests a possible extension to residually finite or profinite groups satisfying the same local bound.
One could ask whether the hypothesis implies additional structural properties such as local finiteness of other subgroups.

Load-bearing premise

A single fixed m bounds |g^{X_n}| for every element g in the group.

What would settle it

An explicit group G together with an integer m such that |g^{X_n}| ≤ m for all g yet γ_{n+1}(G) is infinite.

read the original abstract

Let $\gamma_n=[x_1,\dots,x_n]$ be the $n$th lower central word. Denote by $X_n$ the set of $\gamma_n$-values in a group $G$ and suppose that there is a number $m$ such that $|g^{X_n}|\leq m$ for each $g\in G$. We prove that $\gamma_{n+1}(G)$ has finite $(m,n)$-bounded order. This generalizes the much celebrated theorem of B. H. Neumann that says that the commutator subgroup of a BFC-group is finite.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives a clean inductive generalization of Neumann's BFC theorem: bounded conjugacy on the gamma_n-values forces gamma_{n+1}(G) finite with an (m,n)-bound.

read the letter

The main result is that if |g^{X_n}| is bounded by m for every g, then gamma_{n+1}(G) has finite order bounded in terms of m and n. This is a direct lift of the n=1 case and the argument uses the usual commutator collection plus induction on n to control the generators of the next term in the lower central series. The reduction stays inside the standard identities and does not add extra global assumptions on G, so the dependence on m and n tracks through without hidden steps. That part is straightforward and matches what the stress-test describes. The only soft spot is that the bound itself is not computed explicitly, only shown to exist; for applications that need a concrete number this leaves some work, but the existence claim is the stated goal and it holds. The paper is aimed at people who already work with BFC-type conditions or verbal subgroups in finite-by-nilpotent groups. It is a modest but solid increment on a known theorem, with no circularity or fitting issues visible. I would bring it to a reading group if the group has an interest in nilpotent or FC-variations, and I would cite it if I needed the higher-n statement. It deserves a serious referee because the claim is new, the method is standard but correctly applied, and the result is checkable once the lemmas are written out.

Referee Report

0 major / 2 minor

Summary. The paper proves that if G is a group such that the set X_n of γ_n-values satisfies |g^{X_n}| ≤ m for every g ∈ G, then the subgroup γ_{n+1}(G) has finite order bounded by a function of m and n alone. The argument proceeds by induction on n, using standard commutator identities to reduce the bounded-conjugacy hypothesis on X_n to control on the generators of γ_{n+1}(G). This directly generalizes B. H. Neumann’s theorem on the finiteness of the commutator subgroup of a BFC-group (the case n=1).

Significance. The result supplies a uniform (m,n)-bound on the order of γ_{n+1}(G) under a natural verbal analogue of the BFC condition. Because the proof tracks the dependence through the lower central series without extra global hypotheses on G, it yields a clean generalization that may be useful for studying finite-by-nilpotent groups and verbal subgroups with bounded conjugacy action.

minor comments (2)

The abstract states the main theorem but does not indicate the length or structure of the proof; a sentence in the introduction clarifying that the argument occupies Sections 2–4 would help readers locate the inductive step.
Notation for the lower central word γ_n = [x_1,…,x_n] is introduced without an explicit reference to the standard commutator collection process; adding a brief reminder of the collection formula used in the induction would improve readability for non-specialists.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the positive recommendation to accept. The referee's summary accurately captures the main result and its relation to B. H. Neumann's theorem.

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained

full rationale

The paper states an external hypothesis (|g^{X_n}| ≤ m for all g) and derives a bound on |γ_{n+1}(G)| via standard commutator identities and induction on n, generalizing Neumann's external BFC theorem. No step reduces the conclusion to a fitted parameter, self-definition, or load-bearing self-citation chain; the argument tracks dependence through the lower central series without internal redefinition or renaming of known results as new predictions.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The claim rests only on the standard axioms of group theory and the definitions of commutators and lower central series; no free parameters, ad-hoc axioms, or new entities appear in the statement.

axioms (1)

standard math Standard axioms of group theory, including associativity, identity element, inverses, and the definition of commutators.
The result is a theorem proved inside the category of groups.

pith-pipeline@v0.9.0 · 5626 in / 1155 out tokens · 33810 ms · 2026-05-25T09:20:41.002024+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

If |x^{X_n}| ≤ m for each x ∈ G, then γ_{n+1}(G) has finite (m,n)-bounded order (Theorem 1.2, using Lemmas 2.1–2.4 on commutator identities and induction).
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Generalizes B. H. Neumann theorem on BFC-groups via verbal conjugacy classes X_n.

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.