Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-06 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Naturality of singular Mayer–Vietoris

Statement

A continuous map f:XY with f(U)U and f(V)V induces a commuting morphism between the Mayer–Vietoris sequences of the two covers.

Facts & Assumptions

Given: An abelian group G, open covers X=UV and Y=UV, and a continuous map f:XY with f(U)U and f(V)V. Write AX=C{U,V}(X;G) and AY=C{U,V}(Y;G).

Proof

technique · direct
1.1

Composition with f commutes with the singular boundary, since (fσ)δj=f(σδj). The cover conditions give chain maps on the overlap, on each summand, and fs:AXAY. They commute with i(c)=(c,c) and j(u,v)=u+v by additivity. Thus they give a morphism of the short exact sequences in Short exact chain Mayer–Vietoris sequence, and The long exact homology sequence is natural gives a commuting ladder of their homology sequences.

givenconstruct
2.1

Let ιX:AXC(X;G) and ιY:AYC(Y;G) be the inclusions. On every small simplex both composites are the same singular simplex fσ, so f#ιX=ιYfs. The maps Hn(ιX),Hn(ιY) are isomorphisms by Cover-small chains compute singular homology. Therefore Hn(fs)Hn(ιX)1=Hn(ιY)1Hn(f). Transporting the ladder of step 1.1 along these isomorphisms yields exactly the ordinary homology maps and sequences of Mayer–Vietoris sequence in singular homology.

step 1.1algebra
3.1

In particular, for a small cycle z=u+v, its image is f#u+f#v and f#(u)=f#u. Thus the connector sends the image class to the image of [u], with the same positive U-boundary sign; independence of the chosen small representative and decomposition is supplied by Well-definedness of the Mayer–Vietoris connector and the inclusion isomorphisms. This proves every connecting square as well as the ordinary squares. The argument includes degree zero, the terminal maps to zero, empty overlap or empty cover members, and G=0.

step 1.1step 2.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

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