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 Zariski combing words alpha_i and x_i in the Artin presentation
Definition
Fix and let be the abstract braid group of The braid group by Artin presentation, the group presented by the generators and the relations
Reading convention for words. A word in this alphabet and its inverses is read first letter first: it denotes the product in , and under the published stacking convention of Stacking of geometric braids is a well-defined associative operation on isotopy classes and The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism, in which the first factor of a stacking is the upper one, its geometric image is the stacking whose first factor is the topmost layer. Here the geometric image is taken through the published surjection , of The Artin presentation surjects onto the geometric braid group. In particular the empty word is the identity of . No injectivity or completeness of is asserted, and nothing below depends on how many factors the stacking has.
The words . For put
the last being the empty word. Each is a word of length in the generators, and .
The words . For put
The two displayed words for are literally the same word written in two ways: expanding gives and expanding gives , so the middle factor sits in the same position in both readings. In particular , and is a word of length in the generators and their inverses.
These words are the Zariski combing words of the Artin presentation. The definition is choice-free, it uses no relation of the presentation, and it asserts no property of or inside any geometric braid model; all of that is established, when needed, by the items that cite this definition.
Depends on
Used by
- Combing a four-strand braid word Example
- The free-kernel words for three-strand braid combing Example
- Each combing factor reduces to a lower-rank letter or an x-letter Lemma
- Every trivial braid word combs as W₁W₂ Lemma
- Lower-rank Artin letters conjugate x-letters Lemma
- Prefix insertion rewrites a trivial braid word into combing factors Lemma
- The combed geometric decomposition is unique Lemma
- The Artin presentation is complete for geometric braids Theorem
Dependency tree · two levels
24 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 3.1, printed pp. 19-20 (standard reference, not scraped)