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 h-cobordism theorem when the Whitehead group vanishes
Statement
Assume . Let be a nonempty connected oriented smooth h-cobordism of dimension with closed connected oriented and let . If — for instance if is trivial — then every presentation-indexed class vanishes, and is diffeomorphic to relative to . In particular the classical simply connected h-cobordism theorem is the case .
Facts & Assumptions
Given: A nonempty connected oriented smooth h-cobordism of dimension with closed connected oriented and , and the hypothesis .
Every finite handle presentation of has a well-defined contraction torsion of its based handle complex, and hence a presentation-indexed class (Presentation-indexed Whitehead torsion of an h-cobordism, K₁ of a ring and the Whitehead group of a discrete group, h-Cobordism).
A finite handle presentation of exists: the two-index normal-form lemma applies to the oriented data of the statement and produces a handle decomposition of relative to with handles only in degrees and for every , under the countable-choice hypothesis assumed here (h-cobordisms admit two-index normal form presentations, The Axiom of Countable Choice ()).
A presentation with vanishing presentation-indexed torsion gives a product structure relative to , and the vanishing-torsion sufficiency theorem applies to any finite presentation (Vanishing presentation-indexed torsion implies the product cobordism).
The trivial group has vanishing Whitehead group: ; the determinant is a well-defined surjection because every elementary matrix has determinant and the classes of the matrices occur; and it is injective, since a common divisor of the entries of a column of an invertible integer matrix divides the determinant , the division algorithm with the Bézout identity reduces such a primitive column to by elementary row additions and swaps, and induction on the size then presents every invertible integer matrix, up to permutation, as elementarily equivalent to a diagonal matrix with entries , whose class is a sum of classes ; hence and (K₁ of a ring and the Whitehead group of a discrete group, Division with remainder in : for and there are unique with and , Bézout's identity: for integers not both zero, is the least positive element of ; in particular has an integer solution).
Proof
Take a finite handle presentation of , which exists by [F2]; by [F1] its presentation-indexed class is an element of , and by hypothesis , so automatically, without any independence of presentations being needed.
Since the chosen presentation has vanishing presentation-indexed torsion, the vanishing-torsion sufficiency theorem of [F3] applies to it and yields that is diffeomorphic to relative to ; this argument works for every presentation because every presentation's class lies in the zero group.
The case is covered because [F4] gives , so the simply connected h-cobordism theorem is the special case of the statement in which the fundamental group is trivial.
Depends on
- Presentation-indexed Whitehead torsion of an h-cobordism
- K₁ of a ring and the Whitehead group of a discrete group
- h-cobordisms admit two-index normal form presentations
- Vanishing presentation-indexed torsion implies the product cobordism
- h-Cobordism
- Division with remainder in $\mathbb{Z}$: for $a \in \mathbb{Z}$ and $b > 0$ there are unique $q, r \in \mathbb{Z}$ with $a = qb + r$ and $0 \le r < b$
- Bézout's identity: for integers $a, b$ not both zero, $\gcd(a,b)$ is the least positive element of $\{\, ax + by : x, y \in \mathbb{Z} \,\}$; in particular $ax + by = \gcd(a,b)$ has an integer solution
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
65 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
- Wolfgang Lück, A Basic Introduction to Surgery Theory (ICTP lecture notes, 27 October 2004; complete author text) (standard reference, not scraped)
- Andrew Ranicki, Algebraic and Geometric Surgery (Oxford Mathematical Monographs, electronic edition) (standard reference, not scraped)