Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Short exact two open singular cochain mayer vietoris sequence

Statement

For an ordered open cover X=U∪V, put Csmk=Hom⁡R(CkU,V(X;R),R) with differential δλ=λ∂. There is a short exact sequence of cochain complexes 0⟶Csm∙→aC∙(U;R)⊕C∙(V;R)→bC∙(U∩V;R)⟶0, where a(λ)=(λ∣U,λ∣V) and b(φ,ψ)=ψ∣U∩V−φ∣U∩V. The first complex is the dual of cover-small chains; it is not the full cochain complex C∙(X;R).

Facts & Assumptions

Given: The ordered open cover (U,V) of X.

[F1]

The small-chain sequence has i(c)=(−c,c), j(a,b)=a+b and is exact with chain-map arrows (Short exact two open cover small singular chain sequence).

[F2]

Degreewise zero extension EU∩VU is a linear section of restriction, without any cochain-map claim (Canonical extension by zero of a singular cochain on a simplex basis).

Proof

1.1givenF1algebra

Since i,j commute with boundary, precomposition by them commutes with coboundary. Their dual maps are exactly a and b with the displayed signs. Also δ2λ=λ∂2=0 on small chains, so the first term is a cochain complex, including zero groups in negative degrees.

2.1F1step 1.1

If both restrictions of λ vanish then λ vanishes on every small generator, so a is injective. A pair (φ,ψ) is in ker⁡b precisely when the functions agree on overlap simplices. Define λ on a small simplex to be φ on U simplices and ψ on the others. Agreement makes its restrictions the given pair. Extending by finite real sums gives a unique functional. Conversely restrictions of a single functional agree on the overlap, proving ker⁡b=im⁡a.

3.1F2step 1.1step 2.1algebra∎

For η∈Ck(U∩V;R), b(−EU∩VUη,0)=η by [F2], proving degreewise surjectivity with the required minus sign. This lift is not used as a cochain map. Empty opens or overlap give zero terms and the same formulas; if U=V=X, agreeing pairs are (λ,λ) and b(φ,ψ)=ψ−φ. This includes a one-point space. The argument applies in degree zero, on repeated simplices, and on the zero groups in negative degrees, without any AC.

Depends on

Dependency tree · 2 levels

Sources