Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Cellular chains compute local homology

Statement

Let (X,A) be a CW pair and L a left R-module local system on X. The cellular local chain complex computes singular local homology: Hn(Ccell(X,A;L))Hn(X,A;L). The comparison is natural for cellular maps with correctly directed coefficient morphisms. Intrinsically, Cncell(X,A;L)Hn(XnA,Xn1A;L). If a basepoint and one oriented lift of each cell outside A are supplied on every component, the nth group is the direct sum of the corresponding coefficient fibers, and its boundary is the signed R[π] incidence matrix acting through monodromy.

Facts & Assumptions

Given: A CW pair (X,A), a commutative unital ring R, and an R-module local system L.

[F1]

Homology and cohomology with local coefficients defines the singular local groups, while Twisted boundaries square to zero and ignore lift bases makes the cellular tensor complex independent of supplied lift bases.

[F2]

Excision for singular homology states the ordinary constant-coefficient excision theorem. Its subdivision and prism calculation is reconstructed with local transports in Step 1.1; no local-coefficient skeletal conclusion is attributed to the ordinary cellular theorem.

[F3]

Compact CW images have finite cell support without choice places the image of every compact simplex in a finite CW subcomplex without using a selection principle.

Proof

technique · direct
1.1

Barycentric subdivision works for intrinsic local chains by transporting each coefficient from the original first vertex to the first vertex of each subsimplex along the straight segment inside the original simplex. The paired-face proof used for ordinary subdivision has only triangular path comparisons, which agree by local-system functoriality; the usual subdivision prism therefore gives D+D=1S. For a finite chain, a sufficiently high subdivision is small relative to any excisive open cover. This reproduces the chain-homotopy and excision argument of [F2] with fibers tracked, without assuming the later general local-excision theorem.

F1F2
2.1

Apply step 1.1 to the pair (XmA,Xm1A). Excision separates the open m-cells outside A. On each cell, transport from one supplied point trivializes L, and the relative pair is the disk-boundary pair; its chain contraction leaves one copy of that fiber in degree m and zero in every other degree. Chains are finite, so the separated relative group is the direct sum over cells. In universal-cover coordinates this is exactly Cmcell(X~,A~;R)R[π]Lx. Thus consecutive skeletal relative local homology is concentrated in degree m, and the displayed intrinsic identification follows.

F1step 1.1
3.1

Write Ym=XmA, with Y1=A, and Cm=Hm(Ym,Ym1;L). The degreewise short exact chain sequence for a triple gives the usual connecting map [c][c] and its exact homology sequence by a direct cycle-boundary chase. Step 2.1 and induction over the skeleta give Hk(Ym,A;L)=0 for k>m. For fixed n, exactness for (Yn,Yn1) therefore gives an injection jn:Hn(Yn,A;L)Cn with image kern. The quotient map Hn1(Yn1,A;L)Cn1 is injective by the same vanishing one skeleton lower, including n=0 with Y1=A. Consequently kerdn=kern=jnHn(Yn,A;L). Finally, exactness for (Yn+1,Yn) and Hn(Yn+1,Yn;L)=0 give an exact sequence Cn+1Hn(Yn,A;L)Hn(Yn+1,A;L)0. Under jn, the first image is exactly imdn+1, so taking the quotient proves Hn(Ccell)Hn(Yn+1,A;L).

F1step 2.1
4.1

Attaching cells of dimension greater than n+1 does not change Hn because their consecutive relative local groups vanish in degrees n and n+1. Every finite singular local cycle, and every finite chain bounding it, lies in some finite skeleton modulo A: [F3] places each compact simplex image in a finite CW subcomplex, and the finitely many resulting subcomplexes have a common finite maximum cell dimension. Hence passage through the increasing skeleta is respectively surjective and injective on the colimit, and step 3.1 gives the asserted comparison for arbitrary-dimensional and infinite CW pairs.

F3step 2.1step 3.1
5.1

A cellular map preserves skeleta, the exceptional coefficient transport by naturality, and the connecting formula [c][c]. Therefore all identifications in steps 2.1–4.1 commute with the chain map from the supplied coefficient morphism. This proves naturality.

step 1.1step 2.1step 3.1step 4.1
6.1

With supplied oriented lifts, write e~jn=ie~in1rij, where rij is the finite signed sum of deck elements determined by lifted attaching incidences. Tensoring sends the jth fiber element m to the ith component rijm. These are group-ring incidences, not ordinary integer degrees. The basis-change lemma [F1] handles altered lifts and orientations. Empty pairs, absent cells, degree zero, the zero ring/system, and disconnected complexes are included componentwise; no choice is made unless a global family of lifts is separately supplied.

F1F3step 2.1step 5.1

Depends on

Used by

Dependency tree · two levels

15 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