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 right weak interval below the longest element of is not distributive
Example
Let with (type ), let be the presented group, let , and let be the right weak order (The right and left weak orders, intervals, covers, and meets and joins of subsets).
(1) , with cover relations , , , , , ; the middle elements and are incomparable, and so are and .
(2) The subposet is a pentagon: and , with incomparable to .
(3) is not distributive: with , and one has (the only common upper bound of and ), hence while and .
(4) The element is not fully commutative, since the reduced word contains the contiguous braid factor ; so this interval is a non-distributive weak interval below a non-fully-commutative element. The example does not prove the converse of The right weak order interval below a fully commutative element is the lattice of order ideals of its heap; it verifies non-distributivity of this single interval directly.
Facts & Assumptions
Given: The Coxeter matrix of type on , the presented group , the right weak order and the element .
The right weak order is defined by if and only if with ; intervals, covers and meets and joins of subsets are defined by their universal properties (The right and left weak orders, intervals, covers, and meets and joins of subsets, clauses (1)-(3)); the relators of the presentation are and (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
For all one has , so forces ; and 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, clauses (1)-(2)).
Covers in are exactly the pairs with and (Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion, clause (2)).
The subgroup is dihedral of order , any two reduced expressions of the same element are braid-equivalent, every element has a reduced expression with letters in , and the alternating words of length are reduced (Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups, clauses (1) and (3)).
An element is fully commutative if and only if no reduced word of it contains as a contiguous factor for any distinct with (Fully commutative elements: the braid-factor criterion and the forbidden-chain heap criterion, clause (1)).
A lattice is distributive when the distributive identity holds for all (Lattices, distributive lattices, and order ideals).
The interval theorem identifies only right weak intervals of fully commutative elements with lattices of order ideals; no claim is made about elements that are not fully commutative (The right weak order interval below a fully commutative element is the lattice of order ideals of its heap, clause (4)).
Verification
The group and its elements. Since , the subgroup is all of , so by [F4] is dihedral of order ; its elements are the six distinct elements and for . With from the relator of [F1] these are , , , , and ; hence and, since the displayed words are the reduced expressions by [F4], the lengths are respectively, in particular . The reduced words of are exactly and : both are reduced of length and represent by the braid relation of [F1], and by F4 every reduced word of is braid-equivalent to , while the only braid move applicable to a length-three word in the two letters replaces the whole alternating word by the other.
The interval and the covers. By the prefix property F2, the elements of are the products of the prefixes of the reduced words and of established in step 1.1, namely and ; these are all six elements of by 1.1, so . By [F3] every cover in is of the form with and ; running over the six elements and the two generators and using the length table of 1.1, the products with length increase one are exactly , , , , and , while , and the products (of length ) do not raise the length. Hence these six pairs are exactly the covers. The elements and are distinct of equal length , so neither is below the other by the strict length increase in F2, and they are incomparable; likewise and by length, while would force by F2, which is false; so are incomparable, and symmetrically are incomparable. Consequently the subposet has the chains and together with the incomparabilities just listed, that is, it is the pentagon.
Failure of distributivity. Put , and . The upper bounds of are the elements above both: above lie and above lie , so the only common upper bound is and . Since , one has . The only reduced word of is : the only length-two words are , the equal-letter words represent , and and are distinct by the element list in 1.1. The only reduced word of is likewise . Therefore the elements below are , while those below are , so ; the elements below are , whose intersection with the elements below is just , so . Hence , while ; the distributive identity of [F6] fails for the triple , so is not distributive.
By step 1.1, is a reduced word of containing the contiguous factor , so by [F5] the element is not fully commutative; this exhibits a non-distributive right weak interval below a non-fully-commutative element. The interval theorem [F7] concerns only fully commutative elements, so no contradiction arises, and the example verifies only the failure of distributivity for this single interval; it does not prove the converse implication.
Depends on
- Words, heaps, linear extensions, commutation classes, and fully commutative elements
- Fully commutative elements: the braid-factor criterion and the forbidden-chain heap criterion
- The right weak order interval below a fully commutative element is the lattice of order ideals of its heap
- The right and left weak orders, intervals, covers, and meets and joins of subsets
- The length identity, the prefix property, left translation, and interval translation for weak order
- Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion
- Lattices, distributive lattices, and order ideals
- Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups
- 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
46 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)
- P. Nadeau, On the length of fully commutative elements, arXiv:1511.08788 (standard reference, not scraped)