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 be a finite regular oriented link diagram with exactly one component, and let be its number of crossings. Perform the following construction in its projection sphere .
- Choose a point 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 be their number.
- For each Seifert circle , take the closure of the component of that does not contain . 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 .
- For every original crossing, attach one rectangular band along short boundary intervals on the two smoothing arcs. A half-twist means a single -degree turn of the band across the crossing neighborhood. Choose its direction, endpoint orientations, and over/under order to match the original crossing.
- Return the finite disk-and-band construction data together with .
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.
Definition references
Depends on
Used by
- Worked Seifert-algorithm counts for the trefoil, figure-eight, and kinked unknot Example
- One crossing change changes a Seifert matrix by rank at most one Lemma
- Seifert disks and bands form an embedded oriented spanning surface Lemma
- Seifert-matrix certificate for the Conway diagram Lemma
- The right trefoil has genus one Lemma
- Euler characteristic and genus of a Seifert disk-and-band surface Theorem
- Termination and finite output of the Seifert diagram procedure Theorem
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
- Danny Calegari, Introduction to Knot Theory, §3.2, pp.24–26 (standard reference, not scraped)
- Alessia Cattabriga and Stefano Francaviglia, Knot Theory and Applications: Lecture Notes, §4.3, pp.21–23 (standard reference, not scraped)