WorksMathematics
Every countable group embeds in a group of type
Abstract
For every integer , we prove that every countable group embeds in a group of type . We also construct a group of type containing a copy of every recursively presented group. Consequently, a finitely generated group embeds in a group of type 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 .
Introduction
A group is of type if the trivial module has a projective resolution over the integral group ring that is finitely generated in degrees at most , and of type if it has an Eilenberg–Mac Lane space with finite -skeleton. Higman [7] proved that a finitely generated group embeds in a finitely presented group if and only if it is recursively presented, and Leary [9 Theorem 1.1] proved that every countable group embeds in a group of type . We extend both embedding results to arbitrary degree :
Theorem A. Let be an integer. Every countable group embeds in a group of type .
Theorem B. Let be an integer. There is a group of type that contains a copy of every recursively presented group.
Corollary C. Let be an integer. A countable group embeds in a group of type if and only if it embeds in a finitely presented group. In particular, a finitely generated group embeds in a group of type if and only if it is recursively presented.
Misha Gromov suggested, after a talk of the first-named author at the 2015 meeting “Growth, symbolic dynamics and combinatorics of words in groups” in Paris, that perhaps the only obstruction to embedding theorems lies in dimension 2. Corollary C gives a precise finite-degree version of this suggestion: passing from finite presentability to any fixed higher finiteness degree introduces no additional embedding obstruction.
Bestvina’s problem list [1] asks, in Question 8.7, whether the Prüfer -group can be embedded in an group, or at least an group; and whether every group can be embedded in an group, if . Theorem A settles the second question, while Theorem B settles the third one, both in the affirmative.
Theorem B also settles the part of [6 Question 1.4], and Theorem A the part of [6 Question 1.4]; both hold in every degree. The target groups in both theorems can be chosen to have two generators; see Corollary 7.7.
After this manuscript was completed, OpenAI proved that every finitely presented group embeds in a group of type [11], which settles the first part of Bestvina’s question. Combining its controlled-filling argument with our construction gives the analogous statement for arbitrary countable groups and type ; see Appendix § 8:
Theorem D. Every countable group embeds in a group of type .
The degree-raising criterion
The theorems of Higman and Leary are both proved with the Higman rope trick [10 IV.7.6], whose homological version is [9 Lemma 2.2]. Fournier-Facio and Zaremsky showed that the groups produced by the rope trick have infinite-dimensional third rational homology whenever the embedded group is infinite and [6 Theorem B]; in particular such groups are not of type . We raise the finiteness degree with ascending HNN extensions instead.
Let , let be a group of type , and fix an exact sequence of -modules
in which every is finitely generated and free. Then is of type if and only if is finitely generated [5 VIII.4.3]. Every endomorphism of has chain lifts to (1) (Definition 2.1), so each of them maps into itself.
Theorem E. Let , let be a group of type and let be an injective endomorphism. Suppose that some chain lift of satisfies for a finitely generated -submodule . Then embeds in the group
and is of type .
The hypothesis does not depend on the choice of the chain lift or of the finite free partial resolution; see Lemma 2.2 and Remark 2.3. It requires neither that be finitely generated nor that be -invariant.
Outline
A fixed finite system of commuting-copy and diagonal relations produces an injective endomorphism whose action on the top cycle module has image contained in a finitely generated submodule. Theorem E then raises the finiteness degree by one. We describe the three ingredients of this construction. An oriented triple system on a finite set is a set of triples of distinct elements of , with inputs and output (Definition 3.1). For a group , let () be copies of , write for the copy of , and put
with canonical homomorphisms , . Thus is generated by the copies subject to the following relations, one family for each triple : the input copies and commute elementwise, and for every , so that the output copy is identified with the diagonal in the input copies. For a single triple, , and , , are the two factors and the diagonal.
Suppose that is an embedding, and put . For each triple , the endomorphisms and have commuting images and for all . For such endomorphisms, chain lifts satisfy on modulo a finitely generated submodule (Lemma 5.1). Consequently, if the standard basis vector of is an integral linear combination of the vectors , the same combination of the maps shows that maps into a finitely generated submodule (Corollary 5.3). Theorem E then applies to , provided is injective. We show that every is injective, for every group , when the incidence graph of has girth at least , by realising as the fundamental group of a non-positively curved complex of groups (Lemma 4.1). A single system satisfying both conditions serves for every group and every degree; it has 15 triples and is obtained from the flags of the Fano plane (Proposition 3.2). Finally, an embedding exists whenever is itself finitely generated and recursively presented relative to a fixed oracle, and contains every finitely generated group that is recursively presented relative to that oracle. Both properties survive the ascending HNN extension. A two-generator universal group supplies the initial case (Lemma 7.2). In particular, for the argument gives a new proof of Leary’s theorem that does not use the construction of [9]; he had asked for a simpler proof of his Theorem 1.1 in [9 Section 3].
Mitotic groups
The relations associated to a single triple in (1.2) are the factor-diagonal relations underlying a mitosis in the sense of Baumslag, Dyer and Heller [3 Section 4]. A supergroup of a group is a mitosis of if it is generated by and two elements such that and for all . The present construction replaces the conjugations by and by a finite network of endomorphisms satisfying the girth and integrality conditions above. Additivity is used on the top cycle module of a partial resolution (Section 5), to raise a finiteness property rather than to annihilate ordinary homology.
Relation to the work of Fournier-Facio and Zaremsky
Fournier-Facio and Zaremsky proved that if every finitely generated recursively presented group embeds in a recursively presented group of type , then every finitely presented group embeds in a group of type [6 Theorem A]. Theorem 7.3 with the empty oracle supplies this hypothesis, so Theorem B can also be deduced from their result. We give an equally short direct proof in Subsection 7.1.
Statement on AI use
ChatGPT 6 Astra was used to assist with the proof of the main results and the preparation of an initial draft of the manuscript. Claude Opus 5.5 was used in subsequent editing. The arguments and text have been reviewed, checked, and substantially revised by the authors, who are responsible for the final manuscript.
Formalization
Theorem A has been formalized in Lean/Mathlib and is available on the Palomar repository as
https://palomar-registry.org/entry?id=PALOMAR-2026-09-30-000032.
Preliminaries
Conventions
Modules are left modules, and finite generation of a module refers to the indicated group ring. All finiteness properties are taken with integer coefficients; see [5 Chapter VIII]. A group of type is finitely generated. Presentations are written . For an injective endomorphism of a group , the ascending HNN extension contains by Britton’s lemma [10 IV.2]; its height is the homomorphism to sending to and to .
Let be a homomorphism of groups, extended to group rings. An additive map from a -module to a -module is -semilinear if for all and . We shall use repeatedly the following consequence of the definition:
Chain lifts
Throughout Sections 2–6, , is a group of type , the sequence (1.1) is fixed, and . We write for the augmented complex . It satisfies
Note that is the module , not the group homology .
Definition 2.1. Let be an endomorphism of . A chain lift of is a family of -semilinear maps , , such that for and . Its restriction to , which it maps into , is denoted by the same letter.
A chain lift of is the same as a -linear chain map, over the identity of , from to the complex obtained from by restricting scalars along . Since the are free and the augmented complex is exact at , such a map is constructed degree by degree on bases, as in the comparison theorem [5 I.7]. In particular, chain lifts exist. They are unique up to homotopy only below the top degree; the following lemma is the substitute that we need.
Lemma 2.2. If and are chain lifts of the same endomorphism of , then is contained in a finitely generated -submodule of .
Proof. Since and , choose a -semilinear map with . Inductively, for , construct -semilinear maps satisfying
Indeed, once the preceding maps have been constructed, the chain-map identities give
For the last equality follows from the choice of , and for from . Exactness at lets us lift the values through and extend -semilinearly. Now satisfies , so , and agrees with on . Since is -semilinear and is finitely generated, lies in a finitely generated submodule of by (3). □
Remark 2.3. The hypothesis of Theorem E is also independent of the chosen finite free partial resolution. Let be another such resolution through degree , put , and choose comparison maps and lifting . If is a chain lift of with , then is a chain lift of on and maps into the finitely generated submodule . Lemma 2.2, applied to , gives the same conclusion for every chain lift on . Interchanging the two resolutions proves independence.
Presentations relative to an oracle
Fix . All alphabets below are finite or countable, with a fixed effective enumeration, so that finite words have a computable encoding by natural numbers. A set of words is -recursively enumerable (-r.e.) if some Turing machine with oracle enumerates it. A presentation is -r.e. if is, and a countable group is -recursively presented if it admits such a presentation. For these are the countable recursively presented groups.
A finitely generated -recursively presented group has an -r.e. presentation on any finite generating set, since the relations among finitely many words in the generators of an -r.e. presentation form an -r.e. set. Every countable group has an -r.e. presentation for a suitable : choose a countable presentation and let encode its set of relators.
Adding finitely many generators and relators to an -r.e. presentation yields an -r.e. presentation. In particular, if is finitely generated and -recursively presented and is an injective endomorphism of , then is -recursively presented: it suffices to impose for in a finite generating set of , where is any word representing .
A finite system of triples
Definition 3.1. An oriented triple system on a finite set is a finite set of triples of distinct elements of ; we call the inputs and the output of , and the order of the inputs is immaterial. The elements of are called indices.
The incidence graph is the bipartite graph with vertex set in which is joined to when is an entry of . The row of is , where is the standard basis, and is the integer matrix with rows .
We shall use a system with a distinguished element satisfying
Condition (3.2) means that for every abelian group and every family in ,
Condition (3.1) is used only in Lemma 4.1, and condition (3.2) only in Corollary 5.3.
Proposition 3.2. There is an oriented triple system with 23 indices and 15 triples satisfying (3.1) and (3.2), with .
Proof. Let the points of the Fano plane be the elements of and its lines the sets , . Its flags are the pairs with and $d\in{0,1,3}; the flags through the point are , and . Let consist of the twenty flags other than and of three further indices , and $0$, and let consist of the fifteen triples
Thus consists of the flags through and of the flags on , except that the flag is replaced by in and by in .
Put on the triples and , and on the triples . In , a flag or is an input of one triple and of one triple , and contributes ; a flag with is the output of one and one , and contributes ; the index contributes from and from , the index contributes from and from , and the index contributes from . Hence , which is (3.2).
Every index other than lies in exactly two triples, and lies in only. Let be the graph with vertex set and, for each index other than , an edge joining the two triples that contain it. Then is obtained from by subdividing every edge and attaching the pendant vertex to , so its girth is twice that of . The graph is the incidence graph of the Fano plane, with corresponding to and to , in which the edge joining to is subdivided by the vertex ; see Figure 1. The incidence graph of a projective plane is bipartite and contains no cycle of length 4, since two points lie on a unique line; hence it has girth at least 6, and subdividing an edge does not shorten any cycle. Therefore has girth at least 12, which is (3.1). □

Figure 1. The graph of Proposition 3.2, with the half-edge 0 attached. Its vertices are the triples, and its unlabelled edges are the remaining flags of the Fano plane. The edge from to is subdivided into and by . The orientations are described in Remark 3.3.
Remark 3.3. The construction is an instance of the following principle. Let be a finite graph in which every vertex has degree 3, one of the edges being a half-edge with a single endpoint, and orient so that no vertex is a source or a sink and the half-edge is directed outwards. Taking the triples to be the sets of edges at the vertices, declare the output at each vertex to be the edge whose orientation there differs from that of the other two, and put or at vertices with one or two incoming edges respectively. Then the matrix with rows is the oriented incidence matrix of , with entry 1 at the tail and at the head of each edge, so vanishes on every edge with two endpoints and equals 1 on the half-edge; this is (3.2). Dually, a solution of the equations is a conserved flow on , and conservation forces the flow through the half-edge to vanish. Condition (3.1) holds as soon as has girth at least 6. In the proof above, is oriented from points to lines along the flags , and from lines to points along the flags , the subdivided flag runs from through to , and the half-edge leaves .
We fix the system of Proposition 3.2 for the rest of the paper.
The complex-of-groups construction
Recall the group from (1.2) and its canonical maps . For a single triple these maps are injective because . For a general triple system, the following condition on the incidence graph ensures injectivity.
Lemma 4.1. If girth , then is injective for every and every group .
Proof. Let be the poset with elements , the elements of and the elements of , ordered by whenever is an entry of . The monomorphisms of the complex of groups defined below go from larger to smaller elements of , that is, along and . Its geometric realisation is the cone with apex on , whose 2-simplices are the triangles with an entry of . In particular, is contractible.
Let be the simple complex of groups over , in the sense of [4 II.12], with local groups , for and for , and with the following monomorphisms: those out of are trivial, and for ,
The compatibility condition on composites is vacuous, because every chain of length two in begins at . The direct limit of is generated by the groups and subject to the identifications (4.1). Since is generated by and subject only to the relations that these subgroups commute, eliminating the groups yields the presentation (1.2). As is simply connected, this direct limit is the fundamental group of . It therefore suffices to show that is developable, since the local groups of a developable complex of groups embed in its fundamental group [4 II.12].
Make every triangle of a Euclidean triangle with side lengths , and . Its angles are at , at and at , and edges of the same type have the same length, so this is a piecewise Euclidean structure with a single shape. By [4 II.12.28] (see also [4 III.C.4.17]), is developable if it is non-positively curved, that is, if its local developments are locally CAT(0). For a 2-dimensional piecewise Euclidean complex this is the link condition: every injective loop in the link of a vertex has length at least [4 II.5]. The links at vertices of the local developments are as follows.
| vertex | local group | link | edge length | girth |
| point–coset incidence graph |
At the local group is trivial and the link is . At , put . The link is the simplicial join of two discrete sets: the set of directions towards lifts of , and the set of triples containing . Thus it is a complete bipartite graph.
At , let , and let be the diagonal. The link is the bipartite graph with point vertices and tagged coset vertices , . Each point is joined to the three tagged cosets containing it. Distinct cosets of the same subgroup are disjoint. If and two cosets of and meet at , their intersection is . Consequently, two distinct tagged cosets have at most one common point. This link has no cycle of length 4, so its girth is at least 6. In each case every injective loop has length at least , and the link condition holds.
Thus is non-positively curved, hence developable, and every is injective. □
Lemma 4.2. The construction is functorial. If with finite, then is presented by the generators (, ) and the relators
where denotes written in the letters . Consequently, preserves finite generation, finite presentability and, for finitely generated groups, -recursive presentability.
Proof. Functoriality is clear from (1.2). In the group given by the displayed presentation, the relators make the images of and commute, so is a homomorphism on . It agrees with on , hence on . So all relators in (1.2) follow from the displayed ones. □
Products of endomorphisms with commuting images
For group homology, the map induced by a pointwise product of homomorphisms with commuting images differs from the sum of the induced maps by mixed terms coming from the Künneth formula; Baumslag, Dyer and Heller control these terms by an induction on the degree [3 Proposition 4.1]. At the level of the partial resolution (1.1), which has no intermediate homology, the first possible mixed tensor term occurs in degree .
Lemma 5.1. Let be endomorphisms of such that and commute elementwise, and let . For any chain lifts of , there is a finitely generated -submodule such that
Proof. Let with differential , and with acting factorwise. Each is a finitely generated free -module. Write for its augmentation. Let and , where is regarded as a chain map from to concentrated in degree 0. These are chain maps , semilinear with respect to the two projections , and whenever has positive degree (similarly for ). The groups are free abelian and , so the Künneth formula has no Tor terms in degrees , and gives , for , and an isomorphism
In particular:
The product. Since the images commute, is a homomorphism . Choose on a basis so that . Since the are free and the augmented complex is exact at , this extends degree by degree to -semilinear maps , , commuting with the differentials. Put
We have , so . Since is -semilinear and is finitely generated, is finitely generated by (2.1). The chain maps and from to , where , are semilinear with respect to and . Hence and are chain lifts of and .
The diagonal. Let denote the brutal truncation of : its terms in degrees are unchanged and its terms in higher degrees are zero. Using in degree and exactness of the augmented complex at , construct a chain map with , semilinear with respect to the diagonal . We continue to use the full complex , including , when applying (5.1). Then is a chain lift of , and () is a -linear chain lift of . By Lemma 2.2 there are finitely generated submodules with . For , the element
is a cycle, and because and vanishes in positive degrees; likewise . By (5.1), , so . Since and similarly for , we obtain
and the right-hand side is a finitely generated submodule of by (2.1). Arbitrary lifts. Applying Lemma 2.2 to the pairs , and , and adding the resulting finitely generated submodules to , gives .
Remark 5.2. The proof gives a bound independent of and : if has rank , then can be generated by elements.
Corollary 5.3. Let be endomorphisms of such that, for every , the images of and commute elementwise and for all . Then every chain lift of maps into a finitely generated -submodule of .
Proof. Choose chain lifts of for . For each , Lemma 5.1 gives a finitely generated submodule containing ; let . By (3.2), applied to the abelian group of additive maps ,
Ascending HNN extensions: proof of Theorem E
Proof of Theorem E. By Britton’s lemma, embeds in . Since is a free right -module, the functor is exact. Put and . Then is exact, the are finitely generated free -modules, and is the kernel of .
Choose a chain lift of satisfying for a finitely generated -submodule , and define by
This is well defined: for we have in , so . The maps are -linear, commute with the differentials, and induce on because . Let generate . If and with , then . Hence
The sequence
is exact. Indeed, the height is constant on each coset and raises it by one, so the terms of minimal height of a nonzero element of survive in its image under . The cokernel of is the quotient of by the relations ; together with for , these identify with for every , hence identify all cosets, since and generate .
The idea is that, modulo , every is congruent to , which lies in the finitely generated submodule (6.1). We make this precise with a mapping cone.
Let be the brutal truncation in degrees of the mapping cone of : , for , with differentials
augmented by the composite . Since commutes with the differentials, . Let be a basis of . We show that is exact in degrees and that is generated by the elements
Mapping a free -module of rank onto then extends to a partial resolution of by finitely generated free -modules in degrees , so is of type .
Degree 0. Let have augmentation 0. By (6.2), its image in is for the image of some . Then lies in the kernel of , which is , so .
Degrees . Let with . We first show that for some . If , mapping to gives , so by (6.2) and . If , then and is a boundary because . Now . If , then for some , and . If , then lies in and
The elements with form the image of a -linear map , which is generated by the second family in (6.3). For we have , hence
where the first term lies in the span of the first family in (6.3) by (6.1), and the second in the span of the second family. □
Combining Theorem E with Corollary 5.3, we obtain:
Corollary 6.1. Let and let be a group of type . Let be endomorphisms of satisfying the hypothesis of Corollary 5.3, with injective. Then the ascending HNN extension of along contains and is of type .
Proofs of Theorem A, Theorem B and Corollary C
We fix an oracle . The first lemma is the Higman–Neumann–Neumann embedding theorem [8] (see [10 IV.3]), in a form that keeps track of presentations.
Lemma 7.1. Every countable group with an -r.e. presentation embeds in a two-generator -recursively presented group .
Proof. Write , repeating generators if necessary, and let be free of rank two. In put
The freely generate a free subgroup of . So do the , since the retraction killing maps them to the free basis of a subgroup of . Hence , and so , embeds in
The defining relations give and for . Eliminating and the presents on with relators obtained from by substituting these words, which is an -r.e. set. □
Lemma 7.2. There is a two-generator -recursively presented group that contains a copy of every finitely generated -recursively presented group. In particular, is of type .
Proof. For and an oracle Turing machine , let be the group generated by subject to those outputs of with oracle that are words in . Every finitely generated -recursively presented group is isomorphic to some . Using disjoint alphabets and dovetailing the enumerations, the free product of all these groups has an -r.e. presentation and contains each of them. By Lemma 7.1, embeds in a two-generator -recursively presented group . Finite generation is equivalent to type . □
Theorem 7.3. For every oracle and every integer there is an -recursively presented group of type that contains a copy of every finitely generated -recursively presented group. These groups can be chosen so that .
Proof. The group is given by Lemma 7.2. Suppose that has been constructed for some . By Lemma 4.2, is finitely generated and -recursively presented, so there is an embedding . Put for . The relations (1.2) show that the family satisfies the hypothesis of Corollary 5.3, and is injective by Lemma 4.1. By Corollary 6.1,
is of type and contains , hence every finitely generated -recursively presented group. It is -recursively presented by Subsection 2.3. □
Proof of Theorem A. Let be a countable group and choose such that has an -r.e. presentation (see Subsection 2.3). By Lemma 7.1, embeds in a finitely generated -recursively presented group, hence in , which is of type by Theorem 7.3. □
Remark 7.4. For every group is of type , and for the required embedding follows from Lemma 7.1. As constructed here, the group obtained depends on and on , and passing to a union does not give a group of type : the union of the chain is not finitely generated, since the height of vanishes on and takes the value at , so each inclusion is proper, and a finite subset of the union lies in some . Nevertheless, is already of type ; see Remark A.11.
Homotopical finiteness
We now turn to Theorem B and its corollary. We use the following classical result attributed to Wall [12]; see [5 VIII.7]. A short proof is given in [6 Lemma 2.1].
Lemma 7.5. A finitely presented group of type is of type . □
Proof of Theorem B. Let be the recursively presented free product constructed in Lemma 7.2. By Lemma 7.1 and Higman’s embedding theorem [7], it embeds in a finitely presented group . Every countable recursively presented group embeds, by Lemma 7.1, in a finitely generated recursively presented group, and the latter is isomorphic to a free factor of . Thus contains a copy of every countable recursively presented group.
Suppose that is finitely presented, of type , and contains . In particular, it contains a copy of every finitely presented group. By Lemma 4.2, is finitely presented and hence embeds in . As in the proof of Theorem 7.3, composing this embedding with the maps gives endomorphisms satisfying the hypotheses of Corollary 6.1, and the resulting ascending HNN extension is of type . It is finitely presented, being obtained from a finite presentation of by adding one generator and finitely many relators, so it is of type by Lemma 7.5. It contains , hence , hence a copy of every countable recursively presented group. □
Proof of Corollary C. A group of type with is finitely presented, so every subgroup of such a group embeds in a finitely presented group. Conversely, if a countable group embeds in a finitely presented group , then Theorem B embeds , and hence , in a group of type . For the final assertion, a finitely generated subgroup of a finitely presented group is recursively presented: choose words for its generators and enumerate the relations among them that follow from the finite presentation. The converse is Higman’s embedding theorem [7]. □
Two-generator versions
The finite-generator version of Lemma 7.1 preserves the finiteness properties considered here.
Lemma 7.6. Let . Every finitely generated group of type embeds in a two-generator group of type . If the original group is of type , the two-generator group can also be chosen of type .
Proof. Let , with , and use the construction of Lemma 7.1 with only the indices . The subgroups generated by and by are free of rank . Thus
contains by Britton’s lemma and is generated by , by the same elimination formulas as before.
We recall why the finite-rank edge groups preserve type . For a group that is the fundamental group of a finite graph of groups, the augmented cellular chain sequence of its Bass–Serre tree is
where one edge is chosen from each unoriented edge orbit. Induce free resolutions of over the vertex and edge groups to , lift the first map in this sequence to a chain map, and take its mapping cone. Exactness of induction and the homology sequence of the cone show that this is a free resolution of . Its degree- term is the sum of the induced degree- vertex terms and degree- edge terms. Hence is of type if its vertex groups are of type and its edge groups are of type .
Apply this first to the free product , whose edge group is trivial, and then to the HNN extension defining , whose edge group is free of finite rank. This proves that is of type . If is of type , it is finitely presented, and so is : the construction adds finitely many generators and relators. Lemma 7.5 then shows that is of type .
Corollary 7.7. Let . Every countable group embeds in a two-generator group of type . Moreover, there is a two-generator group of type containing a copy of every countable recursively presented group.
Proof. Apply Lemma 7.6 to the groups supplied by Theorems A and B, which are finitely generated because .
Appendix A. Embedding in a group of type
The preprint [11], released on 6 October 2026, constructs a group of type containing a copy of every finitely presented group. Its controlled-filling argument, combined with the triple system of Proposition 3.2 and the oracle-universal groups of Lemma 7.2, yields the following result, which contains Theorem D.
Theorem A.1. Let . There is a two-generator -recursively presented group of type that contains a copy of every countable -recursively presented group. In particular, every countable group embeds in a two-generator group of type .
The group depends on the oracle, but not on any finiteness degree; see Remark A.11.
Relation to OAI
We adapt three ingredients of [11]: controlled additivity [11 Lemma 6.1], the inductive construction of uniform fillings [11 Proposition 6.2], and the passage to homology with coefficients in products of free modules [11 Sections 7.2–7.4]. The two idempotent diagrams of [11] are replaced by the integral identity (3.2), which annihilates the relevant classes directly; finite generation of the base group, rather than finite presentability, starts the induction; the fillings are organised as controlled partial contractions of powers of the endomorphism, which serve both in the induction and in the coefficient argument; and the geometric argument of [11 Lemma 7.1] is replaced by an algebraic one. We do not use [11 Theorem 5.1], whose hypothesis that the endomorphism factors through a finitely presented group is not available here.
The core of the argument is the following.
Proposition A.2. Let be a finitely generated group, and let be endomorphisms of satisfying the hypothesis of Corollary 5.3, with injective. Then
is of type .
We fix , , and as in Proposition A.2 until its proof is complete.
Controlled chains
For a group , let be the normalized homogeneous bar complex: is the free abelian group on the tuples with for all , a tuple with two consecutive equal entries is read as 0, and is the alternating sum of the deletions. With diagonal left translation and the augmentation , it is a free -resolution of [5 I.5]. A homomorphism induces, entrywise, a -semilinear chain map . The constant map likewise induces a chain map of ; thus in degree 0, and in positive degrees.
A bound in is a finite symmetric subset containing 1. Let be spanned by the tuples with for all . It is a subcomplex, invariant under left translation, and is a free -module on the finite set of its nondegenerate tuples with ; this set is part of a -basis of , so is a direct summand of . Every chain lies in for some bound , a finite union of bounds is a bound, for every homomorphism , and is a bound in . An additive map defined on is controlled if its image lies in for some bound . This restricts the shape of the simplices that occur, but neither their number, nor their coefficients, nor the position of their vertices.
Definition A.3. Let be an endomorphism of , let be a bound in and let . A controlled -contraction of over is a family of controlled additive maps , , such that, with ,
If is a controlled -contraction of over , then is one of for every endomorphism of , since $\psi_c_=c_*.
Controlled additivity
Let be the Alexander–Whitney map,
and let be the shuffle map: on tuples of lengths and , it is the sum, over the monotone lattice paths from to , of the tuples of pairs of entries visited by the path, with sign , where is the number of pairs consisting of a vertical step and a later horizontal step. Both are natural chain maps of normalized chains, with the differential on tensor products. The map takes to , since it only takes faces, and takes to Write for , , . For every chain of ,
Lemma A.4. There are additive maps , , such that
and for every bound .
Proof. For and a chain , let be obtained by prepending to every tuple; then whenever is a cycle of positive degree. In degree 0, both and map to ; put there. Let , and suppose that has been defined in degrees , satisfies the identity there, and maps every tuple to a chain whose entries are pairs of entries of that tuple. Let be a nondegenerate tuple with set of entries . The chain has entries in , and is a cycle by the identity in degree . Put . If , then for all , whence the last assertion. ∎
Lemma A.5 (Controlled additivity; cf. [11 Lemma 6.1]). Let , let be a bound in , and let be an endomorphism of admitting a controlled -contraction over . Let be endomorphisms of whose images commute elementwise, and put . Then there is a bound such that, for every cycle ,
Proof. Let be the contraction, put for , and let on . This is a chain map, with , for , and ; in particular for every cycle . On define , of degree , by
Since , direct expansion gives . Put on . Lemma A.4 and the naturality give
Let be a bound containing and the images of () and () on . Only these maps enter on , so maps into .
Let be a cycle. In , the terms of bidegree with vanish, and the two remaining terms sum to . By (A.2),
Since the images of and commute, defines a homomorphism with , and . Hence
Finally, is a bound, symmetric because the images commute, and maps into , since . □
Contractions of powers of
Proposition A.6 (cf. [11 Proposition 6.2]). For every and every bound in , some power with admits a controlled -contraction over .
Proof. For , fix a finite symmetric generating set of containing . For each , choose with , and put
Then , so is a controlled -contraction of over every bound. The lengths need not be bounded.
Let , and assume the assertion in degree for all bounds. Let be a controlled -contraction of over . For each nondegenerate tuple in , the chain is a cycle, since
indeed vanishes in positive degrees and . The cycles all lie in for one bound , because and are controlled. By hypothesis, some admits a controlled -contraction over . Apply Lemma A.5 with to for each triple of , and let be the union of the resulting bounds. For a cycle put . Then for every , and (3.2), applied in the abelian group , gives
In particular, for some . Extend additively to . Then is a controlled -contraction of over : in degrees this was observed after Definition A.3, and in degree
The power and the bounds depend on and , but not on individual chains; this uniformity is what Lemma A.8 requires. Neither is assumed to commute with the , since all relations are precomposed with the same power of , nor need the contractions be equivariant.
Coefficients in products of free modules
In this subsection coefficient modules are right modules. For a right -module , the groups are the homology of , on which
is a well-defined chain endomorphism, since in .
Lemma A.7. For every right -module there is a long exact sequence
Proof. The complex is a free -resolution of , and is a -linear chain endomorphism of lifting . By the exactness of (9), the mapping cone of is a free -resolution of . Tensoring with identifies with and with ; the long exact sequence of the cone is the assertion.
Lemma A.8 (cf. [11 Sections 7.3–7.4]). Let be a set and . Then is locally nilpotent on for every . Consequently for every .
Proof. For every bound and every , the module is free on the finite set , and finite direct sums commute with products, so the coordinate map
is an isomorphism, compatible with , with and with enlarging . Moreover is a subcomplex of , because is a direct summand of .
Let , let be a -cycle, and choose a bound with . By Proposition A.6, some admits a controlled -contraction over ; let be a bound containing the images of the . Fix representatives of the cosets . As a right -module, is the direct sum of the submodules , so every element of can be written uniquely as with . Put
Since acts componentwise and vanishes in positive degrees, (A.1) gives on for . Applying in every coordinate and using (A.3) for and , we obtain maps satisfying in the same degrees, since both sides lie in and agree in every coordinate. In particular , so .
For a locally nilpotent , the map is bijective, with inverse . For , the maps in degrees and of the sequence of Lemma A.7 are therefore bijective, and .
From vanishing to finiteness
The following is a special case of the Bieri–Eckmann criterion [2 Section 1]; we include the short argument.
Lemma A.9. Let , and let be a group of type such that for every set and every . Then is of type .
Proof. Write , and let be a free resolution of whose terms have finite rank [5 VIII.4.3]. Let , let be its underlying set, and put . Since and have finite rank, for , compatibly with . The family is therefore a cycle in , and gives for some with and . In the coordinate indexed by , this reads , so is generated by . Replacing by a free module of rank mapping onto , and the higher terms by a free resolution of its kernel, yields a free resolution that agrees with in degrees and has finite rank in degree . Iterating produces a single free resolution of finite rank in every degree. □
Proof of Proposition A.2. By Corollary 6.1 with , is of type . By Lemma A.8, for every set and every , and Lemma A.9 with concludes. □
Remark A.10. Corollary 6.1 can be avoided. Since is finitely generated, , with acting coordinatewise by , so is injective there by (6.2). With Lemmas A.7 and A.8 this gives , and Lemma A.9 applies with .
Proof of Theorem A.1
Let be the group of Lemma 7.2. By Lemma 4.2, is finitely generated and -recursively presented, so there is an embedding . The endomorphisms satisfy the hypothesis of Corollary 5.3 by (1.2), and is injective by Lemma 4.1. By Proposition A.2, the group
is of type . It contains , hence a copy of every countable -recursively presented group by Lemmas 7.1 and 7.2, and it is -recursively presented by Subsection 2.3.
Let be the two-generator group obtained from and a fixed finite generating set by the construction in the proof of Lemma 7.6. This construction does not depend on , and is of type for every , so is of type for every , that is, of type . It contains , and it is -recursively presented, since it is obtained by adding finitely many generators and relators. This proves the first assertion. The second follows, because every countable group is -recursively presented for a suitable oracle (Subsection 2.3).
Remark A.11. Whatever the choice of , the group is the group of Theorem 7.3. Thus the first ascending HNN extension in that proof is already of type : the finiteness degree enters only through the power of and the bounds in Proposition A.6, not through the group. The conclusion is optimal: by Corollary C, a finitely generated group that is not recursively presented embeds in no group of type .
LB: Institut Camille Jordan, Université de Lyon 1 and Section de Mathématiques, Université de Genève
Email address: [email protected]
RM: St Petersburg State University
References
- [1]M. Bestvina, Questions in Geometric Group Theory, 2004, https://www.math.utah.edu/~bestvina/eprints/questions-updated.pdf.
- [2]R. Bieri, Homological dimension of discrete groups, 2nd ed., Queen Mary College Mathematics Notes, Queen Mary College, London, 1981.
- [3]G. Baumslag, E. Dyer and A. Heller, The topology of discrete groups, J. Pure Appl. Algebra 16 (1980), no. 1, 1–47.DOI
- [4]M. R. Bridson and A. Haefliger, Metric spaces of non-positive curvature, Grundlehren der mathematischen Wissenschaften, vol. 319, Springer-Verlag, Berlin, 1999.DOI
- [5]K. S. Brown, Cohomology of groups, Graduate Texts in Mathematics, vol. 87, Springer-Verlag, New York, 1982; corrected reprint, 1994.
- [6]F. Fournier-Facio and M. C. B. Zaremsky, Finiteness properties and Higman’s rope trick, preprint, arXiv:2607.21727, 2026.
- [7]G. Higman, Subgroups of finitely presented groups, Proc. Roy. Soc. London Ser. A 262 (1961), 455–475.DOI
- [8]G. Higman, B. H. Neumann and H. Neumann, Embedding theorems for groups, J. London Math. Soc. 24 (1949), 247–254.DOI
- [9]I. J. Leary, Subgroups of almost finitely presented groups, Math. Ann. 372 (2018), no. 3–4, 1383–1391.arxiv.org/abs/1610.05813
- [10]R. C. Lyndon and P. E. Schupp, Combinatorial group theory, Classics in Mathematics, Springer-Verlag, Berlin, 2001; reprint of the 1977 edition.DOI
- [11]OpenAI, A universal group of type F∞, preprint dated 23 September 2026, publicly released 6 October 2026. Version consulted 7 October 2026, repository revision acd7f1241b42e322a6451854ab7eb4b4c146bf78a; PDF in the OpenAI mathematics repository.hub.valency.io/works/W_g6z4ut6t
- [12]C. T. C. Wall, Finite complexes, II. Proc. Roy. Soc. London Ser. A 295 (1966), 129–139.