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 Artin presentation is complete for geometric braids
Statement
Assume AC. For every the published surjection of The Artin presentation surjects onto the geometric braid group is an isomorphism. Equivalently, every word in whose geometric braid is trivial is equivalent to the empty word using only the two Artin relations and free insertions and deletions of adjacent inverse pairs, so that the Artin presentation of The braid group by Artin presentation is a presentation of the geometric braid group.
Facts & Assumptions
Given: A natural number ; the abstract Artin group of The braid group by Artin presentation, trivial for ; the geometric braid group of The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism; and the surjective homomorphism of The Artin presentation surjects onto the geometric braid group, which sends the abstract letter to the class of the elementary geometric half twist.
Permitted moves. Two words in the letters are called equivalent when one can be obtained from the other by a finite sequence of the following operations: replacing a subword by or conversely; replacing a subword by or conversely when ; and inserting or deleting a subword . Equivalence is an equivalence relation compatible with concatenation, and equivalent words represent the same element of and, through , the same geometric braid. (The braid group by Artin presentation, Group presentation by generators and relations.)
Combing. Assume and let be a word in whose image under is the trivial geometric braid. Then is equivalent, by the permitted moves of [F1], to a product in which is a word in and is a word in , where are the combing words of The Zariski combing words and in the Artin presentation (Every trivial braid word combs as ).
Uniqueness. Assume AC, , and that is a word in and a word in with . Then , the word reduces to the empty word by free cancellations of adjacent inverse pairs , each of which expands into permitted deletions of -pairs; and , where is the rank surjection applied to the same word read on strands (The combed geometric decomposition is unique).
AC holds, and AC implies dependent choice and countable choice (The Axiom of Choice, AC implies DC implies countable choice); this is the hypothesis under which [F3] is available. The free kernel of the forgetting map is free with basis for the standard pure braid generators of Standard geometric pure braid generators (The are meridian generators of the forgetful free kernel, The Fadell-Neuwirth short exact sequence for pure braids), and is the canonical isomorphism at every rank (Pure geometric braids and ordered configuration loops).
Proof
Base case. For there is no index with , so the only word in the displayed alphabet is the empty word, and it is equivalent to itself by the empty sequence of permitted moves; the claim holds at .
Induction step. Assume , that the claim holds at rank , and let be a word in with . By [F2] the word is equivalent to a product with in the -letters and in the lower-rank letters ; since equivalence is compatible with concatenation and does not change the geometric braid, . By [F3] applied to the pair , the word reduces to the empty word by free cancellations of adjacent inverse -pairs, each of which expands into permitted deletions of -pairs, so is equivalent to the empty word by the moves of [F1]; and . The word lies in the alphabet of the rank presentation, so the induction hypothesis applies to it: is equivalent to the empty word using the rank moves. Every rank move is also a permitted rank move of [F1], because the generators with the braid and far-commutation relations among them are part of the rank presentation, and the intermediate free insertions and deletions are the same operation. Hence , so the claim holds at rank .
Conclusion. By steps 1.1 and 2.1, for every each word in whose image under is trivial is equivalent to the empty word; since equivalent words represent the same element of , the kernel of is trivial. The published proposition gives that is surjective, so is an isomorphism of groups. ∎
Remarks
- The first nontrivial rank is : there the free kernel of the forgetting map is all of , freely generated by the single standard generator by The are meridian generators of the forgetful free kernel, and with the empty product; the uniqueness clause of [F3] therefore has content already at , where it says that a word in with trivial geometric image is freely trivial.
- No injectivity of any Artin presentation is assumed anywhere: the induction reduces words in the kernel to the empty word, and injectivity is a conclusion. The only use of AC is through [F3], whose suppliers invoke dependent and countable choice.
Depends on
- Every trivial braid word combs as $W_1W_2$
- The combed geometric decomposition is unique
- The Artin presentation surjects onto the geometric braid group
- The braid group by Artin presentation
- Group presentation by generators and relations
- Standard geometric pure braid generators $A_{ij}$
- The $A_{in}$ are meridian generators of the forgetful free kernel
- The Fadell-Neuwirth short exact sequence for pure braids
- Pure geometric braids and ordered configuration loops
- The Zariski combing words $\alpha_i$ and $x_i$ in the Artin presentation
- The Axiom of Choice
- AC implies DC implies countable choice
Used by
- All four classical braid models realize the Artin presentation Corollary
- Visible Artin relations alone do not prove presentation completeness Counterexample
- Basic arcs, admissible curves and the standard normal form Definition
- The reduced Burau representation Definition
- The Z² cover of the projectivized tangent bundle and bigraded curves Definition
- Unknot, trivial color, and a three-crossing braid value Example
- Braid mapping classes lift equivariantly to the Burau cover Lemma
- Braid-isotopic closed braids are conjugate Lemma
- Reducing-move peaks can be lowered to the four-band case 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
- Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares Lemma
- The Artin representation is faithful Theorem
- The topological and matrix Burau representations agree Theorem
Dependency tree · two levels
66 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-22 (standard reference, not scraped)