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.

Relative homology of the standard handle pair

Statement

For any abelian group G, integers 0≤k≤n, and i≥0, the standard handle pair has Hi(Dk×Dn−k,Sk−1×Dn−k;G)≅G if i=k and zero otherwise. Here D0 is a point and S−1=∅.

Facts & Assumptions

[F1]

K handle core cocore attaching region and belt sphere: For integers 0≤k≤n, the standard n-dimensional k-handle is Dk×Dn−k. Its core is Dk×{0}, its cocore is {0}×Dn−k, its attaching region is Sk−1×Dn−k, and its attaching sphere is Sk−1×{0}. The outgoing region is Dk×Sn−k−1 and the belt sphere is {0}×Sn−k−1. Here Dj is the closed unit disk, D0 is a point, and S−1=∅. For n=0 both boundary regions are empty.

[F2]

The singular chain homotopy formula: Let H:X×I→Y be a homotopy from f to g. Then the prism operator PH of def-prism-operator-for-a-homotopy satisfies g#−f#=∂PH+PH∂ as homomorphisms Cn(X;G)→Cn(Y;G) for every n≥1 and every abelian group G. In degree 0, the same identity reduces to g#,0−f#,0=∂PH:C0(X;G)→C0(Y;G).

[F3]

Long exact sequence of a pair: For A⊆X there is an exact sequence ⋯→Hn(A;G)→Hn(X;G)→Hn(X,A;G)→δHn−1(A;G)→Hn−1(X;G)→⋯ .

[F4]

Homology of spheres: For n≥1, H~k(Sn;G) is G for k=n and 0 otherwise. For S0, H~0(S0;G)≅G and all other reduced groups vanish. Thus H0(Sn;G)≅G for n≥1, whereas H0(S0;G)≅G⊕G.

[F5]

Contractible nonempty spaces have the homology of a point: If X is a nonempty contractible topological space, then for every n≥0 and every abelian group G, Hnsing(X;G)≅Hnsing(∗;G), where ∗ denotes a one-point space.

Proof

Given: The objects and hypotheses in the statement.

1.1F1algebra

The standard pair contracts its second disk factor by (u,v)↦(u,(1−t)v), with projection to and inclusion of (Dk,Sk−1) as inverse maps up to a homotopy of pairs. The attaching subspace is preserved even when empty.

2.1F2step 1.1

The prism formula descends to relative chains: prisms of simplices in the subspace remain in the subspace, so their classes vanish in the quotient chain complex. Thus the two maps in the previous step induce inverse homology maps, in degree zero as well as positive degrees.

3.1F5step 2.1algebra

If k=0, the reduced pair is (∗,∅), with homology G in degree zero and zero otherwise. Explicitly the chain complex of a point has one copy of G in each degree, and its boundary is the identity in positive even degrees and zero in odd degrees, so this computation includes arbitrary G. Every nonempty disk has that same homology by contractibility.

4.1F3F4step 3.1algebra∎

For k≥2, the pair exact sequence and sphere homology give the only nonzero relative group in degree k, isomorphic to G; in degrees zero and one the map H0(Sk−1;G)→H0(Dk;G) is the identity on G. For k=1, it is (g,h)↦g+h from G⊕G to G, whose kernel is {(g,−g)} and whose cokernel is zero. Hence H1(D1,S0;G)≅G and H0=0. This proves all cases, including G=0.

Depends on

Used by

Dependency tree · two levels

17 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