← All papers
First page of Every countable group embeds in a group of type $\mathrm{FP}_n$

Every countable group embeds in a group of type $\mathrm{FP}_n$

Laurent Bartholdi, Roman Mikhailov

math.GR Sep 29, 2026 · v2
Theorem A (every countable group embeds in a group of type FP_n) was formalized in Lean/Mathlib; the formalization is available on request.
For every integer $n\ge2$, we prove that every countable group embeds in a group of type $\mathrm{FP}_n$. We also construct a group of type $\mathrm{F}_n$ containing a copy of every recursively presented group. Consequently, a finitely generated group embeds in a group of type $\mathrm{F}_n$ if and only if it is recursively presented. This answers questions of Fournier-Facio and Zaremsky, and confirms a suggestion of Gromov. An appendix combines the construction with the controlled-filling argument in a subsequently released OpenAI preprint to prove that every countable group embeds in a two-generator group of type $\mathrm{FP}_\infty$.

The question is whether every countable group embeds in a group of type FP_n, and which groups embed in groups of type F_n, for each n ≥ 2. These questions extend the theorems of Higman and Leary and were posed by Fournier-Facio and Zaremsky.

A degree-raising criterion is proved for ascending HNN extensions, using chain lifts of endomorphisms and a mapping-cone argument. A finite oriented triple system built from the Fano plane, whose incidence graph has girth at least 12, defines a complex-of-groups construction with injective vertex maps. Products of endomorphisms with commuting images are controlled at the chain level. Combined with Higman–Neumann–Neumann embeddings and oracle-relative recursive presentations, this yields the main theorems, and Theorem A was formalized in Lean/Mathlib.

Every countable group embeds in a group of type FP_n. There is a group of type F_n containing every recursively presented group, so a finitely generated group embeds in an F_n group if and only if it is recursively presented. An appendix gives embeddings into two-generator groups of type FP_∞.