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.
Finite dimensional axiomatic homology has finite subcomplex support
Statement
For a finite-dimensional CW pair and ordinary , the canonical map is an isomorphism for every integer .
Facts & Assumptions
Given: The objects and hypotheses in the statement above.
For every finite-dimensional CW pair and ordinary theory , there is a canonical isomorphism for every integer , natural for cellular maps. It is the skeletal lift isomorphism described below and commutes with the homology connecting maps of pairs. The number of cells need not be finite. (Finite dimensional skeletal exactness computes axiomatic homology)
For a CW pair , an ordinary theory with coefficient , and chosen cell orientations, the complex is canonically Its differential is the integral incidence matrix acting on . In degree one the entries are signed terminal-minus-initial endpoints. The direct-sum matrices have finite support in each column. (Axiomatic cellular boundaries are integral incidence matrices with coefficients)
If is compact and is continuous into a CW complex, then lies in a finite CW subcomplex of . (The image of a compact space lies in a finite CW subcomplex)
Proof
By F1 and F2, compute each of these groups using its oriented cellular direct-sum complex with coefficients . Subcomplex inclusion preserves the basis cells and their incidence coefficients. The inclusion from a finite subcomplex therefore gives the actual inclusion of its relative cellular chains into those of .
A cycle in the latter complex has finite support. Include the closures of its support cells in a finite CW subcomplex : each closed cell is the compact image of a disk, and F3 places it in a finite subcomplex; a finite union of these remains finite. The cycle equation is unchanged in this subcomplex, so its homology class comes from .
If a class from maps to zero, its representing cycle bounds a finite-support cellular chain in . Enlarge to a finite subcomplex containing the closures of that chain's support cells. There the same boundary equation already witnesses zero. This is exactly injectivity of the colimit map. Finite unions show the indexing collection is directed, with the empty subcomplex included; zero complexes and negative degrees cause no exception.
Depends on
Used by
Dependency tree · two levels
9 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
- May, A Concise Course in Algebraic Topology, 15§2, cellular calculation pp.119–120 (standard reference, not scraped)
- Hatcher, Algebraic Topology, Lemma 2.34 p.138, finite support reasoning (standard reference, not scraped)