Alphabeta Math
Pipeline-generated
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.

✓ 12 results · all verified · 8 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Cw Complexes and Cellular Homology

1 · Prerequisites

2 · Summary

A CW decomposition gives a filtration whose consecutive relative homology groups are free on cells. Subcomplexes contain the full closure of every cell they contain, and in dimension one the cellular boundary records terminal vertex minus initial vertex. The resulting cellular complex computes singular homology, including for infinite complexes and CW pairs.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Cell attachment by a characteristic map

Definition

For a space X, an attaching map f:Sn−1→X, and n≥1, attach an n-cell by the pushout X∪fDn=(X⊔Dn)/(z∼f(z) for z∈Sn−1). The quotient map restricted to Dn is its characteristic map; its image is the closed cell and the image of D˚n is the open cell. For n=0, use S−1=∅, so X∪fD0=X⊔{∗}.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The interior of an attached cell embeds openly in its closure

Statement

For an attached cell, its characteristic map is injective on D˚n and maps this interior homeomorphically onto an open subset of its closed-cell image. The full disk map need not be injective.

Facts & Assumptions

Given: The adjunction quotient of Cell attachment by a characteristic map.

Proof

technique · direct
1.1given

The defining equivalence relation identifies only boundary points of Dn with points of X (and may identify boundary points with one another); no point of D˚n is equivalent to a distinct point.

2.1step 1.1∎

The saturated open set D˚n has quotient homeomorphic to its image, and its complement in the closed-cell image is the image of Sn−1. Thus the image is open relative to the attached space, while step 1.1 deliberately says nothing about the boundary.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

CW complex with closure finiteness and weak topology

Definition

A CW complex is a Hausdorff space X with a filtration ∅=X−1⊆X0⊆X1⊆⋯ ,X=⋃n≥0Xn, where X0 is discrete and Xn is obtained from Xn−1 by attaching a (possibly infinite) family of n-disks along maps Sn−1→Xn−1 as in Cell attachment by a characteristic map. The images of the disk interiors are its open n-cells eαn, and the disk maps are their characteristic maps. It moreover satisfies: (C) each closed cell eαn‾ meets only finitely many cells; and (W) A⊆X is closed exactly when A∩e‾ is closed in e‾ for every cell e. These are closure finiteness and the weak topology.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Skeleta, CW subcomplexes, and relative CW complexes

Definition

Write Xn for the union of cells of dimension at most n, with X−1=∅. A CW subcomplex A⊆X is a union of open cells such that, whenever A contains an open cell e, it contains the whole closure e‾. A relative CW complex (X,A) is formed from the subcomplex A by attaching cells in stages; thus A↪X is a cellular inclusion.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

CW skeleta are closed and cells form a disjoint partition

Statement

For a CW complex X, every skeleton Xn is closed, and Xn∖Xn−1 is the disjoint union of the open n-cells.

Facts & Assumptions

Given: A CW complex and its skeleta as in Skeleta, CW subcomplexes, and relative CW complexes.

Proof

technique · direct
1.1given

Let χe:Dm→X be the characteristic map of an m-cell. If m≤n, then χe−1(Xn)=Dm. If m>n, this inverse image lies in Sm−1 and equals the inverse image there of the already closed lower skeleton Xn⊆Xm−1; induction on m makes it closed in Sm−1 and hence in Dm. The weak-topology clause now makes Xn closed in X.

2.1step 1.1∎

The open-cell interiors are disjoint by the cellular partition, and The interior of an attached cell embeds openly in its closure identifies precisely the new interior points after Xn−1. This gives the asserted difference.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-26 (gpt-6-sol)Open item page →

A compact subspace of a CW complex meets only finitely many cells

Statement

Assume the Axiom of Choice (The Axiom of Choice).

Every compact subspace of a CW complex meets only finitely many open cells.

Facts & Assumptions

Given: A compact K⊆X, where X is a CW complex.

[A1]

The Axiom of Choice supplies a choice function on the nonempty subsets of the set of cells meeting K, and a point in each chosen nonempty cell intersection (The Axiom of Choice).

Proof

technique · contradiction
1.1A1givenassume-contra

If K met infinitely many cells, use [A1] recursively on the nonempty set of cells remaining after finitely many earlier choices, obtaining distinct met cells and points xi∈K in them. Put S={xi:i≥1}. Induction over the skeleta shows that S∩Xn is closed in Xn: on the boundary of each characteristic n-disk this follows from the induction hypothesis, and the disk interior contains at most one xi. The weak topology then closes the induction.

2.1step 1.1discharge-contradiction∎

The same argument applies to every subset of S, so S is a closed discrete subspace of K. An infinite discrete space is not compact, contradicting compactness of the closed subspace S⊆K.

CorollaryStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-26 (gpt-6-sol)Open item page →

The image of a compact space lies in a finite CW subcomplex

Statement

If K is compact and f:K→X is continuous into a CW complex, then f(K) lies in a finite CW subcomplex of X.

Facts & Assumptions

Given: A continuous map f:K→X with K compact.

[L1]

With characteristic maps supplied, a compact CW image lies in a finite subcomplex without choice (Compact CW images have finite cell support without choice).

Proof

technique · direct
1.1given

The characteristic maps are part of the supplied CW structure. Thus the given compact space and continuous map satisfy the hypotheses of [L1].

2.1L1step 1.1∎

Apply [L1] to obtain a finite CW subcomplex containing f(K), including the empty-image case. The supplier uses canonical coordinate minima to prove finite cell support without a choice premise.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-10 (Codex)Open item page →

Relative CW inclusions are cofibrations

Statement

If (X,A) is a relative CW complex, then A↪X has the homotopy extension property; in particular it is a cofibration.

Explicitly, for every topological space Y, continuous g:X→Y, and continuous H:A×I→Y satisfying H(a,0)=g(a), there is a continuous H~:X×I→Y restricting to H on A×I and to g at time zero. Here I=[0,1] and products have their ordinary product topologies. There is no finiteness or dimension bound on the CW complex, no separation hypothesis on Y, and no choice assumption. The CW structure, including its characteristic maps, is supplied as data.

Facts & Assumptions

Given: A map g:X→Y and a homotopy H:A×I→Y with H(a,0)=g(a).

[L1]

The skeleta Xn are obtained by attachment quotients, X is Hausdorff with the weak topology on its closed cells, and A is a union of cells containing the closure of each of its cells (Skeleta, CW subcomplexes, and relative CW complexes, CW complex with closure finiteness and weak topology, Cell attachment by a characteristic map).

[L3]

Write P=C(I,Y) with the compact-open topology. For every topological space Z, a function h:Z×I→Y is continuous exactly when its transpose h^:Z→P, h^(z)(t)=h(z,t), is well defined and continuous. This is the published exponential law, with metric domain I, after interchanging the product coordinates (The compact-open topology on C(X,Y) for a metric domain X, with subbasis S(K,V)={f:f[K]⊆V}, 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).

[L4]

For a quotient map q:E→B, a subset of B is open, or closed, exactly when its inverse image under q is so (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection). Composites are continuous and continuous maps paste on a finite closed cover (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous).

[L6]

A specified successor operation can be iterated on the natural numbers without any choice principle (The recursion theorem).

Proof

technique · direct
1.1L3L4

First establish the needed quotient-cylinder mapping criterion. Let q:E→B be any quotient map and let h:B×I→Y be a function such that h∘(q×idI) is continuous. For each b, surjectivity supplies a representative e and shows that the path t↦h(b,t) is continuous. No simultaneous selection of representatives is needed. The continuous transpose upstairs is h^∘q:E→P. For every open V⊆P, its inverse image is q−1[h^−1[V]], so the quotient criterion makes h^−1[V] open. Thus h^ and then h are continuous. No closedness hypothesis on q is used.

1.2L5algebraconstruct

For n≥1, put Tn=(Dn×{0})∪(Sn−1×I). For u∈Dn and t∈I, define a=max⁡{1−t/2,∥u∥}, λ=1/a, and rn(u,t)=(λu,2+λ(t−2)). Since 1/2≤a≤1, this formula is continuous and defined on the entire cylinder. Moreover 1≤λ≤2/(2−t), so its height lies in [0,t], and λ∥u∥≤1. If a=1−t/2 the height is zero, while if a=∥u∥ the norm of the first coordinate is one; hence the image lies in Tn. If t=0 or ∥u∥=1, then a=1 and the point is fixed. Thus rn is a retraction onto Tn. For n=0 set r0(∗,t)=(∗,0).

1.3givenL1construct

We specify compatible continuous maps Hn:Xn×I→Y, with Hn(x,0)=g(x) and Hn=H on (A∩Xn)×I. On the discrete zero skeleton prescribe H0(v,t)=H(v,t) for v∈A and H0(v,t)=g(v) otherwise. Every vertex cylinder is open, so this is continuous.

1.4L1L2L4L5

We justify the infinite-stage continuity using the weak topology on X, not an assumed weak topology on X×I. Each characteristic map ϕ:Dn→e‾ is a quotient map. Indeed it is a continuous surjection; if F⊆Dn is closed, it is compact. Its image is compact by pulling any open cover of ϕ[F] back to F and retaining the images' finitely many covering members. This open-cover argument works for arbitrary targets, without a metrizability hypothesis on e‾. Since e‾ is a subspace of the Hausdorff space X, ϕ[F] is closed there. Thus ϕ is closed; if ϕ−1[C] is closed, then C=ϕ[ϕ−1[C]] is closed, proving the quotient criterion.

2.1givenL1L4step 1.2step 1.3

Given such Hn−1 for n≥1, let ϕα:Dn→Xn be a supplied characteristic map and fα:Sn−1→Xn−1 its boundary map. If its open cell belongs to A, use Kα(u,t)=H(ϕα(u),t); this is defined on the whole disk cylinder because the closed cell lies in A. For every other cell define bα:Tn→Y by bα(u,0)=g(ϕα(u)) and bα(u,t)=Hn−1(fα(u),t) for u∈Sn−1. These two continuous prescriptions agree on the corner and their domains form a two-piece closed cover of Tn, so bα is continuous. Set Kα=bα∘rn.

3.1L1step 1.1step 2.1

The maps Hn−1 and all Kα agree on the attaching identifications, including for cells belonging to A, and so determine a function Hn:Xn×I→Y. The map from (Xn−1⊔∐αDn)×I is continuous: each summand cylinder is open and carries the prescribed continuous map. The attachment map Xn−1⊔∐αDn→Xn is quotient, so step 1.1 proves continuity of Hn. Its time-zero values are g, it extends Hn−1, and it equals H on (A∩Xn)×I, since every cell of this intersection is either in the previous skeleton or among the cells on which Kα was prescribed from H.

4.1L6step 1.3step 3.1

These formulas define the successor map uniquely from the preceding stage; they do not choose one extension from a nonempty set of extensions. Apply ordinary recursion, recording the stage number together with the partial map, to obtain all Hn. The state space can be taken to be the set of valid stage-number/partial-map pairs, with the successor just constructed. Define H~(x,t)=Hn(x,t) whenever x∈Xn. Compatibility makes this independent of n, gives H~(x,0)=g(x), and gives H~∣A×I=H.

5.1L1L3L4step 4.1step 1.4

Every path t↦H~(x,t) is continuous by some Hn, so the transpose G:X→P is well defined. For each characteristic map ϕ:Dn→X, the map H~∘(ϕ×idI) is continuous by construction, and [L3] makes G∘ϕ continuous. By the quotient property from step 1.4, G∣e‾ is continuous. Consequently, for every closed C⊆P, the set G−1[C] meets every closed cell in a relatively closed set. The CW weak topology implies G−1[C] is closed in X. Thus G is continuous. This argument permits arbitrary families of cells and unbounded dimension.

6.1L3step 4.1step 5.1∎

The exponential law applied once more, now to G:X→P, proves that H~:X×I→Y is continuous. Its restrictions established in step 4.1 solve every homotopy-extension problem in the statement, which is the asserted cofibration property.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A CW complex is the colimit of its skeleta in the weak topology

Statement

A map f:X→Y from a CW complex is continuous if and only if every restriction f∣Xn:Xn→Y is continuous.

Facts & Assumptions

Given: A function f:X→Y whose skeletal restrictions are continuous.

Proof

technique · direct
1.1given

Necessity follows by restriction. Conversely, f∣e‾ is continuous because e‾ lies in the skeleton of its dimension.

2.1step 1.1∎

For closed C⊆Y, each f−1(C)∩e‾ is closed in e‾ by step 1.1; the weak-topology clause in CW complex with closure finiteness and weak topology makes f−1(C) closed.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Compact CW images have finite cell support without choice

Statement

Let K be a compact topological space and f:K→X continuous, where X is a CW complex with its characteristic maps supplied as part of the CW structure. Then f(K) lies in a finite CW subcomplex of X. No AC or countable choice is used, even when the cells of X form an arbitrary set and their dimensions are unbounded.

Facts & Assumptions

[F1]

CW complex with closure finiteness and weak topology supplies Hausdorffness, characteristic disks homeomorphic on their interiors to open cells, closure finiteness, and the test for closed sets on every closed cell. Skeleta, CW subcomplexes, and relative CW complexes specifies the subcomplex condition.

[F3]
[F5]

A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value gives an attained minimum for each continuous real coordinate on a nonempty compact metric space, without choice.

Proof

Given: K,f,X as in the statement. Let L=f(K). The empty CW subcomplex is permitted.

1.1F1F2given

The image L is compact in the open-cover sense. Indeed, the inverse images of any open cover of L cover K; a finite subcover of K yields a finite subcover of L by the same covering members. This argument does not impose a metric on the target. Since X is Hausdorff, [F2] makes L closed in X.

1.2F3F4F5given

Every nonempty compact subset T⊆Rd has a uniquely specified lexicographically least point. For d≥1, minimize its first coordinate using [F5] and restrict to the minimum level set. That set is nonempty, closed in T and compact by [F3]. Minimize the next coordinate on it and continue through the finite ordered coordinate set. After d steps all coordinates are fixed, and the nonempty final set is a singleton. Each minimum value and each level set is unique; no minimizing point is selected until the final singleton. For d=0, the sole possible nonempty subset of R0 is already a singleton. This is a finite prescription defined for every such T, not a family of arbitrary existential choices.

2.1F1F3F4step 1.1step 1.2

Let e be a positive-dimensional open cell meeting L, with characteristic map χe:Dd→X. For r≥0 let Bd,r be the concentric closed ball of radius 1−1/(r+2) in Dd. These balls exhaust its interior. Thus some Bd,r meets χe−1(L); let re be the least such integer. The set Te=Bd,re∩χe−1(L) is a nonempty compact subset of Rd: it is closed in the compact ball by step 1.1, continuity and [F3], [F4]. Let ve be its uniquely specified point from step 1.2 and set xe=χe(ve)∈L∩e. For an occupied zero-cell use that point itself. The least integer, the finite sequence of coordinate minima, and the supplied characteristic map specify xe uniquely for every occupied cell; the resulting function is defined by this formula on the set of occupied cells.

3.1F1F3step 1.1step 2.1

Put S={xe:e∩L≠∅}. Distinct occupied cells give distinct points, since their interiors are disjoint. For every subset T⊆S and every closed cell a‾, closure finiteness in [F1] says that a‾ meets only finitely many open cells. Hence T∩a‾ is finite, with at most one point from each of those cells. A finite subset of a Hausdorff space is closed: singleton complements are open by the Hausdorff separation axiom, and finite unions of closed sets are closed. The weak topology in [F1] now makes T closed in X. In particular S is closed in X, hence closed in the compact L. By [F3], S is compact.

4.1step 2.1step 3.1

For s∈S, the set S∖{s} is closed in X by step 3.1. Its complement intersects S in {s}, so S is discrete. Its singleton cover is an open cover of S and therefore has a finite subcover. Thus S is finite, without first extracting a countably infinite subset from an arbitrary infinite set. The bijection e↦xe from occupied cells to S shows that only finitely many cells meet L.

5.1F1step 4.1

If there are occupied cells, start with their finite set. Add every cell meeting the boundary of a cell already in the set, and repeat downward in dimension. At each stage only finitely many cells are added by closure finiteness [F1]. A cell boundary lies in the preceding skeleton, so the dimensions strictly decrease along every newly required boundary chain. The finite starting set has a maximum dimension N, and after at most N such downward stages no more are required. The union of these cells contains the entire closure of each member, hence is a finite CW subcomplex by [F1]. It contains L, because every point of L belongs to an occupied open cell.

6.1step 1.2step 2.1step 4.1step 5.1∎

If K or L is empty, the empty subcomplex suffices and no minima are taken. For a point image, the closure process starts at its one occupied cell; it need not itself be a zero-cell. Zero-dimensional cells and the zero-dimensional Euclidean coordinate space were handled without a norm or empty-coordinate minimum. The radii in step 2.1 are strictly between zero and one and approach one, so all chosen preimages lie in cell interiors and no boundary point is mistaken for a point of that open cell. Nonregular characteristic maps cause no problem, since only their interior restrictions are used for the selected points. Steps 1.2 and 2.1 specify every selection uniquely, while steps 4.1 and 5.1 use compactness and finite closure operations; no AC is used anywhere.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-24 (gpt-6-sol)Open item page →

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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Oriented cellular chain group

Definition

For a CW complex X and abelian group G, set Cncell(X;G)=Hn(Xn,Xn−1;G) and Cncell(X;G)=0 for n<0. By Relative homology of consecutive CW skeleta, an orientation of each characteristic n-disk selects the corresponding direct-summand copy of G.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Cellular boundary from three consecutive skeleta

Definition

For n≥1, define dn:Cncell(X;G)→Cn−1cell(X;G) as the connecting map Hn(Xn,Xn−1;G)→Hn−1(Xn−1;G) from Long exact sequence of a pair, followed by the quotient map to Hn−1(Xn−1,Xn−2;G). Set d0=0.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The cellular boundary squares to zero

Statement

For every n≥1, dn−1dn=0.

Facts & Assumptions

Given: The three-skeleton definition of d in Cellular boundary from three consecutive skeleta.

Proof

technique · direct
1.1given

For n=1 the composite is zero because d0=0 by definition.

1.2given

Let n≥2. Write dn=jn−1∂n,dn−1=jn−2∂n−1, where jn−1:Hn−1(Xn−1)→Hn−1(Xn−1,Xn−2) is the quotient map. In the long exact sequence of the pair (Xn−1,Xn−2), jn−1 is immediately followed by ∂n−1.

2.1step 1.1step 1.2∎

Exactness gives ∂n−1jn−1=0, and hence dn−1dn=jn−2(∂n−1jn−1)∂n=0. Together with step 1.1 this covers every n≥1.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-07Open item page →

Cellular homology

Definition

Let X be a CW complex, G an abelian group, and n≥0. The cellular homology of X with coefficients in G is Hncell(X;G)=ker⁡dn/im⁡dn+1 for the cellular groups of Oriented cellular chain group, with differentials defined in Cellular boundary from three consecutive skeleta. These maps form a chain complex by The cellular boundary squares to zero.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Skeletal homology stabilizes away from the cell dimension

Statement

Let X be a CW complex, let G be an abelian group, and let n≥0. The skeletal inclusion induces an isomorphism Hk(Xn;G)→Hk(Xn+1;G) for k<n and a surjection for k=n.

Facts & Assumptions

Given: A CW complex X, an abelian coefficient group G, and the consecutive-skeleton pair (Xn+1,Xn).

Proof

technique · direct
1.1given

Its relative homology vanishes outside degree n+1 by Relative homology of consecutive CW skeleta.

2.1step 1.1∎

In the pair long exact sequence, the two relative groups adjacent to Hk(Xn) vanish for k<n, and only the outgoing one need vanish for k=n; exactness gives respectively an isomorphism and a surjection.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-26 (gpt-6-sol)Open item page →

Homology of an infinite CW complex is the colimit of skeletal homology

Statement

Assume the Axiom of Choice. For a CW complex X, the natural map lim→⁡nHk(Xn;G)→Hk(X;G) is an isomorphism for every k.

Facts & Assumptions

Given: The Axiom of Choice (The Axiom of Choice) and a singular cycle or a singular bounding chain in X.

Proof

technique · direct
1.1given

A singular chain has finitely many simplices, so its image is compact; The image of a compact space lies in a finite CW subcomplex places it in one finite subcomplex and hence in some skeleton. Thus every homology class is in the image.

2.1step 1.1∎

If a class from Hk(Xn) dies in Hk(X), a finite singular bounding chain has compact image and lies in some Xm. It already kills the class there, proving injectivity of the colimit map.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-26 (gpt-6-sol)Open item page →

Cellular homology computes singular homology

Statement

For every CW complex X, abelian group G, and n≥0, the cellular complex has an isomorphism Hncell(X;G)≅Hn(X;G), natural with respect to cellular maps.

Facts & Assumptions

Given: A CW complex X, an abelian group G, and n≥0. Write X−1=∅, suppress G in homology notation, and write Cm=Hm(Xm,Xm−1;G).

[F1]

Consecutive relative skeletal homology is concentrated in the cell dimension (Relative homology of consecutive CW skeleta).

[F2]

Each skeletal pair has its long exact homology sequence (Long exact sequence of a pair).

[F3]

Skeletal inclusions induce isomorphisms in degrees below the old skeleton dimension (Skeletal homology stabilizes away from the cell dimension).

[F4]

Every continuous image of a compact space in a CW complex with its supplied characteristic maps lies in a finite CW subcomplex, without a choice premise (Compact CW images have finite cell support without choice).

[F5]

Cellular homology is ker⁡dn/im⁡dn+1 (Cellular homology); dm=im−1∂m, where ∂m:Cm→Hm−1(Xm−1) is the pair connecting map and im−1:Hm−1(Xm−1)→Cm−1 is the relative quotient map (Cellular boundary from three consecutive skeleta).

Proof

technique · direct
1.1F1F2given

For every finite m≥0, Hk(Xm)=0 when k>m: begin with the discrete X0 case of [F1], and use [F2] successively with [F1] to pass from Xm−1 to Xm. The empty skeleton also has zero homology.

2.1F2F5step 1.1algebra

For n≥1, the exact sequence of (Xn,Xn−1) and step 1.1 give an injection in:Hn(Xn)→Cn with image ker⁡∂n. The same argument one degree lower makes in−1 injective, including i0:H0(X0)→H0(X0,∅), which is an isomorphism. Since dn=in−1∂n, we obtain ker⁡dn=ker⁡∂n=inHn(Xn). For n=0 this identity follows directly from i0 being an isomorphism and d0=0.

3.1F1F2F5step 2.1algebra

For (Xn+1,Xn), exactness and Hn(Xn+1,Xn)=0 give the exact tail Cn+1→∂n+1Hn(Xn)⟶Hn(Xn+1)⟶0. Under the injection in of step 2.1, im⁡∂n+1 corresponds exactly to im⁡dn+1 by [F5]. Taking the quotient therefore yields Hncell(X;G)≅Hn(Xn)/im⁡∂n+1≅Hn(Xn+1;G).

4.1F3F4step 3.1

By [F3], all inclusions after Xn+1 induce isomorphisms on Hn. Each singular cycle is a finite sum of simplices; [F4] puts the image of each simplex in a finite subcomplex. Their finite union lies in some skeleton, so every class in Hn(X;G) comes from a skeleton. If a skeletal cycle bounds in X, its finite bounding chain likewise lies in some later skeleton, where that class already vanishes. Singular chain inclusions are injective, so these are respectively surjectivity and injectivity of the natural colimit map. Thus the colimit is Hn(X;G) without any choice premise. Combining with step 3.1 proves the comparison for arbitrary, possibly infinite-dimensional, CW complexes.

5.1step 2.1step 3.1step 4.1given∎

A cellular map preserves all skeleta. Its induced chain maps commute with inclusions, quotient maps and connecting homomorphisms: the latter send a relative cycle represented by c to the class of ∂c, and a chain map commutes with ∂. Consequently every injection, quotient identification and colimit map in steps 2.1--4.1 commutes with cellular maps. The comparison is therefore natural in exactly the stated sense.

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Incidence number of two CW cells

Definition

For n≥2 and oriented cells eαn and eβn−1, collapse the complement of eβn−1 in Xn−1 and compose the attaching map of eαn with the resulting quotient to Sn−1. Its induced endomorphism of oriented H~n−1(Sn−1;Z) is multiplication by a unique integer, denoted [eαn:eβn−1].

For n=1, choose the characteristic parametrization so the interval from −1 to +1 represents the chosen generator of eα1. Write the chosen zero-cell generator as ev=εv[v], with εv∈{1,−1} and [v] the canonical point class in H0(X0;Z). For v=eβ0 set [eα1:v]=εv(1{χα(+1)=v}−1{χα(−1)=v}). Indeed the singular boundary is [χα(+1)]−[χα(−1)] and [v]=εvev, so this is precisely its coefficient in the chosen cellular basis. Canonical positive vertex generators give the usual terminal-minus-initial formula. Equal endpoints cancel for either sign. The negative vertex choice is an algebraic basis change, not a based self-map of S0 of degree −1.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Cellular boundary is the incidence degree matrix

Statement

Let X be a CW complex. For n≥1, in the integral cellular chain groups with the chosen cell orientations, dneαn=∑β[eαn:eβn−1]eβn−1.

Facts & Assumptions

Given: A CW complex X, integral cellular chains, and the chosen cell orientations; the differential is as in Cellular boundary from three consecutive skeleta.

Proof

technique · direct
1.1given

Project the three-skeleton connecting map defining dn to the summand of a fixed (n−1)-cell.

2.1step 1.1

For n≥2, first pass from Xn−1 to Xn−1/Xn−2 as required by the relative target of the cellular boundary, and then collapse all summand spheres except that of eβn−1. Equivalently, collapse the entire complement Xn−1∖eβn−1, including Xn−2. Naturality of the connecting homomorphism for the characteristic disk identifies the coefficient with the composite from its oriented boundary sphere to this quotient sphere. This is precisely the reduced-homology endomorphism in Incidence number of two CW cells, so its degree is [eαn:eβn−1].

3.1step 1.1step 2.1∎

For n=1, use a characteristic interval compatible with the chosen edge generator. Its connecting homomorphism is the singular boundary [v+]−[v−]. For each chosen vertex generator ev=εv[v], the identity [v]=εvev gives coefficient εv(1{v+=v}−1{v−=v}), exactly the incidence number of Incidence number of two CW cells. This includes negatively chosen zero-cell generators and gives zero when both endpoints coincide. The boundary is an element of a direct sum, so only finitely many coefficients are nonzero; equality of all its projections therefore proves the formula for every n≥1; separately, d0=0 by definition.

PropositionStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-26 (gpt-6-sol)Open item page →

Cellular maps induce cellular chain maps

Statement

For every abelian group G, a cellular map f:X→Y, meaning f(Xn)⊆Yn, induces a chain map C∗cell(X;G)→C∗cell(Y;G). Assuming the Axiom of Choice, its map on cellular homology corresponds to f∗ on singular homology under the natural cellular comparison for arbitrary CW complexes. If X and Y are finite CW complexes, this compatibility holds without the Axiom of Choice.

Facts & Assumptions

Given: An abelian group G and a cellular map f:X→Y. Assume the Axiom of Choice only for the arbitrary-CW singular-homology comparison.

Proof

technique · direct
1.1given

The restrictions f:(Xn,Xn−1)→(Yn,Yn−1) induce maps of relative groups, hence maps on cellular chains.

2.1step 1.1∎

Naturality of pair connecting maps makes these maps commute with the differentials, without a choice assumption. Under the Axiom of Choice, Cellular homology computes singular homology compares cellular and singular homology naturally for arbitrary CW complexes, so the induced maps agree with f∗. For finite X and Y, use the finite skeletal exact-sequence calculations in that theorem, followed by finitely many skeletal stabilization isomorphisms: above the last cell dimension each space equals its final skeleton, so no infinite colimit is needed. Every pair and inclusion map in these finite calculations commutes with f, giving the same compatibility without choice.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A CW complex with no cells in adjacent dimensions has zero cellular boundary

Statement

If X has no cells in adjacent dimensions, every cellular differential is zero; consequently Hn(X;G)≅Cncell(X;G).

Facts & Assumptions

Given: A CW complex with no two nonzero cellular chain groups in consecutive degrees.

Proof

technique · direct
1.1given

For every n, either Cncell or Cn−1cell is zero, so dn=0.

2.1step 1.1∎

Thus cellular homology equals the chain group in each degree; Cellular homology computes singular homology transfers this calculation to singular homology.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Euler characteristic of a finite CW complex

Definition

If X has finitely many cells and cn(X) is its number of n-cells, define χ(X)=∑n(−1)ncn(X). The sum is finite by hypothesis.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Euler–Poincare formula for finite CW complexes

Statement

For a finite CW complex, χ(X)=∑n(−1)nrank⁡Hn(X;Z).

Facts & Assumptions

Given: The finite free integral cellular chain complex of X.

Proof

technique · direct
1.1givenalgebra

Rank-nullity in each degree gives rank⁡Cn=rank⁡Hncell+rank⁡im⁡dn+rank⁡im⁡dn+1.

2.1step 1.1algebra∎

Alternating and summing cancels each boundary rank with its neighboring occurrence. The left side is Euler characteristic of a finite CW complex, and Cellular homology computes singular homology identifies the remaining ranks with singular homology.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-07Open item page →

Euler characteristic is additive for finite CW pairs

Statement

For a finite CW pair (X,A), χ(X)=χ(A)+∑n(−1)n#{n-cells of X∖A}. If A≠∅, then χ(X/A)=χ(X)−χ(A)+1.

Facts & Assumptions

Given: A finite CW subcomplex A⊆X.

Proof

technique · direct
1.1given

The cells of X are the disjoint union of the cells of A and those outside A, so the first equality follows by splitting the finite alternating sum.

2.1step 1.1∎

If A is nonempty, X/A has one new 0-cell (the quotient point) and exactly the cells outside A otherwise; its alternating count gives the second formula.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Euler characteristic of a finite CW product

Statement

For finite CW complexes X,Y, χ(X×Y)=χ(X)χ(Y).

Facts & Assumptions

Given: The product CW structure whose cells are ep×fq.

Proof

technique · direct
1.1given

Product cells have dimension p+q, and there are cp(X)cq(Y) of them in that dimension.

2.1step 1.1algebra∎

The finite alternating double sum is ∑p,q(−1)p+qcp(X)cq(Y)=(∑p(−1)pcp(X))(∑q(−1)qcq(Y)), which is the required formula.

5 · Examples, counterexamples and false statements

None yet.

Sources