Math 2.0

Group theory and generalizations Example

Bruhat order

Builds on Coxeter groupReduced wordSymmetric groupWeak order of permutations

Example

Let (W,S)(W, S) be a Coxeter system, let ℓ(w)\ell(w) be the length of w∈Ww \in W with respect to SS, and let T={wsw−1:w∈W,s∈S}T = \set{w s w^{-1} : w \in W, s \in S} be the set of reflections. For u,w∈Wu, w \in W, write u→wu \to w when w=utw = u t for some t∈Tt \in T and ℓ(u)<ℓ(w)\ell(u) < \ell(w). The Bruhat order is the reflexive and transitive closure of →\to: u≤wu \le w when there is a sequence u=u0→u1→⋯→uk=wu = u_0 \to u_1 \to \cdots \to u_k = w with k≥0k \ge 0. It is a partial order on WW, graded by the length ℓ\ell. By the subword property, u≤wu \le w if and only if some reduced word for ww has a subword that is a reduced word for uu.

Check in the symmetric group S3S_3 with S={s1,s2}S = \set{s_1, s_2}, the adjacent transpositions. Its elements are ee of length 00, s1,s2s_1, s_2 of length 11, s1s2,s2s1s_1 s_2, s_2 s_1 of length 22, and s1s2s1s_1 s_2 s_1 of length 33. Each element of length 22 has a reduced word that contains both s1s_1 and s2s_2 as subwords. So both s1s_1 and s2s_2 lie below both s1s2s_1 s_2 and s2s1s_2 s_1. So the Bruhat order on S3S_3 has the bottom ee, the top s1s2s1s_1 s_2 s_1, and all four relations between the two middle levels.

Remarks

The Bruhat order contains the weak order: in S3S_3 the weak order has only two of the four relations between the middle levels. For SnS_n, the reflections are the transpositions, so u→wu \to w when ww comes from uu 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Coxeter group concept
  2. Permutation concept
  3. Reduced word concept
  4. Symmetric group concept
  5. Weak order of permutations example
  6. Bruhat order example

Further reading

  1. Web https://en.wikipedia.org/wiki/Bruhat_order
About this page
TagA17Q3X6285
URIm2://A17Q3X6285
Kindexample
WritingW0 stub
MSC20F55, 06A07
Instance ofGraded poset
UsesCoxeter group, Reduced word, Symmetric group, Weak order of permutations
Same as
Changed2 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.