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.
Singular chains are covariantly functorial
Statement
For a continuous map , postcomposition defines a real-linear chain map . These maps satisfy and , so real singular chains are covariantly functorial.
Facts & Assumptions
Given: Topological spaces and continuous maps , .
Real chains have a supplied simplex basis and signed face differential, with zero groups in negative degrees (Real singular chain complex).
The coefficient-chain functor sends to postcomposition and respects identities and composition (Singular chains and singular homology are covariantly functorial).
Proof
Define . Composites are continuous, the sum is finite, and collecting equal images preserves addition and real scalar multiplication. Under the real tensor identification this is exactly the map in [F2]. In negative degrees it is the unique map between zero spaces.
For , . Real linearity extends equality to all chains; for both composites are zero. This includes constant and degenerate simplices because the computation does not discard any face.
On every generator, and . Finite linear extension proves both laws. They also hold on zero groups, including all chains of the empty space. On a point each nonnegative chain map induced by its identity is the identity of . All maps are given by formulas on supplied generators; no AC is used.
Depends on
Used by
Dependency tree · two levels
8 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
- DG-16 design; Hatcher/Park control (standard reference, not scraped)