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.
Geometrically cancelling adjacent handle pair
Statement
Let be a compact collared triad and let be consecutive handles of a finite handle decomposition relative to (). If the pair occupies positions , write for the outgoing boundary after the lower handle, where is the stage after the first handles (). The pair is geometrically cancelling when the attaching sphere of and the belt sphere of meet transversely in exactly one point. For both spheres are positive-dimensional, and , so and transversality is the usual complementary-dimensional condition. Endpoint conventions, which are part of the definition: for the belt sphere is the new boundary sphere of the attached -handle (disconnected when ), the attaching sphere of the -handle is a -sphere, and "meets transversely in one point" means that exactly one of the two points of lies in (transversality is then automatic); for the roles are dual: is an embedded boundary sphere in (an entire connected component when ) and exactly one of the two points of the -sphere lies in . The definition asserts no cancellation; it only fixes the configuration.
The intersection in the definition is the transverse complementary-dimensional intersection of Transverse complementary-dimensional intersection sets in the closed -manifold , so it is a finite set of points whenever the two spheres are transverse; the middle cases are the ones for which the attaching-belt intersection matrix is defined. No orientation is used and no choice principle enters.
Depends on
Used by
- Adjacent-index handles with zero intersection do not cancel Counterexample
- A cancelling one-two handle pair on a surface Example
- A cancelling zero-one handle pair Example
- An elementary cancelling handle pair gives a product cobordism Example
- Elimination lemma: trading a handle for a handle two indices higher Lemma
- Group-labelled Whitney tricks realize the diagonalized handle complex Lemma
- Handle boundary coefficients are attaching-belt intersection numbers Lemma
- Middle-handle pairs with one geometric intersection cancel Lemma
- One transverse intersection gives the standard local cancelling model Lemma
- Elementary moves do not constitute full Cerf theory here Remark
- Handle slides are not handle cancellations Remark
- Creation of a cancelling handle pair Theorem
- Handle cancellation Theorem
Dependency tree · two levels
14 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)
- Wolfgang Lück, A Basic Introduction to Surgery Theory (ICTP lecture notes; complete author PDF) (standard reference, not scraped)