Theorem 3.2: a finitely generated nilpotent group has polynomial growth between and
OpenWolf.fg_lcsFactor_and_growth_bounds_of_isNilpotentLet be a finitely generated nilpotent group. Each factor of the lower central series is a finitely generated abelian group; writing for the rank of its free part, set and , the sums running over the factors of the series. Then for any finite generating set there are constants with for every .
import Definitions.Def_Chou_Growth import Definitions.Def_MilnorWolf_Growth import Mathlib
namespace Wolf
theorem fg_lcsFactor_and_growth_bounds_of_isNilpotent {Γ : Type*} [Group Γ] [Group.FG Γ]
[Group.IsNilpotent Γ] (S : Finset Γ) (hS : Subgroup.closure (S : Set Γ) = ⊤) :
(∀ k : ℕ, Group.FG (MilnorWolf.lcsFactor Γ k)) ∧
∃ c₁ c₂ : ℝ, 0 < c₁ ∧ c₁ ≤ c₂ ∧ ∀ m : ℕ, 1 ≤ m →
c₁ * (m : ℝ) ^ (MilnorWolf.growthExponentOne Γ) ≤ (MilnorWolf.growthFunction S m : ℝ) ∧
(MilnorWolf.growthFunction S m : ℝ) ≤
c₂ * (m : ℝ) ^ (MilnorWolf.growthExponentTwo Γ) := by
sorry
end Wolf
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: fg_lcsFactor_and_growth_bounds_of_isNilpotent
The objects the statement is built from
Throughout, is a group. Three constructions have to be spelled out before the assertion can be stated; each is expanded here exactly as the formal text defines it.
Commutators and the lower central series. For elements, . For two subgroups , denotes the subgroup generated by the set (not that set itself). The series used here is indexed from and starts at the whole group:
So is the commutator subgroup . These subgroups are nested decreasingly, .
The -th factor group. For each natural number , write for the abelianization of , i.e. the quotient of by the subgroup generated by all commutators with , and write for the canonical projection. The object of interest is
Two points of literal detail. First, the subgroup being divided out is described in the formal text as " viewed inside ", which by definition is the intersection regarded as a subgroup of ; because the series is decreasing this intersection is itself, so is modulo the image of . Second, the quotient is formed as a group quotient, which is legitimate for every subgroup here because is abelian and hence all of its subgroups are normal. is again an abelian group.
At this reads: the abelianization of modulo the image of .
Rank of the -th factor. Let be the abelian group written additively, viewed as a -module in the only way possible (the module structure coming from the additive group structure). Put
where this rank is defined as follows: take the supremum of the cardinalities of all -linearly independent subsets of , and convert it to a natural number, with the convention that the value is if that supremum is infinite. In particular both when has infinite rank and when is a torsion group (over , rank is equivalent to being torsion). For a finitely generated abelian group this is the ordinary torsion-free rank, i.e. the number of infinite cyclic summands. Nothing in the definition of presupposes that is finitely generated.
Nilpotency class. Let and be the upper central series, and let be the least with (equivalently, the least with ); by convention if no such exists, though under the hypotheses below one does. Define two natural numbers
both sums being over the indices (empty, hence , when ).
Growth function. For a finite subset and a natural number , let
The product of the empty list is the identity, so the identity always belongs to this set, and for every including . The condition is , not , so this is a closed ball of radius and the sets increase with . The generators are used together with their inverses (), and repetitions in the list are allowed. The counting is by a cardinality function that returns for an infinite set; that convention is not triggered here, since the set is finite whenever is finite.
What the theorem asserts
Let be any group (in any universe) which is
- finitely generated — some finite subset of generates ; and
- nilpotent — some term of its upper central series is all of .
Let be a finite subset of and assume
- the subgroup generated by (the smallest subgroup of containing ) is all of .
(The last assumption already exhibits a finite generating set, so the finite-generation assumption is separately listed but not independent of it. Both are present.)
Then both of the following hold.
(A) For every natural number , the group is finitely generated, i.e. some finite subset of generates it. This is asserted for all without restriction — including and including every beyond the nilpotency class, where is trivial and so is .
(B) There exist real numbers and such that
and such that for every natural number with , both inequalities
hold, where is read as a real number, is the natural number read as a real number, and the powers are ordinary integer powers of a real number with exponents the natural numbers and defined above (so ).
Precision notes on (B)
- The two constants are quantified before : a single pair must work for all simultaneously. They may depend on and on .
- is excluded from the inequalities; nothing is claimed there.
- The inequalities are non-strict () in both directions. The strict inequality in the statement is only ; there is no requirement that be strictly positive beyond what and give, and no upper bound on .
- The lower bound uses the exponent and the upper bound uses the exponent . The statement asserts no relation between and — not that they are equal, and not that .
- The existence claim is plain existence, not uniqueness, and the exponents are fixed quantities determined by , not existentially quantified.
- The growth function is taken with respect to the given generating set ; no claim is made about other generating sets.
- Degenerate case: if is trivial then , so (empty sums) and for all ; the assertion reduces to the existence of with .
- Degenerate case: if every with is (for instance if all the factors are finite), then again and the assertion reduces to a two-sided bound of by constants for all .
- is allowed to be empty, but then the generation hypothesis forces to be trivial; the hypotheses are not vacuous — the trivial group satisfies all of them.
- (A) and (B) are joined by "and": the theorem asserts the conjunction, so both parts are claimed under the same hypotheses.
Confirmed by the mission captain (proposal self-audit).