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.
Simplicial and singular homology agree
Statement
For every simplicial complex and abelian group , there is a canonical natural isomorphism for all . 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 -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 with weak geometric realization and an abelian group .
Proof
Every finite complex has a total order on its finite vertex set. For a chosen order, the characteristic-simplex homomorphisms give a chain map 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.
We will use finite simplicial-subcomplex excision without invoking the later CW-homology-axioms item. Let be a nonempty subcomplex of a finite . Under the canonical homeomorphism of Barycentric subdivision realizes homeomorphically, the vertices of are the nonempty faces of . They span a full subcomplex of : in any face chain, the faces belonging to form an initial segment because is closed under taking faces. For , let be the sum of its barycentric coordinates at these vertices. This is a continuous function, and is an open neighborhood of . On discard the other coordinates and divide the retained ones by , obtaining a continuous map . In each subdivided simplex the straight-line homotopy stays in that simplex, fixes , and retracts onto it. Thus every such finite pair is a good pair in Good pairs and quotient reduced homology. If finite complexes with , their quotient map-out descriptions give , so inclusion induces an isomorphism on relative singular homology when . The same argument applies to with for , giving . These are exactly the two finite excisions used below.
We compute the singular relative group of an oriented simplex without using any simplicial-to-singular comparison. For , , generated by its vertex. For , the pair sequence of the contractible interval and its two endpoints gives ; the oriented edge maps to its endpoint difference and generates this kernel. All other relative groups vanish.
We prove finite support for a compact subset 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 is closed. For each open simplex meeting and integer , define Let be the least for which this set is nonempty, and put . Such an integer exists because every coordinate of a point in is positive. The set 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 on the finite vertex set of , successively minimize the coordinates in that order on ; finite-dimensional compactness and the extreme-value theorem give a unique lexicographic minimum . Define . This is a canonically defined nonempty finite subset of , even though no order on the vertices of has been chosen.
For let be the facet of opposite its first vertex and let be the union of the other facets. Then and . Both and are contractible and nonempty: is the cone from the first vertex on . The pair long exact sequence gives for every . The short exact sequence of relative singular chain complexes therefore gives, by its homology long exact sequence, an isomorphism for . The explicit finite-subcomplex excision in step 1.2 identifies the right group with . By induction from the degree-zero and degree-one computations of step 1.3, the only nonzero relative group is in degree . Under the two isomorphisms, the affine characteristic simplex maps first to its alternating boundary and then, modulo , to the opposite facet with coefficient (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 is nonempty.
Put . Each closed simplex meets only those for which is a face of , and there are finitely many such faces; hence is finite. The same holds for every subset of , so every subset of is closed in the weak topology of . In particular is closed in the compact space , 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 is finite. The pairwise disjoint nonempty sets therefore occur for only finitely many occupied simplices . Their faces form a finite subcomplex containing . The construction used finite total orders within each simplex only as an indexed finite set, never a simultaneous selection of one order per simplex.
Let be finite and build it one simplex at a time in a face-respecting order. Suppose has already been built and the next simplex is . Then . The simplicial relative chain complex of is one copy of in degree and zero elsewhere. If , the finite-subcomplex excision proved in step 1.2 identifies with . If , then and its singular relative chain complex is directly the singular complex of the isolated vertex, giving the same relative comparison even when 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 to . The empty complex starts the induction.
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 . Finite unions make this directed system choice-free. [step 3.1, step 2.2].
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 is a cycle in the convex ; in degree zero the difference is zero. Coning to the barycenter of gives with boundary (the augmented cone identity also handles a zero-chain of augmentation zero). This is a finite explicit prescription and works -linearly. Hence different orders induce the same map on homology. For a simplicial map , the two chain maps and agree on vertices, and their values on lie in the convex simplex . The identical coning induction proves they are chain homotopic, including when 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.
Depends on
- The degreewise simplicial-to-singular homomorphisms
- The simplicial-to-singular chain map commutes with boundaries
- The long exact sequence in homology
- Long exact sequence of a pair
- Good pairs and quotient reduced homology
- Barycentric subdivision realizes homeomorphically
- Five lemma for a morphism of long exact sequences
- In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- The geometric realization of an abstract simplicial complex
Used by
- Homology of spheres Corollary
- Degree of a coordinate reflection on a sphere Example
- A geodesically convex cover has the homotopy type of its nerve Lemma
- Oriented simplex comparison for an ordinary homology theory Lemma
- Top de Rham integration equals fundamental-class evaluation Lemma
- Discrete de Rham cohomology and contractible-mesh exactness Theorem
Dependency tree · two levels
73 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Allen Hatcher, Algebraic Topology, Example 2.23 and Theorem 2.27, pp. 125, 128–130 (standard reference, not scraped)