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 — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Braids as Fundamental Groups of Configuration Spaces
- Classification of Covering Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Differentiability and the Cauchy–Riemann Equations
- 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
- Fundamental Trigonometric Identities
- 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
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Manifolds with Boundary Collars and Orientations
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- 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
- Partitions of Unity and Paracompactness
- Permutation Statistics, Inversions and Eulerian Numbers
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- 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
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Fundamental Group
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The worked examples track the distinction between labelled coordinates and their unordered configuration. The positive elementary half twist is traced by an explicit semicircle path: its coordinate tuple exchanges the two endpoints, while its unordered orbit is a based loop, and the traced braid is isotopic to the chosen positive generator. For two strands, the ordered loop stays in the open disk, avoids collision, and closes at . Its traced braid is the positive full twist with identity endpoint permutation; under the pure-braid identification on the companion page, its ordered class appears with the specified inverse.
The first counterexample shows why quotienting by labels matters: the ordered path for the positive two-strand half twist starts at and ends at the transposed tuple, so it is not a based ordered loop, but both endpoints have the same unordered orbit. The second uses an embedded folded arc with a local maximum and minimum in height. Although its endpoint sets agree, its slice at height contains four points rather than two; the drawing therefore does not define a path in the two-point configuration space. These calculations exhibit the endpoint and one-point-per-height conditions needed for the braid/configuration correspondence. No Axiom of Choice is used in either construction.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A half-circle configuration loop traces an elementary half twist
Example
Fix and an adjacent index . Use the base tuple , spacing , and midpoint of The elementary geometric half twist, its support disc, and its opposite, and identify the real disc with the complex disc as in Based motions of an unordered point configuration. Set Then is an interior based loop in at , and the geometric braid traced by is braid-isotopic to the published positive elementary half twist .
Facts & Assumptions
Given: , , the fixed base tuple , and the published positive half twist with its midpoint , spacing , support disc , and lower diamond path .
The spacing is , and the base points satisfy and ; the support disc has radius , lies in , and contains exactly (The elementary geometric half twist, its support disc, and its opposite).
The published positive half twist has coordinates and at labels , with all other coordinates fixed, and (The elementary geometric half twist, its support disc, and its opposite).
For real , and , while (, , and ).
For complex , (, and the complex exponential extends the real exponential).
The complex exponential is continuous (The complex exponential is entire and its complex derivative is itself, Complex differentiability at a point implies continuity there).
Vector addition and scalar multiplication are continuous in a real or complex normed space (Vector addition and scalar multiplication are continuous in a normed space).
is the subspace of consisting of tuples with pairwise distinct coordinates (Ordered configuration spaces ).
Continuity into a product with the product topology is checked coordinate by coordinate (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 map into a subspace is continuous exactly when its composite with the inclusion into the ambient space is continuous (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).
The orbit map , , is continuous and its fibres are coordinate-permutation orbits (Unordered configuration spaces ).
An interior based motion is a continuous path in whose two endpoints equal (Based motions of an unordered point configuration).
A geometric braid consists of continuous coordinate paths in that remain pairwise distinct, start at , and end with endpoint set (Geometric braids in the disc with setwise endpoints).
Every based interior configuration loop has a unique ordered lift from , and its coordinate paths form its geometric braid trace (An interior configuration loop traces a geometric braid).
A jointly continuous homotopy through based configuration loops has boundary traces that are braid-isotopic relative to their top and bottom endpoints (A based configuration-loop homotopy traces a braid isotopy).
A path homotopy fixes both path endpoints throughout; transposing the coordinates converts between path parameter first and homotopy parameter first (Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints).
A braid isotopy is a jointly continuous family whose every height slice is a geometric braid with bottom tuple and top endpoint set (Braid isotopy relative to the top and bottom endpoints).
Choice audit: No Axiom of Choice is assumed. Every coordinate path and the starting tuple are explicitly specified, and no point is selected from a nonempty product.
Verification
Compute the round relative path. The addition law [L4] and Euler's identity [L3] give , , and . For , [L3] and [L5] give , since and ; the modulus formula gives . By [L6], is continuous. The piecewise formula [L2] gives for and for .
Check the unordered loop. The coordinates are continuous by [L6], [L7], and [L9]. Their moving pair is distinct because by [L1] and [L3]. Each moving point is at distance from , so lies in ; every fixed lies in and, for , outside by [L1]. The tuple therefore lies in by [L8], and [L10] makes it continuous into that subspace. Its orbit is continuous by [L11]. Since and , the ordered tuple starts at and ends with exchanged; both orbit endpoints are . Thus is an interior based loop by [L12].
Interpolate in the lower half-plane. Set for . This is jointly continuous by [L6], [L7], and [L9]. For , both imaginary parts are strictly negative by step 1.1, so ; at the common values are , also nonzero. The triangle inequality and [L2], [L3] give . The tuple with coordinates , , and for the other labels stays collision-free and interior: the moving pair is distinct and stays in , while all fixed points remain outside by [L1]. Its coordinate maps are continuous, and [L8]–[L10] give a continuous family in the ordered configuration subspace. Each slice is a geometric braid by [L13], and the family is a braid isotopy by [L17], since its bottom tuple is and its top set is for every . At the braid is ; at it is the round tuple of step 1.2.
Identify the exact traces. The ordered family in step 2.1 is continuous into by [L8]–[L10], so its quotient is jointly continuous by [L11]. Its endpoints satisfy for every , and every slice is an interior based motion by [L12]. The transpose is a path homotopy rel endpoints under [L16]. Thus [L15] makes the traces of the two boundary loops braid-isotopic. By [L14], those traces are exactly and the round tuple; the latter is the trace of by step 1.2. This proves the example.
A pure two-strand full twist as an ordered loop
Example
For with , the ordered path stays collision-free in the open disk and closes at . Its traced geometric braid is the positive full twist and has identity endpoint permutation.
Facts & Assumptions
Given: , the published base tuple , spacing , positive elementary half twist , and its diamond relative path .
For , , , the midpoint is , and , . The path is continuous, has endpoints , never vanishes, and satisfies . The positive convention is the published anticlockwise half twist (The elementary geometric half twist, its support disc, and its opposite, Geometric braids in the disc with setwise endpoints).
The complex exponential is continuous, and for real , and ; also (The complex exponential is entire and its complex derivative is itself, Complex differentiability at a point implies continuity there, , , and , , and the complex exponential extends the real exponential).
Complex modulus is definite and satisfies ; complex addition and scalar multiplication are continuous (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive, Vector addition and scalar multiplication are continuous in a normed space).
On cosine decreases through at and sine is nonnegative; on cosine increases through at and sine is nonpositive by its -shift. Thus lies in the corresponding closed quadrant for , , , and (Signs, monotonicity intervals, and ranges of sine and cosine, Quarter-turn values and shifts by pi/2 and pi, Pi is the first positive zero of sine).
is the subspace of consisting of ordered pairs with distinct coordinates; continuity into is coordinatewise, and continuity into follows from the subspace topology (Ordered configuration spaces , 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, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).
The orbit map is continuous, and an interior based motion is a continuous path with both endpoints (Unordered configuration spaces , Based motions of an unordered point configuration).
Every interior based configuration loop at has a unique ordered lift from , whose coordinate graphs are its geometric braid trace (An interior configuration loop traces a geometric braid).
A geometric braid starts at the labelled tuple , remains collision-free in the open disk, and is pure when every labelled endpoint returns to its starting point (Geometric braids in the disc with setwise endpoints).
In , the first half runs and the second half runs with labels permuted by the lower braid, and the induced class product is (Stacking of geometric braids is a well-defined associative operation on isotopy classes).
The isotopy classes of geometric braids based at form a group with the stacking product (The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism).
A braid isotopy is a jointly continuous family of braids with bottom tuple and top endpoint set at every isotopy parameter (Braid isotopy relative to the top and bottom endpoints); piecewise continuous maps on two closed sets covering the square paste continuously (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous).
For a pure geometric braid with coordinate loop at , the pure-braid isomorphism is (Pure geometric braids and ordered configuration loops).
The formulae below specify every path and homotopy. No lift, representative, or point of a nonempty set is chosen, so the Axiom of Choice is not used.
Proof
Put . By [L2], is continuous and . Since and the exponential addition law gives , one has . Hence starts and ends at . Its coordinate difference is , and while . Thus its values are ordered configurations in ; coordinate continuity and [L5] show that is a continuous ordered loop at .
Let . By [L6], this is a continuous interior based loop at . Its unique lift from is itself, so [L7] identifies its trace with the coordinate braid . Because both coordinates of return to their starting values, [L8] shows is pure and its endpoint permutation is the identity.
Use the stacking formula [L9] on two copies of . Since the endpoint permutation of the lower copy exchanges labels and , the stacked coordinate pair is Its centre is and its second-minus-first coordinate is Substitution of the two branches of from [L1] shows that lies successively in the first, second, third, and fourth closed quadrants on the four quarter intervals. It never vanishes, and by [L1]. By [L2] and [L4], lies in the same respective closed quadrant, never vanishes, and has modulus .
For set Each closed quadrant is convex and contains no pair of opposite nonzero vectors, so for every . By [L3], so both coordinates of have modulus at most . The formulas and [L2], [L3], [L9] give joint continuity. Both and equal at , so for every . Thus [L11] makes a braid isotopy from the stacked diamond braid to the centred round pair .
Put and define The coordinate difference is , and [L3] gives Both coordinates are therefore in the open disk and distinct at every height. The formula is jointly continuous by [L2], [L3]. Since and , the endpoints are for every . Thus [L11] makes a braid isotopy from to .
The families and agree at their common braid . Pasting for to for gives a jointly continuous family by [L11]. Each slice is a braid and its endpoints remain , so this is a braid isotopy from to . By [L9] and [L10], Together with step 1.2, this proves that the trace of the stated ordered loop is the positive full twist and has identity endpoint permutation.
Since is pure by step 1.2, the exact ordered representative of its class under the pure-braid isomorphism [L12] is Thus the displayed collision-free ordered loop records this positive full twist under the common basepoint convention, including the inverse in the published identification. [L12, step 1.2, step 3.1]
An exchange closes only after forgetting labels
Statement refuted
A based loop in the unordered configuration space can occur only when its ordered coordinate path also returns to the same ordered tuple.
Facts & Assumptions
Given: Take , , , , and . Consider the published positive elementary half twist .
The ordered configuration space consists of ordered pairs with distinct coordinates (Ordered configuration spaces ).
The unordered quotient sends an ordered tuple to its coordinate-permutation orbit; in particular and have the same image (Unordered configuration spaces ).
The quotient projection is continuous (Unordered configuration spaces ).
For , the published positive half twist has midpoint and coordinates and ; is continuous, nonzero, has endpoints and , and has norm at most (The elementary geometric half twist, its support disc, and its opposite).
The positive elementary half twist is a geometric braid based at (The elementary geometric half twist, its support disc, and its opposite).
The slice path of a geometric braid is defined by (A geometric braid slices to an interior configuration loop).
A based loop at is a path whose two endpoints both equal (Based loops and the fundamental group).
The coordinates and endpoint exchange are explicit; no choice principle is assumed or used.
Counterexample
Track the ordered pair. The midpoint of and is , so the published half-twist formula in [L4] gives the ordered path Its coordinates lie in because , and they are distinct because their difference is . Thus this is a path in , with endpoints
Since , the terminal ordered tuple is not . By [L7], is a path in the ordered configuration space but is not a based loop at .
Forget the labels. By [L2], the endpoint tuples have the same orbit: By [L3], the quotient projection is continuous, so is a continuous path in with . By [L5, L6], this is the slice path of the positive geometric half twist, so it is the unordered based loop promised by the counterexample.
The ordered coordinate path fails to close at , while its unordered image closes at . Hence forgetting labels can close a nonlooping ordered coordinate path, refuting the claim in the statement.
An embedded height-folded arc has no configuration-loop slices
Statement refuted
Every embedded two-strand arc picture in with the same endpoint set at heights and determines a two-point configuration at every intermediate height by horizontal slicing.
Facts & Assumptions
Given: In the geometric-braid convention, take , so , , , and the base tuple is .
For the published geometric base points are and , both in the interior unit disk (Geometric braids in the disc with setwise endpoints).
Each element of is an unordered configuration of exactly two distinct points (Unordered configuration spaces ).
A geometric braid strand is a graph over the height parameter and meets each height plane exactly once (Geometric braids in the disc with setwise endpoints).
The slicing lemma applies to level-preserving geometric braids and gives a configuration-loop slice from their coordinate motions (A geometric braid slices to an interior configuration loop).
No choice principle is assumed or used; the witness consists of explicit points and line segments.
Counterexample
Construct the folded arc and vertical strand. Let . In , define Let be the polygonal path , and let . The endpoint sets of at heights and are both . The height of has a local maximum at and a local minimum at , so is not height-monotone.
Verify that these are disjoint embedded arcs in the cylinder. The segment has spatial coordinate , while has except at and has except at . The only possible intersection of and at would be , whose height is while has height at most , so those segments are disjoint. Along the spatial coordinates satisfy ; along they satisfy . A common point must therefore have , which occurs on both segments only at . Thus the three segments form an embedded arc. Its spatial points lie in the convex ball of radius about , since that ball contains all four vertices. As , the arc misses . Also , so lies in ; lies there because .
Compute the slice at height . The height coordinate is strictly monotone on each segment of , so each segment meets that plane once. Linear interpolation gives the three spatial points The first has and the other two have different positive coordinates; their coordinates are also different, so these three points are distinct. The strand contributes the fourth point , which is not on by step 2.1. The slice therefore contains four distinct points.
By [L2], a value of must have exactly two points, whereas the horizontal slice at has four. Hence this embedded picture does not define a path by slicing, despite having the same endpoint set at heights and . Its folded arc also fails the one-point-per-height condition in [L3], so the level-preserving braid slicing lemma [L4] does not apply.
Sources
- Juan Gonzalez-Meneses, Basic results on braid groups, §1.5, printed pp. 7–8, Figure 2
- Juan Gonzalez-Meneses, Basic results on braid groups, §1.2, printed pp. 4–5
- Juan Gonzalez-Meneses, Basic results on braid groups, §1.5, Figure 2, printed pp. 7–8
- Juan Gonzalez-Meneses, Basic results on braid groups, §§1.2–1.3, printed pp. 4–5