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.
Lower-rank Artin letters conjugate x-letters
Statement
Assume , let and , and work in the group of The braid group by Artin presentation with the words and of The Zariski combing words and in the Artin presentation. Using only the two families of defining relations and free insertions and deletions of adjacent inverse letters:
(i) equals when or , equals when , and equals when ;
(ii) equals when or , equals when , and equals when .
Consequently, for every pair of signs there is a word in the letters with so that in any word over the mixed alphabet each occurrence of a lower-rank -letter can be moved to the right of every -letter, the -letters changing only by further -letters and their inverses. All identities also hold in the geometric braid group under the published surjection of The Artin presentation surjects onto the geometric braid group.
Facts & Assumptions
Given: Integers , , , the group of The braid group by Artin presentation, and the elements of The Zariski combing words and in the Artin presentation.
In the two defining families of relations hold: for , and whenever ; words equal in the free group on and their inverses represent the same element of , so adjacent inverse letters may be freely inserted and deleted (The braid group by Artin presentation, The Zariski combing words and in the Artin presentation).
For every with one has the two displayed words , and ; also for and (The Zariski combing words and in the Artin presentation).
The map of The Artin presentation surjects onto the geometric braid group is a homomorphism with , and in the geometric braid group the two families of relations of [F1] hold: and for (The geometric three strand braid relation, Far commutativity of elementary geometric half twists).
Proof
Two mixed forms of the braid relation. Let . Multiplying on the left by and on the right by gives and multiplying the braid relation on the left by and on the right by gives , whose inverse is Both are consequences of the defining relations of [F1] alone.
The case . Every letter occurring in the displayed word for of [F2] has , so and commutes with that letter by the far-commutation relation of [F1]; repeating this letter by letter, commutes with the whole word, so . In particular both assertions (i) and (ii) hold for .
The case : sliding past . Decompose the word of [F2] for at the index , which satisfies , as where each of , , may be empty and the displayed equality is free cancellation in the two words of [F2]. Since commutes with every letter of except , and by step 1.1, one has ; since commutes with every letter of (all its indices are at most ), and since with , the computation uses only far commutation, the braid relation, and the fact that commutes with every letter of . Left-multiplying by gives , and right-multiplying by gives ; both assertions hold for .
The case . Put and , so that as words and, by [F2], Since commutes with every letter of and of , and using step 1.1, Expanding the product with the three displayed words and using and gives so .
The case . With the same words of step 2.2, [F2] gives , and commutes with every letter of and of , so Inverting the first identity of step 1.1 gives , and the defining braid relation gives ; substituting, the penultimate equality deleting the adjacent inverse pairs and the last equality being [F2] again.
The second orientation for and . The map , , is the conjugation automorphism by , with inverse . Steps 2.2 and 3.1 give and , hence ; therefore , that is , and , that is . This is assertion (ii) in the two remaining cases.
All four signs. Let . If , then ; by steps 1.2, 2.1, 2.2, 3.1 and 4.1 the middle factor equals (for or ), or , , , (for or , according to the sign of ), so in every case it is a word in . If , then , and the same case list applies with the inverse word. Hence for all signs with a word in the -letters and their inverses, and a leftmost occurrence of in any mixed word can therefore be moved one -letter at a time to the right of all -letters, only -letters changing.
Transfer to the geometric braid group. Since is a homomorphism with by [F3], and since the relations used in steps 1.1-5.1 are exactly the two families of [F1], applying to each identity yields the corresponding identity in between and : the images satisfy the braid relation and far commutation by the published geometric lemmas, and the free cancellations map to cancellations in the group .
Assertion (i) is steps 1.2, 2.1, 2.2 and 3.1, assertion (ii) is steps 1.2, 2.1 and 4.1, the collection statement is step 5.1, and the geometric transfer is step 6.1. ∎
Depends on
Used by
Dependency tree · two levels
20 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. 20-21 (standard reference, not scraped)