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 simple braids and divisibility lattice for b three
Example
Take , so that has the two atoms and the half twist of length . The example verifies:
- the six simple braids of are , with the six distinct endpoint permutations ;
- while ;
- for and one has but ;
- consequently the left and the right divisibility orders on are different, even though by Simple positive braids are indexed by permutations the two orders have the same divisor set on .
Facts & Assumptions
Given: The natural number , the monoid with atoms , half twist of length , and the elements , .
is generated by the atoms, is additive and only for ; the orders are and for some , with length monotone, so a proper divisor of an atom or of or letters has strictly smaller length (Positive braid monoid, Positive artin relations preserve homogeneous length, Left and right divisibility for positive braids).
by the braid relation, and the simple braids — the left divisors of — are in bijection with : they are exactly , , , , , (Simple positive braids are indexed by permutations, The Garside half twist and simple positive braids).
The homomorphism sends to and products to products; , , , , in the composition convention of The symmetric group : the bijections of a set under composition (Reduced adjacent-transposition words have well-defined positive lifts).
For adjacent atoms, is the least common left multiple and also the least common right multiple, and exists and is unique; more generally every nonempty finite subset of has unique left and right gcds and lcms (Artin atoms have explicit left and right lcms and complements, Positive braids have left and right gcds and lcms).
Verification
The six simple braids and their permutations. By [F2] there are exactly simple braids. Applying [F3] to the six displayed elements gives the images , , , , and in this order; these are the six elements of , so they are pairwise distinct, and since is a function the six braids are pairwise distinct and exhaust the left divisors of . In particular and are proper simple braids, because and by [F2].
The atom pair . The left divisors of are and , since a divisor of has , so either or is an atom equal to ; the same holds for , and the distinct atoms are incomparable, so the common left divisors of and are just : thus . Their least common left multiple is by [F4], which is by [F2], so .
A pair with different left and right meets. For and : left-divides trivially and left-divides , so is a common left divisor; every common left divisor of and divides , hence is or , so : therefore . On the right: the right divisors of are and by [F1], while the right divisors of are — indeed if then ; for one has , so and ; for the element is an atom, and then has length and is an atom as well, so must be a product of two atoms, the four candidates being , which are distinct because every defining relation has length three; only occurs, so the only one-letter right divisor is . Hence the common right divisors of and are , and .
Conclusion. Steps 1.1--1.3 give the six simple braids, , , and the pair with . So already on the four-element subfamily the two orders have different meets, even though on itself the left and right divisor sets coincide by [F2]; the balancedness established in Delta is the lcm of the artin atoms and has the same left and right divisors is therefore a property of and does not identify the two orders. No choice principle is used. ∎
Remarks
- Reading the six permutations. In the convention of The symmetric group : the bijections of a set under composition the product acts with the right factor first, so maps to and to the inverse cycle : the order of the two words is visible in the orientation of the -cycle, and this is what separates the two length-two simple braids.
- Why the right meet is the smaller one here. The right divisors of are its suffixes , while those of are ; the overlap is trivial even though the overlap of the corresponding prefix sets is . This is the smallest instance of the asymmetry between the two orders.
- No choice principle is used; all computations are finite word computations.
Depends on
- Simple positive braids are indexed by permutations
- Delta is the lcm of the artin atoms and has the same left and right divisors
- Positive braids have left and right gcds and lcms
- Artin atoms have explicit left and right lcms and complements
- Reduced adjacent-transposition words have well-defined positive lifts
- The Garside half twist and simple positive braids
- Left and right divisibility for positive braids
- Positive artin relations preserve homogeneous length
- Positive braid monoid
- The symmetric group $\operatorname{Sym}(X)$: the bijections of a set $X$ under composition
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
29 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
- J. Gonzalez-Meneses, Basic results on braid groups, Section 4, printed pp. 26-29 (standard reference, not scraped)
- J. Birman and T. Brendle, Braids: A Survey, Section 5.1 (standard reference, not scraped)