Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 skeletal exactness computes axiomatic homology

Statement

For every finite-dimensional CW pair (X,A) and ordinary theory h, there is a canonical isomorphism hn(X,A)Hn(Ch(X,A)) for every integer n, 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.

Facts & Assumptions

Given: The objects and hypotheses in the statement above.

[F1]

For a CW pair (X,A) and an ordinary theory h with coefficient G, put F1=A and Fr=AXr for r0. Set Crh(X,A)=hr(Fr,Fr1)(r0),Crh=0(r<0). Each Crh is the direct sum of copies of G indexed by the relative r-cells. Define d0=0 and for r1 let dr be the triple boundary to hr1(Fr1,A) followed by its map to hr1(Fr1,Fr2). Then dr1dr=0, naturally for cellular maps of CW pairs. (Any ordinary homology theory has a cellular chain complex on a cw pair)

Proof

1.1

Use the filtration and notation of F1. Write Eqr=hq(Fr,A). The triple sequence and concentration of hq(Fr,Fr1) in degree r give Eqr=0 for q<0 or q>r, inductively from Eq1=0. They also give Eqr1Eqr an isomorphism for q<r1, and a surjection for q=r1. Since the filtration terminates, Enn+1hn(X,A), taking Fr=X above the top dimension.

F1
2.1

For n0, ρn:EnnCnh is injective since Enn1=0. Likewise ρn1:En1n1Cn1h is injective when n1. Exactness then yields ρn(Enn)=kerdn; for n=0 this says E00=C0h since E1=0.

F1step 1.1
3.1

The surjection i:EnnEnn+1 has kernel imδn+1. Since ρnδn+1=dn+1, define α(x)=[ρn(y)] for any lift i(y)=x. Two lifts differ by a δn+1 image, so the class is independent. Every cycle is ρn(y) by the preceding step, giving surjectivity. If ρn(y)=dn+1(z), injectivity of ρn implies y=δn+1(z) and hence x=0, proving injectivity.

F1step 2.1
4.1

Every map of the filtered exact diagrams carries a lift to a lift and commutes with ρ,δ,i, so it commutes with α. This proves cellular naturality and uniqueness of the isomorphism defined by the lift rule. For pair boundaries use the same construction on the cofiber sequence A+X+X+/A+ΣA+. Give each suspension cell the cone orientation. Its cellular chain group in degree n+1 is the reduced degree-n group of A+, and its boundary is the suspended boundary with the cone sign convention. The cofiber map sends a relative cellular cycle represented by a chain c of X to the suspended class of dcCn1h(A): the faces outside A cancel because c was a relative cycle. In the exact diagram this is exactly the triple connecting map. Desuspending therefore identifies the axiomatic pair boundary with the chain connecting map [c][dc]. The lift construction commutes with suspension because its ρ and δ maps do.

F1step 3.1
5.1

The direct-sum decomposition by relative cells splits 0Ch(A)Ch(X)Ch(X,A)0 degreewise, so the preceding chain-boundary formula is defined for arbitrary G, without a flatness assumption. Negative degrees are zero by the first step. Empty pairs and pairs with no relative cells give zero on both sides.

F1step 1.1step 4.1

Depends on

Used by

Dependency tree · two levels

4 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