Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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 map is an isomorphism on a two-open union

Statement

Assume ACω. Let M=UV be an ordered two-open cover of a smooth manifold, possibly with boundary. If de Rham integration is an isomorphism in every degree on U, V and UV, then it is an isomorphism in every degree on M. A supplied subordinate smooth partition suffices in place of the choice assumption for this implication.

Facts & Assumptions

[F1]

The de Rham and smooth singular Mayer–Vietoris diagram commutes away from connectors identifies the two exact Mayer–Vietoris rows and proves commutation of the restriction and difference squares.

[F2]

The de Rham map commutes with Mayer–Vietoris connectors proves commutation of the connector square with the same signs and actual integration maps.

[F3]

The Five Lemma for modules gives a middle isomorphism in a commutative five-term diagram of exact module rows when the other four maps are isomorphisms.

[F4]

The Axiom of Countable Choice (ACω) supplies the assumption used to obtain the form partition in [F5] and [F2].

[F5]

De Rham Mayer–Vietoris with boundary and an explicit partition lift supplies the exact de Rham row under countable choice or, choice-free, from a supplied subordinate smooth partition.

[F6]

Smooth singular mayer vietoris sequence supplies the exact smooth singular row with the actual small-chain inclusion and the same sign convention, without a choice axiom.

[F7]

Naturality of the de Rham map makes integration commute on cochains with restriction along the four open inclusions and makes it real linear.

Proof

Given: The ordered cover and isomorphism hypotheses in every degree on its two opens and their intersection. Fix an integer q0 and put W=UV.

1.1

Use the five consecutive terms of the exact de Rham row [F5] and smooth singular row [F6]: Hq1(U)Hq1(V)Hq1(W)Hq(M)Hq(U)Hq(V)Hq(W). The vertical maps are integration, with the direct sum of its two component maps at the first and fourth terms. Naturality [F7] gives both restriction squares, and naturality plus linearity gives the VU difference squares; in the countable-choice branch these are also the squares recorded in [F1]. The actual-small-chain identification in [F6] does not change these equalities: restriction of a global integration cochain to a small simplex in an open set is its integral there. The connector square commutes by [F2]. These are real vector spaces, hence modules over R.

F1F2F5F6F7given
2.1

The first and fourth vertical maps are isomorphisms: the direct sum of the two hypothesized inverse integration maps is their inverse. The second and fifth vertical maps are the hypothesized isomorphisms on W in degrees q1 and q. Thus all four outside vertical maps in step 1.1 are isomorphisms. Applying [F3] proves the middle map IM:HdRq(M)Hq(M;R) is both injective and surjective.

F3step 1.1given
3.1

At q=0 the first two terms in each row are zero because the groups in degree minus one vanish; their vertical maps are the unique isomorphisms 00. The initial injections in [F5] and [F6] give exactness at the middle term, so the same five-lemma application applies. In negative degrees both groups on M are zero. This proves the conclusion in every integer degree, including q=1 and the top form degree, without assuming any higher singular group vanishes beforehand.

F3F5F6step 2.1
4.1

Empty opens or overlap produce zero terms, and U=V=M produces diagonal and difference arrows; the same exact rows and proof cover these cases, including a point or the empty manifold. No chains are normalized or simplices discarded in [F6]. Assumption [F4] is used only to obtain the partition underlying the form row and its connector. With a partition supplied, [F5] gives the exact form row and [F2] gives connector compatibility choice-free; the other squares are the direct cochain equalities from [F7]. The five-lemma argument uses the specified inverse maps and no new choice.

F2F3F4F5F6F7step 1.1step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

28 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