Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-09-26 (gpt-6-sol)
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 h with arbitrary additivity and every CW pair (X,A), the canonical map colim⁡i≥0hn(Xi,Ai)⟶hn(X,A) is an isomorphism. So is the canonical colimit over finite subcomplex pairs (K,K∩A) of X. The latter identification is natural for every continuous map of CW pairs.

Facts & Assumptions

Given: The objects and hypotheses in the statement above.

[F1]

Let X=U∪V be a cover by CW subcomplexes and W=U∩V. Every ordinary homology theory has a natural exact sequence ⋯→hn(W)→(i∗,−j∗)hn(U)⊕hn(V)→a∗+b∗hn(X)→Δhn−1(W)→⋯ , where all four maps i,j,a,b are inclusions. The same sequence holds for a CW pair (X,C) covered by (U,C∩U) and (V,C∩V), with the corresponding relative groups. (Ordinary homology theories have mayer vietoris for cw covers)

[F2]

For every CW pair (X,A), the skeletal telescope projection p:(TX,TA)→(X,A) is a homotopy equivalence of pairs. (The skeletal telescope projects by a homotopy equivalence of pairs)

[F3]

For any sequence of abelian groups G0→u0G1→u1⋯, let D=⨁i≥0Gi and let s:D→D send the ith coordinate by ui into coordinate i+1. Then 0⟶D→1−sD⟶colim⁡iGi⟶0 is exact, where the last map sums the canonical maps to the colimit. The maps ui need not be injective. (A sequential abelian colimit is the cokernel of one minus shift)

[F4]

For a finite-dimensional CW pair (X,A) and ordinary h, the canonical map colim⁡K⊂X finite subcomplex hn(K,K∩A)⟶hn(X,A) is an isomorphism for every integer n. (Finite dimensional axiomatic homology has finite subcomplex support)

Proof

1.1F2given

Use the telescope from F2. Subdivide its height intervals at half-integers. Let B0=X0×[0,1], and for i≥1 let Bi=(Xi−1×[i−1/2,i])∪(Xi×[i,i+1]). Even Bi form a disjoint-union subcomplex U, and odd Bi form a disjoint-union subcomplex V; they cover the telescope. Their intersection is the disjoint union Ci=Xi×[i+1/2,i+1]. Each Bi retracts onto Xi at height i, and each Ci onto Xi, with all retractions preserving the corresponding pieces of TA.

2.1F1step 1.1

Apply relative Mayer–Vietoris F1 and arbitrary additivity. After the retractions, the overlap map has from the ith summand the identity into stage i and the inclusion-induced map into stage i+1, with opposite signs. Multiplying each odd-indexed overlap summand by −1, and reordering the target even/odd direct sums by stage, identifies it with 1−s on ⨁ihn(Xi,Ai). These changes of signs leave the outgoing sum map equal to the canonical stage-to-telescope map.

3.1F2F3step 2.1

F3 says 1−s is injective also in degree n−1. Exactness therefore makes the map from the stage direct sum onto telescope homology surjective, with kernel im⁡(1−s). Its cokernel is the sequential colimit by F3. F2 identifies telescope homology with hn(X,A) by the actual projection. Its composite on every stage is the canonical inclusion, so the isomorphism obtained is the claimed canonical map.

4.1F4step 3.1

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.

5.1step 4.1construct∎

Let f:(X,A)→(Y,B) be any continuous map of CW pairs, and write jX and jY for the canonical finite-subcomplex colimit isomorphisms of step 4.1. Define the map between these colimits by jY−1∘f∗∘jX. This is well defined and functorial because jX,jY are canonical isomorphisms and ordinary homology is functorial. On a representative class from a finite subcomplex pair of X, it is exactly the finite-support representative of its image under f∗ in Y furnished by step 4.1. Thus jY composed with this map equals f∗jX, proving the stated naturality for arbitrary maps without requiring a map to preserve skeleta or a finite image subcomplex. 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

11 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