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 continuous singular cohomology comparison is an isomorphism on convex coordinate domains
Statement
Let be a coordinate domain diffeomorphic to a nonempty convex open subset of . Then restriction is an isomorphism. Both sides are for and zero otherwise. The same assertion holds for a convex relatively open half-space domain, using the strict target-valued smooth-simplex convention. Empty domains have zero groups and the unique comparison isomorphism.
Facts & Assumptions
Given: The convex coordinate image and its diffeomorphism with .
Ordinary real cohomology is homotopy invariant (Singular cohomology is homotopy invariant).
Smooth maps induce smooth-chain and cochain functors (Smooth singular chains and cochains are functorial for smooth maps).
Flattened smooth homotopies give strict smooth prisms with the original endpoint chain maps (Barycentric subdivision and prism preserve smooth singular chains).
Restriction is natural for smooth maps and is the identity complex map on a point (Restriction from continuous to smooth singular cochains).
Proof
If is nonempty fix one and let . Convexity makes this a homotopy in from identity to the constant map. It is smooth, also in half-space coordinates. Transporting through the coordinate diffeomorphism gives a smooth contraction of to its chosen point. This uses a single point, not a choice indexed by all domains.
By [F3], flattening time gives a smooth-chain prism from the identity to the constant-map chain operator. Dual precomposition gives the cochain homotopy equation , with . Thus on smooth cohomology the maps induced by the point inclusion and projection are inverse, since and is the contracted constant map.
On ordinary cohomology the same induce inverse maps by [F1]. The squares in [F4] commute with these point maps, and restriction on the point complex is the identity. Therefore is an isomorphism. On a point the unnormalized cochain differential is zero in even degree and identity in odd degree, so its cohomology is only in degree zero. This gives the asserted groups for .
If is empty all complexes and maps are zero. When the nonempty convex domain is one point and the same identity applies. Constant and degenerate simplices are retained throughout; step 2.1 uses the full signed prism, not a normalized quotient. In half-space charts raw time could leave the target beyond an endpoint, which is exactly why step 2.1 uses the flattened target-valued prism. Negative degrees vanish, and no AC is used.
Depends on
Used by
Dependency tree · two levels
13 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)