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 path factorization
Statement
Every continuous factors as , where is a homotopy equivalence and is a Hurewicz fibration. This holds for all ordinary spaces and, with the specified kified constructions, in CGWH. No surjectivity onto components disjoint from is asserted. The result is choice-free.
Facts & Assumptions
, , and are the continuous mapping-path maps. Mapping path space replacement of a map
Hurewicz HLP means a jointly continuous lift with its exact initial map. Hurewicz and serre fibrations
Interval evaluation and transposition preserve continuity, ordinarily and after the stated kification. Interval exponential law and quotient homotopies
Continuous maps agreeing on a finite closed cover paste continuously. Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous
Proof
Given: The map and F1 constructions; for HLP, initial map , , and with .
Direct evaluation gives and . The formula is continuous by F3 applied to its adjoint. It remains in because its path starts at , begins at and ends at . It fixes every constant path. Thus and are homotopy inverses, even with a strong deformation retraction onto .
For the given HLP problem define by if , and if . Both domains are closed and cover . At their intersection the values are , so F3–F4 prove the joint continuity of the adjoint. All arguments of lie in . In particular no division by occurs at .
Transpose step 1.2 and put . The path begins at , so this lands continuously in . At it is exactly , and , including by compatibility. Hence F2 holds for every parameter space, and the same adjoint formulas establish the CG version.
Empty makes all initial-map test domains empty. A one-point gives the usual based path space; a one-point reduces the deformation to the identity of . Both deformation endpoints and both path endpoints were checked above. Existence of a path in forces its final point into a component meeting , explaining the absence of a surjectivity claim. Every operation was a formula, not a path selection. Together steps 1.1 and 2.1 establish the factorization.
Depends on
Used by
Dependency tree · two levels
16 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)
- Hatcher, Algebraic Topology (standard reference, not scraped)