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.
Coherence of Seifert circles and the height of a diagram
Definition
Assume the Axiom of Choice. Let be two disjoint oriented circles in (Seifert smoothing and Seifert circles of an oriented link diagram) and let be the annulus they cobound, which exists and has the two circles as its boundary circles by Two disjoint circles in the two-sphere cobound an annulus. Orient once, a choice of one of its two orientations (Oriented smooth manifolds and oriented charts); this orientation induces a boundary orientation on each of the two boundary circles and , and reversing the orientation of reverses both induced orientations (Induced boundary orientation).
Coherence. The circles and are coherent when, with respect to one, equivalently any, orientation of , the given orientations of and agree with the two induced boundary orientations in opposite senses: one of the given orientations agrees and the other disagrees. Equivalently, the two given oriented circles represent the same element of , which is the formulation used in the survey. The two formulations are the classical description of one-dimensional coherent orientation of an annulus, and the equivalence of reversing the orientation of is immediate because both induced boundary orientations flip, so the relation "opposite senses of agreement" is independent of the chosen orientation. When the given orientations agree with the induced boundary orientations in the same sense (both agree or both disagree), the circles are incoherent.
Height. For an oriented diagram with Seifert picture and Seifert circles (Seifert smoothing and Seifert circles of an oriented link diagram), the height of is the number of distinct unordered pairs of indices such that and are incoherent:
Coherence is defined for every pair of Seifert circles of the picture, not only for pairs joined by a signed arc; the signed arcs only record the crossings of the original diagram. In particular means that all pairs of Seifert circles of are coherent. The axiom of choice is consumed exactly through the annulus lemma, which supplies the annulus and its two boundary circles; the rest of the definition, including the invariance under reversing the orientation of , is choice-free. Distinct Seifert circles are disjoint, so the definition applies to every one of the finitely many pairs, including pairs with no signed arc between them. The empty and one-circle pictures have height zero.
Depends on
Used by
- Defect regions, reducing arcs and the Yamada-Vogel reducing move Definition
- The Yamada-Vogel algorithm on a small diagram Example
- A height-zero diagram represents a closed braid Lemma
- A positive-height diagram has a defect region Lemma
- A reducing move lowers the height by one Lemma
- Braid-like moves can be moved to height zero Lemma
- Non-braid-like Reidemeister moves are generated by braid-like moves and reductions Lemma
- Reducing-move peaks can be lowered to the four-band case Lemma
- Alexander's theorem: every link is a closed braid Theorem
Dependency tree · two levels
20 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
- Birman and Brendle, Braids: A Survey, Handbook of Knot Theory chapter, author manuscript; section 2.2, printed pp. 13-16 (standard reference, not scraped)
- Traczyk, A new proof of Markov's braid theorem, Banach Center Publications 42 (1998), 409-419; section 1 (standard reference, not scraped)