Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (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.

Braid-like Reidemeister moves on closed braids are braid isotopies

Statement

Let D,D′ be closed braid diagrams whose Seifert pictures are nested chains, and suppose D′ is obtained from D by a braid-like Reidemeister move of type II or III, by a planar isotopy, or by a sequence of such moves. Then the corresponding closed braids are braid-isotopic in the sense of the conjugacy bridge of Braid-isotopic closed braids are conjugate, and the braids read from D and D′ are conjugate in Bn. Consequently every braid isotopy appearing in a Markov sequence may be replaced by a conjugation move.

Facts & Assumptions

Given: The closed braid diagrams and finite sequence of moves in the Statement; no choice axiom is assumed.

[F1]

The braid-like II and III pictures have all participating local strands oriented in the same braid direction (Oriented Reidemeister moves).

[F2]

The Artin presentation has inverse cancellation, far commutation, and the adjacent relation σiσi+1σi=σi+1σiσi+1 (The braid group by Artin presentation).

[F3]

There is a choice-free homomorphism from the Artin presentation to geometric braids sending the generators to the fixed geometric half twists; the far and adjacent relations are realized by endpoint-fixed geometric braid isotopies (The Artin presentation surjects onto the geometric braid group, Far commutativity of elementary geometric half twists, The geometric three strand braid relation).

[F4]

A braid isotopy is an endpoint-fixed homotopy of distinct disk points, and the finite-word models used here are smooth with endpoint collars and their literal closures use the fixed standard disk framing (Braid isotopy relative to the top and bottom endpoints, The closure of a geometric braid).

Proof

technique · direct
1.1F1F2F3construct

Read a local move at a fixed cut. Choose a cut outside the small disk of the move, and straighten its local angular foliation to a braid rectangle. The untouched part gives two fixed word contexts. A braid-like II pair contributes σiσi−1 or σi−1σi, so removal is inverse cancellation. For III put s=σi, t=σi+1. The positive and negative cases are sts=tst and its inverse. The four remaining possible over/under depth orders give sts−1=t−1st,s−1ts=tst−1,st−1s−1=t−1s−1t,s−1t−1s=ts−1t−1. The first two follow by multiplying sts=tst on the appropriate left and right by t−1 or s−1, and the last two are their inverses. These exhaust the six orders of three distinct strand depths; the two omitted sign triples would require a cyclic strict depth order. Thus the complete words agree by [F2]. By the homomorphism and actual geometric relations of [F3], each replacement is an endpoint-fixed geometric braid isotopy, also in either fixed word context. This does not require injectivity of that homomorphism.

1.2F2F3F4construct

Planar isotopy, reading order and cyclic cut. Transport the nested circles, crossing strips and a cut with the planar isotopy. This transports their oriented cyclic orders; no crossing is created and no over/under sign changes. The read word depends only on these orders. More explicitly, cut the transported annular picture and lift its circles to parallel oriented intervals. Every crossing strip is an event involving two consecutive intervals. Events meeting a common interval have their order fixed by that interval's oriented order. Any two total readings extending these finite orders differ by successive exchanges of adjacent incomparable events: move the first event of one reading to its position in the other, noting that every event passed must be incomparable, and induct on the remaining finite list. Incomparable crossing strips use disjoint pairs of intervals, so their generator indices differ by at least two; exchanging them is precisely far commutation [F2], realized geometrically by [F3]. A cut passing one or more events changes a product uv to vu=u−1(uv)u, an explicit conjugation, and records the same closed braid with a different starting page. Consequently the end readings of a transported picture, and readings using any other admissible cut, differ only by far commutations and conjugations. The transported angular foliation supplies a family of closed braids; at the end its reading agrees with the usual nested-chain reading by the same finite-order argument. There is no assertion that a fixed page gives fixed based endpoints throughout an arbitrary planar isotopy.

2.1F2F3F4step 1.1step 1.2∎

Closed isotopy and conjugacy. Apply step 1.1 to every local II or III replacement and step 1.2 to the planar pieces and changes of cut. Equal-word replacements yield based geometric isotopies by [F3], hence closed isotopies by [F4]. A cyclic cut change is realized by moving the starting page around the same closed braid, so also gives an isotopy through closed braids. The finite concatenation is therefore a braid isotopy of the closed braids. Algebraically the equal-word replacements leave the element unchanged and each cyclic change conjugates it; their finite composition is a conjugation in Bn. This proves both conclusions directly and makes the replacement by conjugation in a Markov sequence explicit. No choice-stated converse identification of geometric and Artin braids is used.

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