Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 1: the conjugates βkαβ−k\beta^k \alpha \beta^{-k}βkαβ−k span a finitely generated subgroup

Proved
Milnor.fg_closure_zpow_conj_of_not_hasExponentialGrowth

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

group-growthgroup-theorypolycyclic-groupssolvable-groups

Let BBB be a finitely generated group and AAA an abelian normal subgroup. If BBB does not have exponential growth (no finite generating set gives a ball of radius nnn of size ≥cn\ge c^n≥cn for some c>1c > 1c>1 and all nnn), then for every α∈A\alpha \in Aα∈A and β∈B\beta \in Bβ∈B the subgroup generated by the conjugates βkαβ−k\beta^k \alpha \beta^{-k}βkαβ−k, k∈Zk \in \mathbb Zk∈Z, is finitely generated.

Preamble
import Definitions.Def_Chou_Growth
import Mathlib
Formal statement
namespace Milnor

/-- Milnor, Lemma 1 (p. 447), in the standing setting of a group extension `1 → A → B → C → 1`
with `A` abelian and `B` finitely generated: if `B` does not have exponential growth, then for each
`α ∈ A` and `β ∈ B` the set of all conjugates `β^k α β^{-k}`, `k ∈ ℤ`, spans a finitely generated
subgroup of `A`. -/
theorem fg_closure_zpow_conj_of_not_hasExponentialGrowth {B : Type*} [Group B] [Group.FG B]
    (A : Subgroup B) [A.Normal] [IsMulCommutative A] (h : ¬ Chou.HasExponentialGrowth B)
    (α : B) (hα : α ∈ A) (β : B) :
    (Subgroup.closure {x : B | ∃ k : ℤ, x = β ^ k * α * β ^ (-k)}).FG := by
  sorry

end Milnor
Source
Milnor, J., Growth of finitely generated solvable groups, Journal of Differential Geometry 2 (1968) 447–449, https://doi.org/10.4310/jdg/1214428659, Lemma 1, p. 447
Read-back

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

Read-back

The single declaration in the artifact

Setting and data

Let BBB be a group. (In the Lean text BBB is an arbitrary type in an arbitrary universe, carrying a group structure; nothing about BBB is assumed beyond the hypotheses listed below — in particular BBB is not assumed finite, infinite, abelian, or torsion-free.)

The statement takes the following data:

  • BBB, a group;
  • AAA, a subgroup of BBB;
  • α\alphaα, an element of BBB;
  • β\betaβ, an element of BBB.

Hypotheses

(H1) BBB is finitely generated. Precisely: there is a finite subset S⊆BS \subseteq BS⊆B such that the smallest subgroup of BBB containing SSS is all of BBB. ("Smallest subgroup containing a set" means the intersection of all subgroups of BBB that contain the set.)

(H2) AAA is a normal subgroup of BBB. Precisely: for every n∈An \in An∈A and every g∈Bg \in Bg∈B, the element gng−1g n g^{-1}gng−1 lies in AAA.

(H3) AAA is abelian. Precisely: any two elements of AAA commute with each other, i.e. ab=baa b = b aab=ba for all a,b∈Aa, b \in Aa,b∈A. (Only elements of AAA are required to commute; no commutativity is assumed anywhere else in BBB.)

(H4) BBB does not have exponential growth. This is the negation of a defined property, which must be unfolded in full.

For a subset S⊆BS \subseteq BS⊆B and a natural number nnn, define the word ball of radius nnn

BS(n)  =  { g∈B  :  g=g1g2⋯gm for some m≤n and some g1,…,gm each satisfying gi∈S or gi−1∈S }.\mathcal{B}_S(n) \;=\; \Big\{\, g \in B \;:\; g = g_1 g_2 \cdots g_m \text{ for some } m \le n \text{ and some } g_1,\dots,g_m \text{ each satisfying } g_i \in S \text{ or } g_i^{-1} \in S \,\Big\}.BS​(n)={g∈B:g=g1​g2​⋯gm​ for some m≤n and some g1​,…,gm​ each satisfying gi​∈S or gi−1​∈S}.

Three points of literal detail about this set.

  1. The factors are taken from a finite list of length m≤nm \le nm≤n; the product is formed in the listed order; repetitions among the gig_igi​ are allowed. The length bound is ≤n\le n≤n, not =n= n=n.
  2. The list may be empty (m=0m = 0m=0), and the empty product is the identity. Hence 1∈BS(n)1 \in \mathcal{B}_S(n)1∈BS​(n) for every SSS and every nnn, and in particular BS(0)={1}\mathcal{B}_S(0) = \{1\}BS​(0)={1}, so BS(n)\mathcal{B}_S(n)BS​(n) is never empty.
  3. Each factor is required to satisfy "gi∈Sg_i \in Sgi​∈S or gi−1∈Sg_i^{-1} \in Sgi−1​∈S"; that is, the factors are drawn from S∪S−1S \cup S^{-1}S∪S−1. SSS itself is not assumed symmetric.

Now, "BBB has exponential growth" means:

there exist a finite subset S⊆BS \subseteq BS⊆B generating BBB (the smallest subgroup of BBB containing SSS is all of BBB), and a real number ccc with 1<c1 < c1<c, such that for every natural number nnn,

cn  ≤  ∣BS(n)∣,c^{n} \;\le\; \big|\mathcal{B}_S(n)\big| ,cn≤​BS​(n)​,

where ∣X∣|X|∣X∣ denotes the cardinality of XXX as a natural number, with the convention that an infinite set has cardinality 000, and where this natural number is then regarded as a real number, and cnc^ncn is the nnn-th power of the real number ccc with nnn a natural-number exponent (so c0=1c^0 = 1c0=1).

Note the quantifier order inside this property: a single constant ccc must work for all radii nnn simultaneously, and it suffices that one finite generating set SSS admits such a ccc; the property says nothing about non-generating finite subsets, and nothing about infinite generating sets.

Hypothesis (H4) is the negation of that property. Unfolded, it says:

for every finite subset S⊆BS \subseteq BS⊆B whose generated subgroup is all of BBB, and for every real number c>1c > 1c>1, there exists a natural number nnn with

∣BS(n)∣  <  cn.\big|\mathcal{B}_S(n)\big| \;<\; c^{n}.​BS​(n)​<cn.

(The cardinality convention matters in principle: if some word ball were infinite, its cardinality would be read as 000, which is <cn< c^n<cn for every nnn. Here SSS ranges over finite sets, so each ball is in fact a finite set.)

(H5) α∈A\alpha \in Aα∈A.

There is no hypothesis on β\betaβ: it is an arbitrary element of BBB, not assumed to lie in AAA, not assumed to commute with α\alphaα, not assumed to be of infinite order, and not assumed distinct from 111 or from α\alphaα.

Conclusion

Consider the subset of BBB

C  =  { x∈B  :  x=βk α β−k for some k∈Z },C \;=\; \big\{\, x \in B \;:\; x = \beta^{k}\,\alpha\,\beta^{-k} \text{ for some } k \in \mathbb{Z} \,\big\},C={x∈B:x=βkαβ−k for some k∈Z},

that is, the set of all conjugates of α\alphaα by integer powers of β\betaβ. Here βk\beta^{k}βk is the integer power of β\betaβ in the group BBB (so β0=1\beta^{0} = 1β0=1, and negative exponents give inverses of positive powers), β−k\beta^{-k}β−k is the power at the negated integer −k-k−k, which equals (βk)−1(\beta^{k})^{-1}(βk)−1, and the triple product is grouped as (βkα) β−k(\beta^{k}\alpha)\,\beta^{-k}(βkα)β−k — the same element either way, by associativity. The index kkk ranges over all integers, positive, negative and zero.

The conclusion asserts:

the subgroup of BBB generated by CCC — the intersection of all subgroups of BBB containing CCC — is finitely generated, meaning there exists a finite subset T⊆BT \subseteq BT⊆B such that the subgroup generated by TTT is exactly that subgroup.

(TTT is a finite subset of BBB, not a priori of CCC; but since the subgroup it generates equals the subgroup generated by CCC, TTT is necessarily contained in that subgroup.)

Degenerate cases silently included

  • Taking k=0k = 0k=0 gives β0αβ0=α\beta^{0}\alpha\beta^{0} = \alphaβ0αβ0=α, so α∈C\alpha \in Cα∈C and CCC is never empty; the generated subgroup always contains α\alphaα.
  • β=1\beta = 1β=1 is allowed, in which case C={α}C = \{\alpha\}C={α} and the conclusion is that the cyclic subgroup generated by α\alphaα is finitely generated.
  • α=1\alpha = 1α=1 is allowed, in which case C={1}C = \{1\}C={1} and the generated subgroup is trivial.
  • AAA may be the trivial subgroup {1}\{1\}{1} (which is normal and abelian), which forces α=1\alpha = 1α=1; and AAA may be all of BBB, which forces BBB itself to be abelian by (H3).
  • β\betaβ may have finite order, in which case CCC is a finite set.
  • The hypotheses are jointly satisfiable — for instance by the trivial group with A=B={1}A = B = \{1\}A=B={1} — so the statement is not vacuous.

Statement of the quantification, in one sentence

For every group BBB that is finitely generated and does not have exponential growth in the sense above, every normal abelian subgroup AAA of BBB, every α∈A\alpha \in Aα∈A and every β∈B\beta \in Bβ∈B, the subgroup of BBB generated by {βkαβ−k:k∈Z}\{\beta^{k}\alpha\beta^{-k} : k \in \mathbb{Z}\}{βkαβ−k:k∈Z} is finitely generated.

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

  • Endorsed by dbenbenn · Sep 19, 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