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.
Finite relative homotopy lifting across a weak equivalence
Statement
Let be a weak homotopy equivalence of arbitrary spaces, and let be a CW pair with finitely many cells outside . Given continuous maps , and a homotopy with and , there are a continuous map extending and a homotopy such that In particular, if and is constant in time, then rel . More generally is stationary at every point of at which is stationary. No choice principle is required; may have arbitrary size and dimension.
Facts & Assumptions
Weak homotopy equivalence gives all-basepoint weak equivalence. A weak equivalence has vanishing mapping-cylinder relative groups supplies component bijectivity and relative triviality for its ordinary mapping-cylinder source inclusion. That item's proof also establishes the embedded endpoints, retraction and continuous height deformation for arbitrary spaces.
Relative cubical disk model and compression compresses a null relative disk into the subspace while fixing its entire boundary, in every positive degree including one.
Relative CW inclusions are cofibrations gives the choice-free HEP for every CW subcomplex, with arbitrary target.
Skeleta, CW subcomplexes, and relative CW complexes gives the subcomplexes and their attachment structure. Interval exponential law and quotient homotopies says that an attachment quotient remains quotient after product with . Every natural-number-indexed list of nonempty sets has a choice function on its family of values permits finitely many witness selections without AC.
Proof
Given: The spaces and maps in the statement. Write , with , and , so and .
The ordinary cylinder formulas and embeddings in [F1] are valid without separation assumptions. On define a homotopy starting at by At the two values are , so finite closed pasting gives continuity. At , its value is . By [F3], extend from to a homotopy starting at . Put , so . Projection by on gives the precise formula .
We compress this into rel using only finitely many source-cell choices. Write , with . Suppose a current map equals on and takes into . For a relative -cell, its characteristic disk followed by has boundary in . If , mark a fixed boundary point and use its actual image as basepoint. The relative class is null by [F1], so [F2] gives a compression into fixing all boundary points. If , the component-surjectivity of in [F1] gives a path from the image of that vertex into . There are only finitely many relative cells in this dimension, so [F4] supplies their finitely many compression witnesses.
Glue these disk homotopies to the stationary homotopy on . They agree on every attaching identification, because disk boundaries were fixed. By [F4], is the quotient of and the finitely many characteristic -disks by their boundary identifications, and the product of this quotient with is again quotient. The compatible continuous homotopies on those pieces therefore descend to a continuous homotopy on , even with an infinite-dimensional . Extend it to by [F3] for . Its endpoint sends into and retains on . Starting from , perform these stages through the maximum dimension of the finite set of relative cells. The HEP is specified without choices, and the remaining witness selections are a finite sequence. Concatenation gives a continuous from to a map into , fixed on . If there are no relative cells, take constant. Its endpoint factors continuously through the embedded subspace by [F1]; denote the resulting map by . It satisfies .
Concatenate and on the two half-intervals and compose with : The seam is , the initial value is and the final value is . On , step 1.1 gives for the first half; on the second half is constantly , and its projection is . Hence the displayed formula holds for all . In particular any stationary track stays stationary, and strict commuting data yield the rel- conclusion.
If is empty, weak equivalence forces empty. Existence of then forces and empty, and the unique maps satisfy the result. Empty otherwise imposes no boundary condition; zero relative cells give and the same reparametrized . A zero-cell uses a path, and a one-cell compression fixes its two possibly distinct endpoints by [F2]. No choice is made on all of : its homotopy is prescribed as data, and only the finitely many cells outside it request witnesses. The formula in step 4.1 checks , so the plateau in is intentional and no claim of extending the original time parametrization is made. This proves every assertion choice-free.
Depends on
- Weak homotopy equivalence
- A weak equivalence has vanishing mapping-cylinder relative groups
- Relative cubical disk model and compression
- Relative CW inclusions are cofibrations
- Skeleta, CW subcomplexes, and relative CW complexes
- Interval exponential law and quotient homotopies
- Every natural-number-indexed list of nonempty sets has a choice function on its family of values
Used by
Dependency tree · two levels
38 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.