Alphabeta Math
Pipeline-generated
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.

Oriented Links, Braid Closures, and Markov Equivalence — Examples

1 · Prerequisites

2 · Summary

These four entries make the closure and Markov machinery of the companion page concrete. The first computes the closures of the two-strand braids σ1m: the component count is the cycle count of the endpoint permutation, the pictures are the (2,m) torus links, and the cases m=0,±1,±3 give the two-component unlink, the unknot and the two mirror trefoils. The second exhibits both signs of a Markov stabilization of the trivial one-strand braid and unwinds the added kink by the explicit Reidemeister I isotopy, so that both stabilizations preserve the unknot closure.

The third runs the Yamada-Vogel algorithm on the standard diagram of 52, smooths its crossings to a Seifert picture, performs the two reducing moves of the source and reads off the resulting braid word, whose closure is the knot; the example also records that the algorithm's output is not minimal for the braid index. The fourth is a counterexample: the braids σ1 in B2 and σ1σ2 in B3 have equivalent closures, both the unknot, but they cannot be conjugate in a single braid group because conjugacy preserves the number of strands; at least one stabilization or destabilization is therefore genuinely necessary in Markov's classification.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedOpen item page →

A Markov stabilization preserves the unknot closure

Example

Assume ACω. The trivial braid e∈B1 closes to the unknot, and both stabilizations eσ1 and eσ1−1 in B2 also close to the unknot; the explicit isotopies are the R1 unwinding of the added kink, one for each sign. Here the unknot is the closure of the trivial one-strand braid.

Facts & Assumptions

Given: ACω, the trivial braid e∈B1, its two stabilizations eσ1=eσ1+, eσ1−1∈B2 in the sense of Markov conjugation and stabilization moves, and the closure construction of The closure of a geometric braid.

[F1]

Stabilization adjoins one new strand on the right carrying the half twist σ1±1, we use the particular ambient isotopy constructed in proof step 1.2 of Markov moves preserve the oriented closure up to isotopy, which moves the added circle and an old-strand collar to a fixed-framing ball near the axis and exhibits the signed kink. The strand insertion and literal closure have the conventions of Markov conjugation and stabilization moves and The closure of a geometric braid.

[F2]

Assume ACω: a stabilization preserves the oriented closure up to equivalence, because the added strand differs from the trivial strand by a kink which is unwound by one Reidemeister I isotopy; both signs of the kink are covered by the two signs of the stabilization (Markov moves preserve the oriented closure up to isotopy).

[F3]

The trivial one-strand braid closes to a single circle about the axis, the round unknot, and the closure of a braid with one cycle of its endpoint permutation has one component (The closure of a geometric braid).

Verification

1.1F1F3algebra

The closures of the stabilizations. By the preliminary ambient positioning in [F1], the two fixed-framing closures have representatives which are the round unknot with respectively a positive and a negative kink. Both closures are one-component links by [F3], since the endpoint permutation of each stabilization of e is the transposition of the two strands.

2.1F2step 1.1

The R1 isotopies. The explicit isotopy for the positive sign is the R1 move that pulls the kink straight inside a small ball neighbourhood of the kink, keeping the rest of the closed braid fixed; for the negative sign the mirror isotopy unrolls the opposite kink. In both cases the R1 move is realized by an ambient isotopy by [F2], so the closure of each stabilization is equivalent to the closure of the trivial braid, the unknot.

3.1F2F3step 1.1step 2.1∎

Conclusion. Both stabilizations eσ1 and eσ1−1 in B2 close to the unknot, with the explicit R1 isotopies of the two signs; the example illustrates that stabilization preserves the closure in the simplest possible case.

ExampleConstruction: AI-adaptedVerification: AI-adaptedOpen item page →

The Yamada-Vogel algorithm on a small diagram

Example

Assume the Axiom of Choice. Run the Yamada-Vogel algorithm on the standard five-crossing diagram of the knot 52, the first knot in the tables whose standard diagram has height greater than zero. Its Seifert picture has four Seifert circles and five positive signed arcs, so h=2; two reducing moves along the arcs α1,α2 of the source bring it to height zero, and reading the resulting closed braid gives

X=σ2σ1−1σ2σ3−1σ2σ1σ2σ3σ2;

the algorithm gives this nine-crossing four-braid. Braid relations and one ordinary destabilization, with conjugations, give an eight-crossing three-braid, which simplifies to the six-letter three-braid σ2σ1−1σ2σ12σ2. Thus the algorithm's initial four-braid has nonminimal braid index, and the eight-letter three-braid word is not shortest.

Facts & Assumptions

Given: AC, the standard diagram D of the knot 52 with its five crossings, the Seifert smoothing of Seifert smoothing and Seifert circles of an oriented link diagram, and the Yamada-Vogel algorithm (Defect regions, reducing arcs and the Yamada-Vogel reducing move).

[F1]

Smoothing the five positive crossings of D gives the Seifert picture of the source: four Seifert circles and five positive signed arcs, and the height counts the incoherent pairs (Seifert smoothing and Seifert circles of an oriented link diagram, Defect regions, reducing arcs and the Yamada-Vogel reducing move, Coherence of Seifert circles and the height of a diagram).

[F2]

If h>0 there is a defect region and a reducing arc; a reducing move lowers the height by exactly one (A positive-height diagram has a defect region, A reducing move lowers the height by one).

[F3]

A height-zero diagram represents the closure of the braid read in angular order from a cut ray of its nested chain, after a sphere isotopy and choice of planar chart (A height-zero diagram represents a closed braid).

[F4]

Artin inverse cancellation, far commutations and σ1σ2σ1=σ2σ1σ2 are the defining braid relations (The braid group by Artin presentation).

[F5]

For β=uv, conjugate by v, right stabilize, and conjugate by v−1 to insert σn±1 as uσn±1v; stabilizations have n≥1 (Markov conjugation and stabilization moves).

[F6]

Under countable choice every ordinary Markov move preserves the oriented closure, and AC implies that choice principle (Markov moves preserve the oriented closure up to isotopy, AC implies DC implies countable choice).

[F7]
[F8]

The fixed positive generator is an anticlockwise half twist in the oriented transverse disk, with its first indexed point passing through negative second coordinate (The elementary geometric half twist, its support disc, and its opposite).

Verification

1.1F1F2construct

The source's five-arc picture and six circle pairs. Number the four circles in the first sketch of Figure 4 by their northwest, northeast, southwest and southeast positions. The northwest and southeast arrows are counterclockwise; the northeast and southwest arrows clockwise. For side-by-side circles in S2, coherence requires opposite planar orientations, since the common annulus is outside their two disk interiors. Thus exactly the two diagonal pairs are incoherent; each of the four side pairs is coherent, so h=2. The five positive arcs are the two between the top circles, one on each vertical side and one on the bottom side, as shown in that rendered source panel. Their signs and incident circles record the original five crossings by [F1]. The heavy α1 joins the northwest and southeast incoherent pair; [F2] licenses its first reduction.

2.1F2step 1.1

The two reductions. Perform the reducing move along α1: it replaces the chosen incoherent pair by two coherent circles joined by two oppositely signed arcs, and by [F2] the height drops to 1; the new picture has a remaining incoherent pair, and the source's second reducing arc α2 joins it. Performing the reducing move along α2 drops the height to 0, and the resulting picture has all pairs of Seifert circles coherent. The two moves are Reidemeister II moves of the original diagram, so the represented knot is unchanged.

3.1F3F4F5F6F7F8step 2.1algebra

The source word and its product convention. The final sketch has four concentric counterclockwise circles. Number them outermost to innermost and read from twelve o'clock counterclockwise. The ordered signed events are (2,+),(1,−),(2,+),(3,−),(2,+),(1,+),(2,+),(3,+),(2,+), giving the displayed chronological list X. For this counterclockwise motion use the transverse frame (−er,+eZ); together with tangent +eθ it preserves ambient orientation. Its positive half twist has the first outer indexed point go through negative physical depth, so the source's crossing signs agree with the fixed signed generators. By [F7] the actual geometric element of this chronological list is rev⁡(X), not automatically X. We verify both closures by an explicit word comparison. Write s=σ1, t=σ2, r=σ3. The Artin relations [F4] give X=ts−1tr−1tstrt=ts−1tr−1stsrt=ts−1tsr−1trst=ts−1tstrt−1st. The successive operations are tst=sts, commuting s with r, and r−1tr=trt−1. Put A=ts−1tst, B=t−1st, so X=ArB. By the interior insertion sequence [F5], this is related by one positive ordinary destabilization and conjugations to the three-braid Y=AB=ts−1tstt−1st. Inverse cancellation gives Y=Z=ts−1ts2t, a six-letter three-braid. Word reversal is an anti-automorphism because the Artin relations are palindromic or far commutations. It carries a right stabilization to a left one of the same sign, which cyclic conjugation converts to a right stabilization; hence the reversed identities likewise give rev⁡(X)↔rev⁡(Z) by ordinary Markov moves. Finally put C=ts2t. Directly sC=sts2t=(sts)st=(tst)st=ts(tst)=ts(sts)=ts2ts=Cs. Therefore t−1Zt=s−1Ct=Cs−1t=rev⁡(Z). Combining the two destabilization comparisons with this old-strand conjugation gives an explicit Markov sequence between X and rev⁡(X). By [F6], both have the oriented closure of the source diagram. The algorithm itself yields the nine-letter four-braid; Y is its eight-letter three-braid after destabilization and Z is a strictly shorter word for that same three-braid.

4.1F1F2F3F6step 1.1step 2.1step 3.1∎

Conclusion. The verified two reductions give the source's four-strand, nine-crossing closed braid. Step 3.1 proves that its actual chronological interpretation and the commissioned word X have the same oriented closure, and explicitly gives the eight-letter and six-letter three-braid words. The existence of the three-braid proves that the initial four-braid uses more strands than necessary; the six-letter representative proves that the eight-letter word is longer than necessary. These are separate index and length comparisons, with no assertion that the three-braid has nonminimal braid index. AC supplies the reducing/height-zero constructions and the countable choice in [F6].

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedOpen item page →

Conjugacy alone does not classify braid closures

Statement refuted

Assume AC. Two braids have equivalent oriented closures if and only if they are connected using conjugations alone, without changing strand number.

Facts & Assumptions

Given: AC, the braids e∈B1, σ1∈B2, σ1σ2∈B3 and the closure construction of The closure of a geometric braid.

[F1]

Stabilization replaces β∈Bn by the product in Bn+1 of the standard inclusion of β with σn±1, the new strand being added on the right; conjugacy always takes place inside a single group Bn and never changes the number of strands (Markov conjugation and stabilization moves).

[F2]

The stabilizations eσ1 and eσ1−1 close to the unknot, with the explicit R1 isotopies, so the closure of the stabilization of the trivial one-strand braid is the unknot; the example item A Markov stabilization preserves the unknot closure records this for both signs.

[F3]

Markov moves preserve the oriented closure up to equivalence; in particular the closure of a stabilized braid is equivalent to the closure of the original (Markov moves preserve the oriented closure up to isotopy).

[F4]

By closure of a braid, the number of components is the number of cycles of the endpoint permutation; the permutation of σ1∈B2 is the transposition (1 2) with one cycle, and the permutation of σ1σ2∈B3 is a three-cycle, also with one cycle, so both closures have one component (The closure of a geometric braid, The braid group by Artin presentation).

Counterexample

Assume the Axiom of Choice. The braids σ1∈B2 and σ1σ2∈B3 have equivalent closures — both the unknot — but are not conjugate to each other, since conjugacy preserves the braid group and B2≠B3. Hence conjugation alone, with the number of strands fixed, does not classify braid closures; at least one stabilization or destabilization is genuinely necessary.

1.1F2F3F4algebra

Both closures are unknots. The trivial braid e∈B1 closes to a round unknot. Its positive stabilization is σ1∈B2, whose closure is the unknot by [F2]; stabilizing σ1 once more, adding the third strand on the right, gives the braid σ1σ2∈B3, whose closure is equivalent to the closure of σ1 by [F3], hence also an unknot. The component count is one in both cases by [F4], so both closures are one-component links, and by [F2] and [F3] they are the unknot.

1.2F1algebra

They are not conjugate. Conjugation, by [F1], stays inside a fixed braid group Bn and never changes the number of strands. The braid σ1∈B2 has two strands and σ1σ2∈B3 has three; no sequence of conjugations within a single braid group can relate them, because such a sequence would have to identify an element of B2 with an element of B3. Therefore conjugation alone does not classify braid closures: the two closures are equivalent oriented links (both the unknot) while the braids are not conjugate.

2.1F1F2F3step 1.1step 1.2∎

Conclusion. The braids σ1∈B2 and σ1σ2∈B3 have equivalent closures but are not conjugate; the only difference between the two braids in Markov terms is the stabilization that changes the group from B2 to B3, which is the strand-changing move that conjugacy cannot simulate. This verifies the counterexample and shows that at least one stabilization or destabilization is genuinely necessary for the classification. The statement retains AC because it consumes the countable-choice-stated closure-preservation lemma [F3], with countable choice following from AC by AC implies DC implies countable choice and the ambient isotopy theory behind [F2].

Sources