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 singular coboundary squares to zero
Statement
For every space , abelian group and integer , the singular coboundary satisfies .
Facts & Assumptions
Singular cochain complex with coefficients defines for , with zero cochain groups and zero coboundaries in negative degrees.
The singular boundary squares to zero gives for , including the low-degree boundary convention.
Proof
Given: as in the statement.
If , let and . Associativity of composition and [F1]–[F2] give This holds for every chain, hence the cochain is zero, for every . It includes , where the boundary composite is .
If , the domain is zero and by [F1], so the composite is zero. In particular has zero first map even though the later groups may be nonzero. For empty or all groups are zero and both calculations remain valid.
Steps 1.1 and 1.2 cover every integer . Thus the graded cochains and coboundary form a complex, with no topological restrictions on or freeness/injectivity restriction on . A point still has singular simplices in every nonnegative degree; step 1.1 applies to that unnormalized complex without discarding them. No representatives, bases or primitives were selected, so no AC is used.
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
- Hatcher, section 3.1, printed pages 197–198 (standard reference, not scraped)