Alphabeta Math
TheoremStatement: 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 isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism

Statement

Let n∈N and let Q=(q1,…,qn) be the base configuration of Geometric braids in the disc with setwise endpoints. Write

Gn:={[β]:β a braid based at Q}

for the set of braid isotopy classes relative to the top and bottom (Braid isotopy relative to the top and bottom endpoints), and let [γ][β]:=[γ⋆β] be the stacking of Stacking of geometric braids is a well-defined associative operation on isotopy classes. Then:

(a) Gn is a group (Group and abelian group) with this operation. Its identity is the class [e] of the trivial braid ej(t):=qj, and the inverse of [β], for β=(z1,…,zn) with endpoint permutation π(β), is the class of the reversed braid

β‾j(t):=zπ(β)−1(j)(1−t)(t∈I, 1≤j≤n).

(b) The endpoint permutation map

π ⁣:Gn⟶Sn,[β]⟼π(β),

is a well-defined group homomorphism (The finite symmetric group Sn, one-line notation, and cycle notation).

The construction is choice-free: all motions and reparametrisations used are given by explicit formulas.

Facts & Assumptions

Given: A natural number n, the base configuration Q=(q1,…,qn), braids β=(zj), γ, δ based at Q, the trivial braid e, and isotopy classes as above.

[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)∈Sn is the unique permutation with uj(1)=qπ(u)(j); a braid is pure exactly when π(u)=id⁡, and the trivial braid ej(t)=qj is pure (Geometric braids in the disc with setwise endpoints, The finite symmetric group Sn, one-line notation, and cycle notation).

[F2]

Stacking [γ][β]=[γ⋆β] of Stacking of geometric braids is a well-defined associative operation on isotopy classes is well defined on isotopy classes and associative, π(γ⋆β)=π(γ)∘π(β), and the endpoint permutation is constant along braid isotopies: if β∼β′ then π(β)=π(β′).

[F3]

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; isotopy implies homotopy of the strands relative to the endpoints of the motions, in the sense of Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints (Braid isotopy relative to the top and bottom endpoints).

[L4]

A group is a set with an associative binary operation, a two-sided identity and two-sided inverses (Group and abelian group).

[L5]

Composites of continuous maps are continuous, continuity on a finite closed cover pastes, and the interval I=[0,1] carries the subspace topology in which [0,12] and [12,1] are closed and cover I (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Proof

technique · direct
1.1

(a), the identity. Write μ(t):=max⁡(0,2t−1) and ν(t):=min⁡(2t,1); since the right factor of a stacking runs during the first half of the height interval, (e⋆β)j(t)=zj(2t)=zj(ν(t)) for t≤12 and (e⋆β)j(t)=eπ(β)(j)(2t−1)=qπ(β)(j)=zj(1)=zj(ν(t)) for t≥12, while (β⋆e)j(t)=ej(2t)=qj=zj(0)=zj(μ(t)) for t≤12 and (β⋆e)j(t)=zπ(e)(j)(2t−1)=zj(2t−1)=zj(μ(t)) for t≥12; so e⋆β and β⋆e are the reparametrisations zj∘ν and zj∘μ of the tuple β. Both μ and ν are continuous nondecreasing maps of I onto I fixing 0 and 1 by [L5], so for s∈I the maps μs(t):=(1−s)t+sμ(t) and νs(t):=(1−s)t+sν(t) are again of that kind, and Zj(s,t):=zj(μs(t)), Wj(s,t):=zj(νs(t)) are jointly continuous by [L5]; each slice (zj(μs(t)))j is a braid based at Q, because μs(0)=0, μs(1)=1 and the collision-freeness and continuity conditions of [F1] are inherited from β, and likewise for νs; the boundary slices are β, e⋆β and β⋆e by μ0=ν0=id⁡, μ1=μ, ν1=ν. Hence e⋆β∼β and β⋆e∼β, so [e] is a two-sided identity for the operation of [F2].

F1F2F3L5
1.2

(a), the inverse is a braid. For β‾j(t):=zπ(β)−1(j)(1−t) each β‾j is a composite of continuous maps with values in D∘, and β‾i(t)≠β‾j(t) for i≠j because π(β)−1 is injective and the zk are collision-free by [F1]; its bottom values are β‾j(0)=zπ(β)−1(j)(1)=qπ(β)(π(β)−1(j))=qj, using the defining property of π(β) in [F1], and its top values are β‾j(1)=zπ(β)−1(j)(0)=qπ(β)−1(j), which run through the set {q1,…,qn}; hence β‾ is a braid based at Q with π(β‾)=π(β)−1.

F1
1.3

(b). The map π is well defined on classes [β] by the constancy of the endpoint permutation along isotopies in [F2]; it satisfies π(γ⋆β)=π(γ)∘π(β) by [F2], and π(e)=id⁡ because e is pure by [F1]; a map of groups that preserves the operation and the identity is a group homomorphism into the symmetric group Sn of The finite symmetric group Sn, one-line notation, and cycle notation, so the formula π ⁣:Gn→Sn, [β]↦π(β), defines a group homomorphism once Gn is known to be a group.

F1F2
2.1

(a), β‾⋆β∼e. By the stacking formula of [F2] and step 1.2, (β‾⋆β)j(t)=zj(2t) for t≤12 and (β‾⋆β)j(t)=β‾π(β)(j)(2t−1)=zπ(β)−1(π(β)(j))(2−2t)=zj(2−2t) for t≥12; that is, β‾⋆β is the out-and-back reparametrisation zj∘λ of β with λ(t):=2t for t≤12 and λ(t):=2−2t for t≥12. For s∈I put λs(t):=(1−s)λ(t); then λs is continuous with λs(0)=λs(1)=0, so Zj(s,t):=zj(λs(t)) is jointly continuous by [L5], each slice (zj(λs(t)))j is a braid based at Q because it is a reparametrisation of the collision-free tuple β with all bottom and top values equal to qj, and the boundary slices are β‾⋆β at s=0 and e at s=1; hence β‾⋆β∼e.

F1F2F3step 1.2L5
3.1

(a), β⋆β‾∼e. By the same computation with the roles of the two factors exchanged, (β⋆β‾)j(t)=zπ(β)−1(j)(1−2t) for t≤12 and (β⋆β‾)j(t)=zπ(β)−1(j)(2t−1) for t≥12, which is again an out-and-back parametrisation of β with the labels relabelled by π(β)−1; putting κ(t):=1−2t for t≤12 and κ(t):=2t−1 for t≥12, and then κs(t):=(1−s)κ(t)+s, gives a braid isotopy: κs(0)=κs(1)=1, so every slice begins and ends at zπ(β)−1(j)(1)=qj and is collision-free; at s=1 the slice is the constant braid. Thus this is a braid isotopy from β⋆β‾ to e.

F1F2step 1.2step 2.1
4.1

(a), conclusion. By steps 1.1, 2.1 and 3.1 the operation of [F2] on the isotopy classes based at Q is associative, has the two-sided identity class [e], and gives [β‾][β]=[e]=[β][β‾] for every [β]; by [L4] the set Gn of isotopy classes is therefore a group with identity [e] and [β]−1=[β‾].

L4F2step 1.1step 2.1step 3.1
5.1

Assertions (a) and (b) are steps 4.1 and 1.3, the latter now applicable because step 4.1 makes Gn a group; the group structure uses only the explicit stacking, reversal and reparametrisation formulas displayed above. ∎

step 1.3step 4.1

Remarks

  • The inverse is built from time reversal together with the relabelling π(β)−1 at the top; the relabelling is necessary because braid isotopy fixes the bottom points but only the top set, so a naive time reversal of the tuple would not return the bottom labels.
  • For n=0 the set G0 has exactly one element and S0 is trivial, so both assertions are immediate; for n=1 the group G1 consists of the isotopy classes of loops in the disc D∘ based at q1=(0,0). This page does not determine G1, and no claim about it is used later.
  • No choice principle is used: the identity isotopies are the explicit reparametrisations μs,νs,λs, and the inverse is the explicit formula β‾j(t)=zπ(β)−1(j)(1−t).

Depends on

Used by

Dependency tree · two levels

28 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