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.
Zero-th singular homology is free on path components
Statement
For every topological space , the free abelian group on the path components of .
Facts & Assumptions
Given: A topological space .
Singular homology in degree is , and the reduced complex uses the augmentation kernel in degree (The singular chain complex and singular homology, Augmentation at 0-simplices and reduced singular homology).
A path component is the equivalence class of the path relation (Paths, path-connected spaces and path components).
Proof
Let send each singular -simplex to the basis vector indexed by the path component of its unique image point. If is a singular -simplex, then the map is a path in from the image point of to the image point of . Hence , so kills and descends to a homomorphism
The map is surjective: if there is nothing to prove, and otherwise any finite sum is the image of the -cycle , where is any singular -simplex landing at a chosen point of .
Let be a -cycle with . For each path component that meets the finite support of , choose one base point simplex . Since , the total coefficient in each such component is zero. If and lie in the same path component, [L2] gives a path from the image point of to the image point of . Define the singular -simplex by . Then . Therefore in . Thus is injective.
Steps 2.1 and 2.2 show that is an isomorphism, so is free on the path components of .
Depends on
Used by
Dependency tree · two levels
18 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 (standard reference, not scraped)