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.
Additivity and compact cell support control the infinite cw colimit
Statement
For every ordinary theory with arbitrary additivity and every CW pair , the canonical map is an isomorphism. So is the canonical colimit over finite subcomplex pairs of . The latter identification is natural for every continuous map of CW pairs.
Facts & Assumptions
Given: The objects and hypotheses in the statement above.
Let be a cover by CW subcomplexes and . Every ordinary homology theory has a natural exact sequence where all four maps are inclusions. The same sequence holds for a CW pair covered by and , with the corresponding relative groups. (Ordinary homology theories have mayer vietoris for cw covers)
For every CW pair , the skeletal telescope projection is a homotopy equivalence of pairs. (The skeletal telescope projects by a homotopy equivalence of pairs)
For any sequence of abelian groups , let and let send the th coordinate by into coordinate . Then is exact, where the last map sums the canonical maps to the colimit. The maps need not be injective. (A sequential abelian colimit is the cokernel of one minus shift)
For a finite-dimensional CW pair and ordinary , the canonical map is an isomorphism for every integer . (Finite dimensional axiomatic homology has finite subcomplex support)
Proof
Use the telescope from F2. Subdivide its height intervals at half-integers. Let , and for let . Even form a disjoint-union subcomplex , and odd form a disjoint-union subcomplex ; they cover the telescope. Their intersection is the disjoint union . Each retracts onto at height , and each onto , with all retractions preserving the corresponding pieces of .
Apply relative Mayer–Vietoris F1 and arbitrary additivity. After the retractions, the overlap map has from the th summand the identity into stage and the inclusion-induced map into stage , with opposite signs. Multiplying each odd-indexed overlap summand by , and reordering the target even/odd direct sums by stage, identifies it with on . These changes of signs leave the outgoing sum map equal to the canonical stage-to-telescope map.
F3 says is injective also in degree . Exactness therefore makes the map from the stage direct sum onto telescope homology surjective, with kernel . Its cokernel is the sequential colimit by F3. F2 identifies telescope homology with by the actual projection. Its composite on every stage is the canonical inclusion, so the isomorphism obtained is the claimed canonical map.
Each skeletal pair is finite-dimensional, so F4 identifies its group with the colimit of the finite subcomplex pairs it contains. Every finite CW subcomplex of X lies in some skeleton, as its finitely many cells have bounded dimensions. Thus the iterated colimit is precisely the colimit over all finite subcomplex pairs, proving that assertion.
A continuous map takes a finite CW subcomplex into a finite subcomplex by compact-cell support, the same fact used in F4. Restrict the map to those finite pairs and use ordinary functoriality; their maps to the full pair commute. Since every class has finite support, this proves naturality for arbitrary maps, without assuming such maps preserve skeleta. Empty X and all zero groups give zero colimits, and all degrees, including negative ones, are covered by the same exact sequences.
Depends on
Used by
Dependency tree · two levels
10 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, 14§6, theorem and telescope proof pp.114–116 (standard reference, not scraped)
- Hatcher, Algebraic Topology, Theorem 3F.8 pp.314–315 (standard reference, not scraped)