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.

Zero- and one-handles are eliminated in a simply connected h-cobordism

Statement

Assume ACω (The Axiom of Countable Choice (ACω)). Let (W;M0,M1) be an h-cobordism with dim⁡W=n+1, n≥5, whose faces M0,M1 are closed simply connected n-manifolds and whose total space W is connected (h-Cobordism, Simply connected topological spaces). Then W admits a handle decomposition relative to M0 with no handles of index 0 or 1; equivalently, after self-indexing, every handle has index at least 2. The elimination proceeds one handle at a time: each 1-handle can be traded for a 3-handle without changing W relative to M0. The dimension hypothesis n≥5 enters here for the first time, in the construction of the embedded null-homotopy disk.

Facts & Assumptions

Given: The h-cobordism of dimension n+1, n≥5, its connected simply connected faces, and countable choice.

[F1]

An adapted index-ordered presentation exists; zero-handles can be removed relative to a nonempty connected incoming face. h-Cobordisms admit adapted ordered handle decompositions, Connected cobordisms admit presentations without superfluous zero handles

[F2]

A trace has a relative cell model; handles of index at least three change no fundamental group. Reading a j-handle backwards gives index n+1−j. A handle decomposition gives a relative CW complex, High relative cells do not change lower homotopy, Seifert–van Kampen identifies the fundamental group with a group pushout, Handle duality from negating a Morse function

[F3]

Smooth relative approximation and relative embedding of a disk are available when its target has dimension at least five. Transversality moves a curve off finitely many curves in dimension at least five. Relative Whitney approximation for manifold-valued maps, Metastable approximation of maps by embeddings, Parametric transversality, The transverse preimage theorem

[F4]

A finite Euclidean embedding and the radial projection-transport formula trivialize the normal bundle along a disk (The weak Whitney proper embedding theorem, Real Stiefel spaces with complement rank at least two are simply connected, proof step 1.2). Local tube charts extend a disk’s normal data; a handle's outgoing piece and belt have the disk-product form. The tubular neighbourhood theorem in a smooth ambient manifold, The outgoing boundary of a handle attachment trades the disk factors

[F5]

The elimination lemma trades one 1-handle for one 3-handle from a common-part framed circle which is standard trivial after the 2-handles. Elimination lemma: trading a handle for a handle two indices higher

Proof

technique · direct
1.1F1givenconstruct

By [F1] choose an ordered presentation without 0-handles. Write Tj=Wj for the trace through index j and Nj=∂1Tj. The initial outgoing level is M0. Deleting the finitely many 1-handle attaching disks leaves it connected: paths may be rerouted around each disk through its connected boundary sphere, since n≥5.

2.1F3F4step 1.1construct

In the outgoing piece of a selected 1-handle e, take D1×{x} with x∈Sn−1. Join its endpoints by an embedded arc in the punctured M0 and smooth the two corners; the arc can be chosen by smoothing a path and applying the relative curve embedding case of [F3]. The resulting circle γ⊂N1 meets the belt of e once at the midpoint of that outgoing core arc, and misses the other 1-handle belts. Perturb the old 2-handle core circles to miss γ: 1+1<n. Shrink their normal tubes, so γ and a small neighborhood lie in the common unchanged part of N1 and N2. These attaching isotopies transport the later handles.

3.1F2step 2.1given

γ is nullhomotopic in N2. Indeed W is simply connected by its incoming homotopy equivalence. The remaining forward handles after T2 have indices at least three, so π1(T2)→π1(W) is an isomorphism. The reversed presentation of T2 relative to N2 has indices n−1,n, both at least four, so π1(N2)→π1(T2) is an isomorphism as well. These applications concern the correct forward and reverse traces; no claim that index-three cells preserve π2 is needed.

4.1F3F4step 2.1step 3.1construct

A continuous filling disk can be made smooth relative to γ: insert the smooth boundary loop on a radial collar, extend that collar slightly past the disk boundary, and apply relative approximation on this extended source. Then use [F3] to embed the disk relative to its boundary, since 5≤n. Its normal bundle is trivial: in a finite Euclidean embedding, radial transport of its smooth orthogonal projection produces a frame over the contractible disk. Append the disk's outward boundary-normal line to that frame. For the tube near the disk boundary, extend its embedding slightly in the outward boundary-normal direction. The local inverse-function tube construction in [F4], followed by compactness of the disk and separation of distinct zero-section points, gives one sufficiently small embedded tube along the full disk, including its boundary. This does not require the closed boundaryless-submanifold hypothesis of the global tubular theorem. That tube gives the standard framed circle S1×Dn−1 along γ in N2. In tubular disk coordinates radial contraction into a small interior disk exhibits its standard triviality by a framed isotopy. Shrink its circle tube to remain in the common part of N1,N2, and read that same framed circle as an attachment in N1. No disk avoidance of full-dimensional higher attaching regions is asserted or needed.

5.1F1F5step 4.1∎

This framed circle satisfies both hypotheses of [F5], so trade e for a 3-handle. Repeating finitely removes all 1-handles. The procedure removes only 0- and 1-handles and introduces only 3-handles, carrying all other data. Index ordering can be restored by [F1]. Hence every remaining index is at least two, and an existing upper bound of at least three is preserved. The sole disk-embedding restriction is n≥5.

Depends on

Used by

Dependency tree · two levels

148 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