Wolf's growth function, polynomial growth, polycyclic groups and the growth exponents
DefinitionMilnorWolf_GrowthWolf's definitions, which Milnor's addendum also uses, on top of the published Chou.wordBall.
growthFunction S m: Wolf's , the number of elements expressible as words of length based on the finite set , taken as the size of the ball of radius (products of at most factors from ).HasPolynomialGrowthOfDegreeLE G E: for some finite generating set there is with for every integer .IsPolycyclic G: there is a chain of subgroups, each normal in , with every quotient cyclic (finite or infinite).lcs G k,lcsFactor G k,lcsRank G k: the lower central series (, ), the abelian group (presented as a quotient of the abelianization of ), and its -rank , the rank of its free abelian part.growthExponentOne G,growthExponentTwo G: Wolf's and , the sum running over where is the nilpotency class (so both are for a group that is not nilpotent).
No theorem is stated here.
import Definitions.Def_Chou_Growth
import Mathlib
/-!
# Growth of finitely generated groups: Wolf's definitions (J. Differential Geometry 2 (1968))
J. A. Wolf, *Growth of finitely generated solvable groups and curvature of Riemannian manifolds*,
J. Differential Geometry 2 (1968) 421–446; J. Milnor, *Growth of finitely generated solvable
groups*, ibid. 447–449, refers to Wolf for these definitions.
For a finite subset `S` of a group `Γ`, Wolf's growth function `g_S(m)` (p. 426) counts the
elements expressible as words of length `≤ m` based on `S`, a word `s₁^{a₁} ⋯ s_r^{a_r}` having
length `|a₁| + ⋯ + |a_r|`; `g_S(m)` is taken here as the size of the ball `Chou.wordBall S m` of the
published growth bundle, the set of products of at most `m` factors from `S ∪ S⁻¹`. `Γ` has *polynomial
growth of degree `≤ E`* (p. 431) if `g_S(m) ≤ c m^E` for some finite generating set `S`, some
`c > 0` and every `m ≥ 1`; exponential growth is `Chou.HasExponentialGrowth`. A solvable group is
*polycyclic* (Proposition 4.1 (1), p. 433) if it has a normal series with every quotient finite or
infinite cyclic; here, as in Kurosh, a normal series is a chain in which each term is normal in the
preceding one. For a finitely generated nilpotent group with lower central series
`Γ = Γ₀ ⊇ Γ₁ ⊇ ⋯ ⊇ Γ_s ⊇ Γ_{s+1} = 1`, each `Γ_k/Γ_{k+1}` is a finitely generated abelian group
`A_k × B_k` with `A_k` finite and `B_k` free abelian of rank `n_k`, and Wolf's growth exponents
(3.3) are `E₁ = ∑ (k+1) n_k` and `E₂ = ∑ 2^k n_k`. The rank `n_k` is taken as the `ℤ`-rank of
the abelian group `Γ_k/Γ_{k+1}`, presented as a quotient of the abelianization of `Γ_k` so that
its commutativity is available by construction; the sum runs over `k < s + 1`, Mathlib's
`Group.nilpotencyClass` (which is `0`, giving an empty sum, when the group is not nilpotent).
-/
namespace MilnorWolf
open Chou
/-- Wolf's growth function `g_S(m)` (p. 426), “the number of distinct elements of `Γ` expressible as
words of length `≤ m` based on `S`”, taken here as the size of the ball `Chou.wordBall S m`. -/
noncomputable def growthFunction {G : Type*} [Group G] (S : Finset G) (m : ℕ) : ℕ :=
Nat.card (wordBall (S : Set G) m)
/-- Wolf, p. 431: `Γ` has polynomial growth of degree `≤ E` if for some finite generating set `S`
there is a constant `c > 0` with `g_S(m) ≤ c m^E` for every integer `m ≥ 1`. -/
def HasPolynomialGrowthOfDegreeLE (G : Type*) [Group G] (E : ℕ) : Prop :=
∃ S : Finset G, Subgroup.closure (S : Set G) = ⊤ ∧
∃ c : ℝ, 0 < c ∧ ∀ m : ℕ, 1 ≤ m → (growthFunction S m : ℝ) ≤ c * (m : ℝ) ^ E
/-- Wolf, Proposition 4.1 (1) (p. 433): a group is polycyclic if it has a normal series
`Γ = A₀ ⊇ A₁ ⊇ ⋯ ⊇ A_t = 1`, each `A_{i+1}` normal in `A_i`, with every quotient `A_i/A_{i+1}`
cyclic (finite or infinite). -/
def IsPolycyclic (G : Type*) [Group G] : Prop :=
∃ (t : ℕ) (A : Fin (t + 1) → Subgroup G), A 0 = ⊤ ∧ A (Fin.last t) = ⊥ ∧
∀ i : Fin t, A i.succ ≤ A i.castSucc ∧
∃ _ : ((A i.succ).subgroupOf (A i.castSucc)).Normal,
IsCyclic (A i.castSucc ⧸ (A i.succ).subgroupOf (A i.castSucc))
/-- The `k`-th term `Γ_k` of the lower central series of `G`: `Γ₀ = G` and `Γ_{k+1} = ⁅Γ_k, G⁆` in
Mathlib's bracket order; Wolf writes `Γ_{k+1} = [Γ, Γ_k]`, the same subgroup by
`Subgroup.commutator_comm`. -/
abbrev lcs (G : Type*) [Group G] (k : ℕ) : Subgroup G :=
(⊤ : Subgroup G).lowerCentralSeries k
/-- The abelian group `Γ_k/Γ_{k+1}` of the lower central series, realised as the quotient of the
abelianization of `Γ_k` by the image of `Γ_{k+1}`, so that it is a `CommGroup` by construction. -/
abbrev lcsFactor (G : Type*) [Group G] (k : ℕ) : Type _ :=
Abelianization (lcs G k) ⧸
Subgroup.map (Abelianization.of (G := lcs G k)) ((lcs G (k + 1)).subgroupOf (lcs G k))
/-- `n_k` of Wolf (3.3): the rank of the free abelian part of `Γ_k/Γ_{k+1}`, the `ℤ`-rank of that
abelian group. -/
noncomputable def lcsRank (G : Type*) [Group G] (k : ℕ) : ℕ :=
Module.finrank ℤ (Additive (lcsFactor G k))
/-- Wolf's growth exponent `E₁(Γ) = ∑_{k=0}^{s} (k+1) n_k` of (3.3), for a nilpotent group with
`Γ_{s+1} = 1`; `s + 1` is Mathlib's `Group.nilpotencyClass`, which is `0` for a non-nilpotent
group, so that the sum is then empty. -/
noncomputable def growthExponentOne (G : Type*) [Group G] : ℕ :=
∑ k ∈ Finset.range (Group.nilpotencyClass G), (k + 1) * lcsRank G k
/-- Wolf's growth exponent `E₂(Γ) = ∑_{k=0}^{s} 2^k n_k` of (3.3). -/
noncomputable def growthExponentTwo (G : Type*) [Group G] : ℕ :=
∑ k ∈ Finset.range (Group.nilpotencyClass G), 2 ^ k * lcsRank G k
end MilnorWolf
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: eight definitions
All eight declarations below are definitions, not theorems: each introduces a new symbol and fixes its meaning. Nothing below is asserted to be true or non-vacuous; what is recorded is what each symbol denotes.
Throughout, denotes a type (in an arbitrary universe) carrying a group structure supplied as a typeclass assumption. In the first definition is an implicit argument, inferred from the other arguments; in all the others it is given explicitly. Every definition applies to every group whatsoever: no finiteness, finite generation, nilpotence, solvability or commutativity is assumed anywhere.
Two conventions recur and are stated once here.
Counting. All cardinalities below are natural-number cardinalities, with the convention that an infinite set is assigned the value , exactly as an empty set is. So a cardinality of records either "empty" or "infinite", and the two are not distinguished.
Ranks. The rank used below is the natural-number rank of a module: it is the supremum, over all subsets of the module that are linearly independent over the base ring, of the cardinality of that subset, converted to a natural number with the same convention — if that supremum is an infinite cardinal, the rank is .
1. The growth function of a finite subset
Given a group , a finite subset , and a natural number , this defines a natural number, the number of elements of the ball of radius .
The ball of radius about the identity with respect to is the set
Points of detail, all of which are literally what is written:
- The witness is a finite list of elements of , of length at most , not exactly . Repetitions are allowed; the need not be distinct.
- The product is taken in the order of the list, bracketed to the right against the identity: . For a group this is the ordinary ordered product .
- The empty list () is permitted, and its product is the identity. Hence the identity lies in for every , including , and .
- The condition on each letter is " or ". itself is not required to be symmetric; the symmetrization is performed here, by the disjunction.
- is a finite subset, used through its underlying set . may be empty, in which case only the identity is reachable and for all .
The value of the definition is the number of elements of , under the counting convention above: if were infinite the value would be .
2. Polynomial growth of degree at most
Given a group and a natural number , this defines a proposition. It holds precisely when:
there exists a finite subset such that the subgroup generated by is all of , and there exists a real number with such that for every natural number with ,
where is the count of §1, cast from a natural number into the reals, on the right is likewise cast into the reals, and is the -fold product of with itself in the reals.
Points of detail:
- "The subgroup generated by " is the smallest subgroup of containing , i.e. the intersection of all subgroups containing ; the requirement is that this equals the whole group .
- The generating set is existentially quantified, and the constant is existentially quantified after it, so may depend on . Nothing asserts the bound for every generating set.
- The inequality is required only for . The case is explicitly excluded, so no constraint is placed on .
- The exponent is a fixed natural number, and the bound is , not . The degenerate value is allowed: the requirement is then for all , since in the reals (including for whose cast is — but there anyway).
- is required to be strictly positive, but no upper bound on is imposed, and need not be an integer.
- Because an infinite set is counted as , any radius at which the ball were infinite would satisfy the inequality automatically rather than violating it.
- is permitted to be empty; the generation condition then forces to be the trivial group.
3. Polycyclicity
Given a group , this defines a proposition. It holds precisely when:
there exist a natural number and a family of subgroups of , indexed by the indices , such that
- (the whole group);
- (the trivial subgroup);
- for every index with , both of the following hold:
- , and
- writing for the subgroup of the group consisting of those with (that is, , regarded as living inside ), the subgroup is normal in , and the quotient group — taken with the group structure that this normality provides — is cyclic, meaning that there is an element of for which the map from to is surjective.
Points of detail:
- The normality of in and the cyclicity of are asserted together: the statement is "there is a proof of normality such that the resulting quotient group is cyclic", which amounts to the conjunction " is normal in , and the quotient is cyclic". The cyclicity claim cannot even be phrased without the normality, since it is a claim about the quotient's group structure.
- is literally described as the intersection viewed inside , not as itself; the inclusion is imposed separately, in the same clause.
- Cyclicity is stated via surjectivity of for ranging over all of , so it covers both finite and infinite cyclic quotients. The trivial group is cyclic in this sense.
- Nothing requires the chain to be strictly decreasing: is allowed at any step (the quotient is then trivial, hence cyclic).
- Nothing requires any to be normal in ; normality is required only of each term inside its immediate predecessor.
- The degenerate case is included. Then there is a single subgroup , conditions 1 and 2 read and simultaneously, and condition 3 is vacuous (there are no indices with ). So witnesses the property exactly when is trivial.
- is existentially quantified with no bound, and the family is an arbitrary function of the index, subject only to the listed conditions.
4. The lower central series
Given a group and a natural number , this defines a subgroup of , written below. It is the lower central series of , computed as the lower central series of the subgroup of itself, with the indexing
where for subgroups the symbol denotes the subgroup generated by the set of commutators (not merely that set of commutators).
Note the indexing: the series starts at with the whole group, so is the commutator subgroup, , and so on. (This is one index lower than the convention in which the whole group is called .)
5. The -th lower central factor
Given a group and a natural number , this defines a type, which carries a commutative group structure. With as in §4, let
- be the abelianization of the group (the quotient of by its own commutator subgroup), and
- be the canonical projection.
Let be the subgroup of consisting of those with — that is, regarded as a subgroup of . Then the definition is the quotient group
the quotient of the abelianization of by the image under of . Since is commutative, that image is automatically a normal subgroup and the quotient is a commutative group; no hypothesis is needed for this.
Two literal readings worth spelling out: the object quotiented is the abelianization of , not itself; and what is divided out is the image of in that abelianization, not itself. In particular at this is divided by the image of in .
6. The rank of the -th lower central factor
Given a group and a natural number , this defines a natural number: the rank, over the ring , of the abelian group of §5 written additively. Writing that commutative group additively makes it a -module in the canonical way (with the -fold sum of ), and the value is the natural-number rank of that module in the sense fixed at the top of this document: the supremum of the cardinalities of -linearly independent subsets, turned into a natural number, and equal to if that supremum is infinite.
Consequences of that convention, present in the definition: a factor group that is entirely torsion (for example a finite group, or the trivial group) has rank , and a factor group of infinite rank also has value . The two are not distinguished.
7. First growth exponent
Given a group , this defines a natural number:
where is the rank of §6 and is the nilpotency class of . The summation index runs over ; the value is not included. All arithmetic is in the natural numbers.
The nilpotency class is defined as the least natural number for which the -th term of the upper central series of equals , if is nilpotent; if is not nilpotent it is assigned the junk value . Consequently, for a non-nilpotent the sum here is empty and the definition yields ; the same happens for the trivial group, whose class is .
8. Second growth exponent
Given a group , this defines a natural number:
with and exactly as in §7: the rank of §6, the nilpotency class of with the junk value when is not nilpotent, the index running over and excluded, and all arithmetic — including — performed in the natural numbers. The term is .
This differs from §7 only in the coefficient: here in place of there. The two agree in the first two terms ( and ) and differ from onwards.
Confirmed by the mission captain (proposal self-audit).