Alphabeta Math
LemmaStatement: 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 and smooth singular Mayer–Vietoris diagram commutes away from connectors

Statement

Assume ACω. For an ordered two-open cover M=U∪V of a smooth manifold, possibly with boundary, the restriction and difference squares between the de Rham and smooth singular Mayer–Vietoris sequences commute with integration. Both difference maps use the order V−U. Thus, writing W=U∩V, (IU⊕IV)rdR=r∞IM,IWsdR=s∞(IU⊕IV) on cohomology in every degree. The displayed compatibility calculations themselves are choice-free; the assumption supplies the form exact sequence. The connector square is proved separately.

Facts & Assumptions

[F1]

Naturality of the de Rham map gives integration compatibility with restriction along any smooth open inclusion, already on cochains, and real linearity.

[F2]

De Rham Mayer–Vietoris with boundary and an explicit partition lift gives the de Rham exact sequence with restrictions and V−U difference, assuming countable choice or a supplied partition.

[F3]

Smooth singular mayer vietoris sequence gives the smooth singular sequence with the same restriction and difference conventions; its first term is identified through the actual cover-small inclusion.

[F4]

The Axiom of Countable Choice (ACω) is the assumed axiom, used for the partition in [F2].

Proof

Given: The ordered cover, the stated choice assumption and a fixed degree k. Let jU:U→M, jV:V→M and ℓU:W→U, ℓV:W→V be the inclusions.

1.1F1F2F3given

For any form ω on M, [F1] applied to jU gives IU(ω∣U)=IM(ω)∣U as cochains, and application to jV gives the corresponding equality on V. Taking the ordered pair yields the restriction square. For a closed ω, passing to its classes gives the first asserted equality using [F2] and [F3].

1.2F1F2F3given

For forms α on U and β on V, naturality for ℓU,ℓV and linearity give IW(β∣W−α∣W)=IV(β)∣W−IU(α)∣W. This is exactly V−U on both rows, not its negative. For closed representatives it passes to the difference square on cohomology. Replacing either representative by an exact form changes its integration cochain by a coboundary by [F1], so the computed square is independent of representatives.

2.1F1F3step 1.1

In [F3] the identification between the first term and the small-complex cohomology is restriction along the actual inclusion of small chains. Restricting a global integration cochain to a simplex lying in U or V gives exactly its integral in that open set. Hence step 1.1 computes the stated Mayer–Vietoris arrows even under that identification; no auxiliary small-chain inverse or change of sign enters either square.

3.1F1F2F3F4step 1.1step 1.2step 2.1∎

If an open or the overlap is empty, the corresponding cochain group is zero and the formulas still hold. If U=V=M, step 1.1 is the diagonal square and step 1.2 is ordinary subtraction. In degree zero they are the two pointwise restriction/subtraction identities; degree one and top degree use the same coefficient equalities. Negative degrees are zero. Degenerate simplices are evaluated by the same integration rule. Assumption [F4] is needed only for [F2]'s partition existence, not for any computation above; with a supplied partition both exact rows and these compatibilities are choice-free.

Depends on

Dependency tree · 2 levels

Sources