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.
Ordinary exchange moves are Markov sequences
Statement
Let , , placed on the first strands of , and . The ordinary exchange is realized by conjugations, one ordinary negative stabilization into , and one ordinary negative destabilization back to . It can also be realized with one positive stabilization and one positive destabilization. These are the ordinary moves of Markov conjugation and stabilization moves; conjugations are counted separately. The boxes are arbitrary on their specified strands.
Facts & Assumptions
Given: , and their specified strand placements.
The Artin relations are and far commutation for index difference greater than one (The braid group by Artin presentation).
Conjugations in a fixed braid group and between and are ordinary Markov moves (Markov conjugation and stabilization moves).
Proof
Supports and mixed relations. Append strand and write . Every letter of has index at most , so both boxes commute with and , including when and the boxes are trivial in . From obtain , hence . Also by inversion and rearrangement of the same relation, and therefore : indeed , where the first equality follows from . These identities hold without moving either box across .
Stabilization and the first weaving. Put and in . Then . Conjugate to , negatively stabilize to , and conjugate by to . The latter equals by step 1.1. Thus is reached by exactly one negative ordinary stabilization and conjugations. With Figure 11's ports numbered from outermost to innermost, the old innermost strand is and the added inner strand is ; the two boxes occupy the first old ports. The successive crossing letters of the right-hand weaving are , followed after by , giving precisely the chronological record . For these ordinary strands the indicated full twist on a single added strand is .
The exchange calculation and the last weaving. Define . Its successive left-hand weaving letters read chronologically, with the same ports and cut, are , after the initial and . Since commute with , use step 1.1 to compute . This gives an explicit conjugation from the first weaving to the last; it proves the comparison without presuming any unverified intermediate diagram arrow. Conjugating by now gives . Its parenthesis belongs to , so an ordinary negative right destabilization deletes ; conjugating by yields . No later Garside or Markov theorem is used.
Signs and endpoints. Steps 2.1-3.1 use exactly one negative stabilization and one negative destabilization. The map preserves both Artin relations and all strand placements, so it is an involutive automorphism. Apply the negative sequence to the mirrored boxes and then mirror every word and move: it gives a positive sequence from to . Reversing that sequence gives the asserted positive sequence from to . All groups and conjugators are explicit finite words, so the proof is choice-free. At the same formulas hold with ; no is used.
Remarks
The source weaving labels above are chronological records. The geometric product runs its rightmost factor first, so its actual element is the reversed record. Word reversal preserves the Artin relations, carries conjugations to conjugations by the reversed inverse conjugator, and carries a right stabilization to a left one, which cyclic conjugation makes a right stabilization of the same sign. Thus it preserves ordinary Markov sequences. The abstract word equations and move sequence proved here remain exactly as displayed.
This proves the ordinary exchange on the displayed supports. Identifying a multiple-reduction ambiguity with a finite succession of these ordinary exchanges requires a separate strand-by-strand argument; cabling this calculation alone does not supply that argument.
Depends on
Used by
Dependency tree · two levels
8 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
- Traczyk, A new proof of Markov's braid theorem, Figure 11 and exchange-move discussion, printed pp. 418-419 (standard reference, not scraped)
- Birman and Brendle, Braids: A Survey, Remark 2.2, printed pp. 26-27 (standard reference, not scraped)