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.
The de rham mayer vietoris sequence is exact at the first two terms
Statement
The sequence is exact at the first two nonzero terms.
Facts & Assumptions
Given: An open cover and the maps just defined.
Two open set de rham mayer vietoris cochain maps: For an open cover , put . The two-open-set de Rham maps are , , and , . The complexes are def-de-rham-cochain-complex. Restrictions are pullbacks along open inclusions, so prop-pullback-is-a-morphism-of-de-rham-complexes gives and . Both maps are real linear. The middle differential acts componentwise. Empty opens have zero form spaces. The order second minus first fixes the sign of every connecting map below.
A smooth differential -form: Let be a smooth manifold and . A smooth differential -form on is a smooth section of . The space of such forms is denoted , and .
Proof
If , the form vanishes at each point because every point lies in or . Thus is injective. Also , so .
If , the two forms agree on the overlap. Define for and for . Agreement makes this unambiguous, and near every point it equals a smooth section, so it is smooth. Then , proving the reverse inclusion and exactness. The same definitions work for empty opens, including empty .
Source locator
Lee, Theorem 17.20, pp.449–450, and its full proof pp.462–463. This page reverses Lee’s difference convention consistently: .
Depends on
Used by
Dependency tree · two levels
6 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)