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.
All meets and joins of the right weak order of (), with the left order and the inversion sets compared
Example
Let be the Coxeter matrix of type : , , let be the presented group with length , identified with the symmetric group by Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4), and let be the weak orders of The right and left weak orders, intervals, covers, and meets and joins of subsets. Then with and , , , , and:
(1) Covers and the lattice table. The right weak order has exactly the cover relations , , , , , , so its Hasse diagram is the hexagon formed by the two chains and . Meets and joins are the following complete table: on elements of one chain, meet and join are the smaller and the larger; across the two chains one has
and for the four pairs and their reversals, as well as whenever one of equals . In particular and , and every meet and join in the table is the unique element with the corresponding universal bound property.
(2) Left order and inversion. The left weak order is the image of the right order under : for example but , while but . With the simple roots and the positive root of , the six inversion sets are
for respectively, and the criterion of Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (4) is verified on all pairs.
Facts & Assumptions
Given: The Coxeter matrix of type : , ; the presented group with length , weak orders , canonical reflection representation on with basis , Coxeter form , and signed root system
Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups: the Coxeter presentation has relators for and for distinct generators when ; in type , and .
Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups: is generated by and is the minimum length of a word in representing , with ; reduced expressions realize this minimum.
Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4): for the type- matrix, extends to an isomorphism .
Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (2): iff for some with , and every comparison is a chain of such covers.
Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (1): both weak orders are partial orders with minimum , and inversion is an order isomorphism .
Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics (2): if is finite, both weak orders have minimum and maximum , with and .
The real Coxeter form, its radical, reflections, and form-preserving maps (2): is symmetric, , and .
The canonical reflection homomorphism, roots, reflections, and the positive cone (1): is a homomorphism with for every .
The canonical reflection homomorphism, roots, reflections, and the positive cone (2): is the orbit of the simple roots.
The inversion formula , the root-reflection dictionary and strong exchange (2): for every reduced expression , , with the displayed elements pairwise distinct positive roots.
Double-angle and quadratic power-reduction identities: for every real .
Signs, monotonicity intervals, and ranges of sine and cosine: cosine is strictly decreasing on for every integer .
The right and left weak orders, intervals, covers, and meets and joins of subsets (3): a meet is a greatest lower bound and a join is a least upper bound, with their universal lower- and upper-bound properties.
In a poset, common lower bounds form the intersection of the down-sets, and common upper bounds form the intersection of the up-sets. Their greatest and least elements, respectively, are the meet and join.
Proof
The six elements: the type- isomorphism and inversion-length formula [F3,F4] give , , and . The values are distinct: has length by [F2], the isomorphism separates and , elements of different lengths are distinct, and would imply after right multiplication by , contradicting their lengths. From the presentation [F1], and ; hence , while is an involution. Therefore , and the six displayed elements exhaust .
The root set and reflection actions: put . By [F18,F19], , so . Since , [F20] and [F21] give , hence . From the Coxeter form and reflection formula [F11,F12], , , , and ; thus and . These actions and linearity show that is invariant under both generators. Since is generated by [F2] and is a homomorphism [F13], every preserves . The root-orbit definition [F14] gives ; conversely are roots, , , , and , so . The positive cone and sign theorem [F15] then give , where and .
Covers: the cover characterization [F7] says a right cover is right multiplication by a simple generator with length rise one. Multiplying the six values of step 1.1 by gives the rises , , , , , and ; each raises length by one by [F4]. The other six products are , , , , , and , none of which raises length. Hence the right covers are exactly the six displayed in the statement.
The asymmetry: and , so by [F5]. If , [F6] gives and ; right multiplication by gives , contradicting . Likewise with gives , while would force and , impossible. Inversion is an order isomorphism by [F9], consistent with these comparisons.
The six inversion sets: by the definition [F16] and prefix-root formula [F17], the reduced expressions from step 1.1 and the roots from step 1.2 give , , , , and . For , the same formula gives , since .
The right order: the cover chains of step 2.1 and the chain characterization in [F7] give exactly the relations: for all six ; ; ; ; ; and . The remaining of the ordered pairs do not satisfy ; eight have incomparable entries, and eleven are reversals of strict comparisons. The down-sets are , , , , and ; the up-sets are , , , , and . The minimum and poset properties used here are in [F9].
The order isomorphism: inversion is an order isomorphism by [F9], so left weak order is the image of the right order under . In particular, but , while but , as shown in step 2.2.
Meets: intersections of down-sets from step 3.1 are for the four cross pairs ; they are the down-set of the smaller element for pairs in one chain, and the down-set of the other element when one is . By [A1] their greatest elements are the greatest common lower bounds, so the cross-pair meets are , the meet along a chain is its smaller element, and for . Each listed value lies below both elements and dominates every common lower bound, the universal property in [F22]. For the empty meet every element is a lower bound, and the maximum gives , in agreement with [F10].
Joins: intersections of up-sets from step 3.1 are for the four cross pairs and for every pair containing ; on a chain, the intersection is the up-set of the larger element. By [A1] their least elements are the least common upper bounds, so every cross-pair join and every join involving is , and joins along a chain are its larger element. Each listed value is an upper bound and lies below every common upper bound, the universal property in [F22]. For the empty join every element is an upper bound, and the minimum gives , in agreement with [F10].
The criterion on all pairs: write . The six sets of step 2.3 are , , , , , and . Their inclusion relations consist of the six reflexive pairs; the five strict inclusions from to every nonempty set; the four inclusions from each singleton to its containing intermediate set and to the full set; and the two inclusions from the intermediate sets to the full set, for relations total. The remaining ordered pairs do not satisfy the directed inclusion . Comparing these inclusions and failures with the corresponding right-order relations and failures from step 3.1 proves, in both directions, on all pairs by [F8]. No Choice is used.
Depends on
- The right and left weak orders, intervals, covers, and meets and joins of subsets
- The real Coxeter form, its radical, reflections, and form-preserving maps
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion
- Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
- The inversion formula $|N(w)|=\ell(w)$, the root-reflection dictionary and strong exchange
- 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
- Double-angle and quadratic power-reduction identities
- Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions
- Signs, monotonicity intervals, and ranges of sine and cosine
- Quarter-turn values and shifts by pi/2 and pi
Used by
Dependency tree · two levels
82 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
- Anders Bjorner and Francesco Brenti, Combinatorics of Coxeter Groups (Graduate Texts in Mathematics 231, Springer 2005; author-hosted complete PDF) (standard reference, not scraped)
- John R. Stembridge, On the fully commutative elements of Coxeter groups (author-hosted preprint, September 1995 revision) (standard reference, not scraped)