alphaFeedback

WorksMathematics

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

AI contributions
Not recorded for this paper
View details
Ancillary data
Proof registry entry
View

Abstract

For every integer n≥2n\ge2, we prove that every countable group embeds in a group of type FPn\mathrm{FP}_n. We also construct a group of type Fn\mathrm{F}_n containing a copy of every recursively presented group. Consequently, a finitely generated group embeds in a group of type Fn\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 FP∞\mathrm{FP}_\infty.

Introduction

A group is of type FPnFP_n if the trivial module Z\mathbb{Z} has a projective resolution over the integral group ring that is finitely generated in degrees at most nn, and of type FnF_n if it has an Eilenberg–Mac Lane space with finite nn-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 FP2FP_2. We extend both embedding results to arbitrary degree ≥2\ge2:

Theorem A. Let n≥2n \ge2 be an integer. Every countable group embeds in a group of type FPnFP_n.

Theorem B. Let n≥2n \ge2 be an integer. There is a group of type FnF_n that contains a copy of every recursively presented group.

Corollary C. Let n≥2n \ge2 be an integer. A countable group embeds in a group of type FnF_n if and only if it embeds in a finitely presented group. In particular, a finitely generated group embeds in a group of type FnF_n 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 pp-group Zp∞\mathbb{Z}_{p^\infty} can be embedded in an FP∞FP_\infty group, or at least an FP3FP_3 group; and whether every FnF_n group can be embedded in an Fn+1F_{n+1} group, if n≥2n \ge2. Theorem A settles the second question, while Theorem B settles the third one, both in the affirmative.

Theorem B also settles the F3F_3 part of [6 Question 1.4], and Theorem A the FP3FP_3 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 F∞F_\infty [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 FP∞\mathrm{FP}_{\infty}; see Appendix § 8:

Theorem D. Every countable group embeds in a group of type FP∞\mathrm{FP}_{\infty}.

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 F/RF/R is infinite and R≠1R \ne1 [6 Theorem B]; in particular such groups are not of type FP3\mathrm{FP}_3. We raise the finiteness degree with ascending HNN extensions instead.

Let m≥1m \ge1, let BB be a group of type FPm\mathrm{FP}_m, and fix an exact sequence of ZB\mathbb{Z}B-modules

0⟶Z→⊆Fm→dmFm−1⟶⋯→d1F0=ZB→εZ⟶0(1)0 \longrightarrow\mathbb{Z} \xrightarrow{\subseteq} F_m \xrightarrow{d_m} F_{m-1} \longrightarrow\cdots\xrightarrow{d_1} F_0 = \mathbb{Z}B \xrightarrow{\varepsilon} \mathbb{Z} \longrightarrow0 \tag*{(1)}

in which every FiF_i is finitely generated and free. Then BB is of type FPm+1\mathrm{FP}_{m+1} if and only if ZZ is finitely generated [5 VIII.4.3]. Every endomorphism φ\varphi of BB has chain lifts Φ\Phi to (1) (Definition 2.1), so each of them maps ZZ into itself.

Theorem E. Let m≥1m \ge1, let BB be a group of type FPm\mathrm{FP}_m and let φ ⁣:B→B\varphi\colon B \to B be an injective endomorphism. Suppose that some chain lift Φ\Phi of φ\varphi satisfies Φ(Z)⊆M\Phi(Z) \subseteq M for a finitely generated ZB\mathbb{Z}B-submodule M⊆ZM \subseteq Z. Then BB embeds in the group

E=⟨B,t:t−1bt=φ(b), b∈B⟩,E = \langle B,t: t^{-1}bt = \varphi(b),\ b \in B \rangle,

and EE is of type FPm+1\mathrm{FP}_{m+1}.

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 Φ(Z)\Phi(Z) be finitely generated nor that MM be Φ\Phi-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 T\mathcal{T} on a finite set VV is a set of triples (i,j)→k(i,j) \to k of distinct elements of VV, with inputs i,ji,j and output kk (Definition 3.1). For a group GG, let GvG_v (v∈Vv \in V) be copies of GG, write gv∈Gvg_v \in G_v for the copy of g∈Gg \in G, and put

KT(G)=(∗v∈VGv)/⟨ ⁣⟨[gi,hj], gk−1gigj:g,h∈G, (i,j)→k∈T⟩ ⁣⟩,(2)K_{\mathcal{T}}(G) = \left(\ast_{v \in V} G_v\right)\Big/\left\langle\!\left\langle[g_i,h_j],\,g_k^{-1}g_i g_j : g,h \in G,\ (i,j)\to k \in\mathcal{T}\right\rangle\!\right\rangle, \tag*{(2)}

with canonical homomorphisms ιv ⁣:G→KT(G)\iota_v \colon G \to K_{\mathcal{T}}(G), g↦gvg \mapsto g_v. Thus KT(G)K_{\mathcal{T}}(G) is generated by the copies GvG_v subject to the following relations, one family for each triple (i,j)→k(i,j) \to k: the input copies GiG_i and GjG_j commute elementwise, and gk=gigjg_k = g_i g_j for every g∈Gg \in G, so that the output copy is identified with the diagonal in the input copies. For a single triple, KT(G)=G×GK_{\mathcal{T}}(G) = G \times G, and GiG_i, GjG_j, GkG_k are the two factors and the diagonal.

Suppose that κ ⁣:KT(B)→B\kappa\colon K_{\mathcal{T}}(B) \to B is an embedding, and put αv=κ∘ιv\alpha_v = \kappa\circ\iota_v. For each triple (i,j)→k(i,j) \to k, the endomorphisms αi\alpha_i and αj\alpha_j have commuting images and αk(b)=αi(b)αj(b)\alpha_k(b) = \alpha_i(b)\alpha_j(b) for all b∈Bb \in B. For such endomorphisms, chain lifts satisfy Φk=Φi+Φj\Phi_k = \Phi_i + \Phi_j on Z\mathbb{Z} modulo a finitely generated submodule (Lemma 5.1). Consequently, if the standard basis vector e0e_0 of ZV\mathbb{Z}^V is an integral linear combination of the vectors ei+ej−eke_i + e_j - e_k, the same combination of the maps Φv\Phi_v shows that Φ0\Phi_0 maps ZZ into a finitely generated submodule (Corollary 5.3). Theorem E then applies to α0\alpha_0, provided α0\alpha_0 is injective. We show that every ιv\iota_v is injective, for every group GG, when the incidence graph of T\mathcal{T} has girth at least 1212, by realising KT(G)K_{\mathcal{T}}(G) as the fundamental group of a non-positively curved complex of groups (Lemma 4.1). A single system T\mathcal{T} 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 KT(B)→BK_{\mathcal{T}}(B) \to B exists whenever BB 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 m=1m=1 (Lemma 7.2). In particular, for n=2n=2 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 MM of a group HH is a mitosis of HH if it is generated by HH and two elements s,ds,d such that [h,s−1hs]=1[h,s^{-1}hs]=1 and d−1hd=h⋅s−1h′sd^{-1}hd=h\cdot s^{-1}h's for all h,h′∈Hh,h'\in H. The present construction replaces the conjugations by ss and dd 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 FPn\mathrm{FP}_n, then every finitely presented group embeds in a group of type Fn\mathrm{F}_n [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 FP1\mathrm{FP}_1 is finitely generated. Presentations are written ⟨X:R⟩\langle X:R\rangle. For an injective endomorphism φ\varphi of a group BB, the ascending HNN extension ⟨B,t:t−1bt=φ(b), b∈B⟩\langle B,t:t^{-1}bt=\varphi(b),\ b\in B\rangle contains BB by Britton’s lemma [10 IV.2]; its height is the homomorphism to Z\mathbb{Z} sending tt to 11 and BB to 00.

Let θ:Γ→B\theta:\Gamma\to B be a homomorphism of groups, extended to group rings. An additive map f:P→P′f:P\to P' from a ZΓ\mathbb{Z}\Gamma-module to a ZB\mathbb{Z}B-module is θ\theta-semilinear if f(λx)=θ(λ)f(x)f(\lambda x)=\theta(\lambda)f(x) for all λ∈ZΓ\lambda\in\mathbb{Z}\Gamma and x∈Px\in P. We shall use repeatedly the following consequence of the definition:

if P is generated by x1,…,xq, then f(P)⊆ZBf(x1)+⋯+ZBf(xq).(3)\text{if }P\text{ is generated by }x_1,\ldots,x_q,\text{ then }f(P)\subseteq\mathbb{Z}Bf(x_1)+\cdots+\mathbb{Z}Bf(x_q). \tag*{(3)}

Chain lifts

Throughout Sections 2–6, m≥1m\geq1, BB is a group of type FPm\mathrm{FP}_m, the sequence (1.1) is fixed, and Z=ker⁡dm\mathbb{Z}=\ker d_m. We write F∗F_* for the augmented complex Fm→⋯→F0F_m\to\cdots\to F_0. It satisfies

H0(F∗)≅Z (via ε),Hi(F∗)=0  (0<i<m),Hm(F∗)=Z.H_0(F_*)\cong\mathbb{Z}\ \text{(via }\varepsilon\text{)},\qquad H_i(F_*)=0\ \ (0<i<m),\qquad H_m(F_*)=\mathbb{Z}.

Note that Hm(F∗)H_m(F_*) is the module Z\mathbb{Z}, not the group homology Hm(B;Z)H_m(B;\mathbb{Z}).

Definition 2.1. Let θ\theta be an endomorphism of BB. A chain lift of θ\theta is a family of θ\theta-semilinear maps fi:Fi→Fif_i:F_i\to F_i, 0≤i≤m0\leq i\leq m, such that difi=fi−1did_i f_i=f_{i-1}d_i for 1≤i≤m1\leq i\leq m and εf0=ε\varepsilon f_0=\varepsilon. Its restriction to Z\mathbb{Z}, which it maps into Z\mathbb{Z}, is denoted by the same letter.

A chain lift of θ\theta is the same as a ZB\mathbb{Z}B-linear chain map, over the identity of Z\mathbb{Z}, from F∗F_* to the complex obtained from F∗F_* by restricting scalars along θ\theta. Since the FiF_i are free and the augmented complex is exact at F0,…,Fm−1F_0,\ldots,F_{m-1}, 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 ff and gg are chain lifts of the same endomorphism θ\theta of BB, then (f−g)(Z)(f-g)(Z) is contained in a finitely generated ZB\mathbb{Z}B-submodule of ZZ.

Proof. Since ε(f0−g0)=0\varepsilon(f_0-g_0)=0 and ker⁡ε=d1(F1)\ker\varepsilon=d_1(F_1), choose a θ\theta-semilinear map σ0:F0→F1\sigma_0:F_0\to F_1 with f0−g0=d1σ0f_0-g_0=d_1\sigma_0. Inductively, for 1≤i<m1\leq i<m, construct θ\theta-semilinear maps σi:Fi→Fi+1\sigma_i:F_i\to F_{i+1} satisfying

fi−gi=di+1σi+σi−1di.f_i-g_i=d_{i+1}\sigma_i+\sigma_{i-1}d_i.

Indeed, once the preceding maps have been constructed, the chain-map identities give

di(fi−gi−σi−1di)=(fi−1−gi−1−diσi−1)di=0.d_i(f_i-g_i-\sigma_{i-1}d_i)=(f_{i-1}-g_{i-1}-d_i\sigma_{i-1})d_i=0.

For i=1i=1 the last equality follows from the choice of σ0\sigma_0, and for i>1i>1 from di−1di=0d_{i-1}d_i=0. Exactness at FiF_i lets us lift the values through di+1d_{i+1} and extend θ\theta-semilinearly. Now c=fm−gm−σm−1dmc=f_m-g_m-\sigma_{m-1}d_m satisfies dmc=0d_mc=0, so c(Fm)⊆Zc(F_m)\subseteq Z, and cc agrees with fm−gmf_m-g_m on ZZ. Since cc is θ\theta-semilinear and FmF_m is finitely generated, c(Fm)c(F_m) lies in a finitely generated submodule of ZZ by (3). □

Remark 2.3. The hypothesis of Theorem E is also independent of the chosen finite free partial resolution. Let F∗∗F^*_* be another such resolution through degree mm, put Z′=ker⁡dm′Z'=\ker d'_m, and choose comparison maps u:F∗→F∗′u:F_*\to F'_* and v:F∗′→F∗v:F'_*\to F_* lifting id⁡Z\operatorname{id}_Z. If Φ\Phi is a chain lift of φ\varphi with Φ(Z)⊆M\Phi(Z)\subseteq M, then uΦvu\Phi v is a chain lift of φ\varphi on F∗′F'_* and maps Z′Z' into the finitely generated submodule um(M)⊆Z′u_m(M)\subseteq Z'. Lemma 2.2, applied to F∗′F'_*, gives the same conclusion for every chain lift on F∗′F'_* . Interchanging the two resolutions proves independence.

Presentations relative to an oracle

Fix O⊆NO\subseteq\mathbb{N}. 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 OO-recursively enumerable (OO-r.e.) if some Turing machine with oracle OO enumerates it. A presentation ⟨X:R⟩\langle X:R\rangle is OO-r.e. if RR is, and a countable group is OO-recursively presented if it admits such a presentation. For O=∅O=\varnothing these are the countable recursively presented groups.

A finitely generated OO-recursively presented group has an OO-r.e. presentation on any finite generating set, since the relations among finitely many words in the generators of an OO-r.e. presentation form an OO-r.e. set. Every countable group has an OO-r.e. presentation for a suitable OO: choose a countable presentation and let OO encode its set of relators.

Adding finitely many generators and relators to an OO-r.e. presentation yields an OO-r.e. presentation. In particular, if HH is finitely generated and OO-recursively presented and φ\varphi is an injective endomorphism of HH, then ⟨H,t:t−1ht=φ(h), h∈H⟩\langle H,t:t^{-1}ht=\varphi(h),\ h\in H\rangle is OO-recursively presented: it suffices to impose t−1wxt=wxt^{-1}w_x t=w_x for xx in a finite generating set of HH, where wxw_x is any word representing φ(x)\varphi(x).

A finite system of triples

Definition 3.1. An oriented triple system T\mathcal{T} on a finite set VV is a finite set of triples ℓ=(i,j)→k\ell=(i,j)\to k of distinct elements of VV; we call i,ji,j the inputs and kk the output of ℓ\ell, and the order of the inputs is immaterial. The elements of VV are called indices.

The incidence graph Γ(T)\Gamma(\mathcal{T}) is the bipartite graph with vertex set V⊔TV\sqcup\mathcal{T} in which v∈Vv\in V is joined to ℓ∈T\ell\in\mathcal{T} when vv is an entry of ℓ\ell. The row of ℓ=(i,j)→k\ell=(i,j)\to k is Wℓ=ei+ej−ek∈ZVW_\ell=e_i+e_j-e_k\in\mathbb{Z}^V, where (ev)v∈V(e_v)_{v\in V} is the standard basis, and WW is the T×V\mathcal{T}\times V integer matrix with rows WℓW_\ell.

We shall use a system T\mathcal{T} with a distinguished element 0∈V0 \in V satisfying

girth⁡(T)≥12,(4)\operatorname{girth}(\mathcal{T}) \ge12, \tag*{(4)}
νW=e0 for some ν∈ZT.(5)\nu W=e_0\text{ for some }\nu\in\mathbb{Z}^{\mathcal{T}}. \tag*{(5)}

Condition (3.2) means that for every abelian group AA and every family (xv)v∈V(x_v)_{v\in V} in AA,

∑ℓ=(i,j)→kνℓ(xi+xj−xk)=x0.\sum_{\ell=(i,j)\to k}\nu_\ell(x_i+x_j-x_k)=x_0.

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 T\mathcal{T} with 23 indices and 15 triples satisfying (3.1) and (3.2), with ν∈{±1}T\nu\in\{\pm1\}^{\mathcal{T}}.

Proof. Let the points of the Fano plane be the elements of Z/7\mathbb{Z}/7 and its lines the sets Lj={j,j+1,j+3}L_j=\{j,j+1,j+3\}, j∈Z/7j\in\mathbb{Z}/7. Its flags are the pairs fj,d=(j+d,Lj)f_{j,d}=(j+d,L_j) with j∈Z/7j\in\mathbb{Z}/7 and $d\in{0,1,3}; the flags through the point pp are fp,0f_{p,0}, fp−1,1f_{p-1,1} and fp−3,3f_{p-3,3}. Let VV consist of the twenty flags other than f0,3=(3,L0)f_{0,3}=(3,L_0) and of three further indices aa, bb and $0$, and let T\mathcal{T} consist of the fifteen triples

πp=(fp,0,fp−1,1)→fp−3,3(p≠3),π3=(f3,0,f2,1)→b,λj=(fj,0,fj,1)→fj,3(j≠0),λ0=(f0,0,f0,1)→a,γ=(b,0)→a.\begin{aligned} \pi_p&=(f_{p,0},f_{p-1,1})\to f_{p-3,3} &&(p\ne3),& \pi_3&=(f_{3,0},f_{2,1})\to b,\\ \lambda_j&=(f_{j,0},f_{j,1})\to f_{j,3} &&(j\ne0),& \lambda_0&=(f_{0,0},f_{0,1})\to a,\\ \gamma&=(b,0)\to a. \end{aligned}

Thus πp\pi_p consists of the flags through pp and λj\lambda_j of the flags on LjL_j, except that the flag (3,L0)(3,L_0) is replaced by bb in π3\pi_3 and by aa in λ0\lambda_0.

Put ν=1\nu=1 on the triples πp\pi_p and γ\gamma, and ν=−1\nu=-1 on the triples λj\lambda_j. In νW=∑pWπp−∑jWλj+Wγ\nu W=\sum_p W_{\pi_p}-\sum_j W_{\lambda_j}+W_\gamma, a flag fj,0f_{j,0} or fj,1f_{j,1} is an input of one triple πp\pi_p and of one triple λj\lambda_j, and contributes 1−1=01-1=0; a flag fj,3f_{j,3} with j≠0j\ne0 is the output of one πp\pi_p and one λj\lambda_j, and contributes −1+1=0-1+1=0; the index aa contributes 11 from λ0\lambda_0 and −1-1 from γ\gamma, the index bb contributes −1-1 from π3\pi_3 and 11 from γ\gamma, and the index 00 contributes 11 from γ\gamma. Hence νW=e0\nu W=e_0, which is (3.2).

Every index other than 00 lies in exactly two triples, and 00 lies in γ\gamma only. Let HH be the graph with vertex set T\mathcal{T} and, for each index other than 00, an edge joining the two triples that contain it. Then girth⁡(T)\operatorname{girth}(\mathcal{T}) is obtained from HH by subdividing every edge and attaching the pendant vertex 00 to γ\gamma, so its girth is twice that of HH. The graph HH is the incidence graph of the Fano plane, with πp\pi_p corresponding to pp and λj\lambda_j to LjL_j, in which the edge joining 33 to L0L_0 is subdivided by the vertex γ\gamma; 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 girth⁡(T)\operatorname{girth}(\mathcal{T}) has girth at least 12, which is (3.1). □

The graph $H$ of Proposition 3.2, with the half-edge 0 attached

Figure 1. The graph HH 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 λ0\lambda_0 to π3\pi_3 is subdivided into aa and bb by γ\gamma. The orientations are described in Remark 3.3.

Remark 3.3. The construction is an instance of the following principle. Let HH be a finite graph in which every vertex has degree 3, one of the edges being a half-edge 00 with a single endpoint, and orient HH so that no vertex is a source or a sink and the half-edge 00 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 ν=1\nu=1 or ν=−1\nu=-1 at vertices with one or two incoming edges respectively. Then the matrix with rows νℓWℓ\nu_\ell W_\ell is the oriented incidence matrix of HH, with entry 1 at the tail and −1-1 at the head of each edge, so νW\nu W vanishes on every edge with two endpoints and equals 1 on the half-edge; this is (3.2). Dually, a solution of the equations xk=xi+xjx_k=x_i+x_j is a conserved flow on HH, and conservation forces the flow x0x_0 through the half-edge to vanish. Condition (3.1) holds as soon as HH has girth at least 6. In the proof above, HH is oriented from points to lines along the flags fj,0f_{j,0}, fj,1f_{j,1} and from lines to points along the flags fj,3f_{j,3}, the subdivided flag (3,L0)(3,L_0) runs from L0L_0 through γ\gamma to 33, and the half-edge 00 leaves γ\gamma.

We fix the system T\mathcal{T} of Proposition 3.2 for the rest of the paper.

The complex-of-groups construction

Recall the group KT(G)K_{\mathcal{T}}(G) from (1.2) and its canonical maps ιv\iota_v. For a single triple these maps are injective because KT(G)=G×GK_{\mathcal{T}}(G)=G\times G. For a general triple system, the following condition on the incidence graph ensures injectivity.

Lemma 4.1. If girth Γ(T)≥12\Gamma(\mathcal{T})\ge12, then ιv\iota_v is injective for every v∈Vv\in V and every group GG.

Proof. Let P\mathcal{P} be the poset with elements oo, the elements of VV and the elements of T\mathcal{T}, ordered by ℓ<v<o\ell<v<o whenever vv is an entry of ℓ\ell. The monomorphisms of the complex of groups defined below go from larger to smaller elements of P\mathcal{P}, that is, along o→v→ℓo\to v\to\ell and o→ℓo\to\ell. Its geometric realisation ∣P∣|\mathcal{P}| is the cone with apex oo on Γ(T)\Gamma(\mathcal{T}), whose 2-simplices are the triangles {o,v,ℓ}\{o,v,\ell\} with vv an entry of ℓ\ell. In particular, ∣P∣|\mathcal{P}| is contractible.

Let G(P)G(\mathcal{P}) be the simple complex of groups over P\mathcal{P}, in the sense of [4 II.12], with local groups Go=1G_o=1, Gv=GG_v=G for v∈Vv\in V and Gℓ=G×GG_\ell=G\times G for ℓ∈T\ell\in\mathcal{T}, and with the following monomorphisms: those out of GoG_o are trivial, and for ℓ=(i,j)→k\ell=(i,j)\to k,

Gi→Gℓ,g↦(g,1);Gj→Gℓ,g↦(1,g);Gk→Gℓ,g↦(g,g).(6)G_i\to G_\ell,\quad g\mapsto(g,1);\qquad G_j\to G_\ell,\quad g\mapsto(1,g);\qquad G_k\to G_\ell,\quad g\mapsto(g,g). \tag*{(6)}

The compatibility condition on composites is vacuous, because every chain of length two in P\mathcal{P} begins at oo. The direct limit of G(P)G(\mathcal{P}) is generated by the groups GvG_v and GℓG_\ell subject to the identifications (4.1). Since G×GG\times G is generated by G×1G\times1 and 1×G1\times G subject only to the relations that these subgroups commute, eliminating the groups GℓG_\ell yields the presentation (1.2). As ∣P∣|\mathcal{P}| is simply connected, this direct limit is the fundamental group of G(P)G(\mathcal{P}). It therefore suffices to show that G(P)G(\mathcal{P}) is developable, since the local groups of a developable complex of groups embed in its fundamental group [4 II.12].

Make every triangle {o,v,ℓ}\{o,v,\ell\} of ∣P∣|\mathcal{P}| a Euclidean triangle with side lengths ∣ov∣=3|ov|=\sqrt{3}, ∣vℓ∣=1|v\ell|=1 and ∣oℓ∣=2|o\ell|=2. Its angles are π/6\pi/6 at oo, π/2\pi/2 at vv and π/3\pi/3 at ℓ\ell, 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]), G(P)G(\mathcal{P}) 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 2π2\pi [4 II.5]. The links at vertices of the local developments are as follows.

vertexlocal grouplinkedge lengthgirth
oo11Γ(T)\Gamma(\mathcal{T})π/6\pi/6≥12\ge12
vvGGG∗Inc⁡(v)G * \operatorname{Inc}(v)π/2\pi/2≥4\ge4
ℓ\ellG×GG \times Gpoint–coset incidence graphπ/3\pi/3≥6\ge6

At oo the local group is trivial and the link is Γ(T)\Gamma(\mathcal{T}). At vv, put Inc⁡(v)={ℓ∈T:v is an entry of ℓ}\operatorname{Inc}(v)=\{\ell\in\mathcal{T}:v\text{ is an entry of }\ell\}. The link is the simplicial join G∗Inc⁡(v)G * \operatorname{Inc}(v) of two discrete sets: the set Gv/Go≅GG_v/G_o\cong G of directions towards lifts of oo, and the set of triples containing vv. Thus it is a complete bipartite graph.

At ℓ=(i,j)→k\ell=(i,j)\to k, let H1=G×1H_1=G\times1, H2=1×GH_2=1\times G and let H3H_3 be the diagonal. The link is the bipartite graph with point vertices z∈G×Gz\in G\times G and tagged coset vertices (a,zHa)(a,zH_a), a∈{1,2,3}a\in\{1,2,3\}. Each point is joined to the three tagged cosets containing it. Distinct cosets of the same subgroup are disjoint. If a≠ba\ne b and two cosets of HaH_a and HbH_b meet at zz, their intersection is z(Ha∩Hb)={z}z(H_a\cap H_b)=\{z\}. 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 2π2\pi, and the link condition holds.

Thus G(P)G(\mathcal{P}) is non-positively curved, hence developable, and every ιv\iota_v is injective. □

Lemma 4.2. The construction G↦KT(G)G\mapsto K_{\mathcal{T}}(G) is functorial. If G=⟨X:R⟩G=\langle X:R\rangle with XX finite, then KT(G)K_{\mathcal{T}}(G) is presented by the generators xvx_v (x∈Xx\in X, v∈Vv\in V) and the relators

rv (r∈R, v∈V),[xi,yj],xk−1xixj(x,y∈X, (i,j)→k∈T),r_v\ (r\in R,\ v\in V),\qquad[x_i,y_j],\quad x_k^{-1}x_ix_j\quad(x,y\in X,\ (i,j)\to k\in\mathcal{T}),

where rvr_v denotes rr written in the letters xvx_v. Consequently, KTK_{\mathcal{T}} preserves finite generation, finite presentability and, for finitely generated groups, OO-recursive presentability.

Proof. Functoriality is clear from (1.2). In the group given by the displayed presentation, the relators [xi,yj][x_i,y_j] make the images of GiG_i and GjG_j commute, so g↦gigjg\mapsto g_i g_j is a homomorphism on GG. It agrees with g↦gkg\mapsto g_k on XX, hence on GG. 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 2m>m2m>m.

Lemma 5.1. Let α,β\alpha,\beta be endomorphisms of BB such that α(B)\alpha(B) and β(B)\beta(B) commute elementwise, and let δ(β)=α(β)\delta(\beta)=\alpha(\beta). For any chain lifts Φα,Φβ,Φδ\Phi_\alpha,\Phi_\beta,\Phi_\delta of α,β,δ\alpha,\beta,\delta, there is a finitely generated ZB\mathbb{Z}B-submodule M⊆ZM\subseteq Z such that

(Φδ−Φα−Φβ)(Z)⊆M.(\Phi_\delta-\Phi_\alpha-\Phi_\beta)(Z)\subseteq M.

Proof. Let Q∗=F∗⊗ZF∗Q_* = F_* \otimes_{\mathbb{Z}} F_* with differential d(x⊗y)=dx⊗y+(−1)∣x∣x⊗dyd(x\otimes y)=dx\otimes y+(-1)^{|x|}x\otimes dy, and with Z[B×B]=ZB⊗ZB\mathbb{Z}[B\times B]=\mathbb{Z}B\otimes\mathbb{Z}B acting factorwise. Each Qn=⨁p+q=nFp⊗FqQ_n=\bigoplus_{p+q=n}F_p\otimes F_q is a finitely generated free Z[B×B]\mathbb{Z}[B\times B]-module. Write εQ=ε⊗ε:Q0→Z\varepsilon_Q=\varepsilon\otimes\varepsilon:Q_0\to\mathbb{Z} for its augmentation. Let ρ1=id⁡⊗ε\rho_1=\operatorname{id}\otimes\varepsilon and ρ2=ε⊗id⁡\rho_2=\varepsilon\otimes\operatorname{id}, where ε\varepsilon is regarded as a chain map from F∗F_* to Z\mathbb{Z} concentrated in degree 0. These are chain maps Q∗→F∗Q_*\to F_*, semilinear with respect to the two projections B×B→BB\times B\to B, and ρ1(x⊗y)=0\rho_1(x\otimes y)=0 whenever yy has positive degree (similarly for ρ2\rho_2). The groups FpF_p are free abelian and H0(F∗)≅ZH_0(F_*)\cong\mathbb{Z}, so the Künneth formula has no Tor terms in degrees ≤m\le m, and gives H0(Q∗)≅ZH_0(Q_*) \cong\mathbb{Z}, Hn(Q∗)=0H_n(Q_*) = 0 for 0<n<m0 < n < m, and an isomorphism

(ρ1∗,ρ2∗):Hm(Q∗)→≅Z⊕Z.(\rho_{1*},\rho_{2*}): H_m(Q_*) \xrightarrow{\cong} \mathbb{Z} \oplus\mathbb{Z}.

In particular:

a cycle w∈Qm with ρ1(w)=ρ2(w)=0 lies in d(Qm+1).(7)\text{a cycle } w \in Q_m \text{ with } \rho_1(w) = \rho_2(w) = 0 \text{ lies in } d(Q_{m+1}). \tag*{(7)}

The product. Since the images commute, η(b,c)=α(b)β(c)\eta(b,c) = \alpha(b)\beta(c) is a homomorphism B×B→BB \times B \to B. Choose h0h_0 on a basis so that εh0=εQ\varepsilon h_0 = \varepsilon_Q. Since the QnQ_n are free and the augmented complex F∗→ZF_* \to\mathbb{Z} is exact at F0,…,Fm−1F_0,\ldots,F_{m-1}, this extends degree by degree to η\eta-semilinear maps hn:Qn→Fnh_n: Q_n \to F_n, 0≤n≤m0 \le n \le m, commuting with the differentials. Put

M0=ZB⋅hmd(Qm+1).M_0 = \mathbb{Z}B \cdot h_m d(Q_{m+1}).

We have dmhmd=hm−1dd=0d_m h_m d = h_{m-1} d d = 0, so M0⊆ZM_0 \subseteq Z. Since hmdh_m d is η\eta-semilinear and Qm+1=⨁p=1mFp⊗ZFm+1−pQ_{m+1} = \bigoplus_{p=1}^{m} F_p \otimes_{\mathbb{Z}} F_{m+1-p} is finitely generated, M0M_0 is finitely generated by (2.1). The chain maps i1(x)=x⊗1i_1(x) = x \otimes1 and i2(x)=1⊗xi_2(x) = 1 \otimes x from F∗F_* to Q∗Q_*, where 1∈F0=ZB1 \in F_0 = \mathbb{Z}B, are semilinear with respect to b↦(b,1)b \mapsto(b,1) and b↦(1,b)b \mapsto(1,b). Hence f=hi1f = h i_1 and g=hi2g = h i_2 are chain lifts of α\alpha and β\beta.

The diagonal. Let Q≤mbrutQ_{\le m}^{\mathrm{brut}} denote the brutal truncation of Q∗Q_*: its terms in degrees 0,…,m0,\ldots,m are unchanged and its terms in higher degrees are zero. Using εQ\varepsilon_Q in degree 00 and exactness of the augmented complex at Q0,…,Qm−1Q_0,\ldots,Q_{m-1}, construct a chain map Δ:F∗→Q≤mbrut\Delta: F_* \to Q_{\le m}^{\mathrm{brut}} with εQΔ0=ε\varepsilon_Q\Delta_0 = \varepsilon, semilinear with respect to the diagonal B→B×BB \to B \times B. We continue to use the full complex Q∗Q_*, including Qm+1Q_{m+1}, when applying (5.1). Then hΔh\Delta is a chain lift of δ\delta, and τa=ρaΔ\tau_a = \rho_a\Delta (a=1,2a = 1,2) is a ZB\mathbb{Z}B-linear chain lift of id⁡B\operatorname{id}_B. By Lemma 2.2 there are finitely generated submodules Y1,Y2⊆ZY_1,Y_2 \subseteq Z with (τa−id⁡)(Z)⊆Ya(\tau_a-\operatorname{id})(Z) \subseteq Y_a. For z∈Zz \in Z, the element

w=Δ(z)−i1τ1(z)−i2τ2(z)w = \Delta(z) - i_1\tau_1(z) - i_2\tau_2(z)

is a cycle, and ρ1(w)=τ1(z)−τ1(z)−0=0\rho_1(w) = \tau_1(z) - \tau_1(z) - 0 = 0 because ρ1i1=id⁡\rho_1 i_1 = \operatorname{id} and ρ1i2\rho_1 i_2 vanishes in positive degrees; likewise ρ2(w)=0\rho_2(w) = 0. By (5.1), w∈d(Qm+1)w \in d(Q_{m+1}), so hm(w)∈M0h_m(w) \in M_0. Since hi1τ1(z)=f(z)+f(τ1−id⁡)(z)h i_1\tau_1(z) = f(z) + f(\tau_1-\operatorname{id})(z) and similarly for gg, we obtain

(hΔ−f−g)(Z)⊆M0+ZBf(Y1)+ZBg(Y2).(h\Delta- f - g)(Z) \subseteq M_0 + \mathbb{Z}Bf(Y_1) + \mathbb{Z}Bg(Y_2).

and the right-hand side is a finitely generated submodule of ZZ by (2.1). Arbitrary lifts. Applying Lemma 2.2 to the pairs (Φδ,hΔ)(\Phi_\delta,h\Delta), (Φα,f)(\Phi_\alpha,f) and (Φβ,g)(\Phi_\beta,g), and adding the resulting finitely generated submodules to M0+ZBf(Y1)+ZBg(Y2)M_0 + \mathbb{Z}Bf(Y_1) + \mathbb{Z}Bg(Y_2), gives MM.

Remark 5.2. The proof gives a bound independent of α\alpha and β\beta: if FpF_p has rank rpr_p, then MM can be generated by ∑p=1mrprm+1−p+5rm\sum_{p=1}^{m} r_p r_{m+1-p} + 5r_m elements.

Corollary 5.3. Let (αv)v∈V(\alpha_v)_{v\in V} be endomorphisms of BB such that, for every (i,j)→k∈T(i,j)\to k \in\mathcal{T}, the images of αi\alpha_i and αj\alpha_j commute elementwise and αk(b)=αi(b)αj(b)\alpha_k(b) = \alpha_i(b)\alpha_j(b) for all b∈Bb \in B. Then every chain lift Φ0\Phi_0 of α0\alpha_0 maps ZZ into a finitely generated ZB\mathbb{Z}B-submodule of ZZ.

Proof. Choose chain lifts Φv\Phi_v of αv\alpha_v for v≠0v \ne0. For each ℓ=(i,j)→k\ell= (i,j)\to k, Lemma 5.1 gives a finitely generated submodule Mℓ⊆ZM_\ell\subseteq Z containing (Φi+Φj−Φk)(Z)(\Phi_i+\Phi_j-\Phi_k)(Z); let M=∑ℓ∈TMℓM = \sum_{\ell\in\mathcal{T}} M_\ell. By (3.2), applied to the abelian group of additive maps Z→ZZ \to Z,

Φ0(z)=∑ℓ=(i,j)→kνℓ(Φi(z)+Φj(z)−Φk(z))∈M(z∈Z).\Phi_0(z) = \sum_{\ell=(i,j)\to k} \nu_\ell\bigl(\Phi_i(z) + \Phi_j(z) - \Phi_k(z)\bigr) \in M \qquad(z \in Z).

Ascending HNN extensions: proof of Theorem E

Proof of Theorem E. By Britton’s lemma, BB embeds in EE. Since ZE\mathbb{Z}E is a free right ZB\mathbb{Z}B-module, the functor ZE⊗ZB−\mathbb{Z}E \otimes_{\mathbb{Z}B} - is exact. Put Pi=ZE⊗ZBFiP_i=\mathbb{Z}E\otimes_{\mathbb{Z}B} F_i and ZE=ZE⊗ZBZ\mathbb{Z}_E=\mathbb{Z}E\otimes_{\mathbb{Z}B}\mathbb{Z}. Then Pm→⋯→P0→Z[E/B]→0P_m\to\cdots\to P_0\to\mathbb{Z}[E/B]\to0 is exact, the PiP_i are finitely generated free ZE\mathbb{Z}E-modules, and ZE\mathbb{Z}_E is the kernel of dm:Pm→Pm−1d_m:P_m\to P_{m-1}.

Choose a chain lift Φ\Phi of ϕ\phi satisfying Φ(Z)⊆M\Phi(\mathbb{Z})\subseteq M for a finitely generated ZB\mathbb{Z}B-submodule M⊆ZM\subseteq\mathbb{Z}, and define Ti:Pi→PiT_i:P_i\to P_i by

Ti(a⊗x)=at⊗Φi(x).T_i(a\otimes x)=at\otimes\Phi_i(x).

This is well defined: for b∈Bb\in B we have bt=tφ(b)bt=t\varphi(b) in EE, so abt⊗Φi(x)=atφ(b)⊗Φi(x)=at⊗Φi(bx)abt\otimes\Phi_i(x)=at\varphi(b)\otimes\Phi_i(x)=at\otimes\Phi_i(bx). The maps TiT_i are ZE\mathbb{Z}E-linear, commute with the differentials, and induce T(gB)=gtBT(gB)=gtB on Z[E/B]=ZE⊗ZBZ\mathbb{Z}[E/B]=\mathbb{Z}E\otimes_{\mathbb{Z}B}\mathbb{Z} because εΦ0=ε\varepsilon\Phi_0=\varepsilon. Let μ1,…,μr\mu_1,\ldots,\mu_r generate MM. If z∈Zz\in\mathbb{Z} and Φm(z)=∑pλpμp\Phi_m(z)=\sum_p\lambda_p\mu_p with λp∈ZB\lambda_p\in\mathbb{Z}B, then Tm(a⊗z)=∑patλp⊗μpT_m(a\otimes z)=\sum_p at\lambda_p\otimes\mu_p. Hence

Tm(ZE)⊆ZE(1⊗μ1)+⋯+ZE(1⊗μr).(8)T_m(\mathbb{Z}_E)\subseteq\mathbb{Z}E(1\otimes\mu_1)+\cdots+\mathbb{Z}E(1\otimes\mu_r). \tag*{(8)}

The sequence

0→Z[E/B]→1−TZ[E/B]→εZ→0(9)0\to\mathbb{Z}[E/B]\xrightarrow{1-T}\mathbb{Z}[E/B]\xrightarrow{\varepsilon}\mathbb{Z}\to0 \tag*{(9)}

is exact. Indeed, the height is constant on each coset gBgB and TT raises it by one, so the terms of minimal height of a nonzero element of Z[E/B]\mathbb{Z}[E/B] survive in its image under 1−T1-T. The cokernel of 1−T1-T is the quotient of Z[E/B]\mathbb{Z}[E/B] by the relations gB=gtBgB=gtB; together with gbB=gBgbB=gB for b∈Bb\in B, these identify gBgB with gxBgxB for every x∈B∪{t±1}x\in B\cup\{t^{\pm1}\}, hence identify all cosets, since BB and tt generate EE.

The idea is that, modulo (1−Tm)ZE(1-T_m)\mathbb{Z}_E, every ζ∈ZE\zeta\in\mathbb{Z}_E is congruent to TmζT_m\zeta, which lies in the finitely generated submodule (6.1). We make this precise with a mapping cone.

Let C∗C_* be the brutal truncation in degrees ≤m\leq m of the mapping cone of 1−T1-T: C0=P0C_0=P_0, Cj=Pj⊕Pj−1C_j=P_j\oplus P_{j-1} for 1≤j≤m1\leq j\leq m, with differentials

D1(x,y)=d1x+(1−T0)y,D_1(x,y)=d_1x+(1-T_0)y,
Dj(x,y)=(djx+(1−Tj−1)y,−dj−1y)(2≤j≤m).D_j(x,y)=(d_jx+(1-T_{j-1})y,-d_{j-1}y)\qquad(2\leq j\leq m).

augmented by the composite C0=P0→Z[E/B]→εZC_0=P_0\to\mathbb{Z}[E/B]\xrightarrow{\varepsilon}\mathbb{Z}. Since TT commutes with the differentials, Dj−1Dj=0D_{j-1}D_j=0. Let ξ1,…,ξs\xi_1,\ldots,\xi_s be a basis of FmF_m. We show that C∗C_* is exact in degrees <m<m and that ker⁡Dm\ker D_m is generated by the elements

(1⊗μp,0)(1≤p≤r),(1\otimes\mu_p,0)\quad(1\leq p\leq r),
(1−Tm)(1⊗ξq),−dm(1⊗ξq)(1≤q≤s).(10)(1-T_m)(1\otimes\xi_q),-d_m(1\otimes\xi_q)\quad(1\leq q\leq s). \tag*{(10)}

Mapping a free ZE\mathbb{Z}E-module of rank r+sr+s onto ker⁡Dm\ker D_m then extends C∗C_* to a partial resolution of Z\mathbb{Z} by finitely generated free ZE\mathbb{Z}E-modules in degrees 0,…,m+10,\ldots,m+1, so EE is of type FPm+1\mathrm{FP}_{m+1}.

Degree 0. Let x∈P0x\in P_0 have augmentation 0. By (6.2), its image in Z[E/B]\mathbb{Z}[E/B] is (1−T)yˉ(1-T)\bar y for the image yˉ\bar y of some y∈P0y\in P_0. Then x−(1−T0)yx-(1-T_0)y lies in the kernel of P0→Z[E/B]P_0\to\mathbb{Z}[E/B], which is d1(P1)d_1(P_1), so x∈D1(C1)x\in D_1(C_1).

Degrees 1≤j≤m1\leq j\leq m. Let (x,y)∈Cj(x,y)\in C_j with Dj(x,y)=0D_j(x,y)=0. We first show that y=djzy=d_jz for some z∈Pjz\in P_j. If j=1j=1, mapping D1(x,y)D_1(x,y) to Z[E/B]\mathbb{Z}[E/B] gives (1−T)yˉ=0(1-T)\bar y=0, so yˉ=0\bar y=0 by (6.2) and y∈d1(P1)y\in d_1(P_1). If j≥2j\geq2, then dj−1y=0d_{j-1}y=0 and yy is a boundary because Hj−1(P∗)=0H_{j-1}(P_*)=0. Now dj(x+(1−Tj)z)=0d_j(x+(1-T_j)z)=0. If j<mj<m, then x+(1−Tj)z=dj+1wx+(1-T_j)z=d_{j+1}w for some ww, and (x,y)=Dj+1(w,−z)(x,y)=D_{j+1}(w,-z). If j=mj=m, then ζ=x+(1−Tm)z\zeta=x+(1-T_m)z lies in ZE\mathbb{Z}_E and

(x,y)=(ζ,0)+((1−Tm)(−z),−dm(−z)).(x,y)=(\zeta,0)+((1-T_m)(-z),-d_m(-z)).

The elements ((1−Tm)x′,−dmx′)((1-T_m)x',-d_mx') with x′∈Pmx'\in P_m form the image of a ZE\mathbb{Z}E-linear map Pm→CmP_m\to C_m, which is generated by the second family in (6.3). For ζ∈ZE\zeta\in\mathbb{Z}_E we have dmζ=0d_m\zeta=0, hence

(ζ,0)=(Tmζ,0)+((1−Tm)ζ,−dmζ).(\zeta,0)=(T_m\zeta,0)+((1-T_m)\zeta,-d_m\zeta).

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 m≥1m \ge1 and let BB be a group of type FPm\mathrm{FP}_m. Let (αv)v∈V(\alpha_v)_{v\in V} be endomorphisms of BB satisfying the hypothesis of Corollary 5.3, with α0\alpha_0 injective. Then the ascending HNN extension of BB along α0\alpha_0 contains BB and is of type FPm+1\mathrm{FP}_{m+1}.

Proofs of Theorem A, Theorem B and Corollary C

We fix an oracle O⊆N\mathcal{O} \subseteq\mathbb{N}. 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 O\mathcal{O}-r.e. presentation embeds in a two-generator O\mathcal{O}-recursively presented group G∗G^*.

Proof. Write G=⟨x1,x2,…:R⟩G = \langle x_1,x_2,\ldots: R\rangle, repeating generators if necessary, and let L=⟨a,b⟩L = \langle a,b\rangle be free of rank two. In G∗LG * L put

u0=b,ui=a−ibai;v0=a,vi=xib−iabi(i≥1).u_0=b,\quad u_i=a^{-i}ba^i;\qquad v_0=a,\quad v_i=x_i b^{-i}ab^i\quad(i\ge1).

The uiu_i freely generate a free subgroup of LL. So do the viv_i, since the retraction G∗L→LG * L \to L killing GG maps them to the free basis {b−iabi:i≥0}\{b^{-i}ab^i:i\ge0\} of a subgroup of LL. Hence G∗LG * L, and so GG, embeds in

G∗=⟨G∗L,t:t−1uit=vi, i≥0⟩.G^*=\langle G * L,t:t^{-1}u_it=v_i,\ i\ge0\rangle.

The defining relations give a=t−1bta=t^{-1}bt and xi=t−1a−ibaitb−iaix_i=t^{-1}a^{-i}baitb^{-i}a^i for i≥1i\ge1. Eliminating aa and the xix_i presents G∗G^* on b,tb,t with relators obtained from RR by substituting these words, which is an O\mathcal{O}-r.e. set. □

Lemma 7.2. There is a two-generator O\mathcal{O}-recursively presented group B1,OB_{1,\mathcal{O}} that contains a copy of every finitely generated O\mathcal{O}-recursively presented group. In particular, B1,OB_{1,\mathcal{O}} is of type FP1\mathrm{FP}_1.

Proof. For k≥1k \ge1 and an oracle Turing machine M\mathcal{M}, let Gk,MG_{k,\mathcal{M}} be the group generated by x1,…,xkx_1,\ldots,x_k subject to those outputs of M\mathcal{M} with oracle O\mathcal{O} that are words in x1±1,…,xk±1x_1^{\pm1},\ldots,x_k^{\pm1}. Every finitely generated O\mathcal{O}-recursively presented group is isomorphic to some Gk,MG_{k,\mathcal{M}}. Using disjoint alphabets and dovetailing the enumerations, the free product ΩO\Omega_{\mathcal{O}} of all these groups has an O\mathcal{O}-r.e. presentation and contains each of them. By Lemma 7.1, ΩO\Omega_{\mathcal{O}} embeds in a two-generator O\mathcal{O}-recursively presented group B1,OB_{1,\mathcal{O}}. Finite generation is equivalent to type FP1\mathrm{FP}_1. □

Theorem 7.3. For every oracle O⊆N\mathcal{O} \subseteq\mathbb{N} and every integer n≥1n \ge1 there is an O\mathcal{O}-recursively presented group Bn,OB_{n,\mathcal{O}} of type FPn\mathrm{FP}_n that contains a copy of every finitely generated O\mathcal{O}-recursively presented group. These groups can be chosen so that B1,O≤B2,O≤⋯B_{1,\mathcal{O}} \le B_{2,\mathcal{O}} \le\cdots.

Proof. The group B1,OB_{1,\mathcal{O}} is given by Lemma 7.2. Suppose that B=Bm,OB=B_{m,\mathcal{O}} has been constructed for some m≥1m\ge1. By Lemma 4.2, KT(B)K_{\mathcal{T}}(B) is finitely generated and O\mathcal{O}-recursively presented, so there is an embedding κ:KT(B)→B\kappa:K_{\mathcal{T}}(B)\to B. Put αv=κ∘ιv\alpha_v=\kappa\circ\iota_v for v∈Vv\in V. The relations (1.2) show that the family (αv)(\alpha_v) satisfies the hypothesis of Corollary 5.3, and α0\alpha_0 is injective by Lemma 4.1. By Corollary 6.1,

Bm+1,O=⟨B,tm:tm−1btm=α0(b), b∈B⟩B_{m+1,\mathcal{O}}=\langle B,t_m:t_m^{-1}bt_m=\alpha_0(b),\ b\in B\rangle

is of type FPm+1\mathrm{FP}_{m+1} and contains BB, hence every finitely generated O\mathcal{O}-recursively presented group. It is O\mathcal{O}-recursively presented by Subsection 2.3. □

Proof of Theorem A. Let GG be a countable group and choose O\mathcal{O} such that GG has an O\mathcal{O}-r.e. presentation (see Subsection 2.3). By Lemma 7.1, GG embeds in a finitely generated O\mathcal{O}-recursively presented group, hence in B1,O≤Bn,OB_{1,\mathcal{O}} \leq B_{n,\mathcal{O}}, which is of type FPn\mathrm{FP}_{n} by Theorem 7.3. □

Remark 7.4. For n=0n=0 every group is of type FP0\mathrm{FP}_{0}, and for n=1n=1 the required embedding follows from Lemma 7.1. As constructed here, the group obtained depends on GG and on nn, and passing to a union does not give a group of type FP∞\mathrm{FP}_{\infty}: the union of the chain B1,O≤B2,O≤⋯B_{1,\mathcal{O}} \leq B_{2,\mathcal{O}} \leq\cdots is not finitely generated, since the height of Bm+1,OB_{m+1,\mathcal{O}} vanishes on Bm,OB_{m,\mathcal{O}} and takes the value 11 at tmt_m, so each inclusion is proper, and a finite subset of the union lies in some Bm,OB_{m,\mathcal{O}}. Nevertheless, B2,OB_{2,\mathcal{O}} is already of type FP∞\mathrm{FP}_{\infty}; 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 FPn\mathrm{FP}_{n} is of type Fn\mathrm{F}_{n}. □

Proof of Theorem B. Let Ω∅\Omega_{\varnothing} 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 U2U_{2}. 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 Ω∅\Omega_{\varnothing}. Thus U2U_{2} contains a copy of every countable recursively presented group.

Suppose that UmU_{m} is finitely presented, of type Fm\mathrm{F}_{m}, and contains U2U_{2}. In particular, it contains a copy of every finitely presented group. By Lemma 4.2, KT(Um)K_{\mathcal{T}}(U_{m}) is finitely presented and hence embeds in UmU_{m}. As in the proof of Theorem 7.3, composing this embedding with the maps ιv\iota_v gives endomorphisms satisfying the hypotheses of Corollary 6.1, and the resulting ascending HNN extension Um+1U_{m+1} is of type FPm+1\mathrm{FP}_{m+1}. It is finitely presented, being obtained from a finite presentation of UmU_m by adding one generator and finitely many relators, so it is of type Fm+1\mathrm{F}_{m+1} by Lemma 7.5. It contains UmU_m, hence U2U_2, hence a copy of every countable recursively presented group. □

Proof of Corollary C. A group of type Fn\mathrm{F}_{n} with n≥2n \geq2 is finitely presented, so every subgroup of such a group embeds in a finitely presented group. Conversely, if a countable group GG embeds in a finitely presented group PP, then Theorem B embeds PP, and hence GG, in a group of type Fn\mathrm{F}_{n}. 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 n≥2n \geq2. Every finitely generated group of type FPn\mathrm{FP}_{n} embeds in a two-generator group of type FPn\mathrm{FP}_{n}. If the original group is of type Fn\mathrm{F}_{n}, the two-generator group can also be chosen of type Fn\mathrm{F}_{n}.

Proof. Let G=⟨x1,…,xk⟩G=\langle x_{1},\ldots,x_{k}\rangle, with k≥1k \geq1, and use the construction of Lemma 7.1 with only the indices 0,…,k0,\ldots,k. The subgroups generated by u0,…,uku_{0},\ldots,u_{k} and by v0,…,vkv_{0},\ldots,v_{k} are free of rank k+1k+1. Thus

J=⟨G∗⟨a,b⟩, t:t−1uit=vi, 0≤i≤k⟩J=\langle G * \langle a,b\rangle,\ t:t^{-1}u_i t=v_i,\ 0 \leq i \leq k\rangle

contains GG by Britton’s lemma and is generated by b,tb,t, by the same elimination formulas as before.

We recall why the finite-rank edge groups preserve type FPn\mathrm{FP}_{n}. For a group Γ\Gamma that is the fundamental group of a finite graph of groups, the augmented cellular chain sequence of its Bass–Serre tree is

0→⨁eZΓ⊗ZGeZ→⨁vZΓ⊗ZGvZ→Z→00 \to\bigoplus_{e} \mathbb{Z}\Gamma\otimes_{\mathbb{Z}G_e} \mathbb{Z} \to\bigoplus_{v} \mathbb{Z}\Gamma\otimes_{\mathbb{Z}G_v} \mathbb{Z} \to\mathbb{Z} \to0

where one edge is chosen from each unoriented edge orbit. Induce free resolutions of Z\mathbb{Z} over the vertex and edge groups to ZΓ\mathbb{Z}\Gamma, 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 Z\mathbb{Z}. Its degree-jj term is the sum of the induced degree-jj vertex terms and degree-(j−1)(j-1) edge terms. Hence Γ\Gamma is of type FPn\mathrm{FP}_n if its vertex groups are of type FPn\mathrm{FP}_n and its edge groups are of type FPn−1\mathrm{FP}_{n-1}.

Apply this first to the free product G∗⟨a,b⟩G * \langle a,b\rangle, whose edge group is trivial, and then to the HNN extension defining JJ, whose edge group is free of finite rank. This proves that JJ is of type FPn\mathrm{FP}_n. If GG is of type Fn\mathrm{F}_n, it is finitely presented, and so is JJ: the construction adds finitely many generators and relators. Lemma 7.5 then shows that JJ is of type Fn\mathrm{F}_n.

Corollary 7.7. Let n≥2n \ge2. Every countable group embeds in a two-generator group of type FPn\mathrm{FP}_n. Moreover, there is a two-generator group of type Fn\mathrm{F}_n 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 n≥2n \ge2.

Appendix A. Embedding in a group of type FP∞\mathrm{FP}_{\infty}

The preprint [11], released on 6 October 2026, constructs a group of type F∞\mathrm{F}_{\infty} 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 O⊆NO \subseteq\mathbb{N}. There is a two-generator OO-recursively presented group of type FP∞\mathrm{FP}_{\infty} that contains a copy of every countable OO-recursively presented group. In particular, every countable group embeds in a two-generator group of type FP∞\mathrm{FP}_{\infty}.

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 BB be a finitely generated group, and let (αv)v∈V(\alpha_v)_{v\in V} be endomorphisms of BB satisfying the hypothesis of Corollary 5.3, with φ=α0\varphi=\alpha_0 injective. Then

E=⟨B,t:t−1bt=φ(b), b∈B⟩E=\langle B,t:t^{-1}bt=\varphi(b),\ b\in B\rangle

is of type FP∞\mathrm{FP}_{\infty}.

We fix BB, (αv)(\alpha_v), φ\varphi and EE as in Proposition A.2 until its proof is complete.

Controlled chains

For a group Γ\Gamma, let C∗(Γ)C_*(\Gamma) be the normalized homogeneous bar complex: Cq(Γ)C_q(\Gamma) is the free abelian group on the tuples (γ0,…,γq)∈Γq+1(\gamma_0,\ldots,\gamma_q)\in\Gamma^{q+1} with γi−1≠γi\gamma_{i-1}\ne\gamma_i for all ii, a tuple with two consecutive equal entries is read as 0, and ∂\partial is the alternating sum of the deletions. With diagonal left translation and the augmentation ε(γ)=1\varepsilon(\gamma)=1, it is a free ZΓ\mathbb{Z}\Gamma-resolution of Z\mathbb{Z} [5 I.5]. A homomorphism θ:Γ→Γ′\theta:\Gamma\to\Gamma' induces, entrywise, a θ\theta-semilinear chain map θ∗\theta_*. The constant map B→{1}B\to\{1\} likewise induces a chain map c∗c_* of C∗(B)C_*(B); thus c∗(b)=(1)c_*(b)=(1) in degree 0, and c∗=0c_*=0 in positive degrees.

A bound in Γ\Gamma is a finite symmetric subset A⊆ΓA\subseteq\Gamma containing 1. Let C∗A(Γ)⊆C∗(Γ)C_*^A(\Gamma)\subseteq C_*(\Gamma) be spanned by the tuples with γi−1γj∈A\gamma_i^{-1}\gamma_j\in A for all i,ji,j. It is a subcomplex, invariant under left translation, and CqA(Γ)C_q^A(\Gamma) is a free ZΓ\mathbb{Z}\Gamma-module on the finite set Sq(A)S_q(A) of its nondegenerate tuples with γ0=1\gamma_0=1; this set is part of a ZΓ\mathbb{Z}\Gamma-basis of Cq(Γ)C_q(\Gamma), so CqA(Γ)C_q^A(\Gamma) is a direct summand of Cq(Γ)C_q(\Gamma). Every chain lies in C∗A(Γ)C_*^A(\Gamma) for some bound AA, a finite union of bounds is a bound, θ∗(C∗A(Γ))⊆C∗θ(A)(Γ′)\theta_*(C_*^A(\Gamma))\subseteq C_*^{\theta(A)}(\Gamma') for every homomorphism θ\theta, and A1×A2A_1\times A_2 is a bound in Γ1×Γ2\Gamma_1\times\Gamma_2. An additive map defined on C∗A(Γ)C_*^A(\Gamma) is controlled if its image lies in C∗A′(Γ′)C_*^{A'}(\Gamma') for some bound A′A'. 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 θ\theta be an endomorphism of BB, let AA be a bound in BB and let n≥0n\ge0. A controlled nn-contraction of θ\theta over AA is a family of controlled additive maps hq:CqA(B)→Cq+1(B)h_q:C_q^A(B)\to C_{q+1}(B), 0≤q≤n0\le q\le n, such that, with h−1=0h_{-1}=0,

∂hq+hq−1∂=θ∗−c∗on CqA(B)(0≤q≤n).(11)\partial h_q+h_{q-1}\partial=\theta_*-c_*\quad\text{on }C_q^A(B)\qquad(0\le q\le n). \tag*{(11)}

If (hq)(h_q) is a controlled nn-contraction of θ\theta over AA, then (ψ∗hq)(\psi_*h_q) is one of ψθ\psi\theta for every endomorphism ψ\psi of BB, since $\psi_c_=c_*.

Controlled additivity

Let AW⁡:C∗(Γ)→C∗(Γ)⊗ZC∗(Γ)\operatorname{AW}:C_*(\Gamma)\to C_*(\Gamma)\otimes_{\mathbb{Z}}C_*(\Gamma) be the Alexander–Whitney map,

AW⁡(γ0,…,γq)=∑p=0q(γ0,…,γp)⊗(γp,…,γq),\operatorname{AW}(\gamma_0,\ldots,\gamma_q)=\sum_{p=0}^{q}(\gamma_0,\ldots,\gamma_p)\otimes(\gamma_p,\ldots,\gamma_q),

and let ∇:C∗(Γ1)⊗ZC∗(Γ2)→C∗(Γ1×Γ2)\nabla:C_*(\Gamma_1)\otimes_{\mathbb{Z}}C_*(\Gamma_2)\to C_*(\Gamma_1\times\Gamma_2) be the shuffle map: on tuples of lengths p+1p+1 and q+1q+1, it is the sum, over the monotone lattice paths from (0,0)(0,0) to (p,q)(p,q), of the tuples of pairs of entries visited by the path, with sign (−1)N(-1)^N, where NN 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 ∂(x⊗y)=∂x⊗y+(−1)∣x∣x⊗∂y\partial(x\otimes y)=\partial x\otimes y+(-1)^{|x|}x\otimes\partial y on tensor products. The map AW⁡\operatorname{AW} takes C∗A(Γ)C_*^A(\Gamma) to C∗A(Γ)⊗C∗A(Γ)C_*^A(\Gamma)\otimes C_*^A(\Gamma), since it only takes faces, and ∇\nabla takes C∗A1(Γ1)⊗C∗A2(Γ2)C_*^{A_1}(\Gamma_1)\otimes C_*^{A_2}(\Gamma_2) to C∗A1×A2(Γ1×Γ2).C_*^{A_1\times A_2}(\Gamma_1\times\Gamma_2). Write Δ,i1,i2:B→B×B\Delta,i_1,i_2:B\to B\times B for b↦(b,b)b\mapsto(b,b), (b,1)(b,1), (1,b)(1,b). For every chain ww of C∗(B)C_*(B),

∇(w⊗(1))=(i1)∗w,∇((1)⊗w)=(i2)∗w.(12)\nabla(w\otimes(1))=(i_1)_*w,\qquad\nabla((1)\otimes w)=(i_2)_*w. \tag*{(12)}

Lemma A.4. There are additive maps Ψ:Cq(B)→Cq+1(B×B)\Psi:C_q(B)\to C_{q+1}(B\times B), q≥0q\ge0, such that

∂Ψ+Ψ∂=Δ∗−∇AW⁡\partial\Psi+\Psi\partial=\Delta_*-\nabla\operatorname{AW}

and Ψ(C∗A(B))⊆C∗A×A(B×B)\Psi(C_*^A(B))\subseteq C_*^{A\times A}(B\times B) for every bound AA.

Proof. For x∈B×Bx\in B\times B and a chain uu, let x∗ux*u be obtained by prepending xx to every tuple; then ∂(x∗u)=u\partial(x*u)=u whenever uu is a cycle of positive degree. In degree 0, both Δ∗\Delta_* and ∇AW⁡\nabla\operatorname{AW} map (b)(b) to ((b,b))((b,b)); put Ψ=0\Psi=0 there. Let q≥1q\ge1, and suppose that Ψ\Psi has been defined in degrees <q<q, satisfies the identity there, and maps every tuple to a chain whose entries are pairs of entries of that tuple. Let s=(b0,…,bq)s=(b_0,\ldots,b_q) be a nondegenerate tuple with set of entries WW. The chain us=Δ∗s−∇AW⁡(s)−Ψ∂su_s=\Delta_*s-\nabla\operatorname{AW}(s)-\Psi\partial s has entries in W×WW\times W, and is a cycle by the identity in degree q−1q-1. Put Ψ(s)=(b0,b0)∗us\Psi(s)=(b_0,b_0)*u_s. If s⊂CqA(B)s\subset C_q^A(B), then b−1b′∈Ab^{-1}b'\in A for all b,b′∈Wb,b'\in W, whence the last assertion. ∎

Lemma A.5 (Controlled additivity; cf. [11 Lemma 6.1]). Let n≥1n \ge1, let AA be a bound in BB, and let θ\theta be an endomorphism of BB admitting a controlled (n−1)(n-1)-contraction over AA. Let α,β\alpha,\beta be endomorphisms of BB whose images commute elementwise, and put δ(b)=α(b)β(b)\delta(b)=\alpha(b)\beta(b). Then there is a bound A′A' such that, for every cycle z∈CnA(B)z \in C_n^A(B),

(δθ)∗z−(αθ)∗z−(βθ)∗z∈∂Cn+1A′(B).(\delta\theta)_*z-(\alpha\theta)_*z-(\beta\theta)_*z \in\partial C_{n+1}^{A'}(B).

Proof. Let (hq)q<n(h_q)_{q<n} be the contraction, put hq=0h_q=0 for q≥nq \ge n, and let Θ=θ∗−∂h−h∂\Theta=\theta_*-\partial h-h\partial on C∗A(B)C_*^A(B). This is a chain map, with Θ0=c∗\Theta_0=c_*, Θq=0\Theta_q=0 for 0<q<n0<q<n, and Θn=θ∗−hn−1∂\Theta_n=\theta_*-h_{n-1}\partial; in particular Θnz=θ∗z\Theta_nz=\theta_*z for every cycle zz. On C∗A(B)⊗C∗A(B)C_*^A(B)\otimes C_*^A(B) define Ξ\Xi, of degree 11, by

Ξ(x⊗y)=h(x)⊗θ∗(y)+(−1)∣x∣Θ(x)⊗h(y).\Xi(x\otimes y)=h(x)\otimes\theta_*(y)+(-1)^{|x|}\Theta(x)\otimes h(y).

Since ∂h+h∂=θ∗−Θ\partial h+h\partial=\theta_*-\Theta, direct expansion gives ∂Ξ+Ξ∂=θ∗⊗θ∗−Θ⊗Θ\partial\Xi+\Xi\partial=\theta_*\otimes\theta_*-\Theta\otimes\Theta. Put Λ=Ψθ∗+∇Ξ AW\Lambda=\Psi\theta_*+\nabla\Xi\,\mathrm{AW} on C∗A(B)C_*^A(B). Lemma A.4 and the naturality AW θ∗=(θ∗⊗θ∗)AW\mathrm{AW}\,\theta_*=(\theta_*\otimes\theta_*)\mathrm{AW} give

∂Λ+Λ∂=Δ∗θ∗−∇(Θ⊗Θ)AW.\partial\Lambda+\Lambda\partial=\Delta_*\theta_*-\nabla(\Theta\otimes\Theta)\mathrm{AW}.

Let A1A_1 be a bound containing θ(A)\theta(A) and the images of hqh_q (q<nq<n) and Θq\Theta_q (q≤nq\le n) on C∗A(B)C_*^A(B). Only these maps enter Λ\Lambda on CnA(B)C_n^A(B), so Λ\Lambda maps CnA(B)C_n^A(B) into Cn+1A1×A1(B×B)C_{n+1}^{A_1\times A_1}(B\times B).

Let z∈CnA(B)z\in C_n^A(B) be a cycle. In (Θ⊗Θ)AW(z)(\Theta\otimes\Theta)\mathrm{AW}(z), the terms of bidegree (p,n−p)(p,n-p) with 0<p<n0<p<n vanish, and the two remaining terms sum to θ∗z⊗(1)+(1)⊗θ∗z\theta_*z\otimes(1)+(1)\otimes\theta_*z. By (A.2),

∂Λz=Δ∗θ∗z−(i1)∗θ∗z−(i2)∗θ∗z.\partial\Lambda z=\Delta_*\theta_*z-(i_1)_*\theta_*z-(i_2)_*\theta_*z.

Since the images of α\alpha and β\beta commute, μ(x,y)=α(x)β(y)\mu(x,y)=\alpha(x)\beta(y) defines a homomorphism μ:B×B→B\mu:B\times B\to B with μΔ=δ\mu\Delta=\delta, μi1=α\mu i_1=\alpha and μi2=β\mu i_2=\beta. Hence

∂μ∗Λz=(δθ)∗z−(αθ)∗z−(βθ)∗z.\partial\mu_*\Lambda z=(\delta\theta)_*z-(\alpha\theta)_*z-(\beta\theta)_*z.

Finally, A′=α(A1)β(A1)A'=\alpha(A_1)\beta(A_1) is a bound, symmetric because the images commute, and μ∗\mu_* maps Cn+1A1×A1(B×B)C_{n+1}^{A_1\times A_1}(B\times B) into Cn+1A′(B)C_{n+1}^{A'}(B), since μ(x,y)−1μ(x′,y′)=α(x−1x′)β(y−1y′)\mu(x,y)^{-1}\mu(x',y')=\alpha(x^{-1}x')\beta(y^{-1}y'). □

Contractions of powers of φ\varphi

Proposition A.6 (cf. [11 Proposition 6.2]). For every n≥0n\ge0 and every bound AA in BB, some power φr\varphi^r with r≥1r\ge1 admits a controlled nn-contraction over AA.

Proof. For n=0n=0, fix a finite symmetric generating set SS of BB containing 11. For each u∈Bu\in B, choose s1,…,sℓ∈Ss_1,\ldots,s_\ell\in S with φ(u)=s1⋯sℓ\varphi(u)=s_1\cdots s_\ell, and put

h0(u)=∑k=1ℓ(s1⋯sk−1,s1⋯sk)∈C1S(B).h_0(u)=\sum_{k=1}^{\ell}(s_1\cdots s_{k-1},s_1\cdots s_k)\in C_1^S(B).

Then ∂h0(u)=(φ(u))−(1)\partial h_0(u)=(\varphi(u))-(1), so (h0)(h_0) is a controlled 00-contraction of φ\varphi over every bound. The lengths ℓ\ell need not be bounded.

Let n≥1n\ge1, and assume the assertion in degree n−1n-1 for all bounds. Let (hq)q<n(h_q)_{q<n} be a controlled (n−1)(n-1)-contraction of φr\varphi^r over AA. For each nondegenerate tuple ss in CnA(B)C_n^A(B), the chain ws=φ∗rs−hn−1∂sw_s=\varphi^r_*s-h_{n-1}\partial s is a cycle, since

∂ws=φ∗r∂s−(φ∗r−c∗−hn−2∂)∂s=c∗∂s=0;\partial w_s=\varphi^r_*\partial s-(\varphi^r_*-c_*-h_{n-2}\partial)\partial s=c_*\partial s=0;

indeed c∗c_* vanishes in positive degrees and ε(∂s)=0\varepsilon(\partial s)=0. The cycles wsw_s all lie in CnA1(B)C_n^{A_1}(B) for one bound A1A_1, because φ∗r\varphi^r_* and hn−1h_{n-1} are controlled. By hypothesis, some φr′\varphi^{r'} admits a controlled (n−1)(n-1)-contraction over A1A_1. Apply Lemma A.5 with θ=φr′\theta=\varphi^{r'} to (α,β)=(αi,αj)(\alpha,\beta)=(\alpha_i,\alpha_j) for each triple (i,j)→k(i,j)\to k of J\mathcal{J}, and let A′A' be the union of the resulting bounds. For a cycle w∈CnA1(B)w\in C_n^{A_1}(B) put yν=(ανφr′)∗wy_\nu=(\alpha_\nu\varphi^{r'})_*w. Then yi+yj−yk∈∂Cn+1A′(B)y_i+y_j-y_k\in\partial C_{n+1}^{A'}(B) for every (i,j)→k(i,j)\to k, and (3.2), applied in the abelian group Cn(B)C_n(B), gives

φ∗r′+1w=y0=∑ℓ=(i,j)→kνℓ(yi+yj−yk)∈∂Cn+1A′(B).\varphi_*^{r'+1}w=y_0=\sum_{\ell=(i,j)\to k}\nu_\ell(y_i+y_j-y_k)\in\partial C_{n+1}^{A'}(B).

In particular, φ∗r′+1ws=∂ys\varphi_*^{r'+1}w_s=\partial y_s for some ys∈Cn+1A′(B)y_s\in C_{n+1}^{A'}(B). Extend s↦yss\mapsto y_s additively to hn:CnA(B)→Cn+1A′(B)h_n:C_n^A(B)\to C_{n+1}^{A'}(B). Then (φ∗r′+1h0,…,φ∗r′+1hn−1,hn)(\varphi_*^{r'+1}h_0,\ldots,\varphi_*^{r'+1}h_{n-1},h_n) is a controlled nn-contraction of φr+r′+1\varphi^{r+r'+1} over AA: in degrees <n<n this was observed after Definition A.3, and in degree nn

∂hn(s)+φ∗r′+1hn−1∂s=φ∗r′+1(ws+hn−1∂s)=φ∗r+r′+1s.\partial h_n(s)+\varphi_*^{r'+1}h_{n-1}\partial s=\varphi_*^{r'+1}(w_s+h_{n-1}\partial s)=\varphi_*^{r+r'+1}s.

The power and the bounds depend on nn and AA, but not on individual chains; this uniformity is what Lemma A.8 requires. Neither is φ\varphi assumed to commute with the αv\alpha_v, since all relations are precomposed with the same power of φ\varphi, nor need the contractions be equivariant.

Coefficients in products of free modules

In this subsection coefficient modules are right modules. For a right ZE\mathbb{Z}E-module NN, the groups H∗(B,N)H_*(B,N) are the homology of N⊗ZBC∗(B)N\otimes_{\mathbb{Z}B}C_*(B), on which

T(x⊗σ)=xt⊗φ∗σT(x\otimes\sigma)=xt\otimes\varphi_*\sigma

is a well-defined chain endomorphism, since bt=tφ(b)bt=t\varphi(b) in EE.

Lemma A.7. For every right ZE\mathbb{Z}E-module NN there is a long exact sequence

⋯⟶Hq(B,N)⟶1−THq(B,N)⟶Hq(E,N)⟶Hq−1(B,N)⟶1−T⋯\cdots\longrightarrow H_q(B,N)\mathrel{\mathop{\longrightarrow}^{1-T}}H_q(B,N)\longrightarrow H_q(E,N)\longrightarrow H_{q-1}(B,N)\mathrel{\mathop{\longrightarrow}^{1-T}}\cdots

Proof. The complex P∗=ZE⊗ZBC∗(B)P_*=\mathbb{Z}E\otimes_{\mathbb{Z}B}C_*(B) is a free ZE\mathbb{Z}E-resolution of Z[E/B]\mathbb{Z}[E/B], and T~(g⊗σ)=gt⊗φ∗σ\widetilde{T}(g\otimes\sigma)=gt\otimes\varphi_*\sigma is a ZE\mathbb{Z}E-linear chain endomorphism of P∗P_* lifting T(gB)=gtBT(gB)=gtB. By the exactness of (9), the mapping cone of 1−T~1-\widetilde{T} is a free ZE\mathbb{Z}E-resolution of Z\mathbb{Z}. Tensoring with NN identifies N⊗ZEP∗N\otimes_{\mathbb{Z}E}P_* with N⊗ZBC∗(B)N\otimes_{\mathbb{Z}B}C_*(B) and 1⊗T~1\otimes\widetilde{T} with TT; the long exact sequence of the cone is the assertion.

Lemma A.8 (cf. [11 Sections 7.3–7.4]). Let II be a set and N=(ZE)IN=(\mathbb{Z}E)^I. Then TT is locally nilpotent on Hq(B,N)H_q(B,N) for every q≥1q\ge1. Consequently Hq(E,N)=0H_q(E,N)=0 for every q≥2q\ge2.

Proof. For every bound AA and every pp, the module CpA(B)C_p^A(B) is free on the finite set Sp(A)S_p(A), and finite direct sums commute with products, so the coordinate map

π:N⊗ZBCpA(B)→≅∏λ∈IZE⊗ZBCpA(B)(13)\pi:N\otimes_{\mathbb{Z}B}C_p^A(B)\xrightarrow{\cong}\prod_{\lambda\in I}\mathbb{Z}E\otimes_{\mathbb{Z}B}C_p^A(B) \tag*{(13)}

is an isomorphism, compatible with ∂\partial, with TT and with enlarging AA. Moreover N⊗ZBC∗A(B)N\otimes_{\mathbb{Z}B}C_*^A(B) is a subcomplex of N⊗ZBC∗(B)N\otimes_{\mathbb{Z}B}C_*(B), because CpA(B)C_p^A(B) is a direct summand of Cp(B)C_p(B).

Let q≥1q\ge1, let zz be a qq-cycle, and choose a bound AA with z∈N⊗ZBCqA(B)z\in N\otimes_{\mathbb{Z}B}C_q^A(B). By Proposition A.6, some φr\varphi^r admits a controlled qq-contraction (hp)p≤q(h_p)_{p\le q} over AA; let A′⊇A∪φr(A)A'\supseteq A\cup\varphi^r(A) be a bound containing the images of the hph_p. Fix representatives of the cosets E/BE/B. As a right ZB\mathbb{Z}B-module, ZE\mathbb{Z}E is the direct sum of the submodules gZBg\mathbb{Z}B, so every element of ZE⊗ZBCpA(B)\mathbb{Z}E\otimes_{\mathbb{Z}B}C_p^A(B) can be written uniquely as ∑gg⊗xg\sum_g g\otimes x_g with xg∈CpA(B)x_g\in C_p^A(B). Put

H(∑gg⊗xg)=∑ggtr⊗hp(xg)∈ZE⊗ZBCp+1A′(B)(0≤p≤q).H\left(\sum_g g\otimes x_g\right)=\sum_g gt^r\otimes h_p(x_g)\in\mathbb{Z}E\otimes_{\mathbb{Z}B}C_{p+1}^{A'}(B)\qquad(0\le p\le q).

Since ∂\partial acts componentwise and c∗c_* vanishes in positive degrees, (A.1) gives ∂H+H∂=Tr\partial H+H\partial=T^r on ZE⊗ZBCpA(B)\mathbb{Z}E\otimes_{\mathbb{Z}B}C_p^A(B) for 1≤p≤q1\le p\le q. Applying HH in every coordinate and using (A.3) for AA and A′A', we obtain maps HI:N⊗ZBCpA(B)→N⊗ZBCp+1A′(B)H^I:N\otimes_{\mathbb{Z}B}C_p^A(B)\to N\otimes_{\mathbb{Z}B}C_{p+1}^{A'}(B) satisfying ∂HI+HI∂=Tr\partial H^I+H^I\partial=T^r in the same degrees, since both sides lie in N⊗ZBCpA′(B)N\otimes_{\mathbb{Z}B}C_p^{A'}(B) and agree in every coordinate. In particular Trz=∂HIzT^r z=\partial H^I z, so Tr[z]=0T^r[z]=0.

For a locally nilpotent TT, the map 1−T1-T is bijective, with inverse x↦∑k≥0Tkxx\mapsto\sum_{k\ge0}T^kx. For q≥2q\ge2, the maps 1−T1-T in degrees qq and q−1q-1 of the sequence of Lemma A.7 are therefore bijective, and Hq(E,N)=0H_q(E,N)=0.

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 m≥1m \ge1, and let Γ\Gamma be a group of type FPm\mathrm{FP}_m such that Hq(Γ,(ZΓ)I)=0H_q(\Gamma,(\mathbb{Z}\Gamma)^I) = 0 for every set II and every q≥mq \ge m. Then Γ\Gamma is of type FP∞\mathrm{FP}_\infty.

Proof. Write R=ZΓR = \mathbb{Z}\Gamma, and let P∗P_* be a free resolution of Z\mathbb{Z} whose terms P0,…,PmP_0,\ldots,P_m have finite rank [5 VIII.4.3]. Let Zm=ker⁡(dm:Pm→Pm−1)Z_m = \ker(d_m : P_m \to P_{m-1}), let II be its underlying set, and put N=RIN = R^I. Since PmP_m and Pm−1P_{m-1} have finite rank, N⊗RPq≅PqIN \otimes_R P_q \cong P_q^I for q=m−1,mq = m-1,m, compatibly with 1⊗dm1 \otimes d_m. The family ξ=(z)z∈Zm\xi= (z)_{z \in Z_m} is therefore a cycle in N⊗RPmN \otimes_R P_m, and Hm(Γ,N)=0H_m(\Gamma,N) = 0 gives ξ=(1⊗dm+1)(y)\xi= (1 \otimes d_{m+1})(y) for some y=∑a=1sxa⊗pay = \sum_{a=1}^s x_a \otimes p_a with xa∈Nx_a \in N and pa∈Pm+1p_a \in P_{m+1}. In the coordinate indexed by zz, this reads z=∑a(xa)zdm+1paz = \sum_a (x_a)_z d_{m+1}p_a, so ZmZ_m is generated by dm+1p1,…,dm+1psd_{m+1}p_1,\ldots,d_{m+1}p_s. Replacing Pm+1P_{m+1} by a free module of rank ss mapping onto ZmZ_m, and the higher terms by a free resolution of its kernel, yields a free resolution that agrees with P∗P_* in degrees ≤m\le m and has finite rank in degree m+1m+1. Iterating produces a single free resolution of finite rank in every degree. □

Proof of Proposition A.2. By Corollary 6.1 with m=1m = 1, EE is of type FP2\mathrm{FP}_2. By Lemma A.8, Hq(E,(ZE)I)=0H_q(E,(\mathbb{Z}E)^I) = 0 for every set II and every q≥2q \ge2, and Lemma A.9 with m=2m = 2 concludes. □

Remark A.10. Corollary 6.1 can be avoided. Since BB is finitely generated, H0(B,(ZE)I)≅Z[E/B]IH_0(B,(\mathbb{Z}E)^I) \cong\mathbb{Z}[E/B]^I, with TT acting coordinatewise by gB↦gtBgB \mapsto gtB, so 1−T1-T is injective there by (6.2). With Lemmas A.7 and A.8 this gives H1(E,(ZE)I)=0H_1(E,(\mathbb{Z}E)^I) = 0, and Lemma A.9 applies with m=1m = 1.

Proof of Theorem A.1

Let B=B1,OB = B_{1,O} be the group of Lemma 7.2. By Lemma 4.2, KT(B)K_{\mathcal{T}}(B) is finitely generated and O\mathcal{O}-recursively presented, so there is an embedding κ:KT(B)→B\kappa: K_{\mathcal{T}}(B) \to B. The endomorphisms αv=κ∘ιv\alpha_v = \kappa\circ\iota_v satisfy the hypothesis of Corollary 5.3 by (1.2), and α0\alpha_0 is injective by Lemma 4.1. By Proposition A.2, the group

EO=⟨B,t:t−1bt=α0(b), b∈B⟩E_O = \langle B,t: t^{-1}bt = \alpha_0(b),\ b \in B\rangle

is of type FP∞\mathrm{FP}_\infty. It contains BB, hence a copy of every countable O\mathcal{O}-recursively presented group by Lemmas 7.1 and 7.2, and it is O\mathcal{O}-recursively presented by Subsection 2.3.

Let JJ be the two-generator group obtained from EOE_O and a fixed finite generating set by the construction in the proof of Lemma 7.6. This construction does not depend on nn, and EOE_O is of type FPn\mathrm{FP}_n for every nn, so JJ is of type FPn\mathrm{FP}_n for every nn, that is, of type FP∞\mathrm{FP}_\infty. It contains EOE_O, and it is O\mathcal{O}-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 O\mathcal{O}-recursively presented for a suitable oracle (Subsection 2.3).

Remark A.11. Whatever the choice of κ\kappa, the group EOE_O is the group B2,OB_{2,O} of Theorem 7.3. Thus the first ascending HNN extension in that proof is already of type FP∞\mathrm{FP}_\infty: the finiteness degree enters only through the power of φ\varphi and the bounds in Proposition A.6, not through the group. The conclusion FP∞\mathrm{FP}_\infty is optimal: by Corollary C, a finitely generated group that is not recursively presented embeds in no group of type F2\mathrm{F}_2.

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. [1]M. Bestvina, Questions in Geometric Group Theory, 2004, https://www.math.utah.edu/~bestvina/eprints/questions-updated.pdf.
  2. [2]R. Bieri, Homological dimension of discrete groups, 2nd ed., Queen Mary College Mathematics Notes, Queen Mary College, London, 1981.
  3. [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. [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. [5]K. S. Brown, Cohomology of groups, Graduate Texts in Mathematics, vol. 87, Springer-Verlag, New York, 1982; corrected reprint, 1994.
  6. [6]F. Fournier-Facio and M. C. B. Zaremsky, Finiteness properties and Higman’s rope trick, preprint, arXiv:2607.21727, 2026.
  7. [7]G. Higman, Subgroups of finitely presented groups, Proc. Roy. Soc. London Ser. A 262 (1961), 455–475.DOI
  8. [8]G. Higman, B. H. Neumann and H. Neumann, Embedding theorems for groups, J. London Math. Soc. 24 (1949), 247–254.DOI
  9. [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. [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. [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. [12]C. T. C. Wall, Finite complexes, II. Proc. Roy. Soc. London Ser. A 295 (1966), 129–139.

Paper details

vlnc:W_pfv84q5q
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents