Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Bridge number and unknotting number of an oriented knot

Definition

Assume the Axiom of Countable Choice. Identify the oriented S3 with the unit sphere in R4 by an orientation-preserving diffeomorphism and fix the standard height h(x1,x2,x3,x4)=x4. Its only critical points are the two poles, and each regular level is a 2-sphere. A Morse representative of a smooth oriented knot K is a knot ambient isotopic to K on which h has only nondegenerate critical points. Define the bridge number b(K) as the minimum number of local maxima of h on a Morse representative of K. The standard unknot is the oriented unit circle in a fixed coordinate 2-plane of S3.

A regular oriented diagram is a projection of a smooth oriented knot with finitely many transverse double points, no other multiple points, and an over/under choice at each double point. A crossing change switches which branch is over at one chosen double point and leaves the projection and strand orientations unchanged. Define the unknotting number u(K) as the minimum number of crossing changes needed to turn some regular diagram of a representative of K into a diagram of the standard unknot. Both minima are taken in subsets of N. The Morse-representative set is nonempty by the first well-definedness result below; under countable choice the regular-diagram existence result and the descending-diagram theorem below make the unknotting set nonempty. The bridge-number definition and the least-element argument in N require no choice; countable choice is used only to invoke the stated regular-projection supplier for u(K).

Depends on

Used by

Dependency tree · two levels

22 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