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.
Real singular chain complex
Definition
For every topological space , use Continuous singular simplex and real singular chain group and the real-linear instance of The singular boundary operator: Each sum is finite. The real singular chain complex is with these differentials. In degree one, a path has boundary .
For completeness, if , in the expansion of , a pair of omitted vertices occurs as and . The affine maps insert zeros at the same two positions and leave all other coordinates in order, so they are equal. Their coefficients and cancel. Every term belongs to exactly one such pair. Thus on every generator and hence on every finite chain. For the composite is zero because ; all lower groups or maps are zero. This verifies well-definedness as an unaugmented chain complex directly.
Repeated or constant faces are counted with their signed multiplicities; no nondegeneracy assumption is imposed. For a point the boundary coefficient is , equal to for positive even and for odd , while . For the empty space the entire complex is zero. No choice is used.
Depends on
Used by
- Real singular cochain complex Definition
- Smooth singular chain and cochain complexes Definition
- The singular boundary of a simplex is the unsigned sum of its faces False statement
- Singular chains are covariantly functorial Proposition
- Hom of homology is not the definition of singular cohomology Remark
- Short exact two open cover small singular chain sequence Theorem
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
- DG-16 design; Hatcher/Park control (standard reference, not scraped)