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 Projections and Finite Cambrian Lattices
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Canonical Roots, Signs, and Faithful Reflections
- Chains, Antichains, Sperner and Dilworth
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Coxeter Euler Forms and Sortable Chamber Cones
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Coxeter Diagrams and Complete Classification
- Finite Fields and Cyclotomic Extensions
- Finite Lattice Projections and Coxeter Chain Labels
- Finite Reflection Arrangements and Spherical Coxeter Complexes
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Further Trigonometric Identities and Inverse Functions
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Incidence Algebras and Möbius Inversion
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Parabolic Subgroups and Double Coset Geometry
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Real Forms and Reflection Geometry
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Finite Abelian Groups
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Tits Cones, Chambers, and Parabolic Stabilizers
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Order, Inversions, and Lattice Operations
2 · Summary
For a finite Coxeter system and Coxeter element , the sortable projection maps each element to a -sortable element below it in right weak order. The three items here define the kernel quotient, prove the lattice properties of the sortable set and projection, and describe every projection fiber by its endpoints.
Kernel and quotient
The sortable projection kernel and the c-Cambrian quotient defines exactly when and orders the classes by their projection images. It also records the proposed meet and join on classes, while leaving their representative independence for the theorem that follows. “Cambrian quotient” on this page means this sortable-kernel construction; it is not identified with the separate least congruence contracting the oriented rank-two cover pairs.
Lattice structure
Sortable elements form a sublattice and the c-Cambrian quotient is its lattice-homomorphic image proves that the -sortable elements form a sublattice of finite weak order and that preserves binary meets and joins. It follows that the kernel relation is a lattice congruence and that the quotient is lattice-isomorphic to the sortable sublattice.
Fiber endpoints
The upper endpoint of a c-Cambrian fiber, interval fibers and the explicit formula u_c(w) = pi_{c^{-1}}(ww0)w0 defines the upper projection . It proves that is order-preserving and idempotent, that its fibers equal the fibers of , and that each such fiber is the closed interval . Both endpoint maps are monotone, and the two projection composites satisfy and .
The items use finite type throughout and make no cluster-fan, noncrossing-partition or Catalan-counting claim. The companion page gives explicit rank-two and rank-three computations.
3 · Logical flowchart
4 · Definitions, theorems and proofs
The sortable projection kernel and the c-Cambrian quotient
Definition
Let be a Coxeter system of finite type, let be a Coxeter element (Coxeter elements, the oriented Euler form, the skew form, and the periodic word) and let be the sortable projection of The recursive initial-letter sortable projection. By Skip bases, cover roots, greatest-sortable projections, and the chamber union of each cone (1), is well defined, independent of the initial-letter choices in its recursion, idempotent and order preserving, and is the unique greatest -sortable element below in the right weak order (c-sortable elements, forced and unforced skips, skip roots, and the chamber cone (1), The right and left weak orders, intervals, covers, and meets and joins of subsets). The right weak order on the finite group is a lattice with meet and join (Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics).
(1) Sortable equivalence and quotient order. Define the sortable equivalence on by
write for the -class of and , and let , , be the quotient map. The sortable quotient order on is
This is independent of the chosen representatives because each class has a single -image; it is the order induced by on the image of .
(2) Proposed quotient operations. On classes define
the proposed quotient operations of Finite lattice congruences, interval endpoints and descending rooted-chain labels (1) specialized to the weak-order lattice .
(3) Scope and abstentions. The set with the order (1) and the operations (2) is the sortable quotient of the finite weak order; throughout this library c-Cambrian quotient (or Cambrian quotient) denotes this sortable-kernel construction and nothing else. The definition asserts only the displayed constructions: it does not assert that the proposed operations are independent of the chosen representatives (equivalently, that is a lattice congruence), that every class is an interval of , that preserves meets and joins, or that is a lattice homomorphism. Those statements are proved in Sortable elements form a sublattice and the c-Cambrian quotient is its lattice-homomorphic image and The upper endpoint of a c-Cambrian fiber, interval fibers and the explicit formula u_c(w) = pi_{c^{-1}}(ww0)w0 ↗; the well-definedness target of this definition recorded in its justification is the second of these. The quotient is not identified here with the separate least lattice congruence contracting the oriented rank-two cover pairs determined by the rank-two orientations induced by (Coxeter elements, the oriented Euler form, the skew form, and the periodic word (2)); that identification is not asserted. No claim about noncrossing partitions, cluster fans, associahedra or -Catalan counting is made. No Choice is used.
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.
The upper endpoint of a c-Cambrian fiber, interval fibers and the explicit formula u_c(w) = pi_{c^{-1}}(ww0)w0
Statement
Let be a Coxeter system of finite type with longest element , let be a Coxeter element, the sortable projection, the sortable equivalence and the sortable quotient of The sortable projection kernel and the c-Cambrian quotient, and let be the weak-order lattice operations on (Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics). For write for the -prefix and for the minimal representative of (The weak parabolic projection, its adjoints, and the cover-join lemmas (2)). Define the upper projection of by where is the Coxeter element inverse to , with the reversed reduced word, and its sortable projection (The longest element as the opposition of the chamber, and longest elements of finite parabolics (1), The recursive initial-letter sortable projection). Whenever a recursion is indexed by a Coxeter element of a standard parabolic, its projections are formed there; in particular, in (1)(iii) is formed on with longest element . Then:
(1) The terminal formula for and the recursions for . Let and . (i) If is final in and , then , where is the restriction of to obtained by deleting the final letter. (ii) If is final in and , then . (iii) If is initial in and , then .
(2) Monotonicity and idempotence of . The map is order preserving and idempotent, and for every .
(3) Fibers are closed intervals with these endpoints. For all , Consequently every -fiber is the closed interval with lower endpoint and upper endpoint : no fiber has a gap, both endpoint maps are order preserving, and by the interval criterion The interval criterion for a lattice congruence: interval classes with monotone endpoints the equivalence is recovered from the two monotone endpoint maps as a lattice congruence — the same congruence of Sortable elements form a sublattice and the c-Cambrian quotient is its lattice-homomorphic image (4), now with its classes exhibited as the fibers.
(4) Abstention. The quotient is still not identified with the least lattice congruence contracting the oriented rank-two pairs of , and no noncrossing, cluster-fan or counting statement is made. No Choice is used.
Facts & Assumptions
Given: a finite-type Coxeter system , its longest element , a Coxeter element , its inverse represented by the reversed reduced word, the sortable projections and , the right weak order , and the parabolic prefixes and longest elements.
The sortable projection kernel and the c-Cambrian quotient (1)-(2) and Finite lattice congruences, interval endpoints and descending rooted-chain labels (1): is the kernel relation ; , , its quotient order and the proposed class meet/join operations are defined there.
The recursive initial-letter sortable projection: if is initial in , then when and when , with and the -prefix; the inverse Coxeter element uses the reversed word.
c-sortable elements, forced and unforced skips, skip roots, and the chamber cone (1) and Coxeter elements, the oriented Euler form, the skew form, and the periodic word: a one-letter simple generator is -sortable because its sorting word lies in the first block of .
The weak parabolic projection, its adjoints, and the cover-join lemmas (1)-(3): ; is the greatest -element below and prefix projection is order-preserving; the prefix projection preserves joins; and its largest lift is .
The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)(i)-(v): , , , , and conjugation by permutes .
The right and left weak orders, intervals, covers, and meets and joins of subsets (1),(3) and Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (2),(4)-(5): means with additive length; a simple left multiplication changes length by or ; iff ; and iff .
The geometric inversion set of an element of a Coxeter group (1)-(2): , with the positive and negative root partition and the inversion-set convention used in the proof.
Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics (2): is finite and its right weak order is a lattice.
The recursive projection is well defined, sortable-valued, below w, idempotent, descent-detecting and parabolic (1)-(4): is well-defined, -sortable and below ; it fixes sortable elements and is idempotent; and for an initial letter , iff .
Omega-positive words are commutation-equivalent to sortable sorting words; sortable equals aligned; parabolic restriction (3): if is -sortable, its -prefix is sortable for the restricted Coxeter element on ; conversely a sortable element of is -sortable in .
Skip bases, cover roots, greatest-sortable projections, and the chamber union of each cone (1): is the unique greatest -sortable element below .
Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements (5)(ii): if is final in and is -sortable with , then .
The cone criterion, monotonicity of the projection, and the greatest sortable element below w (2): is order-preserving; the same holds for any Coxeter element of a finite parabolic subsystem.
Sortable elements form a sublattice and the c-Cambrian quotient is its lattice-homomorphic image (2): -sortable elements are closed under nonempty joins, and their joins are -sortable.
Lattice quotient descent, class intervals and monotone endpoints (iii): for a finite lattice congruence, the proposed quotient operations are representative-independent and the quotient map preserves meet and join.
The interval criterion for a lattice congruence: interval classes with monotone endpoints (i)-(ii): for an equivalence relation on a finite lattice whose classes are intervals, the relation is a congruence if and only if its lower and upper endpoint maps are order-preserving.
The longest element as the opposition of the chamber, and longest elements of finite parabolics (2), applied to : is the longest element of the finite parabolic and is an involution; applying the opposition assertion of [F5] within gives for .
Sortable elements form a sublattice and the c-Cambrian quotient is its lattice-homomorphic image (4): the kernel relation is a lattice congruence with the quotient operations and quotient map already defined in The sortable projection kernel and the c-Cambrian quotient.
Proof
Fix and let be the length-additive parabolic factorization. The prefix inversion formula in [F4] and opposition in [F5] give . Applying opposition inside gives . Both and lie in , so equality of their inverse inversion sets gives equality of the elements by the order criterion and antisymmetry in [F6]. Hence .
Suppose is final in and ; set and . By [F3] and [F10], both and are -sortable and lie below , since and . Their join is -sortable by [F14] and below , so by [F11]. Thus ; the terminal cover decomposition [F12] gives . The prefix is -sortable by [F10] and by [F4], hence by [F11] applied inside . Therefore , and with this proves .
We prove by lexicographic induction on that whenever and , one has . If , then and this holds; at every positive-rank pair assume it holds for all smaller measures, and fix an initial letter of .
Define , so . The map reverses right weak order: if with additive length, then and by [F5], so by [F6]; since is the identity, this is an order anti-isomorphism. Therefore is order-preserving by [F13]. Since by [F9], applying gives . Finally, by idempotence in [F9].
If is final in and , then is initial in and by [F5]. The initial-letter recursion [F2] gives , so , proving (1)(ii). If is initial in and , then is final in and ; apply step 1.2 to and to get . Multiplying on the right by converts the join to a meet by the order reversal in step 1.4; using from step 1.1 and gives , where is formed inside with longest element and . This proves (1)(iii).
Continue the induction of step 1.3. Suppose and . If , then because by [F6]. Write with additive length. Then and , so . The recursion [F2] gives ; since , the induction hypothesis yields . In , the letter is final and have left ascent , so step 2.1(ii) gives and ; cancellation proves . If instead but , then lies outside the filter above , while lies in that filter: indeed , and by [F9], so left multiplication by lengthens this projection by one. This contradicts . Thus both are left ascents. The parabolic prefix is order-preserving by [F4], so ; the recursion gives , and the induction hypothesis in lower rank gives . Formula 2.1(iii), with the same and for both inputs, now yields . This completes the comparable-pair induction.
For arbitrary with , [F9] gives and . Applying the comparable-pair result of step 3.1 to and gives . Conversely, if , then by the definition of ; the forward implication just proved for arbitrary pairs, applied to , gives . By definition these are and , so . Thus the two fiber partitions agree. The forward implication and idempotence of also give . Applying this identity to and using yields , so .
If , then , so step 4.1 gives ; by [F9] and step 1.4, . Conversely, if , monotonicity [F13] and step 4.1 give , so . Thus with the asserted endpoints; the endpoint maps are order-preserving by [F13] and step 1.4.
The classes are intervals by step 5.1, and their endpoint maps are order-preserving there; applying [F16] shows that is a lattice congruence. It is the same kernel relation and quotient as in [F1] and the congruence conclusion of [F18], not an identification with a different least-contraction congruence. The finite quotient consequences of [F15] give the representative-independent class operations and the lattice-homomorphic quotient map. All inductions are finite and no Choice is used.
5 · Examples, counterexamples and false statements
None yet.
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
- N. Reading, Sortable elements and Cambrian lattices, arXiv:math/0512339v1 (2005); Algebra Universalis 56 (2007) 35-56
- A. Bjorner and F. Brenti, Combinatorics of Coxeter Groups, Graduate Texts in Mathematics 231, Springer 2005