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

Trading concentrates a simply connected h-cobordism in two adjacent middle indices

Statement

Assume ACω (The Axiom of Countable Choice (ACω)). Let (W;M0,M1) be an h-cobordism with dim⁡W=n+1, n≥5, W connected and M0,M1 closed simply connected (h-Cobordism, Simply connected topological spaces). Then for every integer k with 2≤k≤n−2 there is a handle decomposition of W relative to M0 whose handles all have index k or k+1, with the same number r of each; the relative handle chain complex of that presentation is 0→Zr→∂k+1Zr→0, and since H∗(W,M0;Z)=0 the differential ∂k+1 is an isomorphism. No other handles survive, and the presentation can be chosen index-ordered with all k-handles attached at one level and all (k+1)-handles at the next (The relative handle chain complex computes H∗(W,M0) and has the intersection matrix as its differential).

Facts & Assumptions

Given: An h-cobordism (W;M0,M1) with dim⁡W=n+1, n≥5, W connected, closed simply connected faces, and an integer k with 2≤k≤n−2; ACω.

[F1]

W admits a self-indexed presentation relative to M0 with all k-handles at one level before all (k+1)-handles (h-Cobordisms admit adapted ordered handle decompositions), and admits presentations relative to M0 with no handles of index 0,1 (Zero- and one-handles are eliminated in a simply connected h-cobordism) and no handles of index n,n+1 (Duality eliminates the top and codimension-one handles).

[F2]

The relative handle chain complex has Cj=Hj(Wj,Wj−1;Z) free on the j-handle cores, differential the triple boundary, and homology Hj(W,M0;Z), which vanishes identically because (W;M0,M1) is an h-cobordism (The relative handle chain complex computes H∗(W,M0) and has the intersection matrix as its differential, Relative homology of an h-cobordism vanishes at both ends).

[F3]

The modification construction changes an embedded sphere's class by ∑jxj∂q+1[φj] and gives an isotopy to the starting sphere one level higher. In particular a modification starting at a trivial embedding remains trivial there; vanishing of a homology class alone is not an embedding-triviality assertion. Modification lemma: prescribed class changes by isotopy of an embedded boundary sphere.

[F4]

The corrected homology lemma puts a unit basis class into single-belt-intersection position for 2≤q≤n−3. At q=2 its incoming injection holds here since the incoming face is simply connected. The belt-complement helper constructs the required disk while avoiding every other belt. Homology lemma: a handle-basis class is realized by a sphere meeting the belt sphere once, Belt-sphere complements in low handle levels preserve the fundamental group.

[F5]

Elimination lemma with q≤n−2: a q-handle whose belt sphere is met once by a trivial-in-∂1Wq+1 framed sphere can be traded for a (q+2)-handle, all other handles unchanged (Elimination lemma: trading a handle for a handle two indices higher).

[F6]

Handle duality: negating the adapted Morse function interchanges the roles of the two faces and converts a j-handle of a presentation relative to M1 into an (n+1−j)-handle of a presentation relative to M0 (Handle duality from negating a Morse function, Dual handle decomposition).

Proof

1.1F1F2given

By [F1] take an ordered presentation with indices at least two and at most n−1. Each incoming inclusion is a homotopy equivalence and the relative homology vanishes by [F2].

2.1F2F3F4step 1.1

Eliminate the indices q=2,…,k−1, not the desired surviving index k. At each stage Nq=∂1Wq is simply connected: the later handles have index at least q+1≥3, so π1(Wq)≅π1(W)=1, and the reversed trace from Nq has only index n+1−q≥4 handles, so π1(Nq)≅π1(Wq). These are the handle fundamental-group comparisons of the belt-complement helper in [F4]. With no indices below q, one has Cq−1=0 and ∂q+1 is onto Cq. For a fixed q-handle e, choose coefficients yj with ∑jyj∂q+1[φj]=[e]. Start with a trivial framed q-sphere of class zero and apply [F3] to obtain β of class [e], isotopic to that trivial sphere one level higher. Use the framed version of [F3], starting with the standard trivial frame, so β is framed-isotopic to that trivial sphere in the next level.

3.1F3F4F5step 2.1

Since q≤k−1≤n−3, [F4] applies to β. Its q=2 incoming condition follows from simple connectivity of M0, or equivalently from the h-cobordism fundamental-group isomorphism. Carry the higher attaching embeddings along the resulting ambient isotopy; its induced diffeomorphism of the next level preserves standard framed triviality. A diffeomorphism maps a standard framed disk embedding to another such embedding. By [F5] trade e for one (q+2)-handle. Finite repetition eliminates all original indices below k.

4.1F4F5F6step 3.1

Reverse the triad and perform the same low-index eliminations through dual index n−k−1. Every such index is at most n−3; the opposite incoming face is simply connected, so the same q=2 condition holds. Trading a dual r-handle for a dual (r+2)-handle introduces original index n−r−1≥k, and thus never recreates an original handle below k. This removes all original indices at least k+2 while preserving the prior low elimination. The surviving original indices are exactly k,k+1, for the full stated 2≤k≤n−2 range.

5.1F2step 4.1∎

The surviving relative chain complex is concentrated in degrees k,k+1 and has zero homology by [F2]. Its differential is injective and surjective, giving equal finite handle numbers and the stated two-term isomorphism. The normal form retains every advertised index without invoking the unproved arbitrary-sphere flipped endpoint.

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