Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

The two-disk complement of a homotopy sphere is an h-cobordism

Statement

Assume ACω. For d≥6, removing the interiors of two disjoint smoothly embedded closed d-disks from a smooth homotopy d-sphere Σ gives a compact simply connected h-cobordism between two standard Sd−1 boundary faces.

Facts & Assumptions

Given: A smooth homotopy d-sphere Σ with d≥6 and two disjoint smoothly embedded closed disks D1,D2⊆Σ, with W=Σ∖(int⁡D1∪int⁡D2).

[A1]

Countable choice ACω is assumed (The Axiom of Countable Choice (ACω)).

[L1]

Van Kampen computes the fundamental group of a union with connected overlap (Seifert–van Kampen identifies the fundamental group with a group pushout), and the colimit decomposition of W with a disk reattached gives W simply connected because the disks and the overlap collar are simply connected for d≥6. [A1, given]

[L2]

Excision and the long exact sequence of the pair identify the homology of the complement of a disk with the homology of the punctured sphere, and the two-disk complement has the homology of Sd−1×[0,1], with each boundary inclusion inducing an isomorphism in integral homology (Excision for singular homology, Long exact sequence of a pair, Mayer–Vietoris sequence in singular homology, Smooth homotopy sphere).

[L3]

Under ACω every compact smooth manifold has a finite CW model, and the simply connected finite-model homology criterion derived in [L2] of Connected sum preserves oriented homotopy spheres applies (Compact smooth manifolds have finite CW models under countable choice, Relative Hurewicz comparison through a choice-free weak model, Whitehead theorem).

[L4]

An h-cobordism between closed smooth manifolds is a compact cobordism whose two face inclusions are homotopy equivalences (h-Cobordism).

Proof

technique · direct
1.1L1A1given

Removing finitely many disks leaves a path-connected manifold, since paths crossing them can be diverted along their connected boundary collars. Reattach the two disks successively to W, using collar-thickened open covers; each overlap retracts to the simply connected Sd−1. Van Kampen [L1] shows that each reattachment preserves the fundamental group. The final space is Σ, so π1(W)=π1(Σ)=0.

2.1step 1.1L2algebra

Orient Σ. Excision identifies Hk(Σ,W) with Hk(D1,∂D1)⊕Hk(D2,∂D2), zero except for Z2 in degree d. The map Hd(Σ)=Z→Z2 is 1↦(1,1), using the two local disk orientations. The pair sequence therefore gives Hd(W)=0, Hd−1(W)=Z2/⟨(1,1)⟩≅Z, and zero reduced homology in every other degree. Each boundary sphere maps to the class of its coordinate vector, up to its boundary-orientation sign, hence generates Hd−1(W). Both face inclusions are integral homology equivalences.

3.1step 1.1step 2.1L3

By [L3] W has a finite CW model. Transport each inclusion from the finite sphere to that model; step 1.1 gives simple connectivity, and step 2.1 gives homology equivalence. The finite-model homology criterion in [L3] makes each inclusion a homotopy equivalence.

4.1step 3.1L4∎

Thus the compact smooth d-manifold W, with its two standard sphere faces, meets exactly the definition of an h-cobordism [L4]. This proves the assertion for d≥6.

Depends on

Used by

Dependency tree · two levels

56 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