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 simplicial-to-singular chain map commutes with boundaries
Statement
For every simplicial complex equipped with a total order on its vertices and every , In degree , both boundaries are zero maps to .
Facts & Assumptions
Given: A simplicial complex with a total order on its vertices and an integer .
sends an oriented simplex to the sign of its increasing representative times the corresponding affine characteristic singular simplex (The degreewise simplicial-to-singular homomorphisms).
The singular boundary is the alternating sum of affine face restrictions (The singular boundary operator).
The simplicial boundary is the alternating sum of the oriented codimension-one faces (Simplicial chain groups and the boundary operator).
Proof
If , then both and are zero maps in degree , so the degree-zero claim is immediate.
Assume and let be the increasing representative of an oriented simplex of . By [L1], the singular chain is the affine characteristic simplex . Restricting along the face map therefore produces the affine characteristic simplex of the face , listed in the induced increasing order.
Applying [L2] and [L3] to step 1.2 gives for the increasing representative. The same overall orientation sign from [L1] multiplies both sides for an arbitrary oriented simplex , so the identity holds on every generator and hence on all simplicial chains by linearity; step 1.1 handles degree .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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)