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 elementary geometric half twist, its support disc, and its opposite
Definition
Let and let be the base configuration of Geometric braids in the disc with setwise endpoints, with and . Fix an index with . The two adjacent base points are
their midpoint is , and their support disc is the open disc
The support disc contains the two base points , whose distance from is , and it contains no other base point: for one has and for one has , both exceeding . Moreover , because every point of has norm at most . Finally whenever , since then the midpoints are at distance , twice the radius.
The positive half twist. Define , the anticlockwise diamond path, by
Thus , , , and is continuous, piecewise linear, and satisfies for all with throughout. The elementary half twist at , written , is the tuple of motions
It is a braid based at (Geometric braids in the disc with setwise endpoints, Continuity of a map of topological spaces at a point and globally): the two moving points stay in and are antipodal about , so they are distinct; every other point is fixed and lies outside ; and the endpoint permutation is the transposition of and , since and .
The words positive and anticlockwise refer to the fixed orientation of the plane of the disc and to the fixed planar projection whose horizontal axis contains : the moving pair turns through the half turn anticlockwise, the label passing below its midpoint and the label above. Together with the first-under-second stacking convention of Stacking of geometric braids is a well-defined associative operation on isotopy classes this fixes the sign convention for every signed crossing on this page and its companion.
The opposite half twist. The opposite (clockwise) half twist at is defined by the reflected path
through the motions , and for . It is again a braid supported in with endpoint permutation the transposition of and ; its pair turns through the same half turn clockwise, the label passing above the midpoint. The two motions are not equal, and they are not related by a reparametrisation of the height: they are the two signed crossings of the pair.
The opposite motion is the group inverse. For a braid the reversed braid represents in the group (The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism). For one computes : reversing the height and relabelling by the transposition of and sends to the motion with relative path , which is the reflected path traversed from to . Hence
Elementary cases. For there is no index with , and there are no elementary half twists; the assertions above are vacuous. For and both and are nonidentity elements of , since their endpoint permutations are transpositions, which are not the identity permutation.
Two letters do not commute in general. For adjacent indices the supports and overlap and no commutation is asserted; Far commutativity of elementary geometric half twists proves commutativity only for disjoint supports.
Depends on
- Geometric braids in the disc with setwise endpoints
- The isotopy classes of geometric braids based at $Q$ form a group, and the endpoint permutation is a homomorphism
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Continuity of a map of topological spaces at a point and globally
- Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous
Used by
- All four classical braid models realize the Artin presentation Corollary
- An exchange closes only after forgetting labels Counterexample
- Setwise boundary preservation kills a nontrivial braid Counterexample
- Setwise endpoints do not make a braid pure Counterexample
- Setwise puncture preservation does not imply purity Counterexample
- Basic arcs, admissible curves and the standard normal form Definition
- Markov conjugation and stabilization moves Definition
- Oriented crossing signs, diagram writhe, and blackboard framing Definition
- Standard geometric pure braid generators Aᵢⱼ Definition
- A half-circle configuration loop traces an elementary half twist Example
- A pure two-strand full twist as an ordered loop Example
- A supported half-twist homeomorphism Example
- A trefoil Jones–Vassiliev coefficient calculation Example
- Geometric two strand braids are integer twists Example
- Hopf and Whitehead link linking-number computations Example
- PB₃ as F₂ by ℤ, with its section action Example
- Point pushing one puncture around another Example
- Standard Aᵢⱼ as point pushes after relabeling Example
- The three strand geometric braid relation Example
- The Yamada-Vogel algorithm on a small diagram Example
- Torus links as closures of two-strand braids Example
- Trefoil and figure-eight Jones spans Example
- Trefoil, mirror, and unknot bracket calculations Example
- Unknot, trivial color, and a three-crossing braid value Example
- Worked Seifert-algorithm counts for the trefoil, figure-eight, and kinked unknot Example
- A height-zero diagram represents a closed braid Lemma
- A nontrivial five-strand braid lies in the Burau kernel Lemma
- Bracket smoothings of positive and negative braid crossings Lemma
- Curve complexes intertwine the braid generators Lemma
- Every geometric braid is isotopic to a stacking of signed elementary half twists Lemma
- Far commutativity of elementary geometric half twists Lemma
- Group presentation for positive trefoil +1 surgery Lemma
- Hecke–bracket trace dictionary and local descent Lemma
- Markov moves preserve the oriented closure up to isotopy Lemma
- Prefix insertion rewrites a trivial braid word into combing factors Lemma
- Reducing-move peaks can be lowered to the four-band case Lemma
- The Aᵢₙ are meridian generators of the forgetful free kernel Lemma
- The combed geometric decomposition is unique Lemma
- The four-band case is a Markov sequence Lemma
- The geometric half twist acts on the lifted-edge basis by the Burau block Lemma
…and 8 more results.
Dependency tree · two levels
22 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, Figure 2 (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)