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.
Stacking of geometric braids is a well-defined associative operation on isotopy classes
Statement
Let and let be the base configuration of Geometric braids in the disc with setwise endpoints, with and . Let and be braids based at with endpoint permutations and (Geometric braids in the disc with setwise endpoints), and let denote braid isotopy relative to the top and bottom (Braid isotopy relative to the top and bottom endpoints).
(a) The stacked tuple is a braid. Define by
Then is a braid based at . It is the stacking of below : the motion runs during the first half of the height interval and the motion during the second half, after the strand of label has been joined.
(b) The endpoint permutation multiplies. , with .
(c) The operation descends to isotopy classes. If and then .
(d) The operation is associative. If is a further braid based at , then .
(e) The endpoint permutation is constant along isotopies. If then ; equivalently is constant on each braid isotopy class, so that is a function of the class alone.
Consequently the stacking of isotopy classes, , is a well-defined associative binary operation on the set of braid isotopy classes based at , with for any three braids.
Facts & Assumptions
Given: A natural number , the base configuration with and , and braids , , , , based at .
A braid based at is a tuple of continuous maps with for , , and ; its endpoint permutation is the unique permutation with for all ; the points are pairwise distinct, lie in the interior of the closed unit disc, and are listed with strictly increasing first coordinates (Geometric braids in the disc with setwise endpoints).
A braid isotopy from to is a tuple of jointly continuous maps such that each slice is a braid based at and , for all (Braid isotopy relative to the top and bottom endpoints).
Composites of continuous maps are continuous, and a function whose domain is covered by finitely many closed sets on each of which it is continuous is continuous (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous).
For closed and continuous the preimage is closed (For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and ), and the interval is connected (The connected subspaces of with its usual topology are exactly the order-convex subsets, the published characterisation transported by the identification of the two descriptions of "open in ", Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets).
The sets and are closed subsets of carrying the subspace topology, their union is , and likewise the two closed halves and of the square are closed and cover it (Intervals of : the nine order-convex forms, nondegeneracy, and length, 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).
Proof
(a) With given by the two-branch formula of the statement, the two branches agree at , because the first gives and the second gives by [F1]; both branches are composites of continuous maps with the rescalings and , hence continuous, and the two closed halves of cover , so is continuous by [L3] and [L5] and takes values in ; it is collision-free because on each half the tuple is the collision-free tuple of time-slices of a braid reparametrised by an injective continuous map and the halves meet only at ; the bottom values are , and the top values are , which run through the set ; hence is a braid based at .
Braid isotopy is transitive: given an isotopy from to and an isotopy from to , put for and for ; the branches agree at because both equal , each is jointly continuous, and the two closed halves of the square cover it, so is jointly continuous by [L3]; every slice of is a slice of or of , hence a braid based at , and the boundary slices are and , so is an isotopy from to .
(e) Let be an isotopy from to and fix ; if there is no endpoint label and the unique endpoint permutation is fixed; otherwise, for each put . The sets are pairwise disjoint and cover , since every is one of the pairwise distinct points of [F1]; each is closed in , being the preimage under the continuous map of the closed set by [L4]; each is also open in , because for for one already has ; for the distance is positive by [F1] and continuity at yields a neighbourhood of in with for , which forces and so . Hence the nonempty are pairwise disjoint nonempty clopen subsets of the connected space by [L4], and if some were nonempty and proper, its open complement would separate from it; so exactly one is all of . Thus , and with it the endpoint permutation of the braid , is independent of by [F2], and in particular .
(b) The top values computed in step 1.1 satisfy for every , so the bijection has the defining property of the endpoint permutation of in [F1]; that permutation is unique, whence .
Triple concatenations. Let and , and for let be the tuple that equals for , equals for , and equals for , where are the motions of ; the three branches agree at the break points by [F1], each is continuous, and the three closed pieces of cover , so each is continuous by [L3] and [L5]; collision-freeness and the endpoint conditions are checked exactly as in step 1.1, so is a braid based at , and reading off the two bracketings gives and , since in both the three motions occur in the order with couplings then and only the two height breaks differ.
(c) Let be an isotopy from to and an isotopy from to , and put for and for ; the two branches agree at because for every by [F1] and [F2], and step 1.3 shows that the coupling is the endpoint permutation of every braid , so no -dependent relabelling is needed; joint continuity follows from [L3] and [L5], each slice is the stacking of the braids and , hence a braid by step 1.1, and the boundary slices are and ; hence .
Moving the breaks is an isotopy. Let be continuous with , , , , , for instance the linear interpolation of the two pairs; then is jointly continuous, because the three regions , , are closed and cover the square and on each the formula is a composite of continuous maps with the positive denominators , , bounded below on the compact parameter interval; each slice is a braid by step 2.2 and the boundary slices are and , so those two braids are braid-isotopic.
(d) Steps 2.2 and 3.1 exhibit the two bracketings and of the triple as braid-isotopic representatives, and step 2.3 shows that the isotopy class of a stacking depends only on the isotopy classes of its two factors; hence for the given braids, and the induced operation on classes is associative.
Assertions (a), (b), (c), (d) and (e) are steps 1.1, 2.1, 2.3, 4.1 and 1.3, so the stacking of classes is a well-defined associative binary operation on the set of braid isotopy classes based at , and follows by applying step 2.1 twice. ∎
Remarks
- The reparametrisation used in step 3.1 is the only place where associativity needs work: the two bracketings of a threefold stack differ by how the height interval is cut, and a continuous family of cuts is an isotopy because the underlying sequence of motions, and all label couplings, are unchanged.
- Clause (e) is what makes the endpoint permutation a function of the isotopy class rather than of the representative; it is the connectedness of the height interval, through [L4], that rules out a strand ending at a different base point at the two ends of an isotopy.
- Nothing in the proposition uses a choice principle: the base configuration, and every reparametrisation, is given by an explicit formula, and the two-element cover of in step 1.1 is finite.
Depends on
- Braid isotopy relative to the top and bottom endpoints
- Geometric braids in the disc with setwise endpoints
- Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous
- For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and $f(\overline{A}) \subseteq \overline{f(A)}$
- The connected subspaces of $\mathbb{R}$ with its usual topology are exactly the order-convex subsets, the published characterisation transported by the identification of the two descriptions of "open in $\mathbb{R}$"
- Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- 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
Used by
- Setwise endpoints do not make a braid pure Counterexample
- Geometric two strand braids are integer twists Example
- The three strand geometric braid relation Example
- Every geometric braid is isotopic to a stacking of signed elementary half twists Lemma
- Far commutativity of elementary geometric half twists Lemma
- The geometric three strand braid relation Lemma
- The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism Theorem
Dependency tree · two levels
35 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Juan Gonzalez-Meneses, Basic results on braid groups, sections 1.2-1.3, printed pp. 4-5 (standard reference, not scraped)
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, section 1.1, author manuscript pp. 3-4 (standard reference, not scraped)