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 three strand geometric braid relation
Example
Take and , so that and the base configuration is
with and , and with and for . Let be the elementary half twists (The elementary geometric half twist, its support disc, and its opposite) and set
with respect to the stacking of Stacking of geometric braids is a well-defined associative operation on isotopy classes. Write for the rotation of the plane about the origin, and let be the three-strand tuple whose -th strand is at height at the point , the strands outside being constant (here , so there are none). The example verifies:
- and are braids based at whose strand coordinates are the explicit windows displayed below, and both have endpoint permutation the transposition ;
- is a braid based at with endpoint permutation , and its strands move through the explicit positions and ;
- the linear interpolation has bottom value and top value for every , and its slices at are collision-free with the displayed values;
consequently, by the isotopies exhibited in The geometric three strand braid relation, the two words are braid-isotopic and
holds in .
Facts & Assumptions
Given: The natural number , the index , the base configuration with , the half twists based at , and the words and .
For and one has ; the proof exhibits the intermediate braid , the rotation of about by the angle at height with the remaining strands fixed, and shows that the bracketing is braid-isotopic to , which is a braid based at with endpoint permutation the transposition of and , while the point reflection followed by the relabelling of and turns that bracketing into , so that bracketing is braid-isotopic to as well (The geometric three strand braid relation).
The base points are , here , , ; the half twist at is , and otherwise, where and the diamond path satisfies , , ; is the transposition of and ; stacking places the right factor below: for and for , with and in (Geometric braids in the disc with setwise endpoints, The elementary geometric half twist, its support disc, and its opposite, Stacking of geometric braids is a well-defined associative operation on isotopy classes, The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism).
A braid based at is a tuple of continuous maps with pairwise distinct values, and , its endpoint permutation being the unique with ; a braid isotopy is a jointly continuous family whose every slice is such a braid and whose boundary slices are the two given braids; the group is written in cycle notation with (Geometric braids in the disc with setwise endpoints, Braid isotopy relative to the top and bottom endpoints, The finite symmetric group , one-line notation, and cycle notation).
, , , , , , and for every real ; hence is the identity, , and for all (The derivatives of sine and cosine are cosine and minus sine, Quarter-turn values and shifts by pi/2 and pi, Parity and the Pythagorean identity for sine and cosine, The -norms for rational , and ).
Sums, scalar multiples and composites of continuous maps are continuous, and a function on the interval whose restrictions to the finitely many closed pieces , , are continuous is continuous; the same pasting applies in the isotopy parameter (Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function, 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).
Verification
The explicit strand windows of the two words. Applying the stacking formula of [F2] twice, with , and the transposition couplings , , gives for the strands for , for and for , and for the strands for , for and for . The two windows of agree at , where the first gives and the second gives , and at , where the second gives and the third gives ; the same two checks apply verbatim to the three windows of , so by [F5] the formulas define continuous tuples , and each value of each of the six windows is one of or one of .
The rotation braid. By [F4] the motion is continuous for each and satisfies at and at , so the strands of run from to , that is from to ; at height the three positions are , whose mutual distances are those of the distinct points because preserves the norm and is linear and injective; and every value lies in , since ; hence is a braid based at with endpoint permutation .
Collision bounds for the windows. For the diamond path satisfies for and for ; the first is with equality at and the second is with equality at , and both are . Hence in each window the two moving strands, which are and (or and ), are separated by , and the frozen base point of that window, namely in the first and third windows and in the second, is at distance exactly from that window's midpoint and therefore at distance at least from each moving point; moreover every window value has norm at most , so all values lie in . Consequently each of the two window tuples is a collision-free tuple, and together with steps 1.1 and 1.2 this shows that and are braids based at .
The endpoint permutations. By [F2] and step 1.1, and ; evaluating the first composite, , at gives , and , that is the transposition , and evaluating the second, , at gives , and , which is again ; the same conclusion is read off at , where the windows of step 1.1 give for both words.
The interpolation and its values at sample heights. Put for , a jointly continuous map by [F5] and step 1.1; for the collision equation with is equivalent, by the linearity of , the identities and , to the statement that is a positive multiple of . At the three strand positions of are , whose differences are negative multiples of , so no collision occurs for , and ; at the positions of are , whose differences are horizontal and nonzero while is vertical, so no collision occurs, and ; at the positions of are , whose differences are positive multiples of while , so no collision occurs, and for every .
Conclusion. By [F1] the bracketing is braid-isotopic to , and the reflection followed by the relabelling of and turns into , so is braid-isotopic to as well; step 1.2 identifies as a braid based at , and step 2.2 gives ; step 2.3 exhibits the explicit intermediate values of the deformation, and steps 2.1 and 1.1 record the numerical facts and behind its collision-freeness. Hence and, passing to isotopy classes in the group of [F2], . ∎
Remarks
- The numbers are the smallest case of the relation: with the three base points are on the horizontal axis, so the local picture of the lemma is the picture of three points spaced apart, and the whole isotopy happens inside the closed ball of radius around the middle point, well inside .
- The rotation is the geometric meaning of the relation: performing the three half twists on the outer pair and the middle pair alternately is the same as rotating the three-point configuration rigidly by the angle , and the point reflection in the middle point exchanges the two outer strands, which is why the two words have the same endpoint permutation .
Depends on
- The geometric three strand braid relation
- The elementary geometric half twist, its support disc, and its opposite
- 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
- Geometric braids in the disc with setwise endpoints
- Braid isotopy relative to the top and bottom endpoints
- The finite symmetric group $S_n$, one-line notation, and cycle notation
- Quarter-turn values and shifts by pi/2 and pi
- The derivatives of sine and cosine are cosine and minus sine
- Parity and the Pythagorean identity for sine and cosine
- The $p$-norms $\lVert x\rVert_p$ for rational $p \ge 1$, and $\lVert x\rVert_\infty$
- Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous
- Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function
- Continuity of a map of topological spaces at a point and globally
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- The product set $\prod_{i \in I} X_i$ 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
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
74 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)