Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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.

Mayer vietoris sequence in real singular cohomology

Statement

For an ordered open cover X=UV, there is a long exact sequence of real vector spaces Hsingk(X;R)αHsingk(U;R)Hsingk(V;R)βHsingk(UV;R)ΔHsingk+1(X;R). Here α is restriction to both opens and β(u,v)=vu. With the same real coefficient identifications, Δ is the negative of the AT connector for the UV convention. The sequence begins with 0H0(X;R); all negative groups vanish.

Facts & Assumptions

Given: The ordered open cover, and the notation D=Csm, E=C(U)C(V), F=C(UV).

[F1]

There is a cochain short exact sequence 0DaEbF0 with b(u,v)=vu (Short exact two open singular cochain mayer vietoris sequence).

[F2]

The cover-small inclusion I is a chain homotopy equivalence (The cover-small inclusion is a chain homotopy equivalence).

[F3]

A cochain short exact sequence has its long exact cohomology sequence (The long exact sequence in cohomology).

[F4]

AT's singular cohomology sequence has overlap map uv and the positive lift-differential connector (Mayer vietoris sequence in singular cohomology).

Proof

1.1

Let r be the inverse chain map supplied by [F2], with rI=1 and 1Ir=T+T. Precomposition gives I:C(X)D and r:DC(X). Then Ir=1 and 1rI=δK+Kδ, where Kkφ=φTk1 and Kk=0 for k0. Indeed evaluation on any degree-k chain turns this equality into the displayed chain identity. Consequently θ=H(I) is an isomorphism with inverse H(r).

F1F2algebra
2.1

For a cocycle cFk, take a lift eEk with be=c. Then bδe=0, so δe=a(d) for a unique dDk+1. Since a is injective, aδd=δ2e=0 implies δd=0. Changing e by a(t) changes d by δt; changing c by δc0 and lifting c0 to e0 allows replacement of e by e+δe0, leaving d unchanged. Thus Δ[c]=θ1[d] is well-defined and linear, because lifts add and scale. This is the lift-differential convention of [F3] and [F4].

F1F3F4step 1.1algebra
3.1

Apply [F3] to [F1]. The finite direct sum has cohomology H(E)=H(U)H(V): cycles and boundaries are componentwise, with just two primitives for a boundary pair. Replace H(D) by H(X) via θ. Since aI restricts a full cochain to U and V, the first map is the actual α; the second is the displayed β, and the connector is step 2.1. This proves exactness throughout. At degree zero the preceding groups are zero, giving initial injectivity.

F1F3step 1.1step 2.1
3.2

For the sign comparison, the AT row and this row have the same D,E,a, whereas b=bAT. If e lifts c in the AT row, then e lifts c in this row and its differential is a(d). Therefore Δ=ΔAT under the same θ. Equivalently the row comparison is identity on D,E and minus identity on F.

F1F4step 2.1algebra
4.1

If an open set is empty, restriction to the other is an identity and the overlap terms vanish. If U=V=X, α is diagonal, β(u,v)=vu, and the cochain lift c(0,c) makes the connector zero. This covers one-point and empty spaces. Degree zero and all negative degrees were handled in steps 1.1 and 3.1; degenerate simplices are included in the supplied chain equivalence. The inverse uses least subdivision depths in [F2], and the lifts in [F1] are canonical zero extensions, so no AC is introduced.

F1F2step 1.1step 2.1step 3.1step 3.2

Depends on

Used by

Dependency tree · two levels

13 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