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 cone criterion, monotonicity of the projection, and the greatest sortable element below w
Statement
Let be a Coxeter system of finite type, a Coxeter element, the projection of The recursive initial-letter sortable projection, and the skip roots and cone of c-sortable elements, forced and unforced skips, skip roots, and the chamber cone, and let denote the closed chambers of the finite reflection arrangement (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1),(2)) under the identification .
(1) Cone criterion for comparable pairs. If is -sortable and , then
(2) Monotonicity. is order preserving: implies .
(3) Greatest sortable below, and full cone criterion. For every the element is the unique greatest -sortable element below in ; and for every -sortable , Consequently the closed chambers indexed by each fiber of have union equal to its cone (assembled in Skip bases, cover roots, greatest-sortable projections, and the chamber union of each cone).
(4) Parabolic compatibility. For , with the restriction of and the -prefix, for every .
Facts & Assumptions
Given: the finite-type system and objects of the Statement. Write , , and for the cover reflections associated to the positive-root set of The weak parabolic projection, its adjoints, and the cover-join lemmas (4).
c-sortable elements, forced and unforced skips, skip roots, and the chamber cone (3),(4) and Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements (1),(2): for -sortable , skip roots obey the initial-letter recursion, form a basis, and define the cone by their nonnegative halfspaces.
Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements (3): the negative skip roots are and the positive ones .
The recursive projection is well defined, sortable-valued, below w, idempotent, descent-detecting and parabolic (1)-(5): is independent of the initial choices, is sortable-valued and below its input, fixes exactly the sortable elements, detects descent at an initial letter, and restricts to the projection of the restricted Coxeter element on .
The weak parabolic projection, its adjoints, and the cover-join lemmas (1): , the prefix is greatest in below , and the prefix map preserves order.
The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1),(2): the closed chambers tile , their interiors are the components of the root-hyperplane complement, and the fundamental chamber is positive on every positive root and negative on every negative root in its interior.
Descent of the reflection representation, unit root norms, and conjugation of reflections (2): the action is -preserving.
The length identity, the prefix property, left translation, and interval translation for weak order (3) preserves and reflects order under left multiplication by between two elements above . It also does so between two elements not above , by applying (3) to their left multiples, which are above .
Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (1)-(5): weak order is a partial order, every inequality is a chain of simple covers, it is inversion-set inclusion, and is equivalent to . A cover deletes exactly one positive inversion root, by The weak parabolic projection, its adjoints, and the cover-join lemmas, Proof 1.3.
Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics (2),(3): weak order is a lattice in finite type, and the join of two simple generators is the longest element of their parabolic.
Omega-positive words are commutation-equivalent to sortable sorting words; sortable equals aligned; parabolic restriction (3) : sortable parabolic prefixes are sortable for the restricted element.
The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness (7): standard dihedral alternating words of length at most are reduced in the ambient group. Plane subsystems, their canonical generators, and the angular order of their roots (3) identifies the standard rank-two subgroup with the dihedral group of order . Its elements have alternating representatives of length at most . Indeed, let be the alternating words of length beginning with , respectively. Since are involutions, the concatenation is alternating of length beginning with , so by The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness (1),(4); hence . Thus an alternating length- word is its longest element, and deleting its first gives a reduced length- alternating word starting with .
c-sortable elements, forced and unforced skips, skip roots, and the chamber cone (1) defines decreasing selected blocks. The greedy scan computes the c-sorting word; commutation, conjugation and rank-two alignment (1) computes them. Thus a sortable non-descent at initial selects no occurrence of and lies in ; in the descent case deleting the first selected preserves the per-letter initial-segment condition and gives -sortability of .
Proof
Chamber signs. For with and , invariance gives ; its sign is negative exactly when . Thus exactly when every negative skip root has and every positive skip root has . Closure extends the interior signs to the entire chamber. We use this dictionary throughout, so root-hyperplane geometry introduces no dependence on the final cone theorem.
The identity case. For any , implies . Prove this by rank induction: if an initial is below , descent detection excludes value ; otherwise , so rank induction gives . If , a first letter of a reduced word for is a left descent and differs from , hence and by [F4], a contradiction. Conversely . The cone for is , and exactly when by disjoint chamber interiors. This is the base for the following inductions on (rank, length of the sortable element).
We prove monotonicity by induction on (rank, ), simultaneously for every Coxeter element and pair . The base is immediate. It suffices to handle covers. First establish the auxiliary consequence under these inductive hypotheses: for any simple , one has . Choose initial of . If , descent detection proves this. If , then and ; rank induction gives , since every simple generator is sortable (its one selected occurrence is in the first block).
Cover case with neither nor above . The prefix map preserves , and rank induction gives , the desired projections. No parabolic membership of is needed. If both are above , left translation gives with the upper length smaller; length induction followed by [F7] gives .
Comparable criterion, neither element above initial . Only the sortable , not an arbitrary non-descent , is asserted to belong to by [F12]. Its skip set is . The -inequality holds for since ; all other inequalities involve subsystem roots and therefore depend only on by [F4]. Consequently is equivalent to . Since gives , rank induction identifies this with , the recursion for .
Comparable criterion, both elements above . Then by [F7], is -sortable, and . Root transport gives , so inclusion of is equivalent to inclusion of in the latter cone. Induction on the strictly smaller length of proves the equivalence with , hence .
Auxiliary consequence when and . Put , the rank-two longest element by [F9]; then , so by [F7]. In the rank-two system has an alternating reduced word of length beginning with , by [F11], so it is sortable for , the restriction of (where is final). Parabolic restriction and the fixed-point property give . Since , length induction gives . Both sides are not above : the left because lengthens, the right because it is below , which is not above . Apply [F7] to their left multiples to obtain , hence . This proves the auxiliary consequence for all simple and all under the stated inductive hypotheses.
Comparable criterion, and . Descent detection makes , while is a positive skip root of and interior points of have negative pairing with it. Both sides fail. The fourth possibility , is excluded by . These cases prove (1) using only rank and sortable-length induction.
Mixed cover , . Their inversion sets differ by one root, necessarily by [F8]; deleting its cover reflection gives . Put . It is below and not above . The auxiliary consequence in steps 1.3 and 2.3, applied to at the present upper element , gives , so it differs from . Comparable criterion (1), already proved independently, gives and , since . The sign dictionary and the single new inversion show that the skip inequality which changes from satisfied on to violated on must have positive normal . Thus , and transport gives ; the negative-skip/cover dictionary makes a cover reflection of . Therefore . Length induction at , together with parabolic restriction, gives . Hence . This proves (2). The separating wall here is ; no identification with is used.
Greatest sortable element. The projection is sortable and below by [F3]. If sortable , monotonicity gives . Antisymmetry proves uniqueness.
Full criterion: induct again on (rank, ), now with arbitrary . The base is step 1.2. Cases where neither element is above initial , or both are above it, use exactly the sign/prefix and conjugation computations in steps 2.1-2.2, with this full induction replacing the comparable induction; no comparison is needed. The case , is step 3.1. In the remaining case , , descent detection excludes equality. Monotonicity gives , since ; but . The projections therefore differ. Full induction on the shorter sortable element gives , hence by conjugation. This proves (3) without applying the comparable criterion to an unverified comparable pair.
Parabolic compatibility. Since , monotonicity and restriction give , hence it is below . Conversely implies . This prefix is -sortable by [F10], so applying monotonicity of gives . Antisymmetry proves (4).
Clauses (1)-(4) have been proved in the order comparable criterion, monotonicity, greatest/full criterion, and parabolic compatibility. All choices use finite words, roots or chambers and no Choice is invoked.
Depends on
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- The weak parabolic projection, its adjoints, and the cover-join lemmas
- c-sortable elements, forced and unforced skips, skip roots, and the chamber cone
- Omega-positive words are commutation-equivalent to sortable sorting words; sortable equals aligned; parabolic restriction
- The recursive initial-letter sortable projection
- The recursive projection is well defined, sortable-valued, below w, idempotent, descent-detecting and parabolic
- Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements
- The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset
- The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere
- Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics
- Binary meets, meets of arbitrary nonempty subsets, and joins of bounded subsets in weak order
- The right and left weak orders, intervals, covers, and meets and joins of subsets
- The greedy scan computes the c-sorting word; commutation, conjugation and rank-two alignment
- Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion
- The length identity, the prefix property, left translation, and interval translation for weak order
- The geometric inversion set $N(w)$ of an element of a Coxeter group
- Plane subsystems, their canonical generators, and the angular order of their roots
- The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness
Used by
- All skips and the cone walls of the sortable element s1s2 in A3 Example
- 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 upper endpoint of a c-Cambrian fiber, interval fibers and the explicit formula u_c(w) = pi_c⁻¹(ww0)w0 Theorem
Dependency tree · two levels
106 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
- N. Reading and D. E. Speyer, Sortable elements in infinite Coxeter groups, arXiv:0803.2722v3 (2010); Trans. Amer. Math. Soc. 363 (2011) 699-761 (standard reference, not scraped)
- N. Reading, Sortable elements and Cambrian lattices, arXiv:math/0512339v1 (2005); Algebra Universalis 56 (2007) 35-56 (standard reference, not scraped)
- A. Bjorner and F. Brenti, Combinatorics of Coxeter Groups, Graduate Texts in Mathematics 231, Springer 2005 (standard reference, not scraped)