Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 4 also cleared it.

Braids as Fundamental Groups of Configuration Spaces — Examples

1 · Prerequisites

2 · Summary

The worked examples track the distinction between labelled coordinates and their unordered configuration. The positive elementary half twist is traced by an explicit semicircle path: its coordinate tuple exchanges the two endpoints, while its unordered orbit is a based loop, and the traced braid is isotopic to the chosen positive generator. For two strands, the ordered loop η(t)=(−h,−h+2hexp⁡(2πit)),h=112, stays in the open disk, avoids collision, and closes at Q. Its traced braid is the positive full twist [σ1]2 with identity endpoint permutation; under the pure-braid identification on the companion page, its ordered class appears with the specified inverse.

The first counterexample shows why quotienting by labels matters: the ordered path (ρ(t),−ρ(t)) for the positive two-strand half twist starts at Q and ends at the transposed tuple, so it is not a based ordered loop, but both endpoints have the same unordered orbit. The second uses an embedded folded arc with a local maximum and minimum in height. Although its endpoint sets agree, its slice at height 1/2 contains four points rather than two; the drawing therefore does not define a path in the two-point configuration space. These calculations exhibit the endpoint and one-point-per-height conditions needed for the braid/configuration correspondence. No Axiom of Choice is used in either construction.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

A half-circle configuration loop traces an elementary half twist

Example

Fix n≥2 and an adjacent index 1≤i<n. Use the base tuple Q, spacing h, and midpoint mi of The elementary geometric half twist, its support disc, and its opposite, and identify the real disc with the complex disc as in Based motions of an unordered point configuration. Set v(t):=hexp⁡(iπ(1+t)), xj(t):={mi+v(t),j=i,mi−v(t),j=i+1,qj,j∉{i,i+1},αi(t):=[(x1(t),…,xn(t))]. Then αi is an interior based loop in Cn(int⁡D2) at [Q], and the geometric braid traced by αi is braid-isotopic to the published positive elementary half twist σi.

Facts & Assumptions

Given: n≥2, 1≤i<n, the fixed base tuple Q, and the published positive half twist σi with its midpoint mi, spacing h, support disc Ui, and lower diamond path ρ.

[L1]

The spacing is h=1/(4(n+1))>0, and the base points satisfy qi=mi−(h,0) and qi+1=mi+(h,0); the support disc Ui has radius 3h/2, lies in D∘, and contains exactly qi,qi+1 (The elementary geometric half twist, its support disc, and its opposite).

[L2]

The published positive half twist has coordinates mi+ρ(t) and mi−ρ(t) at labels i,i+1, with all other coordinates fixed, and ρ(0)=(−h,0),ρ(1/2)=(0,−h),ρ(1)=(h,0),∥ρ(t)∥2≤h,ρ(t)≠0 (The elementary geometric half twist, its support disc, and its opposite).

[L3]

For real x,y, exp⁡(x+iy)=ex(cos⁡y+isin⁡y) and ∣exp⁡(x+iy)∣=ex, while eiπ=−1 (exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0).

[L4]
[L5]

sin⁡u>0 for 0<u<π (Pi is the first positive zero of sine).

[L7]

Vector addition and scalar multiplication are continuous in a real or complex normed space (Vector addition and scalar multiplication are continuous in a normed space).

[L8]

Fn(X) is the subspace of Xn consisting of tuples with pairwise distinct coordinates (Ordered configuration spaces Fn(X)).

[L10]

A map into a subspace is continuous exactly when its composite with the inclusion into the ambient space is continuous (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).

[L11]

The orbit map pn:Fn(X)→Cn(X), x↦[x], is continuous and its fibres are coordinate-permutation orbits (Unordered configuration spaces Cn(X)).

[L12]

An interior based motion is a continuous path in Cn(int⁡D2) whose two endpoints equal [Q] (Based motions of an unordered point configuration).

[L13]

A geometric braid consists of continuous coordinate paths in D∘ that remain pairwise distinct, start at Q, and end with endpoint set Q (Geometric braids in the disc with setwise endpoints).

[L14]

Every based interior configuration loop has a unique ordered lift from Q, and its coordinate paths form its geometric braid trace (An interior configuration loop traces a geometric braid).

[L15]

A jointly continuous homotopy through based configuration loops has boundary traces that are braid-isotopic relative to their top and bottom endpoints (A based configuration-loop homotopy traces a braid isotopy).

[L16]

A path homotopy fixes both path endpoints throughout; transposing the coordinates converts between path parameter first and homotopy parameter first (Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints).

[L17]

A braid isotopy is a jointly continuous family whose every height slice is a geometric braid with bottom tuple Q and top endpoint set Q (Braid isotopy relative to the top and bottom endpoints).

Choice audit: No Axiom of Choice is assumed. Every coordinate path and the starting tuple Q are explicitly specified, and no point is selected from a nonempty product.

Verification

technique · direct
1.1L1L2L3L4L5L6

Compute the round relative path. The addition law [L4] and Euler's identity [L3] give v(0)=−h, v(1)=h, and v(t)=−hexp⁡(iπt). For 0<t<1, [L3] and [L5] give Im⁡v(t)=−hsin⁡(πt)<0, since h>0 and 0<πt<π; the modulus formula gives ∣v(t)∣=h. By [L6], v is continuous. The piecewise formula [L2] gives Im⁡ρ(t)=−2th<0 for 0<t≤1/2 and Im⁡ρ(t)=2h(t−1)<0 for 1/2≤t<1.

1.2L1L3L6L7L8L9L10L11L12

Check the unordered loop. The coordinates xj(t) are continuous by [L6], [L7], and [L9]. Their moving pair is distinct because ∣v(t)∣=h>0 by [L1] and [L3]. Each moving point is at distance h from mi, so lies in Ui⊂D∘; every fixed qj lies in D∘ and, for j∉{i,i+1}, outside Ui by [L1]. The tuple therefore lies in Fn(D∘) by [L8], and [L10] makes it continuous into that subspace. Its orbit is continuous by [L11]. Since v(0)=−h and v(1)=h, the ordered tuple starts at Q and ends with qi,qi+1 exchanged; both orbit endpoints are [Q]. Thus αi is an interior based loop by [L12].

2.1L1L2L3L6L7L8L9L10L13L17step 1.1step 1.2

Interpolate in the lower half-plane. Set ws(t):=(1−s)ρ(t)+sv(t) for s,t∈I. This is jointly continuous by [L6], [L7], and [L9]. For 0<t<1, both imaginary parts are strictly negative by step 1.1, so ws(t)≠0; at t=0,1 the common values are −h,+h, also nonzero. The triangle inequality and [L2], [L3] give ∣ws(t)∣≤(1−s)∣ρ(t)∣+s∣v(t)∣≤h<3h/2. The tuple with coordinates xs,i(t)=mi+ws(t), xs,i+1(t)=mi−ws(t), and xs,j(t)=qj for the other labels stays collision-free and interior: the moving pair is distinct and stays in Ui, while all fixed points remain outside Ui by [L1]. Its coordinate maps are continuous, and [L8]–[L10] give a continuous family in the ordered configuration subspace. Each slice is a geometric braid by [L13], and the family is a braid isotopy by [L17], since its bottom tuple is Q and its top set is Q for every s. At s=0 the braid is σi; at s=1 it is the round tuple of step 1.2.

3.1L8L9L10L11L12L14L15L16step 1.2step 2.1∎

Identify the exact traces. The ordered family in step 2.1 is continuous into Fn(D∘) by [L8]–[L10], so its quotient H(s,t):=[(xs,1(t),…,xs,n(t))] is jointly continuous by [L11]. Its endpoints satisfy H(s,0)=H(s,1)=[Q] for every s, and every slice is an interior based motion by [L12]. The transpose (t,u)↦H(u,t) is a path homotopy rel endpoints under [L16]. Thus [L15] makes the traces of the two boundary loops braid-isotopic. By [L14], those traces are exactly σi and the round tuple; the latter is the trace of αi by step 1.2. This proves the example.

ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

A pure two-strand full twist as an ordered loop

Example

For n=2 with Q=(−h,h), the ordered path η(t)=(−h,−h+2hexp⁡(2πit)) stays collision-free in the open disk and closes at Q. Its traced geometric braid is the positive full twist [σ1]2 and has identity endpoint permutation.

Facts & Assumptions

Given: n=2, the published base tuple Q, spacing h, positive elementary half twist σ1, and its diamond relative path ρ.

[L1]

For n=2, h=1/(4(2+1))=1/12, Q=(−h,h), the midpoint is 0, and (σ1)1=ρ, (σ1)2=−ρ. The path ρ is continuous, has endpoints −h,+h, never vanishes, and satisfies ∣ρ(t)∣≤h. The positive convention is the published anticlockwise half twist (The elementary geometric half twist, its support disc, and its opposite, Geometric braids in the disc with setwise endpoints).

[L2]

The complex exponential is continuous, exp⁡(iθ)=cos⁡θ+isin⁡θ and ∣exp⁡(iθ)∣=1 for real θ, and exp⁡(iπ)=−1; also exp⁡(z+w)=exp⁡zexp⁡w (The complex exponential is entire and its complex derivative is itself, Complex differentiability at a point implies continuity there, exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0, exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential).

[L3]

Complex modulus is definite and satisfies ∣z+w∣≤∣z∣+∣w∣; complex addition and scalar multiplication are continuous (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive, Vector addition and scalar multiplication are continuous in a normed space).

[L4]

On [0,π] cosine decreases through 0 at π/2 and sine is nonnegative; on [π,2π] cosine increases through 0 at 3π/2 and sine is nonpositive by its π-shift. Thus exp⁡(2πit) lies in the corresponding closed quadrant for t∈[0,1/4], [1/4,1/2], [1/2,3/4], and [3/4,1] (Signs, monotonicity intervals, and ranges of sine and cosine, Quarter-turn values and shifts by pi/2 and pi, Pi is the first positive zero of sine).

[L6]

The orbit map p2:F2(X)→C2(X) is continuous, and an interior based motion is a continuous path with both endpoints [Q] (Unordered configuration spaces Cn(X), Based motions of an unordered point configuration).

[L7]

Every interior based configuration loop at [Q] has a unique ordered lift from Q, whose coordinate graphs are its geometric braid trace (An interior configuration loop traces a geometric braid).

[L8]

A geometric braid starts at the labelled tuple Q, remains collision-free in the open disk, and is pure when every labelled endpoint returns to its starting point (Geometric braids in the disc with setwise endpoints).

[L9]

In γ⋆β, the first half runs β and the second half runs γ with labels permuted by the lower braid, and the induced class product is [γ][β]=[γ⋆β] (Stacking of geometric braids is a well-defined associative operation on isotopy classes).

[L10]

The isotopy classes of geometric braids based at Q form a group with the stacking product (The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism).

[L11]

A braid isotopy is a jointly continuous family of braids with bottom tuple Q and top endpoint set Q at every isotopy parameter (Braid isotopy relative to the top and bottom endpoints); piecewise continuous maps on two closed sets covering the square paste continuously (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous).

[L12]

For a pure geometric braid with coordinate loop zβ at Q, the pure-braid isomorphism is Ψ([β])=(ι∗F[zβ])−1 (Pure geometric braids and ordered configuration loops).

The formulae below specify every path and homotopy. No lift, representative, or point of a nonempty set is chosen, so the Axiom of Choice is not used.

Proof

technique · direct
1.1L1L2L3L5

Put ω(t):=exp⁡(2πit). By [L2], ω is continuous and ∣ω(t)∣=1. Since exp⁡(iπ)=−1 and the exponential addition law gives exp⁡(2πi)=exp⁡(iπ)2=1, one has ω(0)=ω(1)=1. Hence η(t)=(−h,−h+2hω(t)) starts and ends at Q. Its coordinate difference is 2hω(t)≠0, and ∣−h+2hω(t)∣≤h+2h=3h=14<1, while ∣−h∣=h<1. Thus its values are ordered configurations in F2(int⁡D2); coordinate continuity and [L5] show that η is a continuous ordered loop at Q.

1.2L6L7L8

Let α(t):=p2(η(t)). By [L6], this is a continuous interior based loop at [Q]. Its unique lift from Q is η itself, so [L7] identifies its trace with the coordinate braid βη(t)=(−h,−h+2hω(t)). Because both coordinates of η return to their starting values, [L8] shows βη is pure and its endpoint permutation is the identity.

1.3L1L2L4L9

Use the stacking formula [L9] on two copies of σ1. Since the endpoint permutation of the lower copy exchanges labels 1 and 2, the stacked coordinate pair is (ρ(2t),−ρ(2t))(0≤t≤12),(−ρ(2t−1),ρ(2t−1))(12≤t≤1). Its centre is 0 and its second-minus-first coordinate is D0(t)={−2ρ(2t),0≤t≤12,2ρ(2t−1),12≤t≤1. Substitution of the two branches of ρ from [L1] shows that D0(t) lies successively in the first, second, third, and fourth closed quadrants on the four quarter intervals. It never vanishes, and ∣D0(t)∣≤2h by [L1]. By [L2] and [L4], D1(t):=2hω(t) lies in the same respective closed quadrant, never vanishes, and has modulus 2h.

2.1L1L2L3L9L11step 1.3

For s,t∈I set Ds(t):=(1−s)D0(t)+sD1(t),H1(s,t):=(−Ds(t)/2,Ds(t)/2). Each closed quadrant is convex and contains no pair of opposite nonzero vectors, so Ds(t)≠0 for every (s,t). By [L3], ∣Ds(t)∣≤(1−s)∣D0(t)∣+s∣D1(t)∣≤2h, so both coordinates of H1 have modulus at most h<1. The formulas and [L2], [L3], [L9] give joint continuity. Both D0 and D1 equal 2h at t=0,1, so H1(s,0)=H1(s,1)=Q for every s. Thus [L11] makes H1 a braid isotopy from the stacked diamond braid to the centred round pair βround(t)=(−hω(t),hω(t)).

2.2L1L2L3L11step 1.1

Put Cs(t):=s(−h+hω(t)) and define H2(s,t):=(Cs(t)−hω(t),Cs(t)+hω(t)). The coordinate difference is 2hω(t)≠0, and [L3] gives ∣Cs(t)±hω(t)∣≤∣Cs(t)∣+h≤2h+h=3h<1. Both coordinates are therefore in the open disk and distinct at every height. The formula is jointly continuous by [L2], [L3]. Since Cs(0)=Cs(1)=0 and ω(0)=ω(1)=1, the endpoints are Q for every s. Thus [L11] makes H2 a braid isotopy from βround to βη.

3.1L9L10L11step 1.2step 2.1step 2.2

The families H1 and H2 agree at their common braid βround. Pasting H1(2s,t) for s≤1/2 to H2(2s−1,t) for s≥1/2 gives a jointly continuous family by [L11]. Each slice is a braid and its endpoints remain Q, so this is a braid isotopy from σ1⋆σ1 to βη. By [L9] and [L10], [βη]=[σ1⋆σ1]=[σ1]2. Together with step 1.2, this proves that the trace of the stated ordered loop is the positive full twist and has identity endpoint permutation.

4.1

Since βη is pure by step 1.2, the exact ordered representative of its class under the pure-braid isomorphism [L12] is Ψ([βη])=(ι∗F[η])−1∈PB2. Thus the displayed collision-free ordered loop records this positive full twist under the common basepoint convention, including the inverse in the published identification. [L12, step 1.2, step 3.1] □

CounterexampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

An exchange closes only after forgetting labels

Statement refuted

A based loop in the unordered configuration space can occur only when its ordered coordinate path also returns to the same ordered tuple.

Facts & Assumptions

Given: Take n=2, h=1/12, q1=(−h,0), q2=(h,0), and Q=(q1,q2). Consider the published positive elementary half twist σ1.

[L1]

The ordered configuration space F2(D∘) consists of ordered pairs with distinct coordinates (Ordered configuration spaces Fn(X)).

[L2]

The unordered quotient sends an ordered tuple to its coordinate-permutation orbit; in particular (q2,q1) and (q1,q2) have the same image (Unordered configuration spaces Cn(X)).

[L3]

The quotient projection p2:F2(D∘)→C2(D∘) is continuous (Unordered configuration spaces Cn(X)).

[L4]

For n=2, the published positive half twist has midpoint m1=0 and coordinates (σ1)1(t)=ρ(t) and (σ1)2(t)=−ρ(t); ρ is continuous, nonzero, has endpoints (−h,0) and (h,0), and has norm at most h (The elementary geometric half twist, its support disc, and its opposite).

[L5]

The positive elementary half twist is a geometric braid based at Q (The elementary geometric half twist, its support disc, and its opposite).

[L6]

The slice path of a geometric braid is defined by S(β)(t)=[(z1(t),…,zn(t))] (A geometric braid slices to an interior configuration loop).

[L7]

A based loop at x0 is a path whose two endpoints both equal x0 (Based loops and the fundamental group).

The coordinates and endpoint exchange are explicit; no choice principle is assumed or used.

Counterexample

technique · direct
1.1L1L4

Track the ordered pair. The midpoint of q1 and q2 is 0, so the published half-twist formula in [L4] gives the ordered path σ~1(t)=(ρ(t),−ρ(t)). Its coordinates lie in D∘ because ∥ρ(t)∥≤h<1, and they are distinct because their difference is 2ρ(t)≠0. Thus this is a path in F2(D∘), with endpoints σ~1(0)=(q1,q2)=Q,σ~1(1)=(q2,q1).

2.1step 1.1L7

Since q1≠q2, the terminal ordered tuple (q2,q1) is not Q. By [L7], σ~1 is a path in the ordered configuration space but is not a based loop at Q.

2.2step 1.1L2L3L5L6L7

Forget the labels. By [L2], the endpoint tuples have the same orbit: [(q1,q2)]=[(q2,q1)]=[Q]. By [L3], the quotient projection is continuous, so α(t):=[σ~1(t)] is a continuous path in C2(D∘) with α(0)=α(1)=[Q]. By [L5, L6], this is the slice path S(σ1) of the positive geometric half twist, so it is the unordered based loop promised by the counterexample.

3.1step 2.1step 2.2∎

The ordered coordinate path fails to close at Q, while its unordered image closes at [Q]. Hence forgetting labels can close a nonlooping ordered coordinate path, refuting the claim in the statement.

CounterexampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

An embedded height-folded arc has no configuration-loop slices

Statement refuted

Every embedded two-strand arc picture in D∘×I with the same endpoint set {q1,q2} at heights 0 and 1 determines a two-point configuration at every intermediate height by horizontal slicing.

Facts & Assumptions

Given: In the geometric-braid convention, take n=2, so h=1/12, q1=(−h,0), q2=(h,0), and the base tuple is Q=(q1,q2).

[L1]

For n=2 the published geometric base points are q1=(−h,0) and q2=(h,0), both in the interior unit disk (Geometric braids in the disc with setwise endpoints).

[L2]

Each element of C2(D∘) is an unordered configuration of exactly two distinct points (Unordered configuration spaces Cn(X)).

[L3]

A geometric braid strand is a graph over the height parameter and meets each height plane exactly once (Geometric braids in the disc with setwise endpoints).

[L4]

The slicing lemma applies to level-preserving geometric braids and gives a configuration-loop slice from their coordinate motions (A geometric braid slices to an interior configuration loop).

No choice principle is assumed or used; the witness consists of explicit points and line segments.

Counterexample

technique · direct
1.1L1given

Construct the folded arc and vertical strand. Let a=h/4. In R2×I, define P0=(−h,0,0),P1=(−h+a,0,3/4),P2=(−h+2a,a,1/4),P3=(−h,0,1). Let A be the polygonal path P0P1∪P1P2∪P2P3, and let B={(h,0,t):t∈I}. The endpoint sets of A∪B at heights 0 and 1 are both {q1,q2}. The height of A has a local maximum 3/4 at P1 and a local minimum 1/4 at P2, so A is not height-monotone.

2.1step 1.1L1L3algebra

Verify that these are disjoint embedded arcs in the cylinder. The segment P0P1 has spatial coordinate y=0, while P1P2 has y>0 except at P1 and P2P3 has y>0 except at P3. The only possible intersection of P0P1 and P2P3 at y=0 would be P3, whose height is 1 while P0P1 has height at most 3/4, so those segments are disjoint. Along P1P2 the spatial coordinates satisfy x+h−y=a; along P2P3 they satisfy x+h=2y. A common point must therefore have y=a, which occurs on both segments only at P2. Thus the three segments form an embedded arc. Its spatial points lie in the convex ball of radius 5a about q1, since that ball contains all four vertices. As 5a<3a=3h/4<2h=∣q2−q1∣, the arc misses B. Also ∣q1∣+5a<h+3a=7h/4=7/48<1, so A lies in D∘×I; B lies there because ∣q2∣=h<1.

3.1step 1.1step 2.1L2algebra

Compute the slice at height 1/2. The height coordinate is strictly monotone on each segment of A, so each segment meets that plane once. Linear interpolation gives the three spatial points (−h+2a/3,0),(−h+3a/2,a/2),(−h+4a/3,2a/3). The first has y=0 and the other two have different positive y coordinates; their x coordinates are also different, so these three points are distinct. The strand B contributes the fourth point (h,0)=q2, which is not on A by step 2.1. The slice therefore contains four distinct points.

4.1step 3.1L2L3L4∎

By [L2], a value of C2(D∘) must have exactly two points, whereas the horizontal slice at 1/2 has four. Hence this embedded picture does not define a path I→C2(D∘) by slicing, despite having the same endpoint set {q1,q2} at heights 0 and 1. Its folded arc also fails the one-point-per-height condition in [L3], so the level-preserving braid slicing lemma [L4] does not apply.

Sources