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 the circle from mayer vietoris
Example
Under countable choice, and all other de Rham groups vanish.
Facts & Assumptions
Given: Assume countable choice. The unit circle covered by the complements of two opposite points.
Mayer vietoris sequence in de rham cohomology: Under countable choice the de Rham Mayer–Vietoris sequence is exact: , beginning with .
Zero th de rham cohomology is locally constant functions: is the algebra of locally constant real functions. For nonempty connected it is canonically .
De rham cohomology of a contractible smooth manifold: Under countable choice, a nonempty contractible smooth manifold has and vanishing positive-degree de Rham cohomology.
Verification
Stereographic projection from the omitted point makes each of diffeomorphic to . Their overlap has two open-arc components , each diffeomorphic to an open interval and hence contractible by linear contraction in that coordinate. F3 makes their positive-degree groups vanish, while F2 identifies their degree-zero groups with constants on components. Thus the initial Mayer–Vietoris segment is , where .
The kernel is and the image is the diagonal. The functional has exactly that kernel and is onto, so the cokernel is . Exactness computes both groups. Degrees above one and negative degrees have zero form spaces.
Source locator
Lee, Theorems 17.20–17.21, pp.449–451; the two-component overlap map is calculated explicitly.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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)