Alphabeta Math
Pipeline-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.

22 results · all verified · 12 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 10 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Relative Homology Excision and Mayer Vietoris

1 · Prerequisites

2 · Summary

This page builds relative singular chains, then establishes excision through barycentric subdivision and cover-small chains before deriving the two-open Mayer–Vietoris sequence. Coefficients are a fixed abelian group G.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Relative singular chain complex

Definition

Fix an abelian group G. For a subspace AX, regard the finite singular chains Cn(A;G) as the subgroup of Cn(X;G) induced by inclusion. The relative singular chain group is Cn(X,A;G):=Cn(X;G)/Cn(A;G). Equip these quotients with the induced maps n[c]:=[nc]. Their well-definedness and the identity 2=0 are established in Boundary on relative chains . The resulting chain complex is denoted C(X,A;G). Thus both A= and A=X are admitted.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

Boundary on relative chains

Statement

For AX, the singular boundary induces homomorphisms ˉn:Cn(X,A;G)Cn1(X,A;G), and ˉn1ˉn=0.

Facts & Assumptions

Given: A subspace AX and a fixed abelian group G.

Proof

technique · direct
1.1

Inclusion sends every singular simplex of A to the same simplex in X; its faces still have image in A. Hence Cn(A;G)Cn1(A;G), so [c][c] is well defined on the quotient.

givenconstruct
2.1

Applying this map twice gives [2c]=0, since the singular boundary squares to zero.

step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Relative singular homology

Definition

The relative singular homology group of (X,A) in degree n is Hn(X,A;G):=Hn(C(X,A;G))=kerˉn/imˉn+1. Equivalently, a relative cycle is an ordinary finite chain c with cCn1(A;G), modulo adding a chain in A and an ordinary boundary.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Functoriality of relative homology

Statement

A continuous map of pairs f:(X,A)(Y,B), meaning f(A)B, induces f:Hn(X,A;G)Hn(Y,B;G) for every n. Identity maps and composites induce identity maps and composites.

Facts & Assumptions

Given: A continuous f:XY with f(A)B.

Proof

technique · direct
1.1

The induced singular-chain map sends Cn(A;G) into Cn(B;G), hence [c][f#c] defines a quotient-chain map.

givenconstruct
2.1

It commutes with the quotient boundaries, so it maps cycles to cycles and boundaries to boundaries and hence descends to homology. The chain-level identity and composition laws persist after quotienting.

step 1.1algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

Relative homology for the empty and total subspace

Statement

For every space X and every integer n, Hn(X,;G)Hn(X;G) and Hn(X,X;G)=0, including n=0.

Facts & Assumptions

Given: A space X and an integer n.

Proof

technique · direct
1.1

Since every singular chain group of is zero, C(X,;G)=C(X;G) as complexes.

givenalgebra
2.1

Since C(X;G)/C(X;G) is the zero complex, its cycles and boundaries are both zero in every degree. Taking homology proves both assertions.

step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06 rests on unproved material (inherited)Open item page →
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.

Long exact sequence of a pair

Statement

For AX there is an exact sequence Hn(A;G)Hn(X;G)Hn(X,A;G)δHn1(A;G)Hn1(X;G).

Facts & Assumptions

Given: A subspace AX.

Proof

technique · direct
1.1

Inclusion and quotient form a degreewise short exact sequence 0C(A;G)C(X;G)C(X,A;G)0.

givenconstruct
2.1

The long-exact-sequence theorem for a short exact sequence of complexes applied to step 1.1 gives precisely the displayed sequence, with the third homology group equal to relative homology by definition.

step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06 rests on unproved material (inherited)Open item page →
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.

Relative connecting homomorphism on cycles

Definition

For a relative cycle represented by cCn(X;G) with cCn1(A;G), define the connector in the pair sequence by δ[c]:=[c]Hn1(A;G). This fixes the convention in which the quotient map is the third arrow of the short exact sequence of chains.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06 rests on unproved material (inherited)Open item page →
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.

Well-definedness of the relative connector

Statement

The formula δ[c]=[c] defines a homomorphism Hn(X,A;G)Hn1(A;G).

Facts & Assumptions

Given: Relative cycles c,c representing the same class in Hn(X,A;G).

Proof

technique · direct
1.1

Equality of their relative classes says cc=a+b for some aCn(A;G) and bCn+1(X;G).

givenalgebra
2.1

Therefore cc=a, an ordinary boundary in Cn1(A;G); the two proposed values agree. Linearity follows from linearity of .

step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06 rests on unproved material (inherited)Open item page →
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 the pair long exact sequence

Statement

A map of pairs f:(X,A)(Y,B) induces a commuting morphism from the long exact sequence of (X,A) to that of (Y,B), including the connecting maps.

Facts & Assumptions

Given: A map of pairs f:(X,A)(Y,B).

Proof

technique · direct
1.1

The maps on A, X, and quotient chains give a commuting morphism of the short exact sequences used for the two pair sequences.

givenconstruct
2.1

Naturality of the homological long exact sequence makes every resulting square commute. In particular, chainwise f#(c)=f#(c) gives commutation at the connector.

step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-06Open item page →

Barycenter and affine cone

Definition

Let G be an abelian group and n0. The barycenter of the ordered standard n-simplex is bn=(1/(n+1),,1/(n+1)). An affine singular m-simplex in Δn is determined by its ordered vertices w0,,wmΔn; write it as [w0,,wm]. Define its affine cone by bn[w0,,wm]=[bn,w0,,wm], and extend by tensoring with idG to finite affine chains. The apex is the first vertex. Repeated vertices are allowed and remain singular simplices; no quotient by degenerate simplices is being taken.

For a singular simplex σ:ΔnX and a supplied affine chain z~ in Δn, define the affine cone along σ by bσz~:=σ#(bnz~). Here σ# means composition of each affine simplex with σ, with its coefficient unchanged. The lift z~, not just its image chain in X, is part of the input. It may lie anywhere in the convex simplex, including its boundary. In the recursive notation bσS(σ), the supplied lift is the chain S(ιn) in Δn, where ιn is the identity simplex.

With the ordinary boundary of The singular boundary operator, the orientation formulas are, for m1, (bσz~)=σ#z~bσ(z~), and for m=0, (bσz~)=σ#z~[σ(bn)]ε(z~), where ε(j[wj]gj)=jgj. The first formula follows by deleting the first cone vertex and then the successive base vertices with alternating signs; the second follows from [bn,w]=[w][bn]. Thus in degree zero the formula without the extra term holds only when the total coefficient is zero. In particular it applies to the subdivided boundary of a 1-simplex, whose endpoint coefficients sum to zero. These formulas do not change the library's ordinary degree-zero boundary or its reduced-homology convention.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Barycentric subdivision operator

Definition

Define S on a singular 0-simplex to be the identity. Recursively, for an n-simplex σ with n>0, set S(σ)=bσS(σ), and extend G-linearly to finite chains. It is the barycentric subdivision operator with the cone orientation of Barycenter and affine cone.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Barycentric subdivision is a chain map

Statement

For every singular chain c, S(c)=S(c).

Facts & Assumptions

Given: The recursively defined subdivision operator S.

Proof

technique · induction
1.1

In degree 0, both sides vanish. Assume S=S on dimensions below n.

givenbaseassume-hyp
2.1

For an n-simplex, the cone formula and the induction hypothesis give Sσ=bσSσ=SσbσSσ=Sσ.

step 1.1ihalgebra
3.1

Linearity extends this equality to finite chains, completing the induction.

step 2.1discharge-induction
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-06Open item page →

Subdivision prism homotopy

Definition

Let ιn:ΔnΔn be the identity affine simplex. Put P0=0. Inductively, after Pm has been defined for m<n, set P(λ)=λ#Pm for every affine m-simplex λ:ΔmΔn. Then define the linear (n+1)-chain Pn=bn(ιnP(ιn)), where bn() is affine coning inside the convex simplex Δn to its barycenter. For a singular simplex σ:ΔnX, set T(σ)=σ#Pn and extend G-linearly. This degree-one operator is the subdivision prism homotopy.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Subdivision is chain homotopic to the identity

Statement

The operators S and 1 obey 1S=T+T.

Facts & Assumptions

Given: The recursive prism operator T and chain map S.

Proof

technique · induction
1.1

In dimension 0, S=1 and T=0. Assume the identity on all faces of an n-simplex σ.

givenbaseassume-hyp
2.1

On the universal simplex, the induction hypothesis applied to ιn gives (ιnP(ιn))=S(ιn). The affine-cone formula and the recursive definition of subdivision therefore give Pn=ιnP(ιn)bnS(ιn)=ιnP(ιn)S(ιn).

step 1.1ihalgebra
3.1

Pushing the equality in step 2.1 forward along σ:ΔnX gives Tσ+Tσ=σSσ. Linearity proves the identity on chains.

step 2.1discharge-induction
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Mesh tends to zero under iterated subdivision

Statement

For an affine n-simplex of finite diameter and n>0, every simplex in its r-fold barycentric subdivision has diameter at most (n/(n+1))r times the original diameter. Hence the mesh tends to zero.

Facts & Assumptions

Given: An affine n-simplex with n>0 and finite diameter d.

Proof

technique · direct
1.1

Each barycentric subsimplex has vertices which are barycenters of nested faces; their convex-coordinate differences have diameter at most n/(n+1) times that of the parent.

givenalgebra
2.1

Iterating the estimate yields (n/(n+1))rd. Since 0<n/(n+1)<1, this tends to 0 as r tends to infinity.

step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Cover-small singular chains

Definition

If U is a family of subsets whose interiors cover X, let CnU(X;G) be the subgroup generated by singular n-simplices whose images lie in one member of U. Faces remain in that member, so these groups form the cover-small singular-chain subcomplex.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

Finite chains eventually become cover-small

Statement

If the interiors of U cover X, then for every finite singular chain c there is r0 with SrcCU(X;G).

Facts & Assumptions

Given: A finite chain c and a cover whose interiors cover X.

Proof

technique · direct
1.1

The image of each simplex of c is compact, so its pulled-back cover has a Lebesgue number; mesh decay supplies a subdivision depth making every subsimplex image lie in one cover member.

givenconstruct
2.1

There are finitely many original simplices, so the maximum of their finitely many depths works for all of them. Thus Src is cover-small; no depth is claimed for all singular simplices at once.

step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

Cover-small chains compute singular homology

Statement

The inclusion CU(X;G)C(X;G) induces an isomorphism on homology.

Facts & Assumptions

Given: A family U whose interiors cover X.

Proof

technique · direct
1.1

For an ordinary cycle z, choose a depth with Srz small. Repeatedly applying 1S=T+T shows z and Srz are homologous, proving surjectivity.

givenconstruct
2.1

If a small cycle bounds an ordinary chain b, choose a depth making Srb small. The same prism identity says the original cycle and its small subdivision differ by a boundary already in the small complex; together with Srb=Srb this proves injectivity.

step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

The cover-small inclusion is a chain homotopy equivalence

Statement

The inclusion of the cover-small complex into the singular complex is a chain homotopy equivalence.

Facts & Assumptions

Given: A family U whose interiors cover X, an abelian group G, and the barycentric subdivision data. Write A=CU(X;Z) and C=C(X;Z). We first construct integral operators and then tensor with G.

Proof

technique · direct
1.1

Use S and T with 1S=T+T from Subdivision is chain homotopic to the identity. Their constructions in Barycentric subdivision operator and Subdivision prism homotopy take each singular simplex to a finite sum of its compositions with affine simplices in its own domain. Thus neither operator enlarges the image of a simplex, and both preserve A. Also S is a chain map: applying on either side of the displayed homotopy identity gives S=S. Set Dq=i=0q1TSi for q0, so D0=0 and 1Sq=Dq+Dq by telescoping.

givenconstruct
2.1

For each singular simplex σ, let a(σ) be the least q0 with SqσA; existence follows from Finite chains eventually become cover-small with integer coefficients. Define m recursively on dimension: on vertices set m=0, and for positive-dimensional σ set m(σ)=max({a(σ)}{m(σδj):0jdimσ}). Every maximum is finite and uses already defined lower-dimensional values. Since S preserves small chains, Sm(σ)σ is small. Every face τ has m(τ)m(σ) by construction, regardless of cancellations in subdivided chains. If σ is already small, all its faces are small, so this recursion gives m(σ)=0.

step 1.1construct
3.1

Define Dσ=Dm(σ)σ on integral generators and extend linearly. Put R=1DD on C. The identity 2=0 gives R=R. On a simplex, telescoping gives Rσ=Sm(σ)σ+Dm(σ)(σ)D(σ). The first term is small. For each face τ, its signed correction is i=m(τ)m(σ)1TSiτ. Each Siτ is small for these indices, and T preserves small chains. Therefore Rσ is small.

step 1.1step 2.1algebra
4.1

Regard R as a chain map r:CA and let ι:AC. Then 1ιr=D+D. On every small simplex m=0, hence D=0 on A; its boundary is also small, so rι=1. Thus one inverse composite is the identity and the other is chain homotopic to it. In degree zero all vertices are small and D=0; if X is empty both complexes are zero.

step 2.1step 3.1algebra
5.1

The group An is the direct summand of the free abelian group Cn spanned by small singular simplices. Tensoring its inclusion with G identifies AnG with the cover-small subgroup of Cn(X;G). Tensor r,D and their identities with idG; these identities remain valid for every abelian G, including G=0, without a flatness assumption. This proves the stated chain homotopy equivalence with the page's coefficients.

step 4.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

Excision for singular homology

Statement

If ZX and ZintX(A), then inclusion (XZ,AZ)(X,A) induces isomorphisms Hn(XZ,AZ;G)Hn(X,A;G) for every n.

Facts & Assumptions

Given: ZintX(A).

Proof

technique · direct
1.1

Use the cover {XZ,intA}: its cover-small quotient complex for (X,A) consists, modulo small chains in A, of precisely the small chains avoiding Z.

givenconstruct
2.1

The two inclusions from their small complexes to the corresponding full relative complexes are chain homotopy equivalences. The quotient identification in step 1.1 therefore induces the stated isomorphism.

step 1.1algebra
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06 rests on unproved material (inherited)Open item page →
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.

Good pairs and quotient reduced homology

Statement

Suppose A is a nonempty closed subspace of X and is a deformation retract of an open neighborhood V in X; this is the good-pair hypothesis used here. Then the quotient map gives Hn(X,A;G)H~n(X/A;G) for every n.

Facts & Assumptions

Given: A nonempty closed subspace AX and an open neighborhood V that deformation retracts onto A through a homotopy fixing A.

Proof

technique · direct
1.1

Since V deformation retracts onto A, H(V,A;G)=0. The quotient homotopy gives the same conclusion for (V/A,A/A). The long exact sequences of the short exact chain-complex sequences 0C(V,A;G)C(X,A;G)C(X,V;G)0 and its quotient analogue therefore give H(X,A;G)H(X,V;G),H(X/A,A/A;G)H(X/A,V/A;G).

givenalgebra
2.1

Because A is closed and lies in the open set V, excision applies to (X,V) and to (X/A,V/A) after removing respectively A and the quotient point. The resulting removed pairs are homeomorphic, so the quotient map induces H(X,V;G)H(X/A,V/A;G). Combining with step 1.1 gives H(X,A;G)H(X/A,A/A;G). Since A, A/A is one point, and the augmented singular complex identifies the latter groups with H~(X/A;G), including degree zero.

step 1.1algebra
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Cover-small chains for a two-open cover

Statement

For open U,VX with X=UV, C{U,V}(X;G)=C(U;G)+C(V;G) and the intersection of the two summands is C(UV;G).

Facts & Assumptions

Given: An open cover X=UV.

Proof

technique · direct
1.1

A cover-small generator has image in U or in V, hence belongs to the displayed sum; conversely each generator from either summand is cover-small.

givenalgebra
2.1

The singular simplices simultaneously belonging to both free-chain subgroups are exactly those with image in UV, so their intersection is the stated chain group.

step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Short exact chain Mayer–Vietoris sequence

Statement

For X=UV open, there is a short exact sequence 0C(UV;G)i(C(U;G)C(V;G))jC{U,V}(X;G)0, where i(c)=(c,c) and j(u,v)=u+v.

Facts & Assumptions

Given: An open cover X=UV.

Proof

technique · direct
1.1

Both i and j commute with boundaries; i is injective and j is surjective by the sum description of cover-small chains.

givenconstruct
2.1

If u+v=0, then u=v is a chain in both U and V, so (u,v)=i(u). Thus the kernel of j is the image of i.

step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06 rests on unproved material (inherited)Open item page →
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.

Mayer–Vietoris sequence in singular homology

Statement

For an open cover X=UV, the sequence Hn(UV;G)Hn(U;G)Hn(V;G)Hn(X;G)δHn1(UV;G) is exact, with middle map (u,v)u+v.

Facts & Assumptions

Given: An open cover X=UV.

Proof

technique · direct
1.1

Apply the homological long exact sequence to the short exact sequence of the preceding theorem.

givenconstruct
2.1

The cover-small complex has the same homology as X, so replacing its homology term identifies that long exact sequence with the displayed one.

step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-06 rests on unproved material (inherited)Open item page →
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.

Mayer–Vietoris connecting class

Definition

Fix an abelian group G, an open cover X=UV, and n1. For a cover-small n-cycle z=u+v with uCn(U;G) and vCn(V;G), define δ[z]:=[u]=[v]Hn1(UV;G). This is the connecting-class convention compatible with i(c)=(c,c).

Indeed, z=0 implies u=v. As a chain lying in both subcomplexes, this is a chain on UV, and 2u=0 makes it a cycle. For n=1 this uses the ordinary zero boundary on 0-chains; if the overlap is empty the chain is zero.

The well-definedness obligation is discharged by Well-definedness of the Mayer–Vietoris connector . Explicitly, replacing (u,v) by another decomposition changes u by an overlap chain and hence u by an overlap boundary. If zz=(a+b) in the small complex, where a lies in U and b in V, then uua is an overlap chain and its boundary is uu. The cover-small homology identification used in Mayer–Vietoris sequence in singular homology therefore makes this a class depending only on [z]Hn(X;G). Lifting z to (u,v) gives boundary (u,u)=i(u), so the sign agrees with that sequence.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06 rests on unproved material (inherited)Open item page →
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.

Well-definedness of the Mayer–Vietoris connector

Statement

The class [u] defining the Mayer–Vietoris connector is independent of the small-chain decomposition and of the chosen cycle representative.

Facts & Assumptions

Given: Two decompositions z=u+v=u+v of a cover-small cycle.

Proof

technique · direct
1.1

Exactness of the chain sequence gives uu=w and vv=w for some wCn(UV;G).

givenalgebra
2.1

Hence uu=w, so the two overlap cycles give the same homology class. Changing z by a boundary yields the same calculation one degree higher.

step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06 rests on unproved material (inherited)Open item page →
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
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06 rests on unproved material (inherited)Open item page →
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.

Simplicial and singular homology agree

Statement

For every simplicial complex K, the natural simplicial-to-singular chain map induces Hnsimp(K;G)Hn(K;G) for all n.

Facts & Assumptions

Given: A simplicial complex K and the natural simplicial-to-singular map.

Proof

technique · induction
1.1

Extend the simplicial chains, the characteristic-simplex map, and its boundary identity G-linearly. For a finite-dimensional complex, filter by skeleta. The relative comparison for (Kr,Kr1) is an isomorphism: both relative theories are a direct sum of one copy of G for each r-simplex in degree r and vanish in the other degrees.

givenbaseconstruct
2.1

The simplicial and singular pair long exact sequences commute with this comparison. Skeletal induction and the five lemma therefore give an isomorphism for every finite-dimensional K.

step 1.1ihalgebra
3.1

A finite singular cycle, and likewise a finite chain witnessing a boundary, has compact image. In a simplicial complex this image meets only finitely many open simplices and is contained in a finite-dimensional skeleton. The finite-dimensional result gives respectively surjectivity and injectivity for arbitrary K. The characteristic-simplex construction commutes with simplicial maps, so the isomorphism is natural.

step 2.1discharge-induction
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06 rests on unproved material (inherited)Open item page →
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.

Homology of spheres

Statement

For n1, H~k(Sn;G) is G for k=n and 0 otherwise. For S0, H~0(S0;G)G and all other reduced groups vanish. Thus H0(Sn;G)G for n1, whereas H0(S0;G)GG.

Facts & Assumptions

Given: The boundary of an (n+1)-simplex as a simplicial model of Sn.

Proof

technique · direct
1.1

Put D=Δn+1 and K=D. The integral augmented complex of D has a vertex-cone contraction, as used in A simplex has zero reduced simplicial homology. Tensoring the contraction identity with G preserves it, so the augmented complex with coefficients in G is exact. For k<n, its groups and differentials computing reduced homology in degree k agree with those of K, hence H~ksimp(K;G)=0.

givenconstruct
2.1

In degree n, exactness for D gives kern=imn+1. The map G=Cn+1(D;G)Cn(K;G) sends g to the alternating sum of its facets with coefficient g; it is injective since any one facet has coefficient g or g. There are no (n+1)-chains in K, so H~nsimp(K;G)G. This uses the augmentation as 0 when n=0. Above degree n all simplicial groups vanish.

step 1.1algebra
3.1

The characteristic-simplex comparison of Simplicial and singular homology agree sends each vertex with coefficient g to the corresponding singular point with coefficient g, so it commutes with augmentation to G. For either theory, H~0=ker(H0G), directly from the kernel-in-degree-zero definition in Augmentation at 0-simplices and reduced singular homology. Thus the ordinary comparison isomorphism restricts to an isomorphism on these kernels; in positive degrees reduced and ordinary homology agree. The calculation therefore transfers to KSn, and negative reduced groups are zero by convention.

step 2.1algebra
4.1

For n1, the augmentation H0(Sn;G)G is surjective (use any vertex) with zero kernel, hence is an isomorphism. For n=0, the simplicial model consists of two vertices and no edges, giving H0(S0;G)GG; its augmentation kernel is {(g,g):gG}. This includes G=0.

step 3.1algebra
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06 rests on unproved material (inherited)Open item page →
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.

Suspension isomorphism in reduced singular homology

Statement

Let G be an abelian group. For a based well-pointed space X—meaning that the basepoint inclusion {x0}X is a cofibration—reduced singular homology has natural isomorphisms H~n+1(ΣX;G)H~n(X;G) for all integers n. Here ΣX is the suspension with two distinct apices, as in The adjunction space YfX glued along a continuous map, and, for a nonempty space, the cone and the suspension as quotients of X×[0,1].

Facts & Assumptions

Given: A based space X whose basepoint inclusion is a cofibration, and its suspension covered by two cone neighborhoods.

Proof

technique · direct
1.1

Write q:X×[0,1]ΣX for the quotient. The sets U=q(X×[0,2/3)) and V=q(X×(1/3,1]) are open, cover ΣX, and contract to their respective apices by moving the height coordinate linearly to 0 or 1. Their intersection is WX×(1/3,2/3); projection p:WX is a homotopy equivalence, with section at height 1/2. Since X has its specified basepoint, these spaces are nonempty.

givenconstruct
2.1

A point has H0(;G)=G and Hj(;G)=0 for j>0: its singular complex has one copy of G in each degree, with boundary alternately zero and identity. Thus Contractible nonempty spaces have the homology of a point gives the same groups for U,V, with the degree-zero isomorphism induced by augmentation. For n1, ordinary exactness in Mayer–Vietoris sequence in singular homology gives Hn+1(ΣX;G)Hn(W;G)Hn(X;G), the last isomorphism by Homotopy equivalences induce isomorphisms on singular homology. These degrees are positive, so the groups are also reduced groups.

step 1.1algebra
3.1

For n=0, the same exact sequence gives 0H1(ΣX;G)δH0(W;G)(ε,ε)GG. Its last kernel is exactly H~0(W;G). Projection to X preserves augmentation and is an ordinary homology isomorphism, so it identifies this kernel with H~0(X;G) under Augmentation at 0-simplices and reduced singular homology.

step 2.1algebra
4.1

Every point of ΣX has a height path to an apex, and the height path through x0 joins the two apices. Hence ΣX is path connected: differences of singular points bound paths, so augmentation identifies its H0 with G and its reduced H0 is zero. This proves the shift for n=1; for n<1 both sides are zero by the stated reduced-complex convention. The arguments include the one-point space and G=0.

step 1.1step 3.1algebra
5.1

A based map f:XY induces [x,t][f(x),t] and preserves these covers and their projections. At chain level the connecting map takes a small cycle z=u+v to [u]; applying f# gives [f#u]=[f#u]. Thus the connecting maps commute with f, and so do their degree-zero kernel restrictions and the projection isomorphisms. This proves naturality in every degree.

step 2.1step 3.1step 4.1algebra

5 · Examples, counterexamples and false statements

None yet.

Sources