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.

✓ 9 results · all verified · 9 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 9 also cleared it.

Braids as Fundamental Groups of Configuration Spaces

1 · Prerequisites

2 · Summary

This page identifies geometric braids, defined as level-preserving motions of the fixed base tuple Q=(q1,…,qn) in the open unit disk, with loops in the unordered configuration space. A based unordered motion is a continuous path in Cn(D2) beginning and ending at [Q]; it is interior when every slice lies in Cn(int⁡D2). The established radial homotopy identifies the open- and closed-disk configuration groups at this same basepoint, without claiming that each closed-disk path stays in the interior.

Lifting an interior motion uniquely from the specified ordered tuple Q produces its labelled strands and a geometric braid. Conversely, taking the unordered configuration at each braid height gives a continuous based loop. These operations descend to mutually inverse correspondences on homotopy and isotopy classes. The endpoint of the ordered lift is a permutation of Q; only identity-permutation motions lift to ordered loops at Q.

The product conventions determine the group map. Stacking γ above β runs β first, while the page's fundamental-group product is first loop followed by second loop. Raw slicing therefore reverses products: it is an anti-isomorphism. The inverse-loop map [β]⟼(ι∗C[S(β)])−1, where S(β) is the slice loop and ιC includes the open-disk configuration space into the closed-disk one, is the resulting group isomorphism Gn≅Bnconf at [Q]. The pure subgroup is the kernel of endpoint permutation and identifies with the ordered configuration group by [β]⟼(ι∗F[zβ])−1, where zβ is the ordered coordinate loop of a pure braid. The covering monodromy of the raw slice loop is the inverse endpoint permutation; after applying the inverse-loop isomorphism, its monodromy equals the geometric endpoint permutation. In that formula, πconf is applied only after ι∗C has carried the loop class to the closed-disk group.

All maps use the displayed common basepoint. An identification based at a different configuration would require a specified connecting path, and no Artin-presentation completeness result is asserted here. The arguments use no Axiom of Choice: the base tuple, lifts from the fixed point, and class maps are specified, and no arbitrary ordering or basepoint path is selected.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Based motions of an unordered point configuration

Definition

Fix n∈N and let Q=(q1,…,qn) be the explicit base tuple fixed in Geometric braids in the disc with setwise endpoints. Identify its real closed unit disk with the complex closed unit disk D2 by (x,y)↦x+iy, so Q∈Fn(int⁡D2) and its orbit [Q]∈Cn(D2) is defined by Ordered configuration spaces Fn(X) and Unordered configuration spaces Cn(X).

An unordered configuration motion is a continuous map α:I⟶Cn(D2). It is a based motion at Q if α(0)=[Q]=α(1), and it is an interior based motion if, in addition, α(t)∈Cn(int⁡D2)for every t∈I. Every slice is a collision-free n-point set because it is an element of the unordered configuration space; continuity is with respect to its quotient topology. With the base configuration in The configuration braid group Bnconf as the fundamental group of an unordered configuration space chosen to be this same Q, the based-loop classes of all such closed-disc motions form Bnconf=π1(Cn(D2),[Q]).

Let ι:Cn(int⁡D2)↪Cn(D2) be the inclusion. The published radial homotopy in The interior-disc and closed-disc configuration spaces are homotopy equivalent shows that ι∗ is an isomorphism at the same basepoint [Q]. Thus every class in Bnconf has an interior based-motion representative, and two interior motions represent the same closed-disc class exactly when they are path-homotopic through interior based motions. This transfers classes between the two disc models; it does not assert that every closed-disc motion itself stays in the interior.

For n=0, both configuration spaces are one-point spaces and there is one based motion. For n=1, C1(X) is canonically homeomorphic to X and the geometric basepoint is q1=0, so the same definitions apply without any collision condition. No choice principle is used: the base tuple is the fixed one from the geometric-braid definition, and the quotient and inclusion maps are specified maps.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

An interior configuration loop traces a geometric braid

Statement

For every interior based motion α:I→Cn(int⁡D2) at [Q], the quotient covering p∘:Fn(int⁡D2)⟶Cn(int⁡D2) has a unique lift α~ starting at Q. Writing α~(t)=(z1(t),…,zn(t)), the coordinate graphs form a geometric braid based at Q, and its unordered slice at every height is exactly α(t).

Facts & Assumptions

Given: A natural number n, the geometric base tuple Q, and an interior based motion α at [Q].

[L1]

Fn(X) is the subspace of Xn consisting of tuples with pairwise distinct coordinates, and F0(X) is the one-point space (Ordered configuration spaces Fn(X)).

[L2]

Cn(X) is the orbit quotient of Fn(X) by coordinate permutations; its quotient map p is continuous and surjective, and its fibres are exactly the coordinate-permutation orbits (Unordered configuration spaces Cn(X)).

[L4]

If X is Hausdorff, then every point of Cn(X) has an evenly covered neighbourhood under p:Fn(X)→Cn(X); for n=0, p is the unique homeomorphism of one-point spaces (Disjoint coordinate neighbourhoods evenly cover the unordered configuration space).

[L5]

For a covering p:E→B and path α:I→B with a specified starting lift e0, there is a unique path α~ starting at e0 and satisfying p∘α~=α (Existence and uniqueness of path lifts through a covering map).

[L6]

A geometric braid based at Q is a tuple of continuous point motions in D∘ with pairwise distinct values at every height, bottom tuple Q, and top endpoint set Q (Geometric braids in the disc with setwise endpoints).

[L7]

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

No choice principle is assumed or used: the lift is determined by one prescribed starting tuple and is unique.

Proof

technique · direct
1.1L2L3L4

The quotient is a covering on the open disk. By [L3], int⁡D2 is Hausdorff; applying [L4] with X=int⁡D2 gives an evenly covered neighbourhood at every unordered configuration, and continuity and surjectivity from [L2] show that p∘ is a covering. For n=0 both spaces are points, so this conclusion still holds.

1.2L1L2L5L7

Lift the motion. Since α is based at [Q] by [L7] and p∘(Q)=[Q], [L5] gives a unique continuous lift α~:I→Fn(int⁡D2) with α~(0)=Q and p∘∘α~=α; write its coordinates as z1,…,zn, taking the empty tuple when n=0.

1.3L1L2L6L7

Check the strand conditions. By [L1], the coordinate projections of α~ are continuous; because every lifted tuple lies in Fn(int⁡D2), the coordinates remain interior and pairwise distinct, and they start at Q. At the top, p∘(α~(1))=α(1)=[Q], so [L2] places the terminal tuple in the coordinate-permutation orbit of Q, giving endpoint set exactly {q1,…,qn}; these conditions are vacuous for n=0.

1.4L2L5L6

The lift is the required braid and traces the original motion. By [L6], β=(z1,…,zn) is a geometric braid based at Q: its strands are the graphs t↦(zj(t),t), so height is their parameter and distinct strands cannot meet. Its unordered slice is [(z1(t),…,zn(t))]=p∘(α~(t))=α(t) for every t, by [L5]; this also holds for the unique empty braid when n=0.

2.1step 1.2step 1.3step 1.4∎

The unique lift has all the endpoint, collision, continuity and slicing properties required in the statement, establishing the claim.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

A based configuration-loop homotopy traces a braid isotopy

Statement

Let H:Is×It→Cn(int⁡D2) be a continuous homotopy of based loops at [Q], written with the homotopy parameter s first and height t second. Thus H(s,0)=H(s,1)=[Q](s∈I), and the boundary loops are α(t):=H(0,t) and β(t):=H(1,t). The unique ordered lifts of α and β starting at Q trace geometric braids that are braid-isotopic relative to their top and bottom endpoints.

Facts & Assumptions

Given: n∈N; a continuous map H:Is×It→Cn(int⁡D2) satisfying the displayed based-loop endpoint conditions; and its boundary loops α=H(0,−) and β=H(1,−).

[L1]

The quotient map p∘:Fn(int⁡D2)→Cn(int⁡D2) is a covering, and every based interior configuration loop at [Q] has a unique lift from Q whose coordinate graphs form its geometric braid (An interior configuration loop traces a geometric braid).

[L2]

A path homotopy relative to its endpoints is a jointly continuous map on the product square fixing the two endpoints throughout; switching the two coordinates writes the homotopy parameter first and the path parameter second (Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints).

[L3]

If p:E→B is a covering, a homotopy G:Y×I→B and a lift of G(−,0) are given, then there is a unique continuous lift of G extending that initial lift (Existence and uniqueness of homotopy lifts through a covering map).

[L4]

Fn(X) is a subspace of the product Xn with its product topology (Ordered configuration spaces Fn(X)).

[L6]

A braid isotopy has jointly continuous coordinate maps and requires the bottom tuple pointwise fixed and the top endpoint set of every slice equal to Q (Braid isotopy relative to the top and bottom endpoints).

[L7]

Since each labelled top endpoint lies in the finite discrete set Q, joint continuity makes that endpoint constant throughout the isotopy (Braid isotopy relative to the top and bottom endpoints).

No arbitrary lift is chosen: the initial lift along t=0 is the specified constant map s↦Q, and the homotopy lift is unique.

Proof

technique · direct
1.1L1L2

Specify the initial lift. By [L1], p∘ is a covering. The constant map H~0:Is→Fn(int⁡D2), H~0(s)=Q, is continuous and lifts the edge H(s,0)=[Q] because p∘(Q)=[Q].

2.1step 1.1L3

Lift the full square. Apply [L3] to G=H with Y=Is, height coordinate t, and initial lift from step 1.1. There is a unique jointly continuous lift H~:Is×It→Fn(int⁡D2) with p∘∘H~=H and H~(s,0)=Q.

3.1step 2.1L1L2

Each lifted height path is the braid trace. Fix s∈I. By step 2.1, t↦H~(s,t) lifts the based loop H(s,−) from Q. Uniqueness in [L1] identifies it with the lift whose coordinate graphs form the geometric braid traced by that loop. Its terminal tuple projects to H(s,1)=[Q], so its endpoint set is Q. This includes n=1, where there are no pairwise-collision conditions.

3.2step 2.1L1L2

Identify the two boundary braids. By step 2.1, H~(0,−) lifts α from Q and H~(1,−) lifts β from Q. Uniqueness in [L1] identifies these restrictions with the traces of the two boundary loops, so they are the exact braids at the ends of the claimed isotopy.

4.1step 2.1step 3.1L4L5L6L7

The lifted coordinates give a braid isotopy. Define Zj(s,t) to be the jth coordinate of H~(s,t) under the fixed real-complex identification. The lift in step 2.1 is jointly continuous into Fn(int⁡D2)⊆(int⁡D2)n; the coordinate projections are continuous by [L4, L5]. Thus each Zj is jointly continuous. By step 3.1, every slice is a geometric braid with bottom Q and top endpoint set Q. It therefore meets the braid-isotopy conditions [L6]. By [L7], joint continuity also keeps each labelled top endpoint fixed during the isotopy. For n=0, both configuration spaces are points and this is the unique empty braid isotopy.

5.1step 3.2step 4.1∎

The jointly continuous lifted family has the prescribed boundary braids from step 3.2 and satisfies every braid-isotopy condition by step 4.1.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

A geometric braid slices to an interior configuration loop

Statement

For a geometric braid β=(z1,…,zn) based at Q, let S(β)(t):=[(z1(t),…,zn(t))], where the real-disc coordinates are identified with complex coordinates as in Based motions of an unordered point configuration. Then S(β) is a continuous based loop in Cn(int⁡D2). This slicing uses the given level parameter and the given labelled point motions; at height t its value is exactly the unordered configuration cut out by the braid at that height.

Facts & Assumptions

Given: n∈N and a geometric braid β=(z1,…,zn) based at the fixed tuple Q.

[L1]

The ordered configuration space Fn(X) has the subspace topology from the product Xn with its product topology; for n=0 it is the one-point empty tuple (Ordered configuration spaces Fn(X)).

[L2]

Each zj:I→D∘ is continuous (Geometric braids in the disc with setwise endpoints).

[L3]

At every height the coordinates are pairwise distinct (Geometric braids in the disc with setwise endpoints).

[L4]

Each point motion starts at the corresponding qj (Geometric braids in the disc with setwise endpoints).

[L5]

The set of the terminal points is Q (Geometric braids in the disc with setwise endpoints).

[L6]

The fixed real-complex identification takes D∘ to int⁡D2 (Based motions of an unordered point configuration).

[L7]

The canonical map pn:Fn(X)→Cn(X), x↦[x], is continuous and sends a tuple to its coordinate-permutation orbit (Unordered configuration spaces Cn(X)).

[L8]
[L9]

The jth strand is the graph t↦(zj(t),t) and its second coordinate is its height (Geometric braids in the disc with setwise endpoints).

The coordinate functions determine one tuple-valued map at each height; no choice of ordering or lift is made.

Proof

technique · direct
1.1L1L2L3L4L6L8

The ordered tuple varies continuously. Apply the fixed real-complex identification from [L6] to each coordinate zj. By [L2], each resulting coordinate map I→int⁡D2 is continuous. The product topology on (int⁡D2)n is the topology for which continuity into the product is checked coordinatewise [L8], so z:I→(int⁡D2)n,z(t)=(z1(t),…,zn(t)) is continuous. Pairwise distinctness in [L3] places its image in Fn(int⁡D2); because that space has the subspace topology, the same map, with this restricted codomain, is continuous ([L1]). For n=0 this is the constant map to the one-point empty tuple.

1.2

Pass to the unordered quotient. By [L7], pn is continuous, so S(β)=pn∘z:I→Cn(int⁡D2) is continuous. At the bottom, z(0)=Q by [L4], so S(β)(0)=[Q]. At the top, the set of the coordinates of z(1) is Q by [L5], hence z(1) is a coordinate permutation of Q and pn(z(1))=[Q] by the orbit description in [L7]. Thus S(β)(1)=[Q], as required for a based loop ([L4, L5, L7]).

1.3L3L5L7L9

Identify each height slice. The graph of the jth coordinate is t↦(zj(t),t) by [L9], so its intersection with height t returns the point zj(t). Taking all labels, their unordered orbit is exactly pn(z(t))=S(β)(t). The labels are retained in z and then forgotten precisely by the quotient, with no reparametrization of height. For n=0 the slice and loop are the unique empty configuration.

2.1step 1.1step 1.2step 1.3∎

The sliced path is continuous, has both endpoint values [Q], and at each height equals the unordered slice of the given level-preserving braid.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Tracing and slicing are inverse on relative classes

Statement

Fix n∈N and the geometric base tuple Q. Tracing based interior configuration loops and slicing geometric braids induce mutually inverse bijections between based path-homotopy classes in Cn(int⁡D2) at [Q] and geometric braid-isotopy classes of braids based at Q.

Facts & Assumptions

Given: n∈N, the fixed tuple Q, an interior based configuration loop α at [Q], and a geometric braid β=(z1,…,zn) based at Q.

[L1]

Every interior based configuration loop at [Q] has a unique ordered lift starting at Q; its coordinate graphs form a geometric braid whose unordered slice at every height is the original loop (An interior configuration loop traces a geometric braid).

[L2]

If two based interior configuration loops are path-homotopic relative to their endpoints, their traced braids are braid-isotopic relative to the top and bottom endpoints (A based configuration-loop homotopy traces a braid isotopy).

[L3]

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

[L4]

In a braid isotopy, every coordinate map Zj(s,t) is jointly continuous in the isotopy parameter s and height t (Braid isotopy relative to the top and bottom endpoints).

[L5]

A based loop class is taken modulo path homotopy relative to the endpoints (Based loops and the fundamental group).

[L6]

A path homotopy is a jointly continuous map on the product square that fixes both endpoints throughout; its first coordinate is the path parameter and its second is the homotopy parameter (Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints).

[L8]

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

[L9]

The unordered configuration space consists of the coordinate-permutation orbits of ordered configurations (Unordered configuration spaces Cn(X)).

[L10]

The fixed identification (x,y)↦x+iy sends the real open disk D∘ to int⁡D2 (Based motions of an unordered point configuration).

[L11]

A geometric braid is a tuple of continuous motions in D∘ that are pairwise distinct at every height, start at Q, and have terminal point set Q (Geometric braids in the disc with setwise endpoints).

[L12]

Every s-slice of a braid isotopy is a geometric braid based at Q, with bottom tuple Q and top endpoint set Q (Braid isotopy relative to the top and bottom endpoints).

[L13]

The boundary slices of a braid isotopy are its two endpoint braids (Braid isotopy relative to the top and bottom endpoints).

[L14]

For n=0, F0(X) and C0(X) are one-point spaces; for n=1, F1(X) and C1(X) are canonically homeomorphic to X (Ordered configuration spaces Fn(X), Unordered configuration spaces Cn(X)).

[L15]

The canonical projection pn:Fn(X)→Cn(X) is continuous (Unordered configuration spaces Cn(X)).

The trace uses the unique lift from the specified Q; the slice uses the given labelled coordinate tuple. No arbitrary ordering or choice is used.

Proof

technique · direct
1.1L1L2L5L6

Trace is well-defined on path classes. Define T([α]) to be the braid-isotopy class of the braid traced by the unique lift of α from Q, which exists by [L1]. If α and α′ represent the same based path-homotopy class by [L5, L6], then [L2] makes their traced braids braid-isotopic. Thus T is independent of the representative.

1.2L3L4L6L7L8L9L10L11L12L13L15

Slice is well-defined on braid-isotopy classes. Suppose Z is a braid isotopy from β to β′. Apply the real-complex identification [L10] to its coordinates. By joint continuity in [L4] and the product criterion [L7], the tuple map z:Is×It→(int⁡D2)n,z(s,t)=(Z1(s,t),…,Zn(s,t)) is continuous. Each slice is collision-free by [L11, L12], so its image lies in Fn(int⁡D2); the subspace topology [L8] makes the restricted map continuous. Composing with the continuous orbit projection [L15] gives H(s,t):=pn(z(s,t))∈Cn(int⁡D2). The fixed bottom tuple gives H(s,0)=[Q] for every s, and the setwise top condition gives H(s,1)=[Q] for every s, by [L12] and the orbit description [L9]. At s=0 and s=1, H is respectively the slice of β and of β′ by [L3, L13]. The switch (t,u)↦(u,t) is continuous by the product-topology criterion [L7], so K(t,u):=H(u,t) is jointly continuous and is a path homotopy relative to its endpoints by [L6]. Therefore the slice classes agree, and slicing descends to braid-isotopy classes.

1.3L1

Slice after trace is the original loop. For any [α], the trace lemma says that the unordered slice of the traced braid equals α(t) at every t [L1]. Thus S(T([α]))=[α] in the based path-homotopy class set.

1.4L1L3L7L8L10L11

Trace after slice is the original braid. By [L11], the ordered coordinate path t↦(z1(t),…,zn(t)) is a continuous path in Fn(int⁡D2) starting at Q, using [L7, L8, L10]. Its projection is S(β) by [L3]. It is therefore an ordered lift of S(β) from Q; uniqueness in [L1] makes the traced braid exactly β, so T(S([β]))=[β] as a braid-isotopy class.

2.1step 1.1step 1.2step 1.3step 1.4L14∎

The two well-defined assignments satisfy both inverse identities by steps 1.3 and 1.4. Consequently tracing and slicing induce mutually inverse bijections on the stated classes. For n=0 both configuration spaces and class sets are singletons; for n=1 the configuration spaces identify with the disk and there are no collision conditions, so the same constructions apply [L14].

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Raw slicing reverses geometric stacking products

Statement

For geometric braids β and γ, let γ⋆β mean that β is stacked below γ. With the library's first-loop-then-second product in π1(Cn(int⁡D2),[Q]), raw slicing reverses the stacking order: [S(γ⋆β)]=[S(β)][S(γ)].

Facts & Assumptions

Given: n∈N and geometric braids β=(z1,…,zn) and γ=(w1,…,wn) based at Q.

[L1]

The stacked braid has coordinate formula (γ⋆β)j(t)={zj(2t),t≤12,wπ(β)(j)(2t−1),t≥12, where π(β) is the endpoint permutation of β (Stacking of geometric braids is a well-defined associative operation on isotopy classes).

[L2]

For a braid δ=(u1,…,un), its slice is S(δ)(t)=[(u1(t),…,un(t))] and is a continuous based loop at [Q] in Cn(int⁡D2) (A geometric braid slices to an interior configuration loop).

[L3]

The product of loop classes is [α][η]=[α∗η], where α is traversed first on [0,12] and η second on [12,1] (Based loops and the fundamental group).

[L4]

The points of Cn(X) are coordinate-permutation orbits, so a tuple and any reordering of its coordinates have the same image (Unordered configuration spaces Cn(X)).

[L5]

For every pointed space, this loop-class product is well-defined and makes π1 a group (Loop classes form the group π1(X,x0) under concatenation).

No Axiom of Choice is assumed or used: the stacking formula uses the specified endpoint permutation, and the unordered quotient forgets that finite reordering.

Proof

technique · direct
1.1L1L2L3

The lower half is the first slice loop. For 0≤t≤12, [L1] gives S(γ⋆β)(t)=[(z1(2t),…,zn(2t))]=S(β)(2t), which is the first half of the concatenation S(β)∗S(γ) by [L3].

1.2L1L2L3L4

The upper half is the second slice loop. For 12≤t≤1, [L1] gives the ordered tuple (wπ(β)(1)(2t−1),…,wπ(β)(n)(2t−1)). Since π(β) is a permutation, this is a reordering of the coordinates of γ at height 2t−1; [L4] therefore gives S(γ⋆β)(t)=S(γ)(2t−1), the second half of S(β)∗S(γ).

2.1step 1.1step 1.2L1L2L3

The piecewise paths agree at the seam. At t=12, the first half has value S(β)(1)=[Q] and the second has value S(γ)(0)=[Q] by [L2]. The stacked slice is also this same orbit by [L1]. Thus the two formulas establish the pointwise identity of based loops S(γ⋆β)=S(β)∗S(γ) on all of I, including the shared endpoint of the two closed halves.

3.1step 2.1L3L5∎

Taking path-homotopy classes of this equality and using the product convention [L3] gives [S(γ⋆β)]=[S(β)][S(γ)] in the group π1(Cn(int⁡D2),[Q]) of [L5]. For n=0 all loops are the unique empty loop and the identity holds; for n=1, π(β) is the identity and the same two-half calculation applies without collision conditions.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Geometric braid classes and the unordered configuration fundamental group

Statement

Fix n∈N and the explicit geometric base tuple Q=(q1,…,qn) from Geometric braids in the disc with setwise endpoints. In The configuration braid group Bnconf as the fundamental group of an unordered configuration space, take its parameterized base configuration to be this same tuple q=Q. Thus Bnconf=π1(Cn(D2),[Q]). Let Gn be the group of geometric braid-isotopy classes based at Q, with the stacking product [γ][β]=[γ⋆β]. Let ιC:Cn(int⁡D2)↪Cn(D2) be the inclusion and let ι∗C be its induced homomorphism at [Q]. For a geometric braid β, let S(β) be its unordered configuration slice. Then raw slicing induces a bijection S:Gn⟶π1(Cn(int⁡D2),[Q]),[β]⟼[S(β)], and reverses products. Consequently Φ:Gn⟶Bnconf,[β]⟼(ι∗C[S(β)])−1 is a group isomorphism. Relating this group to one based at another configuration requires choosing a connecting path; no Artin-presentation completeness claim is made here.

Facts & Assumptions

Given: n∈N, the specified tuple Q, its geometric braid group Gn, the open-to-closed configuration inclusion, and the slicing map.

[L1]

The geometric motion definition fixes the same explicit tuple Q and specifies that the configuration braid group is based at its orbit [Q] (Based motions of an unordered point configuration).

[L2]

The geometric braid-isotopy classes based at Q form a group Gn with product [γ][β]=[γ⋆β] (The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism).

[L3]

Slicing and tracing are well-defined mutually inverse bijections between geometric braid-isotopy classes at Q and based path-homotopy classes in Cn(int⁡D2) at [Q] (Tracing and slicing are inverse on relative classes).

[L4]

Stacking and slicing satisfy [S(γ⋆β)]=[S(β)][S(γ)] with the library's first-loop-then-second loop product (Raw slicing reverses geometric stacking products).

[L5]

At every q∈Fn(int⁡D2), the inclusion-induced map ι∗C:π1(Cn(int⁡D2),[q])⟶π1(Cn(D2),[q]) is a group isomorphism (The interior-disc and closed-disc configuration spaces are homotopy equivalent).

[L6]

The configuration braid group is Bnconf:=π1(Cn(D2),[q]) for the chosen base configuration q (The configuration braid group Bnconf as the fundamental group of an unordered configuration space).

[L7]

For a pointed continuous map f, the induced map sends [α] to [f∘α] and is a group homomorphism (The homomorphism on fundamental groups induced by a pointed continuous map).

[L8]

The loop product [α][η]=[α∗η] traverses α first and η second (Based loops and the fundamental group).

[L9]

The target fundamental-group classes form a group with two-sided inverses and an identity element (Loop classes form the group π1(X,x0) under concatenation).

[L10]

A group homomorphism preserves products: f(xy)=f(x)f(y) (Monoid homomorphism and group homomorphism).

[L11]

A function is bijective when it is both injective and surjective, and a two-sided inverse certifies those properties (Injection, surjection, bijection).

[L12]

A group isomorphism is a bijective group homomorphism (Group isomorphisms, automorphisms and the set Aut⁡(G)).

[L13]

For n=0 there is exactly one empty geometric braid; for n=1 the geometric braid condition imposes no collision restriction (Geometric braids in the disc with setwise endpoints).

[L14]

For n=0, both configuration spaces are one-point spaces and there is one based motion; for n=1, the configuration space is canonically the disk and there is no collision condition (Based motions of an unordered point configuration).

The tuple Q and every braid coordinate path are specified. Tracing uses the unique lift from this Q, and no arbitrary order, representative, or connecting path is chosen. No Axiom of Choice is used.

Proof

technique · direct
1.1L1L5L6L7

Fix the common basepoint. By [L1], the definition of Bnconf is instantiated at q=Q, so the open-to-closed inclusion is based at the same orbit [Q] on both sides. By [L5] and [L7], ι∗C is a group isomorphism from the open-disk fundamental group onto Bnconf.

1.2L3

Raw slicing is a bijection. By [L3], the class map S:[β]↦[S(β)] is well defined and has tracing as its inverse. It is therefore bijective, including the zero- and one-strand cases.

2.1L2L3L4L8step 1.2

Raw slicing reverses stacking. For [γ],[β]∈Gn, [L2] defines their product by [γ⋆β], and [L4] gives S([γ][β])=[S(γ⋆β)]=[S(β)][S(γ)]. This is the anti-homomorphism identity for the first-then-second loop product of [L8]. Since S is bijective by step 1.2, it is an anti-isomorphism.

3.1L2L4L7L9L10step 2.1

The inverse-loop map is multiplicative. Write a:=ι∗C[S(γ)],b:=ι∗C[S(β)]. By step 2.1 and the homomorphism property [L7], Φ([γ][β])=(ba)−1. In the group Bnconf, the element a−1b−1 is a two-sided inverse of ba: associativity gives (ba)(a−1b−1)=b(aa−1)b−1=1 and (a−1b−1)(ba)=a−1(b−1b)a=1. Uniqueness of inverses therefore gives (ba)−1=a−1b−1. Hence Φ([γ][β])=(ι∗C[S(γ)])−1(ι∗C[S(β)])−1=Φ([γ])Φ([β]), so Φ is a group homomorphism by [L10].

4.1L3L5L9L11L12step 1.1step 1.2step 3.1

The map is bijective and hence an isomorphism. The formula for Φ is the composite of the bijection S from step 1.2, the isomorphism ι∗C from step 1.1, and inversion in Bnconf. Inversion is a bijection because applying it twice returns the original element. Thus Φ is bijective by [L11]; together with step 3.1 it is a group isomorphism by [L12]. This also proves the stated anti-isomorphism property of raw slicing.

5.1

Boundary cases. When n=0, [L13] gives the unique empty braid and [L14] gives singleton configuration spaces and one based motion; by [L3] and [L5], the class sets and inclusion map are also singletons. When n=1, [L13]–[L14] give no collision condition; the same tracing/slicing bijection, based inclusion isomorphism, and product calculation above apply. These cases require no additional choice or basepoint path. [L3, L5, L9, L13, L14, step 1.1, step 1.2, step 2.1, step 3.1, step 4.1] □

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Pure geometric braids and ordered configuration loops

Statement

Fix n∈N and the explicit base tuple Q of Geometric braids in the disc with setwise endpoints. In The pure braid group PBn as the fundamental group of an ordered configuration space and The configuration braid group Bnconf as the fundamental group of an unordered configuration space, instantiate the common ordered basepoint at q=Q. Let Gn be the geometric braid group at Q and let πgeo:Gn⟶Sn be its endpoint-permutation homomorphism. Write Gnpure:=ker⁡πgeo. Let p:Fn(D2)⟶Cn(D2) be the ordered-to-unordered quotient, with induced map p∗:PBn=π1(Fn(D2),Q)⟶Bnconf=π1(Cn(D2),[Q]), and let πconf:Bnconf→Sn be endpoint monodromy. Use the isomorphism Φ:Gn⟶Bnconf,Φ([β])=(ι∗C[S(β)])−1 from Geometric braid classes and the unordered configuration fundamental group. Then Φ(Gnpure)=ker⁡πconf=im⁡p∗, and Φ restricts to an isomorphism from Gnpure onto this kernel. The short exact sequence identifies p∗ as an isomorphism from PBn onto the same kernel, so the resulting isomorphism to the ordered configuration group is Ψ:Gnpure⟶PBn,Ψ([β])=(ι∗F[zβ])−1, where zβ(t)=(z1(t),…,zn(t)) is the coordinate path of β. For a pure braid, zβ is a loop at Q. The inverse in this formula accounts for the fact that stacking γ⋆β slices as the loop S(β) followed by S(γ), while the geometric group product is [γ][β].

This holds for every n≥0. The groups and maps use the same specified basepoint Q; no change-of-basepoint path or Artin presentation is asserted.

Facts & Assumptions

Given: n, the explicit tuple Q, a geometric braid class [β] at Q, its endpoint permutation, the ordered and unordered configuration spaces and their quotient maps, and the fixed-basepoint isomorphism Φ above.

[L1]

The geometric braid group Gn at Q is a group, its endpoint permutation πgeo:Gn→Sn is a group homomorphism, and a braid is pure exactly when its endpoint permutation is the identity (The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism, Geometric braids in the disc with setwise endpoints).

[L2]

The slice S(β)(t)=[(z1(t),…,zn(t))] is a continuous based loop in Cn(int⁡D2) at [Q] (A geometric braid slices to an interior configuration loop).

[L3]

For a based loop α at [Q], there is a unique lift to Fn(D2) starting at Q (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

[L4]

At the exact basepoint [Q], the parameterized definition gives Bnconf=π1(Cn(D2),[Q]), and raw slicing with the open-to-closed inclusion defines the isomorphism Φ([β])=(ι∗C[S(β)])−1:Gn→Bnconf (The configuration braid group Bnconf as the fundamental group of an unordered configuration space, Geometric braid classes and the unordered configuration fundamental group).

[L5]

The ordered and unordered open-to-closed inclusions induce isomorphisms ι∗F and ι∗C at Q and [Q], respectively (The interior-disc and closed-disc configuration spaces are homotopy equivalent).

[L6]

With the parameterized base configuration set to q=Q, PBn=π1(Fn(D2),Q) and the open ordered configuration group maps to it by ι∗F (The pure braid group PBn as the fundamental group of an ordered configuration space).

[L7]

For the same Q, the quotient-induced homomorphism p∗:PBn→Bnconf is injective and im⁡p∗=ker⁡πconf (The configuration braid short exact sequence 1→PBn→Bnconf→Sn→1).

[L8]

A pointed continuous map induces the homomorphism f∗([α])=[f∘α] (The homomorphism on fundamental groups induced by a pointed continuous map).

[L9]

Loop classes use the first-loop-then-second product [α][η]=[α∗η], and the fundamental group is a group with two-sided inverses (Based loops and the fundamental group, Loop classes form the group π1(X,x0) under concatenation).

[L10]

For the stacking convention in which β is below γ, [S(γ⋆β)]=[S(β)][S(γ)] (Raw slicing reverses geometric stacking products).

[L11]

The kernel of a group homomorphism is a subgroup, with kernel and image defined by its identity preimage and its values (The kernel and image of a group homomorphism, The image of a group homomorphism is a subgroup and its kernel is a normal subgroup).

[L12]

A group homomorphism that is injective and surjective is bijective, and a bijective group homomorphism is a group isomorphism (Injection, surjection, bijection, Group isomorphisms, automorphisms and the set Aut⁡(G)).

[L14]

The inclusions and orbit quotients commute: ιC∘pint⁡D2=pD2∘ιF (The interior-disc and closed-disc configuration spaces are homotopy equivalent).

[L15]

Endpoint monodromy πconf:Bnconf→Sn is a group homomorphism (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

[L16]

If eα(i) is defined by α~(1)i=qeα(i), then eα=σα−1 under the specified label identification (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

[L17]

The coordinate tuple zβ:I→Fn(int⁡D2) is a continuous path starting at Q: its component motions are continuous and pairwise distinct at every time, and it stays in the interior. Its map to the product is continuous because the product topology is generated by projection preimages: each such preimage under zβ is the open inverse image under a continuous component. Pairwise distinctness puts the image in the ordered-configuration subspace. For n=0 it is the constant empty tuple (Geometric braids in the disc with setwise endpoints, The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, Ordered configuration spaces Fn(X)).

[L18]

The endpoint coordinates obey zj(1)=qπgeo(β)(j) (Geometric braids in the disc with setwise endpoints).

[L20]

For a based loop α at [Q], its unique lift from Q ends at σα⋅Q for the endpoint monodromy σα (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

The tuple Q and the point motions zj are specified. The path zβ is the unique lift of its unordered slice from Q, and injectivity of p∗ makes its ordered class unique. No arbitrary ordering, lift, representative, or connecting path is selected; the Axiom of Choice is not used.

Proof

technique · direct
1.1L1L11

Fix the shared basepoint and the pure subgroup. In every parameterized configuration group take q=Q, so PBn, Bnconf, both inclusion-induced maps, and p∗ are based at Q or [Q] as appropriate ([L4, L5, L6, L7]). By [L1], πgeo is a homomorphism and its identity fiber is exactly the set of pure geometric classes. By [L11] this set Gnpure=ker⁡πgeo is a subgroup of Gn.

1.2L2L3L8L14L15L16L17L18L20

The coordinate motion computes covering monodromy. For any braid β, [L2] gives pint⁡D2∘zβ=S(β), and [L17] makes zβ a path in the ordered configuration space. By the commutative square in [L14], ιF∘zβ is a lift, starting at Q, of ιC∘S(β) to Fn(D2). It is the unique such lift by [L3]. Its terminal coordinate satisfies zj(1)=qπgeo(β)(j) by [L18], so the label record e of [L16] is πgeo(β). By [L20] the lift endpoint is σ⋅Q for endpoint monodromy σ, and [L16] gives e=σ−1. The same coordinate tuple has label record e=πgeo(β) by [L18], while [L15] identifies πconf=σ. It follows that πconf(ι∗C[S(β)])=πgeo([β])−1. The use of the closed-disc lift here is valid because the open coordinate path is also a path in Fn(D2) and the quotient square in [L14] identifies its projection with ιC∘S(β).

2.1L4L9L11L12L15step 1.2

The inverse-loop map preserves the endpoint permutation. Put a:=ι∗C[S(β)]. By [L15] and the inverse identity in the fundamental group [L9], πconf(a−1)=πconf(a)−1: indeed πconf(a)πconf(a−1)=πconf(aa−1)=1. By [L4], Φ([β])=a−1, and step 1.2 gives πconf(a)=πgeo([β])−1. Thus for every [β]∈Gn, πconf(Φ([β]))=πgeo([β]). Consequently Φ([β]) lies in ker⁡πconf if and only if [β] lies in Gnpure. Since Φ is an isomorphism by [L4], its restriction is an isomorphism Gnpure→ker⁡πconf.

3.1L7L11L12step 2.1

The short exact sequence identifies the ordered group with the kernel. By [L7], p∗:PBn→Bnconf is injective and has image ker⁡πconf. Regard its codomain as this image. Then it is surjective onto the kernel by the definition of image [L11], hence bijective by [L12]. It is a group homomorphism by [L7], so it is an isomorphism by [L12]. Composing its inverse with the restriction in step 2.1 gives an isomorphism Ψ:Gnpure→PBn.

4.1L1L2L4L5L7L8L9L14L17L18step 3.1

Compute the ordered representative. If [β] is pure, [L1] gives zβ(0)=Q=zβ(1), so [L17] makes zβ a based loop in Fn(int⁡D2) at Q. Using [L2], [L5], [L8], and [L14], p∗(ι∗F[zβ])=[p∘ιF∘zβ]=[ιC∘pint⁡D2∘zβ]=ι∗C[S(β)]. Since p∗ is a homomorphism by [L7], it carries inverses to inverses: p∗(x)p∗(x−1)=p∗(xx−1)=1 for each x by [L9]. Thus p∗((ι∗F[zβ])−1)=(ι∗C[S(β)])−1=Φ([β]). The preimage under p∗ is unique by its injectivity [L7]; hence the isomorphism in step 3.1 is exactly Ψ([β])=(ι∗F[zβ])−1. This also proves the formula is independent of the representative braid.

5.1L1L4L7L8L9L10step 3.1step 4.1

Check the product order explicitly. Let [γ],[β] be pure and put a:=ι∗C[S(γ)] and b:=ι∗C[S(β)]. By [L1, L10] and the homomorphism property in [L8], Φ([γ][β])=(ba)−1. In the group Bnconf, a−1b−1 is a two-sided inverse of ba: (ba)(a−1b−1)=b(aa−1)b−1=1 and (a−1b−1)(ba)=a−1(b−1b)a=1. Thus (ba)−1=a−1b−1=Φ([γ])Φ([β]). The composite Ψ=p∗−1∘Φ on pure classes is therefore multiplicative; this shows directly that inversion of the reversed slicing product gives the ordered configuration product in geometric stacking order.

6.1

Empty and one-strand cases. For n=0, [L13] gives the unique empty braid and trivial PB0 and S0; exactness [L7] then makes B0conf trivial, so each group, kernel, and displayed map is the unique one-element group map. For n=1, [L19] says every geometric braid is pure and PB1 and S1 are trivial, so [L7] gives B1conf=im⁡p∗=ker⁡πconf, also trivial. The isomorphism [L4] then makes G1pure trivial, and the formula in step 4.1 is the unique isomorphism. The zero-strand case is the empty case, and no additional zero-valued parameter is present. [L4, L7, L13, L19, step 2.1, step 3.1, step 4.1] □

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

The geometric endpoint permutation matches covering monodromy

Statement

Fix n∈N and the explicit geometric base tuple Q of Geometric braids in the disc with setwise endpoints. Use the same basepoint [Q] in Bnconf=π1(Cn(D2),[Q]) and in the endpoint monodromy map πconf:Bnconf→Sn. Let ιC:Cn(int⁡D2)↪Cn(D2) be the open-to-closed inclusion, and let ι∗C be its induced map on fundamental groups at [Q]. For every geometric braid class [β]∈Gn, with slice loop S(β) and the inverse-loop isomorphism Φ([β])=(ι∗C[S(β)])−1 of Geometric braid classes and the unordered configuration fundamental group, we have πconf(ι∗C[S(β)])=πgeo([β])−1,πconf(Φ([β]))=πgeo([β]). Thus raw slicing has inverse endpoint monodromy after its class is carried to the closed-disc configuration group, and the inverse-loop map has exactly the geometric endpoint permutation. The formulas hold for every n≥0.

Facts & Assumptions

Given: n, the explicit tuple Q, a geometric braid class [β] based at Q, its point motions and endpoint permutation, the slice loop, and the fixed-basepoint isomorphism Φ.

[L1]

The geometric braid classes based at Q form Gn, and the endpoint map πgeo:Gn→Sn is a well-defined homomorphism; on a braid representative, zj(1)=qπgeo(β)(j) (The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism, Geometric braids in the disc with setwise endpoints).

[L2]

The slice S(β)(t)=[(z1(t),…,zn(t))] is a continuous based loop in Cn(int⁡D2) at [Q] (A geometric braid slices to an interior configuration loop).

[L3]

A based loop at [Q] has a unique lift to Fn(D2) starting at Q (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

[L4]

The open-to-closed inclusions induce maps ι∗F and ι∗C at the same basepoints, and the quotient square commutes: ιC∘pint⁡D2=pD2∘ιF (The interior-disc and closed-disc configuration spaces are homotopy equivalent).

[L5]

The induced map on fundamental groups satisfies f∗([α])=[f∘α] (The homomorphism on fundamental groups induced by a pointed continuous map).

[L6]

The fundamental group is a group under the first-loop-then-second product, with identity and two-sided inverses (Based loops and the fundamental group, Loop classes form the group π1(X,x0) under concatenation).

[L7]

Each coordinate motion is continuous, remains in the open disc, and is pairwise distinct from the others. The coordinate tuple therefore defines a continuous path into Fn(int⁡D2); continuity into the product follows because the product topology is generated by projection preimages, and distinctness puts the tuple in the ordered-configuration subspace (Geometric braids in the disc with setwise endpoints, Based motions of an unordered point configuration, The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, Ordered configuration spaces Fn(X)).

[L9]

At the fixed basepoint Q, Φ([β])=(ι∗C[S(β)])−1 is the isomorphism from Gn to Bnconf (Geometric braid classes and the unordered configuration fundamental group).

[L10]

The endpoint monodromy πconf:Bnconf→Sn is a group homomorphism (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

[L11]

If the terminal tuple of a lifted loop is recorded by α~(1)i=qe(i), then its endpoint record satisfies e=σ−1 (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

[L12]

For n=1 every geometric braid has identity endpoint permutation, and S1 is trivial (Geometric braids in the disc with setwise endpoints, Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

[L13]

If the unique lift of a based loop at [Q] from Q ends at σ⋅Q, then its endpoint monodromy is πconf([α])=σ (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

The tuple Q and every coordinate path are specified. The ordered lift used below is the unique lift from Q, so the Axiom of Choice is not used.

Proof

technique · direct
1.1L1L2L3L4L5L7L11L13

Lift the raw slice and read its endpoint labels. Use the fixed real-to-complex coordinate identification of [L7] and put zβ(t)=(z1(t),…,zn(t))∈Fn(int⁡D2); [L7] proves this is a path. By [L2], pint⁡D2∘zβ=S(β). The quotient square [L4] gives pD2∘ιF∘zβ=ιC∘pint⁡D2∘zβ=ιC∘S(β). Thus ιF∘zβ is the lift from Q of the closed-disc loop ιC∘S(β), and by [L3] it is the unique such lift. By [L13] its endpoint permutation is σ=πconf([ιC∘S(β)]). Its terminal coordinate j is qπgeo([β])(j) by [L1], so its label record is e=πgeo([β]). By [L11], e=σ−1. The induced-map formula [L5] therefore yields πconf(ι∗C[S(β)])=πgeo([β])−1.

2.1L6L9L10step 1.1

Apply the inverse-loop isomorphism. Let x:=ι∗C[S(β)]. By [L9], Φ([β])=x−1. Since πconf is a homomorphism by [L10], and Bnconf is a group by [L6], πconf(x) πconf(x−1)=πconf(xx−1)=1, so πconf(x−1)=πconf(x)−1. Applying step 1.1 gives πconf(Φ([β]))=(πgeo([β])−1)−1=πgeo([β]).

3.1L8L9L12∎

Zero- and one-strand cases. When n=0, [L8] gives the unique empty braid and the trivial permutation target; the isomorphism [L9] then makes the configuration braid group a singleton, so both equations hold. When n=1, [L12] gives identity endpoint permutation and trivial S1, so both monodromy values are the identity.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

The geometric and configuration braid models agree at the fixed base configuration

Statement

At the explicit geometric base tuple Q, let Gn be the geometric braid group, Bnconf=π1(Cn(D2),[Q]), and PBn=π1(Fn(D2),Q). The inverse-loop slicing map Φ:Gn⟶Bnconf,[β]⟼(ι∗C[S(β)])−1 is the canonical group isomorphism. It intertwines the endpoint maps: πconf(Φ([β]))=πgeo([β])([β]∈Gn). If Gnpure:=ker⁡πgeo, then its restriction, followed by the inverse of the quotient-induced map p∗:PBn→ker⁡πconf, is the isomorphism Ψ:Gnpure⟶PBn,Ψ([β])=(ι∗F[zβ])−1, where zβ(t)=(z1(t),…,zn(t)) for a pure braid. Thus pure geometric braids and ordered configuration loops agree through the same fixed-basepoint construction. No canonical identification at another basepoint or Artin-presentation claim is included.

Facts & Assumptions

Given: n, the explicit tuple Q, the geometric and configuration braid groups based at Q and [Q], endpoint monodromy, and the ordered quotient map.

[L1]

At this exact basepoint, inverse-loop slicing Φ([β])=(ι∗C[S(β)])−1 is a group isomorphism Gn→Bnconf (Geometric braid classes and the unordered configuration fundamental group).

[L2]

The isomorphism Φ carries the pure geometric subgroup onto ker⁡πconf=im⁡p∗ and restricts to an isomorphism onto that kernel (Pure geometric braids and ordered configuration loops).

[L3]

The quotient-induced map p∗ identifies PBn with that same kernel, and the resulting pure-group isomorphism has the formula Ψ([β])=(ι∗F[zβ])−1 (Pure geometric braids and ordered configuration loops).

[L4]

For every geometric braid class [β], πconf(Φ([β]))=πgeo([β]) (The geometric endpoint permutation matches covering monodromy).

The common tuple Q and all coordinate paths are specified. The inherited isomorphisms use no arbitrary change-of-basepoint path, and no choice principle is used.

Proof

technique · direct
1.1L1

The unordered configuration model. By [L1], the inverse-loop slicing map is a group isomorphism at the shared basepoint Q, with Bnconf=π1(Cn(D2),[Q]). No path to another basepoint enters this map.

1.2L2L3

The pure ordered model. By [L2], Φ takes Gnpure onto ker⁡πconf. The quotient-induced isomorphism from [L3] identifies PBn with that kernel, so composing its inverse with the pure restriction of Φ gives Ψ:Gnpure→PBn. The same fact [L3] supplies the coordinate formula and makes it representative-independent.

1.3L4

The endpoint square. Equation [L4] states exactly that the diagram with top map Φ, vertical maps πgeo and πconf, and bottom map id⁡Sn commutes. Thus the isomorphism preserves endpoint permutations.

2.1L1L2L3L4∎

Degenerate strand counts. The supplied isomorphism and both component claims [L1]–[L4] apply for every n≥0, including the empty braid at n=0 and the trivial permutation targets at n=1. Hence the packaged theorem and its pure restriction include these cases.

5 · Examples, counterexamples and false statements

None yet.

Sources