Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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 elementary geometric half twist, its support disc, and its opposite

Definition

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) and qj=((2j−n−1)h,0). Fix an index i with 1≤i≤n−1. The two adjacent base points are

qi=((2i−n−1)h,0),qi+1=((2i+1−n)h,0),

their midpoint is mi:=(qi+qi+1)/2=((2i−n)h,0)=qi+(h,0), and their support disc is the open disc

Ui:={w∈R2:∥w−mi∥2<32h}.

The support disc contains the two base points qi,qi+1, whose distance from mi is h, and it contains no other base point: for k<i one has ∥qk−mi∥2=(2(i−k)+1)h≥3h and for k>i+1 one has ∥qk−mi∥2=(2(k−i)−1)h≥3h, both exceeding 32h. Moreover Ui⊆D∘, because every point of Ui has norm at most ∥mi∥2+32h≤(n−2)h+32h<(n+1)h<1. Finally Ui∩Uj=∅ whenever ∣i−j∣>1, since then the midpoints are at distance 2∣i−j∣h≥4h>3h, twice the radius.

The positive half twist. Define ρ ⁣:I→R2, the anticlockwise diamond path, by

ρ(t):={(2th−h, −2th),0≤t≤12,(2th−h, 2th−2h),12≤t≤1.

Thus ρ(0)=(−h,0), ρ(12)=(0,−h), ρ(1)=(h,0), and ρ is continuous, piecewise linear, and satisfies ∥ρ(t)∥2≤h for all t with ρ(t)≠0 throughout. The elementary half twist at i, written σi, is the tuple of motions

(σi)i(t):=mi+ρ(t),(σi)i+1(t):=mi−ρ(t),(σi)k(t):=qk  (k∉{i,i+1}).

It is a braid based at Q (Geometric braids in the disc with setwise endpoints, Continuity of a map of topological spaces at a point and globally): the two moving points stay in Ui and are antipodal about mi, so they are distinct; every other point is fixed and lies outside Ui; and the endpoint permutation is the transposition of i and i+1, since (σi)i(1)=mi+(h,0)=qi+1 and (σi)i+1(1)=mi−(h,0)=qi.

The words positive and anticlockwise refer to the fixed orientation of the plane of the disc and to the fixed planar projection whose horizontal axis contains Q: the moving pair turns through the half turn anticlockwise, the label i passing below its midpoint and the label i+1 above. Together with the first-under-second stacking convention of Stacking of geometric braids is a well-defined associative operation on isotopy classes this fixes the sign convention for every signed crossing on this page and its companion.

The opposite half twist. The opposite (clockwise) half twist at i is defined by the reflected path

ρ−(t):=(ρ1(t),−ρ2(t)),

through the motions (σi−)i(t):=mi+ρ−(t), (σi−)i+1(t):=mi−ρ−(t) and (σi−)k(t):=qk for k∉{i,i+1}. It is again a braid supported in Ui with endpoint permutation the transposition of i and i+1; its pair turns through the same half turn clockwise, the label i passing above the midpoint. The two motions are not equal, and they are not related by a reparametrisation of the height: they are the two signed crossings of the pair.

The opposite motion is the group inverse. For a braid β the reversed braid β‾j(t)=zπ(β)−1(j)(1−t) represents [β]−1 in the group Gn (The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism). For β=σi one computes σi‾=σi−: reversing the height and relabelling by the transposition of i and i+1 sends ρ(t)=mi+(ρ1,ρ2) to the motion with relative path −ρ(1−t), which is the reflected path ρ− traversed from t=0 to t=1. Hence

[σi−]=[σi]−1in Gn.

Elementary cases. For n≤1 there is no index i with 1≤i≤n−1, and there are no elementary half twists; the assertions above are vacuous. For n≥2 and 1≤i≤n−1 both [σi] and [σi−] are nonidentity elements of Gn, since their endpoint permutations are transpositions, which are not the identity permutation.

Two letters do not commute in general. For adjacent indices the supports Ui and Ui+1 overlap and no commutation is asserted; Far commutativity of elementary geometric half twists proves commutativity only for disjoint supports.

Depends on

Used by

Dependency tree · two levels

22 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