Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 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 commutes with Mayer–Vietoris connectors

Statement

Assume ACω. For an ordered open cover M=UV of a smooth manifold, possibly with boundary, integration intertwines the de Rham and smooth singular Mayer–Vietoris connectors: IMΔdR=ΔIUV. Both sequences use second-minus-first difference and the positive lift-differential connector. If a smooth partition subordinate to U,V is supplied, the proof uses no choice axiom.

Facts & Assumptions

[F1]

De Rham Mayer–Vietoris with boundary and an explicit partition lift gives the lift (ρVω,ρUω), its smooth zero extensions and the global closed form obtained by differentiating the lift.

[F2]

Smooth singular mayer vietoris sequence constructs the smooth small-chain row and its positive connector through the actual inclusion.

[F3]

Canonical extension by zero of a singular cochain on a simplex basis supplies degreewise zero extension on a specified simplex basis; its formula also applies to the smooth bases and is not a cochain map assertion.

[F4]

De Rham integration is a cochain map gives δI(α)=I(dα).

[F5]

Naturality of the de Rham map gives restriction naturality of integration and its real linearity.

[F6]

The Axiom of Countable Choice (ACω) is used only to obtain the partition in [F1].

[F7]

Subdivision is chain homotopic to the identity gives 1S=T+T.

[F8]

Barycentric subdivision and prism preserve smooth singular chains says that S and T preserve smooth chains and do not enlarge simplex images.

[F9]

Finite chains eventually become cover-small supplies a finite subdivision depth for every finite chain.

Proof

Given: The ordered cover, W=UV and a closed k-form ω on W, with k0. Let C=C(M;R), let A be its cover-small subcomplex and let j:AC be inclusion. Denote restriction of a small cochain to the two opens by a, and their second-minus-first difference by b.

1.1

Take the partition supplied by [F1] under [F6], or the given partition in the choice-free branch. Set α=ρVω on W, smoothly extended by zero in U, and β=ρUω similarly in V. Then βα=ω, and the pair (dα,dβ) glues to a closed form ζ on M. By [F1], ΔdR[ω]=[ζ]. Set c=IWk(ω) and e=(IUk(α),IVk(β)). By [F4], c is a cocycle; by [F5], b(e)=c and δe=(IUk+1(dα),IVk+1(dβ))=a(jIMk+1(ζ)).

F1F4F5F6given
2.1

Let EUc be the function on smooth k-simplices in U equal to c when the simplex has image in W and zero otherwise. An overlap-valued smooth simplex in U is smooth in W: restrict its target-valued extension to the inverse image of the open set W. Thus this is the legitimate degreewise extension [F3]. The prescribed singular lift is e0=(EUc,0), since b(e0)=c. Its differential has zero difference, so the gluing in [F2] gives a unique small (k+1)-cochain z0 with a(z0)=δe0. It is a cocycle because a is injective and a(δz0)=δ2e0=0. The singular connector is H(j)1[z0].

F2F3step 1.1
3.1

Define a small k-cochain t on its simplex basis by giving priority to U: on a simplex σ lying in U put t(σ)=IUk(α)(σ)+(EUc)(σ), and on a small simplex not lying in U (hence lying in V) put t(σ)=IVk(β)(σ). If a simplex lies in both opens, it lies in W and the first value is IW(α+ω)(σ)=IW(β)(σ) by [F5]. Thus t glues precisely ee0: a(t)=ee0. Since a is an injective cochain map, step 1.1 and step 2.1 give δt=jIMk+1(ζ)z0. This is the explicit lower-degree coboundary between the integrated form lift and the basiswise singular lift.

F2F3F5step 1.1step 2.1
4.1

Construct the needed full-to-small operators directly. For each smooth simplex σ, [F9] gives a least a(σ) with Sa(σ)σ small. Recursively on dimension let m(σ) be the maximum of a(σ) and the already defined values on its faces; if σ is small then m(σ)=0. Put Dq=i=0q1TSi, so [F7] telescopes to 1Sq=Dq+Dq. Define Dσ=Dm(σ)σ and R=1DD. Then R is a chain map, Rj=1, and 1jR=D+D. Moreover R lands in A: after rewriting Rσ=Sm(σ)σ+Dm(σ)σDσ, the first term is small, while each face correction is a signed sum of TSiτ for m(τ)i<m(σ) and hence is small by [F8]. Thus all operators preserve smooth chains and are specified without choice. Put q=IMk+1(ζ); it is closed by [F4]. The displayed homotopy identity gives qRjq=δ(qDk), because q=0. Precompose the identity in step 3.1 with R and add it to this equality. The result is the concrete full-cochain identity qRz0=δ(qDk+Rt). Every evaluation here is on a finite chain produced by the specified operators.

F4F7F8F9step 1.1step 3.1
5.1

The identities for R,j,D in step 4.1 make H(R) inverse to H(j). Thus step 4.1 implies [IMk+1(ζ)]=H(j)1[z0]. By step 1.1 the left side is IMΔdR[ω], and by step 2.1 the right side is ΔIW[ω]. Both connectors and integration are already well defined, so this proves the asserted equality on classes, independently of partition, lift and representative.

F1F2step 1.1step 2.1step 4.1
6.1

For k=0, t is a zero-cochain and qD0 is also a zero-cochain; the formula compares degree-one connectors without any negative primitive. Negative overlap degrees are zero. If W is empty, both connectors are zero; empty opens and the empty manifold likewise reduce to zero terms. If U=V=M, both connectors vanish by their explicit lifts, and the same calculation remains valid. Zero forms and repeated or degenerate simplices satisfy the pointwise formulas unchanged. The signs in steps 1.1–3.1 use (EUc,0) and VU throughout. Apart from [F6] for obtaining the form partition, all extensions, priorities, subdivision depths and sums are specified, so the supplied-partition branch is choice-free.

F1F2F3F6F7F8F9step 1.1step 2.1step 3.1step 4.1step 5.1

Depends on

Used by

Dependency tree · two levels

34 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