Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Mayer vietoris sequence in singular cohomology

Statement

For an open cover X=U∪V and any abelian group G, there is a natural exact sequence ⋯→Hn(X;G)→αHn(U;G)⊕Hn(V;G)→βHn(U∩V;G)→∂Hn+1(X;G)→⋯ . Here α is the pair of restrictions and β([u],[v])=[u∣U∩V−v∣U∩V]. Naturality means continuous maps f:X→X′ with f(U)⊆U′ and f(V)⊆V′ for the ordered covers, and coefficient homomorphisms. The connector is specified in the proof with this difference sign. Negative-degree groups are zero.

Facts & Assumptions

[F1]

Short exact chain Mayer–Vietoris sequence gives the integral chain sequence with i(c)=(c,−c) and j(u,v)=u+v, ending in the small complex M=C∗{U,V}(X;Z).

[F2]

The cover-small inclusion is a chain homotopy equivalence supplies a chain homotopy inverse to the inclusion I:M→C∗(X;Z).

[F3]

Singular cochain complex with coefficients uses arbitrary simplex functions and positive coboundary; Singular cohomology with coefficients forms cocycles modulo coboundaries.

[F4]

Singular cohomology is contravariantly functorial gives natural cochain precomposition and coefficient postcomposition, commuting with coboundary.

[F5]

Long exact sequence of a pair in singular cohomology fixes the positive extension-differential convention for connectors. The needed exactness chase for the present complexes is supplied below.

Proof

Given: The ordered cover and coefficients. Write D=Hom⁡(M,G), E=C∗(U;G)⊕C∗(V;G) and F=C∗(U∩V;G), with positive cochain differentials. Their cohomologies mean kernel modulo image.

1.1F1F3

The dual of j sends w∈Dn to its two restrictions a(w), while the dual of i sends (u,v) to b(u,v)=u∣−v∣, by [F1]. The map a is injective because j is onto. If b(u,v)=0, their values agree on common simplices; assign the value from u to a simplex in U, and otherwise that from v. This gives a unique cochain on the small basis and its restrictions are (u,v). Thus ker⁡b=im⁡a. Finally for a cochain c on the intersection, extend it by zero to U and pair this extension with zero on V; this maps to c. All maps commute with differential by [F1] and [F3], proving 0→D→aE→bF→0 termwise exact, including negative zero degrees.

1.2F2F3

Precomposition I♯:C∗(X;G)→D is a cochain homotopy equivalence. Indeed let R be the chain homotopy inverse in [F2]. Precomposing with each of R,I gives cochain maps in reverse order. If a chain homotopy satisfies 1−IR=∂T+T∂, precomposition by Tn−1 gives 1−R♯I♯=δK+Kδ; the other inverse homotopy gives the other composite. At degree zero the homotopy with index −1 is zero. Thus the induced map θ:Hn(X;G)→Hn(D) is an isomorphism. No Hom exactness theorem is used.

2.1F3F5step 1.1step 1.2

For a cocycle c∈Fn, lift it to e∈En by step 1.1. Then bδe=δc=0, so δe=a(d) for a unique d∈Dn+1. Injectivity of a and δ2=0 imply δd=0. If e changes by a(t), then d changes by δt. If c changes by δc0, lift c0 to e0 and replace e by e+δe0, which leaves d unchanged. Hence ∂D[c]=[d] is well-defined; lifts of sums show it is additive. Define the asserted connector by ∂=θ−1∂D. This uses the same positive sign as [F5]. Concretely, one may lift by (c~,0) where c~ is zero extension to U; the small cocycle d restricts to δc~ on U and zero on V.

2.2F3step 1.1

At Hn(E), images from D map to zero. If a cocycle e has be=δc0, lift c0 to e0 and replace e by e−δe0. This is a cocycle in ker⁡b, hence equals a(d) for a unique cocycle d, since a is injective and commutes with differential. Thus this kernel equals the image from Hn(D). The identification Hn(E)=Hn(U;G)⊕Hn(V;G) is coordinatewise: cycles and boundaries are respectively pairs of cycles and pairs of boundaries.

3.1F3step 1.1step 2.1

At Hn(F), a class represented by be with e closed has zero connector. Conversely, if the connecting class of c vanishes, its lift satisfies δe=a(δt) for some t∈Dn. Then e−a(t) is a cocycle lifting c. At Hn+1(D), a connecting representative d satisfies a(d)=δe, so its image is zero. Conversely if a cocycle d has a(d)=δe, then be is a cocycle and its connector is [d]. These arguments establish exactness at both positions in both directions. They include the initial H0(D) injection because a global primitive in E−1 is necessarily zero.

4.1F1F3F4step 1.1step 1.2step 2.1step 2.2step 3.1

Replace H∗(D) by H∗(X;G) through θ. The map to the two open sets is the actual pair of restrictions because aI♯ restricts absolute cochains. The next map is the stated difference by step 1.1. Steps 2.2 and 3.1 give the exact sequence with connector from step 2.1. A map of ordered covers sends small chains to small chains and commutes with their inclusions and i,j; hence its cochain maps commute with a,b and the canonical I♯. Sending a lift e through these maps gives a lift of the image of c, and its differential is the image of a(d). Thus it commutes with ∂D, and the commuting isomorphisms θ imply commutation with ∂. Coefficient postcomposition has the same property. No naturality of the chosen chain inverse R or of zero extension is required.

5.1F2F3step 1.1step 1.2step 2.1step 3.1step 4.1∎

This proves the statement, naturally with its printed sign. If U or V is empty, the sequence has the remaining restriction as an identity and zero intersection groups. If U=V=X, then α is diagonal, β(u,v)=u−v, and the connector is zero since c↦(c,0) is a cochain lift. These include point spaces and empty X; zero coefficients and negative degrees give zero terms. At degree zero there are no negative primitives, as checked in step 3.1. The two-coordinate constructions need no infinite choice; the small-chain construction uses least subdivision depths and all cochain extensions use the specified zero. No AC is used.

Depends on

Dependency tree · 2 levels

Sources