Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Finitely generated nilpotent groups are finitely presented (external)

Proved
Chou.isFinitelyPresented_of_isNilpotent_of_fg

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

amenable-groupselementary-amenable-groupsgroup-growthgroup-theory

A finitely generated nilpotent group is finitely presented.

Preamble
import Mathlib
Formal statement
namespace Chou

/-- p. 400 (external): a finitely generated nilpotent group is finitely presented. -/
theorem isFinitelyPresented_of_isNilpotent_of_fg {G : Type*} [Group G] [Group.FG G] [Group.IsNilpotent G] :
    Group.IsFinitelyPresented G := by
  sorry

end Chou
Source
Chou, C., Elementary amenable groups, Illinois Journal of Mathematics 24 (1980) 396–407, https://doi.org/10.1215/ijm/1256047608, p. 400 ("C₁ is also finitely generated and hence is finitely presented")
Read-back

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

Read-back

The declaration

There is one declaration in the artifact. It is a theorem with three hypotheses and one conclusion, all of them carried by unnamed (typeclass) assumptions on a single implicit variable.

What it asserts

Let GGG be a set carrying a group structure. Assume that GGG is finitely generated and that GGG is nilpotent. Then GGG is finitely presented.

The variable GGG is implicit and universally quantified: the statement is about every type GGG, in every universe, together with every group structure on it. No further assumption is made on GGG — it is not assumed finite, countable, abelian, torsion-free, or nontrivial.

Below, each of the four conditions is expanded to what it literally unfolds to.


The group structure

GGG is equipped with a group structure: an associative multiplication with a two-sided identity 111 and two-sided inverses (together with the derived division and integer-power operations, which play no role in the statement). Throughout, "subgroup" means a subset of GGG containing 111 and closed under multiplication and inversion, and for a subset X⊆GX \subseteq GX⊆G the subgroup generated by XXX means the intersection of all subgroups of GGG that contain XXX — the smallest such subgroup.


Hypothesis 1: GGG is finitely generated

This unfolds to:

∃ S⊆G finite,⟨S⟩=G.\exists\, S \subseteq G \text{ finite},\qquad \langle S \rangle = G .∃S⊆G finite,⟨S⟩=G.

More precisely, SSS is given as a finite list of elements of GGG without repetitions (so it is finite by construction, not merely asserted to be finite), and the assertion is that the subgroup generated by the underlying set of SSS is the whole subgroup GGG — equality of subgroups, not merely containment in one direction.

Degenerate cases included: SSS may be empty, in which case the condition says GGG is the trivial group. So the trivial group satisfies this hypothesis.


Hypothesis 2: GGG is nilpotent

Define a sequence Z0,Z1,Z2,…Z_0, Z_1, Z_2, \dotsZ0​,Z1​,Z2​,… of subgroups of GGG by

Z0={1},Zn+1  =  { x∈G  :  ∀ y∈G, xyx−1y−1∈Zn }.Z_0 = \{1\},\qquad Z_{n+1} \;=\; \bigl\{\, x \in G \;:\; \forall\, y \in G,\ x y x^{-1} y^{-1} \in Z_n \,\bigr\}.Z0​={1},Zn+1​={x∈G:∀y∈G, xyx−1y−1∈Zn​}.

(The commutator convention in force is [x,y]=xyx−1y−1[x,y] = x y x^{-1} y^{-1}[x,y]=xyx−1y−1; the bracket in the definition of Zn+1Z_{n+1}Zn+1​ is that one, with xxx the element being tested and yyy the quantified element.) Each Zn+1Z_{n+1}Zn+1​ is exactly the preimage in GGG of the centre of G/ZnG/Z_nG/Zn​ under the quotient map; in particular Z1Z_1Z1​ is the centre of GGG. This is the upper central series, indexed by the natural numbers starting at 000.

The hypothesis is:

∃ n∈N,Zn=G.\exists\, n \in \mathbb{N},\qquad Z_n = G .∃n∈N,Zn​=G.

Note the quantifier: some nnn works, with no bound supplied and no claim about which nnn. The index n=0n = 0n=0 is permitted, and Z0={1}Z_0 = \{1\}Z0​={1}, so for n=0n = 0n=0 the condition says GGG is trivial. The statement is the existence of a finite index at which the upper central series reaches all of GGG — equality with GGG, not merely a containment or a limit/union condition.


Conclusion: GGG is finitely presented

For n∈Nn \in \mathbb{N}n∈N, write FnF_nFn​ for the free group on the nnn-element index set {0,1,…,n−1}\{0, 1, \dots, n-1\}{0,1,…,n−1} — concretely, words in nnn letters and their formal inverses modulo free reduction, which has the usual universal property (every function from the nnn letters into a group extends uniquely to a group homomorphism out of FnF_nFn​). For n=0n = 0n=0 this is the trivial group.

For a subset RRR of a group HHH, the normal closure of RRR means the subgroup of HHH generated by the set of all conjugates of elements of RRR, namely by

{ c r c−1  :  r∈R, c∈H }.\{\, c\, r\, c^{-1} \;:\; r \in R,\ c \in H \,\}.{crc−1:r∈R, c∈H}.

The conclusion is:

∃ n∈N, ∃ φ:Fn→G a group homomorphism, such that\exists\, n \in \mathbb{N},\ \exists\, \varphi : F_n \to G \text{ a group homomorphism, such that}∃n∈N, ∃φ:Fn​→G a group homomorphism, such that
  1. φ\varphiφ is surjective (every element of GGG is φ(w)\varphi(w)φ(w) for some w∈Fnw \in F_nw∈Fn​), and
  2. the kernel ker⁡φ={ w∈Fn:φ(w)=1 }\ker \varphi = \{\, w \in F_n : \varphi(w) = 1 \,\}kerφ={w∈Fn​:φ(w)=1} is the normal closure, in FnF_nFn​, of some finite subset R⊆FnR \subseteq F_nR⊆Fn​; that is,
∃ R⊆Fn with R finite,⟨ ⁣⟨R⟩ ⁣⟩Fn=ker⁡φ,\exists\, R \subseteq F_n \text{ with } R \text{ finite},\qquad \langle\!\langle R \rangle\!\rangle_{F_n} = \ker\varphi ,∃R⊆Fn​ with R finite,⟨⟨R⟩⟩Fn​​=kerφ,

where ⟨ ⁣⟨R⟩ ⁣⟩Fn\langle\!\langle R \rangle\!\rangle_{F_n}⟨⟨R⟩⟩Fn​​ is the normal closure just described.

Several points of precision:

  • Both quantifiers are existential, not unique-existential: no nnn, no φ\varphiφ and no RRR is singled out, and nothing is asserted about how small nnn or RRR can be taken, nor any relationship between them and the generating set from Hypothesis 1 or the nilpotency index from Hypothesis 2.
  • The relation set RRR is a subset of FnF_nFn​ and is not separately required to lie inside ker⁡φ\ker\varphikerφ; the asserted equality of the normal closure with ker⁡φ\ker\varphikerφ forces R⊆ker⁡φR \subseteq \ker\varphiR⊆kerφ anyway.
  • "Finite" for RRR means the set is finite in the ordinary sense (it is in bijection with {0,…,k−1}\{0,\dots,k-1\}{0,…,k−1} for some k∈Nk \in \mathbb{N}k∈N). The empty set is allowed: then the normal closure is the trivial subgroup and the condition says φ\varphiφ is an isomorphism onto GGG, i.e. GGG is free of finite rank.
  • n=0n = 0n=0 is allowed: then F0F_0F0​ is trivial and surjectivity forces GGG to be trivial.
  • The conclusion is stated as the existence of such a presentation. It does not say that every surjection from a finitely generated free group onto GGG has finitely normally generated kernel, and it does not produce a presentation from any given generating set.
  • The number of generators is nnn, a natural number, so the generating set of the presentation is finite; the relators are finite in number. These are two separate finiteness conditions, both asserted.

Overall shape, and satisfiability

The whole declaration is an implication with GGG, its group structure, and both hypotheses universally quantified:

∀ G a group,(G finitely generated)∧(G nilpotent)  ⟹  (G finitely presented).\forall\, G \text{ a group},\quad \bigl(G \text{ finitely generated}\bigr) \wedge \bigl(G \text{ nilpotent}\bigr) \;\Longrightarrow\; \bigl(G \text{ finitely presented}\bigr).∀G a group,(G finitely generated)∧(G nilpotent)⟹(G finitely presented).

It is an implication, not a biconditional: nothing is asserted in the converse direction.

The two hypotheses are not vacuous and are jointly satisfiable — for instance any finite group, or the trivial group, satisfies both — so the statement is not an assertion about an empty class of groups. The trivial group is included in the scope of the statement, as are all finite groups and all finitely generated abelian groups.

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