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.
Simple homotopy equivalence
Definition
Let and be finite CW complexes. A map is a simple homotopy equivalence if it is homotopic to a finite composite of maps between finite CW complexes in which each is either an elementary expansion inclusion, an elementary collapse map (Elementary expansions and collapses of finite CW complexes), or a cellular isomorphism. A cellular isomorphism here means a homeomorphism that carries the cell structure of its source isomorphically onto the cell structure of its target, so that it restricts to a homeomorphism between the interiors of corresponding cells; a general homeomorphism is not included by definition.
For a formal collapse , an elementary collapse map means any retraction of its expansion inclusion . Such maps exist: the characteristic ball strongly deformation retracts onto the complementary boundary disk, fixing that disk pointwise. This deformation descends through the attaching identifications to a strong deformation retraction of onto . If is its endpoint and is any retraction, composing this deformation with gives relative to . Thus and .
Every such composite is a homotopy equivalence (Homotopy equivalences, homotopy inverses and spaces of the same homotopy type): an expansion inclusion and its collapse map are homotopy inverses, and a cellular isomorphism is a homeomorphism. Consequently every simple homotopy equivalence is a homotopy equivalence.
For disconnected complexes the sequence respects the induced bijection on components: each operation is performed componentwise, and the composite maps the components of bijectively onto those of . The empty complex is allowed; the empty sequence exhibits the identity of a finite CW complex as a simple homotopy equivalence.
Homotopy of maps is transitive, so any map homotopic to a simple homotopy equivalence is again a simple homotopy equivalence. Concatenating two finite composites exhibits a composite of two simple homotopy equivalences as a simple homotopy equivalence as well.
Depends on
Used by
Dependency tree · two levels
9 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
- Lück, Definition 2.17, pp.34–35 (standard reference, not scraped)