Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)verified 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.

Seifert disk-and-band construction from an oriented knot diagram

Definition

Assume the Axiom of Countable Choice. Let D be a finite regular oriented link diagram with exactly one component, and let c be its number of crossings. Perform the following construction in its projection sphere S2.

  1. Choose a point q∈S2 outside the finite diagram. In pairwise disjoint small disks about the crossings, replace each crossing by the unique noncrossing smoothing compatible with the strand orientations. Let the resulting oriented circles be the Seifert circles and let s be their number.
  2. For each Seifert circle C, take the closure of the component of S2∖C that does not contain q. Under the stated choice axiom, each such region is an embedded compact disk. The finite family of disk regions is nested or disjoint. Orient each disk to induce the given orientation of its boundary circle, then place nested disks at distinct nearby heights ordered by inclusion; the resulting disk interiors are pairwise disjoint in S3.
  3. For every original crossing, attach one rectangular band along short boundary intervals on the two smoothing arcs. A half-twist means a single 180-degree turn of the band across the crossing neighborhood. Choose its direction, endpoint orientations, and over/under order to match the original crossing.
  4. Return the finite disk-and-band construction data together with (s,c).

The returned data are a finite attached two-dimensional complex. This algorithm's definition alone does not assert that the resulting image is embedded, is a surface, is connected, or has the original knot as boundary; the separate correctness lemma establishes those properties.

Depends on

Used by

Dependency tree · two levels

39 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