Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 handle chain complex computes singular homology

Statement

Assume ACω. Let M be a closed smooth n-manifold, let f:M→R be a Morse function and let F be a field. Then there are an index-ordered finite handle presentation of M with exactly mk(f) handles of index k, and a chain complex (C∙,∂∙) of finite-dimensional F-vector spaces, a handle chain complex of (M,f,F), such that:

(i) Ck has a chosen basis in bijection with the k-handles, given by the relative classes of their core disks, so dim⁡FCk=mk(f);

(ii) ∂k:Ck→Ck−1 is the boundary homomorphism of the triple of successive handle stages Wk⊇Wk−1⊇Wk−2;

(iii) ∂k−1∂k=0;

(iv) Hk(C∙)≅Hk(M;F) for every k.

In particular Hk(M;F) is finite-dimensional for every k and vanishes for k>n.

Facts & Assumptions

Given: A closed smooth n-manifold M, a Morse function f, a field F, and the notation mk=mk(f).

[F1]

A Morse function on a compact manifold has finitely many critical points (A Morse function on a compact manifold has finitely many critical points), and the critical values can be separated by a local modification, producing an excellent Morse function with the same critical points (For a compact Morse function, disjoint local bump perturbations can separate finitely many equal critical values without changing the Hessians).

[F2]

The needed adapted field can be constructed by patching the Euclidean descending fields in disjoint critical charts with a negative gradient elsewhere, as in Adapted excellent Morse functions exist on compact cobordisms. Equal-index adjacent levels can be separated and then assigned the same value by Gradient-like perturbation separates adjacent critical levels and Critical values of disjoint trajectory closures can be interchanged. For the triad (M;∅,∅) with the empty-face convention, an adapted excellent Morse function determines a finite handle presentation with exactly one handle of index ind⁡(p) per critical point; the presentation can be rearranged into index order, and handles of equal index can be attached on one level (Morse functions and handle decompositions correspond, Rearrangement of critical levels by index, Handles of equal index can be attached on one level, Handle decomposition relative to the incoming boundary).

[F3]

If N′=N∪φhk is obtained by attaching a rounded k-handle, then Hi(N′,N;F)=0 for i≠k and Hk(N′,N;F) has the relative core class as a generator (One handle changes relative homology in one degree only, part (a)); for several handles attached at one level the relative group is the direct sum of the handle contributions with the relative core classes as a basis (One handle changes relative homology in one degree only, part (b)); the core, cocore and belt objects are those of K handle core cocore attaching region and belt sphere.

[F4]

Attaching finitely many handles of index at least q to a smooth manifold with boundary does not change Hi in degrees i≤q−2 and surjects in degree q−1 (Attaching handles of index at least q preserves homology below q-1).

[F5]

For B⊆A⊆X there is a long exact sequence ⋯→Hn(A,B;G)→Hn(X,B;G)→Hn(X,A;G)→δHn−1(A,B;G)→⋯ and the triple connector factors as the pair connector followed by the quotient map (Long exact sequence of a triple in singular homology).

[F6]

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]

A chain complex of F-vector spaces is a graded family with dn−1dn=0, and its homology in degree n is ker⁡dn/im⁡dn+1 (Chain complex in an abelian category, Homology object of a chain complex, Relative singular homology).

Proof

technique · cellular-transposition
1.1F1F2given

For nonempty M, first rescale f into (0,1) by an increasing affine map; with both faces empty it is adapted. Apply the local separation of [F1], keeping the critical points and indices, construct the adapted field as in [F2], then apply the correspondence and index rearrangement of [F2]. The rearrangement puts indices in order. Equal-index consecutive handles can be made simultaneous by applying the separation and equal-value interchange arguments underlying [F2] within their index block; the crossing-sphere dimension inequality is (k−1)+(n−k−1)<n−1. Thus take stages W−1=∅⊆W0⊆⋯⊆Wn=M, where Wk adds the mk handles of index k along disjoint attaching regions. For empty M take every stage empty. In all cases set Wj=∅ for j<0 and Wj=M for j>n, so all endpoint triples are defined.

2.1F3step 1.1

By [F3], applied at the single level Wk, the relative group Hj(Wk,Wk−1;F) is zero for j≠k and is an F-vector space of dimension mk for j=k; choose an orientation of each core disk, and take the resulting relative classes as its basis. Setting Ck:=Hk(Wk,Wk−1;F) (with W−1=∅) gives graded F-vector spaces with dim⁡FCk=mk, a basis as in (i); in particular Ck=0 for k∉{0,…,n}.

3.1F5step 2.1

Define ∂k:Ck→Ck−1 as the composite of the connecting map δk:Ck→Hk−1(Wk−1;F) of the pair (Wk,Wk−1) with the quotient map Hk−1(Wk−1;F)→Hk−1(Wk−1,Wk−2;F)=Ck−1. By the factorization clause of [F5] this is exactly the boundary homomorphism of the triple Wk⊇Wk−1⊇Wk−2, which is assertion (ii). It is a homomorphism of F-vector spaces, and for k=0 the target is zero.

3.2F6step 1.1step 2.1

Auxiliary computation: Hj(Wk;F)=0 whenever j>k. For k=0 this is immediate since W0 is a disjoint union of disks. For the induction step and j>k, step 2.1 makes both relative terms vanish in the exact sequence 0=Hj+1(Wk,Wk−1)→Hj(Wk−1)→Hj(Wk)→Hj(Wk,Wk−1)=0. Thus Hj(Wk)≅Hj(Wk−1)=0.

4.1F6step 3.1

∂2=0: the composite ∂k−1∂k is the composite Ck→ δk Hk−1(Wk−1)→ qk−1 Ck−1→ δk−1 Hk−2(Wk−2)→ qk−2 Ck−2, and the middle two arrows compose to zero by exactness of the pair sequence of (Wk−1,Wk−2) at the node Hk−1(Wk−1,Wk−2) (the image of the quotient map is the kernel of the connecting map); hence ∂k−1∂k=0, which is (iii).

4.2F6step 3.2step 3.1algebra

By step 3.2, Hk(Wk−1;F)=0 and Hk−1(Wk−2;F)=0. The pair sequences therefore show that ik:Hk(Wk;F)→Ck is injective with image ker⁡δk, and that qk−1:Hk−1(Wk−1;F)→Ck−1 is injective. Since ∂k=qk−1δk, it follows that ker⁡∂k=ker⁡δk=ik(Hk(Wk;F)). For k=0 the target is zero and the same conclusion follows from W−1=∅.

5.1F5F6step 2.1step 4.2algebra

From the pair sequence of (Wk+1,Wk), whose relative group vanishes in degree k by step 2.1, there is an exact tail Ck+1→ δk+1 Hk(Wk;F)⟶Hk(Wk+1;F)⟶0, so Hk(Wk+1;F)≅Hk(Wk;F)/im⁡δk+1; under the injection ik of step 4.2 the subspace im⁡δk+1 corresponds exactly to im⁡∂k+1=im⁡(qkδk+1). Taking quotients gives Hk(C∙)=ker⁡∂k/im⁡∂k+1≅Hk(Wk;F)/im⁡δk+1≅Hk(Wk+1;F).

6.1F4step 2.1step 5.1L1∎

Finally Hk(Wk+1;F)≅Hk(M;F): the remaining handles, attached to Wk+1, all have index at least k+2, so [F4] with q=k+2 gives an isomorphism in degree k; when k=n no handles remain and Wn+1=Wn=M. Combining with step 5.1 gives Hk(C∙)≅Hk(M;F), which is (iv). Since dim⁡FCk=mk<∞ by step 2.1, every Hk(C∙) is finite-dimensional and vanishes for k>n, and so does Hk(M;F). This transposes the proof that cellular homology computes singular homology from the CW filtration to the handle filtration, using the concentration of step 2.1 in place of the skeletal concentration.

Remarks

  • Dependence on the presentation. The complex depends on the chosen handle presentation; every such complex computes the same singular homology by the proof. No claim that all presentations are related by attaching-data isotopies is needed.
  • Orientation and row vectors. No orientation of M is used in the construction; the boundary coefficients are computed by intersection numbers only in the separate boundary-coefficient lemma, where an orientation is assumed for the oriented statement.
  • Choice. ACω enters through the handle-presentation suppliers of [F2] (separation of critical values, corner rounding, rearrangement) and through [F3]; the linear-algebraic part of the argument is choice free.

Depends on

Used by

Dependency tree · two levels

80 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