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.
Defect regions, reducing arcs and the Yamada-Vogel reducing move
Definition
Assume the Axiom of Choice. Let be an oriented diagram with Seifert picture , consisting of the Seifert circles and the finite set of signed arcs recording the crossings (Seifert smoothing and Seifert circles of an oriented link diagram), and let coherence of pairs of Seifert circles be as in Coherence of Seifert circles and the height of a diagram.
A region of is a connected component of , where includes both the circles and the signed arcs. Thus a region contains no signed arc in its interior. Its boundary can contain signed arcs and portions of Seifert circles. A region is a defect region if two Seifert circles that are incoherent both occur in the boundary of that region. The existence of a defect region when the height is positive is the content of the defect-region lemma below.
A reducing arc is a simple arc contained in a defect region together with its endpoints, joining an incoherent pair of Seifert circles and meeting the union of the Seifert circles exactly in its two endpoints; the arc may be taken polygonal inside the region.
The Yamada-Vogel reducing move performed along slides one of the two circles, say , over the other along : in the diagram this is a Reidemeister II move of the original diagram in which a neighbourhood of the arc is replaced by the standard band picture of two crossings of opposite signs, so that in the new Seifert picture the incoherent pair is replaced by two coherent Seifert circles joined by two signed arcs of opposite signs, all other Seifert circles unchanged, bounds a disk containing no other new Seifert circle, and bounds a disk containing all Seifert circles that were contained in the annulus cobounded by and . The inverse of a reducing move is also allowed. A diagram is reducible when it admits a reducing arc; the move is defined for every defect region and the resulting picture is again a Seifert picture of an oriented diagram of the same link.
The choice axiom is used exactly where coherence is used, through the annulus lemma of Two disjoint circles in the two-sphere cobound an annulus; the local band picture of the move itself is an explicit Reidemeister II replacement of two oppositely signed crossings.
Depends on
Used by
- 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
- Reidemeister moves between closed braid diagrams factor through Markov moves Lemma
- Alexander's theorem: every link is a closed braid Theorem
Dependency tree · two levels
16 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 and Figures 4-5, 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 and Figure 1 (standard reference, not scraped)