Finitely generated nilpotent groups are finitely presented (external)
ProvedChou.isFinitelyPresented_of_isNilpotent_of_fgA finitely generated nilpotent group is finitely presented.
import Mathlib
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
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 be a set carrying a group structure. Assume that is finitely generated and that is nilpotent. Then is finitely presented.
The variable is implicit and universally quantified: the statement is about every type , in every universe, together with every group structure on it. No further assumption is made on — 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
is equipped with a group structure: an associative multiplication with a two-sided identity 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 containing and closed under multiplication and inversion, and for a subset the subgroup generated by means the intersection of all subgroups of that contain — the smallest such subgroup.
Hypothesis 1: is finitely generated
This unfolds to:
More precisely, is given as a finite list of elements of 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 is the whole subgroup — equality of subgroups, not merely containment in one direction.
Degenerate cases included: may be empty, in which case the condition says is the trivial group. So the trivial group satisfies this hypothesis.
Hypothesis 2: is nilpotent
Define a sequence of subgroups of by
(The commutator convention in force is ; the bracket in the definition of is that one, with the element being tested and the quantified element.) Each is exactly the preimage in of the centre of under the quotient map; in particular is the centre of . This is the upper central series, indexed by the natural numbers starting at .
The hypothesis is:
Note the quantifier: some works, with no bound supplied and no claim about which . The index is permitted, and , so for the condition says is trivial. The statement is the existence of a finite index at which the upper central series reaches all of — equality with , not merely a containment or a limit/union condition.
Conclusion: is finitely presented
For , write for the free group on the -element index set — concretely, words in letters and their formal inverses modulo free reduction, which has the usual universal property (every function from the letters into a group extends uniquely to a group homomorphism out of ). For this is the trivial group.
For a subset of a group , the normal closure of means the subgroup of generated by the set of all conjugates of elements of , namely by
The conclusion is:
- is surjective (every element of is for some ), and
- the kernel is the normal closure, in , of some finite subset ; that is,
where is the normal closure just described.
Several points of precision:
- Both quantifiers are existential, not unique-existential: no , no and no is singled out, and nothing is asserted about how small or 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 is a subset of and is not separately required to lie inside ; the asserted equality of the normal closure with forces anyway.
- "Finite" for means the set is finite in the ordinary sense (it is in bijection with for some ). The empty set is allowed: then the normal closure is the trivial subgroup and the condition says is an isomorphism onto , i.e. is free of finite rank.
- is allowed: then is trivial and surjectivity forces 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 has finitely normally generated kernel, and it does not produce a presentation from any given generating set.
- The number of generators is , 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 , its group structure, and both hypotheses universally quantified:
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.
Confirmed by the mission captain (proposal self-audit).