An extension of a finitely presented group by a finite group is finitely presented
ProvedChou.isFinitelyPresented_of_isFinitelyPresented_of_finite_quotientIf is a normal subgroup of such that is finitely presented and the quotient is finite, then is finitely presented.
import Mathlib
namespace Chou
/-- p. 400, as Chou states it: an extension of a finitely presented group by a finite group is
finitely presented. -/
theorem isFinitelyPresented_of_isFinitelyPresented_of_finite_quotient {G : Type*} [Group G] (N : Subgroup G) [N.Normal]
[Group.IsFinitelyPresented N] [Finite (G ⧸ N)] : Group.IsFinitelyPresented G := by
sorry
end Chou
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back
The file contains a single declaration. What follows is a rendering of what it literally asserts.
Preliminary: what "finitely presented" unfolds to
The statement is built from one non-elementary notion, applied twice. For a group , the assertion " is finitely presented" unfolds, with nothing left abbreviated, to:
There exist a natural number and a group homomorphism
from the free group on the -element index set into , such that
- is surjective, and
- there exists a subset such that is finite and
an equality of subgroups of (each contains the other).
Here two further items are themselves unfolded as follows.
-
is the subgroup of .
-
, the normal closure of , is the subgroup of generated by the set of all conjugates of all elements of ; that is, the subgroup generated by
It is the smallest subgroup of that contains and is closed under conjugation. Note that it is the normal closure that must equal on the nose, not merely the ordinary subgroup generated by , and not merely a subgroup contained in or containing .
So "finitely presented" means: admits a presentation with finitely many generators and finitely many relations — the generators being in number and indexed by , and the relators being the finitely many elements of , whose normal closure is required to be exactly the set of words that die in .
Two degenerate readings are included by the quantifiers. The case is permitted: is the trivial group, and surjectivity of then forces to be trivial. The case is permitted: the normal closure of the empty set is the trivial subgroup, so this case says is an isomorphism and is free of rank . Neither nor is claimed to be unique or minimal, and no bound on either is asserted.
The declaration
Fix
- a type , living in an arbitrary universe (the universe is a free parameter of the statement, not fixed to any particular one);
- a group structure on ;
- a subgroup of .
Assume:
(H1) is normal in , i.e. for every and every one has .
(H2) , regarded as a group in its own right, is finitely presented. The group in question is the one carried by the set , with the multiplication, identity and inverse inherited from . "Finitely presented" means precisely what is unfolded above, with taken to be this group: there are and a surjective homomorphism whose kernel is the normal closure — taken inside — of some finite subset of .
(H3) The quotient is a finite type. The object is the set of equivalence classes of the relation on given by
i.e. the set of left cosets . (Under (H1) left and right cosets coincide, but the relation as written is the left-coset relation.) Finiteness of this type means: there is a natural number and a bijection between and . Equivalently, has finite index in . No bound on that index is fixed, and is formally allowed by the definition of finiteness but cannot occur, since always contains the class of the identity.
Conclusion. is finitely presented — again in exactly the unfolded sense above, with taken to be : there exist , a surjective homomorphism , and a finite subset whose normal closure inside equals exactly.
Remarks on scope and edge cases
The number of generators and the relator set asserted for are bare existential claims. Nothing relates them to the corresponding data for : no formula, no bound in terms of the index of or of the presentation of , and no statement that a presentation of can be computed from one of .
The subgroup is an explicit parameter of the statement; the type , its group structure, and the three hypotheses (H1)–(H3) are all supplied implicitly, (H1)–(H3) by instance resolution. This affects only how the statement is invoked, not what it asserts.
The hypotheses are jointly satisfiable, so the statement is not vacuous. For instance, any finite group with trivial satisfies all three; or with any finitely presented group, in which case is a one-element set. The extreme cases are all inside the statement's scope:
- the trivial subgroup: (H2) holds automatically, and (H3) says itself is finite.
- : (H3) holds automatically, and the statement degenerates to an implication from finitely presented to finitely presented.
- trivial: everything holds.
The statement is a one-directional implication. It does not assert the converse (that a finitely presented group has finitely presented finite-index normal subgroups), nor any equivalence.
Confirmed by the mission captain (proposal self-audit).