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 prism triangulation has the stated oriented boundary
Statement
Fix . Let be the bottom and top inclusions, . Let with the simplices from The prism operator of a homotopy. Then where the last sum is omitted when .
Facts & Assumptions
Given: An integer .
The prism simplices are the simplices of the standard triangulation of (The prism operator of a homotopy).
The singular boundary is the alternating sum of the codimension-one faces (The singular boundary operator).
Proof
If , then is the oriented edge from to , so [L2] gives . This is exactly the displayed formula with no side-prism sum.
Assume . By [L2], each is the alternating sum of its codimension-one faces. The face opposite in is the top face , and the face opposite in is the bottom face . For each , the face of opposite is the same -simplex as the face of opposite , so these interior faces occur twice in with opposite total signs and cancel.
The remaining uncancelled faces are the top face from , the bottom face from , and the side faces obtained by deleting one vertex of . For each fixed , those side faces are exactly the prism simplices in the standard triangulation of , and comparing the induced vertex order with the definition of gives the total contribution . Summing over and combining with steps 1.1 and 1.2 yields the stated boundary formula.
Depends on
Used by
Dependency tree · two levels
5 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)