Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The target of a finite cellular mapping cylinder is a simple subcomplex

Statement

For any cellular map f:X→Y of finite CW complexes, the target inclusion iY:Y↪Mf is a finite composite of elementary expansions. If f is a homotopy equivalence, the source inclusion iX:X↪Mf is a homotopy equivalence, and τ(f)=p∗τ(iX) for the canonical retraction p:Mf→Y; p is a homotopy inverse of iY, is homotopic relative to Y to a finite composite of elementary collapse maps, and has zero torsion.

Facts & Assumptions

Given: A cellular map f:X→Y of finite CW complexes, the mapping cylinder Mf with its inclusions iX,iY and canonical retraction p.

[F1]

An elementary expansion of dimension n attaches a pair of cells (en−1,en) such that the characteristic map of the upper cell restricts on one boundary disk to a characteristic map of the new (n−1)-cell, homeomorphic on its interior, while all complementary boundary values lie in the previously constructed subcomplex X. The pair (Y,X) deformation retracts onto X. A finite composite of elementary expansions is a formal deformation, and the operation is componentwise (Elementary expansions and collapses of finite CW complexes).

[F2]

For a cellular f:X→Y equal to the identity on a common subcomplex A, the quotient W=(Y⊔(X×I))/((x,0)∼f(x), (a,t)∼a (a∈A)) is a CW complex whose cells are those of Y, those of the free end X∖A, and one (r+1)-cell er×(0,1) for every r-cell of X∖A; its embedded copies j(X) and k(Y) are subcomplexes, and the map r:W→Y with r([x,s])=f(x), r(k(y))=y is a strong deformation retraction fixing k(Y) (Cellular mapping cylinders and relative cylinders are CW complexes).

[F3]

A map is a simple homotopy equivalence if it is homotopic to a finite composite of elementary expansions, elementary collapses and cellular isomorphisms; every such composite is a homotopy equivalence, composites of simple homotopy equivalences are simple, and any map homotopic to a simple homotopy equivalence is simple (Simple homotopy equivalence).

[F4]

Every simple homotopy equivalence of finite CW complexes has zero Whitehead torsion in the target Whitehead group; in particular the identity map of a finite CW complex, exhibited as simple by the empty sequence, has zero torsion (Simple homotopy equivalences have zero torsion).

[F5]

For homotopy equivalences f:X→Y, g:Y→Z of finite CW complexes, τ(g∘f)=τ(g)+g∗τ(f) (Composition and based-pair sum formulas for Whitehead torsion).

[F6]

τ is defined for homotopy equivalences of finite CW complexes, taking values in the Whitehead group of the target, with the componentwise convention for disconnected targets (Whitehead torsion of a finite CW homotopy equivalence).

[F7]

A map f is a homotopy equivalence if there is g with g∘f≃id and f∘g≃id; such a g is a homotopy inverse of f (Homotopy equivalences, homotopy inverses and spaces of the same homotopy type).

[F8]

A map homotopic to a homotopy equivalence is a homotopy equivalence (A continuous map homotopic to a homotopy equivalence is itself a homotopy equivalence).

Proof

technique · direct
1.1

Take A=∅ in [F2], so that Mf=W is the ordinary mapping cylinder with iX=j, iY=k and p=r, and p∘iY=idY, p∘iX=f; its cells are the cells of Y, the free-end cells j(e) for the cells e of X, and the prism cells er×(0,1) of dimension r+1 for the r-cells er of X, finitely many in all.

F2
1.2

Order the cells of the finite complex X by increasing dimension and, for each r-cell er of X with characteristic map Φ:Dr→X, let Z(er)⊇Zr−1 denote the subcomplex obtained from the previously built subcomplex Zr−1 by first attaching the free-end cell j(er) and then the prism cell er×(0,1). Its closure er×(0,1)‾ is the image of Dr×[0,1] and its boundary consists of the pieces Dr×{0}, Sr−1×[0,1] and Dr×{1}; under the identification (x,0)∼f(x) the first piece maps into Y⊆Zr−1, under the cellularity of f the middle piece maps into Y∪j(X(r−1))∪{prisms of cells of X(r−1)}⊆Zr−1, and the last piece is exactly the closed free-end cell j(er) attached in the previous step. The ball pair (Dr×[0,1],Dr×{1}) is homeomorphic to (Dr+1,D+r), so the characteristic prism map exhibits an (r,r+1)-cell pair with free face j(er) corresponding to an upper hemisphere, so Zr−1↪Z(er) is an elementary expansion of dimension r+1 by [F1].

F1F2
2.1

Performing the steps of step 1.2 for the finitely many cells of X in increasing dimension gives a finite chain of elementary expansions Y=Z−1↪⋯↪Mf whose composite is iY, so iY is a simple homotopy equivalence by [F3] and τ(iY)=0 by [F4].

F1F3F4step 1.2
3.1

By step 1.1, p∘iY=idY, and by [F2] the strong deformation retraction gives iY∘p≃idMf, so p is a homotopy inverse of the homotopy equivalence iY in the sense of [F7]. Applying [F5] to the composable homotopy equivalences iY and p gives τ(p∘iY)=τ(p)+p∗τ(iY) in Wh(π1Y); the left side is τ(idY)=0 by [F4] and τ(iY)=0 by step 2.1, hence τ(p)=0. Reverse the expansion sequence of step 2.1 and choose the elementary collapse retraction for each pair. Their composite r:Mf→Y fixes Y. If H is the deformation from idMf to iYp supplied by [F2], then rH is a homotopy from r to riYp=p, relative to Y. Thus p is homotopic relative to Y to that collapse composite and has zero torsion; no equality of these retractions is asserted.

F2F4F5F7step 1.1step 2.1
4.1

Suppose now that f is a homotopy equivalence. By [F7] and step 1.1, iY∘f=iY∘p∘iX≃idMf∘iX=iX, so iX is homotopic to the composite iY∘f; here f is a homotopy equivalence by hypothesis, iY is a homotopy equivalence by step 3.1, and a composite of homotopy equivalences is a homotopy equivalence, so iX is a homotopy equivalence by [F8].

F7F8step 1.1step 3.1
5.1

In the situation of step 4.1 the maps iX and p are homotopy equivalences with p∘iX=f, so [F5] applies to the pair (iX,p) and gives τ(f)=τ(p∘iX)=τ(p)+p∗τ(iX)=p∗τ(iX) in Wh(π1Y) by [F6], since τ(p)=0 by step 3.1.

F5F6step 3.1step 4.1
6.1

For disconnected X and Y the construction is componentwise: f maps each component of X into a component of Y, over a target component D the cylinder is D together with the cylinders on all components of X mapping into D, while target components receiving none are unchanged. The expansion sequence of step 1.2 is performed component by component, and the identities of steps 2.1–5.1 hold in the corresponding summands of the Whitehead groups by [F6].

F2F6step 1.2step 2.1step 5.1∎

Depends on

Used by

Dependency tree · two levels

39 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources