Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

The relative handle chain complex computes H∗(W,M0) and has the intersection matrix as its differential

Statement

Assume ACω (The Axiom of Countable Choice (ACω)). Let (W;M0,M1) be a compact collared triad with a finite index-ordered handle decomposition relative to M0. Let Wk be the collar together with the handles of index at most k, and set W−1=M0. Put Ck=Hk(Wk,Wk−1;Z) for k≥0, C−1=0, and ∂0=0. For k≥1, define ∂k:Ck→Ck−1 by the connecting map of the triple (Wk,Wk−1,Wk−2). Then each Ck is free on the oriented relative core classes of the k-handles, ∂2=0, and Hk(C∙)≅Hk(W,M0;Z) for every k≥0.

For an oriented W, make the attaching spheres transverse to the belt spheres. Choose the belt orientations so that their oriented normal k-frames agree with the chosen k-core orientations, and use the boundary orientations on the upper attaching spheres. If gi is a (k+1)-handle and ej a k-handle, then ∂k+1[gi]=∑jI(Ai,Bj)[ej]. Thus the matrix with upper handles in rows and lower handles in columns acts on row coordinate vectors by x↦xM; the usual column-coordinate matrix is MT. In the middle range, when the outgoing boundary preceding the k-handles is connected, this is the matrix of Attaching-belt intersection matrix of adjacent-index handles. For disconnected stages the displayed coefficient formula still defines the incidence matrix, without invoking that definition outside its domain. Endpoint coefficients use the signed incidences of the attaching 0-sphere, or the dual incidences of belt 0-spheres. A presentation with only indices k,k+1 has the complex 0→Ck+1→∂k+1Ck→0.

Facts & Assumptions

Given: The finite index-ordered presentation and countable choice; orient the individual core disks to select generators.

[F1]

The standard k-handle pair has integral homology Z in degree k and zero otherwise. Relative homology of the standard handle pair

[F2]

Excision and the direct-sum decomposition for disjoint unions apply to relative singular chains. Excision for singular homology, The singular homology of a disjoint union is the direct sum

[F3]

A triple connecting map factors as the pair connecting map followed by the relative quotient map. Pair sequences are exact and natural. Long exact sequence of a triple in singular homology, Long exact sequence of a pair, Naturality of the pair long exact sequence

[F4]

Core, attaching and belt regions have the standard disk-product models; the local attaching/belt coefficient computation is also described in Handle boundary coefficients are attaching-belt intersection numbers. K handle core cocore attaching region and belt sphere, Attaching a smooth handle with corner rounding

Proof

technique · direct
1.1F1F2F4given

Product collars let us enlarge the lower stage slightly across each attaching seam and retract that enlargement onto the lower stage. Excision then identifies the relative homology of the next index stage with that of the disjoint union of its handle pairs; the retraction and excision preserve the relative core classes. By [F1]–[F2], Hi(Wk,Wk−1;Z) is zero unless i=k, and in that degree is free on these cores. At k=0, compressing the initial collar onto M0 gives the same calculation, including disjoint 0-handles.

2.1F3step 1.1algebra

Write δk:Ck→Hk−1(Wk−1) for the pair connector and pk−1:Hk−1(Wk−1)→Ck−1 for the quotient map. By [F3], ∂k=pk−1δk. Exactness of the pair (Wk−1,Wk−2) gives δk−1pk−1=0, so ∂k−1∂k=pk−2δk−1pk−1δk=0 for k≥2. For k=1 this follows from ∂0=0.

3.1F3step 1.1step 2.1algebra

The triple sequences and step 1.1 show inductively that Hi(Wj,M0)=0 for i>j. Fix k≥0. The triple (Wk,Wk−1,M0) therefore injects Hk(Wk,M0) into Ck. Its image is the kernel of the connector into Hk−1(Wk−1,M0), which itself injects into Ck−1 by the triple (Wk−1,Wk−2,M0) when k≥1. Naturality and the connector factorization identify that composite with ∂k. For k=0 the target is zero. Hence Hk(Wk,M0) identifies with ker⁡∂k.

4.1F3step 1.1step 3.1algebra

The triple (Wk+1,Wk,M0) identifies Hk(Wk+1,M0) with the cokernel of Ck+1→Hk(Wk,M0), because Hk(Wk+1,Wk)=0. Under step 3.1 this map is ∂k+1. Adding stages of index j≥k+2 changes neither Hk nor its map, since both Hk+1(Wj,Wj−1) and Hk(Wj,Wj−1) vanish. The finite filtration therefore gives Hk(W,M0)≅ker⁡∂k/im⁡∂k+1.

5.1F3F4step 1.1step 4.1algebra∎

The pair connector sends an upper core class to its oriented attaching sphere. To read its coefficient at ej, collapse the preceding stage and all other k-handle summands. In the outgoing piece Dk×Sd−k−1 of ej, d=dim⁡W, the resulting map to Dk/Sk−1 is projection onto the Dk factor. A regular value at its center has preimages exactly Ai∩Bj; the local degrees are I(Ai,Bj)'s local signs by the normal-orientation convention. Summing gives the displayed formula. For k=0 the connector records the two signed endpoints, and for k=d−1 the same calculation is dual. This local argument applies to a relative triad as well as a closed manifold. The coordinate convention and the two-index assertion now follow from steps 1.1–4.1.

Depends on

Used by

Dependency tree · two levels

77 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