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.

Axiomatic cellular boundaries are integral incidence matrices with coefficients

Statement

For a CW pair (X,A), an ordinary theory h with coefficient G, and chosen cell orientations, the complex Ch(X,A) is canonically Ccell(X,A;Z)G. Its differential is the integral incidence matrix acting on G. In degree one the entries are signed terminal-minus-initial endpoints. The direct-sum matrices have finite support in each column.

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)

[F2]

Let n0 and u:SnSn be continuous. If u on H~n(Sn;Z) is multiplication by d, then u on h~n(Sn)G for every ordinary theory h is didG. The identifications use the same oriented sphere generator; for n=0 use the difference of the two point classes. (Sphere endomorphisms act by the same integer in every ordinary theory)

[F3]

For n2 and oriented cells eαn and eβn1, collapse the complement of eβn1 in Xn1 and compose the attaching map of eαn with the resulting quotient to Sn1. Its induced endomorphism of oriented H~n1(Sn1;Z) is multiplication by a unique integer, denoted [eαn:eβn1]. For n=1, orient the characteristic interval of eα1 from 1 to +1 and, for a vertex v=eβ0, set [eα1:v]=1{χα(+1)=v}1{χα(1)=v}. Thus an oriented edge contributes its terminal vertex minus its initial vertex, and a loop with both endpoints at one vertex has incidence number zero there. (Incidence number of two CW cells)

[F4]

Let X be a CW complex. For n1, in the integral cellular chain groups with the chosen cell orientations, dneαn=β[eαn:eβn1]eβn1. (Cellular boundary is the incidence degree matrix)

Proof

1.1

By F1 the chain groups are direct sums of copies of G on relative cells. For a source r-cell and target (r1)-cell with r2, project the boundary homomorphism onto the target summand. Naturality of the characteristic disk pair identifies this component with the attaching map followed by collapse onto the target cell sphere and the natural disk boundary identifications. The corresponding integer for integral singular homology is precisely the incidence number of F3 and F4.

F1F3F4
2.1

F2 says that this same sphere endomorphism acts on coefficient G by that integer times the identity. For r=1, the boundary of the oriented interval is (g,g) at its two ends, so an edge contributes g at the terminal vertex and g at the initial vertex. If the endpoints coincide they cancel; endpoints in A vanish in the relative complex.

F2F3step 1.1
3.1

Each characteristic boundary has image in the finite union of closed cells supplied by closure finiteness, so only finitely many target cells can contribute to its column. Thus these components define a map of direct sums. At degree zero the outgoing differential is zero. The bases and component calculations identify the entire complex with the displayed tensor complex, for arbitrary G, including G=0 and pairs with no relative cells.

F1step 1.1step 2.1

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