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.
Mapping cylinder factorization
Statement
For a continuous map of CGWH spaces, through its mapping cylinder, j is an unbased cofibration, and the included Y is a strong deformation retract of . The construction is natural for strictly commuting squares. The corresponding based constructions hold for reduced mapping cylinders; the based inclusion at the base of the reduced cone is a based cofibration.
Facts & Assumptions
The cylinder identifies (x,0) with f(x) and its free end is j(x)=[x,1]. Mapping cylinder and mapping cone
The cylinder and closed-end quotient constructions are CGWH. Compact generation preserves the cylinder and closed pushouts
Products of quotient maps with I are quotient. Interval exponential law and quotient homotopies
Continuous functions on a finite closed cover paste. Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous
A strong deformation retract keeps the retracted subspace fixed throughout the deformation. Retractions and deformation retracts, with a deformation retraction required to fix the retract pointwise
Proof
Given: The spaces, maps, and hypotheses in the statement above.
F2 makes the cylinder CGWH and its free end a closed embedded copy of X. By the defining formulas, . Define and . At s=0 both clauses have value f(x); F3 makes the induced homotopy continuous. It starts at the identity, ends at the inclusion followed by r, and fixes Y at every time. This is the claimed strong deformation retraction by F5.
Given initial data and a homotopy with , prescribe data on the bottom and two vertical sides of the square with coordinates : on t=0, on s=1, and on s=0. The corner values agree. Keep a(y) constant on Y. Put and . The denominator is at least 1/2. If its first term is maximal the second output is zero; otherwise the first output is 0 or 1. Both coordinates lie in I, and on the three designated sides λ=1. Thus R is a continuous retraction onto those sides.
Compose the pasted side data with R. This gives a continuous extension on ; its value at s=0 is always a(f(x)). Together with the constant homotopy on Y, F3 descends it to . It restricts to a initially and to b on the free end, proving HEP. If a commuting square is , the map , respects the attaching relation and all displayed height formulas. This proves naturality of the factorization and deformation.
For based data the values on the basepoint track are constant, so the same formulas descend after collapsing that track. Interchange the two vertical sides in step 1.2 to extend a prescribed homotopy at the base s=0 of the reduced cone, keeping the tip s=1 constant. Descent then proves the based cone-base cofibration as well. Empty X gives the unchanged space Y and an empty free-end inclusion.
Depends on
- Mapping cylinder and mapping cone
- Cofibrations are characterized by a retraction of the mapping cylinder strip
- Interval exponential law and quotient homotopies
- Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous
- Retractions and deformation retracts, with a deformation retraction required to fix the retract pointwise
- Compact generation preserves the cylinder and closed pushouts
Used by
- N connected space and n connected map Definition
Dependency tree · two levels
19 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
- May, A Concise Course in Algebraic Topology (standard reference, not scraped)