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.

✓ 20 results · all verified · 11 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 9 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 A⊆X, 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 A⊆X, the singular boundary induces homomorphisms ∂ˉn:Cn(X,A;G)→Cn−1(X,A;G), and ∂ˉn−1∂ˉn=0.

Facts & Assumptions

Given: A subspace A⊆X and a fixed abelian group G.

Proof

technique · direct
1.1givenconstruct

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

2.1step 1.1algebra∎

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

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 ∂c∈Cn−1(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:X→Y with f(A)⊆B.

Proof

technique · direct
1.1givenconstruct

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

2.1step 1.1algebra∎

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.

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.1givenalgebra

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

2.1step 1.1algebra∎

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.

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

Long exact sequence of a pair

Statement

For A⊆X there is an exact sequence ⋯→Hn(A;G)→Hn(X;G)→Hn(X,A;G)→δHn−1(A;G)→Hn−1(X;G)→⋯ .

Facts & Assumptions

Given: A subspace A⊆X.

Proof

technique · direct
1.1givenconstruct

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

2.1step 1.1algebra∎

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.

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

Relative connecting homomorphism on cycles

Definition

For a relative cycle represented by c∈Cn(X;G) with ∂c∈Cn−1(A;G), define the connector in the pair sequence by δ[c]:=[∂c]∈Hn−1(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-06Open item page →

Well-definedness of the relative connector

Statement

The formula δ[c]=[∂c] defines a homomorphism Hn(X,A;G)→Hn−1(A;G).

Facts & Assumptions

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

Proof

technique · direct
1.1givenalgebra

Equality of their relative classes says c′−c=a+∂b for some a∈Cn(A;G) and b∈Cn+1(X;G).

2.1step 1.1algebra∎

Therefore ∂c′−∂c=∂a, an ordinary boundary in Cn−1(A;G); the two proposed values agree. Linearity follows from linearity of ∂.

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

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.1givenconstruct

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

2.1step 1.1algebra∎

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

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

Barycenter and affine cone

Definition

Let G be an abelian group and n≥0. 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 id⁡G 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 σ:Δn→X 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 m≥1, ∂(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-adaptedverified 2026-09-26 (gpt-6-sol)Open 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.1givenbaseassume-hyp

In degree 0, both sides vanish. Assume ∂S=S∂ on dimensions below n, where n≥1.

2.1step 1.1givenalgebra

Let ιn be the identity simplex of Δn and put z=S(∂ιn), the affine lift used in the definition of Sσ. If n=1, then z=[v1]−[v0], so its augmentation is zero. The degree-zero cone formula gives ∂Sσ=σ#z=S(∂σ).

2.2step 1.1ihalgebra

If n≥2, the induction hypothesis applied in Δn gives ∂z=S(∂2ιn)=0 by The singular boundary squares to zero. The positive-degree cone formula therefore gives ∂Sσ=σ#z−bσ(∂z)=σ#z=S(∂σ). The last equality follows directly from the recursive definition: subdivision commutes with postcomposition by σ on each affine face.

3.1step 2.1step 2.2discharge-induction∎

Linearity extends these equalities to finite chains, completing the 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(ιn−P(∂ιn)), where bn(−) is affine coning inside the convex simplex Δn to its barycenter. For a singular simplex σ:Δn→X, 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 1−S=∂T+T∂.

Facts & Assumptions

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

Proof

technique · induction
1.1givenbaseassume-hyp

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

2.1step 1.1ihalgebra

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

3.1step 2.1discharge-induction∎

Pushing the equality in step 2.1 forward along σ:Δn→X gives ∂Tσ+T∂σ=σ−Sσ. Linearity proves the identity on chains.

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.1givenalgebra

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.

2.1step 1.1algebra∎

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

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 r≥0 with Src∈C∙U(X;G).

Facts & Assumptions

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

Proof

technique · direct
1.1givenconstruct

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.

2.1step 1.1algebra∎

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.

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

Cover-small chains compute singular homology

Statement

The inclusion C∙U(X;G)↪C∙(X;G) induces an isomorphism on homology.

Facts & Assumptions

Given: A family U whose interiors cover X.

Proof

technique · direct
1.1givenconstruct

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

2.1step 1.1algebra∎

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=Sr∂b this proves injectivity.

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∙=C∙U(X;Z) and C∙=C∙(X;Z). We first construct integral operators and then tensor with G.

Proof

technique · direct
1.1givenconstruct

Use S and T with 1−S=∂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=0q−1TSi for q≥0, so D0=0 and 1−Sq=∂Dq+Dq∂ by telescoping.

2.1step 1.1construct

For each singular simplex σ, let a(σ) be the least q≥0 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):0≤j≤dim⁡σ}). 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.

3.1step 1.1step 2.1algebra

Define Dσ=Dm(σ)σ on integral generators and extend linearly. Put R=1−∂D−D∂ 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.

4.1step 2.1step 3.1algebra

Regard R as a chain map r:C∙→A∙ and let ι:A∙↪C∙. 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.

5.1step 4.1algebra∎

The group An is the direct summand of the free abelian group Cn spanned by small singular simplices. Tensoring its inclusion with G identifies An⊗G with the cover-small subgroup of Cn(X;G). Tensor r,D and their identities with id⁡G; 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.

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

Excision for singular homology

Statement

If Z⊆X and Z‾⊆int⁡X(A), then inclusion (X−Z,A−Z)→(X,A) induces isomorphisms Hn(X−Z,A−Z;G)≅Hn(X,A;G) for every n.

Facts & Assumptions

Given: Z‾⊆int⁡X(A).

Proof

technique · direct
1.1givenconstruct

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

2.1step 1.1algebra∎

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.

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

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 A⊆X and an open neighborhood V that deformation retracts onto A through a homotopy fixing A.

Proof

technique · direct
1.1givenalgebra

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 0→C∗(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).

2.1step 1.1algebra∎

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.

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,V⊆X with X=U∪V, C∙{U,V}(X;G)=C∙(U;G)+C∙(V;G) and the intersection of the two summands is C∙(U∩V;G).

Facts & Assumptions

Given: An open cover X=U∪V.

Proof

technique · direct
1.1givenalgebra

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.

2.1step 1.1algebra∎

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

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=U∪V open, there is a short exact sequence 0→C∙(U∩V;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=U∪V.

Proof

technique · direct
1.1givenconstruct

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

2.1step 1.1algebra∎

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.

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

Mayer–Vietoris sequence in singular homology

Statement

For an open cover X=U∪V, the sequence ⋯→Hn(U∩V;G)→Hn(U;G)⊕Hn(V;G)→Hn(X;G)→δHn−1(U∩V;G)→⋯ is exact, with middle map (u,v)↦u+v.

Facts & Assumptions

Given: An open cover X=U∪V.

Proof

technique · direct
1.1givenconstruct

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

2.1step 1.1algebra∎

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

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

Mayer–Vietoris connecting class

Definition

Fix an abelian group G, an open cover X=U∪V, and n≥1. For a cover-small n-cycle z=u+v with u∈Cn(U;G) and v∈Cn(V;G), define δ[z]:=[∂u]=[−∂v]∈Hn−1(U∩V;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 U∩V, 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 z′−z=∂(a+b) in the small complex, where a lies in U and b in V, then u′−u−∂a is an overlap chain and its boundary is ∂u′−∂u. 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-06Open item page →

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.1givenalgebra

Exactness of the chain sequence gives u−u′=w and v−v′=−w for some w∈Cn(U∩V;G).

2.1step 1.1algebra∎

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

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

Naturality of singular Mayer–Vietoris

Statement

A continuous map f:X→Y 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=U∪V and Y=U′∪V′, and a continuous map f:X→Y 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.1givenconstruct

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:AX→AY. 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.

2.1step 1.1algebra

Let ιX:AX↪C∙(X;G) and ιY:AY↪C∙(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.

3.1step 1.1step 2.1algebra∎

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-24 (gpt-6-sol)Open item page →

Simplicial and singular homology agree

Statement

For every simplicial complex K and abelian group G, there is a canonical natural isomorphism Hnsimp(K;G)≅Hn(∣K∣;G) for all n. When the vertex set has a supplied total order, it is induced by the simplicial-to-singular chain map of The degreewise simplicial-to-singular homomorphisms, extended G-linearly. Different supplied orders induce the same homology map. For an arbitrary vertex set, the isomorphism is defined compatibly on its finite subcomplexes and requires no choice principle.

Facts & Assumptions

Given: An abstract simplicial complex K with weak geometric realization and an abelian group G.

Proof

technique · induction
1.1givenbase

Every finite complex has a total order on its finite vertex set. For a chosen order, the characteristic-simplex homomorphisms give a chain map Φ:C∗simp(K;G)→C∗sing(∣K∣;G) by the cited boundary lemma, and give a map of pair exact sequences for every subcomplex. No tensor-exactness is used: the chain groups in both pair sequences are degreewise split by their simplex bases.

1.2givenconstruct

We will use finite simplicial-subcomplex excision without invoking the later CW-homology-axioms item. Let L be a nonempty subcomplex of a finite K. Under the canonical homeomorphism ∣sd⁡K∣≅∣K∣ of Barycentric subdivision realizes homeomorphically, the vertices of sd⁡L are the nonempty faces of L. They span a full subcomplex of sd⁡K: in any face chain, the faces belonging to L form an initial segment because L is closed under taking faces. For x∈∣sd⁡K∣, let s(x) be the sum of its barycentric coordinates at these vertices. This is a continuous function, and U={s>0} is an open neighborhood of ∣sd⁡L∣. On U discard the other coordinates and divide the retained ones by s(x), obtaining a continuous map r:U→∣sd⁡L∣. In each subdivided simplex the straight-line homotopy (1−t)x+tr(x) stays in that simplex, fixes ∣sd⁡L∣, and retracts U onto it. Thus every such finite pair is a good pair in Good pairs and quotient reduced homology. If finite complexes K=L∪σ with L∩σ=∂σ, their quotient map-out descriptions give ∣K∣/∣L∣≅∣σ∣/∣∂σ∣, so inclusion (∣σ∣,∣∂σ∣)→(∣K∣,∣L∣) induces an isomorphism on relative singular homology when dim⁡σ>0. The same argument applies to ∂Δr=F∪Λ with F∩Λ=∂F for r≥2, giving H∗(F,∂F;G)≅H∗(∂Δr,Λ;G). These are exactly the two finite excisions used below.

1.3givenalgebra

We compute the singular relative group of an oriented simplex without using any simplicial-to-singular comparison. For r=0, H0(Δ0,∅;G)=G, generated by its vertex. For r=1, the pair sequence of the contractible interval and its two endpoints gives H1(Δ1,∂Δ1;G)=ker⁡(G2→(a,b)↦a+bG); the oriented edge maps to its endpoint difference and generates this kernel. All other relative groups vanish.

1.4givenconstruct

We prove finite support for a compact subset C⊆∣K∣ without making choices from the set of simplices. The weak realization is Hausdorff: every vertex-coordinate function is continuous by testing its restriction on each finite simplex, and distinct points differ in some coordinate. Thus C is closed. For each open simplex σ∘ meeting C and integer m≥1, define Tσ,m=C∩{x∈∣σ∣:αv(x)≥1/m for every v∈σ}. Let mσ be the least m for which this set is nonempty, and put Tσ=Tσ,mσ. Such an integer exists because every coordinate of a point in C∩σ∘ is positive. The set Tσ is closed in the compact finite-dimensional simplex ∣σ∣, hence is nonempty compact, and every point of it remains in σ∘. For each of the finitely many total orders o on the finite vertex set of σ, successively minimize the coordinates in that order on Tσ; finite-dimensional compactness and the extreme-value theorem give a unique lexicographic minimum xσ,o∈Tσ. Define Fσ={xσ,o:o is a total order on σ}. This is a canonically defined nonempty finite subset of C∩σ∘, even though no order on the vertices of K has been chosen.

2.1step 1.2step 1.3ihalgebra

For r≥2 let F be the facet of Δr opposite its first vertex and let Λ be the union of the other facets. Then ∂Δr=F∪Λ and F∩Λ=∂F. Both Δr and Λ are contractible and nonempty: Λ is the cone from the first vertex on ∂F. The pair long exact sequence gives Hk(Δr,Λ;G)=0 for every k. The short exact sequence of relative singular chain complexes 0→C∗(∂Δr,Λ;G)→C∗(Δr,Λ;G)→C∗(Δr,∂Δr;G)→0 therefore gives, by its homology long exact sequence, an isomorphism Hk(Δr,∂Δr;G)→∂Hk−1(∂Δr,Λ;G) for k≥1. The explicit finite-subcomplex excision in step 1.2 identifies the right group with Hk−1(F,∂F;G). By induction from the degree-zero and degree-one computations of step 1.3, the only nonzero relative group is G in degree k=r. Under the two isomorphisms, the affine characteristic simplex [v0,…,vr] maps first to its alternating boundary and then, modulo Λ, to the opposite facet with coefficient +g (up to the fixed orientation sign); the other facets vanish in that quotient. Thus its relative class is exactly a generator, with no appeal to a prior sphere or simplicial comparison. Degree zero vanishes because ∂Δr is nonempty.

2.2step 1.4algebra

Put S=⋃σ∘∩C≠∅Fσ. Each closed simplex ∣τ∣ meets only those Fσ for which σ is a face of τ, and there are finitely many such faces; hence S∩∣τ∣ is finite. The same holds for every subset of S, so every subset of S is closed in the weak topology of ∣K∣. In particular S is closed in the compact space C, hence compact, and it is discrete because its singleton complements are closed. The singleton open cover of a compact discrete space has a finite subcover, so S is finite. The pairwise disjoint nonempty sets Fσ⊆σ∘ therefore occur for only finitely many occupied simplices σ. Their faces form a finite subcomplex containing C. The construction used finite total orders within each simplex only as an indexed finite set, never a simultaneous selection of one order per simplex.

3.1step 1.1step 1.2step 1.3step 2.1ihalgebra

Let K be finite and build it one simplex at a time in a face-respecting order. Suppose L has already been built and the next simplex is σ. Then L∩σ=∂σ. The simplicial relative chain complex of (K,L) is one copy of G in degree dim⁡σ and zero elsewhere. If dim⁡σ>0, the finite-subcomplex excision proved in step 1.2 identifies H∗(∣K∣,∣L∣;G) with H∗(∣σ∣,∣∂σ∣;G). If dim⁡σ=0, then ∣K∣=∣L∣⊔∣σ∣ and its singular relative chain complex is directly the singular complex of the isolated vertex, giving the same relative comparison even when L is empty. Step 1.3 or 2.1 shows that Φ maps the relative simplicial generator to its singular generator. The commuting pair long exact sequences and the five lemma extend the isomorphism from L to K. The empty complex starts the induction.

4.1step 3.1step 2.2

Every singular cycle and every singular chain witnessing a boundary is a finite sum of compact simplex images, so step 2.2 supports each in some finite subcomplex. Simplicial chains already have finite support. The finite comparison from step 3.1 is therefore surjective and injective on the directed union of finite subcomplexes, proving the isomorphism for all K. Finite unions make this directed system choice-free. [step 3.1, step 2.2].

5.1step 1.1step 3.1step 4.1discharge-induction∎

It remains to make the comparison canonical and natural. On a finite complex two vertex orders give chain maps Φ,Ψ agreeing on vertices. Construct a chain homotopy recursively on each oriented simplex σ. If it is already defined on proper faces, the chain z=(Φ−Ψ)(σ)−H(∂σ) is a cycle in the convex ∣σ∣; in degree zero the difference is zero. Coning z to the barycenter of σ gives H(σ) with boundary z (the augmented cone identity also handles a zero-chain of augmentation zero). This is a finite explicit prescription and works G-linearly. Hence different orders induce the same map on homology. For a simplicial map f:K→P, the two chain maps f#ΦK and ΦPf∗ agree on vertices, and their values on σ lie in the convex simplex ∣f(σ)∣. The identical coning induction proves they are chain homotopic, including when f collapses a simplex. On finite subcomplexes this proves order independence and naturality; step 4.1 passes them to arbitrary complexes without selecting orders simultaneously for all finite subcomplexes.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Homology of spheres

Statement

For n≥1, 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 n≥1, whereas H0(S0;G)≅G⊕G.

Facts & Assumptions

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

Proof

technique · direct
1.1givenconstruct

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.

2.1step 1.1algebra

In degree n, exactness for D gives ker⁡∂n=im⁡∂n+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.

3.1step 2.1algebra

The boundary K of the single simplex is finite, so choose an order on its finite vertex set. The characteristic-simplex comparison of Simplicial and singular homology agree sends each vertex with coefficient g to the corresponding singular point with coefficient g; its homology map is independent of this order and commutes with augmentation to G. For either theory, H~0=ker⁡(H0→G), 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 ∣K∣≅Sn, and negative reduced groups are zero by convention.

4.1step 3.1algebra∎

For n≥1, 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)≅G⊕G; its augmentation kernel is {(g,−g):g∈G}. This includes G=0.

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

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 Y∪fX 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.1givenconstruct

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 W≅X×(1/3,2/3); projection p:W→X is a homotopy equivalence, with section at height 1/2. Since X has its specified basepoint, these spaces are nonempty.

2.1step 1.1algebra

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 n≥1, 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.

3.1step 2.1algebra

For n=0, the same exact sequence gives 0→H1(ΣX;G)→δH0(W;G)→(ε,−ε)G⊕G. 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.

4.1step 1.1step 3.1algebra

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.

5.1step 2.1step 3.1step 4.1algebra∎

A based map f:X→Y 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.

5 · Examples, counterexamples and false statements

None yet.

Sources