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.
Barycentric subdivision is a chain map
Statement
For every singular chain , .
Facts & Assumptions
Given: The recursively defined subdivision operator .
Proof
In degree , both sides vanish. Assume on dimensions below , where .
Let be the identity simplex of and put , the affine lift used in the definition of . If , then , so its augmentation is zero. The degree-zero cone formula gives .
If , the induction hypothesis applied in gives by The singular boundary squares to zero. The positive-degree cone formula therefore gives . The last equality follows directly from the recursive definition: subdivision commutes with postcomposition by on each affine face.
Linearity extends these equalities to finite chains, completing the induction.
Depends on
Used by
Dependency tree · two levels
6 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, Proposition 2.21 (standard reference, not scraped)