Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 4.3: a polycyclic group has polynomial growth or exponential growth

Open
Wolf.growth_dichotomy_of_isPolycyclic

by dbenbenn · Sep 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

group-growthgroup-theorynilpotent-groupspolycyclic-groupssolvable-groups

Let Γ\GammaΓ be polycyclic and SSS a finite generating set. If Γ\GammaΓ has a nilpotent subgroup Δ\DeltaΔ of finite index, then c1mE1(Δ)≤gS(m)≤c2mE2(Δ)c_1 m^{E_1(\Delta)} \le g_S(m) \le c_2 m^{E_2(\Delta)}c1​mE1​(Δ)≤gS​(m)≤c2​mE2​(Δ) for constants 0<c1≤c20 < c_1 \le c_20<c1​≤c2​ and every m≥1m \ge 1m≥1, so Γ\GammaΓ has polynomial growth of degree ≤E2(Δ)\le E_2(\Delta)≤E2​(Δ). If Γ\GammaΓ has no nilpotent subgroup of finite index, then vm≤gS(m)≤gS(1)mv^m \le g_S(m) \le g_S(1)^mvm≤gS​(m)≤gS​(1)m for some v>1v > 1v>1 and every m≥1m \ge 1m≥1, so Γ\GammaΓ has exponential growth.

Preamble
import Definitions.Def_Chou_Growth
import Definitions.Def_MilnorWolf_Growth
import Mathlib
Formal statement
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
Source
Wolf, J. A., Growth of finitely generated solvable groups and curvature of Riemannian manifolds, Journal of Differential Geometry 2 (1968) 421–446, https://doi.org/10.4310/jdg/1214428658, Theorem 4.3, p. 434
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, Γ\GammaΓ 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 111.

Word balls and the counting function. For a subset T⊆ΓT \subseteq \GammaT⊆Γ and a natural number nnn, the ball of radius nnn is

BT(n)  =  { g∈Γ  :  ∃ k≤n and x1,…,xk∈Γ with (xj∈T or xj−1∈T) for each j, and g=x1x2⋯xk }.B_T(n) \;=\; \Bigl\{\, g \in \Gamma \;:\; \exists\, k \le n \text{ and } x_1,\dots,x_k \in \Gamma \text{ with } \bigl(x_j \in T \text{ or } x_j^{-1} \in T\bigr) \text{ for each } j, \text{ and } g = x_1 x_2 \cdots x_k \,\Bigr\}.BT​(n)={g∈Γ:∃k≤n and x1​,…,xk​∈Γ with (xj​∈T or xj−1​∈T) for each j, and g=x1​x2​⋯xk​}.

Three details of this definition matter. The condition on the letters is disjunctive: each letter must lie in TTT or have its inverse in TTT, i.e. the letters are drawn from T∪T−1T \cup T^{-1}T∪T−1. The length condition is ≤n\le n≤n, not =n= n=n; in particular the empty product is allowed, so 1∈BT(n)1 \in B_T(n)1∈BT​(n) for every nnn, and BT(0)={1}B_T(0) = \{1\}BT​(0)={1}. And the product x1x2⋯xkx_1 x_2 \cdots x_kx1​x2​⋯xk​ is taken in the listed order.

For a finite subset S⊆ΓS \subseteq \GammaS⊆Γ the growth function is

βS(m)  =  # BS(m)∈N,\beta_S(m) \;=\; \#\, B_S(m) \in \mathbb{N},βS​(m)=#BS​(m)∈N,

the number of elements of the ball. The counting operation used is the natural-number cardinality, which by convention returns 000 on an infinite set; that convention never bites here, because SSS is finite and therefore each BS(m)B_S(m)BS​(m) is a finite set (it is the image of the finitely many words of length ≤m\le m≤m over the finite alphabet S∪S−1S \cup S^{-1}S∪S−1). So βS(m)\beta_S(m)βS​(m) is the honest cardinality, and βS(0)=1\beta_S(0) = 1βS​(0)=1.

Generation. "SSS generates Γ\GammaΓ" means: the intersection of all subgroups of Γ\GammaΓ containing SSS is Γ\GammaΓ itself.

Nilpotency class. For a group HHH, let Z0(H)⊆Z1(H)⊆⋯Z_0(H) \subseteq Z_1(H) \subseteq \cdotsZ0​(H)⊆Z1​(H)⊆⋯ be the upper central series, defined by Z0(H)={1}Z_0(H) = \{1\}Z0​(H)={1} and Zn+1(H)={x∈H:[x,y]∈Zn(H) for all y∈H}Z_{n+1}(H) = \{x \in H : [x,y] \in Z_n(H) \text{ for all } y \in H\}Zn+1​(H)={x∈H:[x,y]∈Zn​(H) for all y∈H}, where [x,y]=xyx−1y−1[x,y] = x y x^{-1} y^{-1}[x,y]=xyx−1y−1. The group HHH is nilpotent if Zn(H)=HZ_n(H) = HZn​(H)=H for some nnn, and its nilpotency class c(H)c(H)c(H) is the least such nnn. If HHH is not nilpotent, then c(H)c(H)c(H) is defined to be 000 by convention (a junk value). Note also that c(H)=0c(H) = 0c(H)=0 when HHH is the trivial group.

Lower central series and its ranks. For a group HHH put H0=HH_0 = HH0​=H and Hk+1=[Hk,H]H_{k+1} = [H_k, H]Hk+1​=[Hk​,H], the subgroup generated by all commutators [p,q]=pqp−1q−1[p,q] = p q p^{-1} q^{-1}[p,q]=pqp−1q−1 with p∈Hkp \in H_kp∈Hk​ and q∈Hq \in Hq∈H. For each kkk define the abelian group

Fk(H)  =  Hk/[Hk,Hk]πk(Hk+1∩Hk),F_k(H) \;=\; \frac{H_k / [H_k, H_k]}{\pi_k\bigl(H_{k+1} \cap H_k\bigr)},Fk​(H)=πk​(Hk+1​∩Hk​)Hk​/[Hk​,Hk​]​,

where πk:Hk→Hk/[Hk,Hk]\pi_k : H_k \to H_k/[H_k,H_k]πk​:Hk​→Hk​/[Hk​,Hk​] is the canonical projection onto the abelianization and the subgroup divided out is the image under πk\pi_kπk​ of Hk+1∩HkH_{k+1} \cap H_kHk+1​∩Hk​ (this intersection is how the definition literally views Hk+1H_{k+1}Hk+1​ as a subgroup of HkH_kHk​). Since Fk(H)F_k(H)Fk​(H) is abelian it is a Z\mathbb{Z}Z-module when written additively, and we set

rk(H)  =  the Z-rank of Fk(H),r_k(H) \;=\; \text{the } \mathbb{Z}\text{-rank of } F_k(H),rk​(H)=the Z-rank of Fk​(H),

where "rank" means: the supremum of the cardinalities of the Z\mathbb{Z}Z-linearly independent subsets of Fk(H)F_k(H)Fk​(H), converted to a natural number, with the convention that an infinite supremum is converted to 000. (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 000 whenever that supremum is infinite.)

The two exponents. For a group HHH, define the natural numbers

E1(H)  =  ∑k=0c(H)−1(k+1) rk(H),E2(H)  =  ∑k=0c(H)−12k rk(H),E_1(H) \;=\; \sum_{k=0}^{c(H)-1} (k+1)\, r_k(H), \qquad\qquad E_2(H) \;=\; \sum_{k=0}^{c(H)-1} 2^{k}\, r_k(H),E1​(H)=k=0∑c(H)−1​(k+1)rk​(H),E2​(H)=k=0∑c(H)−1​2krk​(H),

both sums being over k∈{0,1,…,c(H)−1}k \in \{0, 1, \dots, c(H)-1\}k∈{0,1,…,c(H)−1}, i.e. over k<c(H)k < c(H)k<c(H). Note the indexing: the first weight is k+1k+1k+1 and the first summand is k=0k = 0k=0, and the second weight is 2k2^k2k. If c(H)=0c(H) = 0c(H)=0 — which happens when HHH is trivial and also when HHH is not nilpotent — both sums are empty and E1(H)=E2(H)=0E_1(H) = E_2(H) = 0E1​(H)=E2​(H)=0.

Polynomial growth of degree at most EEE. For a natural number EEE, the group Γ\GammaΓ has polynomial growth of degree at most EEE means: there exist a finite subset S′⊆ΓS' \subseteq \GammaS′⊆Γ that generates Γ\GammaΓ and a real number c>0c > 0c>0 such that βS′(m)≤c mE\beta_{S'}(m) \le c \, m^{E}βS′​(m)≤cmE for every natural m≥1m \ge 1m≥1. The generating set here is existentially quantified and is unrelated to any other generating set in the statement.

Exponential growth. Γ\GammaΓ has exponential growth means: there exist a finite subset S′′⊆ΓS'' \subseteq \GammaS′′⊆Γ that generates Γ\GammaΓ and a real number c>1c > 1c>1 such that cn≤βS′′(n)c^{n} \le \beta_{S''}(n)cn≤βS′′​(n) for every natural nnn, with no lower restriction on nnn; at n=0n = 0n=0 this reads 1≤βS′′(0)=11 \le \beta_{S''}(0) = 11≤βS′′​(0)=1. Again S′′S''S′′ is existentially quantified and unrelated to the other generating sets appearing.

Hypotheses

The statement is made for an arbitrary type Γ\GammaΓ (in an arbitrary universe) equipped with a group structure, and it takes three further hypotheses.

(H1) Γ\GammaΓ is polycyclic, in the following explicit sense: there exist a natural number ttt and subgroups A0,A1,…,AtA_0, A_1, \dots, A_tA0​,A1​,…,At​ of Γ\GammaΓ (a family indexed by {0,1,…,t}\{0,1,\dots,t\}{0,1,…,t}) such that

  • A0=ΓA_0 = \GammaA0​=Γ,
  • At={1}A_t = \{1\}At​={1},
  • for every i∈{0,1,…,t−1}i \in \{0, 1, \dots, t-1\}i∈{0,1,…,t−1}: Ai+1⊆AiA_{i+1} \subseteq A_iAi+1​⊆Ai​, and the subgroup Ai+1∩AiA_{i+1} \cap A_iAi+1​∩Ai​, viewed as a subgroup of AiA_iAi​, is normal in AiA_iAi​ and the quotient group Ai/(Ai+1∩Ai)A_i / (A_{i+1} \cap A_i)Ai​/(Ai+1​∩Ai​) is cyclic, meaning some single element ggg of that quotient has the property that every element of the quotient is an integer power gzg^{z}gz, z∈Zz \in \mathbb{Z}z∈Z.

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 "Ai+1A_{i+1}Ai+1​ is normal in AiA_iAi​ and the quotient is cyclic". And the subgroup divided out is written as Ai+1∩AiA_{i+1} \cap A_iAi+1​∩Ai​, which by the accompanying inclusion Ai+1⊆AiA_{i+1} \subseteq A_iAi+1​⊆Ai​ is just Ai+1A_{i+1}Ai+1​. Degenerate case t=0t = 0t=0: the family is just A0A_0A0​, and the first two conditions then require Γ=A0={1}\Gamma = A_0 = \{1\}Γ=A0​={1}, so t=0t = 0t=0 is available exactly when Γ\GammaΓ is trivial; the third condition is vacuous. No claim is made that the AiA_iAi​ are normal in Γ\GammaΓ, nor that the chain is strictly decreasing.

(H2) SSS is a finite subset of Γ\GammaΓ. It is not assumed nonempty, and it is not assumed symmetric.

(H3) SSS generates Γ\GammaΓ.

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 Δ⊆Γ\Delta \subseteq \GammaΔ⊆Γ such that

  • Δ\DeltaΔ, regarded as a group in its own right, is nilpotent (nothing is assumed about how Δ\DeltaΔ sits inside Γ\GammaΓ beyond being a subgroup — in particular Δ\DeltaΔ is not assumed normal in Γ\GammaΓ), and
  • Δ\DeltaΔ has finite index in Γ\GammaΓ, meaning the number of cosets in Γ/Δ\Gamma / \DeltaΓ/Δ 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 SSS. There exist real numbers c1,c2c_1, c_2c1​,c2​ with

0<c1andc1≤c2,0 < c_1 \qquad\text{and}\qquad c_1 \le c_2,0<c1​andc1​≤c2​,

such that for every natural number mmm with m≥1m \ge 1m≥1, both

c1 m E1(Δ)  ≤  βS(m)andβS(m)  ≤  c2 m E2(Δ).c_1 \, m^{\,E_1(\Delta)} \;\le\; \beta_S(m) \qquad\text{and}\qquad \beta_S(m) \;\le\; c_2 \, m^{\,E_2(\Delta)} .c1​mE1​(Δ)≤βS​(m)andβS​(m)≤c2​mE2​(Δ).

Here the powers are real numbers raised to natural-number exponents (repeated multiplication, with x0=1x^0 = 1x0=1), and βS(m)\beta_S(m)βS​(m) is the natural number above, read as a real number. The exponents E1(Δ)E_1(\Delta)E1​(Δ) and E2(Δ)E_2(\Delta)E2​(Δ) are computed from the lower central series of Δ\DeltaΔ and the nilpotency class of Δ\DeltaΔ, while βS\beta_SβS​ counts balls in Γ\GammaΓ with respect to the given generating set SSS. No compatibility between SSS and Δ\DeltaΔ is assumed or asserted: SSS need not lie in Δ\DeltaΔ, and Δ\DeltaΔ need not be generated by anything related to SSS. The constants c1,c2c_1, c_2c1​,c2​ may depend on Δ\DeltaΔ (and on Γ\GammaΓ and SSS), since they are chosen inside the scope of the quantifier over Δ\DeltaΔ. The condition c1≤c2c_1 \le c_2c1​≤c2​ is a relation between the two constants only; nothing is asserted relating E1(Δ)E_1(\Delta)E1​(Δ) and E2(Δ)E_2(\Delta)E2​(Δ), and the lower bound uses E1E_1E1​ while the upper bound uses E2E_2E2​.

(A2) A polynomial growth statement about Γ\GammaΓ. Γ\GammaΓ has polynomial growth of degree at most E2(Δ)E_2(\Delta)E2​(Δ), in the sense defined above: there exist some finite generating subset S′S'S′ of Γ\GammaΓ and some real c>0c > 0c>0 with βS′(m)≤c mE2(Δ)\beta_{S'}(m) \le c\, m^{E_2(\Delta)}βS′​(m)≤cmE2​(Δ) for all m≥1m \ge 1m≥1. This is a separate existential and does not have to be witnessed by the given SSS or by the constant c2c_2c2​ from (A1).

(B) If no nilpotent subgroup has finite index

If there is no subgroup Δ⊆Γ\Delta \subseteq \GammaΔ⊆Γ that is simultaneously nilpotent (as a group) and of finite index in Γ\GammaΓ, then the following two things hold.

(B1) An exponential two-sided bound on the growth function of the given SSS. There exists a real number vvv with v>1v > 1v>1 (strictly) such that for every natural m≥1m \ge 1m≥1, both

vm  ≤  βS(m)andβS(m)  ≤  (βS(1))m.v^{m} \;\le\; \beta_S(m) \qquad\text{and}\qquad \beta_S(m) \;\le\; \bigl(\beta_S(1)\bigr)^{m} .vm≤βS​(m)andβS​(m)≤(βS​(1))m.

The upper bound's base is the count of the radius-one ball for the same SSS — the number of elements of {1}∪S∪S−1\{1\} \cup S \cup S^{-1}{1}∪S∪S−1 — read as a real number and raised to the natural power mmm. The exponents on both sides are mmm itself, not a multiple of mmm.

(B2) Γ\GammaΓ has exponential growth, in the sense defined above: there exist some finite generating subset S′′S''S′′ of Γ\GammaΓ and some real c>1c > 1c>1 with cn≤βS′′(n)c^n \le \beta_{S''}(n)cn≤βS′′​(n) for all naturals nnn, including n=0n = 0n=0. Again this existential need not be witnessed by the given SSS or by the vvv 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 Γ\GammaΓ 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 Γ\GammaΓ 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 Δ\DeltaΔ when Γ\GammaΓ is finite. The trivial subgroup {1}\{1\}{1} is nilpotent, and it has finite index precisely when Γ\GammaΓ is finite. Its nilpotency class is 000, so E1({1})=E2({1})=0E_1(\{1\}) = E_2(\{1\}) = 0E1​({1})=E2​({1})=0 and the bounds of (A1) read c1≤βS(m)≤c2c_1 \le \beta_S(m) \le c_2c1​≤βS​(m)≤c2​ for all m≥1m \ge 1m≥1, with c1>0c_1 > 0c1​>0; (A2) then asserts polynomial growth of degree at most 000, i.e. a constant bound βS′(m)≤c\beta_{S'}(m) \le cβS′​(m)≤c for some generating S′S'S′ and all m≥1m \ge 1m≥1. Correspondingly, the hypothesis of (B) can only be satisfied by an infinite Γ\GammaΓ: no finite group satisfies it.

  • Δ=Γ\Delta = \GammaΔ=Γ is an admissible Δ\DeltaΔ (it always has finite index), so when Γ\GammaΓ itself is nilpotent the claims of (A) apply with Δ=Γ\Delta = \GammaΔ=Γ.

  • Exponents can vanish for non-obvious reasons. E1(Δ)E_1(\Delta)E1​(Δ) and E2(Δ)E_2(\Delta)E2​(Δ) are 000 whenever c(Δ)=0c(\Delta) = 0c(Δ)=0, and individual summands vanish whenever the corresponding rank rk(Δ)r_k(\Delta)rk​(Δ) is 000 — which happens both when the factor Fk(Δ)F_k(\Delta)Fk​(Δ) is a torsion group and, by the truncation convention, when its supremum of independent-set cardinalities is infinite. The nilpotency hypothesis on Δ\DeltaΔ means the junk-value branch of the nilpotency class (c(H)=0c(H) = 0c(H)=0 for non-nilpotent HHH) is not reached for Δ\DeltaΔ itself, though the ranks rk(Δ)r_k(\Delta)rk​(Δ) carry their own truncation convention regardless.

  • Γ\GammaΓ trivial. Then SSS may be the empty set, (H3) holds, βS(m)=1\beta_S(m) = 1βS​(m)=1 for all mmm, and (A) applies with Δ={1}=Γ\Delta = \{1\} = \GammaΔ={1}=Γ and both exponents 000.

  • m=0m = 0m=0 is excluded from (A1) and (B1) — both inner claims are quantified over m≥1m \ge 1m≥1 only — but n=0n = 0n=0 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 Γ\GammaΓ, SSS, subgroups of Γ\GammaΓ, and the quantities defined above.

Human review
  • Endorsed by Shuze Chen · Sep 22, 2026

  • Endorsed by dbenbenn · Sep 22, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me