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.
The geometric three strand braid relation
Statement
Let and let be an index with . Let and be the elementary half twists of The elementary geometric half twist, its support disc, and its opposite based at , and let be the stacking of Stacking of geometric braids is a well-defined associative operation on isotopy classes. Then
and consequently, in the group of The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism,
The proof exhibits an explicit intermediate braid: writing for the point reflection and for the rotation of the three points about by the angle at height , with the remaining strands fixed, the bracketing is braid-isotopic to , which is a braid based at with endpoint permutation the transposition of and , and the reflection , followed by the relabelling of and , turns that bracketing into , so that bracketing is braid-isotopic to as well; the two bracketings of each word are themselves braid-isotopic by the associativity of stacking. All constructions are explicit and no choice principle is used.
Facts & Assumptions
Given: A natural number , an index with , the base configuration with and , and the half twists based at .
A braid based at is a tuple of continuous maps with for , , and ; its endpoint permutation is the unique permutation with ; the points are collinear and equally spaced, so in the coordinates centred at they are , and for every (Geometric braids in the disc with setwise endpoints).
The half twist at is , and otherwise, where ; the diamond path satisfies , , , , and with only for and for every ; and is the transposition of and , while the support disc contains and no other base point (The elementary geometric half twist, its support disc, and its opposite).
A braid isotopy is a tuple of jointly continuous maps whose every slice is a braid based at and whose boundary slices are the two given braids (Braid isotopy relative to the top and bottom endpoints).
Stacking places its right factor in the lower half of the height interval and its left factor in the upper half: writing for the strands of the right factor and for those of the left factor , one has for and for ; stacking of braids is a braid, it descends to isotopy classes, , and the two bracketings of a threefold stacking are braid-isotopic, (Stacking of geometric braids is a well-defined associative operation on isotopy classes).
is a group with operation , so equal isotopy classes have equal products (The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism).
Composites of continuous maps are continuous and continuity pastes over the two closed halves of a square; the interval carries the subspace topology in which the points cut it into closed pieces (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous, Continuity of a map of topological spaces at a point and globally, Intervals of : the nine order-convex forms, nondegeneracy, and length).
Proof
(The two bracketings, in local coordinates.) Put , , , , and , so that the centred vectors , , , while and ; since is the transposition of and that of by [F2] and multiplies by [F4], the composite is the 3-cycle and is its inverse , so applying the stacking formula of [F4] twice shows that the strands of are for , for and for , while the same computation with the roles of and interchanged shows that the strands of are for , for and for , every remaining strand of either tuple being constantly at its base point; hence and are braids based at by [F4], with and , both the transposition of and , and by the associativity clause of [F4] is braid-isotopic to and to .
(The rotation braid.) Let be the linear rotation of about the origin through angle , and define and for ; put for all other labels. The motions are continuous, the two outer centred vectors are antipodal because , and , so the middle strand stays at and all three remain pairwise distinct. Their distance from the origin is at most ; every other base point is at distance at least from by [F1], so no moving strand meets a constant one. At the triple has values , and at it has values ; thus is based at and has endpoint permutation , shared by and .
(The interpolation family.) For define for every label , where and are the motions of step 1.1 and step 1.2; each is jointly continuous, being a sum of products of continuous functions, and satisfies , so it maps into ; at one has for every because , and at one has for every because for the transposition of and shared by both braids; so each slice satisfies the endpoint conditions of [F1].
(The collision criterion.) Fix and and let be two labels of the triple ; since by step 1.2 and with by [F1], the equality is equivalent to , hence to the statement that is a positive multiple of ; so a slice with has no collision between two labels of the triple as soon as no difference with in the triple is a positive multiple of at any height .
(Phase one: , .) In this and the next two phase calculations, a subscript on denotes the local position in the active triple, namely the global strand ; all other strands remain fixed. Here has second coordinate , while and have first coordinate at most ; since and on this phase, a positive multiple of has positive first coordinate, which excludes the pairs and , while for the pair the second coordinates would have to agree, forcing and hence , that is ; at one has , a negative multiple of , and at one has , which is not a multiple of at all.
(Phase two: , .) Here respectively according to whether or , and respectively ; all three have second coordinate at most , while on this phase, so no one of them is a positive multiple of , whose second coordinate is positive.
(Phase three: , .) Here and have first coordinate at least , while on this phase, so neither is a positive multiple of ; the remaining difference has second coordinate at most , and a positive multiple of has second coordinate because on this phase, so a coincidence would force the common second coordinate to vanish, that is and , which gives and ; with this leaves the two candidates , where is not a multiple of , and , where is a negative multiple of rather than a positive one.
(The isotopy from to .) By steps 2.2, 2.3, 2.4 and 2.5 no two labels of the triple can meet in any slice with and any height , and at the slice is and at it is , which are braids with pairwise distinct strands by steps 1.1 and 1.2; the triple values and all lie within distance of by steps 1.1 and 1.2 and [F2], so puts every triple strand of every slice in the ball of radius about , while the remaining strands are constantly at base points of distance at least from by [F1], so no triple strand ever meets one of them; with the endpoint computations of step 2.1 this makes a braid isotopy from to in the sense of [F3].
(The reflection.) Let be the point reflection in and let be the transposition of and ; for put and for the remaining labels; each is jointly continuous and, by step 3.1 and , every value lies within distance of and hence in , because as in step 1.2; within the triple is injective, so distinct reflected strands stay distinct, and they stay within distance of and hence at distance at least from the constant strands, which are at distance at least from by [F1]; so every slice is a braid based at ; at one has , because for the three points , whose labelling by only exchanges the two outer centred vectors and satisfies ; at the reflected slice is , because the reflection identities , , and turn the window values of of step 1.1 into those of : on the reflected values are , on they are and on they are , which are exactly the window values of ; hence is a braid isotopy from to .
(Conclusion.) Steps 3.1 and 4.1 show that and are both braid-isotopic to , hence braid-isotopic to each other; step 1.1 identifies as the bracketing and as the bracketing , and the associativity clause of [F4] shows that each is braid-isotopic to the corresponding word with the other bracketing, so that ; passing to isotopy classes with [F5] gives in . ∎
Remarks
- The proof is local: only the three strands move, and all formulas are those of the three-strand picture with base points spaced apart, which is why the lemma holds for every and every with .
- The moving strands stay within distance of throughout the interpolation and the reflection, while every other base point is at distance at least from ; this clearance is what makes the local computation an isotopy of -strand braids.
- The braid relation is the geometric statement that three consecutive half twists of a triple can be deformed into the same three half twists performed by rotating the triple rigidly by about its middle point; the point reflection in that middle point exchanges the two outer strands and turns one word into the other.
- The bracketing enters the formulas but not the conclusion: the proof computes the bracketings and , and the associativity clause of Stacking of geometric braids is a well-defined associative operation on isotopy classes supplies the isotopy to the bracketings and .
Depends on
- The elementary geometric half twist, its support disc, and its opposite
- Geometric braids in the disc with setwise endpoints
- Braid isotopy relative to the top and bottom endpoints
- Stacking of geometric braids is a well-defined associative operation on isotopy classes
- The isotopy classes of geometric braids based at $Q$ form a group, and the endpoint permutation is a homomorphism
- Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous
- Continuity of a map of topological spaces at a point and globally
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
Used by
Dependency tree · two levels
25 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.5 and 3.2, printed pp. 7-8 and 23-26 (standard reference, not scraped)
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, section 1.2, author manuscript pp. 5-6 (standard reference, not scraped)