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 difference map is surjective
Statement
Assume countable choice. The difference map is surjective in every degree.
Facts & Assumptions
Given: An open cover , a smooth form on , and countable choice.
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.
Smooth partitions of unity exist on manifolds: Every open cover of a smooth manifold admits a smooth partition of unity subordinate to it.
The Axiom of Countable Choice (): The Axiom of Countable Choice, written , is the following statement. > For every family of nonempty sets indexed by > there is a function with domain such that > for every . Equivalently, in the vocabulary of def-choice-function: every at most countable family of nonempty sets (def-countable) has a choice function.
Proof
The partition construction supplies a locally finite family with nonnegative smooth terms summing to one and each closed support contained in or . Its countable-choice implementation uses all admissible coordinate-ball tuples; a fixed countable basis and countable choice select covering tuple representatives. For unions of their first compact closures, take least larger indices giving . For the resulting exhaustion , the compact annulus has a finite covering list of nested chart pairs inside selected balls and inside . Countable choice selects these finite lists and their countably many bumps. The annulus separation makes their supports locally finite, and division by their positive smooth sum gives . All eligible tuples are formed before selection; least-index recursion uses no dependent choice.
Assign to if , and to otherwise. Set and . Locally these are finite smooth sums and they sum to one. Each grouped union of closed supports is closed by local finiteness and lies in its assigned open, so and .
Define on and zero on . These two open sets cover , and the expressions agree where they overlap; hence is a smooth form on . Similarly on the overlap and zero on is smooth on . On the overlap, , proving surjectivity. Empty overlap or out-of-range degree has only , lifted by ; empty uses the empty family.
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
15 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)