Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedPipeline-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.

Handle duality from negating a Morse function

Statement

Assume ACω. Let (W;M0,M1) be a compact triad with adapted excellent Morse function f and adapted field X. Then 1−f is an adapted excellent Morse function for the reversed triad (W;M1,M0), with the same critical points, of indices n−ind⁡(p), and −X is an adapted field for 1−f. The handle decomposition of 1−f relative to M1 is the dual of the decomposition of f relative to M0: each k-handle corresponds to an (n−k)-handle in reverse order, and attaching and belt spheres are interchanged.

Facts & Assumptions

[F1]

Smooth cobordism triad for Morse theory: A smooth cobordism triad (W;M0,M1) is a compact smooth n-manifold with boundary, for n≥1 two closed embedded (n−1)-submanifolds with ∂W=M0⊔M1, and fixed collars; for n=0 the faces and collar domains are empty, with no dimension-−1 manifold; the reversed triad is (W;M1,M0) with the faces exchanged.

[F2]

Morse function adapted to a cobordism: An adapted pair (f,X) has f−1(0)=M0, f−1(1)=M1, f constant on the faces, all critical points interior, nondegenerate and outside a fixed collar, and X a complete downward gradient-like field pointing outward along M0 and inward along M1; excellent means distinct critical points have distinct values.

[F3]

Morse lemma and Nondegenerate critical points, nullity, index, and coindex: near a nondegenerate critical point of index λ there are coordinates with f=f(p)−∑i≤λ(xi)2+∑i>λ(xi)2; the index is the number of negative squares of the Hessian and equals n minus the index of the negated Hessian.

[F4]

Morse functions and handle decompositions correspond: Assume ACω. An adapted excellent Morse function on a compact triad determines a finite handle decomposition relative to the incoming face with one handle of index ind⁡(p) per critical point, whose attaching sphere is the boundary of the unstable disk of the adapted field transported to the lower regular level.

[F5]

Dual handle decomposition: Given a handle decomposition of the triad relative to M0, the dual decomposition is the presentation of the reversed triad (W;M1,M0) relative to M1 with the same handle bodies read with the two disk factors exchanged, attached in reverse order; a k-handle becomes an (n−k)-handle, the attaching region of the original handle is the outgoing region of the dual handle, the attaching sphere of the original handle is the belt sphere of the dual handle, and conversely.

[F6]

Unstable disk is the handle core: For the adapted descending field used in the handle construction, the unstable disk of p down to the lower regular level is the core of the attached handle and its boundary is the attaching sphere.

[F7]

Index zero handles create components and Index n handles cap boundary spheres: a 0-handle attaches along the empty set and adds a disjoint n-disk; an n-handle attaches along its whole boundary sphere.

[F8]

The Axiom of Countable Choice (ACω): ACω: every at most countable family of nonempty sets has a choice function.

Proof

Given: The compact triad (W;M0,M1) with adapted excellent Morse function f and adapted field X, and n=dim⁡W.

1.1F2F3givenalgebra

The negated function is Morse with the same critical points. Since d(1−f)=−df, the critical set of 1−f equals Crit⁡(f); at a critical point p the Hessian satisfies Hess⁡p(1−f)=−Hess⁡p(f), so the nondegeneracy is preserved and the negative eigenspace of f becomes the positive eigenspace of 1−f: by [F3], ind⁡1−f(p)=n−ind⁡f(p). The critical values 1−c are again pairwise distinct, so 1−f is excellent, and its critical points lie outside the same collars.

1.2F1F2F3givenalgebra

The negated field. Off the critical set, d(1−f)(−X)=df(X)<0, and in the Morse coordinates (u,v) of f at p, where f=f(p)−∣u∣2+∣v∣2 and X=(2u,−2v), one has 1−f=(1−f(p))+∣u∣2−∣v∣2 and −X=(−2u,2v); writing the coordinates in the order (v,u) exhibits −X in the model form required of a downward gradient-like field for 1−f. Negating a complete field preserves completeness, and −X points inward along M0 and outward along M1, which is exactly the adapted boundary behaviour for the reversed triad (W;M1,M0): its incoming face is M1 and its outgoing face is M0.

2.1F1F2step 1.1step 1.2algebra

The reversed function is adapted and excellent on the reversed triad. Indeed (1−f)−1(0)=f−1(1)=M1 and (1−f)−1(1)=f−1(0)=M0, the function (1−f) is constant on the faces because f is, and by steps 1.1 and 1.2 it is Morse with all critical points interior and outside the fixed collars, so (1−f,−X) is an adapted pair for (W;M1,M0); it is excellent by step 1.1.

2.2F3F6step 1.2algebra

The unstable disk of −X is the stable disk of X. In the Morse coordinates (u,v) of [F3] at p, the field X is (2u,−2v) and −X is (−2u,2v); trajectories of X converge to p backwards along the u-directions and forwards along the v-directions, while trajectories of −X converge to p backwards along the v-directions and forwards along the u-directions. Hence the unstable disk of −X at p is the stable disk of X at p, of dimension n−ind⁡(p), and the unstable disk of X at p is the stable disk of −X.

3.1F4F8step 1.1step 2.1algebra

The induced decomposition of the reversed triad. By [F4] applied to the adapted excellent pair (1−f,−X) on (W;M1,M0), the function 1−f determines a finite handle decomposition of W relative to M1, with one handle of index n−ind⁡(p) for each critical point p, and the attaching sphere of that handle is the boundary of the unstable disk of p for the field −X, transported to the lower regular level of 1−f. The order of the handles is the order of increasing values of 1−f, that is, the reverse of the order of increasing values of f.

4.1F4F5F6F7step 2.2step 3.1algebra

The decomposition is the dual one. In the decomposition of f relative to M0, the handle at p has index k=ind⁡(p), its core is the unstable disk of X at p by [F6], and its belt sphere is the boundary of the complementary disk, which is the stable disk read in the outgoing boundary; correspondingly, in the decomposition of 1−f relative to M1, the handle at p has index n−k, its core is the unstable disk of −X, that is the stable disk of X, and its attaching sphere is the flow-transported boundary of that disk. Comparing with [F5], the two presentations have the same handle bodies with the disk factors exchanged, the order is reversed, the attaching region of each handle of the first presentation is the outgoing region of the corresponding handle of the second, and the attaching and belt spheres of each handle are interchanged. Therefore the decomposition of 1−f relative to M1 is exactly the dual decomposition of the decomposition of f relative to M0. The endpoint cases are included: a 0-handle of the first presentation, a disjoint disk, corresponds to an n-handle of the dual presentation, and conversely by [F7], with the same interchange of spheres.

5.1F2F4F5step 2.1step 4.1algebra∎

Conclusion. The function 1−f is an adapted excellent Morse function for the reversed triad with the same critical points and indices n−ind⁡(p), the field −X is adapted for it, and by step 4.1 the handle decomposition of 1−f relative to M1 is the dual of the decomposition of f relative to M0, with k-handles corresponding to (n−k)-handles in reverse order and with attaching and belt spheres interchanged. This is Wall's duality argument via −f; only the collar, handle and correspondence suppliers are used, through ACω.

Depends on

Used by

Dependency tree · two levels

49 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