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.

17 results · all verified · 14 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 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Singular Chains and Singular Homology

1 · Prerequisites

2 · Summary

This page replaces a chosen triangulation by the full singular chain complex built from all continuous simplices. The route stays deliberately tight: it establishes the boundary complex, functoriality, reduced homology, the interpretation of H0, prism-operator homotopy invariance, and only the chain-level seams for cross products and the comparison with simplicial chains.

Subdivision, excision, and the full simplicial-versus-singular comparison theorem are deferred to the next algebraic-topology page so the chain-level prism argument remains visible here.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

The standard topological simplex and its affine face maps

Definition

For each integer n0, the standard topological n-simplex is Δn:={(t0,,tn)Rn+1:ti0 for all i, i=0nti=1}, with the subspace topology from Rn+1. Its vertices are the standard basis vectors v0,,vn.

For n1 and 0in, the ith affine face map δi:Δn1Δn is the continuous affine map that inserts a zero in the ith coordinate: δi(t0,,tn1)=(t0,,ti1,0,ti,,tn1). Equivalently, δi carries the vertex vk of Δn1 to vk for k<i and to vk+1 for ki, so its image is the face opposite the vertex vi.

For n=0 there are no face maps because Δ1 is not part of the chain-level indexing used on this page.

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

The affine face maps satisfy the cosimplicial identities

Statement

For every n2 and every pair of integers 0i<jn, the affine face maps of The standard topological simplex and its affine face maps satisfy δjδi=δiδj1:Δn2Δn.

Facts & Assumptions

Given: An integer n2 and indices 0i<jn.

[L1]

For n1, the face map δk:Δn1Δn inserts a zero in the kth coordinate (The standard topological simplex and its affine face maps).

Proof

technique · direct
1.1

Let t=(t0,,tn2)Δn2. By [L1], the composite δjδi(t) is obtained by first inserting 0 in slot i and then inserting 0 in slot j. Since i<j, the second insertion happens strictly to the right of the first one, so the resulting (n+1)-tuple has zeros exactly in positions i and j.

L1given
2.1

Again by [L1], the composite δiδj1(t) first inserts 0 in slot j1 and then inserts 0 in slot i. After the second insertion, the earlier zero has shifted one place to the right, so the final tuple also has zeros exactly in positions i and j, with every other coordinate of t appearing in the same relative order as in step 1.1. Therefore the two composites agree coordinatewise.

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

Singular simplices and singular chain groups with coefficients

Definition

Let X be a topological space. For each integer n0, a singular n-simplex in X is a continuous map σ:ΔnX from the standard topological simplex of The standard topological simplex and its affine face maps. Write Sn(X) for the set of all singular n-simplices in X.

The singular chain group with integer coefficients is the free abelian group on Sn(X): Cn(X;Z):=σSn(X)Z[σ]. Thus an element of Cn(X;Z) is a finite formal sum k=1makσk,akZ, σkSn(X).

If G is an abelian group, the singular chain group with coefficients in G is Cn(X;G):=Cn(X;Z)ZG, using the tensor product of The tensor product MRN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums. The page's convention is that coefficients are attached through this tensor-product construction, not by choosing a preferred G-basis of singular simplices.

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

The singular boundary operator

Definition

Let X be a topological space and let n1. For a singular n-simplex σ:ΔnX, its singular boundary is nσ:=i=0n(1)iσδiCn1(X;Z), where the δi are the affine face maps from Singular simplices and singular chain groups with coefficients.

Extend this formula Z-linearly to a homomorphism n:Cn(X;Z)Cn1(X;Z). For coefficients in an abelian group G, the boundary on Cn(X;G) is the tensor extension nidG:Cn(X;G)Cn1(X;G), again denoted n.

The degree-zero boundary is the zero map 0:C0(X;G)0, and for negative indices the chain groups are taken to be zero.

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

The singular boundary squares to zero

Statement

For every topological space X, every abelian group G, and every integer n1, n1n=0:Cn(X;G)Cn2(X;G). In degree 0, the boundary is already the zero map.

Facts & Assumptions

Given: A topological space X, an abelian group G, and an integer n0.

[L1]

The singular boundary is the alternating sum of affine face restrictions (The singular boundary operator).

[L2]

For i<j, the affine face maps satisfy δjδi=δiδj1 (The affine face maps satisfy the cosimplicial identities).

Proof

technique · direct
1.1

If n=0, then 0=0 by [L1], so the degree-zero boundary is already zero. If n=1 and σ:Δ1X is a singular 1-simplex, then 01σ=0(σδ0σδ1)=0, again because 0=0. Thus the claim holds in the two low degrees.

L1given
1.2

Assume n2 and let σ:ΔnX be a singular n-simplex. Expanding twice with [L1] gives n1nσ=i=0nj=0n1(1)i+jσδiδj. Reindex the terms by pairs 0j<in and 0ijn1. By [L2], the term σδiδj with j<i equals σδjδi1, but the two appearances carry opposite signs because (1)i+j=(1)j+(i1). Hence every codimension-two face occurs twice with opposite coefficients, so the whole sum is zero.

L1L2givenalgebra
2.1

Since singular simplices generate Cn(X;Z) and the coefficient version is obtained by tensor extension, steps 1.1 and 1.2 imply n1n=0 on Cn(X;G) for every n1, with degree 0 handled separately in step 1.1.

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

The singular chain complex and singular homology

Definition

For a topological space X and an abelian group G, the singular chain groups and boundary maps of The singular boundary operator form the singular chain complex C(X;G):=(Cn(X;G)nCn1(X;G)), because The singular boundary squares to zero gives n1n=0.

Its degree-n cycles and boundaries are Znsing(X;G):=kern,Bnsing(X;G):=imn+1, in the sense of Cycle and boundary subobjects of a complex.

The nth singular homology group is the homology object of this chain complex: Hnsing(X;G):=Znsing(X;G)/Bnsing(X;G), equivalently Hn(C(X;G)) in the notation of Homology object of a chain complex. When the coefficient group is Z, write simply Cn(X) and Hn(X) when no confusion can arise.

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

The induced singular chain map of a continuous map

Definition

Let f:XY be a continuous map of topological spaces. For each n0, the induced singular chain map in degree n is the homomorphism f#,n:Cn(X;Z)Cn(Y;Z) defined on a singular simplex σ:ΔnX by f#,n(σ):=fσ, and extended Z-linearly.

For coefficients in an abelian group G, tensor with idG to obtain f#,n:Cn(X;G)Cn(Y;G). The family (f#,n)n0 is denoted f#:C(X;G)C(Y;G).

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

Induced singular chain maps commute with boundaries

Statement

If f:XY is continuous, then for every n1 and every abelian group G, nf#,n=f#,n1n:Cn(X;G)Cn1(Y;G). In degree 0, both composites from C0(X;G) to 0 are the zero map.

Facts & Assumptions

Given: A continuous map f:XY, an abelian group G, and an integer n0.

[L1]

The induced map sends a singular simplex σ to the composite fσ (The induced singular chain map of a continuous map).

[L2]

The singular boundary is the alternating sum of the affine face restrictions (The singular boundary operator).

Proof

technique · direct
1.1

If n=0, then 0=0 by [L2], so both composites from C0(X;G) to 0 are the zero map.

L2given
1.2

Assume n1 and let σ:ΔnX be a singular n-simplex. By [L1] and [L2], nf#,n(σ)=i=0n(1)i(fσ)δi=i=0n(1)if(σδi). The same formulas give f#,n1n(σ)=f#,n1(i=0n(1)iσδi)=i=0n(1)if(σδi), so the two values agree on every singular simplex.

L1L2givenalgebra
2.1

Singular simplices generate Cn(X;Z), and the coefficient-G map is the tensor extension of the integer-coefficient map. Therefore step 1.2 proves the identity for every n1, while step 1.1 handles degree 0.

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

Singular chains and singular homology are covariantly functorial

Statement

For each abelian group G, the assignments XC(X;G),ff# and XHnsing(X;G),fHn(f#) define covariant functors from topological spaces to chain complexes and to abelian groups, respectively. Equivalently, idX,#=idC(X;G),(gf)#=g#f#, and for every n0, Hn((gf)#)=Hn(g#)Hn(f#),Hn(idX,#)=idHn(X;G).

Facts & Assumptions

Given: An abelian group G and continuous maps f:XY and g:YZ.

[L1]

The induced singular chain map sends a singular simplex σ to fσ (The induced singular chain map of a continuous map).

[L2]

Induced singular chain maps commute with the singular boundaries (Induced singular chain maps commute with boundaries).

[L3]

Homology sends identity chain maps to identity maps and composite chain maps to composite homology maps (Homology respects identities and composition).

Proof

technique · direct
1.1

For every singular simplex σ in X, [L1] gives idX,#(σ)=idXσ=σ and (gf)#(σ)=(gf)σ=g(fσ)=g#(f#(σ)). By linearity, idX,# is the identity chain map and (gf)#=g#f# on singular chains.

L1given
2.1

By [L2], every induced map f# is a chain map. Therefore step 1.1 gives identity and composition laws in the category of chain complexes, and [L3] transfers those same laws to singular homology in each degree.

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

Augmentation at 0-simplices and reduced singular homology

Definition

Let X be a topological space and let G be an abelian group. The augmentation at 0-simplices is the homomorphism εX:C0(X;G)G defined by εX(σg)=g for every singular 0-simplex σ:Δ0X, and extended linearly.

The reduced singular chain complex C~(X;G) is obtained from the singular chain complex by replacing degree 0 with the kernel of the augmentation: C~n(X;G):={Cn(X;G),n1,kerεX,n=0,0,n<0. Its differential is the singular boundary in degrees 1 and the zero map C~0(X;G)0 in degree 0.

The reduced singular homology groups are H~nsing(X;G):=Hn(C~(X;G)). For the empty space, this convention leaves C~0(;G)=0, so H~nsing(;G)=0 for all n0.

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

The singular augmentation commutes with the boundary

Statement

For every topological space X and every abelian group G, εX1=0:C1(X;G)G. Consequently im1kerεX, so the reduced singular chain complex of Augmentation at 0-simplices and reduced singular homology is well defined.

Facts & Assumptions

Given: A topological space X and an abelian group G.

[L1]

The augmentation sends every 0-simplex tensor g to g (Augmentation at 0-simplices and reduced singular homology).

[L2]

The singular boundary of a 1-simplex is the terminal 0-face minus the initial 0-face (The singular boundary operator).

Proof

technique · direct
1.1

Let σ:Δ1X be a singular 1-simplex and let gG. By [L2], 1(σg)=(σδ0)g(σδ1)g. Applying [L1] gives εX1(σg)=gg=0.

L1L2givenalgebra
2.1

The generators σg span C1(X;G), so step 1.1 proves εX1=0 on all of C1(X;G). Therefore every 1-boundary lies in kerεX, which is exactly the compatibility needed in degree 0 for the reduced chain complex.

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

Zero-th singular homology is free on path components

Statement

For every topological space X, H0sing(X;Z)Cπ0path(X)ZeC, the free abelian group on the path components of X.

Facts & Assumptions

Given: A topological space X.

[L1]

Singular homology in degree 0 is Z0(X;Z)/B0(X;Z), and the reduced complex uses the augmentation kernel in degree 0 (The singular chain complex and singular homology, Augmentation at 0-simplices and reduced singular homology).

[L2]

A path component is the equivalence class of the path relation (Paths, path-connected spaces and path components).

Proof

technique · direct
1.1

Let Φ:C0(X;Z)Cπ0path(X)ZeC send each singular 0-simplex σ to the basis vector indexed by the path component of its unique image point. If τ:Δ1X is a singular 1-simplex, then the map sτ(1s,s) is a path in X from the image point of τδ1 to the image point of τδ0. Hence Φ(1τ)=0, so Φ kills B0(X;Z) and descends to a homomorphism Φ:H0sing(X;Z)Cπ0path(X)ZeC.

L1L2given
2.1

The map Φ is surjective: if X= there is nothing to prove, and otherwise any finite sum k=1makeCk is the image of the 0-cycle k=1makσk, where σk is any singular 0-simplex landing at a chosen point of Ck.

step 1.1L2
2.2

Let z=k=1makσk be a 0-cycle with Φ([z])=0. For each path component that meets the finite support of z, choose one base point simplex σC. Since Φ([z])=0, the total coefficient in each such component is zero. If σk and σC lie in the same path component, [L2] gives a path γk:IX from the image point of σk to the image point of σC. Define the singular 1-simplex γk:Δ1X by γk(t0,t1)=γk(t1). Then 1γk=σCσk. Therefore [z]=C(σkCak)[σC]=0 in H0sing(X;Z). Thus Φ is injective.

L1L2step 1.1algebra
3.1

Steps 2.1 and 2.2 show that Φ is an isomorphism, so H0sing(X;Z) is free on the path components of X.

step 2.1step 2.2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-05Open item page →

Path-connected spaces have zero reduced zero-th homology

Statement

If X is nonempty and path-connected, then H~0sing(X;Z)=0.

Facts & Assumptions

Given: A nonempty path-connected topological space X.

[L1]

H0sing(X;Z) is the free abelian group on the path components of X (Zero-th singular homology is free on path components).

[L2]

Reduced degree-zero singular homology is the homology of the augmentation kernel in degree 0 (Augmentation at 0-simplices and reduced singular homology).

[L3]

Every singular 1-boundary lies in the augmentation kernel (The singular augmentation commutes with the boundary).

Proof

technique · direct
1.1

Since X is nonempty and path-connected, it has exactly one path component. By [L1], H0sing(X;Z)Z.

L1given
2.1

Let z=k=1makσkC0(X;Z). Under the isomorphism of step 1.1, the class [z] maps to k=1makZ, which is exactly εX(z). Therefore zkerεX if and only if [z]=0 in H0sing(X;Z), equivalently if and only if zB0(X;Z). By [L3], every 0-boundary lies in kerεX, so kerεX=B0(X;Z).

L3step 1.1algebra
3.1

By [L2], reduced degree-zero homology is H~0sing(X;Z)=kerεX/im1=kerεX/B0(X;Z)=0.

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

The singular homology of a disjoint union is the direct sum

Statement

Let X=αAXα be a disjoint union of topological spaces, and let G be an abelian group. Then for every n0, Hnsing(X;G)αAHnsing(Xα;G).

Facts & Assumptions

Given: A disjoint union X=αAXα, an abelian group G, and an integer n0.

[L1]

Singular homology is computed from the singular chain complex (The singular chain complex and singular homology).

Proof

technique · direct
1.1

The standard simplex Δn is path-connected: if u=(u0,,un) and v=(v0,,vn) are points of Δn, the straight-line map t(1t)u+tv stays in Δn. Therefore any singular simplex σ:ΔnX has connected image. Since the sets Xα are pairwise disjoint and clopen by [L2], the image of σ lies in exactly one summand Xα.

L2given
2.1

Step 1.1 identifies Cn(X;G) with the direct sum of the chain groups Cn(Xα;G), degree by degree, and the singular boundary preserves the chosen summand because each face of a simplex in Xα still lands in Xα. Thus C(X;G)αAC(Xα;G) as chain complexes.

L1step 1.1
3.1

Cycles and boundaries of a direct-sum chain complex are taken componentwise, so homology also splits componentwise. Applying [L1] to the chain-complex isomorphism of step 2.1 yields Hnsing(X;G)αAHnsing(Xα;G).

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

The prism operator of a homotopy

Definition

Let H:X×IY be a homotopy from f to g in the sense of Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints. For each singular n-simplex σ:ΔnX, write σ×idI:Δn×IX×I,(u,t)(σ(u),t).

For each 0in, let λi:Δn+1Δn×I be the affine map sending the vertices of Δn+1 to (v0,0),,(vi,0),(vi,1),(vi+1,1),,(vn,1). In barycentric coordinates this is λi(t0,,tn+1)=(s0,,sn, ti+1++tn+1), where sk={tk,k<i,ti+ti+1,k=i,tk+1,k>i.

The prism operator determined by H is the degree-1 homomorphism PH:Cn(X;Z)Cn+1(Y;Z) defined on a singular simplex by PH(σ):=i=0n(1)iH(σ×idI)λi, and extended linearly. For coefficients in an abelian group G, tensor with idG to obtain PH:Cn(X;G)Cn+1(Y;G).

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

The prism triangulation has the stated oriented boundary

Statement

Fix n0. Let ι0,ι1:ΔnΔn×I be the bottom and top inclusions, ιε(u)=(u,ε). Let Πn:=i=0n(1)iλiCn+1(Δn×I;Z), with the simplices λi from The prism operator of a homotopy. Then Πn=ι1ι0j=0n(1)j(δj×idI)#Πn1, where the last sum is omitted when n=0.

Facts & Assumptions

Given: An integer n0.

[L1]

The prism simplices λi are the simplices of the standard triangulation of Δn×I (The prism operator of a homotopy).

[L2]

The singular boundary is the alternating sum of the codimension-one faces (The singular boundary operator).

Proof

technique · direct
1.1

If n=0, then Π0=λ0 is the oriented edge from (v0,0) to (v0,1), so [L2] gives Π0=ι1ι0. This is exactly the displayed formula with no side-prism sum.

L1L2given
1.2

Assume n1. By [L2], each λi is the alternating sum of its n+2 codimension-one faces. The face opposite (v0,0) in λ0=[(v0,0),(v0,1),,(vn,1)] is the top face ι1, and the face opposite (vn,1) in λn=[(v0,0),,(vn,0),(vn,1)] is the bottom face ι0. For each 1in, the face of λi opposite (vi,0) is the same n-simplex as the face of λi1 opposite (vi1,1), so these interior faces occur twice in i=0n(1)iλi with opposite total signs and cancel.

L1L2given
2.1

The remaining uncancelled faces are the top face ι1 from λ0, the bottom face ι0 from λn, and the side faces obtained by deleting one vertex vj of Δn. For each fixed j, those side faces are exactly the prism simplices in the standard triangulation of δj(Δn1)×I, and comparing the induced vertex order with the definition of Πn1 gives the total contribution (1)j(δj×idI)#Πn1. Summing over j and combining with steps 1.1 and 1.2 yields the stated boundary formula.

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

The singular chain homotopy formula

Statement

Let H:X×IY be a homotopy from f to g. Then the prism operator PH of The prism operator of a homotopy satisfies g#f#=PH+PH as homomorphisms Cn(X;G)Cn(Y;G) for every n1 and every abelian group G. In degree 0, the same identity reduces to g#,0f#,0=PH:C0(X;G)C0(Y;G).

Facts & Assumptions

Given: A homotopy H:X×IY from f to g, an abelian group G, and an integer n0.

[L1]

The prism operator is PH(σ)=i=0n(1)iH(σ×idI)λi on a singular n-simplex σ (The prism operator of a homotopy).

[L2]

The prism chain Πn=(1)iλi has boundary Πn=ι1ι0j=0n(1)j(δj×idI)#Πn1 (The prism triangulation has the stated oriented boundary).

[L3]

The induced singular map of a continuous map is obtained by postcomposition on singular simplices (The induced singular chain map of a continuous map).

[L4]

The singular boundary is the alternating sum of affine face restrictions (The singular boundary operator).

Proof

technique · direct
1.1

If n=0 and σ:Δ0X is a singular 0-simplex, then [L2] gives Π0=ι1ι0. Composing with H(σ×idI) and using [L1] and [L3] yields PH(σ)=g#(σ)f#(σ).

L1L2L3given
1.2

Assume n1 and let σ:ΔnX be a singular n-simplex. Compose the boundary formula [L2] with the continuous map H(σ×idI):Δn×IY. By [L1] and [L3], the image of Πn is PH(σ), the image of ι1 is g#(σ), and the image of ι0 is f#(σ).

L1L2L3given
2.1

Again using [L1], [L3], and [L4], the image of the side-prism term j=0n(1)j(δj×idI)#Πn1 under H(σ×idI) is exactly PH(σ). Therefore step 1.2 becomes PH(σ)=g#(σ)f#(σ)PH(σ), or equivalently g#(σ)f#(σ)=PH(σ)+PH(σ).

L1L3L4step 1.2algebra
3.1

Singular simplices generate Cn(X;Z), and the coefficient-G version is obtained by tensor extension, so step 2.1 holds on all chains for every n1, while step 1.1 handles degree 0. Hence the stated identities hold in all degrees.

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

Homotopic maps induce the same map on singular homology

Statement

If f,g:XY are homotopic continuous maps, then for every n0 and every abelian group G the induced homomorphisms on singular homology agree: Hn(f#)=Hn(g#):Hnsing(X;G)Hnsing(Y;G).

Facts & Assumptions

Given: A homotopy between continuous maps f,g:XY, an abelian group G, and an integer n0.

[L1]

The prism operator of a homotopy satisfies g#f#=PH+PH (The singular chain homotopy formula).

[L2]

A family sn with gnfn=dn+1sn+sn1dn is a chain homotopy (A chain homotopy).

[L3]

Chain-homotopic chain maps induce the same map on homology (Chain-homotopic maps induce the same map on homology).

Proof

technique · direct
1.1

Extend the prism operator by PH,1=0 on the zero group C1(X;G). By [L1], f#g#=(PH)+(PH), so the family PH satisfies the defining identity of [L2] for a chain homotopy from f# to g#. Thus the two induced singular chain maps are chain-homotopic.

L1L2givenconstruct
2.1

Applying [L3] to the singular chain complex yields Hn(f#)=Hn(g#) for every n0.

L3step 1.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-05Open item page →

Homotopy equivalences induce isomorphisms on singular homology

Statement

If f:XY is a homotopy equivalence, then for every n0 and every abelian group G the induced map Hn(f#):Hnsing(X;G)Hnsing(Y;G) is an isomorphism.

Facts & Assumptions

Given: A homotopy equivalence f:XY, an abelian group G, and an integer n0.

[L1]

A homotopy equivalence has a homotopy inverse g:YX (Homotopy equivalences, homotopy inverses and spaces of the same homotopy type).

[L2]

Singular homology is functorial for identities and composites (Singular chains and singular homology are covariantly functorial).

[L3]

Homotopic maps induce the same map on singular homology (Homotopic maps induce the same map on singular homology).

Proof

technique · direct
1.1

By [L1], choose a homotopy inverse g:YX with gfidX and fgidY. Applying [L3] gives Hn((gf)#)=idHn(X;G),Hn((fg)#)=idHn(Y;G).

L1L3given
2.1

By [L2], Hn((gf)#)=Hn(g#)Hn(f#),Hn((fg)#)=Hn(f#)Hn(g#). Combining this with step 1.1 shows that Hn(g#) and Hn(f#) are two-sided inverses. Hence Hn(f#) is an isomorphism.

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

Contractible nonempty spaces have the homology of a point

Statement

If X is a nonempty contractible topological space, then for every n0 and every abelian group G, Hnsing(X;G)Hnsing(;G), where denotes a one-point space.

Facts & Assumptions

Given: A nonempty contractible topological space X, an abelian group G, and an integer n0.

[L1]

For a nonempty space, contractibility is equivalent to the identity map being nullhomotopic (A nonempty space is contractible if and only if its identity map is nullhomotopic).

[L2]

A map that is homotopic to a constant map is nullhomotopic, and a space is contractible exactly when every map out of it is nullhomotopic (Nullhomotopic maps and contractible spaces).

[L3]

Homotopy equivalences induce isomorphisms on singular homology (Homotopy equivalences induce isomorphisms on singular homology).

Proof

technique · direct
1.1

By [L1], the identity map on X is homotopic to the constant map at some point x0X. Let p:X be the unique map and let i:X send the point of to x0. Then ip is the constant map at x0, so ipidX, while pi=id. Hence X is homotopy equivalent to a point.

L1L2given
2.1

Apply [L3] to the map p:X. It induces an isomorphism on every singular homology group, which is exactly the displayed conclusion.

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

Singular homology is invariant under deformation retracts

Statement

If A is a deformation retract of a topological space X, then for every n0 and every abelian group G the inclusion i:AX induces an isomorphism Hnsing(i#):Hnsing(A;G)Hnsing(X;G).

Facts & Assumptions

Given: A deformation retract inclusion i:AX, an abelian group G, and an integer n0.

[L2]

Homotopy equivalences induce isomorphisms on singular homology (Homotopy equivalences induce isomorphisms on singular homology).

Proof

technique · direct
1.1

By [L1], the inclusion i is a homotopy equivalence.

L1given
2.1

Applying [L2] to i gives the displayed isomorphism on singular homology in every degree.

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

The singular chain cross product on generators

Definition

Let σ:ΔpX and τ:ΔqY be singular simplices. A (p,q)-shuffle is a permutation θ of {1,,p+q} such that θ(1)<<θ(p)andθ(p+1)<<θ(p+q). Each shuffle determines a monotone lattice path from (0,0) to (p,q), hence an affine simplex λθ:Δp+qΔp×Δq whose vertices are the successive vertices of that path in the product simplex.

The singular chain cross product on generators is σ×τ:=θSh(p,q)sgn(θ)(σ×τ)λθCp+q(X×Y;Z), where σ×τ:Δp×ΔqX×Y is the product map.

Extend bilinearly to ×:Cp(X;Z)×Cq(Y;Z)Cp+q(X×Y;Z). For p=0 or q=0, this agrees with the evident product of a point simplex and an arbitrary simplex.

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

The singular chain cross product satisfies the boundary formula

Statement

For singular chains aCp(X;Z) and bCq(Y;Z), (a×b)=a×b+(1)pa×b. When p=0, the first term is omitted; when q=0, the second term is omitted.

Facts & Assumptions

Given: Singular chains aCp(X;Z) and bCq(Y;Z).

[L1]

The chain cross product is the alternating shuffle sum on singular simplex generators (The singular chain cross product on generators).

[L2]

The singular boundary is the alternating sum of codimension-one faces (The singular boundary operator).

Proof

technique · direct
1.1

By bilinearity from [L1], it is enough to prove the formula for generators a=σ and b=τ, where σ:ΔpX and τ:ΔqY are singular simplices.

L1given
2.1

If p=0, there is one (0,q)-shuffle, and the cross product is the evident product of the point simplex σ with τ. Restricting it to any face of Δq gives the product of σ with the corresponding face of τ, so (σ×τ)=σ×τ. The same argument with the factors reversed gives (σ×τ)=σ×τ when q=0. These are the stated formulas in the two boundary cases. Hence it remains to assume p,q>0.

L1L2step 1.1algebra
2.2

Expand (σ×τ) with [L1] and [L2]. A face deletes a vertex of a shuffle path. If the deleted vertex is internal and its two adjacent steps have different directions, the resulting diagonal face is shared by the shuffle obtained by interchanging those two steps. The two shuffles have opposite permutation signs, while the face occurs in the same boundary position, so these internal faces cancel in pairs.

L1L2step 1.1algebra
3.1

Under the remaining assumption p,q>0, the uncancelled faces lie on the boundary of Δp×Δq. For the face in iΔp×Δq, deleting the corresponding horizontal coordinate gives the shuffle chain for (p1,q) with boundary sign (1)i. For the face in Δp×jΔq, the p horizontal directions precede the boundary sign (1)j, giving the total sign (1)p+j. Consequently the universal shuffle chain satisfies EZp,q=i=0p(1)i(δi×1)#EZp1,q+(1)pj=0q(1)j(1×δj)#EZp,q1. Postcomposing with σ×τ gives (σ×τ)=σ×τ+(1)pσ×τ.

L1L2step 2.1step 2.2algebra
4.1

Step 3.1 extends by bilinearity to the stated formula for arbitrary integral chains a and b.

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

Singular chain cross products are natural

Statement

If f:XX and g:YY are continuous maps, then for singular chains aCp(X;Z) and bCq(Y;Z), (f×g)#(a×b)=f#(a)×g#(b).

Facts & Assumptions

Given: Continuous maps f:XX and g:YY, and singular chains aCp(X;Z) and bCq(Y;Z).

[L1]

The chain cross product is the alternating shuffle sum on generators (The singular chain cross product on generators).

[L2]

The induced singular chain map is postcomposition on each singular simplex (The induced singular chain map of a continuous map).

Proof

technique · direct
1.1

By bilinearity from [L1], it is enough to prove the identity for generators a=σ and b=τ. For each shuffle simplex λθ, [L2] gives (f×g)#((σ×τ)λθ)=((fσ)×(gτ))λθ.

L1L2given
2.1

Summing the equality of step 1.1 over all shuffles with the same signs as in [L1] yields (f×g)#(σ×τ)=(f#σ)×(g#τ). Extending bilinearly gives the formula for arbitrary integral chains.

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

The affine characteristic singular simplex of an ordered simplex

Definition

Let σ=[v0,,vn] be an n-simplex of an abstract simplicial complex K together with an ordering of its vertices. Its geometric realization σ is the simplex in K spanned by those vertices (The geometric realization of an abstract simplicial complex).

The affine characteristic singular simplex of σ is the unique affine map χσ:ΔnK that sends the vertex vi of the standard simplex (The standard topological simplex and its affine face maps) to the vertex vi of σ for each i. Its image is exactly σ.

Changing the chosen ordering by a permutation π precomposes χσ with the affine self-map of Δn that permutes its vertices by π. Different orderings therefore generally give different singular simplices, and the comparison map below removes this ambiguity by fixing a global vertex order on the simplicial complex.

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

The degreewise simplicial-to-singular homomorphisms

Definition

Let K be an abstract simplicial complex whose vertex set is equipped with a total order. For each oriented n-simplex τ of K, let [v0<<vn] be the increasing ordering of its vertices and let ε(τ){±1} be the sign for which τ=ε(τ)[v0,,vn] in the simplicial chain group from Simplicial chain groups and the boundary operator. For each n0, the simplicial-to-singular homomorphism Φn:Cnsimp(K)Cnsing(K;Z) is defined on an oriented simplex τ by Φn(τ):=ε(τ)χ[v0,,vn], where χ[v0,,vn] is the affine characteristic singular simplex from The affine characteristic singular simplex of an ordered simplex, and then extended linearly.

Because the increasing representative of each simplex is unique, the sign ε(τ) is well defined. Thus Φn is a well-defined homomorphism with no ambiguity from reordering the vertices. The next lemma proves that the family (Φn) commutes with the two boundaries and hence is a chain map.

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

The simplicial-to-singular chain map commutes with boundaries

Statement

For every simplicial complex K equipped with a total order on its vertices and every n1, singΦn=Φn1simp:Cnsimp(K)Cn1sing(K;Z). In degree 0, both boundaries are zero maps to 0.

Facts & Assumptions

Given: A simplicial complex K with a total order on its vertices and an integer n0.

[L1]

Φn sends an oriented simplex to the sign of its increasing representative times the corresponding affine characteristic singular simplex (The degreewise simplicial-to-singular homomorphisms).

[L2]

The singular boundary is the alternating sum of affine face restrictions (The singular boundary operator).

[L3]

The simplicial boundary is the alternating sum of the oriented codimension-one faces (Simplicial chain groups and the boundary operator).

Proof

technique · direct
1.1

If n=0, then both sing and simp are zero maps in degree 0, so the degree-zero claim is immediate.

L2L3given
1.2

Assume n1 and let σ=[v0,,vn] be the increasing representative of an oriented simplex of K. By [L1], the singular chain Φn(σ) is the affine characteristic simplex χ[v0,,vn]. Restricting along the face map δi therefore produces the affine characteristic simplex of the face [v0,,v^i,,vn], listed in the induced increasing order.

L1given
2.1

Applying [L2] and [L3] to step 1.2 gives singΦn(σ)=i=0n(1)iΦn1([v0,,v^i,,vn])=Φn1simp(σ) for the increasing representative. The same overall orientation sign ε(τ) from [L1] multiplies both sides for an arbitrary oriented simplex τ, so the identity holds on every generator and hence on all simplicial chains by linearity; step 1.1 handles degree 0.

L1L2L3step 1.1step 1.2algebra

5 · Examples, counterexamples and false statements

None yet.

Sources