Finite Chains of Two-Complexes and Acyclic Covers
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 is zero on π2. The paper asks which two-complexes start such chains of every finite length.
The authors prove that a connected two-complex K starts strictly increasing chains of every finite length with all inclusions zero on π2 if and only if K has a connected acyclic regular cover. The necessity direction uses cycle tests and a Strebel-type injectivity lemma. Sufficiency builds chains over the acyclic cover from presentations and blocks derived from Davis's moment-angle cube complexes and relative hyperbolization. A descent pushout argument then transfers these chains to K. Theorem A was formalized in Lean/Mathlib.
Theorem A gives the equivalence, with finite complexes when K is finite and acyclic. As a corollary, a presentation complex of SL(2,5) with π2 ≅ Z^119 begins finite chains of every length in which all inclusions are zero on π2.
