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.

De Rham Mayer–Vietoris with boundary and an explicit partition lift

Statement

Assume ACω. For an ordered open cover M=UV of a smooth manifold, possibly with boundary, put W=UV and rω=(ωU,ωV),s(α,β)=βWαW. For the locally extendible de Rham complexes these maps give a short exact sequence 0Ω(M)rΩ(U)Ω(V)sΩ(W)0. It induces the de Rham Mayer–Vietoris sequence with positive lift-differential connector ΔdR:HdRk(W)HdRk+1(M) and initial term 0HdR0(M). The sequence is natural for smooth maps preserving the ordered cover. Countable choice is used only to obtain a smooth partition subordinate to U,V; with such a partition supplied, all the conclusions and the displayed connector construction are choice-free.

Facts & Assumptions

[F1]

The de Rham complex and pullback extend to manifolds with boundary supplies the complexes, their local smoothness and restriction/pullback identities at a boundary.

[F2]

Smooth partitions of unity exist on manifolds with boundary supplies a subordinate smooth partition under countable choice.

[F3]

The Axiom of Countable Choice (ACω) states the axiom ACω assumed here.

[F4]

The long exact sequence in cohomology gives the natural long exact cohomology sequence of a short exact sequence of complexes.

[F5]

Smooth partitions of unity subordinate to an open cover requires nonnegative smooth terms with closed locally finite supports inside their assigned opens and sum one.

Proof

Given: The ordered cover, with either ACω or a supplied smooth subordinate partition. Use the complexes of [F1] and the maps r,s in the statement.

1.1

Under [F3], apply [F2] to the two-member cover to obtain smooth functions ρU,ρV0 with sum one and supports contained in U,V respectively. If the construction is presented as a locally finite refinement, group a term into U whenever its closed support lies in U, and into V otherwise. A subfamily of a locally finite closed family has closed union: near any point only finitely many members meet a neighbourhood, and the finite union is closed there. Thus each grouped sum is smooth with its support still in the assigned open. This gives the asserted pair in the refinement convention as well. Countable choice is spent only in [F2]'s selection of a countable subordinate chart family, its shrinking data and bumps; none of the subsequent steps selects a partition or primitive for each form.

F2F3F5given
1.2

Restriction commutes with d by [F1], so r,s are real cochain maps. If rω=0, it vanishes at every point of the cover, so r is injective. Also sr=0. If s(α,β)=0, the forms agree on W and define one form on M by their values on the two opens. Each point has a neighbourhood where it is one of those smooth forms, including at boundary points. This form restricts to (α,β), proving kers=imr.

F1given
2.1

For any form η on W, define a=ρVη there and extend it by zero over UsuppρV. The overlap W and this latter open set cover U; on their intersection the expressions agree because ρV=0. Thus a is smooth on U. Similarly b=ρUη on W, extended by zero over VsuppρU, is smooth on V. Then s(a,b)=(ρU+ρV)η=η, proving surjectivity. This argument uses closed supports, not merely vanishing outside the assigned opens.

F1step 1.1
3.1

Step 1.2 and step 2.1 give exactness in each degree, hence the short exact cochain sequence in the statement. Apply [F4]. The cohomology of the middle complex is the direct sum of the two cohomologies: its cycles and boundaries are the pairs of cycles and boundaries, and a pair of classes is zero exactly when both components are boundaries. Thus the resulting long exact sequence has precisely the asserted terms. Negative form degrees are zero by [F1], so it starts with 0HdR0(M).

F1F4step 1.2step 2.1
4.1

For a closed overlap form η, take any lift (a,b) with ba=η on W, for example the pair in step 2.1. Then dbda=dη=0 on W. By step 1.2 the pair (da,db) is the restriction of a unique global form ζ, and dζ=0 because its restrictions have zero differential. The connector is ΔdR[η]=[ζ],rζ=(da,db). There is no additional sign. If the lift changes by rτ, then ζ changes by dτ. If η changes by dλ, lift λ to (u,v) using step 2.1 and replace (a,b) by (a+du,b+dv); its differential is unchanged. These computations establish independence of both choices of representatives and lifts.

F1F4step 1.2step 2.1step 3.1
5.1

A smooth map of ordered covers pulls forms back on the whole manifold, the two opens and their overlap. By [F1], pullback commutes with r,s,d. Pulling back the lift in step 4.1 gives a lift of the pulled-back overlap form and pulls its global differential back to the corresponding global differential. Thus the connector and the other arrows are natural; no compatibility between the independently available partitions is needed.

F1step 4.1
6.1

If W is empty, all overlap terms and connectors vanish. If one open is empty, the other is M and the row reduces to an identity with zero terms. If U=V=M, the row is diagonal followed by difference; a closed η has lift (0,η), so the connector is zero. These cases include the empty and one-point manifolds. Degree-zero overlap cocycles give degree-one global forms by step 4.1, while negative-degree connectors are zero. A supplied partition makes the constructions after step 1.1 entirely choice-free; zero forms have the zero lift.

F1step 1.2step 2.1step 4.1step 5.1

Depends on

Used by

Dependency tree · two levels

25 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