Alphabeta Math
Pipeline-generated
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.

✓ 1 result · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 1 also cleared it.

Sortable Projections and Finite Cambrian Lattices

1 · Prerequisites

2 · Summary

For a finite Coxeter system (W,S) and Coxeter element c, the sortable projection πc maps each element to a c-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 x∼cy exactly when πc(x)=πc(y) 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 c-sortable elements form a sublattice of finite weak order and that πc 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 uc(w)=πc−1(ww0)w0. It proves that uc is order-preserving and idempotent, that its fibers equal the fibers of πc, and that each such fiber is the closed interval [πc(w),uc(w)]. Both endpoint maps are monotone, and the two projection composites satisfy πcuc=πc and ucπc=uc.

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

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

The sortable projection kernel and the c-Cambrian quotient

Definition

Let (W,S) be a Coxeter system of finite type, let c be a Coxeter element (Coxeter elements, the oriented Euler form, the skew form, and the periodic word) and let πc ⁣:W→W 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), πc is well defined, independent of the initial-letter choices in its recursion, idempotent and order preserving, and πc(w) is the unique greatest c-sortable element below w in the right weak order ≤R (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 W 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 ∼c on W by

x∼cy:  ⟺  πc(x)=πc(y),

write [x]c:={y∈W:πc(y)=πc(x)} for the ∼c-class of x and W/∼c:={[x]c:x∈W}, and let pc ⁣:W→W/∼c, pc(x):=[x]c, be the quotient map. The sortable quotient order on W/∼c is

[x]c≤c[y]c:  ⟺  πc(x)≤Rπc(y).

This is independent of the chosen representatives because each class has a single πc-image; it is the order induced by ≤R on the image of πc.

(2) Proposed quotient operations. On classes define

[x]c∨[y]c:=[x∨y]c,[x]c∧[y]c:=[x∧y]c,

the proposed quotient operations of Finite lattice congruences, interval endpoints and descending rooted-chain labels (1) specialized to the weak-order lattice W.

(3) Scope and abstentions. The set W/∼c 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 ∼c is a lattice congruence), that every class is an interval of ≤R, that πc preserves meets and joins, or that pc 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 c (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 W-Catalan counting is made. No Choice is used.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Sortable elements form a sublattice and the c-Cambrian quotient is its lattice-homomorphic image

Statement

Let (W,S) be a Coxeter system of finite type, c a Coxeter element (Coxeter elements, the oriented Euler form, the skew form, and the periodic word), πc the sortable projection, ∼c the sortable equivalence and W/∼c the sortable quotient of The sortable projection kernel and the c-Cambrian quotient; let ∧ and ∨ be meet and join in the weak-order lattice W (Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics) and N(w) the inversion set of w (The geometric inversion set N(w) of an element of a Coxeter group). Then:

(1) Meet closure. For every nonempty set A of c-sortable elements the meet ⋀A exists in W, is c-sortable, and satisfies

N((⋀A)−1)=⋂a∈AN(a−1).

(2) Join closure. Every nonempty set A of c-sortable elements has a join ⋁A in W, and ⋁A is c-sortable. Consequently the c-sortable elements form a sublattice of the finite weak-order lattice.

(3) The initial-letter join formula. Let s∈S be an initial letter of c and let y∈W satisfy y̸≥Rs. Then s is a cover reflection of s∨y and

πc(s∨y)=s∨πc(y)=πc(s)∨πc(y).

(4) Meet and join preservation. For all x,y∈W,

πc(x∧y)=πc(x)∧πc(y),πc(x∨y)=πc(x)∨πc(y).

Hence πc 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, ∼c is a lattice congruence of W, and the map W/∼c→πc(W), [x]c↦πc(x), is a bijection identifying the sortable quotient order ≤c with the restriction of ≤R; it is a lattice isomorphism, so W/∼c is a lattice and pc 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 c, and no cluster-fan, noncrossing-partition or counting statement is made. No Choice is used.

Facts & Assumptions

Given: A finite-type Coxeter system (W,S), a Coxeter element c, its sortable projection πc, its c-sortable elements, the right weak order ≤R, the weak-order lattice operations, the sortable equivalence ∼c, and the quotient set and proposed quotient operations of The sortable projection kernel and the c-Cambrian quotient.

[F1]

The sortable projection kernel and the c-Cambrian quotient (1)-(2): ∼c is defined by equality of πc-images, W/∼c has the order induced by ≤R on those images, and [x]c∨[y]c=[x∨y]c, [x]c∧[y]c=[x∧y]c are the proposed quotient operations.

[F2]

The recursive initial-letter sortable projection: for an initial letter s of c, the recursion is πc(w)=sπscs(sw) when w≥Rs and πc(w)=πc′(wJ) when w̸≥Rs, where J=S∖{s}, c′ is the restriction of c to WJ, and wJ is the WJ-prefix.

[F3]

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): c∞ has a first block containing every generator, so the one-letter element s is c-sortable; c-sortability is the weak-decrease-by-inclusion condition on sorting-word blocks; and Conec(v) is the intersection of its skip-root halfspaces.

[F4]

Skip bases, cover roots, greatest-sortable projections, and the chamber union of each cone (1)-(3): πc is well defined, independent of the recursive initial-letter choices, idempotent and order preserving; πc(w) is the unique greatest c-sortable element below w; the skip roots form a basis; and every cone is a union of closed chambers.

[F5]

The recursive projection is well defined, sortable-valued, below w, idempotent, descent-detecting and parabolic (2),(4)-(5): πc(w) is c-sortable and below w, it fixes every c-sortable element, it detects whether an initial letter lies below its input, and its restriction to WJ is the projection for the restricted Coxeter element. Compatibility with prefixes of arbitrary elements is supplied by [F18].

[F7]

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.

[F8]

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 w↦N(w) bijects W with precisely the subsets satisfying this criterion.

[F9]

The geometric inversion set N(w) of an element of a Coxeter group (1): N(w)={α∈Φ+:ρ(w)α∈Φ−}.

[F10]

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; u≤Rv if and only if N(u−1)⊆N(v−1); ∣N(w−1)∣=ℓ(w); and s≤Rw if and only if es∈N(w−1).

[F11]

The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1)(ii)-(iii),(2): tρ(u)er=uru−1, equal root reflections have roots differing only by sign, and if w=ur is reduced then the prefix-root list for N(w−1) is the prefix-root list for N(u−1) together with the single new root ρ(u)er.

[F13]

The weak parabolic projection, its adjoints, and the cover-join lemmas (1),(3): wJ is the greatest WJ-element below w, and the parabolic-prefix map preserves joins, so (x∨y)J=xJ∨WJyJ.

[F14]

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): u≤Rv means v=ux with additive length, s≤Rw exactly when ℓ(sw)<ℓ(w), and each simple left multiplication changes length by 1 or −1; taking w=1 gives ℓ(s)=1.

[F15]

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.

[F16]

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): B is ρ-invariant; C={q:B(q,et)≥0 for all t}; the arrangement is ρ(W)-invariant; the closed chambers are wC; their walls are root hyperplanes; and the simple-root hyperplanes are walls of the fundamental chamber.

[F17]

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 B-norm 1, and each simple root has B(es,es)=1; the simple-reflection action preserves positive roots except for the corresponding simple root.

[F18]

The cone criterion, monotonicity of the projection, and the greatest sortable element below w (2)-(4): πc is order preserving, the cone criterion is πc(w)=v  ⟺  wC⊆Conec(v) for c-sortable v, and projection commutes with parabolic prefixes.

[F19]

Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements (3),(5)(iii): with Cov(v)={tα:α∈cov⁡(v)} the set of cover reflections, the negative skip roots are {−βt:t∈Cov(v)}; here cov⁡(v) is the positive-root set of The weak parabolic projection, its adjoints, and the cover-join lemmas (4). When s is initial in c and s∈Cov(v), one has v=s∨vJ.

Proof

technique · recognize the meet inversion set by rank-two traces; use the greatest-sortable-below projection for join closure; derive the initial-letter formula from parabolic projection, a cone wall and cover decomposition; then prove join preservation by induction on $(|S|,\ell(x\vee y))$
1.1F6F7F8F9F10F12givenalgebra

Let A≠∅ be a set of c-sortable elements and put I:=⋂a∈AN(a−1). Since W is finite, I is finite. In each noncommutative generalized rank-two subsystem, [F6]-[F7] put all the traces N(a−1) 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 I satisfies [F8], so [F8] gives a unique u∈W with N(u)=I; put m:=u−1, so N(m−1)=I. For every a∈A, N(m−1)⊆N(a−1), so m≤Ra by [F10]. If v is any lower bound of A, then N(v−1)⊆I=N(m−1), so v≤Rm; therefore m=⋀A and the displayed inversion-set identity holds. The same rank-two traces show m is c-aligned, hence c-sortable by [F6].

1.2F14givenalgebra

Fix s∈S and put Ds:={u:s̸≤Ru}. By [F14], ℓ(su)=ℓ(u)+1 for u∈Ds and ℓ(su)=ℓ(u)−1 otherwise. Thus u↦su sends Ds into {w:s≤Rw}. Conversely, if w≥Rs, write w=su with ℓ(w)=1+ℓ(u). If u≥Rs, then [F14] gives ℓ(su)=ℓ(u)−1, contradicting this equality, so u∈Ds; hence the map is onto. If u,v∈Ds and u≤Rv, write v=ux with additive length. Then sv=(su)x and ℓ(sv)=ℓ(su)+ℓ(x), so su≤Rsv. Conversely, if su≤Rsv, write sv=(su)x with additive length; cancellation gives v=ux, and the ascent identities give ℓ(v)=ℓ(u)+ℓ(x), so u≤Rv. Therefore left multiplication by s is an order isomorphism from Ds onto {w:s≤Rw}.

1.3F10F11F14F20givenalgebra

Suppose u⋖Rv, u̸≥Rs and v≥Rs. Then es∈N(v−1)∖N(u−1) by [F10]. The inclusion in [F10] and the one-length rise across a cover imply that this difference has one root, so it equals {es}. Write v=ur with r∈S by [F10] and [F14]. By [F11], the unique new prefix root in N(v−1) is ρ(u)er, hence ρ(u)er=es and uru−1=s. Using r2=1 from [F20], sv=s(ur)=(uru−1)(ur)=u=vr. Thus s is a cover reflection of v.

1.4baseih

We prove join preservation by lexicographic induction on (∣S∣,ℓ(x∨y)). If ∣S∣=0 or ℓ(x∨y)=0, then W={1} or x=y=1, respectively, and the identity holds. For every other pair, assume it holds for all pairs of smaller lexicographic measure. This is the induction hypothesis.

2.1F4F5F12step 1.1givenalgebra

Let A≠∅ be c-sortable and set w:=⋁A, which exists by [F12]. For every a∈A, a=πc(a)≤Rπc(w) by [F4]-[F5], so πc(w) is an upper bound of A and w≤Rπc(w). Since πc(w)≤Rw by [F4], we get w=πc(w); hence w is c-sortable. Together with step 1.1 this proves (2).

2.2F13F14step 1.2givenalgebra

If X,Y̸≥Rs, their rank-one parabolic prefixes are both 1. By join preservation of the parabolic prefix map in [F13], Z:=X∨Y also has rank-one prefix 1, so Z̸≥Rs. Step 1.2 shows sZ is an upper bound of sX,sY. If w is any common upper bound of sX,sY, then w≥Rs and we may write w=sw′ with w′:=sw and ℓ(w)=1+ℓ(w′). If w′≥Rs, [F14] would instead give ℓ(sw′)=ℓ(w′)−1, contradicting sw′=w and that length equality; hence w′̸≥Rs. Step 1.2 now gives X,Y≤Rw′, hence Z≤Rw′, and the same order isomorphism gives sZ≤Rw. Therefore sX∨sY=s(X∨Y).

2.3F4F5step 1.1givenalgebra

By monotonicity, πc(x∧y)≤Rπc(x)∧πc(y). The right side is c-sortable by step 1.1 and is below x∧y because πc(x)≤Rx and πc(y)≤Ry. Since πc(x∧y) is the greatest c-sortable element below x∧y by [F4], the reverse inequality holds. Thus πc(x∧y)=πc(x)∧πc(y).

2.4F2F5F13step 1.4givenalgebra

Suppose x,y̸≥Rs. The rank-one case of [F13] shows x∨y̸≥Rs, so [F2] computes all projections in WJ, where J=S∖{s}. The prefix join identity (x∨y)J=xJ∨WJyJ from [F13] and the induction hypothesis from step 1.4 applied in the lower-rank parabolic give πc(x∨y)=πc′(xJ∨WJyJ)=πc′(xJ)∨WJπc′(yJ)=πc(x)∨WJπc(y). These last two outputs lie in WJ by [F2], and their join in W equals their join in WJ: if a,b∈WJ, then F13,(3) gives a,b≤R(a∨Wb)J and (a∨Wb)J=a∨WJb, while (a∨Wb)J≤Ra∨Wb; hence a∨Wb=(a∨Wb)J. Thus the displayed value is πc(x)∨Wπc(y). Here xJ,yJ are their actual WJ-prefixes; no identity claim about them is needed.

2.5F3F4F5F10F11F16F17F18F19F21step 1.3givenalgebra

Let y̸≥Rs and put z:=s∨y. In a saturated chain from y to z, take the first cover u⋖Rv whose upper element satisfies v≥Rs. Its lower element is not above s, so step 1.3 gives v=su and s is a cover reflection of v. Since v is a common upper bound of both s and y, leastness gives z≤Rv; the chain gives v≤Rz, so v=z and s is a cover reflection of z. Let q:=πc(z). The one-letter element s is c-sortable, so πc(s)=s by [F5]; monotonicity gives s≤Rq. Since sz=u̸≥Rs and πc(sz)≤Rsz by [F5], πc(sz)̸≥Rs and therefore πc(sz)≠q. By [F18], zC⊆Conec(q) but (sz)C⊈Conec(q). Step 1.3 gives sz=zr for some r∈S, so s=zrz−1; by [F11], ρ(z)er=±es, and [F21] shows that rC is the adjacent chamber to C across Her: C∩Her is a facet, the reflection fixes it pointwise and exchanges its sides, and the arrangement is W-invariant. Applying z gives that zC and zrC are adjacent across zHer=Hρ(z)er=Hs 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 Hs intersects Hs in a proper subspace. Start at a relative-interior point of the facet. For each such hyperplane still containing the point, perturb within Hs 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 Hs. By [F17], the skip root normal to this wall is either es or −es. Since s≤Rz, [F10] gives ρ(z−1)es∈Φ−. For p∈C∘, invariance of B gives B(ρ(z)p,es)=B(p,ρ(z−1)es)<0 by [F16]-[F17]. Thus the included chamber is on the negative side of Hs, so the inward skip-root normal is −es. By [F19], −es=−βs in the negative skip basis means s∈Cov(q), so s is a cover reflection of q.

3.1F2F5F14F20step 1.4step 2.2givenalgebra

Suppose x,y≥Rs for an initial letter s of c, and put X:=sx, Y:=sy. Then X,Y̸≥Rs by [F14]. Applying step 2.2 to X,Y gives x∨y=s(X∨Y); since s2=1 by [F20], this is equivalent to X∨Y=s(x∨y), whose length is ℓ(x∨y)−1. By the recursion [F2], πc(x)=sπscs(X), πc(y)=sπscs(Y) and πc(x∨y)=sπscs(s(x∨y)). The induction hypothesis from step 1.4 for (X,Y) in the rotated system scs gives πscs(X∨Y)=πscs(X)∨πscs(Y); these two projection values are not above s because they lie below X,Y by [F5]. Applying step 2.2 again yields πc(x)∨πc(y)=s(πscs(X)∨πscs(Y))=sπscs(X∨Y)=πc(x∨y).

3.2F2F13F18F19step 2.5givenalgebra

By the initial cover decomposition [F19], q=s∨qJ for J=S∖{s}. Parabolic compatibility [F18] gives qJ=πc′(zJ), and join preservation of prefixes [F13] gives zJ=(s∨y)J=sJ∨yJ=yJ, since sJ=1. The rank-drop branch of [F2] gives πc(y)=πc′(yJ); hence qJ=πc(y) and πc(s∨y)=s∨πc(y)=πc(s)∨πc(y). This proves (3).

4.1F4step 1.4step 3.1step 3.2givenalgebra

In the mixed case, assume x≥Rs and y̸≥Rs, and put z:=s∨y. Then x,z≥Rs. Since x∨y is an upper bound of s and y, z≤Rx∨y; since y≤Rz, also x∨y≤Rx∨z, so x∨z=x∨y. The both-above case 3.1, whose induction step uses the shorter join s(x∨z), now gives πc(x∨y)=πc(x)∨πc(z). By step 3.2, πc(z)=πc(s)∨πc(y); monotonicity and s≤Rx give πc(s)≤Rπc(x), hence πc(x∨y)=πc(x)∨πc(y). This proves the join identity in every case.

5.1F1F5F15step 2.3step 2.4step 3.1step 4.1discharge-inductiongivenalgebra∎

Define φ:W/∼c→πc(W) by φ([x]c)=πc(x). It is well defined and injective by the definition of ∼c, and surjective by the definition of πc(W). By [F5], every image is c-sortable and every c-sortable element is fixed, so πc(W) is exactly the c-sortable sublattice. The quotient order is defined by [x]c≤c[y]c exactly when πc(x)≤Rπc(y), 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 πc-images is preserved by both meet and join, so by [F15] and the definition [F1], ∼c is a lattice congruence, the proposed class operations are representative-independent, and W/∼c is a lattice. The quotient map pc is surjective and preserves meet and join by those operations. All sets and inductions used here are finite, and no Choice is used.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

The upper endpoint of a c-Cambrian fiber, interval fibers and the explicit formula u_c(w) = pi_{c^{-1}}(ww0)w0

Statement

Let (W,S) be a Coxeter system of finite type with longest element w0, let c be a Coxeter element, πc the sortable projection, ∼c the sortable equivalence and W/∼c the sortable quotient of The sortable projection kernel and the c-Cambrian quotient, and let ∧,∨ be the weak-order lattice operations on W (Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics). For J⊆S write wJ for the WJ-prefix and Jw0:=w0(J)w0 for the minimal representative of WJw0 (The weak parabolic projection, its adjoints, and the cover-join lemmas (2)). Define the upper projection of c by uc ⁣:W→W,uc(w):=πc−1(ww0) w0, where c−1 is the Coxeter element inverse to c, with the reversed reduced word, and πc−1 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, usc in (1)(iii) is formed on WJ with longest element w0(J). Then:

(1) The terminal formula for πc and the recursions for uc. Let s∈S and J:=S∖{s}. (i) If s is final in c and ℓ(sw)<ℓ(w), then πc(w)=s∨πcs(wJ), where cs is the restriction of c to WJ obtained by deleting the final letter. (ii) If s is final in c and ℓ(sw)>ℓ(w), then uc(w)=s⋅uscs(sw). (iii) If s is initial in c and ℓ(sw)>ℓ(w), then uc(w)=sw0∧(usc(wJ)⋅Jw0).

(2) Monotonicity and idempotence of uc. The map uc is order preserving and idempotent, and w≤Ruc(w) for every w∈W.

(3) Fibers are closed intervals with these endpoints. For all x,y∈W, πc(x)=πc(y)  ⟺  uc(x)=uc(y),πc(uc(w))=πc(w),uc(πc(w))=uc(w). Consequently every ∼c-fiber is the closed interval [w]c={y∈W:πc(w)≤Ry≤Ruc(w)} with lower endpoint πc(w) and upper endpoint uc(w): 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 ∼c 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 c, and no noncrossing, cluster-fan or counting statement is made. No Choice is used.

Facts & Assumptions

Given: a finite-type Coxeter system (W,S), its longest element w0, a Coxeter element c, its inverse c−1 represented by the reversed reduced word, the sortable projections πc and πc−1, the right weak order ≤R, and the parabolic prefixes and longest elements.

[F1]

The sortable projection kernel and the c-Cambrian quotient (1)-(2) and Finite lattice congruences, interval endpoints and descending rooted-chain labels (1): ∼c is the kernel relation x∼cy  ⟺  πc(x)=πc(y); W/∼c, pc, its quotient order and the proposed class meet/join operations are defined there.

[F2]

The recursive initial-letter sortable projection: if s is initial in c, then πc(w)=sπscs(sw) when ℓ(sw)<ℓ(w) and πc(w)=πsc(wJ) when ℓ(sw)>ℓ(w), with J=S∖{s} and wJ the WJ-prefix; the inverse Coxeter element uses the reversed word.

[F3]

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 c-sortable because its sorting word lies in the first block of c∞.

[F4]

The weak parabolic projection, its adjoints, and the cover-join lemmas (1)-(3): N(wJ−1)=N(w−1)∩ΦJ,+; wJ is the greatest WJ-element below w and prefix projection is order-preserving; the prefix projection preserves joins; and its largest lift is zw0(J)w0.

[F5]

The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)(i)-(v): w02=1, ρ(w0)Φ+=Φ−, N(w0v)=Φ+∖N(v), ℓ(w0w)=ℓ(ww0)=ℓ(w0)−ℓ(w), and conjugation by w0 permutes S.

[F6]

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): x≤Ry means y=xv with additive length; a simple left multiplication changes length by 1 or −1; s≤Rw iff ℓ(sw)<ℓ(w); and x≤Ry iff N(x−1)⊆N(y−1).

[F7]

The geometric inversion set N(w) of an element of a Coxeter group (1)-(2): N(w)={α∈Φ+:ρ(w)α∈Φ−}, with the positive and negative root partition and the inversion-set convention used in the proof.

[F9]

The recursive projection is well defined, sortable-valued, below w, idempotent, descent-detecting and parabolic (1)-(4): πc(w) is well-defined, c-sortable and below w; it fixes sortable elements and is idempotent; and for an initial letter s, w≥Rs iff πc(w)≥Rs.

[F10]

Omega-positive words are commutation-equivalent to sortable sorting words; sortable equals aligned; parabolic restriction (3): if v is c-sortable, its WJ-prefix is sortable for the restricted Coxeter element on WJ; conversely a sortable element of WJ is c-sortable in W.

[F11]

Skip bases, cover roots, greatest-sortable projections, and the chamber union of each cone (1): πc(w) is the unique greatest c-sortable element below w.

[F12]

Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements (5)(ii): if s is final in c and v is c-sortable with v≥Rs, then v=s∨vJ.

[F13]

The cone criterion, monotonicity of the projection, and the greatest sortable element below w (2): πc is order-preserving; the same holds for any Coxeter element of a finite parabolic subsystem.

[F14]

Sortable elements form a sublattice and the c-Cambrian quotient is its lattice-homomorphic image (2): c-sortable elements are closed under nonempty joins, and their joins are c-sortable.

[F15]

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.

[F16]

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.

[F17]

The longest element as the opposition of the chamber, and longest elements of finite parabolics (2), applied to WJ: w0(J) is the longest element of the finite parabolic WJ and is an involution; applying the opposition assertion of [F5] within WJ gives N(w0(J)v)=ΦJ,+∖N(v) for v∈WJ.

[F18]

Sortable elements form a sublattice and the c-Cambrian quotient is its lattice-homomorphic image (4): the kernel relation ∼c is a lattice congruence with the quotient operations and quotient map already defined in The sortable projection kernel and the c-Cambrian quotient.

Proof

technique · derive the upper-projection recursions from the terminal projection formula and the longest-element anti-isomorphism; compare fibers by induction on rank and length; then identify each fiber as an interval and apply the finite-lattice interval criterion
1.1F4F5F6F7F17givenalgebra

Fix J=S∖{s} and let w=wJ⋅Jw be the length-additive parabolic factorization. The prefix inversion formula in [F4] and opposition in [F5] give N(((ww0)J)−1)=N((ww0)−1)∩ΦJ,+=N(w0w−1)∩ΦJ,+=ΦJ,+∖(N(w−1)∩ΦJ,+)=ΦJ,+∖N(wJ−1). Applying opposition inside WJ gives N(w0(J)wJ−1)=ΦJ,+∖N(wJ−1)=N((wJw0(J))−1). Both (ww0)J and wJw0(J) lie in WJ, so equality of their inverse inversion sets gives equality of the elements by the order criterion and antisymmetry in [F6]. Hence (ww0)J=wJw0(J).

1.2F3F4F10F11F12F14givenalgebra

Suppose s is final in c and ℓ(sw)<ℓ(w); set q:=πc(w) and v:=πcs(wJ). By [F3] and [F10], both s and v are c-sortable and lie below w, since s≤Rw and v≤RwJ≤Rw. Their join x:=s∨v is c-sortable by [F14] and below w, so x≤Rq by [F11]. Thus q≥Rs; the terminal cover decomposition [F12] gives q=s∨qJ. The prefix qJ is cs-sortable by [F10] and qJ≤RwJ by [F4], hence qJ≤Rv by [F11] applied inside WJ. Therefore q=s∨qJ≤Rs∨v=x, and with x≤Rq this proves πc(w)=s∨πcs(wJ).

1.3baseih

We prove by lexicographic induction on (∣S∣,ℓ(x)) that whenever x≤Ry and πc(x)=πc(y), one has uc(x)=uc(y). If S=∅, then W={1} and this holds; at every positive-rank pair assume it holds for all smaller measures, and fix an initial letter s of c.

1.4F5F6F9F13givenalgebra

Define τ(w):=ww0, so uc=τ∘πc−1∘τ. The map τ reverses right weak order: if y=xv with additive length, then xw0=yw0 (w0v−1w0) and ℓ(w0v−1w0)=ℓ(v) by [F5], so yw0≤Rxw0 by [F6]; since τ2 is the identity, this is an order anti-isomorphism. Therefore uc is order-preserving by [F13]. Since πc−1(ww0)≤Rww0 by [F9], applying τ gives w≤Ruc(w). Finally, uc(uc(w))=τ(πc−1(πc−1(ww0)))=τ(πc−1(ww0))=uc(w) by idempotence in [F9].

2.1F2F5F6F8F17step 1.1step 1.2step 1.4givenalgebra

If s is final in c and ℓ(sw)>ℓ(w), then s is initial in c−1 and ℓ(sww0)<ℓ(ww0) by [F5]. The initial-letter recursion [F2] gives πc−1(ww0)=sπ(scs)−1((sw)w0), so uc(w)=s uscs(sw), proving (1)(ii). If s is initial in c and ℓ(sw)>ℓ(w), then s is final in c−1 and ℓ(sww0)<ℓ(ww0); apply step 1.2 to c−1 and ww0 to get πc−1(ww0)=s∨π(sc)−1((ww0)J). Multiplying on the right by w0 converts the join to a meet by the order reversal in step 1.4; using (ww0)J=wJw0(J) from step 1.1 and w0(J)2=1 gives uc(w)=sw0∧(π(sc)−1(wJw0(J))w0)=sw0∧(usc(wJ) Jw0), where usc is formed inside WJ with longest element w0(J) and Jw0=w0(J)w0. This proves (1)(iii).

3.1F2F4F6F9step 1.3step 2.1givenalgebra

Continue the induction of step 1.3. Suppose x≤Ry and πc(x)=πc(y). If ℓ(sx)<ℓ(x), then ℓ(sy)<ℓ(y) because s≤Rx≤Ry by [F6]. Write y=xv with additive length. Then sy=(sx)v and ℓ(sy)=ℓ(sx)+ℓ(v), so sx≤Rsy. The recursion [F2] gives πscs(sx)=πscs(sy); since ℓ(sx)=ℓ(x)−1, the induction hypothesis yields uscs(sx)=uscs(sy). In scs, the letter s is final and sx,sy have left ascent s, so step 2.1(ii) gives uscs(sx)=suc(x) and uscs(sy)=suc(y); cancellation proves uc(x)=uc(y). If instead ℓ(sx)>ℓ(x) but ℓ(sy)<ℓ(y), then πc(x)=πsc(xJ)≤Rx lies outside the filter above s, while πc(y)=sπscs(sy) lies in that filter: indeed sy̸≥Rs, and πscs(sy)≤Rsy by [F9], so left multiplication by s lengthens this projection by one. This contradicts πc(x)=πc(y). Thus both are left ascents. The parabolic prefix is order-preserving by [F4], so xJ≤RyJ; the recursion gives πsc(xJ)=πsc(yJ), and the induction hypothesis in lower rank gives usc(xJ)=usc(yJ). Formula 2.1(iii), with the same sw0 and Jw0 for both inputs, now yields uc(x)=uc(y). This completes the comparable-pair induction.

4.1F5F9step 3.1step 1.4givenalgebra

For arbitrary x,y with πc(x)=πc(y)=v, [F9] gives v≤Rx,y and πc(v)=v. Applying the comparable-pair result of step 3.1 to (v,x) and (v,y) gives uc(x)=uc(v)=uc(y). Conversely, if uc(x)=uc(y), then πc−1(xw0)=πc−1(yw0) by the definition of uc; the forward implication just proved for arbitrary pairs, applied to c−1, gives uc−1(xw0)=uc−1(yw0). By definition these are πc(x)w0 and πc(y)w0, so πc(x)=πc(y). Thus the two fiber partitions agree. The forward implication and idempotence of πc also give uc(πc(w))=uc(w). Applying this identity to c−1 and using uc(w)w0=πc−1(ww0) yields πc(uc(w))w0=uc−1(uc(w)w0)=uc−1(πc−1(ww0))=uc−1(ww0)=πc(w)w0, so πc(uc(w))=πc(w).

5.1F9F13step 1.4step 4.1givenalgebra

If y∈[x]c, then πc(y)=πc(x), so step 4.1 gives uc(y)=uc(x); by [F9] and step 1.4, πc(x)=πc(y)≤Ry≤Ruc(y)=uc(x). Conversely, if πc(x)≤Ry≤Ruc(x), monotonicity [F13] and step 4.1 give πc(x)=πc(πc(x))≤Rπc(y)≤Rπc(uc(x))=πc(x), so πc(y)=πc(x). Thus [x]c=[πc(x),uc(x)] with the asserted endpoints; the endpoint maps are order-preserving by [F13] and step 1.4.

6.1F1F15F16F18step 5.1discharge-inductiongivenalgebra∎

The classes are intervals by step 5.1, and their endpoint maps are order-preserving there; applying [F16] shows that ∼c 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