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.
A weak equivalence has vanishing mapping-cylinder relative groups
Statement
Let be a continuous map of arbitrary topological spaces. Give its ordinary quotient topology, and put . Identify with this embedded copy. Then is a weak homotopy equivalence if and only if is bijective and is trivial for every and every . Here relative degree one is a one-element pointed set, not a group. No CW, separation or choice hypothesis is required for this criterion.
Facts & Assumptions
Weak homotopy equivalence specifies bijectivity on components and group isomorphisms at all source basepoints.
Long exact sequence of relative homotopy groups gives exactness for arbitrary based pairs, including the pointed-set tail, with no assertion of terminal component surjectivity.
Interval exponential law and quotient homotopies says that an arbitrary quotient map times the ordinary interval is quotient.
Higher homotopy groups are functorial and based homotopy invariant gives induced homomorphisms and equality for based homotopies.
Higher homotopy basepoint transport and moving homotopies gives the isomorphism and the identity for a homotopy from to with basepoint track .
For a quotient map , a map out of is continuous iff its composite with is; a continuous map on constant on the fibres of factors uniquely through ; and a composite of quotient maps is a quotient map gives continuity of maps descended through the ordinary quotient.
Proof
Given: The continuous map and the displayed ordinary quotient. Let be the other endpoint inclusion.
Both endpoint inclusions are closed embeddings, including for non-Hausdorff spaces. They are continuous injective maps. For a closed , the inverse image of under the quotient map is just , closed in the disjoint union. Thus is closed in , which proves that is a closed embedding. For closed , the inverse image of is , also closed. Thus is a closed embedding. In particular the subspace pair in the statement really uses the given topology of .
Define by and . The defining maps on the disjoint summands are continuous and respect the identifications, so [F6] makes continuous, with and . The formulas agree at the gluing end and descend continuously by [F3]. They define a homotopy from to , fixing pointwise. Each is joined by its track to , so is the identity; the other composite is the identity because is. Therefore is bijective.
Fix and put . At the basepoint the homotopy is based. Thus [F4] and show that is an isomorphism with inverse induced by . At the source endpoint , the track is , running from to . Apply [F5] to , now with domain based at : Both and the displayed are isomorphisms. Consequently is their inverse composite, and is an isomorphism for every . This uses the actual track; it does not mistake for a based inverse at .
Since , steps 1.2 and 2.1 imply that is weak precisely when is bijective on components and induces isomorphisms on all positive groups at each . Suppose first these conditions hold. For and , its boundary belongs to the kernel of . That kernel is trivial, so exactness [F2] puts in the image of . Surjectivity from then makes this image trivial by exactness at . Thus is the distinguished element. This reasoning also works for , without assuming that the relative group is abelian.
Conversely suppose the component condition and all the relative trivialities in the statement. Fix and . In the exact segment the left and right relative terms are trivial. Exactness at gives a trivial kernel, so its homomorphism is injective. Exactness at gives surjectivity, since the next map takes everything to the distinguished element. This includes , whose rightmost term is only a pointed set. Hence is an isomorphism in every positive degree. Combining with the separately assumed component bijection and steps 1.2 and 2.1 proves that is weak.
In relative degree one let be any path class from a point of to . Its boundary is a component of mapping to the component of . Injectivity of implies that this boundary is the distinguished component of . Exactness of the pointed tail [F2] puts in the image of . Surjectivity of and exactness at the latter group show that its whole image in the relative pointed set is the distinguished point. Therefore has one element. This argument uses no subtraction or group operation on that pointed set.
If is empty, and relative basepoint assertions are vacuous, but component bijectivity on either side forces empty. Thus the equivalence still holds. Equal endpoint images or a constant map cause no problem in the quotient formulas: the free end remains embedded, and the deformation fixes every point of the included target. The homotopy has exactly the stated values at and each source basepoint uses its explicitly prescribed track. All arguments are formulas, exactness or an argument at one arbitrary point/class. No selection of representatives or choice principle is used. Steps 3.1 and 4.1 prove the forward direction, and step 3.2 proves the converse.
Depends on
- Weak homotopy equivalence
- Long exact sequence of relative homotopy groups
- Interval exponential law and quotient homotopies
- Higher homotopy groups are functorial and based homotopy invariant
- Higher homotopy basepoint transport and moving homotopies
- For a quotient map $q : X \to Y$, a map out of $Y$ is continuous iff its composite with $q$ is; a continuous map on $X$ constant on the fibres of $q$ factors uniquely through $q$; and a composite of quotient maps is a quotient map
Used by
Dependency tree · two levels
25 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
- Hatcher proof of Theorem 4.5 (standard reference, not scraped)