Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Attaching handles of index at least q preserves homology below q-1

Statement

Assume ACω, let F be a field, and let q be an integer. Let W′ be obtained from a smooth manifold W with boundary by successively attaching finitely many rounded handles of indices at least q (Attaching a smooth handle with corner rounding). Then Hi(W′,W;F)=0 for every i≤q−1. Consequently the inclusion W→W′ induces isomorphisms Hi(W;F)→Hi(W′;F) for i≤q−2 and a surjection for i=q−1.

Facts & Assumptions

Given: A field F, a smooth manifold W with boundary, handles attached successively to obtain W′⊇W with indices ℓ1,…,ℓr≥q, and the intermediate manifolds W0=W⊆W1⊆⋯⊆Wr=W′.

[F1]

If N′=N∪φhk is obtained by attaching a rounded k-handle to a smooth manifold N with boundary, then Hi(N′,N;F)=0 for i≠k and Hk(N′,N;F)≅F, with the core class as generator (One handle changes relative homology in one degree only, part (a)).

[F2]

For spaces B⊆A⊆X and every abelian group G there is a long exact sequence ⋯→Hn(A,B;G)→Hn(X,B;G)→Hn(X,A;G)→δHn−1(A,B;G)→⋯ , with the first two maps induced by inclusions (Long exact sequence of a triple in singular homology).

[F3]

For A⊆X the pair sequence ⋯→Hn(A;G)→Hn(X;G)→Hn(X,A;G)→δHn−1(A;G)→⋯ is exact, with the first two maps induced by inclusions (Long exact sequence of a pair).

[L1]

For A=X the relative group Hn(X,X;G) vanishes for every n (Relative singular homology).

Proof

technique · induction-on-handles
1.1given

The intermediate manifolds Wj are smooth manifolds with boundary, since attaching a rounded handle to a smooth manifold with boundary produces one, and Wj is obtained from Wj−1 by attaching one handle of index ℓj≥q for each j.

1.2L1given

Claim, by induction on j, that Hi(Wj,W;F)=0 for every i≤q−1. For j=0 we have W0=W and Hi(W,W;F)=0 by [L1].

2.1F1step 1.1

Induction step: by [F1] applied to the attachment Wj−1→Wj, the group Hi(Wj,Wj−1;F) is F for i=ℓj and zero otherwise; since ℓj≥q, it vanishes for every i≤q−1.

3.1F2step 1.2step 2.1

The long exact sequence of the triple (Wj,Wj−1,W) from [F2] reads ⋯→Hi(Wj−1,W;F)→Hi(Wj,W;F)→Hi(Wj,Wj−1;F)→Hi−1(Wj−1,W;F)→⋯ . For i≤q−1 the first and last terms vanish by the induction hypothesis of step 1.2 and the middle term vanishes by step 2.1; exactness at the middle node then forces Hi(Wj,W;F)=0. This completes the induction.

4.1step 3.1

Taking j=r gives Hi(W′,W;F)=0 for every i≤q−1.

5.1F3step 4.1∎

The pair sequence contains Hi+1(W′,W;F)→Hi(W;F)→Hi(W′;F)→Hi(W′,W;F). For i≤q−2 both relative groups vanish by step 4.1, giving an isomorphism. For i=q−1 only the right relative group is known to vanish, giving a surjection; its kernel is the image of the connecting map from Hq(W′,W;F). Thus injection in this degree is not asserted.

Remarks

  • The case q=0. Every index is at least 0, so the vanishing statement is about i≤−1, where all homology vanishes; the isomorphism statements are about degrees ≤−2 and −1 and are vacuous. The lemma is used only for q≥1.
  • Use. This is the handle analogue of the skeletal stabilization step in the computation of cellular homology: handles attached above degree j leave the homology below j unchanged, which is what lets the handle chain complex of an index-ordered presentation compute H∗(M;F).

Depends on

Used by

Dependency tree · two levels

31 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