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 and left weak orders, intervals, covers, and meets and joins of subsets
Definition
Let be a finite Coxeter matrix, let be the presented group with length function and reduced expressions (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), and for let
be the left and right descent sets already fixed in Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2). Let , and the inversion sets be the reflection set, the signed root system and the inversion sets of The canonical reflection homomorphism, roots, reflections, and the positive cone and The geometric inversion set of an element of a Coxeter group.
(1) Right and left weak order. Define two relations on by
These are the right weak order and the left weak order on . Inversion relates them definitionally: , because with is equivalent to with , using (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3)). Write for with .
(2) Intervals, covers and bounded subsets. For define and ; these are the right and left intervals. An element covers in , written , when and there is no with ; define in the same way using . A subset is bounded above in if there exists with for every , and bounded below if there exists with for every . Define upper and lower bounds in by replacing with .
(3) Meets and joins of subsets. Let and . The element is a right upper bound of if for every ; it is a right join (least upper bound) if it is a right upper bound and for every right upper bound of . Dually, is a right lower bound if for every , and a right meet (greatest lower bound) if it is a right lower bound and for every right lower bound of . Define left upper and lower bounds, meets, and joins by replacing with . Whenever the relevant meet or join is unique, write it as or in the order under discussion; for write or . A meet or join, when it exists, is unique in either order: any two meets (respectively joins) bound one another, so antisymmetry gives equality. The partial-order property needed here is the recorded well-definedness justifier. This definition asserts no existence of meets or joins for any specified subset.
(4) Abstentions. This definition records and the interval and bound vocabulary; it asserts no further property. In particular, it does not assert that either relation is a partial order (Partial order and partially ordered set), that covers have the form , that any meet or join exists, or that computes by inclusion of inversion sets. No Choice is used.
Depends on
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- The geometric inversion set $N(w)$ of an element of a Coxeter group
- Partial order and partially ordered set
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
Used by
- Meets and joins are not intersection and union of inversion sets: the A₂ counterexample Counterexample
- The sortable projection kernel and the c-Cambrian quotient Definition
- All meets and joins of the right weak order of A₂ (S₃), with the left order and the inversion sets compared Example
- Infinite dihedral type: lower intervals are chains, but the two atoms have no upper bound Example
- The c-Cambrian quotient of S3 for both orientations: fibers, endpoints and meet/join preservation Example
- The c-sortable subset of A3 for c = s1s2s3, a three-element fiber, and the upper endpoint map Example
- The right weak interval below the longest element of A₂ is not distributive Example
- Two distributive right weak intervals of fully commutative elements in type A₃ Example
- Binary meets, meets of arbitrary nonempty subsets, and joins of bounded subsets in weak order Lemma
- Omega-positive words are commutation-equivalent to sortable sorting words; sortable equals aligned; parabolic restriction Lemma
- The cone criterion, monotonicity of the projection, and the greatest sortable element below w Lemma
- The length identity, the prefix property, left translation, and interval translation for weak order Lemma
- The recursive projection is well defined, sortable-valued, below w, idempotent, descent-detecting and parabolic Lemma
- The weak parabolic projection, its adjoints, and the cover-join lemmas Lemma
- Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion Lemma
- Skip bases, cover roots, greatest-sortable projections, and the chamber union of each cone Theorem
- Sortable elements form a sublattice and the c-Cambrian quotient is its lattice-homomorphic image Theorem
- The right weak order interval below a fully commutative element is the lattice of order ideals of its heap Theorem
- The upper endpoint of a c-Cambrian fiber, interval fibers and the explicit formula u_c(w) = pi_c⁻¹(ww0)w0 Theorem
- Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics Theorem
Dependency tree · two levels
45 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
- Anders Bjorner and Francesco Brenti, Combinatorics of Coxeter Groups (Graduate Texts in Mathematics 231, Springer 2005; author-hosted complete PDF) (standard reference, not scraped)
- John R. Stembridge, On the fully commutative elements of Coxeter groups (author-hosted preprint) (standard reference, not scraped)