Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Whitehead theorem

Statement

Assume the Axiom of Choice. Every weak homotopy equivalence f:XY between CW complexes is a homotopy equivalence. If X,Y are finite CW complexes, the same conclusion holds without any choice principle.

Facts & Assumptions

[F1]

Weak homotopy equivalence requires component bijectivity and isomorphisms at all source basepoints.

[F2]

Cellular approximation for maps of CW pairs deforms f to a cellular map, choice-free for finite X and with AC for arbitrary X.

[F3]

Cellular mapping cylinders and relative cylinders are CW complexes gives the ordinary CW mapping cylinder of a cellular map, its endpoint subcomplexes, exact cell count and strong deformation onto its target, without choice.

[F4]

A weak equivalence has vanishing mapping-cylinder relative groups converts weak equivalence into a component bijection and trivial relative groups for the ordinary mapping-cylinder source inclusion.

[F5]

Vanishing relative homotopy extends an inverse over cells compresses a CW complex onto such a source subcomplex, fixing it pointwise, choice-free for finitely many relative cells and with AC otherwise.

[F6]

Higher homotopy basepoint transport and moving homotopies controls the homomorphisms induced by a homotopy with a moving basepoint. Homotopy equivalences, homotopy inverses and spaces of the same homotopy type requires the two homotopy-inverse identities.

[A1]

The Axiom of Choice is used only in the arbitrary-cell clauses of [F2] and [F5].

Proof

Given: A weak homotopy equivalence f:XY of CW complexes.

1.1

By [F2], with the empty fixed subcomplex, take a cellular g:XY and a homotopy E:fg. If X is finite this uses its finite clause; otherwise use [A1]. For each xX, the track γx(t)=E(x,t) runs from f(x) to g(x), and [F6] gives f=βγxg on πn(X,x) for every n1. Since f and βγx are isomorphisms, g is an isomorphism. The same tracks show that f,g induce the identical function on components. Thus g is weak at all basepoints and on all components, even though E need not fix any prescribed basepoint.

F1F2F6A1given
2.1

Form the ordinary mapping cylinder M=Mg using [F3], with source inclusion j:XM, target inclusion k:YM and retraction r:MY. Then rj=g, rk=idY, and the cylinder deformation D runs from idM to kr, fixing k(Y). By [F4] and step 1.1, j is bijective on components and πn(M,X,j(x)) is trivial for every x and n1. These are exactly the hypotheses of [F5] for the CW pair (M,j(X)).

F3F4F5step 1.1
3.1

Apply [F5] to obtain a continuous ρ:MX with ρj=idX and a homotopy K:idMjρ fixing j(X). If X,Y are finite, [F3] lists the cells of Mj(X) as the cells of Y and one prism for each cell of X, a finite family. Hence the finite clause of [F5] applies and needs no choice. For arbitrary X,Y, use its [A1] clause. These are the only second-stage choices; the mapping-cylinder construction itself was specified without choices.

F3F5A1step 2.1
4.1

Put h=ρk:YX. The homotopy (x,t)ρD(j(x),t) starts at ρj=idX and ends at ρkrj=ρkg=hg. The homotopy (y,t)rK(k(y),t) starts at rk=idY and ends at rjρk=gh. Thus hgidX and ghidY, with continuous homotopies supplied by these formulas. By [F6], h is a homotopy inverse of g.

F6step 2.1step 3.1
5.1

Composing E with h on the left and right gives hfhg and fhgh. Concatenating with the reversals of the two homotopies in step 4.1 yields hfidX and fhidY. This proves that the original f, rather than just its cellular replacement, is a homotopy equivalence. No based inverse is asserted for an arbitrary unbased map.

F6step 1.1step 4.1
6.1

If X is empty, weak equivalence forces Y empty by the component condition; the unique maps give the conclusion. Zero relative cells in step 3.1 give the stationary compression, and zero-dimensional cells and coincident endpoint images are covered by the cylinder construction. Neither disconnectedness nor unbounded dimension is excluded: [F1], [F4] and [F5] use every source point and the component bijection. The finite case uses only the finite clauses in steps 1.1 and 3.1. In the arbitrary case AC selects the disk deformations for cellular approximation and the compression witnesses for the source retraction, exactly as accounted for in those two suppliers. The explicit compositions in steps 4.1–5.1 introduce no further choice and check both inverse identities.

F1F3F4F5A1step 1.1step 3.1step 4.1step 5.1

Depends on

Used by

Dependency tree · two levels

31 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