Theorem 4.3: a polycyclic group has polynomial growth or exponential growth
OpenWolf.growth_dichotomy_of_isPolycyclicLet be polycyclic and a finite generating set. If has a nilpotent subgroup of finite index, then for constants and every , so has polynomial growth of degree . If has no nilpotent subgroup of finite index, then for some and every , so has exponential growth.
import Definitions.Def_Chou_Growth import Definitions.Def_MilnorWolf_Growth import Mathlib
namespace Wolf
theorem growth_dichotomy_of_isPolycyclic {Γ : Type*} [Group Γ] (h : MilnorWolf.IsPolycyclic Γ)
(S : Finset Γ) (hS : Subgroup.closure (S : Set Γ) = ⊤) :
(∀ Δ : Subgroup Γ, Group.IsNilpotent Δ → Δ.FiniteIndex →
(∃ 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 Δ)) ∧
MilnorWolf.HasPolynomialGrowthOfDegreeLE Γ (MilnorWolf.growthExponentTwo Δ)) ∧
((¬ ∃ Δ : Subgroup Γ, Group.IsNilpotent Δ ∧ Δ.FiniteIndex) →
(∃ v : ℝ, 1 < v ∧ ∀ m : ℕ, 1 ≤ m →
v ^ m ≤ (MilnorWolf.growthFunction S m : ℝ) ∧
(MilnorWolf.growthFunction S m : ℝ) ≤ (MilnorWolf.growthFunction S 1 : ℝ) ^ m) ∧
Chou.HasExponentialGrowth Γ) := by
sorry
end Wolf
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: growth_dichotomy_of_isPolycyclic
Preliminary vocabulary, as the statement uses it
Throughout, is a set carrying a group structure; nothing else is assumed about it (it may be finite or infinite, trivial or not). The group operation is written multiplicatively, with identity .
Word balls and the counting function. For a subset and a natural number , the ball of radius is
Three details of this definition matter. The condition on the letters is disjunctive: each letter must lie in or have its inverse in , i.e. the letters are drawn from . The length condition is , not ; in particular the empty product is allowed, so for every , and . And the product is taken in the listed order.
For a finite subset the growth function is
the number of elements of the ball. The counting operation used is the natural-number cardinality, which by convention returns on an infinite set; that convention never bites here, because is finite and therefore each is a finite set (it is the image of the finitely many words of length over the finite alphabet ). So is the honest cardinality, and .
Generation. " generates " means: the intersection of all subgroups of containing is itself.
Nilpotency class. For a group , let be the upper central series, defined by and , where . The group is nilpotent if for some , and its nilpotency class is the least such . If is not nilpotent, then is defined to be by convention (a junk value). Note also that when is the trivial group.
Lower central series and its ranks. For a group put and , the subgroup generated by all commutators with and . For each define the abelian group
where is the canonical projection onto the abelianization and the subgroup divided out is the image under of (this intersection is how the definition literally views as a subgroup of ). Since is abelian it is a -module when written additively, and we set
where "rank" means: the supremum of the cardinalities of the -linearly independent subsets of , converted to a natural number, with the convention that an infinite supremum is converted to . (For a finitely generated abelian group this is the usual torsion-free rank; for a general abelian group it is the truncation just described, and it is whenever that supremum is infinite.)
The two exponents. For a group , define the natural numbers
both sums being over , i.e. over . Note the indexing: the first weight is and the first summand is , and the second weight is . If — which happens when is trivial and also when is not nilpotent — both sums are empty and .
Polynomial growth of degree at most . For a natural number , the group has polynomial growth of degree at most means: there exist a finite subset that generates and a real number such that for every natural . The generating set here is existentially quantified and is unrelated to any other generating set in the statement.
Exponential growth. has exponential growth means: there exist a finite subset that generates and a real number such that for every natural , with no lower restriction on ; at this reads . Again is existentially quantified and unrelated to the other generating sets appearing.
Hypotheses
The statement is made for an arbitrary type (in an arbitrary universe) equipped with a group structure, and it takes three further hypotheses.
(H1) is polycyclic, in the following explicit sense: there exist a natural number and subgroups of (a family indexed by ) such that
- ,
- ,
- for every : , and the subgroup , viewed as a subgroup of , is normal in and the quotient group is cyclic, meaning some single element of that quotient has the property that every element of the quotient is an integer power , .
Two literal points. The normality requirement is phrased as the existence of a normality certificate, and the cyclicity of the quotient is asserted using that certificate; since normality is a property (not extra data), this amounts exactly to the conjunction " is normal in and the quotient is cyclic". And the subgroup divided out is written as , which by the accompanying inclusion is just . Degenerate case : the family is just , and the first two conditions then require , so is available exactly when is trivial; the third condition is vacuous. No claim is made that the are normal in , nor that the chain is strictly decreasing.
(H2) is a finite subset of . It is not assumed nonempty, and it is not assumed symmetric.
(H3) generates .
Conclusion
The conclusion is the conjunction of the following two claims, (A) and (B). Both are asserted; neither is offered as an alternative to the other.
(A) For every nilpotent subgroup of finite index
For every subgroup such that
- , regarded as a group in its own right, is nilpotent (nothing is assumed about how sits inside beyond being a subgroup — in particular is not assumed normal in ), and
- has finite index in , meaning the number of cosets in is a nonzero natural number — equivalently, the coset space is finite,
the following two things hold.
(A1) A two-sided bound on the growth function of the given . There exist real numbers with
such that for every natural number with , both
Here the powers are real numbers raised to natural-number exponents (repeated multiplication, with ), and is the natural number above, read as a real number. The exponents and are computed from the lower central series of and the nilpotency class of , while counts balls in with respect to the given generating set . No compatibility between and is assumed or asserted: need not lie in , and need not be generated by anything related to . The constants may depend on (and on and ), since they are chosen inside the scope of the quantifier over . The condition is a relation between the two constants only; nothing is asserted relating and , and the lower bound uses while the upper bound uses .
(A2) A polynomial growth statement about . has polynomial growth of degree at most , in the sense defined above: there exist some finite generating subset of and some real with for all . This is a separate existential and does not have to be witnessed by the given or by the constant from (A1).
(B) If no nilpotent subgroup has finite index
If there is no subgroup that is simultaneously nilpotent (as a group) and of finite index in , then the following two things hold.
(B1) An exponential two-sided bound on the growth function of the given . There exists a real number with (strictly) such that for every natural , both
The upper bound's base is the count of the radius-one ball for the same — the number of elements of — read as a real number and raised to the natural power . The exponents on both sides are itself, not a multiple of .
(B2) has exponential growth, in the sense defined above: there exist some finite generating subset of and some real with for all naturals , including . Again this existential need not be witnessed by the given or by the from (B1).
Degenerate and edge cases the quantifiers include
-
Exactly one of (A) and (B) can have content. If some nilpotent finite-index subgroup of exists, the hypothesis of (B) is false and (B) holds vacuously. If none exists, the universal quantifier in (A) ranges over the empty collection and (A) holds vacuously. So for any particular one of the two conjuncts carries no information.
-
(A) is unconditional. It is not placed under any hypothesis asserting that a nilpotent finite-index subgroup exists; it is a universally quantified claim that happens to be vacuous when there are none.
-
The trivial subgroup is an admissible when is finite. The trivial subgroup is nilpotent, and it has finite index precisely when is finite. Its nilpotency class is , so and the bounds of (A1) read for all , with ; (A2) then asserts polynomial growth of degree at most , i.e. a constant bound for some generating and all . Correspondingly, the hypothesis of (B) can only be satisfied by an infinite : no finite group satisfies it.
-
is an admissible (it always has finite index), so when itself is nilpotent the claims of (A) apply with .
-
Exponents can vanish for non-obvious reasons. and are whenever , and individual summands vanish whenever the corresponding rank is — which happens both when the factor is a torsion group and, by the truncation convention, when its supremum of independent-set cardinalities is infinite. The nilpotency hypothesis on means the junk-value branch of the nilpotency class ( for non-nilpotent ) is not reached for itself, though the ranks carry their own truncation convention regardless.
-
trivial. Then may be the empty set, (H3) holds, for all , and (A) applies with and both exponents .
-
is excluded from (A1) and (B1) — both inner claims are quantified over only — but is included in the definition of exponential growth used by (B2).
-
The polycyclicity hypothesis (H1) does not reappear in the conclusion; the conclusion mentions only , , subgroups of , and the quantities defined above.
Confirmed by the mission captain (proposal self-audit).