Bruhat order
In mathematics, the Bruhat order (also called the strong order, strong Bruhat order, Chevalley order, Bruhat–Chevalley order, or Chevalley–Bruhat order) is a partial order on the elements of a Coxeter group, that corresponds to the inclusion order on Schubert varieties.
History
[edit]The Bruhat order on the Schubert varieties of a flag manifold or a Grassmannian was first studied by Ehresmann (1934), and the analogue for more general semisimple algebraic groups was studied by Chevalley (1958). Verma (1968) started the combinatorial study of the Bruhat order on the Weyl group, and introduced the name "Bruhat order" because of the relation to the Bruhat decomposition introduced by François Bruhat.
The left and right weak Bruhat orderings were studied by Björner (1984).
Definition
[edit]If (W, S) is a Coxeter system with generators S, then the Bruhat order is a partial order on the group W. The definition of Bruhat order relies on several other definitions: first, reduced word for an element w of W is a minimum-length expression of w as a product of elements of S, and the length ℓ(w) of w is the length of its reduced words. Then the (strong) Bruhat order is defined by u ≤ v if some substring of some (or every) reduced word for v is a reduced word for u. (Here a substring is not necessarily a consecutive substring.)
There are two other related partial orders:
- the weak left (Bruhat) order is defined by u ≤L v if some final substring of some reduced word for v is a reduced word for u, and
- the weak right (Bruhat) order is defined by u ≤R v if some initial substring of some reduced word for v is a reduced word for u.
For more on the weak orders, see the article Weak order of permutations.
Bruhat graph
[edit]The Bruhat graph is a directed graph related to the (strong) Bruhat order. The vertex set is the set of elements of the Coxeter group and the edge set consists of directed edges (u, v) whenever u = tv for some reflection t and ℓ(u) < ℓ(v). One may view the graph as an edge-labeled directed graph with edge labels coming from the set of reflections. (One could also define the Bruhat graph using multiplication on the right; as graphs, the resulting objects are isomorphic, but the edge labelings are different.)
The strong Bruhat order on the symmetric group (permutations) has Möbius function given by , and thus this poset is Eulerian, meaning its Möbius function is produced by the rank function on the poset.
See also
[edit]References
[edit]- Björner, Anders (1984), "Orderings of Coxeter groups", in Greene, Curtis (ed.), Combinatorics and algebra (Boulder, Colo., 1983), Contemp. Math., vol. 34, Providence, R.I.: American Mathematical Society, pp. 175–195, ISBN 978-0-8218-5029-9, MR 0777701
- Björner, Anders; Brenti, Francesco (2005), Combinatorics of Coxeter groups, Graduate Texts in Mathematics, vol. 231, Berlin, New York: Springer-Verlag, doi:10.1007/3-540-27596-7, ISBN 978-3-540-44238-7, MR 2133266
- Chevalley, C. (1958), "Sur les décompositions cellulaires des espaces G/B", in Haboush, William J.; Parshall, Brian J. (eds.), Algebraic groups and their generalizations: classical methods (University Park, PA, 1991), Proc. Sympos. Pure Math., vol. 56, Providence, R.I.: American Mathematical Society, pp. 1–23, ISBN 978-0-8218-1540-3, MR 1278698
- Ehresmann, Charles (1934), "Sur la Topologie de Certains Espaces Homogènes", Annals of Mathematics, Second Series (in French), 35 (2), Annals of Mathematics: 396–443, doi:10.2307/1968440, ISSN 0003-486X, JFM 60.1223.05, JSTOR 1968440
- Verma, Daya-Nand (1968), "Structure of certain induced representations of complex semisimple Lie algebras", Bulletin of the American Mathematical Society, 74: 160–166, doi:10.1090/S0002-9904-1968-11921-4, ISSN 0002-9904, MR 0218417