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.
Two distributive right weak intervals of fully commutative elements in type
Example
Let with and (type ), let be the presented group, and let be the right weak order (The right and left weak orders, intervals, covers, and meets and joins of subsets).
(1) A Boolean interval. For the heap is the two-element antichain with labels ; its order ideals are the four subsets of , forming a Boolean lattice, and the right weak interval is a four-element distributive lattice, with and . The map of The right weak order interval below a fully commutative element is the lattice of order ideals of its heap sends to .
(2) A five-element interval. For the heap is the V-shaped poset with relations and , whose five order ideals are . The right weak interval consists of the five elements , and it is a distributive lattice isomorphic to : the three elements are exactly the products of the nonempty proper ideals , while is the product of . Here , , and , in agreement with intersection and union of the corresponding ideals.
(3) Both intervals are finite and distributive, illustrating The right weak order interval below a fully commutative element is the lattice of order ideals of its heap (2)-(3); the first has a non-chain heap while the second's heap is not a chain either, so the distributivity is not merely the chain case.
Facts & Assumptions
Given: The Coxeter matrix of type on , the presented group , the right weak order , the elements and , and the heaps .
The heap of a word and its labeled linear extensions are as in Words, heaps, linear extensions, commutation classes, and fully commutative elements (clauses (2) and (4)); means that and commute and that the defining relation has no generator between positions with these labels; in this two-position word there is no intermediate position, so no transitive heap path relates them (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
For every word one has , the commutativity class of (Labeled linear extensions of a heap are exactly the words in its commutativity class, and heaps classify commutativity classes, clause (1)).
If a word has heap and product , and conditions (a) and (b) of the heap criterion hold (no convex alternating chain of length and no covering pair with equal labels), then the word is reduced, is fully commutative and (Fully commutative elements: the braid-factor criterion and the forbidden-chain heap criterion, clause (2)).
For a fully commutative with reduced word and heap : the map sends to the ideal determined by any reduced word of , with , , ; it is an order isomorphism ; and is a finite distributive lattice in which meets and joins satisfy and (The right weak order interval below a fully commutative element is the lattice of order ideals of its heap, clauses (1)-(3)).
For every one has , and distinct generators are distinct in (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action, clauses (1) and (4)).
if and only if some reduced expression of has a reduced expression of as initial segment (The length identity, the prefix property, left translation, and interval translation for weak order, clause (2)).
Verification
Given: The type Coxeter matrix, the right weak order, and the words and .
Proof technique: direct.
The data for . The word has heap on positions : positions carry with and positions carry with , so and ; positions carry the distinct commuting letters with , so there is no generating relation between them; because positions are consecutive in the original word and every generating edge increases the position, no intermediate position can lie on a path between them, so no transitive path relates them. Both heap-criterion conditions hold: every chain of has at most two elements, so there is no convex alternating chain of length , and the covering pairs , have distinct labels and ; by [F3] the word is reduced, is fully commutative and is the heap of , with . The linear extensions of are and , since both relations force position last; their labeled words are and , so by [F2] and [F3]. The order ideals are the subsets with , namely .
The data for . The word has heap on positions with labels : since and the labels are distinct, no generating relation links the two positions, so is the two-element antichain and it has no covering pairs. Conditions (a) and (b) of [F3] hold vacuously (there is no chain of length , and no covering pair at all), so the word is reduced, is fully commutative with heap and . By [F2] its reduced words are the words read from the two linear extensions , of , namely . The order ideals of the antichain are all four subsets of .
The interval . By [F4] the map is an order isomorphism , so has exactly elements and is a finite distributive lattice with meet and join given by intersection and union of ideals. By [F6] the products of the prefixes of the reduced words and , namely and , lie in ; they are pairwise distinct because their lengths are and by [F5]; hence they exhaust the four-element interval and . For the ideal map: and by [F5] and 1.2, so and ; computing with the reduced words , and gives , and , while by [F4]. Hence is the element with ideal , namely , and is the element with ideal , namely .
The interval . By [F4] the map is a bijection , so has exactly five elements by 1.1, and it is a finite distributive lattice with meets and joins given by intersection and union of ideals. By [F6], the prefixes of the two reduced words and of 1.1 show that all five displayed elements lie in . Their ideals are computed as follows: and by [F4]; and, using the chains , , of , the reduced words and give and , while the reduced word of 1.2 gives ; its prefixes are those of the reduced word of , so that by [F6]. Their images are the five distinct elements of , so and each displayed element is the product of the ideal that is its image. In particular has ideal , so ; has ideal , so ; and has ideal , so .
Both intervals are finite distributive lattices by 2.1 and 2.2, illustrating F4-(3). Their heaps are the two-element antichain of 1.2 and the V-shaped poset of 1.1; the first is not a chain because its two elements are incomparable, and the second is not a chain because and are incomparable in . So the distributivity exhibited here is not the chain case.
Depends on
- Words, heaps, linear extensions, commutation classes, and fully commutative elements
- Labeled linear extensions of a heap are exactly the words in its commutativity class, and heaps classify commutativity classes
- The right weak order interval below a fully commutative element is the lattice of order ideals of its heap
- Fully commutative elements: the braid-factor criterion and the forbidden-chain heap criterion
- The length identity, the prefix property, left translation, and interval translation for weak order
- The right and left weak orders, intervals, covers, and meets and joins of subsets
- Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
41 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. R. Stembridge, On the Fully Commutative Elements of Coxeter Groups, author manuscript (March 1995, minor revisions September 1995); published in J. Algebraic Combin. 5 (1996), 353-385 (standard reference, not scraped)
- C. Krattenthaler, The theory of heaps and the Cartier-Foata monoid, appendix to the electronic reedition of P. Cartier and D. Foata, Problemes combinatoires de commutation et rearrangements (2006) (standard reference, not scraped)