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.

✓ 4 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 4 also cleared it.

Geometric Braids and Artin Generators — Examples

1 · Prerequisites

2 · Summary

These four worked entries make the abstract items of the companion page concrete, and each one is a computation or a witness rather than a restatement. The first example handles the case n=2 completely without assuming completeness of the Artin presentation: for h=112 and q1=(−112,0), q2=(112,0), the relative motion w=z1−z2 of a two-strand braid is a nowhere-zero path in R2∖{0} ending at one of ±w(0), whose argument class lifts uniquely to θ ⁣:I→R with θ(0)=12, and k(β):=2θ(1)−1 is an integer. The example proves that k is a braid-isotopy invariant, that k(γ⋆β)=k(γ)+k(β), that k(e)=0, k(σ1)=1 and k(σ1−)=−1, and hence that [β]=[σ1]k(β): every two-strand braid is braid-isotopic to exactly one integer twist, G2≅Z via k, and the twist exponent is the total argument change of the relative motion divided by π. The parity of k records the endpoint permutation, which is exactly the ingredient that makes additivity of k under stacking work.

The second example takes n=3, i=1 and h=116, so that the three base points are −18,0,18 on the horizontal axis, and writes out the two words W0=σ1⋆(σ2⋆σ1) and W1=σ2⋆(σ1⋆σ2) strand by strand, in the six explicit windows dictated by the stacking formula; the windows glue at u=14,12 and both words end at (q3,q2,q1), giving the endpoint permutation (1 3). The example checks the two products in S3, (1 2)(2 3)(1 2)=(2 3)(1 2)(2 3)=(1 3), computes the separation 2∥ρ(v)∥2≥2 h=216 of the two moving strands and the clearance 2h=18 from the frozen base point, exhibits the rotation braid rot and the linear interpolation between W0 and rot, whose slice at 12 is ((h,−h),(−h,0),(0,h)), and concludes [σ1][σ2][σ1]=[σ2][σ1][σ2] in G3.

The two counterexamples record the two places where the geometric definitions could be misread. Setwise endpoints do not make a braid pure: the half twist σ1 on two strands has top endpoint set {q1,q2} but ends at (q2,q1), so no strand returns to its own starting point, and since the endpoint permutation is an isotopy invariant σ1 is not braid-isotopic to the trivial braid. And an arbitrary isotopy of arcs with fixed endpoints need not be a braid isotopy: the explicit family αs(u)=((λ(s)8w(u),0), u+λ(s)w(u)) with λ(s)=14min⁡(2s,2−2s) and the piecewise linear w with w(14)=1,w(34)=−1 consists of simple arcs with the fixed endpoints (q1,0) and (q1,1) whose boundary arcs are the trivial braid, yet at s=12 the arc passes through the two distinct points ((±132,0),12) at the single height 12, so it is not the graph of a strand of any braid; the one-point-per-height requirement in the definition of braid isotopy is therefore not redundant. Nothing in these four entries uses a choice principle.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Geometric two strand braids are integer twists

Example

Let n=2, let Q=(q1,q2) with h=112, q1=(−112,0) and q2=(112,0), let β=(z1,z2) be a braid based at Q (Geometric braids in the disc with setwise endpoints), and let σ1 and σ1− be the two half twists at i=1 (The elementary geometric half twist, its support disc, and its opposite), with classes [σ1],[σ1−]∈G2 (The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism). Write

w:=z1−z2 ⁣:I⟶R2∖{0}

for the relative motion of the two strands, and write σ1m for the stacking of m copies of σ1 when m>0, of ∣m∣ copies of σ1− when m<0, and for the trivial braid e when m=0.

The invariant. There is a unique continuous θ ⁣:I→R with θ(0)=12 whose class [θ(t)]∈R/Z is the argument class of w(t), that is, the unique s with H([s])=w(t)/∥w(t)∥2, where H([s])=(cos⁡2πs,sin⁡2πs) ([t]↦(cos⁡2πt,sin⁡2πt) is a homeomorphism from R/Z to the unit circle). The number

k(β):=2(θ(1)−θ(0))=2θ(1)−1

is then an integer, and it is an invariant of the braid isotopy class of β. The example proves:

  1. k ⁣:G2→Z is a group homomorphism, with k(γ⋆β)=k(γ)+k(β);
  2. k(e)=0, k(σ1)=1 and k(σ1−)=−1, hence k(σ1m)=m for every m∈Z;
  3. [β]=[σ1]k(β) in G2. Consequently k is a group isomorphism G2≅Z, every two-strand braid is braid-isotopic to exactly one of the integer twists σ1m (m∈Z), and two two-strand braids are braid-isotopic if and only if they have the same invariant k.

Thus a two-strand braid is exactly an integer number of half twists, counted with sign, and the composition of such twists adds the numbers. The calculation is independent of any presentation of G2: it uses only the generation of G2 by [σ1] from The Artin presentation surjects onto the geometric braid group together with the argument lift constructed below.

Facts & Assumptions

Given: The natural number 2, the base configuration Q=(q1,q2) with h=112, q1=(−112,0), q2=(112,0), two-strand braids β=(z1,z2), β′ and γ based at Q, and the half twists σ1,σ1− based at Q.

[F1]

A braid based at Q is a pair (u1,u2) of continuous maps uj ⁣:I→D∘ with u1(t)≠u2(t) for all t, uj(0)=qj and {u1(1),u2(1)}={q1,q2}, with endpoint permutation π(u)∈S2 defined by uj(1)=qπ(u)(j); here q1−q2=(−2h,0) and q2−q1=(2h,0), and the two-element group S2 consists of the identity and the transposition of 1 and 2; a braid isotopy from β to β′ is a pair of jointly continuous maps Zj ⁣:I×I→D∘ whose every slice Z(s,⋅) is such a braid based at Q and whose boundary slices are β and β′ (Geometric braids in the disc with setwise endpoints, Braid isotopy relative to the top and bottom endpoints, The finite symmetric group Sn, one-line notation, and cycle notation, Intervals of R: the nine order-convex forms, nondegeneracy, and length, Continuity of a map of topological spaces at a point and globally, The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).

[F2]

The half twists are (σ1)1=m1+ρ, (σ1)2=m1−ρ and (σ1−)1=m1+ρ−, (σ1−)2=m1−ρ− with m1=q1+q22=(0,0), where ρ(t)=(2th−h,−2th) for t≤12 and ρ(t)=(2th−h,2th−2h) for t≥12, and ρ−(t)=(ρ1(t),−ρ2(t)); both are braids based at Q, π(σ1)=π(σ1−) is the transposition of 1 and 2, and [σ1−]=[σ1]−1 in G2 (The elementary geometric half twist, its support disc, and its opposite, The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism).

[F3]

Stacking is (γ⋆β)j(t)=zj(2t) for t≤12 and =wπ(β)(j)(2t−1) for t≥12, where zj,wj are the strands of β,γ; [γ⋆β]=[γ][β] and π is constant on braid isotopy classes, so π(β)∈S2 is an invariant of the class [β] (Stacking of geometric braids is a well-defined associative operation on isotopy classes, The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism).

[F4]

Every element of G2 is a finite product of the elements [σ1] and [σ1]−1; more precisely the classes [σ1],…,[σn−1] generate Gn for every n (The Artin presentation surjects onto the geometric braid group).

[F5]

p ⁣:R→R/Z is a covering map; for a covering p ⁣:E→B, a path α ⁣:I→B and e0∈E with p(e0)=α(0) there is a unique path lift α~ ⁣:I→E with α~(0)=e0 and p∘α~=α, and for a homotopy H ⁣:I×I→B together with a lift H~0 ⁣:I→E of H(⋅,0) there is a unique lift H~ ⁣:I×I→E of H with H~(s,0)=H~0(s) for all s; consequently two lifts of one path into R/Z to continuous maps I→R differ by a constant integer, since their difference is continuous and takes values in Z (p:R→R/Z is a covering map with translated interval sheets, Existence and uniqueness of path lifts through a covering map, Existence and uniqueness of homotopy lifts through a covering map).

[F6]

The map H ⁣:R/Z→S1, H([s])=(cos⁡2πs,sin⁡2πs), is a homeomorphism onto the unit circle S1={(x,y)∈R2:∥(x,y)∥2=1}, and H([12])=(−1,0); moreover H([s+12])=−H([s]) for every real s, because cos⁡(x+π)=−cos⁡x and sin⁡(x+π)=−sin⁡x ([t]↦(cos⁡2πt,sin⁡2πt) is a homeomorphism from R/Z to the unit circle, Quarter-turn values and shifts by pi/2 and pi, Euclidean spheres and closed balls as subspaces of Rn).

[F7]

The radial normalisation r ⁣:R2∖{0}→S1, r(x)=x/∥x∥2, is continuous, and r(−u)=−r(u) for every u≠0; so the composite c:=H−1∘r ⁣:R2∖{0}→R/Z is continuous, and c(−u)=c(u)+[12] for every u≠0 by [F6] (Radial normalisation x↦x/∥x∥2 is continuous on Rn∖{0}, Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

Verification

technique · direct
1.1

The relative motion and its endpoint values. Assume n=2 and let β=(z1,z2) be a braid based at Q; then w=z1−z2 is continuous and w(t)≠0 for every t by [F1] and [F8], since distinct strands do not meet; the endpoint condition {z1(1),z2(1)}={q1,q2} of [F1] gives w(1)=z1(1)−z2(1)∈{q1−q2,q2−q1}={(−2h,0),(2h,0)}, and by the convention zj(1)=qπ(β)(j) of [F1] the value w(1)=(−2h,0) occurs exactly when π(β) is the identity, while w(1)=(2h,0) occurs exactly when π(β) is the transposition of 1 and 2.

F1F8
2.1

The argument class and its lift. By [F7] the class map c=H−1∘r is continuous, so c∘w ⁣:I→R/Z is continuous by [F8]; its value at 0 is c((−2h,0))=H−1((−1,0))=[12] because r((−2h,0))=(−1,0) and H([12])=(−1,0) by [F6]; hence [F5] applied to the covering p ⁣:R→R/Z and the path c∘w gives a unique continuous θ ⁣:I→R with θ(0)=12 and [θ(t)]=c(w(t)), that is H([θ(t)])=w(t)/∥w(t)∥2 for every t∈I.

F5F6F7F8step 1.1
3.1

The invariant, and its parity against the endpoint permutation. By step 2.1 the class [θ(1)] equals c(w(1)), and by [F6] and [F7] one has c((−2h,0))=H−1((−1,0))=[12] and c((2h,0))=H−1((1,0))=[0]; so step 1.1 gives θ(1)∈12+Z when π(β) is the identity and θ(1)∈Z when π(β) is the transposition. In the first case 2θ(1) is odd and in the second it is even, so in both cases k(β):=2θ(1)−1=2(θ(1)−θ(0)) is an integer, and it is even exactly when π(β) is the identity and odd exactly when π(β) is the transposition.

F1F6F7step 1.1step 2.1
4.1

Isotopy invariance. Let Z be a braid isotopy from β to β′ and put W(s,t):=Z1(s,t)−Z2(s,t), a continuous and nowhere vanishing map I×I→R2∖{0} by [F1] and [F8]; then c∘W is a homotopy I×I→R/Z by [F7] and [F8], and W(s,0)=z1(0)−z2(0)=q1−q2=(−2h,0) for every s by [F1], so the constant map s↦12 is a continuous lift of (c∘W)(⋅,0); hence [F5] provides a unique lift Θ ⁣:I×I→R of c∘W with Θ(s,0)=12 for all s∈I. For each s the slice Z(s,⋅) is a braid based at Q by [F1], so its relative motion is W(s,⋅), and t↦Θ(s,t) is the unique lift of c∘W(s,⋅) with value 12 at t=0; step 3.1 applied to that slice therefore gives 2Θ(s,1)−1∈Z for every s. The map s↦Θ(s,1) is continuous, so s↦2Θ(s,1)−1 is a continuous map from the connected interval I into Z and is constant by [F8]; moreover Θ(0,⋅)=θ by the uniqueness in [F5] applied to c∘W(0,⋅)=c∘w and step 2.1, and Θ(1,⋅) is the corresponding lift for the relative motion W(1,⋅) of β′; therefore k(β)=2Θ(0,1)−1=2Θ(1,1)−1=k(β′), and k is constant on braid isotopy classes.

F1F5F6F7F8step 2.1step 3.1
4.2

Additivity under stacking. Let β,γ be two-strand braids based at Q, let θβ,θγ be their argument lifts of step 2.1, and let ϵ:=0 when π(β) is the identity and ϵ:=1 when π(β) is the transposition, so that ϵ≡k(β)(mod2) by step 3.1; by [F3] the relative motion of the stacking is wγ⋆β(t)=wβ(2t) for t≤12 and wγ⋆β(t)=(−1)ϵwγ(2t−1) for t≥12. Let Θ be the unique lift of c∘wγ⋆β with Θ(0)=12, granted by [F5]. On [0,12] the map t↦θβ(2t) is a lift of c∘wβ(2t) with value 12 at t=0, so Θ(t)=θβ(2t) there by uniqueness of path lifts, and Θ(12)=θβ(1)=12+k(β)2, because θβ(1)−θβ(0)=k(β)2 by step 3.1. On [12,1], since c((−1)ϵu)=c(u)+ϵ[12] for u≠0 by [F6] and [F7], the maps t↦θγ(2t−1)+ϵ2 and t↦Θ(t) are two lifts of the same path, so by [F5] the second is the first plus a constant integer: Θ(t)=θγ(2t−1)+ϵ2+z for some z∈Z and all t∈[12,1]. Evaluating at t=12 gives 12+ϵ2+z=12+k(β)2, that is z=k(β)−ϵ2, which is an integer precisely because ϵ≡k(β)(mod2). Hence Θ(1)=θγ(1)+ϵ2+k(β)−ϵ2=θγ(1)+k(β)2, and therefore k(γ⋆β)=2Θ(1)−1=2θγ(1)−1+k(β)=k(γ)+k(β).

F1F3F5F6F7F8step 2.1step 3.1
5.1

The values on the trivial braid and on the two half twists. The relative motion of the trivial braid e, whose strands are the constant maps t↦qj by [F1], is the constant path (−2h,0), whose argument lift with value 12 at 0 is the constant 12; so k(e)=2⋅12−1=0. For β=σ1 the relative motion is 2ρ, that is w(t)=(4th−2h,−4th) for t≤12 and w(t)=(4th−2h,4th−4h) for t≥12, by [F2], and it vanishes nowhere: on the first half w(t) runs through the closed third quadrant from (−2h,0) to (0,−2h) and on the second half through the closed fourth quadrant from (0,−2h) to (2h,0), in each case with a direction that turns strictly monotonically; hence the lift with value 12 at 0 satisfies θ(12)=34 and θ(1)=1, and k(σ1)=2(1−12)=1. For β=σ1− the relative motion is the reflection in the horizontal axis of the previous one, running through the second and then the first quadrant, and the same computation gives θ(12)=14 and θ(1)=0, so k(σ1−)=2(0−12)=−1. By the additivity of step 4.2 and induction on ∣m∣ this gives k(σ1m)=m for every m∈Z.

F1F2F5F6step 4.2
6.1

Every two-strand braid is an integer twist. Let β be any braid based at Q; by [F4] the class [β]∈G2 is a finite product of the elements [σ1] and [σ1]−1, that is [β]=[σ1]m for the integer m which is the sum of the exponents of that product, and by steps 4.2 and 5.1 the invariant of β is k(β)=k(σ1m)=m; hence [β]=[σ1]k(β), and braid-isotopic braids have equal invariants by step 4.1. Consequently k descends to a well-defined map G2→Z by step 4.1, that map is a group homomorphism by step 4.2, it is surjective because k(σ1m)=m for every m∈Z by step 5.1, and it is injective because k(β)=0 forces [β]=[σ1]0=[e] by the identity above; so G2≅Z via k, the twists σ1m represent pairwise distinct classes, and each class of G2 is exactly one of them. ∎

F3F4step 4.1step 4.2step 5.1

Remarks

  • The invariant is the total argument change of the relative motion, divided by π: the lift θ measures the angle of the vector from the second strand to the first in units of full turns, and the half twists contribute +1 and −1. The factor 2 in k=2(θ(1)−θ(0)) converts turns into half turns. Step 3.1 also records the parity dictionary used in step 4.2: k(β) is even exactly for the braids with π(β) the identity, and odd exactly for those whose endpoint permutation is the transposition; this is what makes the correction z=(k(β)−ϵ)/2 in the second half of a stacking an integer.
  • Only the relative motion of the pair is used, and the endpoint set condition makes its argument change an integer multiple of half a turn: a pure two-strand braid returns the two labels, so the vector comes back to itself after an even number of half turns, while a transposition reverses it after an odd number.
  • The example does not use any presentation of B2, and in particular it does not use The two-strand braid group is infinite cyclic: generation comes from The Artin presentation surjects onto the geometric braid group and completeness of the presentation is never assumed.
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

The three strand geometric braid relation

Example

Take n=3 and i=1, so that h=14(3+1)=116 and the base configuration is

q1=(−2h,0)=(−18,0),q2=(0,0),q3=(2h,0)=(18,0),

with m:=m1=q1+(h,0)=(−116,0) and m′:=m2=q2+(h,0)=(116,0), and with c:=q2=(0,0) and pk:=qk for k=1,2,3. Let σ1,σ2 be the elementary half twists (The elementary geometric half twist, its support disc, and its opposite) and set

W0:=σ1⋆(σ2⋆σ1),W1:=σ2⋆(σ1⋆σ2)

with respect to the stacking of Stacking of geometric braids is a well-defined associative operation on isotopy classes. Write Rθ(a,b):=(acos⁡θ−bsin⁡θ,  asin⁡θ+bcos⁡θ) for the rotation of the plane about the origin, and let rot be the three-strand tuple whose k-th strand is at height u at the point c+Rπu(pk), the strands outside {1,2,3} being constant (here n=3, so there are none). The example verifies:

  1. W0 and W1 are braids based at Q whose strand coordinates are the explicit windows displayed below, and both have endpoint permutation the transposition (1 3);
  2. rot is a braid based at Q with endpoint permutation (1 3), and its strands move through the explicit positions (±2hcos⁡πu,±2hsin⁡πu) and (0,0);
  3. the linear interpolation Zk(s,u):=(1−s)(W0)k(u)+s rotk(u) has bottom value Q and top value (q3,q2,q1) for every s, and its slices at u∈{0,12,1} are collision-free with the displayed values;

consequently, by the isotopies exhibited in The geometric three strand braid relation, the two words are braid-isotopic and

[σ1] [σ2] [σ1]=[σ2] [σ1] [σ2]

holds in G3.

Facts & Assumptions

Given: The natural number 3, the index i=1, the base configuration Q=(q1,q2,q3) with h=116, the half twists σ1,σ2 based at Q, and the words W0=σ1⋆(σ2⋆σ1) and W1=σ2⋆(σ1⋆σ2).

[F1]

For n≥3 and 1≤i≤n−2 one has σi⋆σi+1⋆σi∼σi+1⋆σi⋆σi+1; the proof exhibits the intermediate braid rot, the rotation of qi,qi+1,qi+2 about qi+1 by the angle πu at height u with the remaining strands fixed, and shows that the bracketing σi⋆(σi+1⋆σi) is braid-isotopic to rot, which is a braid based at Q with endpoint permutation the transposition of i and i+2, while the point reflection κ(w)=2qi+1−w followed by the relabelling of i and i+2 turns that bracketing into σi+1⋆(σi⋆σi+1), so that bracketing is braid-isotopic to rot as well (The geometric three strand braid relation).

[F2]

The base points are qj=((2j−n−1)h,0), here q1=(−2h,0), q2=(0,0), q3=(2h,0); the half twist at k is (σk)k=mk+ρ, (σk)k+1=mk−ρ and (σk)j=qj otherwise, where mk=qk+(h,0) and the diamond path satisfies ρ(0)=(−h,0), ρ(12)=(0,−h), ρ(1)=(h,0); π(σk) is the transposition of k and k+1; stacking places the right factor below: (γ⋆β)j(t)=zj(2t) for t≤12 and =wπ(β)(j)(2t−1) for t≥12, with π(γ⋆β)=π(γ)∘π(β) and [γ⋆β]=[γ][β] in Gn (Geometric braids in the disc with setwise endpoints, The elementary geometric half twist, its support disc, and its opposite, Stacking of geometric braids is a well-defined associative operation on isotopy classes, The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism).

[F3]

A braid based at Q is a tuple of continuous maps uk ⁣:I→D∘ with pairwise distinct values, uk(0)=qk and {u1(1),u2(1),u3(1)}={q1,q2,q3}, its endpoint permutation being the unique π with uk(1)=qπ(k); a braid isotopy is a jointly continuous family whose every slice is such a braid and whose boundary slices are the two given braids; the group S3 is written in cycle notation with (π∘σ)(j)=π(σ(j)) (Geometric braids in the disc with setwise endpoints, Braid isotopy relative to the top and bottom endpoints, The finite symmetric group Sn, one-line notation, and cycle notation).

[F4]

sin⁡0=0, cos⁡0=1, cos⁡π2=0, sin⁡π2=1, cos⁡π=−1, sin⁡π=0, and sin⁡2θ+cos⁡2θ=1 for every real θ; hence R0 is the identity, Rπ(a,b)=(−a,−b), and ∥Rθ(a,b)∥2=∥(a,b)∥2 for all a,b (The derivatives of sine and cosine are cosine and minus sine, Quarter-turn values and shifts by pi/2 and pi, Parity and the Pythagorean identity for sine and cosine, The p-norms ∥x∥p for rational p≥1, and ∥x∥∞).

[F5]

Sums, scalar multiples and composites of continuous maps are continuous, and a function on the interval I=[0,1] whose restrictions to the finitely many closed pieces {u≤14}, {14≤u≤12}, {12≤u≤1} are continuous is continuous; the same pasting applies in the isotopy parameter (Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function, Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous, Continuity of a map of topological spaces at a point and globally, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · direct
1.1

The explicit strand windows of the two words. Applying the stacking formula of [F2] twice, with m=(−116,0), m′=(116,0) and the transposition couplings π(σ1)=(1 2), π(σ2)=(2 3), gives for W0 the strands (m+ρ(4u), m−ρ(4u), q3) for 0≤u≤14, (m′+ρ(4u−1), q1, m′−ρ(4u−1)) for 14≤u≤12 and (q3, m+ρ(2u−1), m−ρ(2u−1)) for 12≤u≤1, and for W1 the strands (q1, m′+ρ(4u), m′−ρ(4u)) for 0≤u≤14, (m+ρ(4u−1), q3, m−ρ(4u−1)) for 14≤u≤12 and (m′+ρ(2u−1), m′−ρ(2u−1), q1) for 12≤u≤1. The two windows of W0 agree at u=14, where the first gives (m+ρ(1), m−ρ(1), q3)=((0,0),(−2h,0),(2h,0)) and the second gives (m′+ρ(0), q1, m′−ρ(0))=((0,0),(−2h,0),(2h,0)), and at u=12, where the second gives (m′+ρ(1), q1, m′−ρ(1))=((2h,0),(−2h,0),(0,0)) and the third gives (q3, m+ρ(0), m−ρ(0))=((2h,0),(−2h,0),(0,0)); the same two checks apply verbatim to the three windows of W1, so by [F5] the formulas define continuous tuples W0,W1 ⁣:I→(R2)3, and each value of each of the six windows is one of q1,q2,q3 or one of m±ρ(v),m′±ρ(v).

F2F3F5
1.2

The rotation braid. By [F4] the motion u↦Rπu(pk) is continuous for each k and satisfies Rπu(pk)=pk at u=0 and Rπu(pk)=−pk at u=1, so the strands of rot run from p1=(−2h,0),p2=(0,0),p3=(2h,0) to −p1=(2h,0),−p2=(0,0),−p3=(−2h,0), that is from Q to (q3,q2,q1); at height u the three positions are Rπu(pk), whose mutual distances are those of the distinct points p1,p2,p3 because Rπu preserves the norm and is linear and injective; and every value lies in D∘, since ∥Rπu(pk)∥2=∥pk∥2≤2h=18<1; hence rot is a braid based at Q with endpoint permutation (1 3).

F3F4F5
2.1

Collision bounds for the windows. For v∈I the diamond path satisfies ∥ρ(v)∥22=h2(8v2−4v+1) for v≤12 and ∥ρ(v)∥22=h2((2v−1)2+(2v−2)2) for v≥12; the first is ≥h2⋅12 with equality at v=14 and the second is ≥h2⋅12 with equality at v=34, and both are ≤h2. Hence in each window the two moving strands, which are m+ρ(v) and m−ρ(v) (or m′+ρ(v)) and m′−ρ(v)), are separated by 2∥ρ(v)∥2≥2 h=216, and the frozen base point of that window, namely q3 in the first and third windows and q1 in the second, is at distance exactly 3h from that window's midpoint and therefore at distance at least 3h−h=2h=18 from each moving point; moreover every window value has norm at most ∥m∥2+h=∥m′∥2+h=2h=18<1, so all values lie in D∘. Consequently each of the two window tuples is a collision-free tuple, and together with steps 1.1 and 1.2 this shows that W0 and W1 are braids based at Q.

F2F3F4step 1.1
2.2

The endpoint permutations. By [F2] and step 1.1, π(W0)=π(σ1)∘π(σ2⋆σ1)=π(σ1)∘π(σ2)∘π(σ1) and π(W1)=π(σ2)∘π(σ1)∘π(σ2); evaluating the first composite, (1 2)∘(2 3)∘(1 2), at 1,2,3 gives 1↦(1 2)(3)=3, 2↦(1 2)(1)=2 and 3↦(1 2)(2)=1, that is the transposition (1 3), and evaluating the second, (2 3)∘(1 2)∘(2 3), at 1,2,3 gives 1↦1↦2↦3, 2↦3↦3↦2 and 3↦2↦1↦1, which is again (1 3); the same conclusion is read off at u=1, where the windows of step 1.1 give (q3,q2,q1) for both words.

F3step 1.1
2.3

The interpolation and its values at sample heights. Put Zk(s,u):=(1−s)(W0)k(u)+s rotk(u) for k=1,2,3, a jointly continuous map by [F5] and step 1.1; for k<l the collision equation Zk(s,u)=Zl(s,u) with s∈(0,1) is equivalent, by the linearity of Rπu, the identities rotl(u)−rotk(u)=2h(l−k)(cos⁡πu,sin⁡πu) and (1−s)>0, to the statement that (W0)k(u)−(W0)l(u) is a positive multiple of (cos⁡πu,sin⁡πu). At u=0 the three strand positions of W0 are q1,q2,q3, whose differences (−2h,0),(−4h,0),(−2h,0) are negative multiples of (cos⁡0,sin⁡0)=(1,0), so no collision occurs for s∈(0,1), and Z(s,0)=(q1,q2,q3); at u=12 the positions of W0 are q3,q1,q2, whose differences (4h,0),(2h,0),(−2h,0) are horizontal and nonzero while (cos⁡π2,sin⁡π2)=(0,1) is vertical, so no collision occurs, and Z(12,12)=12((2h,0),(−2h,0),(0,0))+12((0,−2h),(0,0),(0,2h))=((h,−h),(−h,0),(0,h)); at u=1 the positions of W0 are q3,q2,q1, whose differences (2h,0),(4h,0),(2h,0) are positive multiples of (1,0) while (cos⁡π,sin⁡π)=(−1,0), so no collision occurs, and Z(s,1)=(q3,q2,q1) for every s.

F1F2F4F5step 1.1step 1.2
3.1

Conclusion. By [F1] the bracketing W0=σ1⋆(σ2⋆σ1) is braid-isotopic to rot, and the reflection κ(w)=−w followed by the relabelling of 1 and 3 turns W0 into W1=σ2⋆(σ1⋆σ2), so W1 is braid-isotopic to rot as well; step 1.2 identifies rot as a braid based at Q, and step 2.2 gives π(W0)=π(W1)=(1 3); step 2.3 exhibits the explicit intermediate values of the deformation, and steps 2.1 and 1.1 record the numerical facts 2∥ρ(v)∥2≥216 and 3h−h=18 behind its collision-freeness. Hence W0∼W1 and, passing to isotopy classes in the group G3 of [F2], [σ1] [σ2] [σ1]=[σ2] [σ1] [σ2]. ∎

F1F2F3step 1.2step 2.2step 2.3

Remarks

  • The numbers are the smallest case of the relation: with h=116 the three base points are −18,0,18 on the horizontal axis, so the local picture of the lemma is the picture of three points spaced 18 apart, and the whole isotopy happens inside the closed ball of radius 18 around the middle point, well inside D∘.
  • The rotation rot is the geometric meaning of the relation: performing the three half twists on the outer pair and the middle pair alternately is the same as rotating the three-point configuration rigidly by the angle π, and the point reflection in the middle point exchanges the two outer strands, which is why the two words have the same endpoint permutation (1 3).
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Setwise endpoints do not make a braid pure

Statement refuted

Refuted claim: a geometric braid based at Q whose top endpoint set is {z1(1),…,zn(1)}={q1,…,qn} returns every strand to its own starting point, that is zj(1)=qj for every j; in other words, the setwise endpoint condition of Geometric braids in the disc with setwise endpoints forces a braid to be pure.

The witness is the elementary half twist σ1 on two strands (The elementary geometric half twist, its support disc, and its opposite, Geometric braids in the disc with setwise endpoints): its top endpoint set is {q1,q2}, exactly the base configuration, but its first strand starts at q1 and ends at q2, and its second strand starts at q2 and ends at q1, so no strand returns to its own starting point and the endpoint permutation of σ1 is the transposition of 1 and 2, not the identity.

What is and is not claimed. What is refuted is only the implication "top endpoint set equal to Q ⇒ each label returns to its own starting point". Nothing here asserts that some other braid fails to be pure, and nothing here computes any invariant beyond the endpoint permutation. The example is the definitional point recorded in the definition of the endpoint permutation: labels are transported continuously from the bottom, so a braid may permute them, and the setwise condition is exactly the condition that this permutation be defined. It also shows that the failure is not an artefact of the choice of representative: since π is constant along braid isotopies (Stacking of geometric braids is a well-defined associative operation on isotopy classes), σ1 cannot be braid-isotopic to the trivial braid, whose endpoint permutation is the identity (The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism).

Facts & Assumptions

Given: The natural number 2, the base configuration Q=(q1,q2) with h=112, q1=(−112,0), q2=(112,0), and the elementary half twist σ1 based at Q.

[F1]

A braid based at Q is a tuple (u1,u2) of continuous maps uj ⁣:I→D∘ with u1(t)≠u2(t), uj(0)=qj and {u1(1),u2(1)}={q1,q2}; its endpoint permutation is the unique π∈S2 with uj(1)=qπ(j), and a braid is called pure when this permutation is the identity; q1≠q2 (Geometric braids in the disc with setwise endpoints, The finite symmetric group Sn, one-line notation, and cycle notation, Intervals of R: the nine order-convex forms, nondegeneracy, and length, Continuity of a map of topological spaces at a point and globally).

[F2]

The half twist is (σ1)1=m1+ρ, (σ1)2=m1−ρ with m1=q1+q22=(0,0) and ρ(0)=(−h,0), ρ(1)=(h,0); σ1 is a braid based at Q and π(σ1) is the transposition of 1 and 2 (The elementary geometric half twist, its support disc, and its opposite, Geometric braids in the disc with setwise endpoints).

[F3]

The endpoint permutation is constant along braid isotopies, so equal values of π are necessary for two braids to be braid-isotopic; in particular the transposition of 1 and 2 differs from the identity permutation of S2, and the trivial braid has the identity endpoint permutation (Stacking of geometric braids is a well-defined associative operation on isotopy classes, Braid isotopy relative to the top and bottom endpoints, The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism, The finite symmetric group Sn, one-line notation, and cycle notation).

Counterexample

technique · direct
1.1

The witness and its endpoint values. Take n=2 and β:=σ1; by [F2] its strands are (σ1)1(t)=m1+ρ(t) and (σ1)2(t)=m1−ρ(t), so (σ1)1(0)=m1+ρ(0)=(−h,0)=q1, (σ1)2(0)=m1−ρ(0)=(h,0)=q2, and at the top (σ1)1(1)=m1+ρ(1)=(h,0)=q2 while (σ1)2(1)=m1−ρ(1)=(−h,0)=q1, since m1=(0,0) and ρ(0)=(−h,0), ρ(1)=(h,0) by [F2].

F2F1
2.1

The setwise condition holds. The top endpoint set of σ1 is {(σ1)1(1),(σ1)2(1)}={q2,q1}={q1,q2} by step 1.1, so σ1 satisfies the hypothesis of the refuted claim; the endpoint permutation of σ1 is the unique π∈S2 with (σ1)j(1)=qπ(j) for j=1,2, which by step 1.1 is the transposition π(1)=2, π(2)=1 of [F2].

F1F2step 1.1
2.2

The pointwise conclusion fails. By step 1.1 the first strand ends at q2≠q1 and the second strand ends at q1≠q2, since q1≠q2 by [F1]; hence (σ1)j(1)≠qj for both labels j, so the conclusion of the refuted claim fails for this braid.

F1step 1.1
3.1

The failure is isotopy invariant. By step 2.1 the endpoint permutation of σ1 is the transposition of 1,2, which is not the identity permutation of S2, whereas the trivial braid has the identity endpoint permutation; by [F3] the endpoint permutation is constant along braid isotopies, so σ1 is not braid-isotopic to the trivial braid, and in particular it is not pure in the sense of [F1].

F3step 2.1
4.1

Conclusion. Steps 1.1, 2.1 and 2.2 exhibit a braid whose top endpoint set equals the base configuration while no strand returns to its own starting point, so the refuted claim is false; step 3.1 shows moreover that this braid is not braid-isotopic to the trivial braid. ∎

step 2.1step 2.2step 3.1

Remarks

  • The distinction is exactly the one the definition records: the top matching of a braid is an arbitrary permutation of the labels, the setwise condition only says that this matching is defined at all, and the pure braids are the special case in which the matching is the identity.
  • The witness is minimal: with two strands the only non-identity permutation is the transposition, and the half twist realises it with the smallest possible support, the disc U1 containing exactly the two base points.

Sources