Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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 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).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

74 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