Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 3.11: a finite-index subgroup is finitely generated, and polynomial growth passes up to the group

Open
Wolf.fg_and_polynomial_growth_of_finiteIndex

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

group-growthgroup-theorynilpotent-groupspolycyclic-groupssolvable-groups

Let GGG be a finitely generated group and HHH a subgroup of finite index. Then HHH is finitely generated; if HHH has polynomial growth of degree ≤E\le E≤E then so does GGG; and if HHH is moreover nilpotent with polynomial growth of degree ≤E\le E≤E, then GGG has polynomial growth of degree ≤min⁡(E,E2(H))\le \min(E, E_2(H))≤min(E,E2​(H)).

Wolf's Σ\SigmaΣ is written GGG here and Wolf's Γ\GammaΓ is written HHH, because Σ\SigmaΣ is reserved notation in Lean.

Preamble
import Definitions.Def_Chou_Growth
import Definitions.Def_MilnorWolf_Growth
import Mathlib
Formal statement
namespace Wolf

theorem fg_and_polynomial_growth_of_finiteIndex {G : Type*} [Group G] [Group.FG G] (H : Subgroup G)
    [H.FiniteIndex] :
    Group.FG H ∧
      (∀ E : ℕ, MilnorWolf.HasPolynomialGrowthOfDegreeLE H E →
        MilnorWolf.HasPolynomialGrowthOfDegreeLE G E) ∧
      (Group.IsNilpotent H → ∀ E : ℕ, MilnorWolf.HasPolynomialGrowthOfDegreeLE H E →
        MilnorWolf.HasPolynomialGrowthOfDegreeLE G (min E (MilnorWolf.growthExponentTwo H))) := 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 3.11, p. 431
Read-back

What the Lean code literally says, in plain math · claude-opus-5

Read-back: fg_and_polynomial_growth_of_finiteIndex

One declaration is rendered here. It is a single theorem whose conclusion is a three-fold conjunction.


Preliminary: the notions the statement is built from

These have to be spelled out, because the statement's content is entirely carried by them. Each is quoted in full so that nothing is hidden behind a name.

Word balls

Let Γ\GammaΓ be a group and let S⊆ΓS \subseteq \GammaS⊆Γ be any subset. For a natural number nnn, the word ball of radius nnn is

BS(n)  =  { g∈Γ  ∣  there is a finite list (x1,…,xr) of elements of Γ with r≤n,  each xi∈S or xi−1∈S,  and x1x2⋯xr=g }.B_S(n) \;=\; \bigl\{\, g \in \Gamma \;\bigm|\; \text{there is a finite list } (x_1,\dots,x_r) \text{ of elements of } \Gamma \text{ with } r \le n,\; \text{each } x_i \in S \text{ or } x_i^{-1} \in S,\; \text{and } x_1 x_2 \cdots x_r = g \,\bigr\}.BS​(n)={g∈Γ​there is a finite list (x1​,…,xr​) of elements of Γ with r≤n,each xi​∈S or xi−1​∈S,and x1​x2​⋯xr​=g}.

Four features of this are worth making explicit.

  • The condition on each letter is xi∈Sx_i \in Sxi​∈S or xi−1∈Sx_i^{-1} \in Sxi−1​∈S; so the letters are drawn from S∪S−1S \cup S^{-1}S∪S−1, and SSS itself is not required to be symmetric.
  • The length condition is r≤nr \le nr≤n, not r=nr = nr=n; the ball is closed, containing all shorter words as well.
  • The empty list is allowed, with the convention that the empty product is the identity. Consequently 1∈BS(n)1 \in B_S(n)1∈BS​(n) for every nnn, including n=0n = 0n=0; and BS(0)={1}B_S(0) = \{1\}BS​(0)={1}.
  • The product is formed in the order the letters are listed, folding from the right: x1⋅(x2⋅(⋯(xr⋅1)))x_1 \cdot (x_2 \cdot (\cdots (x_r \cdot 1)))x1​⋅(x2​⋅(⋯(xr​⋅1))). By associativity this is just the ordered product x1x2⋯xrx_1 x_2 \cdots x_rx1​x2​⋯xr​.

The growth function

For a finite subset SSS of Γ\GammaΓ and a natural number mmm,

βS(m)  =  # BS(m),\beta_S(m) \;=\; \#\, B_S(m),βS​(m)=#BS​(m),

the number of elements of the word ball, as a natural number. The counting function used here returns 000 for an infinite set (a junk convention); this does not bite, since SSS is finite and therefore every BS(m)B_S(m)BS​(m) is finite.

Polynomial growth of degree at most EEE

For a group Γ\GammaΓ and a natural number EEE, the assertion "Γ\GammaΓ has polynomial growth of degree ≤E\le E≤E" means:

there exist a finite subset S⊆ΓS \subseteq \GammaS⊆Γ that generates Γ\GammaΓ (the subgroup generated by SSS is all of Γ\GammaΓ), and a real number ccc with c>0c > 0c>0, such that for every natural number mmm with m≥1m \ge 1m≥1,

βS(m)  ≤  c⋅mE,\beta_S(m) \;\le\; c \cdot m^{E},βS​(m)≤c⋅mE,

the left side being read as a real number.

Note the shape of the quantifiers: the generating set is existentially quantified, so the assertion is that some finite generating set satisfies the bound, not that every one does. In particular the assertion already entails that Γ\GammaΓ is finitely generated. Note also that m=0m = 0m=0 is excluded from the bound, and that EEE is a natural number, so that for E=0E = 0E=0 the right-hand side is the constant ccc and the assertion is that the word-ball sizes are bounded.

The lower central series and its ranks

For a group Γ\GammaΓ, write γ0(Γ),γ1(Γ),γ2(Γ),…\gamma_0(\Gamma), \gamma_1(\Gamma), \gamma_2(\Gamma), \dotsγ0​(Γ),γ1​(Γ),γ2​(Γ),… for the lower central series indexed from zero:

γ0(Γ)=Γ,γk+1(Γ)=[γk(Γ),Γ],\gamma_0(\Gamma) = \Gamma, \qquad \gamma_{k+1}(\Gamma) = [\gamma_k(\Gamma), \Gamma],γ0​(Γ)=Γ,γk+1​(Γ)=[γk​(Γ),Γ],

where [A,B][A,B][A,B] denotes the subgroup generated by the set of commutators aba−1b−1aba^{-1}b^{-1}aba−1b−1 with a∈Aa \in Aa∈A, b∈Bb \in Bb∈B. (So the indexing is offset by one from the convention in which the series starts at γ1=Γ\gamma_1 = \Gammaγ1​=Γ.)

For each kkk, form the following abelian group. Take γk(Γ)\gamma_k(\Gamma)γk​(Γ) as a group in its own right and abelianize it, i.e. pass to

γk(Γ)/[γk(Γ),γk(Γ)].\gamma_k(\Gamma) \big/ [\gamma_k(\Gamma), \gamma_k(\Gamma)].γk​(Γ)/[γk​(Γ),γk​(Γ)].

Inside γk(Γ)\gamma_k(\Gamma)γk​(Γ), consider the subgroup consisting of those elements of γk(Γ)\gamma_k(\Gamma)γk​(Γ) that also lie in γk+1(Γ)\gamma_{k+1}(\Gamma)γk+1​(Γ), take its image under the abelianization map, and quotient by that image. Call the resulting abelian group

Qk(Γ)  =  (γk(Γ)/[γk(Γ),γk(Γ)])/image⁡(γk(Γ)∩γk+1(Γ)).Q_k(\Gamma) \;=\; \Bigl( \gamma_k(\Gamma)\big/[\gamma_k(\Gamma),\gamma_k(\Gamma)] \Bigr) \Big/ \operatorname{image}\bigl( \gamma_k(\Gamma) \cap \gamma_{k+1}(\Gamma) \bigr).Qk​(Γ)=(γk​(Γ)/[γk​(Γ),γk​(Γ)])/image(γk​(Γ)∩γk+1​(Γ)).

(The construction is the literal one just described; no identification of QkQ_kQk​ with γk/γk+1\gamma_k/\gamma_{k+1}γk​/γk+1​ is asserted by the statement, even where such an identification holds.)

Now define

rk(Γ)  =  rank⁡ZQk(Γ),r_k(\Gamma) \;=\; \operatorname{rank}_{\mathbb Z} Q_k(\Gamma),rk​(Γ)=rankZ​Qk​(Γ),

meaning: regard Qk(Γ)Q_k(\Gamma)Qk​(Γ) additively (its addition is the group operation of Qk(Γ)Q_k(\Gamma)Qk​(Γ), and the integer nnn acts on an element xxx by n⋅x=xnn \cdot x = x^nn⋅x=xn), which makes it a Z\mathbb{Z}Z-module; take the supremum of the cardinalities of its Z\mathbb{Z}Z-linearly independent subsets; and convert that cardinal to a natural number, with the convention that an infinite cardinal is sent to 000. Concretely, rk(Γ)r_k(\Gamma)rk​(Γ) is the largest rrr for which there are elements x1,…,xrx_1,\dots,x_rx1​,…,xr​ of Qk(Γ)Q_k(\Gamma)Qk​(Γ) such that x1n1⋯xrnr=1x_1^{n_1}\cdots x_r^{n_r} = 1x1n1​​⋯xrnr​​=1 forces n1=⋯=nr=0n_1 = \cdots = n_r = 0n1​=⋯=nr​=0 — the torsion-free rank — and rk(Γ)=0r_k(\Gamma) = 0rk​(Γ)=0 when no finite such largest rrr exists. In particular rk(Γ)=0r_k(\Gamma) = 0rk​(Γ)=0 whenever Qk(Γ)Q_k(\Gamma)Qk​(Γ) is a torsion group (for instance whenever it is finite), and also rk(Γ)=0r_k(\Gamma) = 0rk​(Γ)=0 when the torsion-free rank is infinite.

The nilpotency class and the exponent e2e_2e2​

For a group Γ\GammaΓ, the nilpotency class c(Γ)c(\Gamma)c(Γ) is the least natural number nnn such that the nnn-th term of the upper central series of Γ\GammaΓ is all of Γ\GammaΓ — the upper central series being Z0=1Z_0 = 1Z0​=1, Z1=Z_1 = Z1​= the centre, and Zn+1={x:[x,y]∈Zn for all y}Z_{n+1} = \{x : [x,y] \in Z_n \text{ for all } y\}Zn+1​={x:[x,y]∈Zn​ for all y}. If Γ\GammaΓ is not nilpotent, c(Γ)c(\Gamma)c(Γ) takes the junk value 000. For the trivial group, Z0=1=ΓZ_0 = 1 = \GammaZ0​=1=Γ already, so c(Γ)=0c(\Gamma) = 0c(Γ)=0.

Finally, define the natural number

e2(Γ)  =  ∑k=0c(Γ)−12k rk(Γ),e_2(\Gamma) \;=\; \sum_{k=0}^{c(\Gamma)-1} 2^{k} \, r_k(\Gamma),e2​(Γ)=k=0∑c(Γ)−1​2krk​(Γ),

i.e. the sum over k=0,1,…,c(Γ)−1k = 0, 1, \dots, c(\Gamma)-1k=0,1,…,c(Γ)−1 (an empty sum, hence 000, when c(Γ)=0c(\Gamma) = 0c(Γ)=0).


The statement

Fix

  • a type GGG in an arbitrary universe, carrying a group structure;
  • the hypothesis that GGG is finitely generated: some finite subset of GGG generates GGG;
  • a subgroup H≤GH \le GH≤G (this argument is explicit; GGG and its group structure are implicit, and the finite-generation hypothesis and the next one are supplied as typeclass assumptions);
  • the hypothesis that HHH has finite index in GGG: the number of left cosets of HHH in GGG, counted as a natural number with the convention that an infinite index is recorded as 000, is nonzero. (Equivalently: G/HG/HG/H is a finite set.)

Throughout, HHH is regarded as a group in its own right — the underlying set is {g∈G:g∈H}\{g \in G : g \in H\}{g∈G:g∈H} with the multiplication inherited from GGG — and every statement about "HHH" below is a statement about that group. In particular the lower central series, the nilpotency class and the generating sets appearing in the assertions about HHH are all computed inside HHH, not in GGG.

Then all three of the following hold simultaneously (the conclusion is a conjunction of three claims).

(1) HHH is finitely generated. There is a finite subset of HHH which generates HHH as a group, i.e. whose generated subgroup of HHH is the whole of HHH.

(2) Polynomial growth transfers from HHH up to GGG, degree for degree. For every natural number EEE: if HHH has polynomial growth of degree ≤E\le E≤E, then GGG has polynomial growth of degree ≤E\le E≤E. Spelled out: if there are a finite subset T⊆HT \subseteq HT⊆H generating HHH and a real c>0c > 0c>0 with #BT(m)≤c mE\#B_T(m) \le c\, m^{E}#BT​(m)≤cmE for all integers m≥1m \ge 1m≥1 (the balls taken inside HHH), then there are a finite subset S⊆GS \subseteq GS⊆G generating GGG and a real c′>0c' > 0c′>0 with #BS(m)≤c′ mE\#B_S(m) \le c'\, m^{E}#BS​(m)≤c′mE for all integers m≥1m \ge 1m≥1 (the balls taken inside GGG). This is an implication in one direction only; nothing is asserted about the converse.

(3) If HHH is nilpotent, the degree can be replaced by the minimum of EEE and e2(H)e_2(H)e2​(H). Assume in addition that HHH is nilpotent (some term of its upper central series is all of HHH). Then for every natural number EEE: if HHH has polynomial growth of degree ≤E\le E≤E, then GGG has polynomial growth of degree ≤min⁡(E, e2(H))\le \min\bigl(E,\, e_2(H)\bigr)≤min(E,e2​(H)), the minimum taken among natural numbers, where

e2(H)  =  ∑k=0c(H)−12k rk(H)e_2(H) \;=\; \sum_{k=0}^{c(H)-1} 2^{k}\, r_k(H)e2​(H)=k=0∑c(H)−1​2krk​(H)

is the quantity defined above, computed for the group HHH: c(H)c(H)c(H) is the nilpotency class of HHH, and rk(H)r_k(H)rk​(H) is the torsion-free rank (with the 000-for-infinite convention) of the abelian group

(γk(H)/[γk(H),γk(H)])/image⁡(γk(H)∩γk+1(H)),\Bigl( \gamma_k(H)\big/[\gamma_k(H),\gamma_k(H)] \Bigr) \Big/ \operatorname{image}\bigl( \gamma_k(H) \cap \gamma_{k+1}(H) \bigr),(γk​(H)/[γk​(H),γk​(H)])/image(γk​(H)∩γk+1​(H)),

with γ0(H)=H\gamma_0(H) = Hγ0​(H)=H and γk+1(H)=[γk(H),H]\gamma_{k+1}(H) = [\gamma_k(H), H]γk+1​(H)=[γk​(H),H] computed inside HHH.

The three claims are asserted jointly, for the single fixed HHH; claims (2) and (3) each quantify over all natural numbers EEE separately, inside the conclusion.


Degenerate and boundary cases the quantifiers include

  • E=0E = 0E=0. Both (2) and (3) include E=0E = 0E=0. There the hypothesis says the word-ball sizes of HHH are bounded above by a constant, and the conclusion says the same for GGG.

  • min⁡\minmin can be 000. In (3), min⁡(E,e2(H))\min(E, e_2(H))min(E,e2​(H)) is 000 whenever e2(H)=0e_2(H) = 0e2​(H)=0, which happens in particular when c(H)=0c(H) = 0c(H)=0 (the sum is empty — e.g. HHH trivial) and also when every rk(H)=0r_k(H) = 0rk​(H)=0 (e.g. when all the abelian groups Qk(H)Q_k(H)Qk​(H) are finite). In those cases (3) asserts that GGG has polynomial growth of degree ≤0\le 0≤0, i.e. that the word-ball sizes of GGG are bounded by a constant.

  • min⁡\minmin vs. EEE. Since min⁡(E,e2(H))≤E\min(E, e_2(H)) \le Emin(E,e2​(H))≤E, claim (3) is a statement about an exponent no larger than the one in claim (2). The statement asserts the bound with the exponent min⁡(E,e2(H))\min(E, e_2(H))min(E,e2​(H)) exactly; it does not assert any equality, nor that e2(H)e_2(H)e2​(H) is the least possible exponent, nor anything about e2(H)e_2(H)e2​(H) itself beyond its appearance inside the minimum.

  • Junk-value conventions in force. Three total functions with junk values appear: the cardinality of an infinite set is 000 (harmless here, the word balls being finite); the nilpotency class of a non-nilpotent group is 000 (in (3) it is guarded by the nilpotency hypothesis, so it is the genuine class there); and a Z\mathbb{Z}Z-rank that is infinite is recorded as 000, which is not guarded by anything and is a genuine part of what rk(H)r_k(H)rk​(H) means.

  • Vacuity. None of the hypotheses is impossible to satisfy: the trivial group with its trivial subgroup satisfies all of them, and so does any finite group with any subgroup. The antecedents inside (2) and (3) ("HHH has polynomial growth of degree ≤E\le E≤E", "HHH is nilpotent") are ordinary implications: if they fail for a given HHH and EEE, the corresponding claim holds without content for that HHH and EEE, but claim (1) is asserted unconditionally.

  • No symmetry or minimality is required of the generating sets. In each occurrence of "polynomial growth of degree ≤E\le E≤E", the generating set is a fresh existential; the sets witnessing the hypothesis in HHH and the conclusion in GGG need not be related, and neither is required to be symmetric — symmetry is built into the ball instead.

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