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 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.
Depends on
- The recursive initial-letter sortable projection
- Skip bases, cover roots, greatest-sortable projections, and the chamber union of each cone
- c-sortable elements, forced and unforced skips, skip roots, and the chamber cone
- Coxeter elements, the oriented Euler form, the skew form, and the periodic word
- 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
- Finite lattice congruences, interval endpoints and descending rooted-chain labels
Used by
- The c-Cambrian quotient of S3 for both orientations: fibers, endpoints and meet/join preservation Example
- Sortable elements form a sublattice and the c-Cambrian quotient is its lattice-homomorphic image Theorem
- 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
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
- 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)