Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27
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.

The geometric three strand braid relation

Statement

Let n≥3 and let i be an index with 1≤i≤n−2. Let σi and σi+1 be the elementary half twists of The elementary geometric half twist, its support disc, and its opposite based at Q, and let ⋆ be the stacking of Stacking of geometric braids is a well-defined associative operation on isotopy classes. Then

σi⋆σi+1⋆σi ∼ σi+1⋆σi⋆σi+1,

and consequently, in the group Gn of The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism,

[σi] [σi+1] [σi]=[σi+1] [σi] [σi+1].

The proof exhibits an explicit intermediate braid: writing κ for the point reflection w↦2qi+1−w and rot for the rotation of the three points qi,qi+1,qi+2 about qi+1 by the angle πu at height u, with the remaining strands fixed, 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, and the reflection κ, 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 two bracketings of each word are themselves braid-isotopic by the associativity of stacking. All constructions are explicit and no choice principle is used.

Facts & Assumptions

Given: A natural number n≥3, an index i with 1≤i≤n−2, the base configuration Q=(q1,…,qn) with qj+1−qj=(2h,0) and h=14(n+1), and the half twists σi,σi+1 based at Q.

[F1]

A braid based at Q is a tuple (u1,…,un) of continuous maps uj ⁣:I→D∘ with uk(t)≠ul(t) for k≠l, uk(0)=qk, and {u1(1),…,un(1)}={q1,…,qn}; its endpoint permutation π(u) is the unique permutation with uk(1)=qπ(u)(k); the points qi,qi+1,qi+2 are collinear and equally spaced, so in the coordinates centred at qi+1 they are (−2h,0),(0,0),(2h,0), and ∣qj−qi+1∣≥4h for every j∉{i,i+1,i+2} (Geometric braids in the disc with setwise endpoints).

[F2]

The half twist at k is (σk)k=mk+ρ, (σk)k+1=mk−ρ and (σk)j=qj otherwise, where mk=qk+(h,0); the diamond path ρ satisfies ρ(0)=(−h,0), ρ(12)=(0,−h), ρ(1)=(h,0), ∥ρ(v)∥2≤h, and ρ2(v)≤0 with ρ2(v)=0 only for v∈{0,1} and ρ(v)≠0 for every v∈I; and π(σk) is the transposition of k and k+1, while the support disc contains qk,qk+1 and no other base point (The elementary geometric half twist, its support disc, and its opposite).

[F3]

A braid isotopy is a tuple of jointly continuous maps Zj ⁣:I×I→D∘ whose every slice is a braid based at Q and whose boundary slices are the two given braids (Braid isotopy relative to the top and bottom endpoints).

[F4]

Stacking places its right factor in the lower half of the height interval and its left factor in the upper half: writing zj for the strands of the right factor β and wj for those of the left factor γ, one has (γ⋆β)j(t)=zj(2t) for t≤12 and (γ⋆β)j(t)=wπ(β)(j)(2t−1) for t≥12; stacking of braids is a braid, it descends to isotopy classes, π(γ⋆β)=π(γ)∘π(β), and the two bracketings of a threefold stacking are braid-isotopic, (δ⋆γ)⋆β∼δ⋆(γ⋆β) (Stacking of geometric braids is a well-defined associative operation on isotopy classes).

[F5]

Gn is a group with operation [γ][β]=[γ⋆β], so equal isotopy classes have equal products (The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism).

[L6]

Composites of continuous maps are continuous and continuity pastes over the two closed halves of a square; the interval I=[0,1] carries the subspace topology in which the points 0,12,1 cut it into closed pieces (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).

Proof

technique · direct
1.1

(The two bracketings, in local coordinates.) Put c:=qi+1, p1:=qi, p2:=qi+1, p3:=qi+2, m:=mi=qi+(h,0) and m′:=mi+1=qi+1+(h,0), so that the centred vectors p1−c=(−2h,0), p2−c=(0,0), p3−c=(2h,0), while m−c=(−h,0) and m′−c=(h,0); since π(σi) is the transposition of i,i+1 and π(σi+1) that of i+1,i+2 by [F2] and π multiplies by [F4], the composite π(σi⋆σi+1)=π(σi)∘π(σi+1) is the 3-cycle i↦i+1↦i+2↦i and π(σi+1⋆σi) is its inverse i↦i+2↦i+1↦i, so applying the stacking formula of [F4] twice shows that the strands i,i+1,i+2 of W0:=σi⋆(σi+1⋆σi) are (m+ρ(4u), m−ρ(4u), p3) for 0≤u≤14, (m′+ρ(4u−1), p1, m′−ρ(4u−1)) for 14≤u≤12 and (p3, m+ρ(2u−1), m−ρ(2u−1)) for 12≤u≤1, while the same computation with the roles of i and i+1 interchanged shows that the strands i,i+1,i+2 of W1:=σi+1⋆(σi⋆σi+1) are (p1, m′+ρ(4u), m′−ρ(4u)) for 0≤u≤14, (m+ρ(4u−1), p3, m−ρ(4u−1)) for 14≤u≤12 and (m′+ρ(2u−1), m′−ρ(2u−1), p1) for 12≤u≤1, every remaining strand of either tuple being constantly at its base point; hence W0 and W1 are braids based at Q by [F4], with π(W0)=(i i+1)∘(i+1 i+2)∘(i i+1) and π(W1)=(i+1 i+2)∘(i i+1)∘(i+1 i+2), both the transposition of i and i+2, and by the associativity clause of [F4] W0 is braid-isotopic to σi⋆σi+1⋆σi and W1 to σi+1⋆σi⋆σi+1.

F1F2F4L6
1.2

(The rotation braid.) Let Rθ be the linear rotation of R2 about the origin through angle θ, and define vk:=qk−c and rotk(u):=c+Rπuvk for k∈{i,i+1,i+2}; put rotk(u):=qk for all other labels. The motions are continuous, the two outer centred vectors are antipodal because vi+2=−vi, and vi+1=0, so the middle strand stays at c and all three remain pairwise distinct. Their distance from the origin is at most ∥c∥2+2h≤(n+1)h<1; every other base point is at distance at least 4h from c by [F1], so no moving strand meets a constant one. At u=0 the triple has values c+vk=qk, and at u=1 it has values c−vk=q2i+2−k; thus rot is based at Q and has endpoint permutation (i i+2), shared by W0 and W1.

F1F2L6
2.1

(The interpolation family.) For s∈I define Zk(s,u):=(1−s) (W0)k(u)+s rotk(u) for every label k, where (W0)k and rotk are the motions of step 1.1 and step 1.2; each Zk is jointly continuous, being a sum of products of continuous functions, and satisfies ∥Zk(s,u)∥2≤(1−s)∥(W0)k(u)∥2+s∥rotk(u)∥2<1, so it maps I×I into D∘; at u=0 one has Zk(s,0)=qk for every s because (W0)k(0)=rotk(0)=qk, and at u=1 one has Zk(s,1)=qπ(k) for every s because (W0)k(1)=rotk(1)=qπ(k) for the transposition π of i and i+2 shared by both braids; so each slice Z(s,⋅) satisfies the endpoint conditions of [F1].

F1F3step 1.1step 1.2L6
2.2

(The collision criterion.) Fix s∈(0,1) and u∈I and let k<l be two labels of the triple {i,i+1,i+2}; since rotk(u)−rotl(u)=Rπu(qk−ql) by step 1.2 and qk−ql=−2hλkl(1,0) with λkl:=l−k>0 by [F1], the equality Zk(s,u)=Zl(s,u) is equivalent to (1−s) ((W0)k(u)−(W0)l(u))=2hs λkl (cos⁡πu,sin⁡πu), hence to the statement that (W0)k(u)−(W0)l(u) is a positive multiple of (cos⁡πu,sin⁡πu); so a slice Z(s,⋅) with s∈(0,1) has no collision between two labels of the triple as soon as no difference (W0)k−(W0)l with k<l in the triple is a positive multiple of (cos⁡πu,sin⁡πu) at any height u.

F1F2step 1.1step 1.2
2.3

(Phase one: 0≤u≤14, v=4u.) In this and the next two phase calculations, a subscript a∈{1,2,3} on (W0)a denotes the local position in the active triple, namely the global strand (W0)i+a−1; all other strands remain fixed. Here (W0)1−(W0)2=2ρ(v) has second coordinate ≤0, while (W0)1−(W0)3=(−3h,0)+ρ(v) and (W0)2−(W0)3=(−3h,0)−ρ(v) have first coordinate at most −2h<0; since cos⁡(πu)≥cos⁡(π4)>0 and sin⁡(πu)≥0 on this phase, a positive multiple of (cos⁡πu,sin⁡πu) has positive first coordinate, which excludes the pairs (1,3) and (2,3), while for the pair (1,2) the second coordinates would have to agree, forcing 2ρ2(v)=λsin⁡(πu)≥0 and hence ρ2(v)=0, that is v∈{0,1}; at v=0 one has (W0)1−(W0)2=2ρ(0)=(−2h,0), a negative multiple of (cos⁡0,sin⁡0)=(1,0), and at v=1 one has (W0)1−(W0)2=2ρ(1)=(2h,0), which is not a multiple of (cos⁡π4,sin⁡π4) at all.

F2step 1.1
2.4

(Phase two: 14≤u≤12, v=4u−1.) Here (W0)1−(W0)2=(2h+2hv,−2hv) respectively (2h+2hv,2hv−2h) according to whether v≤12 or v≥12, (W0)1−(W0)3=2ρ(v) and (W0)2−(W0)3=(2hv−4h,−2hv) respectively (2hv−4h,2hv−2h); all three have second coordinate at most 0, while sin⁡(πu)≥sin⁡(π4)>0 on this phase, so no one of them is a positive multiple of (cos⁡πu,sin⁡πu), whose second coordinate is positive.

F2step 1.1
2.5

(Phase three: 12≤u≤1, v=2u−1.) Here (W0)1−(W0)2=(3h,0)−ρ(v) and (W0)1−(W0)3=(3h,0)+ρ(v) have first coordinate at least 2h>0, while cos⁡(πu)≤0 on this phase, so neither is a positive multiple of (cos⁡πu,sin⁡πu); the remaining difference (W0)2−(W0)3=2ρ(v) has second coordinate at most 0, and a positive multiple of (cos⁡πu,sin⁡πu) has second coordinate ≥0 because sin⁡(πu)≥0 on this phase, so a coincidence would force the common second coordinate to vanish, that is ρ2(v)=0 and sin⁡(πu)=0, which gives v∈{0,1} and u∈{12,1}; with v=2u−1 this leaves the two candidates (u,v)=(12,0), where (W0)2−(W0)3=(−2h,0) is not a multiple of (cos⁡π2,sin⁡π2)=(0,1), and (u,v)=(1,1), where (W0)2−(W0)3=(2h,0) is a negative multiple of (cos⁡π,sin⁡π)=(−1,0) rather than a positive one.

F2step 1.1
3.1

(The isotopy from W0 to rot.) By steps 2.2, 2.3, 2.4 and 2.5 no two labels of the triple can meet in any slice Z(s,⋅) with s∈(0,1) and any height u, and at s=0 the slice is W0 and at s=1 it is rot, which are braids with pairwise distinct strands by steps 1.1 and 1.2; the triple values (W0)k(u) and rotk(u) all lie within distance 2h of c by steps 1.1 and 1.2 and [F2], so ∥Zk(s,u)−c∥2≤(1−s)∥(W0)k(u)−c∥2+s∥rotk(u)−c∥2≤2h puts every triple strand of every slice in the ball of radius 2h about c, while the remaining strands are constantly at base points of distance at least 4h from c by [F1], so no triple strand ever meets one of them; with the endpoint computations of step 2.1 this makes Z a braid isotopy from W0 to rot in the sense of [F3].

F1F2F3step 1.1step 1.2step 2.1step 2.2step 2.3step 2.4step 2.5
4.1

(The reflection.) Let κ(w):=2c−w be the point reflection in c and let τ be the transposition of i and i+2; for k∈{i,i+1,i+2} put Zk′(s,u):=κ(Zτ(k)(s,u)) and Zk′(s,u):=qk for the remaining labels; each Zk′ is jointly continuous and, by step 3.1 and ∥κ(w)−c∥2=∥w−c∥2, every value lies within distance 2h of c and hence in D∘, because ∥c∥2+2h≤(n+1)h<1 as in step 1.2; within the triple κ is injective, so distinct reflected strands stay distinct, and they stay within distance 2h of c and hence at distance at least 2h from the constant strands, which are at distance at least 4h from c by [F1]; so every slice Z′(s,⋅) is a braid based at Q; at s=1 one has Z′=rot, because κ(rotτ(k)(u))=c−Rπuvτ(k)=c+Rπuvk=rotk(u) for the three points p1,p2,p3, whose labelling by τ only exchanges the two outer centred vectors and satisfies vτ(k)=−vk; at s=0 the reflected slice is W1, because the reflection identities κ(m+ρ(v))=m′−ρ(v), κ(m−ρ(v))=m′+ρ(v), κ(p1)=p3 and κ(p3)=p1 turn the window values of W0 of step 1.1 into those of W1: on [0,14] the reflected values are (κ(p3),κ(m−ρ(4u)),κ(m+ρ(4u)))=(p1,m′+ρ(4u),m′−ρ(4u)), on [14,12] they are (κ(m′−ρ(4u−1)),κ(p1),κ(m′+ρ(4u−1)))=(m+ρ(4u−1),p3,m−ρ(4u−1)) and on [12,1] they are (κ(m−ρ(2u−1)),κ(m+ρ(2u−1)),κ(p3))=(m′+ρ(2u−1),m′−ρ(2u−1),p1), which are exactly the window values of W1; hence Z′ is a braid isotopy from W1 to rot.

F1F2F3step 1.1step 1.2step 3.1L6
5.1

(Conclusion.) Steps 3.1 and 4.1 show that W0 and W1 are both braid-isotopic to rot, hence braid-isotopic to each other; step 1.1 identifies W0 as the bracketing σi⋆(σi+1⋆σi) and W1 as the bracketing σi+1⋆(σi⋆σi+1), and the associativity clause of [F4] shows that each is braid-isotopic to the corresponding word with the other bracketing, so that σi⋆σi+1⋆σi∼σi+1⋆σi⋆σi+1; passing to isotopy classes with [F5] gives [σi][σi+1][σi]=[σi+1][σi][σi+1] in Gn. ∎

F4F5step 1.1step 3.1step 4.1

Remarks

  • The proof is local: only the three strands i,i+1,i+2 move, and all formulas are those of the three-strand picture with base points (−2h,0),(0,0),(2h,0) spaced 2h apart, which is why the lemma holds for every n≥3 and every i with 1≤i≤n−2.
  • The moving strands stay within distance 2h of qi+1 throughout the interpolation and the reflection, while every other base point is at distance at least 4h from qi+1; this clearance is what makes the local computation an isotopy of n-strand braids.
  • The braid relation is the geometric statement that three consecutive half twists of a triple can be deformed into the same three half twists performed by rotating the triple rigidly by π about its middle point; the point reflection in that middle point exchanges the two outer strands and turns one word into the other.
  • The bracketing enters the formulas but not the conclusion: the proof computes the bracketings σi⋆(σi+1⋆σi) and σi+1⋆(σi⋆σi+1), and the associativity clause of Stacking of geometric braids is a well-defined associative operation on isotopy classes supplies the isotopy to the bracketings (σi⋆σi+1)⋆σi and (σi+1⋆σi)⋆σi+1.

Depends on

Used by

Dependency tree · two levels

25 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