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 middle-handle intersection matrix of an h-cobordism
Definition
In the situation of the concentration lemma (Trading concentrates a simply connected h-cobordism in two adjacent middle indices), choose an orientation of . Such an orientation exists: choose one at an interior basepoint and transport it along paths by Orientation local system and orientation cover. Transport depends only on endpoint-fixed path homotopy, so simple connectivity makes its value at each point unique. In each chart the transported value is constant in the orientation-cover coordinate; hence it is a continuous local orientation. The boundary collars extend this orientation to and induce one on each level. This is a single initial choice, not a family of independent choices.
Let the presentation of the h-cobordism have handles of index and of index , , attached at the two consecutive levels, and let be the outgoing boundary after the -handles (K handle core cocore attaching region and belt sphere). After an arbitrarily small isotopy of the attaching data the attaching spheres of the and the belt spheres of the are transverse, and the middle-handle intersection matrix of the h-cobordism for the chosen presentation is
the matrix of oriented intersection numbers in (The oriented intersection number, The local oriented intersection sign). The sphere orientations use the core and belt-normal convention of the relative handle-chain proposition and the boundary orientation of when is oriented (Oriented smooth manifolds and oriented charts); without orientations the matrix with entries the mod-two intersection numbers is defined (The mod 2 intersection number).
By the relative handle chain complex (The relative handle chain complex computes and has the intersection matrix as its differential) this matrix represents on row coordinate vectors, ; the matrix on column coordinate vectors is . For a fixed handle count, slides, sign changes and renumbering give the corresponding basis changes of this differential. Presentation changes may also insert or delete an isolated geometrically cancelling pair (Creation of a cancelling handle pair, Handle cancellation). Its attaching and belt spheres have no incidences with the old handles and meet one another once, so the new matrix is , , or after reorientation. In particular the empty and one-pair presentations of have matrices of sizes and ; presentation-dependence includes stabilization, which cannot be produced by size-preserving basis changes alone. The matrix is only readable for a configuration that is already transverse; if some pair is not transverse, the matrix is read after a small isotopy, which does not change the presented manifold. Countable choice is inherited from the intersection-number and handle suppliers (The Axiom of Countable Choice ()).
For fixed oriented attaching data the entries are independent of the small transverse isotopy, by the homotopy-invariance clause of The oriented intersection number; the same holds modulo two by The mod 2 intersection number. For the matrix is empty and the corresponding differential is the unique isomorphism .
The transverse isotopy can be chosen arbitrarily small: on the compact middle level , finitely many chart vector fields multiplied by compactly supported bumps span (A manifold bump for a compact set inside an open set). Compose their small-time flows to obtain a finite-parameter family of diffeomorphisms with (Compactly supported smooth vector fields are complete, The fundamental theorem on flows). The evaluation is a submersion for in a sufficiently small parameter ball, by the spanning condition at and compactness. Applied to the disjoint union of attaching spheres, parametric transversality to each of the finitely many fixed belt spheres gives parameters arbitrarily near zero that are good for all pairs (Parametric transversality). The isotopy applied to all upper attaching embeddings transports their framings and preserves their mutual disjointness; the belt spheres remain the fixed comparison family.
Depends on
- Attaching-belt intersection matrix of adjacent-index handles
- The relative handle chain complex computes $H_*(W,M_0)$ and has the intersection matrix as its differential
- Trading concentrates a simply connected h-cobordism in two adjacent middle indices
- Oriented smooth manifolds and oriented charts
- The local oriented intersection sign
- The oriented intersection number
- The mod 2 intersection number
- K handle core cocore attaching region and belt sphere
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Orientation local system and orientation cover
- Creation of a cancelling handle pair
- Handle cancellation
- Parametric transversality
- A manifold bump for a compact set inside an open set
- Compactly supported smooth vector fields are complete
- The fundamental theorem on flows
Used by
- Handle slides change the matrix but not the Whitehead torsion Example
- The handle matrix of a simple acyclic presentation Example
- Acyclicity makes the simply connected middle-handle matrix unimodular Lemma
- Group-labelled Whitney tricks realize the diagonalized handle complex Lemma
- Handle slides, renumberings and reorientations reduce a unimodular middle-handle matrix to the identity Lemma
- The Whitney trick realizes algebraic middle-handle cancellation geometrically Lemma
- Vanishing torsion allows algebraic diagonalization by simple handle moves Lemma
Dependency tree · two levels
93 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
- John Milnor, Lectures on the h-Cobordism Theorem (notes by L. Siebenmann and J. Sondow, Princeton University Press 1965; scanned edition with searchable text layer) (standard reference, not scraped)
- Andrew Ranicki, Algebraic and Geometric Surgery (Oxford Mathematical Monographs, Oxford University Press 2002; complete electronic copy) (standard reference, not scraped)