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.
Every nonempty convex subset of is contractible
Statement
Let . Every nonempty convex subset , with its Euclidean subspace topology, is contractible. More precisely, for each the formula
is a homotopy from to the constant map at .
Facts & Assumptions
Given: A nonempty convex subset and a point .
Any two continuous maps into a nonempty convex subset of are homotopic by the straight-line formula (Any two continuous maps into a nonempty convex subset of are homotopic by straight lines).
A nonempty space is contractible exactly when its identity map is nullhomotopic (A nonempty space is contractible if and only if its identity map is nullhomotopic).
Proof
Apply [L1] to and the constant map . The resulting homotopy is .
Thus is nullhomotopic, so is contractible by [L2].
Depends on
Used by
- Every nonempty interval and every ℝⁿ with n≥1 contracts to any chosen point Example
- The homology of an interval from contractibility Example
- FALSE: homotopy-equivalent spaces must be homeomorphic False statement
- A plane domain homeomorphic to the plane or to the disc is contractible Lemma
- Circle and path-loop models for Eilenberg–Mac Lane induction Lemma
- The quaternion double cover generates the third homotopy group of SO(3) Lemma
- Every nonempty convex subset of ℝⁿ is simply connected Theorem
Dependency tree · two levels
6 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
- Algebraic Topology lecture notes (UC Riverside) (standard reference, not scraped)