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.
Sortable elements form a sublattice and the c-Cambrian quotient is its lattice-homomorphic image
Statement
Let be a Coxeter system of finite type, a Coxeter element (Coxeter elements, the oriented Euler form, the skew form, and the periodic word), the sortable projection, the sortable equivalence and the sortable quotient of The sortable projection kernel and the c-Cambrian quotient; let and be meet and join in the weak-order lattice (Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics) and the inversion set of (The geometric inversion set of an element of a Coxeter group). Then:
(1) Meet closure. For every nonempty set of -sortable elements the meet exists in , is -sortable, and satisfies
(2) Join closure. Every nonempty set of -sortable elements has a join in , and is -sortable. Consequently the -sortable elements form a sublattice of the finite weak-order lattice.
(3) The initial-letter join formula. Let be an initial letter of and let satisfy . Then is a cover reflection of and
(4) Meet and join preservation. For all ,
Hence is a lattice homomorphism, the proposed quotient operations of The sortable projection kernel and the c-Cambrian quotient (2) are independent of the chosen representatives, is a lattice congruence of , and the map , , is a bijection identifying the sortable quotient order with the restriction of ; it is a lattice isomorphism, so is a lattice and is a surjective lattice homomorphism.
(5) Abstention. As in The sortable projection kernel and the c-Cambrian quotient, the quotient is not identified with the separate least lattice congruence contracting the oriented rank-two cover pairs determined by the rank-two orientations induced by , and no cluster-fan, noncrossing-partition or counting statement is made. No Choice is used.
Facts & Assumptions
Given: A finite-type Coxeter system , a Coxeter element , its sortable projection , its c-sortable elements, the right weak order , the weak-order lattice operations, the sortable equivalence , and the quotient set and proposed quotient operations of The sortable projection kernel and the c-Cambrian quotient.
The sortable projection kernel and the c-Cambrian quotient (1)-(2): is defined by equality of -images, has the order induced by on those images, and , are the proposed quotient operations.
The recursive initial-letter sortable projection: for an initial letter of , the recursion is when and when , where , is the restriction of to , and is the -prefix.
Coxeter elements, the oriented Euler form, the skew form, and the periodic word and c-sortable elements, forced and unforced skips, skip roots, and the chamber cone (1),(4): has a first block containing every generator, so the one-letter element is c-sortable; c-sortability is the weak-decrease-by-inclusion condition on sorting-word blocks; and is the intersection of its skip-root halfspaces.
Skip bases, cover roots, greatest-sortable projections, and the chamber union of each cone (1)-(3): is well defined, independent of the recursive initial-letter choices, idempotent and order preserving; is the unique greatest c-sortable element below ; the skip roots form a basis; and every cone is a union of closed chambers.
The recursive projection is well defined, sortable-valued, below w, idempotent, descent-detecting and parabolic (2),(4)-(5): is c-sortable and below , it fixes every c-sortable element, it detects whether an initial letter lies below its input, and its restriction to is the projection for the restricted Coxeter element. Compatibility with prefixes of arbitrary elements is supplied by [F18].
Omega-positive words are commutation-equivalent to sortable sorting words; sortable equals aligned; parabolic restriction (2): is c-sortable if and only if it is c-aligned.
The greedy scan computes the c-sorting word; commutation, conjugation and rank-two alignment (4)(ii): in the c-oriented order on a noncommutative generalized rank-two subsystem, a c-aligned inversion trace is empty, the allowed terminal singleton, or an initial segment in that same fixed order; for the zero-orientation case the trace is empty or a singleton.
Finite inversion sets are recognized by their rank-two initial or final segments (1),(4): a finite subset of is an inversion set precisely when every noncommutative generalized rank-two trace is empty, an initial segment, or a final segment of that subsystem's angular order, and bijects with precisely the subsets satisfying this criterion.
Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (2),(4)-(5): weak-order covers add one length; if and only if ; ; and if and only if .
The inversion formula , the root-reflection dictionary and strong exchange (1)(ii)-(iii),(2): , equal root reflections have roots differing only by sign, and if is reduced then the prefix-root list for is the prefix-root list for together with the single new root .
Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics (2): finite-type is finite and its right weak order is a lattice.
The weak parabolic projection, its adjoints, and the cover-join lemmas (1),(3): is the greatest -element below , and the parabolic-prefix map preserves joins, so .
The right and left weak orders, intervals, covers, and meets and joins of subsets (1),(3) and Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2): means with additive length, exactly when , and each simple left multiplication changes length by or ; taking gives .
Finite lattice congruences, interval endpoints and descending rooted-chain labels (1): representative independence of the proposed class meet and join operations is equivalent to the kernel relation being a lattice congruence.
The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset (1) and The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1)-(2): is -invariant; ; the arrangement is -invariant; the closed chambers are ; their walls are root hyperplanes; and the simple-root hyperplanes are walls of the fundamental chamber.
Root sign coherence and the action of simple reflections on positive roots statement and (2)-(3): positive roots are nonzero nonnegative combinations of simple roots, negative roots are their negatives, each root has -norm , and each simple root has ; the simple-reflection action preserves positive roots except for the corresponding simple root.
The cone criterion, monotonicity of the projection, and the greatest sortable element below w (2)-(4): is order preserving, the cone criterion is for c-sortable , and projection commutes with parabolic prefixes.
Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements (3),(5)(iii): with the set of cover reflections, the negative skip roots are ; here is the positive-root set of The weak parabolic projection, its adjoints, and the cover-join lemmas (4). When is initial in and , one has .
Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups: each simple generator is an involution, .
The canonical reflection homomorphism, roots, reflections, and the positive cone (1), The real Coxeter form, its radical, reflections, and form-preserving maps, and The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset: for each , and is the reflection with normal , fixing pointwise and exchanging its two sides.
Proof
Let be a set of c-sortable elements and put . Since is finite, is finite. In each noncommutative generalized rank-two subsystem, [F6]-[F7] put all the traces at the same c-oriented end of its angular order; their intersection is therefore empty, the allowed terminal singleton, or an initial segment in that fixed order. In a zero-orientation subsystem each trace is empty or a singleton, so their intersection is again empty or a singleton. Thus satisfies [F8], so [F8] gives a unique with ; put , so . For every , , so by [F10]. If is any lower bound of , then , so ; therefore and the displayed inversion-set identity holds. The same rank-two traces show is c-aligned, hence c-sortable by [F6].
Fix and put . By [F14], for and otherwise. Thus sends into . Conversely, if , write with . If , then [F14] gives , contradicting this equality, so ; hence the map is onto. If and , write with additive length. Then and , so . Conversely, if , write with additive length; cancellation gives , and the ascent identities give , so . Therefore left multiplication by is an order isomorphism from onto .
Suppose , and . Then by [F10]. The inclusion in [F10] and the one-length rise across a cover imply that this difference has one root, so it equals . Write with by [F10] and [F14]. By [F11], the unique new prefix root in is , hence and . Using from [F20], . Thus is a cover reflection of .
We prove join preservation by lexicographic induction on . If or , then or , respectively, and the identity holds. For every other pair, assume it holds for all pairs of smaller lexicographic measure. This is the induction hypothesis.
Let be c-sortable and set , which exists by [F12]. For every , by [F4]-[F5], so is an upper bound of and . Since by [F4], we get ; hence is c-sortable. Together with step 1.1 this proves (2).
If , their rank-one parabolic prefixes are both . By join preservation of the parabolic prefix map in [F13], also has rank-one prefix , so . Step 1.2 shows is an upper bound of . If is any common upper bound of , then and we may write with and . If , [F14] would instead give , contradicting and that length equality; hence . Step 1.2 now gives , hence , and the same order isomorphism gives . Therefore .
By monotonicity, . The right side is c-sortable by step 1.1 and is below because and . Since is the greatest c-sortable element below by [F4], the reverse inequality holds. Thus .
Suppose . The rank-one case of [F13] shows , so [F2] computes all projections in , where . The prefix join identity from [F13] and the induction hypothesis from step 1.4 applied in the lower-rank parabolic give . These last two outputs lie in by [F2], and their join in equals their join in : if , then F13,(3) gives and , while ; hence . Thus the displayed value is . Here are their actual -prefixes; no identity claim about them is needed.
Let and put . In a saturated chain from to , take the first cover whose upper element satisfies . Its lower element is not above , so step 1.3 gives and is a cover reflection of . Since is a common upper bound of both and , leastness gives ; the chain gives , so and is a cover reflection of . Let . The one-letter element is c-sortable, so by [F5]; monotonicity gives . Since and by [F5], and therefore . By [F18], but . Step 1.3 gives for some , so ; by [F11], , and [F21] shows that is the adjacent chamber to across : is a facet, the reflection fixes it pointwise and exchanges its sides, and the arrangement is W-invariant. Applying gives that and are adjacent across by [F11]. The cone is the intersection of the skip-root halfspaces [F3] and a union of closed chambers [F4], so their common facet lies in its boundary. The skip-root set is finite, and each defining hyperplane distinct from intersects in a proper subspace. Start at a relative-interior point of the facet. For each such hyperplane still containing the point, perturb within in a direction outside that hyperplane; a sufficiently small perturbation stays in the relative interior and preserves the nonzero evaluations for hyperplanes already avoided. Finite iteration yields a point outside all those intersections. At this point a defining skip-root inequality is an equality, and its hyperplane must be . By [F17], the skip root normal to this wall is either or . Since , [F10] gives . For , invariance of gives by [F16]-[F17]. Thus the included chamber is on the negative side of , so the inward skip-root normal is . By [F19], in the negative skip basis means , so is a cover reflection of .
Suppose for an initial letter of , and put , . Then by [F14]. Applying step 2.2 to gives ; since by [F20], this is equivalent to , whose length is . By the recursion [F2], , and . The induction hypothesis from step 1.4 for in the rotated system gives ; these two projection values are not above because they lie below by [F5]. Applying step 2.2 again yields .
By the initial cover decomposition [F19], for . Parabolic compatibility [F18] gives , and join preservation of prefixes [F13] gives , since . The rank-drop branch of [F2] gives ; hence and . This proves (3).
In the mixed case, assume and , and put . Then . Since is an upper bound of and , ; since , also , so . The both-above case 3.1, whose induction step uses the shorter join , now gives . By step 3.2, ; monotonicity and give , hence . This proves the join identity in every case.
Define by . It is well defined and injective by the definition of , and surjective by the definition of . By [F5], every image is c-sortable and every c-sortable element is fixed, so is exactly the c-sortable sublattice. The quotient order is defined by exactly when , so is an order isomorphism; the identities proved in steps 2.3, 2.4, 3.1 and 4.1 make it a lattice isomorphism. Equality of -images is preserved by both meet and join, so by [F15] and the definition [F1], is a lattice congruence, the proposed class operations are representative-independent, and is a lattice. The quotient map is surjective and preserves meet and join by those operations. All sets and inductions used here are finite, and no Choice is used.
Depends on
- Coxeter elements, the oriented Euler form, the skew form, and the periodic word
- The sortable projection kernel and the c-Cambrian quotient
- The recursive initial-letter sortable projection
- Skip bases, cover roots, greatest-sortable projections, and the chamber union of each cone
- The cone criterion, monotonicity of the projection, and the greatest sortable element below w
- Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements
- The recursive projection is well defined, sortable-valued, below w, idempotent, descent-detecting and parabolic
- Omega-positive words are commutation-equivalent to sortable sorting words; sortable equals aligned; parabolic restriction
- The greedy scan computes the c-sorting word; commutation, conjugation and rank-two alignment
- c-sortable elements, forced and unforced skips, skip roots, and the chamber cone
- The weak parabolic projection, its adjoints, and the cover-join lemmas
- Finite inversion sets are recognized by their rank-two initial or final segments
- The geometric inversion set $N(w)$ of an element of a Coxeter group
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order
- The right and left weak orders, intervals, covers, and meets and joins of subsets
- Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics
- Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion
- Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups
- Finite lattice congruences, interval endpoints and descending rooted-chain labels
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- The inversion formula $|N(w)|=\ell(w)$, the root-reflection dictionary and strong exchange
- 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
- Root sign coherence and the action of simple reflections on positive roots
Used by
- 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 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
131 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)