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 weak parabolic projection, its adjoints, and the cover-join lemmas
Statement
Let be a Coxeter system of finite type, with finite; finite type means is finite (Coxeter diagrams: edges, labels, components and finite type (4)). Use the right and left weak orders, covers, meets and joins of The right and left weak orders, intervals, covers, and meets and joins of subsets, and the inversion sets of The geometric inversion set of an element of a Coxeter group. For , write for the unique length-additive factorization with and the minimal representative of the right coset (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3), Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2)); call the -prefix of . Put , where and (Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2)). Let and be the longest elements of and , respectively (The longest element as the opposition of the chamber, and longest elements of finite parabolics).
(1) Inversion set of the prefix. For every ,
Consequently is the greatest element of below in , the map is order-preserving, and for every one has if and only if .
(2) The largest lift. For every , the largest element with is
It satisfies , and
For every , if and only if .
(3) Meet and join preservation. For all ,
Thus is a surjective lattice homomorphism from the finite weak order on to the induced weak order on .
(4) Cover-join lemmas. For define its set of cover roots by
For put . Then:
(i) if and for every , then ;
(ii) if , then .
No Axiom of Choice (AC) is used.
Facts & Assumptions
Given: finite type , its root system , canonical reflection representation , length function , and the right and left weak orders.
Finite type, or spherical type, is the condition that is finite (Coxeter diagrams: edges, labels, components and finite type (4)).
In the right weak order, a join is the least upper bound and a meet is the greatest lower bound when they exist (The right and left weak orders, intervals, covers, and meets and joins of subsets (3)).
The right weak order satisfies exactly when (Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (4)).
If a Coxeter system is finite, its right weak order is a lattice (Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics (2)); this applies to and to each finite once its Coxeter-system structure is identified by [F14].
For finite , , , and (The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)).
Every right coset has a unique minimal representative , characterized by for all ; every has a unique factorization with and this , , and for every (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3)).
The standard parabolic subgroup is (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (1)).
The map , , is a bijection (The inversion formula , the root-reflection dictionary and strong exchange (1)).
If , the root-reflection dictionary defines (The inversion formula , the root-reflection dictionary and strong exchange (1)).
Every root is positive or negative, with and (Root sign coherence and the action of simple reflections on positive roots (2)).
The support is independent of the reduced expression, and if and only if ; hence every reduced expression of an element of uses only letters of (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1)).
Every cover has the form for some with (Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (2)).
For each , is a Coxeter system and its intrinsic length agrees with the ambient length on (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)).
For finite , and for (The longest element as the opposition of the chamber, and longest elements of finite parabolics (2)).
For a reduced word , , these roots are distinct and positive, and (The inversion formula , the root-reflection dictionary and strong exchange (2)).
For every , permutes and sends to (Root sign coherence and the action of simple reflections on positive roots (3)).
The right and left weak orders are partial orders (Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (1)).
If , there is a chain of simple-generator covers from to with exactly covers (Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (2),(3)).
For each positive root , exactly when (Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2)).
The right weak order is defined by exactly when and for some (The right and left weak orders, intervals, covers, and meets and joins of subsets (1)).
Proof
Finite setup and notation. By [F1], is finite, and each is finite. Fix and . Write for its unique length-additive factorization, with minimal in by [F6]; , , , , and have the meanings fixed in the Statement and [F7]-[F9],[F15].
The minimal representative above the parabolic factor. Let and . By [F5], has length . For each , [F15] gives and [F5] gives . Thus has no left descent in and is the minimal representative of by [F6]. Since by [F15], . Therefore is the length-additive parabolic factorization with prefix , and . Also by [F8],[F16], and its cardinality is by [F16],[F23]; consequently sends every positive subsystem root to a negative subsystem root.
Deleting a cover root. For choose with and , and write a reduced word . Then by [F25]; hence the unique positive root for this reflection is by [F10]. It is the last prefix root of ; the prefix formula for therefore gives . Conversely every cover predecessor is for a generator by [F13], and its conjugate reflection has by the prefix formula [F16]; hence with . Thus cover predecessors correspond exactly to deleting their cover roots.
Prefix inversion set. Choose a reduced expression with letters in (available by [F12]) and a reduced expression . Their concatenation is reduced by [F6]. The prefix roots for indices in the formula [F16] are the prefix roots of and lie in , because their reflections are words in and [F8] identifies the roots of . If a suffix index had prefix root , then by [F22]. Write with and . By [F16], , and [F25] gives ; hence , where is represented by the suffix word with deleted and has length at most . Since , , so . This contradicts the minimality of . Thus no suffix root lies in , while all prefix roots do; the inversion formula gives .
Inversion set of the lift. Let . If , then is a root of the subsystem. By step 1.2, reverses the sign of subsystem roots, while reverses the sign of every root; therefore exactly when , so exactly when . If , choose reduced words for and ; their letters lie in by [F12]. At every letter , the current root remains outside : since is invertible and preserves by [F8], it cannot send a vector outside into . Thus the current root is never , and [F17] keeps it positive. Then sends the resulting positive root to a negative root by [F5], so every such belongs to . This proves .
Greatest prefix and order-preserving projection. If , [F12] says every reduced word for uses only letters of , so every prefix root of a reduced word for lies in by [F8] and [F16]. Thus, when , the criterion [F3] and step 2.1 give , so ; conversely by the factorization [F6] and the definition [F24]. This proves the greatest-element claim and for . If , intersect with and apply step 2.1 to both prefixes; [F3] gives .
Cover-join clause (4)(i). Let and assume the hypotheses of (i). By [F16], , so implies by [F3]; also by the length-additive factorization [F6] and the definition [F24]. The element is therefore a common upper bound. Suppose a strict common upper bound existed. By [F20], choose a cover predecessor with ; by step 1.3 it deletes some . If , then , so by [F3]. If , then by hypothesis and by [F22]; steps 2.1 and 1.3 give , so by [F3]. Both cases contradict and . Hence no strict common upper bound lies below . The join exists by [F4], and by its least-upper-bound definition [F2] is at most ; it equals .
Largest-lift adjunction. If , step 2.1 gives , so by step 2.2 and by [F3]. Conversely, if , order preservation from step 3.1 gives . More generally, if , then , while every root outside is in ; hence and . This proves the largest-lift claim and its stated equivalence.
Meet preservation. The finite weak orders on and are lattices by [F4] and [F14]. For , step 3.1 gives exactly when . By the meet definition [F2], for every , exactly when and , exactly when and , exactly when , exactly when . Both candidate meets lie in , so antisymmetry [F19] yields .
Join preservation and surjectivity. Put and let be its largest lift from step 4.1. Since , the adjunction in step 4.1 gives , so and order preservation gives . Conversely, order preservation applied to gives , hence . The join definition [F2] makes the least upper bound of ; the two bounds and antisymmetry [F19] yield . If , then its parabolic factorization is , so ; the projection is onto .
Cover-join clause (4)(ii): the simple root and other parabolic covers. Let and put . By [F12], every reduced expression of uses letters in , so [F16] and [F8] give . Since , the simple basis vector is not in and hence not in . Thus by [F16], and step 2.1 gives . The inversion criterion [F3] and partial order [F19] imply . Hence projection-join preservation in step 5.1 gives . Further, , because by [F16] and ; thus . Choose a cover predecessor with by [F20]. Since , [F16] and [F3] give ; if , step 1.3 says no cover predecessor deletes it, so and , contradicting that is the join of and . Hence . If and , then by [F22]. The predecessor deletes only by step 1.3, so it retains and retains ; hence , again contradicting the join. Therefore every such lies in .
The cover roots inside the parabolic. Since by step 5.1, write with the minimal right-coset representative. If , step 6.1 gives , so by [F22]. Since , remains the minimal representative of this coset by [F6], and is the length-additive parabolic factorization. Thus its prefix is ; as covers , lengths give . Intersecting the deletion formula of step 1.3 with and using step 2.1 gives . By [F3], , and the length difference one makes it a cover by [F20]; hence . Conversely let . By [F12], a reduced word for uses only letters in ; its prefix roots have the form in [F16] and lie in by [F8], so by [F22]. Put and . Since for some with , [F24] gives ; therefore is an upper bound of and [F2] gives . Step 5.1 gives and , so ; hence . Choose with by [F20], and let be its deleted root from step 1.3. Since , if then and , contradicting the join. If , then step 1.3 gives ; because , the deleted root cannot lie in this latter set, so . Therefore and . This proves .
Choice and conclusion. Steps 2.1 and 3.1 prove (1); steps 1.2, 2.2 and 4.1 prove (2); steps 4.2 and 5.1 prove (3); step 3.2 proves (4)(i); and steps 6.1 and 7.1 prove (4)(ii). Since is finite and each witness is selected from a finite interval or one fixed reduced expression at a time, no Axiom of Choice is used.
Depends on
- Coxeter diagrams: edges, labels, components and finite type
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
- Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups
- Root sign coherence and the action of simple reflections on positive roots
- The geometric inversion set $N(w)$ of an element of a Coxeter group
- The right and left weak orders, intervals, covers, and meets and joins of subsets
- The inversion formula $|N(w)|=\ell(w)$, the root-reflection dictionary and strong exchange
- Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives
- Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion
- The longest element as the opposition of the chamber, and longest elements of finite parabolics
- Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics
Used by
- c-sortable elements, forced and unforced skips, skip roots, and the chamber cone Definition
- The recursive initial-letter sortable projection Definition
- All skips and the cone walls of the sortable element s1s2 in A3 Example
- Omega-positive words are commutation-equivalent to sortable sorting words; sortable equals aligned; parabolic restriction Lemma
- Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements Lemma
- The cone criterion, monotonicity of the projection, and the greatest sortable element below w Lemma
- The recursive projection is well defined, sortable-valued, below w, idempotent, descent-detecting and parabolic Lemma
- Skip bases, cover roots, greatest-sortable projections, and the chamber union of each cone Theorem
- 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
53 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)