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.
Far commutativity of elementary geometric half twists
Statement
Let and let be the base configuration of Geometric braids in the disc with setwise endpoints, with . Let be indices with and ; then the two pairs and are disjoint, and such indices exist only for , so for the assertions below are vacuous. Write and let be the diamond path, so that the half twists , and their supports , are as in The elementary geometric half twist, its support disc, and its opposite, with .
(a) The simultaneous braid. Define , the simultaneous execution of the two half twists, by
and for the remaining labels . Then is a braid based at , and both stackings of the two half twists are braid-isotopic to it. Here denotes braid isotopy (Braid isotopy relative to the top and bottom endpoints) and the stacking of Stacking of geometric braids is a well-defined associative operation on isotopy classes:
(b) Far commutativity. Consequently in the group of The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism: far-away half twists commute.
The isotopy is explicit and no choice principle is used.
Facts & Assumptions
Given: A natural number , the base configuration , indices with and , and the half twists based at .
A braid based at is a tuple of continuous maps with for , , and ; the endpoint permutation is the unique permutation with (Geometric braids in the disc with setwise endpoints).
The half twist at is , and for , where and , , with and for every ; is a braid based at with endpoint permutation the transposition of and ; its support disc contains and no other base point, satisfies , and whenever (The elementary geometric half twist, its support disc, and its opposite).
Stacking is for and for , with ; it descends to isotopy classes and is associative, and braid isotopy is the equivalence relation generated by the jointly continuous families of Braid isotopy relative to the top and bottom endpoints (Stacking of geometric braids is a well-defined associative operation on isotopy classes).
A braid isotopy from to is a tuple of jointly continuous maps such that every slice is a braid based at and , for all (Braid isotopy relative to the top and bottom endpoints).
is a group whose operation is induced by stacking, so , and whenever (The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism, Stacking of geometric braids is a well-defined associative operation on isotopy classes).
Composites of continuous maps are continuous and continuity on the two closed halves of a square pastes, the interval and its two closed halves carrying the subspace topology (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
(a), is a braid. Each motion of is either the constant or one of , , hence continuous with values in respectively , and by [F2]; the only nonconstant pairs are , which are antipodal about and therefore distinct because for every by [F2], and , likewise antipodal about ; the two supports are disjoint and the remaining motions are the constant with , so all motions are pairwise distinct at every height; the bottom values are , and likewise for , the remaining values being the base points themselves; the top values are , and likewise for , so the top values run through and the endpoint permutation of is the product of the transpositions of and of .
The interpolation of the two time windows. For put for and for , and for , for ; the two branches of each definition agree at the switch point, so are continuous, nondecreasing and map onto with and , the map is jointly continuous because the switch points depend continuously on and the two branches agree there, and , , .
Pasting two isotopies. If is a braid isotopy from to and one from to , then for and for is jointly continuous by [L6] because the branches agree at and the two closed halves of the square cover it, every slice of is a slice of or of and hence a braid based at by [F4], and its boundary slices are and ; so braid isotopy is transitive.
The isotopy. Define for , for , for , for , and otherwise. Every is a composite of jointly continuous maps by step 1.2 and [F2], hence jointly continuous; for fixed the tuple is collision-free and takes the base values at and the setwise base values at by the same computations as in step 1.1, with in place of the identity: at one has so the four moving labels sit at , while at one has so they sit at the same four points with the two neighbouring labels interchanged.
The two ends of the isotopy. At the formulas of step 1.2 give for and for , which is the motion of run during the second half of the height interval and held at respectively during the first half, while for the labels runs during the first half and holds it at the swapped base points during the second half, and all other labels are constant; comparing with the stacking formula for , for of [F3], with , and the transposition of , shows . At one has by step 1.2 and step 2.1, so by the definitions of step 1.1.
(a), first stacking. Step 2.1 exhibits as a tuple of jointly continuous maps whose every slice is a braid based at , and step 3.1 identifies its boundary slices as and ; hence is a braid isotopy from to in the sense of [F4], that is .
(a), second stacking. Interchanging the roles of the two pairs, that is replacing by and conversely throughout steps 1.2, 2.1 and 3.1, yields in the same way a braid isotopy whose first boundary slice is , the pair now executing its half twist during the second half of the height interval and the pair during the first, and whose second boundary slice is again ; hence .
Steps 4.1 and 4.2 give , so transitivity of braid isotopy in step 1.3 yields ; passing to isotopy classes with [F5] gives , which is (b), while (a) is steps 1.1, 4.1 and 4.2. ∎
Remarks
- The only geometric input is that the two supports are disjoint: the pairs of moving labels are distinct, so the two half turns never see each other, and the two time windows can be slid past one another.
- The isotopy of step 2.1 is not a reparametrisation of the height in the sense of items 1 to 4: the two pairs are reparametrised by different functions and , and this is legitimate because each pair is unaffected by the other.
- Assertion (b) is a statement in the group of isotopy classes, not an equality of the braids and themselves; the two stackings are distinct parametrised tuples whenever , since their height windows differ.
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, section 1.5, printed pp. 7-8 (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)