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.
De rham cohomology of a finite disjoint union is the direct sum
Statement
For a finite disjoint union , restrictions give .
Facts & Assumptions
Given: A finite family of smooth manifolds and any integer .
De rham cohomology: The real de Rham cohomology is , with as in def-closed-and-exact-differential-forms. This is def-cohomology-object-of-a-cochain-complex in real vector spaces. Only a closed form represents a class . For closed forms , equality means precisely for some -form . Addition and real scalar multiplication are induced by those of forms. All groups on the empty manifold are zero.
Proof
A form on is uniquely a tuple of forms on the open components : define its value componentwise, which is smooth locally. Its derivative is componentwise too, so . A tuple of exact forms has a tuple of primitives, obtained by finite choice, so .
The resulting map on quotient classes is onto, since a finite tuple of classes has a finite tuple of closed representatives. Its kernel consists precisely of tuples with all entries exact, which step 1.1 identifies with . Thus it is an isomorphism. For both sides are zero, and for it is the identity.
Source locator
Lee, Proposition 17.5, pp.442–443; the local statement is finite only, where products and sums coincide and all witness selection is finite.
Depends on
Used by
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
- John M. Lee, Introduction to Smooth Manifolds, second edition (standard reference, not scraped)