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.
Braids as Fundamental Groups of Configuration Spaces
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Classification of Covering Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Covering Spaces and Lifting
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Geometric Braids and Artin Generators
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hereditary and Productive Behaviour of the Separation Axioms
- Homotopy and Homotopy Equivalence
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Manifolds with Boundary Collars and Orientations
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordered and Unordered Configuration Spaces
- Permutation Statistics, Inversions and Eulerian Numbers
- Polynomial Rings, the Division Algorithm and Roots
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Semidirect Products, Automorphism Groups and Split Extensions
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Complex Exponential and Euler's Formula
- The Fundamental Group
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page identifies geometric braids, defined as level-preserving motions of the fixed base tuple in the open unit disk, with loops in the unordered configuration space. A based unordered motion is a continuous path in beginning and ending at ; it is interior when every slice lies in . 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 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 ; only identity-permutation motions lift to ordered loops at .
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 where is the slice loop and includes the open-disk configuration space into the closed-disk one, is the resulting group isomorphism at . The pure subgroup is the kernel of endpoint permutation and identifies with the ordered configuration group by where 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, is applied only after 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
Based motions of an unordered point configuration
Definition
Fix and let 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 by , so and its orbit is defined by Ordered configuration spaces and Unordered configuration spaces .
An unordered configuration motion is a continuous map It is a based motion at if and it is an interior based motion if, in addition, Every slice is a collision-free -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 as the fundamental group of an unordered configuration space chosen to be this same , the based-loop classes of all such closed-disc motions form
Let 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 . Thus every class in 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 , both configuration spaces are one-point spaces and there is one based motion. For , is canonically homeomorphic to and the geometric basepoint is , 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.
An interior configuration loop traces a geometric braid
Statement
For every interior based motion at , the quotient covering has a unique lift starting at . Writing , the coordinate graphs form a geometric braid based at , and its unordered slice at every height is exactly .
Facts & Assumptions
Given: A natural number , the geometric base tuple , and an interior based motion at .
is the subspace of consisting of tuples with pairwise distinct coordinates, and is the one-point space (Ordered configuration spaces ).
is the orbit quotient of by coordinate permutations; its quotient map is continuous and surjective, and its fibres are exactly the coordinate-permutation orbits (Unordered configuration spaces ).
Under the real-complex identification, is a subspace of the closed unit disk ; is Hausdorff, and Hausdorffness passes to subspaces (Geometric braids in the disc with setwise endpoints, The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane, The closed disk is a connected Hausdorff topological -manifold with boundary, , , and Hausdorffness are hereditary).
If is Hausdorff, then every point of has an evenly covered neighbourhood under ; for , is the unique homeomorphism of one-point spaces (Disjoint coordinate neighbourhoods evenly cover the unordered configuration space).
For a covering and path with a specified starting lift , there is a unique path starting at and satisfying (Existence and uniqueness of path lifts through a covering map).
A geometric braid based at is a tuple of continuous point motions in with pairwise distinct values at every height, bottom tuple , and top endpoint set (Geometric braids in the disc with setwise endpoints).
An interior based motion is a continuous path in whose two endpoints are (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
The quotient is a covering on the open disk. By [L3], is Hausdorff; applying [L4] with gives an evenly covered neighbourhood at every unordered configuration, and continuity and surjectivity from [L2] show that is a covering. For both spaces are points, so this conclusion still holds.
Lift the motion. Since is based at by [L7] and , [L5] gives a unique continuous lift with and ; write its coordinates as , taking the empty tuple when .
Check the strand conditions. By [L1], the coordinate projections of are continuous; because every lifted tuple lies in , the coordinates remain interior and pairwise distinct, and they start at . At the top, , so [L2] places the terminal tuple in the coordinate-permutation orbit of , giving endpoint set exactly ; these conditions are vacuous for .
The lift is the required braid and traces the original motion. By [L6], is a geometric braid based at : its strands are the graphs , so height is their parameter and distinct strands cannot meet. Its unordered slice is for every , by [L5]; this also holds for the unique empty braid when .
The unique lift has all the endpoint, collision, continuity and slicing properties required in the statement, establishing the claim.
A based configuration-loop homotopy traces a braid isotopy
Statement
Let be a continuous homotopy of based loops at , written with the homotopy parameter first and height second. Thus and the boundary loops are and . The unique ordered lifts of and starting at trace geometric braids that are braid-isotopic relative to their top and bottom endpoints.
Facts & Assumptions
Given: ; a continuous map satisfying the displayed based-loop endpoint conditions; and its boundary loops and .
The quotient map is a covering, and every based interior configuration loop at has a unique lift from whose coordinate graphs form its geometric braid (An interior configuration loop traces a geometric braid).
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).
If is a covering, a homotopy and a lift of are given, then there is a unique continuous lift of extending that initial lift (Existence and uniqueness of homotopy lifts through a covering map).
is a subspace of the product with its product topology (Ordered configuration spaces ).
The product topology is the initial topology of the coordinate projections, so coordinate maps of a map into a product are continuous (The product set 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).
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 (Braid isotopy relative to the top and bottom endpoints).
Since each labelled top endpoint lies in the finite discrete set , 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 is the specified constant map , and the homotopy lift is unique.
Proof
Specify the initial lift. By [L1], is a covering. The constant map , , is continuous and lifts the edge because .
Lift the full square. Apply [L3] to with , height coordinate , and initial lift from step 1.1. There is a unique jointly continuous lift with and .
Each lifted height path is the braid trace. Fix . By step 2.1, lifts the based loop from . Uniqueness in [L1] identifies it with the lift whose coordinate graphs form the geometric braid traced by that loop. Its terminal tuple projects to , so its endpoint set is . This includes , where there are no pairwise-collision conditions.
Identify the two boundary braids. By step 2.1, lifts from and lifts from . 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.
The lifted coordinates give a braid isotopy. Define to be the th coordinate of under the fixed real-complex identification. The lift in step 2.1 is jointly continuous into ; the coordinate projections are continuous by [L4, L5]. Thus each is jointly continuous. By step 3.1, every slice is a geometric braid with bottom and top endpoint set . It therefore meets the braid-isotopy conditions [L6]. By [L7], joint continuity also keeps each labelled top endpoint fixed during the isotopy. For , both configuration spaces are points and this is the unique empty braid isotopy.
The jointly continuous lifted family has the prescribed boundary braids from step 3.2 and satisfies every braid-isotopy condition by step 4.1.
A geometric braid slices to an interior configuration loop
Statement
For a geometric braid based at , let where the real-disc coordinates are identified with complex coordinates as in Based motions of an unordered point configuration. Then is a continuous based loop in . This slicing uses the given level parameter and the given labelled point motions; at height its value is exactly the unordered configuration cut out by the braid at that height.
Facts & Assumptions
Given: and a geometric braid based at the fixed tuple .
The ordered configuration space has the subspace topology from the product with its product topology; for it is the one-point empty tuple (Ordered configuration spaces ).
Each is continuous (Geometric braids in the disc with setwise endpoints).
At every height the coordinates are pairwise distinct (Geometric braids in the disc with setwise endpoints).
Each point motion starts at the corresponding (Geometric braids in the disc with setwise endpoints).
The set of the terminal points is (Geometric braids in the disc with setwise endpoints).
The fixed real-complex identification takes to (Based motions of an unordered point configuration).
The canonical map , , is continuous and sends a tuple to its coordinate-permutation orbit (Unordered configuration spaces ).
The product topology on a product is the initial topology of its coordinate projections, so continuity into that product is checked coordinatewise (The product set 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).
The th strand is the graph 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
The ordered tuple varies continuously. Apply the fixed real-complex identification from [L6] to each coordinate . By [L2], each resulting coordinate map is continuous. The product topology on is the topology for which continuity into the product is checked coordinatewise [L8], so is continuous. Pairwise distinctness in [L3] places its image in ; because that space has the subspace topology, the same map, with this restricted codomain, is continuous ([L1]). For this is the constant map to the one-point empty tuple.
Pass to the unordered quotient. By [L7], is continuous, so is continuous. At the bottom, by [L4], so . At the top, the set of the coordinates of is by [L5], hence is a coordinate permutation of and by the orbit description in [L7]. Thus , as required for a based loop ([L4, L5, L7]).
Identify each height slice. The graph of the th coordinate is by [L9], so its intersection with height returns the point . Taking all labels, their unordered orbit is exactly . The labels are retained in and then forgotten precisely by the quotient, with no reparametrization of height. For the slice and loop are the unique empty configuration.
The sliced path is continuous, has both endpoint values , and at each height equals the unordered slice of the given level-preserving braid.
Tracing and slicing are inverse on relative classes
Statement
Fix and the geometric base tuple . Tracing based interior configuration loops and slicing geometric braids induce mutually inverse bijections between based path-homotopy classes in at and geometric braid-isotopy classes of braids based at .
Facts & Assumptions
Given: , the fixed tuple , an interior based configuration loop at , and a geometric braid based at .
Every interior based configuration loop at has a unique ordered lift starting at ; 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).
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).
The slice of a geometric braid is (A geometric braid slices to an interior configuration loop).
In a braid isotopy, every coordinate map is jointly continuous in the isotopy parameter and height (Braid isotopy relative to the top and bottom endpoints).
A based loop class is taken modulo path homotopy relative to the endpoints (Based loops and the fundamental group).
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).
Continuity into a product with the product topology is equivalent to continuity of every coordinate map (The product set 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).
The ordered configuration space is the subspace of consisting of tuples with pairwise distinct coordinates (Ordered configuration spaces ).
The unordered configuration space consists of the coordinate-permutation orbits of ordered configurations (Unordered configuration spaces ).
The fixed identification sends the real open disk to (Based motions of an unordered point configuration).
A geometric braid is a tuple of continuous motions in that are pairwise distinct at every height, start at , and have terminal point set (Geometric braids in the disc with setwise endpoints).
Every -slice of a braid isotopy is a geometric braid based at , with bottom tuple and top endpoint set (Braid isotopy relative to the top and bottom endpoints).
The boundary slices of a braid isotopy are its two endpoint braids (Braid isotopy relative to the top and bottom endpoints).
For , and are one-point spaces; for , and are canonically homeomorphic to (Ordered configuration spaces , Unordered configuration spaces ).
The canonical projection is continuous (Unordered configuration spaces ).
The trace uses the unique lift from the specified ; the slice uses the given labelled coordinate tuple. No arbitrary ordering or choice is used.
Proof
Trace is well-defined on path classes. Define to be the braid-isotopy class of the braid traced by the unique lift of from , 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 is independent of the representative.
Slice is well-defined on braid-isotopy classes. Suppose 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 is continuous. Each slice is collision-free by [L11, L12], so its image lies in ; the subspace topology [L8] makes the restricted map continuous. Composing with the continuous orbit projection [L15] gives The fixed bottom tuple gives for every , and the setwise top condition gives for every , by [L12] and the orbit description [L9]. At and , is respectively the slice of and of by [L3, L13]. The switch is continuous by the product-topology criterion [L7], so 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.
Slice after trace is the original loop. For any , the trace lemma says that the unordered slice of the traced braid equals at every [L1]. Thus in the based path-homotopy class set.
Trace after slice is the original braid. By [L11], the ordered coordinate path is a continuous path in starting at , using [L7, L8, L10]. Its projection is by [L3]. It is therefore an ordered lift of from ; uniqueness in [L1] makes the traced braid exactly , so as a braid-isotopy class.
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 both configuration spaces and class sets are singletons; for the configuration spaces identify with the disk and there are no collision conditions, so the same constructions apply [L14].
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 , raw slicing reverses the stacking order:
Facts & Assumptions
Given: and geometric braids and based at .
The stacked braid has coordinate formula where is the endpoint permutation of (Stacking of geometric braids is a well-defined associative operation on isotopy classes).
For a braid , its slice is and is a continuous based loop at in (A geometric braid slices to an interior configuration loop).
The product of loop classes is , where is traversed first on and second on (Based loops and the fundamental group).
The points of are coordinate-permutation orbits, so a tuple and any reordering of its coordinates have the same image (Unordered configuration spaces ).
For every pointed space, this loop-class product is well-defined and makes a group (Loop classes form the group 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
The lower half is the first slice loop. For , [L1] gives which is the first half of the concatenation by [L3].
The upper half is the second slice loop. For , [L1] gives the ordered tuple . Since is a permutation, this is a reordering of the coordinates of at height ; [L4] therefore gives the second half of .
The piecewise paths agree at the seam. At , the first half has value and the second has value by [L2]. The stacked slice is also this same orbit by [L1]. Thus the two formulas establish the pointwise identity of based loops on all of , including the shared endpoint of the two closed halves.
Taking path-homotopy classes of this equality and using the product convention [L3] gives in the group of [L5]. For all loops are the unique empty loop and the identity holds; for , is the identity and the same two-half calculation applies without collision conditions.
Geometric braid classes and the unordered configuration fundamental group
Statement
Fix and the explicit geometric base tuple from Geometric braids in the disc with setwise endpoints. In The configuration braid group as the fundamental group of an unordered configuration space, take its parameterized base configuration to be this same tuple . Thus Let be the group of geometric braid-isotopy classes based at , with the stacking product . Let be the inclusion and let be its induced homomorphism at . For a geometric braid , let be its unordered configuration slice. Then raw slicing induces a bijection and reverses products. Consequently 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: , the specified tuple , its geometric braid group , the open-to-closed configuration inclusion, and the slicing map.
The geometric motion definition fixes the same explicit tuple and specifies that the configuration braid group is based at its orbit (Based motions of an unordered point configuration).
The geometric braid-isotopy classes based at form a group with product (The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism).
Slicing and tracing are well-defined mutually inverse bijections between geometric braid-isotopy classes at and based path-homotopy classes in at (Tracing and slicing are inverse on relative classes).
Stacking and slicing satisfy with the library's first-loop-then-second loop product (Raw slicing reverses geometric stacking products).
At every , the inclusion-induced map is a group isomorphism (The interior-disc and closed-disc configuration spaces are homotopy equivalent).
The configuration braid group is for the chosen base configuration (The configuration braid group as the fundamental group of an unordered configuration space).
For a pointed continuous map , the induced map sends to and is a group homomorphism (The homomorphism on fundamental groups induced by a pointed continuous map).
The loop product traverses first and second (Based loops and the fundamental group).
The target fundamental-group classes form a group with two-sided inverses and an identity element (Loop classes form the group under concatenation).
A group homomorphism preserves products: (Monoid homomorphism and group homomorphism).
A function is bijective when it is both injective and surjective, and a two-sided inverse certifies those properties (Injection, surjection, bijection).
A group isomorphism is a bijective group homomorphism (Group isomorphisms, automorphisms and the set ).
For there is exactly one empty geometric braid; for the geometric braid condition imposes no collision restriction (Geometric braids in the disc with setwise endpoints).
For , both configuration spaces are one-point spaces and there is one based motion; for , the configuration space is canonically the disk and there is no collision condition (Based motions of an unordered point configuration).
The tuple and every braid coordinate path are specified. Tracing uses the unique lift from this , and no arbitrary order, representative, or connecting path is chosen. No Axiom of Choice is used.
Proof
Fix the common basepoint. By [L1], the definition of is instantiated at , so the open-to-closed inclusion is based at the same orbit on both sides. By [L5] and [L7], is a group isomorphism from the open-disk fundamental group onto .
Raw slicing is a bijection. By [L3], the class map is well defined and has tracing as its inverse. It is therefore bijective, including the zero- and one-strand cases.
Raw slicing reverses stacking. For , [L2] defines their product by , and [L4] gives This is the anti-homomorphism identity for the first-then-second loop product of [L8]. Since is bijective by step 1.2, it is an anti-isomorphism.
The inverse-loop map is multiplicative. Write By step 2.1 and the homomorphism property [L7], In the group , the element is a two-sided inverse of : associativity gives and . Uniqueness of inverses therefore gives . Hence so is a group homomorphism by [L10].
The map is bijective and hence an isomorphism. The formula for is the composite of the bijection from step 1.2, the isomorphism from step 1.1, and inversion in . 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.
Boundary cases. When , [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 , [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]
Pure geometric braids and ordered configuration loops
Statement
Fix and the explicit base tuple of Geometric braids in the disc with setwise endpoints. In The pure braid group as the fundamental group of an ordered configuration space and The configuration braid group as the fundamental group of an unordered configuration space, instantiate the common ordered basepoint at . Let be the geometric braid group at and let be its endpoint-permutation homomorphism. Write Let be the ordered-to-unordered quotient, with induced map and let be endpoint monodromy. Use the isomorphism from Geometric braid classes and the unordered configuration fundamental group. Then and restricts to an isomorphism from onto this kernel. The short exact sequence identifies as an isomorphism from onto the same kernel, so the resulting isomorphism to the ordered configuration group is where is the coordinate path of . For a pure braid, is a loop at . The inverse in this formula accounts for the fact that stacking slices as the loop followed by , while the geometric group product is .
This holds for every . The groups and maps use the same specified basepoint ; no change-of-basepoint path or Artin presentation is asserted.
Facts & Assumptions
Given: , the explicit tuple , a geometric braid class at , its endpoint permutation, the ordered and unordered configuration spaces and their quotient maps, and the fixed-basepoint isomorphism above.
The geometric braid group at is a group, its endpoint permutation 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 form a group, and the endpoint permutation is a homomorphism, Geometric braids in the disc with setwise endpoints).
The slice is a continuous based loop in at (A geometric braid slices to an interior configuration loop).
For a based loop at , there is a unique lift to starting at (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).
At the exact basepoint , the parameterized definition gives , and raw slicing with the open-to-closed inclusion defines the isomorphism (The configuration braid group as the fundamental group of an unordered configuration space, Geometric braid classes and the unordered configuration fundamental group).
The ordered and unordered open-to-closed inclusions induce isomorphisms and at and , respectively (The interior-disc and closed-disc configuration spaces are homotopy equivalent).
With the parameterized base configuration set to , and the open ordered configuration group maps to it by (The pure braid group as the fundamental group of an ordered configuration space).
For the same , the quotient-induced homomorphism is injective and (The configuration braid short exact sequence ).
A pointed continuous map induces the homomorphism (The homomorphism on fundamental groups induced by a pointed continuous map).
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 under concatenation).
For the stacking convention in which is below , (Raw slicing reverses geometric stacking products).
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).
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 ).
For there is one geometric braid, is trivial, and is trivial (Geometric braids in the disc with setwise endpoints, The pure braid group as the fundamental group of an ordered configuration space, The configuration braid short exact sequence ).
The inclusions and orbit quotients commute: (The interior-disc and closed-disc configuration spaces are homotopy equivalent).
Endpoint monodromy is a group homomorphism (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).
If is defined by , then under the specified label identification (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).
The coordinate tuple is a continuous path starting at : 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 is the open inverse image under a continuous component. Pairwise distinctness puts the image in the ordered-configuration subspace. For it is the constant empty tuple (Geometric braids in the disc with setwise endpoints, The product set 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 ).
The endpoint coordinates obey (Geometric braids in the disc with setwise endpoints).
For , every geometric braid is pure, is trivial, and is trivial (Geometric braids in the disc with setwise endpoints, The pure braid group as the fundamental group of an ordered configuration space, The configuration braid short exact sequence ).
For a based loop at , its unique lift from ends at for the endpoint monodromy (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).
The tuple and the point motions are specified. The path is the unique lift of its unordered slice from , and injectivity of makes its ordered class unique. No arbitrary ordering, lift, representative, or connecting path is selected; the Axiom of Choice is not used.
Proof
Fix the shared basepoint and the pure subgroup. In every parameterized configuration group take , so , , both inclusion-induced maps, and are based at or as appropriate ([L4, L5, L6, L7]). By [L1], is a homomorphism and its identity fiber is exactly the set of pure geometric classes. By [L11] this set is a subgroup of .
The coordinate motion computes covering monodromy. For any braid , [L2] gives , and [L17] makes a path in the ordered configuration space. By the commutative square in [L14], is a lift, starting at , of to . It is the unique such lift by [L3]. Its terminal coordinate satisfies by [L18], so the label record of [L16] is . By [L20] the lift endpoint is for endpoint monodromy , and [L16] gives . The same coordinate tuple has label record by [L18], while [L15] identifies . It follows that The use of the closed-disc lift here is valid because the open coordinate path is also a path in and the quotient square in [L14] identifies its projection with .
The inverse-loop map preserves the endpoint permutation. Put . By [L15] and the inverse identity in the fundamental group [L9], : indeed . By [L4], , and step 1.2 gives . Thus for every , Consequently lies in if and only if lies in . Since is an isomorphism by [L4], its restriction is an isomorphism .
The short exact sequence identifies the ordered group with the kernel. By [L7], is injective and has image . 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 .
Compute the ordered representative. If is pure, [L1] gives , so [L17] makes a based loop in at . Using [L2], [L5], [L8], and [L14], Since is a homomorphism by [L7], it carries inverses to inverses: for each by [L9]. Thus The preimage under is unique by its injectivity [L7]; hence the isomorphism in step 3.1 is exactly . This also proves the formula is independent of the representative braid.
Check the product order explicitly. Let be pure and put and . By [L1, L10] and the homomorphism property in [L8], In the group , is a two-sided inverse of : and . Thus . The composite 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.
Empty and one-strand cases. For , [L13] gives the unique empty braid and trivial and ; exactness [L7] then makes trivial, so each group, kernel, and displayed map is the unique one-element group map. For , [L19] says every geometric braid is pure and and are trivial, so [L7] gives , also trivial. The isomorphism [L4] then makes 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]
The geometric endpoint permutation matches covering monodromy
Statement
Fix and the explicit geometric base tuple of Geometric braids in the disc with setwise endpoints. Use the same basepoint in and in the endpoint monodromy map . Let be the open-to-closed inclusion, and let be its induced map on fundamental groups at . For every geometric braid class , with slice loop and the inverse-loop isomorphism of Geometric braid classes and the unordered configuration fundamental group, we have 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 .
Facts & Assumptions
Given: , the explicit tuple , a geometric braid class based at , its point motions and endpoint permutation, the slice loop, and the fixed-basepoint isomorphism .
The geometric braid classes based at form , and the endpoint map is a well-defined homomorphism; on a braid representative, (The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism, Geometric braids in the disc with setwise endpoints).
The slice is a continuous based loop in at (A geometric braid slices to an interior configuration loop).
A based loop at has a unique lift to starting at (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).
The open-to-closed inclusions induce maps and at the same basepoints, and the quotient square commutes: (The interior-disc and closed-disc configuration spaces are homotopy equivalent).
The induced map on fundamental groups satisfies (The homomorphism on fundamental groups induced by a pointed continuous map).
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 under concatenation).
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 ; 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 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 ).
For there is one empty geometric braid and is trivial (Geometric braids in the disc with setwise endpoints, Endpoint monodromy of an unordered configuration loop as a permutation of the labels).
At the fixed basepoint , is the isomorphism from to (Geometric braid classes and the unordered configuration fundamental group).
The endpoint monodromy is a group homomorphism (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).
If the terminal tuple of a lifted loop is recorded by , then its endpoint record satisfies (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).
For every geometric braid has identity endpoint permutation, and is trivial (Geometric braids in the disc with setwise endpoints, Endpoint monodromy of an unordered configuration loop as a permutation of the labels).
If the unique lift of a based loop at from ends at , then its endpoint monodromy is (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).
The tuple and every coordinate path are specified. The ordered lift used below is the unique lift from , so the Axiom of Choice is not used.
Proof
Lift the raw slice and read its endpoint labels. Use the fixed real-to-complex coordinate identification of [L7] and put ; [L7] proves this is a path. By [L2], . The quotient square [L4] gives Thus is the lift from of the closed-disc loop , and by [L3] it is the unique such lift. By [L13] its endpoint permutation is . Its terminal coordinate is by [L1], so its label record is . By [L11], . The induced-map formula [L5] therefore yields
Apply the inverse-loop isomorphism. Let . By [L9], . Since is a homomorphism by [L10], and is a group by [L6], so . Applying step 1.1 gives
Zero- and one-strand cases. When , [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 , [L12] gives identity endpoint permutation and trivial , so both monodromy values are the identity.
The geometric and configuration braid models agree at the fixed base configuration
Statement
At the explicit geometric base tuple , let be the geometric braid group, , and . The inverse-loop slicing map is the canonical group isomorphism. It intertwines the endpoint maps: If , then its restriction, followed by the inverse of the quotient-induced map , is the isomorphism where 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: , the explicit tuple , the geometric and configuration braid groups based at and , endpoint monodromy, and the ordered quotient map.
At this exact basepoint, inverse-loop slicing is a group isomorphism (Geometric braid classes and the unordered configuration fundamental group).
The isomorphism carries the pure geometric subgroup onto and restricts to an isomorphism onto that kernel (Pure geometric braids and ordered configuration loops).
The quotient-induced map identifies with that same kernel, and the resulting pure-group isomorphism has the formula (Pure geometric braids and ordered configuration loops).
For every geometric braid class , (The geometric endpoint permutation matches covering monodromy).
The common tuple and all coordinate paths are specified. The inherited isomorphisms use no arbitrary change-of-basepoint path, and no choice principle is used.
Proof
The unordered configuration model. By [L1], the inverse-loop slicing map is a group isomorphism at the shared basepoint , with . No path to another basepoint enters this map.
The pure ordered model. By [L2], takes onto . The quotient-induced isomorphism from [L3] identifies with that kernel, so composing its inverse with the pure restriction of gives . The same fact [L3] supplies the coordinate formula and makes it representative-independent.
The endpoint square. Equation [L4] states exactly that the diagram with top map , vertical maps and , and bottom map commutes. Thus the isomorphism preserves endpoint permutations.
Degenerate strand counts. The supplied isomorphism and both component claims [L1]–[L4] apply for every , including the empty braid at and the trivial permutation targets at . Hence the packaged theorem and its pure restriction include these cases.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Juan Gonzalez-Meneses, Basic results on braid groups, §§1.1–1.3, printed pp. 3–6
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, §1.1, author manuscript pp. 3–5
- Juan Gonzalez-Meneses, Basic results on braid groups, §1.3, printed p. 5
- Juan Gonzalez-Meneses, Basic results on braid groups, §§1.1–1.3, printed pp. 3–5
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, §1.1, author manuscript pp. 3–4
- Juan Gonzalez-Meneses, Basic results on braid groups, §2.1, equation (2.1), printed p. 11