In a group without exponential growth, the conjugates of one element by the powers of another generate a finitely generated subgroup
ProvedGroupFiniteness.fg_closure_zpow_conj_of_not_hasExponentialGrowthLet be a finitely generated group which does not have exponential growth, and let and be any two of its elements. Then the subgroup generated by , the orbit of under conjugation by the powers of , is finitely generated.
Milnor states this for an element of an abelian normal subgroup of , and concludes finite generation of a subgroup of . Neither the abelian hypothesis, nor the normality of , nor the ambient subgroup plays any role: the argument counts the ordered products of with powers of , finds two that coincide because there are more of them than the ball of the corresponding radius can hold, and reads off from the resulting relation an expression for one conjugate in terms of the earlier ones.
Not having exponential growth is the negation of an existential over finite generating sets, so it is a statement about every finite generating set of .
import Definitions.Def_Chou_Growth import Mathlib
namespace GroupFiniteness
/-- Milnor's Lemma 1 (Growth of finitely generated solvable groups, J. Differential Geometry 2
(1968) 447–448) with its hypotheses removed: for a finitely generated group without exponential
growth and *any* two elements `α` and `β`, the subgroup generated by the two-sided orbit
`{β ^ k * α * β ^ (-k) : k ∈ ℤ}` is finitely generated.
Milnor states it for `α` in an abelian normal subgroup `A` of `B` and concludes finite generation
of a subgroup of `A`; neither the abelian hypothesis, nor normality, nor the ambient subgroup is
needed. The counting argument is Milnor's: among the ordered products of `β` with powers of `α`
there are more words than the ball of the corresponding radius can hold, so two coincide, and the
resulting relation expresses one conjugate in terms of the earlier ones. -/
theorem fg_closure_zpow_conj_of_not_hasExponentialGrowth {B : Type*} [Group B] [Group.FG B]
(h : ¬ Chou.HasExponentialGrowth B) (α β : B) :
(Subgroup.closure {x : B | ∃ k : ℤ, x = β ^ k * α * β ^ (-k)}).FG := by
sorry
end GroupFiniteness