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 cohomology
Definition
For the complex in Real singular cochain complex, define the real vector spaces The square-zero identity puts inside , so the quotient is well-defined. This is the vector-space instance of Cohomology object of a cochain complex. A cocycle has , and a coboundary is . Two cocycles determine the same class if and only if their difference is a coboundary. Addition and scalar multiplication are induced by those of cocycles; changing representatives adds a coboundary since is a vector subspace.
Negative cohomology groups are zero. At degree zero there are no incoming coboundaries: is the space of point functions taking equal values on the endpoints of every path. For the empty space every group is zero; for a point the alternating differential calculated in the preceding definition gives and for .
This definition uses the cochain quotient, without choosing representatives or identifying it with a dual homology space. It requires no AC.
Depends on
Used by
- Singular cohomology is homotopy invariant Corollary
- Restriction from continuous to smooth singular cochains Definition
- Singular cohomology of a point from the cochain complex Example
- De rham and singular cohomology respect countable disjoint unions Lemma
- Hom of homology is not the definition of singular cohomology Remark
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
- DG-16 design; Hatcher/Park control (standard reference, not scraped)