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.

Acyclicity makes the simply connected middle-handle matrix unimodular

Statement

Assume ACω (The Axiom of Countable Choice (ACω)). Let (W;M0,M1) be a connected simply connected h-cobordism with dim⁡W=n+1, n≥5, and let a presentation relative to M0 have handles only in indices k,k+1 with 2≤k≤n−2, with r handles of each index (as supplied by the concentration lemma (Trading concentrates a simply connected h-cobordism in two adjacent middle indices)). Then the middle-handle intersection matrix M∈Mr(Z) (The middle-handle intersection matrix of an h-cobordism) is invertible over Z, i.e. its determinant is ±1, and M∈GL⁡r(Z). Equivalently, the differential ∂k+1:Ck+1→Ck of the relative handle chain complex is an isomorphism of finitely generated free abelian groups.

Facts & Assumptions

Given: A connected simply connected h-cobordism with dim⁡W=n+1, n≥5, presented with handles only in indices k,k+1, 2≤k≤n−2, with r handles of each index; ACω.

[F1]

In the two-index presentation the relative handle chain complex is 0→Ck+1→∂k+1Ck→0, with Ck,Ck+1 free abelian on the handle cores, and the row-coordinate matrix of ∂k+1 in these bases is M (the column-coordinate matrix is MT) (The relative handle chain complex computes H∗(W,M0) and has the intersection matrix as its differential, The middle-handle intersection matrix of an h-cobordism).

[F2]

Each Cj is free abelian on one generator per j-handle, and the homology of the complex computes Hj(W,M0;Z) (The relative handle chain complex computes H∗(W,M0) and has the intersection matrix as its differential, Relative homology of the standard handle pair).

[F3]

For an h-cobordism the relative homology vanishes in every degree, Hj(W,M0;Z)=0 (Relative homology of an h-cobordism vanishes at both ends).

Proof

technique · direct
1.1F1F2given

By the concentration lemma the presentation has handles only in the two adjacent indices k,k+1, so by [F1] the relative handle chain complex is 0→Ck+1→∂k+1Ck→0 with Ck,Ck+1 free abelian and bases given by the handle cores, and the row-coordinate matrix of ∂k+1 in these bases is M (the column-coordinate matrix is MT).

2.1F3step 1.1

Vanishing of the relative homology [F3] is exactly acyclicity of this complex: Hk+1(C∙)=ker⁡∂k+1=0 and Hk(C∙)=Ck/im⁡∂k+1=0. Hence ∂k+1 is injective and surjective, that is, a bijection of abelian groups.

3.1F2F4step 2.1

A bijection between the finitely generated free abelian groups Ck+1 and Ck forces their ranks to be equal, and the row-coordinate matrix of ∂k+1 is a square integer matrix invertible over Z (its inverse is the matrix of the inverse isomorphism). For r>0, view this matrix and its integer inverse over Q. The field determinant identity in [F4] gives det⁡Mdet⁡M−1=1; both determinants are integers by the Leibniz formula, so each is ±1. For r=0, set the empty determinant equal to 1 by the empty-product convention; the empty matrix is its own inverse. Thus M∈GL⁡r(Z).

4.1F1step 3.1∎

By the definition of the middle-handle matrix [F1] this invertible matrix is exactly M, so M is unimodular with det⁡M=±1. This is Ranicki's unimodularity proposition specialised to the trivial fundamental group, where the group ring reduces to Z.

Depends on

Used by

Dependency tree · two levels

71 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