Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-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.

Elementary moves do not constitute full Cerf theory here

Remarks

This page records only the elementary moves: introduction and cancellation of a complementary pair of consecutive indices (birth and death), handle slides (handle additions), and the elementary matrix operations they induce on the attaching-belt intersection matrix. It does not construct a one-parameter family of Morse functions, does not assert that any two Morse functions or handle presentations of a cobordism are connected by finitely many of these moves, and does not develop Cerf theory, pseudo-isotopy or the classification of one-parameter families. The removal of excess geometric intersections by ambient isotopy (the Whitney trick) is likewise not available here: the cancellation theorem is proved only under its exact single-transverse-intersection hypothesis.

This remark fixes the proof boundary of the page and is not an existence or classification statement, with no separate proof. The excess-intersection step is deferred, as recorded in the coverage of this pair, to the Whitney trick and surgery below the middle dimension ↗, because the cancellation theorem and its local model are proved here only under the exact single-transverse-intersection hypothesis.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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