Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

An extension of a finitely presented group by a finitely presented group is finitely presented

Proved
GroupFiniteness.isFinitelyPresented_of_extension

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

combinatorial-group-theoryfinitely-presented-groupsgroup-theory

Let NNN be a normal subgroup of a group GGG such that both NNN and the quotient G/NG/NG/N are finitely presented. Then GGG is finitely presented.

A presentation of GGG is obtained from generators of NNN together with lifts of generators of G/NG/NG/N, with relations: the relations of NNN, the relations of G/NG/NG/N read as words that land in NNN and then expressed in the generators of NNN, and the conjugation relations expressing xnx−1x n x^{-1}xnx−1 in the generators of NNN for each generator xxx of the lift and each generator nnn of NNN.

The weaker-looking hypothesis that NNN is merely finitely generated and G/NG/NG/N finitely presented does not suffice: taking N=GN = GN=G would make every finitely generated group finitely presented.

Preamble
import Mathlib
Formal statement
namespace GroupFiniteness

/-- P. Hall: an extension of a finitely presented group by a finitely presented group is finitely
presented. Note that the weaker-looking hypothesis "`N` finitely generated and `G ⧸ N` finitely
presented" does **not** suffice: taking `N = G` would make every finitely generated group finitely
presented. -/
theorem isFinitelyPresented_of_extension {G : Type*} [Group G] (N : Subgroup G) [N.Normal]
    [Group.IsFinitelyPresented N] [Group.IsFinitelyPresented (G ⧸ N)] :
    Group.IsFinitelyPresented G := by
  sorry

end GroupFiniteness
Source
Standard; due to P. Hall, Finiteness conditions for soluble groups, Proceedings of the London Mathematical Society s3-4 (1954) 419–436, https://doi.org/10.1112/plms/s3-4.1.419, where finite presentability of such extensions is part of the finiteness-condition theory. The statement here is the general group-theoretic fact, not a result of any one paper of the missions this was developed for.

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