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 punctured euclidean space
Statement
Under countable choice, has cohomology in degrees only for . For it has in degree zero only, and for all groups vanish.
Facts & Assumptions
Given: A nonnegative integer and countable choice.
De rham cohomology of spheres: Assume countable choice. For , is in degrees and zero otherwise. For it is in degree zero and zero otherwise.
De rham cohomology is smooth homotopy invariant: A smooth homotopy equivalence induces an isomorphism of de Rham graded real algebras.
De rham cohomology of a finite disjoint union is the direct sum: For a finite disjoint union , restrictions give .
Poincare lemma for differential forms on star shaped domains: Every closed smooth -form on a star-shaped open domain is exact for . For centre , one primitive is .
Proof
For , set and . Then and is a smooth homotopy from the identity to . Its scalar coefficient is strictly positive for , so it never reaches zero. Smooth homotopy invariance and the sphere computation give the groups asserted.
For , the two half-lines are star-shaped and connected, so each has only ; their finite disjoint union gives . For the punctured space is empty, all its form spaces are zero, and every cohomology group is zero.
Source locator
Lee, Corollary 17.23, p.451, with the low-dimensional cases computed explicitly.
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
- John M. Lee, Introduction to Smooth Manifolds, second edition (standard reference, not scraped)