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.
The singular chain homotopy formula
Statement
Let be a homotopy from to . Then the prism operator of The prism operator of a homotopy satisfies as homomorphisms for every and every abelian group . In degree , the same identity reduces to
Facts & Assumptions
Given: A homotopy from to , an abelian group , and an integer .
The prism operator is on a singular -simplex (The prism operator of a homotopy).
The prism chain has boundary (The prism triangulation has the stated oriented boundary).
The induced singular map of a continuous map is obtained by postcomposition on singular simplices (The induced singular chain map of a continuous map).
The singular boundary is the alternating sum of affine face restrictions (The singular boundary operator).
Proof
If and is a singular -simplex, then [L2] gives . Composing with and using [L1] and [L3] yields
Assume and let be a singular -simplex. Compose the boundary formula [L2] with the continuous map By [L1] and [L3], the image of is , the image of is , and the image of is .
Again using [L1], [L3], and [L4], the image of the side-prism term under is exactly . Therefore step 1.2 becomes or equivalently
Singular simplices generate , and the coefficient- version is obtained by tensor extension, so step 2.1 holds on all chains for every , while step 1.1 handles degree . Hence the stated identities hold in all degrees.
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
- Allen Hatcher, Algebraic Topology (standard reference, not scraped)
- Haynes Miller, Algebraic Topology I, Lecture 6 (standard reference, not scraped)