Alphabeta Math
LemmaStatement: 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.

Vanishing relative homotopy extends an inverse over cells

Statement

Let i:XZ be the inclusion of a CW subcomplex, with supplied characteristic maps. Suppose π0(X)π0(Z) is bijective and πn(Z,X,x) is the one-element pointed set or trivial group for every xX and every n1. If ZX has finitely many cells, there are, without any choice principle, a continuous map r:ZX and a homotopy H:Z×IZ with ri=idX,H(z,0)=z,H(z,1)=i(r(z)),H(i(x),t)=i(x). Assuming the Axiom of Choice, the same conclusion holds for an arbitrary set of cells and unbounded dimension. Thus the conclusion is a deformation retraction fixing the whole subcomplex throughout.

Facts & Assumptions

[F1]

Relative cubical disk model and compression says that a relative disk is null precisely when it compresses into the subspace by a homotopy fixing its entire boundary, including in degree one.

[F2]

Relative CW inclusions are cofibrations gives the homotopy extension property for any CW subcomplex, without assuming a choice principle.

[F3]

Skeleta, CW subcomplexes, and relative CW complexes and CW complex with closure finiteness and weak topology give the subcomplexes, attachment quotients and weak topology on closed cells.

[F4]

The exponential law: for a locally compact metric X and any spaces Z and Y, transposition is a bijection between C(X×Z,Y) and C(Z,C(X,Y)) with the compact-open topology transposes homotopies with the ordinary interval factor to continuous maps into C(I,Z). The characteristic-disk quotient and weak-topology argument in the proof of [F2] therefore tests a CW-domain homotopy on all its characteristic disk cylinders.

[F5]

Every natural-number-indexed list of nonempty sets has a choice function on its family of values supplies a selection from a finite family of nonempty witness sets in ZF. The recursion theorem iterates a specified successor function on a set.

[A1]

The Axiom of Choice is assumed only in the arbitrary-cell clause, to choose compressions, paths and HEP extensions from the sets of all such problems described below.

Proof

Given: The CW pair (Z,X) and the relative vanishing and component hypotheses. Put Dn=XZn and D1=X.

1.1

For a map u:(Dn,Sn1)(Z,X) with n1, use the fixed marked boundary point b=(1,0,,0) and the actual point x=u(b). It is a disk representative of a relative class based at x. The hypothesis at this very basepoint and [F1] give a homotopy from u into X fixing all of Sn1. No constant-boundary assumption and no choice of transport paths are needed. For n=1 the same statement fixes both endpoints, even if they were initially different points of X. For n=0, a disk is a point z of Z; surjectivity on path components supplies a path from z to some point of X, which is exactly its required compression. Only surjectivity, rather than injectivity, on components is needed in this construction.

F1given
1.2

The continuity test to be used is valid for arbitrary cell sets. If a function K:W×IZ, with W a CW complex, is continuous on every characteristic disk cylinder, each track is continuous and its transpose K^:WC(I,Z) is defined. By [F4], its composite with each characteristic map is continuous. A characteristic map is quotient onto its closed cell: by [F3] it is surjective there, and its compact disk domain and Hausdorff CW target make it a closed map. Thus K^ is continuous on every closed cell. The weak topology [F3] makes the inverse image of each closed subset of C(I,Z) closed in W, so K^ is continuous. Untransposing gives continuity of K in the ordinary product topology. This also applies to the subcomplexes Dn, even when X has cells in unbounded dimensions.

F3F4
2.1

Start with f1=idZ. Suppose fn1:ZZ fixes X and sends Dn1 into X. For every relative n-cell with characteristic map χe, its composite fn1χe satisfies the disk problem of step 1.1: the attaching boundary lies in Dn1. Use a supplied witness compression for each such cell. Together with the stationary homotopy on Dn1, these maps agree on every boundary identification and give a homotopy Ln:Dn×IZ. On each new characteristic disk it is its chosen compression, and on all closed cells of X or of lower dimension it is stationary. Step 1.2 proves continuity. Its final image lies in X. Apply [F2] to (Z,Dn) to extend it to Kn:Z×IZ starting at fn1, and put fn=Kn(,1). This fixes Dn1 throughout Kn, and fn(Dn)X. In particular every map and homotopy still fixes X pointwise.

F2F3step 1.1step 1.2
3.1

If there are no relative cells, take r=idX and the constant homotopy. Otherwise finitely many relative cells have a maximum dimension N. For each of the finitely many stages 0,,N, enumerate the finite cell set at that stage and apply the finite clause of [F5] to its nonempty compression sets and to the nonempty set of HEP extensions supplied by [F2]. This is a finite sequence of existential choices, not a chosen infinite sequence, and remains valid even if X itself is infinite. Concatenate K0,,KN on successive equal subintervals. Finite pasting gives a homotopy from the identity to fN fixed on X, and fN(Z)=fN(DN)X.

F2F5step 2.1
3.2

For an arbitrary cell set assume [A1]. Form the set of all problems (n,u) of step 1.1, with n1 and u:(Dn,Sn1)(Z,X), together with the point problems (0,z) for zZ. These form a set because their functions are subsets of fixed domain-target products, followed by a union over nN. Each problem has a nonempty set of continuous compression homotopies, or of paths in the point case. Form also the set of all HEP problems that can arise in step 2.1; their initial maps, prescribed subcomplex homotopies and candidate extensions are subsets of fixed products formed from Z, I and Z, and [F2] makes every candidate-extension set nonempty. AC supplies choice functions for both families. Use those same functions on fn1χe and on the resulting HEP problem at every stage of step 2.1. This specifies the successor on the set of finite histories of maps and homotopies on the fixed spaces. Recursion [F5] gives all fn,Kn. This is the exact choice use: no additional countable selection of stage witnesses is left implicit.

A1F2F5step 1.1step 2.1
4.1

In the arbitrary-cell case run Kn on [12n,12(n+1)] by linear time rescaling. The successive endpoints agree. If zZd, all stages with n>d fix z, since zDn1. Define f(z)=fd(z) and set H(z,1)=f(z). Compatibility makes these values independent of a larger choice of d. On any characteristic d-disk, H is a concatenation of the finitely many restrictions through stage d, followed by the stationary endpoint for the rest of the interval. It is therefore continuous on that whole disk cylinder, including at time one. Step 1.2 gives continuity on Z×I. It fixes X, starts at the identity and ends with image in X.

step 1.2step 2.1step 3.2
5.1

In either case write f for the final map into Z, whose image is contained in X, and let r be the same function with codomain X. It is continuous for the subspace topology: for V=XU with U open in Z, one has r1(V)=f1(U). Since the homotopy fixes X, ri=idX and its endpoint is ir. These are exactly the four required identities. If X is empty, the component hypothesis forces Z empty and the unique empty maps satisfy them. If X=Z, including a singleton, the constant construction applies. Relative zero-cells use actual connecting paths, degree-one cells use both fixed endpoints, and higher cells require no regularity of their attaching maps. The finite branch remains choice-free; the arbitrary branch uses AC exactly in step 3.2, with the accumulating-time endpoint verified in step 4.1.

step 1.1step 3.1step 4.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