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.
Oriented simplicial subdivision commutes with boundary
Statement
The oriented subdivision operator on integral augmented chains satisfies . Restriction to ordinary chains is also a chain map.
Source locators
2.1, pp.121–122.
Facts & Assumptions
Subdivision is given by the augmented cone recursion. Oriented simplicial subdivision operator.
The cone on the maximal face satisfies the contraction identity. An augmented simplicial cone has an explicit chain contraction.
The simplicial boundary squares to zero. The simplicial boundary squares to zero.
Proof
Given: The augmented recursion and .
For a vertex , . The degree equation is zero on each side. On an edge , the formula is , abbreviating singleton face labels by their vertices and by . Its boundary is .
Assume boundary compatibility through degree . In the cone the contraction identity gives . For the augmented boundary square at a one-simplex, ; in higher degrees use the boundary-square theorem. Induction proves the identity in every degree. Geometrically the cone terms on boundary-of-boundary faces cancel, exactly accounting for internal faces. Setting the degree-zero ordinary boundary to zero preserves the identity on ordinary chains.
Depends on
Used by
Dependency tree · two levels
10 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)