Group theory and generalizations Example
Bruhat order
Builds on Coxeter groupReduced wordSymmetric groupWeak order of permutations
Example
Let be a Coxeter system, let be the length of with respect to , and let be the set of reflections. For , write when for some and . The Bruhat order is the reflexive and transitive closure of : when there is a sequence with . It is a partial order on , graded by the length . By the subword property, if and only if some reduced word for has a subword that is a reduced word for .
Check in the symmetric group with , the adjacent transpositions. Its elements are of length , of length , of length , and of length . Each element of length has a reduced word that contains both and as subwords. So both and lie below both and . So the Bruhat order on has the bottom , the top , and all four relations between the two middle levels.
Remarks
The Bruhat order contains the weak order: in the weak order has only two of the four relations between the middle levels. For , the reflections are the transpositions, so when comes from by swapping two entries and the number of inversions goes up.
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Coxeter group concept
- Permutation concept
- Reduced word concept
- Symmetric group concept
- Weak order of permutations example
- Bruhat order example
Further reading
About this page
| Tag | A17Q3X6285 |
|---|---|
| URI | m2://A17Q3X6285 |
| Kind | example |
| Writing | W0 stub |
| MSC | 20F55, 06A07 |
| Instance of | Graded poset |
| Uses | Coxeter group, Reduced word, Symmetric group, Weak order of permutations |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.