Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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 s:Ωk(U)Ωk(V)Ωk(UV) is surjective in every degree.

Facts & Assumptions

Given: An open cover M=UV, a smooth form ω on UV, and countable choice.

[F1]

Two open set de rham mayer vietoris cochain maps: For an open cover M=UV, put W=UV. The two-open-set de Rham maps are r:Ω(M)Ω(U)Ω(V), rω=(ωU,ωV), and s:Ω(U)Ω(V)Ω(W), s(α,β)=βWαW. 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 dr=rd and ds=sd. 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.

[F2]

Smooth partitions of unity exist on manifolds: Every open cover of a smooth manifold admits a smooth partition of unity subordinate to it.

[F3]

The Axiom of Countable Choice (ACω): The Axiom of Countable Choice, written ACω, is the following statement. > For every family (Xn)nN of nonempty sets indexed by > N there is a function f with domain N such that > f(n)Xn for every nN. Equivalently, in the vocabulary of def-choice-function: every at most countable family of nonempty sets (def-countable) has a choice function.

Proof

technique · direct
1.1

The partition construction supplies a locally finite family (ϕi) with nonnegative smooth terms summing to one and each closed support contained in U or V. Its countable-choice implementation uses all admissible coordinate-ball tuples; a fixed countable basis and countable choice select covering tuple representatives. For unions Hr of their first r compact closures, take least larger indices giving HrintHr. For the resulting exhaustion Km, the compact annulus KmintKm1 has a finite covering list of nested chart pairs inside selected balls and inside intKm+1Km2. 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 (ϕi). All eligible tuples are formed before selection; least-index recursion uses no dependent choice.

F2F3given
2.1

Assign i to U if suppϕiU, and to V otherwise. Set ρU=i assigned to Uϕi and ρV=i assigned to Vϕi. 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 suppρUU and suppρVV.

step 1.1
3.1

Define α=ρVω on UV and zero on UsuppρV. These two open sets cover U, and the expressions agree where they overlap; hence α is a smooth form on U. Similarly β=ρUω on the overlap and zero on VsuppρU is smooth on V. On the overlap, βα=(ρU+ρV)ω=ω, proving surjectivity. Empty overlap or out-of-range degree has only ω=0, lifted by (0,0); empty M uses the empty family.

F1step 2.1

Source locator

Lee, Theorem 17.20, pp.449–450, and its full proof pp.462–463. This page reverses Lee’s difference convention consistently: s(α,β)=βα.

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