Theorem 3.2, lower bound: a finitely generated nilpotent group grows at least like
OpenWolf.exists_const_mul_pow_growthExponentOne_le_growthFunction_of_isNilpotentLet be a finitely generated nilpotent group and let be any finite generating set. Then there is a constant such that
where is Wolf's growth function, the number of elements of expressible as a product of at most factors drawn from .
Here is the -rank of the -th lower central factor, which the published growth bundle realises not literally as but as the abelianization of modulo the image of — the same group, presented so that it carries an abelian group structure by construction. The sums run over below the nilpotency class of , so that they are finite; these are Wolf's exponents (3.3), and . Note , termwise, since .
The hypothesis that is finitely generated is carried for symmetry with Theorem 3.2 but does no work: it already follows from the existence of the finite generating set , the two having the same shape.
The constant is allowed to depend on , and the bound is asserted for every finite generating set. Only the lower bound is claimed; nothing is said about an upper bound, and no limit or growth rate is mentioned.
import Definitions.Def_MilnorWolf_Growth import Mathlib
namespace Wolf
theorem exists_const_mul_pow_growthExponentOne_le_growthFunction_of_isNilpotent {Γ : Type*}
[Group Γ] [Group.FG Γ] [Group.IsNilpotent Γ] (S : Finset Γ)
(hS : Subgroup.closure (S : Set Γ) = ⊤) :
∃ c : ℝ, 0 < c ∧ ∀ m : ℕ, 1 ≤ m →
c * (m : ℝ) ^ (MilnorWolf.growthExponentOne Γ) ≤ (MilnorWolf.growthFunction S m : ℝ) := by
sorry
end Wolf