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.
Attaching-belt intersection matrix of adjacent-index handles
Statement
Assume . Let be a compact smooth -manifold with collared boundary, let , and let an index-ordered presentation attach -handles to a connected outgoing boundary , then attach -handles to the middle boundary . Suppose every attaching sphere meets every belt sphere of transversely. If the middle stage is oriented (the attachments extend the orientation of ) and the spheres carry the orientations induced by the handle framings and the induced boundary orientation of , put , the oriented intersection number. Without orientations put , the mod-2 intersection number. The resulting matrix is the attaching-belt intersection matrix of the adjacent-index handles. For a nontransverse configuration use the homotopy-invariant extensions in the cited intersection-number definitions. Whenever an isotopy of the attaching embeddings makes the configuration transverse, its entries are those same numbers; no separate existence theorem for an arbitrarily small embedding isotopy is asserted here. The computations on this page use configurations already transverse.
The matrix depends on the chosen index-ordered presentation, on the framings and orientations of the handles, but not on an isotopy used only to make the attaching spheres transverse to the fixed belt spheres (The oriented intersection number is homotopy invariant, The mod 2 intersection number is homotopy invariant). For the roles of the two families degenerate and the matrix is not defined here: the definition is restricted to the middle range , and the endpoint indices and are treated separately. When every pair is transverse the entries are finite sums of local signs by Compact transverse complementary intersections are finite, and the fixed-transverse entries are choice-free; Countable Choice is inherited only from the published intersection-number definitions cited above.
Depends on
- K handle core cocore attaching region and belt sphere
- Attaching a smooth handle with corner rounding
- Handle decomposition relative to the incoming boundary
- Transverse complementary-dimensional intersection sets
- Compact transverse complementary intersections are finite
- The oriented intersection number
- The mod 2 intersection number
- The local oriented intersection sign
- Induced boundary orientation
- Oriented smooth manifolds and oriented charts
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The oriented intersection number is homotopy invariant
- The mod 2 intersection number is homotopy invariant
Used by
- Adjacent-index handles with zero intersection do not cancel Counterexample
- Algebraic intersection one with three geometric points Counterexample
- The middle-handle intersection matrix of an h-cobordism Definition
- A handle slide realizes an elementary row operation Example
- A Morse function on the torus is perfect over every field Example
- An elementary cancelling handle pair gives a product cobordism Example
- Algebraic cancellation does not yet give geometric cancellation Lemma
- Geometric cancellation is a unit entry in the handle matrix Lemma
- Handle boundary coefficients are attaching-belt intersection numbers Lemma
- Homology lemma: a handle-basis class is realized by a sphere meeting the belt sphere once Lemma
- The group-labelled homology lemma realizes group-ring handle bases by isotopy Lemma
- Elementary matrix operations are realized by handle slides Proposition
- The relative handle chain complex computes H_*(W,M₀) and has the intersection matrix as its differential Proposition
Dependency tree · two levels
53 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
- C. T. C. Wall, Differential Topology (Cambridge Studies in Advanced Mathematics 156; complete PDF) (standard reference, not scraped)
- John Milnor, Lectures on the h-Cobordism Theorem (notes by L. Siebenmann and J. Sondow; scanned edition with text layer) (standard reference, not scraped)