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.
Having the same homotopy type is an equivalence relation on topological spaces
Statement
The relation “has the same homotopy type as” is reflexive, symmetric and transitive on topological spaces, hence is an equivalence relation.
Facts & Assumptions
Given: Topological spaces and homotopy equivalences and with homotopy inverses and .
A homotopy equivalence has a continuous homotopy inverse whose two composites are homotopic to the appropriate identity maps (Homotopy equivalences, homotopy inverses and spaces of the same homotopy type).
Precomposition and postcomposition by continuous maps preserve homotopies (Precomposition and postcomposition by continuous maps preserve homotopies, including their relative form).
Homotopy is symmetric and transitive (Homotopy relative to a fixed subspace, and path homotopy relative to endpoints, are equivalence relations).
A relation is an equivalence relation exactly when it is reflexive, symmetric and transitive (Equivalence relation, equivalence class, and the quotient set ).
Proof
The identity is a homotopy equivalence with itself as homotopy inverse, since both composites equal, and hence are homotopic to, .
If has homotopy inverse , the same two homotopies show that has homotopy inverse . Thus the relation is symmetric.
For transitivity, the composite has candidate homotopy inverse . By [A1], and .
Similarly, gives , and then gives .
Applying [L1] to gives , and [L2] with gives .
Steps 2.1 and 1.4 make a homotopy inverse of , so the relation is transitive. With steps 1.1 and 1.2, [L3] makes it an equivalence relation.
Depends on
- Homotopy equivalences, homotopy inverses and spaces of the same homotopy type
- Precomposition and postcomposition by continuous maps preserve homotopies, including their relative form
- Homotopy relative to a fixed subspace, and path homotopy relative to endpoints, are equivalence relations
- Equivalence relation, equivalence class, and the quotient set $A/{\sim}$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
17 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
- A. Hatcher, Algebraic Topology, Section 0 (standard reference, not scraped)