WorksMathematics
Finite Chains of Two-Complexes and Acyclic Covers
Abstract
A negative answer to Whitehead's asphericity problem would follow from an infinite chain of two-complexes, starting with a non-aspherical one, in which every inclusion induces the zero map on second homotopy groups. We prove that a connected two-complex is the first term of such chains of every finite length if and only if has a connected acyclic regular cover. In particular, there is a finite non-aspherical two-complex , a presentation complex of , such that for every there is a strictly increasing chain of finite two-complexes in which all inclusions are zero on .
Introduction
A two-complex is aspherical if its second homotopy group vanishes. Whitehead asked whether every subcomplex of an aspherical two-complex is aspherical [17]; see [1] for a survey. Suppose that
is a chain of two-complexes. Every map has compact image, hence lands in some , and is therefore null-homotopic in . So is aspherical and contains the non-aspherical subcomplex , a negative answer to Whitehead’s question [9 §1]. Conversely, Howie Howie [11] showed that if the answer is negative, there is a counterexample that either is finite or is the union of an infinite chain of finite non-aspherical subcomplexes as in (1.1), with every inclusion null-homotopic.
This paper produces examples of two-complexes that admit a chain as in (1.1) of arbitrary finite length, via the following characterization:
Theorem A. For a two-complex the following are equivalent.
For every there is a chain of two-complexes in which every inclusion induces the zero map on .
has a connected acyclic regular cover.
If is finite and acyclic, the in (1) can be chosen finite.
Recall that a two-complex is Cockcroft [4] if its Hurewicz map is zero. By Hopf’s exact sequence [3 Ch. II, §5], this holds if and only if is an isomorphism. Moreover is Cockcroft if and only if there is a single strict inclusion of two-complexes that is zero on (Lemma 2.1(a)). In particular, in a chain as in (1) the complexes are Cockcroft, and truncating a chain of length shows that can be taken Cockcroft too. Theorem A thus describes the complexes that are “Cockcroft to every Theorem A does not produce an infinite chain (1): the chains constructed for different are not extensions of one another.
Corollary B. Let be the presentation complex of
Then , and for every there is a chain of finite two-complexes in which every inclusion is zero on .
Proof. has one vertex, two edges and two 2-cells, so its cellular boundary vanishes and is the exponent-sum matrix , of determinant . Hence is acyclic, so it is its own connected acyclic regular cover, and Theorem A gives the chains, with finite terms. A coset enumeration shows that has order 120; being perfect, is . The universal cover is simply connected with Euler characteristic , so .
Previous work
The second author [14 Theorem 1.1] constructed chains of finite presentation complexes with and both inclusions zero on . Corollary B provides such chains of every finite length.
Outline of the proof
(1)(2) (Section 3). A chain of length gives quotients of . To every 2-chain on the universal cover of we associate a “cycle test”, and show that fails the test at no more than one of these quotients. Hence any tests are passed simultaneously by some quotient. A compactness argument in the space of normal subgroups of then gives a normal subgroup passing all tests, which means with all coefficients. If is minimal with this property, a Strebel-type lemma shows that is perfect, so the cover is acyclic.
(2)(1) (Sections 4–6). In Section 4 we show that it suffices to build the chain over the acyclic cover itself, with dying after the first step; the chain descends to by a pushout. In Section 5 we build such chains over an acyclic , by iterating an operation that turns generators into commutators and replaces relators by “blocks”, and then appending a terminal extension. The blocks are used through three properties (B1)–(B3). In Section 6 we construct the blocks from a truncated non-positively curved cube complex, using constructions of Davis [5] and of Davis–Januszkiewicz–Weinberger [6].
Conventions
A two-complex is a connected CW-complex of dimension at most 2, possibly with infinitely many cells. An inclusion means that is a proper subcomplex of . Homology has integer coefficients unless stated otherwise. A connected space is acyclic if its reduced integral homology vanishes. For a connected complex with and a normal subgroup , we write for the connected regular cover with ; its deck group is . We write for the universal cover of , write for the Hurewicz map, and we identify as -modules (Hurewicz). A map is zero on if it induces the zero map on second homotopy groups.
AI usage and formalization
A variety of AI tools, including ChatGPT 6 Astra, Claude 5.5 Fable, and Aristotle, were used to assist with the proof of the main results and the redaction of the manuscript. The interaction with the AI involved a large amount of back-and-forth and experimentation during approximately 5 months. The arguments and text have been reviewed, checked, and substantially revised by the authors, who are responsible for the final manuscript.
Theorem 1 has been formalized in Lean/Mathlib and will shortly be available on the Palomar repository.
Preliminaries
Cockcroft complexes and zero maps
Lemma 2.1. Let be connected CW-complexes.
(a) Let be a two-complex. There is a two-complex with zero on if and only if is Cockcroft. If is finite, can be chosen finite.
(b) If is Cockcroft and is trivial on , then is zero on .
(c) Let be such that . If is Cockcroft, so is . If satisfies on , then is zero on .
(d) If is injective on and is Cockcroft (e.g. is aspherical), then is Cockcroft. A wedge of Cockcroft complexes is Cockcroft.
Proof. (a) Let with a two-complex. Since there are no 3-cells, on cellular chains, so is injective. If is zero on , then , hence . Conversely, let be Cockcroft. If , attach 2-cells along loops representing a generating set of (finite if is finite). The resulting is simply connected, so is an isomorphism, and gives . If , then is an isomorphism and zero, so , and we may take with attached along the loop .
(b) By the lifting criterion, lifts to , and where is the covering. Now , and is an isomorphism, so .
(c) The Hurewicz map is invariant under the action of , so for , . Similarly .
(d) We have and is injective, so . For a wedge with retractions , the map with coordinates is injective, and . □
Regular covers
Let be a two-complex and . Write and for the sets of 1-cells and 2-cells of , and fix an orientation and a lift to of every cell. For , the images of these lifts in are lifts of the cells of , and the cells of are their translates under the deck group . Hence, for or , the cellular chain module is identified with , and with (direct sums, left modules). Let
be the cellular boundary map in these bases. For we write for its image; then , since the covering is cellular and maps chosen lifts to chosen lifts.
Proposition 2.2. (over ), and .
Proof. has no 3-cells, so ; and . □
Remark 2.3. If has a single vertex, it is the presentation complex of a presentation of , and is right multiplication by the matrix of Fox derivatives, reduced to [7], [13 Ch. II, §3]. For this is the exponent-sum matrix. Every two-complex is homotopy equivalent to such a complex, by collapsing a maximal tree of its 1-skeleton.
Lemma 2.4. Let be connected CW-complexes and let be the kernel of . Then every component of the preimage of in is a copy of , and permutes these components transitively.
Proof. The preimage of is a covering space of . A loop in lifts to a loop in if and only if it is trivial in , so the component through a base lift is the cover with fundamental group . The deck group acts transitively on the fibre over the base point, hence on the components.
Proof of (1) implies (2)
Throughout this section is a two-complex satisfying (1), , and we use the notation of Section 2.2. The letter denotes or for a prime .
We begin with a special case of a theorem of Strebel [16, Cor. 1.8(ii)]; we include a proof for completeness.
Lemma 3.1. Let be a torsion-free abelian normal subgroup of a group , and let be a homomorphism of free left -modules of arbitrary ranks. If is injective, then is injective.
Proof. Restrict scalars to . Since is a free -module on a set of coset representatives, and are free -modules. Let be the augmentation, with kernel . As is normal, , and under these identifications becomes . The ring is a commutative domain: every finite computation in takes place in the Laurent polynomial ring of a finitely generated, hence free abelian, subgroup of .
Claim. If have -linearly independent images in , then they are -linearly independent.
We induct on , the case being empty. Since , some coordinate functional with respect to an -basis of satisfies , where ; in particular . Put for . Their images are -linearly independent, because the are and in the domain . By induction the are -linearly independent. If with , then, being commutative,
so for . Then , and applying gives , so .
Now let be an -basis of . The form a -basis of , so by injectivity of every finite subfamily of is -linearly independent. By the claim, every finite subfamily of is -linearly independent, i.e. is injective.
Cycle tests
Definition 3.2. A test is a pair with and . A normal subgroup passes the test if implies ; otherwise it fails it. We call good if it passes every test.
Since every element of is of the form , a normal subgroup is good if and only if is injective over and over every , i.e. (Proposition 2.2) for all such .
Lemma 3.3. Let be a chain of two-complexes in which every inclusion is zero on , and let , so that . For every test and ,
Consequently each test is failed by at most one , and any tests are all passed by some with .
Proof. Fix and write , , , . By Lemma 2.4, the components of the preimages of in and through the base points are copies of and , and the based lift of the inclusion restricts to the covering map . On 2-chains, the latter is the reduction
Assume . Then is a 2-cycle of , and its image is a 2-cycle of . The map is zero: for it is the map ; for , since , the universal coefficient theorem identifies it naturally with . Thus is a null-homologous 2-cycle in a complex without 3-cells, so .
If a test fails at , then , hence for all (as ), so it passes at every . Applying this to the smallest index where the test fails shows that it fails at most once. Since tests have at most failures among the indices, some index is failed by none. □
Lemma 3.4. The set of good normal subgroups of is nonempty and has a minimal element with respect to inclusion.
Proof. Identify subsets of with points of the compact space ; the normal subgroups form a closed subset . Fix a test , and let be a finite set containing the supports of all coordinates of and of . Since and are obtained by summing coefficients over left cosets , and if and only if , whether passes depends only on . Hence the set of normal subgroups passing is clopen in . By hypothesis (1) and Lemma 3.3, applied to a chain of length , any of the sets have a common point. By compactness, is nonempty, and it is closed.
If is totally ordered by inclusion, then is the limit in of the net , ordered by reverse inclusion: for each , membership of is eventually constant and equal to membership in . Hence , and Zorn’s lemma gives a minimal element. □
Proof of (1) (2). Let be a minimal element of . Then for and every . By the universal coefficient theorem, for every , so is torsion-free.
Apply Lemma 3.1 with , and over . Since , we have , which is injective. Hence is injective over every , i.e. . Minimality gives . Thus and , and is a connected acyclic regular cover of . □
Reduction to the acyclic cover
Let be a connected acyclic regular cover, , and . Section 5 builds chains over in which dies immediately. This section transfers them to .
Proposition 4.1 (Descent). Let be two-complexes with all inclusions zero on , such that is trivial for . Let be the pushout of , i.e. together with the cells of , attached by composing their attaching maps with on . Then are
two-complexes and all inclusions are zero on . If and all are finite, so are all .
Proof. Cells and . The cells of are those of and those of , so the are strictly nested two-complexes. Put . By van Kampen’s theorem is the pushout of . The first map has normal image and the second is trivial, so
is generated from . Write and . By Lemma 2.4, in : the preimage of is a disjoint union of copies of indexed by (the kernel of is , since embeds in ); the preimage of is a disjoint union of copies of indexed by ; and the preimage of is a disjoint union of copies of indexed by , as dies in . These are subcomplexes, the first two cover and intersect in the third, so we have a short exact sequence of cellular chain complexes
Since , the long exact homology sequence gives an isomorphism
that is,
induced by . In particular .
Zero maps. The covering is bijective on , and the composite equals , which is zero on ; hence is zero on . For , the square formed by and commutes, its top arrow is zero on , and is generated by the image of ; so is zero on by Lemma 2.1(c). □
Proof of (2) (1), given Proposition 5.1. Apply Proposition 5.1 to the acyclic cover and then Proposition 4.1. If is finite and acyclic, take and the identity; then , which are finite by Proposition 5.1. □
The chain over an acyclic complex
Proposition 5.1. Let be an acyclic two-complex and . There are two-complexes
with all inclusions zero on and trivial for . If is finite, all can be chosen finite.
Presentations extending
Fix a maximal tree of the 1-skeleton of and a base vertex. Collapsing gives a presentation , where the are the edges of outside ; we fix a total order on . Every word in the determines a based edge loop in , going through . A presentation extending is a complex obtained by attaching loops at the base vertex (extra generators) and 2-cells along words in the and the extra generators (extra relators). The and are the core generators and relators. Relators are labelled: equal words with different labels are different 2-cells. We write , and for the presentation complex of a presentation . Since , and is the presentation complex of the corresponding presentation, we freely pass between the two.
Since is acyclic and has a single vertex, its cellular boundary (Remark 2.3)
is an isomorphism, since its kernel is and its cokernel is . Note that maps finitely supported vectors to finitely supported vectors.
If , then is a wedge of spheres, so since , and is contractible. We then take for the complex with pairs attached, along the loop ; all vanish. Henceforth .
Outline
We write . The chain is built by induction on . We start from a pair that kills (Lemma 5.2). Given a chain , we apply to each term an operation that turns every extra generator into a commutator of two new generators, corrects every extra relator by core relators so that it becomes a product of commutators, and then replaces it by a block. By the defining property (B2) of blocks, of is generated by the image of , so preserves inclusions that are zero on (Lemma 5.4). We then append the terminal extension , obtained by capping all generators . It kills , and its second homology comes from “capped blocks”, which are Cockcroft by (B3) (Lemma 5.5). Each such pass lengthens the chain by one.
The initial pair
Define
a presentation extending .
Lemma 5.2. is free abelian on the , and in it. The complex is Cockcroft, and is trivial on and zero on .
Proof. The group. Eliminate . The cross-commutators make the subgroups commute pairwise, so the commute, and becomes . For we get
So and all commute. Conversely, sending to a basis of the free abelian group on and to satisfies every relator.
Cockcroft. Eliminating the by the relators is a Tietze transformation, hence a homotopy equivalence [10 Ch. I], from to the presentation complex with generators and relators and the cross-commutators. All these relators have zero exponent sums, so the cellular boundary of vanishes and is free on the -cells. Let be the union of the finite subtori of , with its product cell structure. It is a , and is free on the coordinate squares. Map by sending generators to the corresponding circles, each cross-commutator disk onto its square with degree one, and the disk of , whose boundary is a concatenation of loops , onto the concatenation of the corresponding -squares. On :
A class in the kernel has zero cross-commutator coefficients, and its vector of remaining coefficients satisfies , so . Thus is injective, and is Cockcroft by Lemma 2.1(d).
The inclusion. is trivial on , as is generated by the , and is Cockcroft since ; apply Lemma 2.1(b). ∎
Blocks
For let be the closed oriented surface of genus with its standard one-vertex cell structure: edges and one 2-cell attached along .
Theorem 5.3 (Blocks). For every there is a finite presentation
with and a finite list of internal generators, such that:
(B1) Marking. There is a cellular map sending each edge to the generator of the same name.
(B2) Replacement creates no new . Let be a presentation, and suppose in the free group on . Replace the relator by a block with fresh internal generators :
Let be the structural map: the identity on the 1-skeleton of and on the 2-cells of , and on the 2-cell the filling of given by . Then
The same holds for the simultaneous replacement of any set of relators, each with its own fresh internal generators.
(B3) Capped blocks are Cockcroft. The presentation is Cockcroft.
Section 6 proves this theorem. Property (B2) is what makes preserve inclusions that are zero on , and (B3) is what makes the terminal extension Cockcroft.
The operations and
Let be a presentation extending . Fix once and for all, for every word with zero exponent sum in every generator, an expression in the free group with . Such expressions exist since such lie in the commutator subgroup; for instance, repeatedly use to sort the letters of according to a fixed order on the generators, and use if no commutator occurs. Define by the following three rules.
Generators become commutators. For each extra generator of take a fresh pair of generators and substitute in every extra relator. Core generators and core relators are untouched. Call the substituted form of an extra relator .
Correction by core relators. Let be the vector of exponent sums of in the , and . Replace by
which has zero exponent sum in every generator: in the by the choice of , and in the because they only occur inside the commutators .
Blocks. Write using the fixed expression, and replace the relator by the block (5.3), with fresh internal generators for each label .
The core is unchanged, so . The words involve only the and the . Composing the maps of the three rules (the third being the structural map of (B2)) gives a structural map , with and . The terminal extension is
internal generators of blocks are not capped.
Naturality. All choices in (the names , the corrections, the factorizations, the internal generators) depend only on the labelled generator or relator concerned. Hence a labelled inclusion induces a labelled inclusion with . A new extra generator yields a new pair , and a new extra relator yields a new block, which has relators; so preserves strict inclusions.
Lemma 5.4. For every presentation extending ,
Consequently, if is Cockcroft then so is , and if is zero on then so is .
Proof. If and satisfy the generation property and similarly for , then so does , because . It therefore suffices to check generation for each rule.
Rule 1. Let be obtained from by adding, for each extra generator , a loop , a loop and a 2-cell along . This relator says , and eliminating each by it is a Tietze transformation [10 Ch. I], giving the presentation of rule 1; under this homotopy equivalence the inclusion becomes the map of rule 1. Now is a graph of spaces [15]: the vertex space is , and each new 2-cell together with is a cylinder glued along and . Both loops have infinite order in , as is seen by killing . So is an HNN extension along infinite cyclic subgroups, in which the vertex group embeds [13 Ch. IV, §2]. Consequently is a tree of spaces whose vertex spaces are copies of the universal cover of and whose edge spaces are strips . Since is concentrated in degree 1, excision gives , so is onto. By the same argument applied to the wedge with circles (a tree of copies of joined by lines), each is generated by translates of .
Rule 2. The attaching maps of and are homotopic in the complex obtained by removing all extra relator cells, since the correcting word is null-homotopic in . Hence the map of rule 2 is a homotopy equivalence [8 Prop. 0.18].
Rule 3. This is exactly (B2).
The consequences follow from (5.7) and Lemma 2.1(c): if is Cockcroft, so is ; and if on , then , so . □
Lemma 5.5. Suppose that is Cockcroft and that all core generators are trivial in . Then the are trivial in and , the inclusion is zero on , and is Cockcroft.
Proof. The remain trivial because fixes them.
The inclusion. The composite is trivial on : the are trivial by hypothesis, and each extra generator maps to , a commutator of two capped loops. Since is Cockcroft, the composite is zero on by Lemma 2.1(b). By (5.7) and Lemma 2.1(c), the inclusion is zero on .
Cockcroft. Since is acyclic, the quotient map is an isomorphism on (long exact sequence of the pair). In , all and core relators have disappeared, and the remaining relators are the loops with their capping disks, and the blocks. Eliminating the by their capping disks is a homotopy equivalence [10 Ch. I]. As the words only involve the and the , every block relator becomes , and distinct blocks have disjoint internal generators. Therefore
the wedge being over the extra relators of . Each wedge summand is Cockcroft by (B3), hence so is the wedge (Lemma 2.1(d)), and is Cockcroft by Lemma 2.1(d) applied to .
Proof of Proposition 5.1
We construct chains of presentations extending , related by labelled inclusions, such that
By Lemma 5.2, is such a chain with . Given such a chain, set
By naturality, this is a strictly increasing chain of labelled inclusions; note that since has extra generators. By Lemma 5.4, the inclusions and are zero on , and every is Cockcroft. By Lemma 5.5, applicable because satisfies (10) and , the are trivial in and , the complex is Cockcroft, and is zero on . So the new chain satisfies (10). Applying (11) times to gives a chain of length ; as is generated by the , it is killed in every with .
If is finite, then and are finite, and each pass introduces finitely many generators and finitely many finite blocks; so all are finite.
Construction of the blocks
This section proves Theorem 5.3. We combine two constructions. Davis’s real moment-angle complexes realize a prescribed finite flag complex as every vertex link of a cube complex [5 Example 2.2]. The relative hyperbolization of Davis–Januszkiewicz–Weinberger [6 §2] cones off boundary components, hyperbolizes, and truncates the cone points. We adapt two of their arguments, the radial retraction [6 Lemma 2.2] and the CAT(0) property of a branched cover [6 Lemma 2.6], to show that does not grow when an arbitrary two-complex is glued into the truncated corner (Lemma 6.2).
The cube complex and its truncation
A simplicial complex is flag if every finite set of pairwise adjacent vertices spans a simplex. For a finite flag complex on the vertex set put
a cube complex whose cubes are indexed by a simplex and a choice of signs on the remaining coordinates. Every vertex link of is isomorphic to . We use Gromov’s link condition: a cube complex whose vertex links are flag is CAT(0), so its universal cover is CAT(0) and in particular contractible [2 Thms. II.5.20 and II.4.1(2)]. For cube complexes that are not locally finite, which occur in the proof of Lemma 6.2, see [12, Thm. C.9 and its proof; Thms. C.4, A.7].
Choose a finite triangulation of in which the standard loops are edge paths, and let be its barycentric subdivision. It is flag, since its simplices are the chains of faces of the original triangulation, and pairwise comparable faces form a chain.
Number the vertices of , set and , and cut off the corner at :
Since every other vertex of is at -distance at least 2 from , only the corner at is removed. The cut surface is a copy of the link of , hence of (triangulated as ), and the removed part is the open cone on it. We regard as the cut surface, the standard loops being edge paths in it.
Lemma 6.1.
(i) is a finite 3-dimensional cube complex all of whose vertex links are isomorphic to . It is aspherical.
(ii) collapses onto a finite two-dimensional subcomplex.
(iii) The inclusion maps the fundamental class to 0 in .
Proof. (i) This follows from the discussion above, as .
(iii) Since is a closed surface, every edge of lies in exactly two triangles; hence every square of lies in exactly two 3-cubes. Orient , and let compare the orientation of a triangle with the one given by increasing order of its vertices. Orient each cube by increasing order of coordinates, and give it the coefficient . Let a square lie in the cubes indexed by , , and let be the number of elements of smaller than . The square appears in the boundary of the -th cube with coefficient , where ; and because cancels in the fundamental cycle of . So these coefficients define a 3-cycle of . Now consider the exact sequence
By excision , and under this identification becomes the map induced by . The cubes containing are those with all signs , and their coefficients in are the ; so maps to a generator of . Hence , and .
(ii) is a polyhedral complex whose 3-cells are the cubes of , those containing being truncated. Consider the graph whose vertices are these 3-cells, two being adjacent when they share a 2-cell. It is connected: the cubes containing a given vertex correspond to the triangles of , and are connected because is a connected closed surface; and two vertices differing in one coordinate lie in a common cube, namely any cube indexed by a triangle containing . Choose a spanning tree, rooted at a truncated cube. A triangle of the cut surface lies in only one 3-cell, so we can collapse the root across it. Then collapse each other 3-cell, in order of distance to the root, across the 2-cell it shares with its parent: that 2-cell lies in exactly two 3-cells and the parent has been removed, so it is a free face. All 3-cells disappear.
The presentation and the marking (B1)
Let be the two-dimensional subcomplex of Lemma 6.1(ii), and let be the deformation retraction given by the collapse. By cellular approximation [8 Thm. 4.8], is homotopic to a cellular map , where carries its one-vertex structure. Contract a maximal tree of , call the remaining oriented edges, let be the boundary word of each 2-cell of , and let be the words read along . Put
with . The relators form generator–relator pairs, so the inclusion is a homotopy equivalence, and . Define on the 1-skeleton by , . The loop is homotopic in , across the cells , to . This is the image under of the boundary of the 2-cell of , so it bounds the image under of that 2-cell. Following the homotopy and then this disk defines on the 2-cell, and gives (B1). By construction, under the map corresponds to the inclusion up to homotopy.
Generation in the pushout: proof of (B2)
Let , and be as in (B2), and let be the cellular map sending to the loops and the 2-cell of onto the 2-cell with degree one (through a collar realizing the free reduction of to ). Consider the double mapping cylinder
In , the 3-cell (polygon) has the 2-cell as a free face; removing both is an elementary collapse. The remaining cylinder cells are an edge (vertex) joining the two base points, and 2-cells (edge) identifying with . Contracting the edge and eliminating by these 2-cells gives exactly the presentation complex of (5.3). Under this homotopy equivalence , the inclusion corresponds to the structural map . Moreover, since double mapping cylinders are homotopy invariant [8 Ch. 0], and corresponds to the inclusion of the cut surface, is homotopy equivalent rel to the space in the following lemma, with . Three-dimensional spaces occur only in this proof: every complex in our chains is a two-complex.
Lemma 6.2. Let be a two-complex, a cellular map, and , where is glued to by and to the cut surface of . Then is injective, and is generated over by the image of .
Proof. Collapsing to a point turns into , so ; let be the quotient map. It is a homeomorphism from onto .
Step 1: -injectivity (cf. [6 Lemma 2.2]). Let be the pullback of the universal cover along . It is obtained from by replacing each lift of , together with its open cone neighbourhood, by a copy ; in particular it is connected. Fix a lift . Since is CAT(0), each point outside the open cone neighbourhood of is joined to by a unique geodesic, which crosses the cut surface at exactly once (inside each cube at geodesics from are straight segments, and the cut is an affine hyperplane). Mapping to this crossing point defines a retraction onto , continuous because geodesics in CAT(0) spaces depend continuously on their endpoints. Define as follows:
on the lift of , ;
on , is the identity, and on its cylinder ;
at : is defined on the whole closed cone neighbourhood of , so its restriction to the cut surface extends over a cone and is therefore homotopic to a constant map by a homotopy with and constant. Put on the cylinder and let be constant on .
These definitions agree on overlaps, so is a retraction of onto . Hence is injective, and so is ; their composite is induced by .
Step 2: a CAT(0) quotient (cf. [6 Lemma 2.6]). Let be the preimage of . By Step 1 and Lemma 2.4, its components are copies of . Collapse each to a point to obtain a space , and let . As is simply connected and the are disjoint connected subcomplexes, [8 Ch. 0] is simply connected by van Kampen's theorem. The cylinders attached to become cones with apex , and each truncated cube together with the cone on its cut triangle becomes a full cube; so is a cube complex. The vertex links at old vertices are copies of . The link at is the preimage in of the cut surface adjacent to , that is, the pullback of along : a disjoint union of covers of . Covers of are flag: the vertices of a clique in a cover project to pairwise adjacent, hence distinct, vertices of , which span a simplex; this simplex lifts to a simplex through any vertex of the clique, and since a covering map is an isomorphism on the star of a vertex, the lift contains the whole clique. Hence is CAT(0) (by [12], as need not be locally finite), so contractible.
Step 3: homology. Since is a relative homeomorphism of CW pairs and is discrete, . Hence is surjective. By Lemma 2.4, permutes the components of transitively, and the component through the base point is a copy of with . Since , it is generated over by the image of . □
Lemma 6.2 gives (5.4) for a single replacement, and by induction (generation is preserved under composition, as in the proof of Lemma 5.4) for finitely many. For an arbitrary set of replacements, let be the full replacement and . A representing sphere is compact, so it meets only finitely many blocks, coming from a finite set of relators. Let be the presentation in which only the relators in are replaced. The structural map replacing the remaining relators is the identity on the subcomplex containing the sphere, so for some . Since and is equivariant, . This proves (B2).
The capped block: proof of (B3)
Lemma 6.3. Let be with a 2-cell attached along each and each . Then is Cockcroft. Consequently the capped presentation of (B3) is Cockcroft.
Proof. By homotopy invariance, . With the one-vertex structure on , the cone consists of the cone point, an edge (the cone on the vertex), 2-cells (the cones on ) and one 3-cell (the cone on the polygon). Contracting the edge [8 Prop. 0.17] gives .
The cellular boundary of consists of the 2-chain on , and the capping 2-cells with coefficients the exponent sums of and in , which vanish. The chain is a 2-cycle of representing the image of , which is zero by Lemma 6.1(iii) since corresponds to the inclusion . A null-homologous 2-cycle in a two-complex is the zero chain, so , and is an isomorphism. As is Cockcroft by Lemma 2.1(d). Finally, eliminating each by its capping 2-cell is a homotopy equivalence from to the presentation complex of the capped presentation . □
This proves (B3), and completes the proofs of Theorem 5.3, Proposition 5.1 and Theorem A. □
References
References
- [1]W. A. Bogley, J. H. C. Whitehead’s asphericity question, in [10], Chapter X, 309–334.
- [2]M. R. Bridson and A. Haefliger, Metric Spaces of Non-Positive Curvature, Grundlehren der mathematischen Wissenschaften 319, Springer-Verlag, Berlin, 1999. doi:10.1007/978-3-662-12494-9.DOI
- [3]K. S. Brown, Cohomology of Groups, Graduate Texts in Mathematics 87, Springer-Verlag, New York, 1982.
- [4]W. H. Cockcroft, On two-dimensional aspherical complexes, Proc. London Math. Soc. (3) 4 (1954), 375–384. doi:10.1112/plms/s3-4.1.375.DOI
- [5]M. W. Davis, Right-angled asphericity, flag complexes, Geom. Dedicata 159 (2012), 239–262. doi:10.1007/s10711-011-9654-4.DOI
- [6]M. W. Davis, T. Januszkiewicz, and S. Weinberger, Relative hyperbolization of aspherical manifolds: an addendum to “Hyperbolization of polyhedra”, J. Differential Geom. 58 (2001), 535–541. doi:10.4310/jdg/1090348358.DOI
- [7]R. H. Fox, Free differential calculus. I. Derivation in the free group ring, Ann. of Math. (2) 57 (1953), 547–560. doi:10.2307/1969736.
- [8]A. Hatcher, Algebraic Topology, Cambridge University Press, Cambridge, 2002. Author’s electronic edition.
- [9]M. P. Hitchman, An identity property for 2-complex pairs, Glasgow Math. J. 42 (2000), 299–318. doi:10.1017/S0017089500020188.DOI
- [10]C. Hog-Angeloni, W. Metzler, and A. J. Sieradski (eds.), Two-dimensional Homotopy and Combinatorial Group Theory, London Mathematical Society Lecture Note Series 197, Cambridge University Press, Cambridge, 1993.
- [11]J. Howie, Some remarks on a problem of J. H. C. Whitehead, Topology 22 (1983), 475–485.DOI
- [12]I. J. Leary, A metric Kan–Thurston theorem, J. Topol. 6 (2013), 251–284. doi:10.1112/jtopol/jts035.DOI
- [13]R. C. Lyndon and P. E. Schupp, Combinatorial Group Theory, Ergebnisse der Mathematik und ihrer Grenzgebiete 89, Springer-Verlag, Berlin, 1977.
- [14]R. Mikhailov, Two results on asphericity, preprint, 2026. arXiv:2608.20270.arxiv.org/abs/2608.20270
- [15]P. Scott and T. Wall, Topological methods in group theory, in Homological Group Theory (Durham, 1977), London Mathematical Society Lecture Note Series 36, Cambridge University Press, Cambridge, 1979, 137–203.DOI
- [17]J. H. C. Whitehead, On adding relations to homotopy groups, Ann. of Math. (2) 42 (1941), 409–428.DOI