Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-09-24 (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.

Relative homology of consecutive CW skeleta

Statement

For any abelian group G, Hk(Xn,Xn−1;G) is 0 for k≠n and is naturally ⨁eαnG for k=n.

Facts & Assumptions

Given: A CW complex X and an integer n≥0.

[F1]

CW skeleta are subcomplexes, and collapsing Xn−1 in Xn identifies each attached n-disk boundary with the quotient basepoint (Skeleta, CW subcomplexes, and relative CW complexes, CW skeleta are closed and cells form a disjoint partition).

[F2]

A continuous image of a compact space in a CW complex lies in a finite CW subcomplex, without any choice premise (Compact CW images have finite cell support without choice).

[F3]

If a nonempty closed subspace A deformation retracts from an open neighborhood in Y, the quotient map induces Hk(Y,A;G)≅H~k(Y/A;G) (Good pairs and quotient reduced homology). We verify this good-pair condition explicitly for the skeletal and finite-wedge pairs below; it is not being assumed for every CW pair.

[F4]

A pair has a long exact singular homology sequence for every abelian coefficient group (Long exact sequence of a pair).

[F5]

For n≥1, the reduced homology of Sn with coefficients G is G in degree n and zero otherwise (Homology of spheres). A path-connected nonempty space has H0≅G (Zero-th singular homology is free on path components).

Proof

technique · direct
1.1givenF1algebra

If there are no n-cells, Xn=Xn−1 and both sides are zero. For n=0, X0 is discrete and X−1=∅. Every singular simplex has constant image, so its singular chain complex splits over the vertices. On one point its degree-k chain group is G and its boundary is multiplication by ∑i=0k(−1)i, which is zero for odd k and the identity for positive even k; hence its homology is G in degree zero and zero otherwise. This gives the asserted direct sum without an additivity axiom. Hence assume n≥1 and that an n-cell exists. Its attaching sphere makes Xn−1 nonempty.

1.2F1F3givenconstruct

We verify the good-pair hypothesis for (Xn,Xn−1). For each n-cell use its supplied characteristic map χe:Dn→Xn, and let V=Xn−1∪⋃eχe{u∈Dn:∥u∥>1/2}. The preimage of V in each characteristic disk of dimension below n is the whole disk, and in each n-disk it is the relatively open outer annulus {∥u∥>1/2}; the CW weak topology therefore makes V open. On each such annulus set Ht(χe(u))=χe((1−t)u+tu/∥u∥), and fix Xn−1 pointwise. The formula is continuous on each characteristic-disk cylinder and fixes the boundary sphere where ∥u∥=1, so it agrees under every attaching identification, even for nonregular cells. Here is the product-continuity check for arbitrary cell sets. For each point of V, its track is continuous; transpose these tracks to a function H^:V→C(I,V) with the compact-open topology. By The exponential law: for a locally compact metric X and any spaces Z and Y, transposition is a bijection between C(X×Z,Y) and C(Z,C(X,Y)) with the compact-open topology, the restriction of H^ to every characteristic disk's inverse image of V is continuous. The restricted characteristic maps jointly give the weak topology on the open subspace V: a subset of V is open exactly when its inverse image in each disk is open. Hence H^ is continuous, and the same interval exponential law untransposes it to a continuous H:V×I→V. At t=1 it lands in Xn−1; thus V deformation retracts onto that closed subcomplex. By [F3], Hk(Xn,Xn−1;G)≅H~k(W;G),W=Xn/Xn−1=⋁e(Den/Sen−1). The quotient is a wedge of n-spheres with common basepoint b by the attaching presentation, and the isomorphism is induced by the quotient map.

2.1F3F4F5step 1.2

First let WJ be a finite wedge and split off one sphere Sjn, leaving the subwedge U that contains the common basepoint. This is again a skeletal attachment pair: the open neighborhood U∪χj{∥u∥>1/2} and the radial homotopy of step 1.2 retract onto U. Therefore [F3] applies, and the quotient WJ/U≅Sjn gives Hk(WJ,U;G)≅H~k(Sjn;G). The inclusion U↪WJ has a retraction collapsing Sjn; hence its homology map is injective. In the pair long exact sequence this also forces the connecting map into Hk−1(U;G) to be zero. Thus, for k>0, the sequence from Hk(U;G) to Hk(WJ;G) to H~k(Sjn;G) is short exact. It splits by the inclusion of Sjn, since projection to the quotient is the identity on that sphere. Induction over the finite set J, together with sphere homology, gives Hk(WJ;G)=⨁j∈JG for k=n and zero for other positive k. Every finite wedge is path connected, including the empty wedge interpreted as a point, so H~0(WJ;G)=0.

3.1F2step 1.2step 2.1∎

The choice-free compact-image lemma puts the image of each singular simplex in the arbitrary wedge W inside a finite CW subcomplex, hence inside a finite subwedge. Every singular chain is a finite sum of simplices, so it too is supported in a finite subwedge. A cycle in W supported there is a cycle there, since singular chain inclusion is injective. If a finite supported cycle bounds in W, its bounding chain also lies in some finite subwedge; enlarging both finite supports makes it a boundary in one finite subwedge. Therefore the finite-wedge calculations of step 2.1 pass elementwise to W: classes have finite support, and any relation is already a finite-wedge relation. This gives H~n(W;G)≅⨁eαnG and zero in every other degree, including reduced degree zero because n≥1 and W is path connected. Composing with the quotient-induced isomorphism of step 1.2 proves the stated natural isomorphism, without a choice premise.

Depends on

Used by

Dependency tree · two levels

40 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