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.
Barycenter and affine cone
Definition
Let be an abelian group and . The barycenter of the ordered standard -simplex is . An affine singular -simplex in is determined by its ordered vertices ; write it as . Define its affine cone by and extend by tensoring with to finite affine chains. The apex is the first vertex. Repeated vertices are allowed and remain singular simplices; no quotient by degenerate simplices is being taken.
For a singular simplex and a supplied affine chain in , define the affine cone along by Here means composition of each affine simplex with , with its coefficient unchanged. The lift , not just its image chain in , is part of the input. It may lie anywhere in the convex simplex, including its boundary. In the recursive notation , the supplied lift is the chain in , where is the identity simplex.
With the ordinary boundary of The singular boundary operator, the orientation formulas are, for , and for , where . The first formula follows by deleting the first cone vertex and then the successive base vertices with alternating signs; the second follows from . Thus in degree zero the formula without the extra term holds only when the total coefficient is zero. In particular it applies to the subdivided boundary of a -simplex, whose endpoint coefficients sum to zero. These formulas do not change the library's ordinary degree-zero boundary or its reduced-homology convention.
Depends on
Used by
- Barycentric subdivision operator Definition
- Subdivision prism homotopy Definition
- Barycentric subdivision is a chain map Theorem
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, Proposition 2.21 (standard reference, not scraped)