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.

Far commutativity of elementary geometric half twists

Statement

Let n∈N and let Q=(q1,…,qn) be the base configuration of Geometric braids in the disc with setwise endpoints, with h=14(n+1). Let i,j be indices with 1≤i,j≤n−1 and ∣i−j∣>1; then the two pairs {i,i+1} and {j,j+1} are disjoint, and such indices exist only for n≥4, so for n≤3 the assertions below are vacuous. Write mi=qi+(h,0) and let ρ be the diamond path, so that the half twists σi, σj and their supports Ui, Uj are as in The elementary geometric half twist, its support disc, and its opposite, with Ui∩Uj=∅.

(a) The simultaneous braid. Define Σij, the simultaneous execution of the two half twists, by

(Σij)i:=mi+ρ,(Σij)i+1:=mi−ρ,(Σij)j:=mj+ρ,(Σij)j+1:=mj−ρ,

and (Σij)k(t):=qk for the remaining labels k. Then Σij is a braid based at Q, and both stackings of the two half twists are braid-isotopic to it. Here ∼ denotes braid isotopy (Braid isotopy relative to the top and bottom endpoints) and ⋆ the stacking of Stacking of geometric braids is a well-defined associative operation on isotopy classes:

σi⋆σj ∼ Σij ∼ σj⋆σi.

(b) Far commutativity. Consequently [σi][σj]=[σj][σi] in the group Gn of The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism: far-away half twists commute.

The isotopy is explicit and no choice principle is used.

Facts & Assumptions

Given: A natural number n, the base configuration Q=(q1,…,qn), indices i,j with 1≤i,j≤n−1 and ∣i−j∣>1, and the half twists σi,σj based at Q.

[F1]

A braid based at Q is a tuple (u1,…,un) of continuous maps uj ⁣:I→D∘ with ui(t)≠uj(t) for i≠j, uj(0)=qj, and {u1(1),…,un(1)}={q1,…,qn}; the endpoint permutation π(u) is the unique permutation with uj(1)=qπ(u)(j) (Geometric braids in the disc with setwise endpoints).

[F2]

The half twist at i is (σi)i=mi+ρ, (σi)i+1=mi−ρ and (σi)k=qk for k∉{i,i+1}, where mi=qi+(h,0) and ρ(0)=(−h,0), ρ(12)=(0,−h), ρ(1)=(h,0) with ∥ρ(t)∥2≤h and ρ(t)≠0 for every t; σi is a braid based at Q with endpoint permutation the transposition of i and i+1; its support disc Ui contains qi,qi+1 and no other base point, satisfies Ui⊆D∘, and Ui∩Uj=∅ whenever ∣i−j∣>1 (The elementary geometric half twist, its support disc, and its opposite).

[F3]

Stacking is (γ⋆β)j(t)=zj(2t) for t≤12 and (γ⋆β)j(t)=wπ(β)(j)(2t−1) for t≥12, with π(γ⋆β)=π(γ)∘π(β); it descends to isotopy classes and is associative, and braid isotopy is the equivalence relation generated by the jointly continuous families of Braid isotopy relative to the top and bottom endpoints (Stacking of geometric braids is a well-defined associative operation on isotopy classes).

[F4]

A braid isotopy from β to β′ is a tuple Z=(Z1,…,Zn) of jointly continuous maps Zj ⁣:I×I→D∘ such that every slice Z(s,⋅) is a braid based at Q and Zj(0,t)=zj(t), Zj(1,t)=zj′(t) for all j,t (Braid isotopy relative to the top and bottom endpoints).

[F5]

Gn is a group whose operation is induced by stacking, so [γ][β]=[γ⋆β], and [β]=[β′] whenever β∼β′ (The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism, Stacking of geometric braids is a well-defined associative operation on isotopy classes).

[L6]

Composites of continuous maps are continuous and continuity on the two closed halves of a square pastes, the interval I=[0,1] and its two closed halves carrying the subspace topology (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

(a), Σij is a braid. Each motion of Σij is either the constant qk or one of mi±ρ, mj±ρ, hence continuous with values in Ui respectively Uj, and Ui∪Uj⊆D∘ by [F2]; the only nonconstant pairs are {i,i+1}, which are antipodal about mi and therefore distinct because ρ(t)≠0 for every t by [F2], and {j,j+1}, likewise antipodal about mj; the two supports are disjoint and the remaining motions are the constant qk with qk∉Ui∪Uj, so all n motions are pairwise distinct at every height; the bottom values are mi+ρ(0)=mi+(−h,0)=qi, mi−ρ(0)=qi+1 and likewise for j, the remaining values being the base points themselves; the top values are mi+ρ(1)=qi+1, mi−ρ(1)=qi and likewise for j, so the top values run through {q1,…,qn} and the endpoint permutation of Σij is the product of the transpositions of i,i+1 and of j,j+1.

F1F2
1.2

The interpolation of the two time windows. For s∈I put αs(t):=0 for t≤1−s2 and αs(t):=t−(1−s)/2(1+s)/2 for t≥1−s2, and βs(t):=t(1+s)/2 for t≤1+s2, βs(t):=1 for t≥1+s2; the two branches of each definition agree at the switch point, so αs,βs are continuous, nondecreasing and map I onto I with αs(0)=βs(0)=0 and αs(1)=βs(1)=1, the map (s,t)↦(αs(t),βs(t)) is jointly continuous because the switch points depend continuously on s and the two branches agree there, and α0(t)=max⁡(0,2t−1), β0(t)=min⁡(2t,1), α1=β1=id⁡I.

F2L6
1.3

Pasting two isotopies. If Z is a braid isotopy from β to β′ and W one from β′ to β′′, then Uj(s,t):=Zj(2s,t) for s≤12 and Uj(s,t):=Wj(2s−1,t) for s≥12 is jointly continuous by [L6] because the branches agree at s=12 and the two closed halves of the square cover it, every slice of U is a slice of Z or of W and hence a braid based at Q by [F4], and its boundary slices are β and β′′; so braid isotopy is transitive.

F4L6
2.1

The isotopy. Define Zk(s,t):=mi+ρ(αs(t)) for k=i, Zk(s,t):=mi−ρ(αs(t)) for k=i+1, Zk(s,t):=mj+ρ(βs(t)) for k=j, Zk(s,t):=mj−ρ(βs(t)) for k=j+1, and Zk(s,t):=qk otherwise. Every Zk is a composite of jointly continuous maps by step 1.2 and [F2], hence jointly continuous; for fixed s the tuple Z(s,⋅) is collision-free and takes the base values at t=0 and the setwise base values at t=1 by the same computations as in step 1.1, with αs,βs in place of the identity: at t=0 one has αs(0)=βs(0)=0 so the four moving labels sit at qi,qi+1,qj,qj+1, while at t=1 one has αs(1)=βs(1)=1 so they sit at the same four points with the two neighbouring labels interchanged.

F1F2step 1.1step 1.2
3.1

The two ends of the isotopy. At s=0 the formulas of step 1.2 give Zk(0,t)=mi+ρ(max⁡(0,2t−1)) for k=i and Zk(0,t)=mi−ρ(max⁡(0,2t−1)) for k=i+1, which is the motion of σi run during the second half of the height interval and held at qi respectively qi+1 during the first half, while Zk(0,t)=mj±ρ(min⁡(2t,1)) for the labels k=j,j+1 runs σj during the first half and holds it at the swapped base points during the second half, and all other labels are constant; comparing with the stacking formula (γ⋆β)k(t)=zk(2t) for t≤12, =wπ(β)(k)(2t−1) for t≥12 of [F3], with β=σj, γ=σi and π(σj) the transposition of j,j+1, shows Z(0,⋅)=σi⋆σj. At s=1 one has α1=β1=id⁡I by step 1.2 and step 2.1, so Z(1,⋅)=Σij by the definitions of step 1.1.

F2F3step 1.1step 1.2step 2.1
4.1

(a), first stacking. Step 2.1 exhibits Z as a tuple of jointly continuous maps whose every slice is a braid based at Q, and step 3.1 identifies its boundary slices as σi⋆σj and Σij; hence Z is a braid isotopy from σi⋆σj to Σij in the sense of [F4], that is σi⋆σj∼Σij.

F4step 2.1step 3.1
4.2

(a), second stacking. Interchanging the roles of the two pairs, that is replacing (αs,i,Ui) by (βs,j,Uj) and conversely throughout steps 1.2, 2.1 and 3.1, yields in the same way a braid isotopy whose first boundary slice is σj⋆σi, the pair {i,i+1} now executing its half twist during the second half of the height interval and the pair {j,j+1} during the first, and whose second boundary slice is again Σij; hence σj⋆σi∼Σij.

F1F2F3F4step 1.1step 1.2step 2.1step 3.1
5.1

Steps 4.1 and 4.2 give σi⋆σj∼Σij∼σj⋆σi, so transitivity of braid isotopy in step 1.3 yields σi⋆σj∼σj⋆σi; passing to isotopy classes with [F5] gives [σi][σj]=[σi⋆σj]=[σj⋆σi]=[σj][σi], which is (b), while (a) is steps 1.1, 4.1 and 4.2. ∎

F5step 4.1step 4.2step 1.3step 1.1

Remarks

  • The only geometric input is that the two supports are disjoint: the pairs of moving labels are distinct, so the two half turns never see each other, and the two time windows can be slid past one another.
  • The isotopy of step 2.1 is not a reparametrisation of the height in the sense of items 1 to 4: the two pairs are reparametrised by different functions αs and βs, and this is legitimate because each pair is unaffected by the other.
  • Assertion (b) is a statement in the group Gn of isotopy classes, not an equality of the braids σi⋆σj and σj⋆σi themselves; the two stackings are distinct parametrised tuples whenever n≥4, since their height windows differ.

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