Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge 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.

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.

Depends on

Used by

Dependency tree · two levels

34 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