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 retract induces an injection on fundamental groups, and a deformation retract induces an isomorphism
Statement
Let , let be the inclusion, and choose . If is a retract of (Retractions and deformation retracts, with a deformation retraction required to fix the retract pointwise), then
is injective. If is a deformation retract of , the inclusion and retraction induce mutually inverse fundamental-group isomorphisms at every basepoint of .
Facts & Assumptions
Given: A subspace , its inclusion , a basepoint , and a retraction ; in the second clause, a deformation retraction from onto .
A continuous map is a retraction when ; for a deformation retract, is homotopic to through a homotopy that fixes every point of (Retractions and deformation retracts, with a deformation retraction required to fix the retract pointwise).
For pointed continuous maps, and ; pointed-homotopic maps induce the same homomorphism on fundamental groups (Induced fundamental-group maps are well defined, functorial and invariant under based homotopy).
Proof
Since , both and are pointed, and .
Functoriality gives , so has a left inverse and is injective.
If is a deformation retract, the homotopy from to fixes , so [L1] also gives ; hence and are mutually inverse isomorphisms.
Depends on
Used by
Dependency tree · two levels
10 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
- Allen Hatcher, Algebraic Topology, Proposition 1.17 (standard reference, not scraped)