Alphabeta Math
PropositionStatement: 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.

Stacking of geometric braids is a well-defined associative operation on isotopy classes

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) and qj=((2j−n−1)h,0). Let β=(z1,…,zn) and γ=(w1,…,wn) be braids based at Q with endpoint permutations π(β) and π(γ) (Geometric braids in the disc with setwise endpoints), and let ∼ denote braid isotopy relative to the top and bottom (Braid isotopy relative to the top and bottom endpoints).

(a) The stacked tuple is a braid. Define γ⋆β by

(γ⋆β)j(t):={zj(2t),0≤t≤12,wπ(β)(j)(2t−1),12≤t≤1.

Then γ⋆β is a braid based at Q. It is the stacking of β below γ: the motion β runs during the first half of the height interval and the motion γ during the second half, after the strand of label π(β)(j) has been joined.

(b) The endpoint permutation multiplies. π(γ⋆β)=π(γ)∘π(β), with (π∘σ)(j)=π(σ(j)).

(c) The operation descends to isotopy classes. If β∼β′ and γ∼γ′ then γ⋆β∼γ′⋆β′.

(d) The operation is associative. If δ is a further braid based at Q, then (δ⋆γ)⋆β∼δ⋆(γ⋆β).

(e) The endpoint permutation is constant along isotopies. If β∼β′ then π(β)=π(β′); equivalently π is constant on each braid isotopy class, so that π is a function of the class [β] alone.

Consequently the stacking of isotopy classes, [γ] [β]:=[γ⋆β], is a well-defined associative binary operation on the set of braid isotopy classes based at Q, with π(δ⋆γ⋆β)=π(δ)π(γ)π(β) for any three braids.

Facts & Assumptions

Given: A natural number n, the base configuration Q=(q1,…,qn) with qj=((2j−n−1)h,0) and h=14(n+1), and braids β=(zj), β′, γ=(wj), γ′, δ 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}; its endpoint permutation π(u)∈Sn is the unique permutation with uj(1)=qπ(u)(j) for all j; the points q1,…,qn are pairwise distinct, lie in the interior of the closed unit disc, and are listed with strictly increasing first coordinates (Geometric braids in the disc with setwise endpoints).

[F2]

A braid isotopy from β to β′ is a tuple Z=(Z1,…,Zn) of jointly continuous maps Zj ⁣:I×I→D∘ such that each 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).

[L3]

Composites of continuous maps are continuous, and a function whose domain is covered by finitely many closed sets on each of which it is continuous is continuous (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous).

[L5]

The sets [0,12] and [12,1] are closed subsets of I carrying the subspace topology, their union is I, and likewise the two closed halves {t≤12} and {t≥12} of the square I×I are closed and cover it (Intervals of R: the nine order-convex forms, nondegeneracy, and length, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

Proof

technique · direct
1.1

(a) With (γ⋆β)j given by the two-branch formula of the statement, the two branches agree at t=12, because the first gives zj(1)=qπ(β)(j) and the second gives wπ(β)(j)(0)=qπ(β)(j) by [F1]; both branches are composites of continuous maps with the rescalings t↦2t and t↦2t−1, hence continuous, and the two closed halves of I cover I, so t↦(γ⋆β)j(t) is continuous by [L3] and [L5] and takes values in D∘; it is collision-free because on each half the tuple is the collision-free tuple of time-slices of a braid reparametrised by an injective continuous map and the halves meet only at t=12; the bottom values are (γ⋆β)j(0)=zj(0)=qj, and the top values are (γ⋆β)j(1)=wπ(β)(j)(1)=qπ(γ)(π(β)(j)), which run through the set {q1,…,qn}; hence γ⋆β is a braid based at Q.

F1L3L5
1.2

Braid isotopy is transitive: given an isotopy Z from β to β′ and an isotopy W from β′ to β′′, put Uj(s,t):=Zj(2s,t) for s≤12 and Uj(s,t):=Wj(2s−1,t) for s≥12; the branches agree at s=12 because both equal zj′(t), each is jointly continuous, and the two closed halves of the square cover it, so U is jointly continuous by [L3]; every slice of U is a slice of Z or of W, hence a braid based at Q, and the boundary slices are β and β′′, so U is an isotopy from β to β′′.

F2L3L5
1.3

(e) Let Z be an isotopy from β to β′ and fix j; if n=0 there is no endpoint label and the unique endpoint permutation is fixed; otherwise, for each k put Ak:={s∈I:Zj(s,1)=qk}. The sets Ak are pairwise disjoint and cover I, since every Zj(s,1) is one of the pairwise distinct points qk of [F1]; each Ak is closed in I, being the preimage under the continuous map s↦Zj(s,1) of the closed set {qk} by [L4]; each Ak is also open in I, because for s0∈Ak for n=1 one already has A1=I; for n≥2 the distance δ:=min⁡{∣ql−qk∣:l≠k} is positive by [F1] and continuity at s0 yields a neighbourhood V of s0 in I with ∣Zj(s,1)−qk∣<δ/2 for s∈V, which forces Zj(s,1)=qk and so s∈Ak. Hence the nonempty Ak are pairwise disjoint nonempty clopen subsets of the connected space I by [L4], and if some Ak were nonempty and proper, its open complement ⋃l≠kAl would separate I from it; so exactly one Ak is all of I. Thus Zj(s,1), and with it the endpoint permutation of the braid Z(s,⋅), is independent of s by [F2], and in particular π(β)=π(β′).

F1F2L4
2.1

(b) The top values computed in step 1.1 satisfy (γ⋆β)j(1)=q(π(γ)∘π(β))(j) for every j, so the bijection j↦(π(γ)∘π(β))(j) has the defining property of the endpoint permutation of γ⋆β in [F1]; that permutation is unique, whence π(γ⋆β)=π(γ)∘π(β).

F1step 1.1
2.2

Triple concatenations. Let σ:=π(β) and τ:=π(γ), and for 0<a<b<1 let Θa,b be the tuple that equals zj(t/a) for 0≤t≤a, equals wσ(j)(t−ab−a) for a≤t≤b, and equals vτσ(j)(t−b1−b) for b≤t≤1, where vj are the motions of δ; the three branches agree at the break points by [F1], each is continuous, and the three closed pieces of I cover I, so each Θja,b is continuous by [L3] and [L5]; collision-freeness and the endpoint conditions are checked exactly as in step 1.1, so Θa,b is a braid based at Q, and reading off the two bracketings gives (δ⋆γ)⋆β=Θ1/2, 3/4 and δ⋆(γ⋆β)=Θ1/4, 1/2, since in both the three motions occur in the order β,γ,δ with couplings σ then τ and only the two height breaks differ.

F1step 1.1L3L5
2.3

(c) Let Z be an isotopy from β to β′ and W an isotopy from γ to γ′, and put Uj(s,t):=Zj(s,2t) for t≤12 and Uj(s,t):=Wπ(β)(j)(s,2t−1) for t≥12; the two branches agree at t=12 because Zj(s,1)=qπ(β)(j)=Wπ(β)(j)(s,0) for every s by [F1] and [F2], and step 1.3 shows that the coupling π(β) is the endpoint permutation of every braid Z(s,⋅), so no s-dependent relabelling is needed; joint continuity follows from [L3] and [L5], each slice U(s,⋅) is the stacking of the braids Z(s,⋅) and W(s,⋅), hence a braid by step 1.1, and the boundary slices are γ⋆β and γ′⋆β′; hence γ⋆β∼γ′⋆β′.

F1F2step 1.1step 1.3L3L5
3.1

Moving the breaks is an isotopy. Let s↦(as,bs) be continuous with 0<as<bs<1, a0=12, b0=34, a1=14, b1=12, for instance the linear interpolation of the two pairs; then (s,t)↦Θjas,bs(t) is jointly continuous, because the three regions {t≤as}, {as≤t≤bs}, {t≥bs} are closed and cover the square and on each the formula is a composite of continuous maps with the positive denominators as, bs−as, 1−bs bounded below on the compact parameter interval; each slice is a braid by step 2.2 and the boundary slices are Θ1/2, 3/4 and Θ1/4, 1/2, so those two braids are braid-isotopic.

step 2.2F2L3L5
4.1

(d) Steps 2.2 and 3.1 exhibit the two bracketings (δ⋆γ)⋆β and δ⋆(γ⋆β) of the triple as braid-isotopic representatives, and step 2.3 shows that the isotopy class of a stacking depends only on the isotopy classes of its two factors; hence (δ⋆γ)⋆β∼δ⋆(γ⋆β) for the given braids, and the induced operation on classes is associative.

F2step 2.2step 2.3step 3.1
5.1

Assertions (a), (b), (c), (d) and (e) are steps 1.1, 2.1, 2.3, 4.1 and 1.3, so the stacking of classes [γ][β]=[γ⋆β] is a well-defined associative binary operation on the set of braid isotopy classes based at Q, and π(δ⋆γ⋆β)=π(δ)π(γ)π(β) follows by applying step 2.1 twice. ∎

step 1.1step 1.3step 2.1step 2.3step 4.1

Remarks

  • The reparametrisation used in step 3.1 is the only place where associativity needs work: the two bracketings of a threefold stack differ by how the height interval is cut, and a continuous family of cuts is an isotopy because the underlying sequence of motions, and all label couplings, are unchanged.
  • Clause (e) is what makes the endpoint permutation a function of the isotopy class rather than of the representative; it is the connectedness of the height interval, through [L4], that rules out a strand ending at a different base point at the two ends of an isotopy.
  • Nothing in the proposition uses a choice principle: the base configuration, and every reparametrisation, is given by an explicit formula, and the two-element cover of I in step 1.1 is finite.

Depends on

Used by

Dependency tree · two levels

35 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