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 boundary is independent of the chosen oriented representative
Statement
The formula depends only on the orientation class of the simplex, not on the chosen ordered representative.
Proof
Given: Two orderings of the same simplex that represent the same oriented simplex in the chain group.
It is enough to compare two orderings that differ by one adjacent transposition, because adjacent transpositions generate the symmetric group.
Let and . For or , deleting the th vertex from and leaves two orderings of the same face that still differ by one adjacent transposition, so the corresponding face terms differ by a minus sign. The face obtained from by deleting is exactly the face obtained from by deleting in position , and their coefficients are and . Likewise the face obtained from by deleting is the face obtained from by deleting the entry in position , again with opposite coefficients. Hence every term of is the negative of the corresponding term of , so .
Therefore equivalent oriented representatives have the same boundary value, so the boundary formula is well defined on orientation classes.
Depends on
Used by
- Induced simplicial chain maps commute with boundaries Lemma
- The simplicial boundary squares to zero Theorem
Cited to discharge well-definedness by Simplicial chain groups and the boundary operator.
Dependency tree · two levels
3 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)
- Vidit Nanda, Computational Algebraic Topology, Lecture 03: Homology (standard reference, not scraped)