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.
Singular cohomology of a point from the cochain complex
Example
For the one-point space , the unnormalized real singular cochain complex is in degrees starting at zero. Thus and for .
Facts & Assumptions
Given: The specified one-point space.
Real singular cohomology is kernel modulo image of the signed-boundary dual differential (Real singular cohomology).
Proof
There is exactly one simplex in each nonnegative degree, so and its real dual is by evaluation on . For all faces equal , hence . Pairing consecutive signs gives scalar zero for odd and one for even . The degree-zero boundary is zero by convention.
Thus is zero for even and identity for odd . In degree zero, kernel is and the image from degree minus one is zero. In positive even degree, kernel is and the previous differential is identity, so the quotient is zero. In odd degree, kernel is zero and the previous image is zero, again giving zero. Negative cochain groups and cohomology are zero. This proves all claimed values by the actual quotient definition.
All higher point simplices are degenerate but were retained; discarding them without changing complexes would not be the calculation above. In particular the sole edge has boundary and the sole triangle has boundary . The zero vector is the unique class in every positive group. For comparison the empty space has no basis simplices, hence zero in all cochain and cohomology degrees. These canonical identifications use no choice.
Depends on
Used by
Nothing in the library uses this result yet.
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)