Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
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 (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.

Depends on

Used by

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