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.
Smooth singular chain and cochain complexes
Definition
For a smooth manifold , possibly with boundary, let using Smooth singular simplex. It is the subspace of Real singular chain complex spanned by the smooth simplices, with the same signed face differential.
This is a subcomplex: an affine face map has the open inverse image containing . Composing with this affine map on that inverse image extends smoothly into . Thus every face is smooth, and the already proved signed cancellation gives on this subspace.
Define the smooth singular cochain complex by As for Real singular cochain complex, these are arbitrary real functions on the supplied smooth-simplex basis, evaluated by finite sums. Precomposition gives . Define and ; both quotients are licensed by square-zero.
Negative groups vanish and the degree-zero boundary is zero. On a point all simplices are smooth, so the complexes are the ordinary unnormalized point complexes; no constant simplices are discarded. For the empty manifold all groups are zero. The specified subspaces and duals require no choice of extensions or bases.
Depends on
Used by
- Restriction from continuous to smooth singular cochains Definition
- De rham and singular cohomology respect countable disjoint unions Lemma
- Barycentric subdivision and prism preserve smooth singular chains Proposition
- Smooth singular chains and cochains are functorial for smooth maps Proposition
- Smooth singular chains compute singular homology Theorem
- Smooth singular mayer vietoris sequence Theorem
Dependency tree · two levels
8 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)