리 이론

Bruhat Decomposition

Bruhat decomposition, homogeneous space cell decomposition, parabolic subgroups, and Grassmannian Schubert varieties

Posted Updated

In general, when a geometric object is given, we decompose it into smaller pieces in order to understand its structure. For instance, the most manageable topological spaces are CW complexes, and decomposing them into a cell structure allows concrete computations. Since a Lie group is simultaneously an algebraic and a geometric object, we can try this approach, and the Bruhat decomposition introduced in §Borel Subgroups, ⁋Proposition 16 plays precisely this role.

In this post, after examining the Bruhat decomposition in a bit more detail, we generalize from the Borel subgroup \(B\) to a larger parabolic subgroup \(P\supseteq B\) containing it, and examine the cell decomposition of the partial flag variety \(G/P\).

Coxeter group and length function

What distinguishes the Bruhat decomposition from an ordinary cell decomposition is that the cells do not arise arbitrarily, but naturally as orbits of the action on \(G/B\) of the Borel subgroup \(B\). More importantly, the set of these orbits \(B\backslash G/B\) is indexed precisely by the Weyl group \(W\) of §Root Systems, ⁋Definition 17. Therefore, the geometry of each cell is completely reduced to the combinatorics of \(W\), and it is precisely here that the root system reappears.

To this end, we first define a Coxeter group.

Definition 1 For a group \(W\) and its generators \(S=\{s_1,\ldots,s_r\}\), the pair \((W,S)\) is called a Coxeter system if \(W\) has the following presentation:

\[W=\left\langle s_1,\ldots,s_r\;\middle\vert\;(s_is_j)^{m_{ij}}=e\right\rangle\]

Here \(m_{ii}=1\), and for \(i\neq j\), \(m_{ij}=m_{ji}\in\{2,3,\ldots,\infty\}\). In this case, the group \(W\) itself is called a Coxeter group.

The condition \(m_{ii}=1\) means that each generator is an involution satisfying \(s_i^2=e\), and for \(i\neq j\), the relation \((s_is_j)^{m_{ij}}=e\) is called the braid relation. For example, if \(m_{ij}=2\), then \(s_is_j=s_js_i\), that is, the two generators commute, and if \(m_{ij}=3\), then \(s_is_js_i=s_js_is_j\). The case \(m_{ij}=\infty\) means that no relation is imposed between \(s_i\) and \(s_j\).

The smallest nontrivial case is that of two generators. If \(S=\{s_1,s_2\}\) and \(m_{12}=m\), then \((W,S)\) is precisely the dihedral group of order \(2m\) ([Algebraic Structures] §Semigroups, Monoids, and Groups, ⁋Example 16), and the two generators are realized as reflections across two adjacent axes of symmetry of a regular \(m\)-gon, with their product \(s_1s_2\) being a rotation of order \(m\). A general Coxeter group can be understood as such dihedral pieces glued together along shared generators. Indeed, for any two generators \(s_i,s_j\), the subgroup \(\langle s_i,s_j\rangle\) they generate is always the dihedral group of order \(2m_{ij}\), and the essence of the presentation in Definition 1 is that there are no new relations involving three or more generators beyond these pairwise ones.

The symmetric matrix formed by these integers \(m_{ij}\) encodes all the information of the Coxeter system, and finite reflection groups are characterized precisely as finite Coxeter groups.

Proposition 2 The Weyl group \(W\) is generated by the set of simple reflections \(S=\{s_1,\ldots,s_r\}\), and \((W,S)\) forms a Coxeter system. Moreover, each \(m_{ij}\) (\(i\neq j\)) is one of \(2,3,4,6\).

Proof

That \(W\) is generated by reflections is the definition in §Root Systems, ⁋Definition 17. For two simple reflections \(s_i,s_j\), their product \(s_is_j\) is a rotation on the 2-dimensional plane spanned by \(\alpha_i\) and \(\alpha_j\), and the angle of rotation is twice the angle formed by the two simple roots. As checked in §Root Systems, the angle that two distinct simple roots can form is one of \(90^\circ,120^\circ,135^\circ,150^\circ\), so for \(s_is_j\), the order \(m_{ij}\) is \(2,3,4,6\), respectively. That \(W\) is completely determined by these braid relations alone is the most nontrivial part, which is precisely the content of Coxeter’s theorem.

In our case, these integers \(m_{ij}\) are read directly from the Dynkin diagram in §Borel Subgroups, ⁋Definition 1. If two vertices are not connected, then \(m_{ij}=2\); a single edge gives \(3\), a double edge \(4\), and a triple edge \(6\). For instance, in the diagram of §Borel Subgroups, ⁋Definition 8, for type \(A_{n-1}\), adjacent simple reflections in the Weyl group \(W=S_n\) have \(m=3\), and thus satisfy the familiar braid relation \(s_is_{i+1}s_i=s_{i+1}s_is_{i+1}\).

Given a Coxeter system \((W,S)\), we can measure the “cost” of expressing each element as a product of generators.

Definition 3 In a Coxeter system \((W,S)\), for an element \(w\), the length of \(w\), \(\ell(w)\), is, when writing \(w\) as a product of simple reflections \(w=s_{i_1}\cdots s_{i_k}\), the smallest \(k\) required. An expression of length \(\ell(w)\) is called a reduced expression of \(w\).

By definition, \(\ell(e)=0\), \(\ell(s_i)=1\), and \(\ell(w^{-1})=\ell(w)\). The meaning of the length function is most transparently revealed through the root system, and its starting point is the fact that the effect of a simple reflection on the entire set of positive roots is extremely limited.

According to the reflection formula in §Root Systems, ⁋Definition 9, the simple reflection \(s_i\) sends \(\alpha_i\) to \(-\alpha_i\). For the remaining positive roots \(\beta\in\Phi^+\), \(\beta\neq\alpha_i\), if we think of writing \(\beta\) as a positive linear combination of simple roots, at least one coefficient other than that of \(\alpha_i\) is positive; since using the Cartan integer \(\langle\beta,\alpha_i\rangle\) from that definition allows us to write

\[s_i(\beta)=\beta-\langle\beta,\alpha_i\rangle\alpha_i\]

the only coefficient altered in \(s_i(\beta)\) is that of \(\alpha_i\), and therefore the positive coefficient mentioned above still remains positive. That is, when \(s_i\) acts, the only root that was a positive root and turns into a negative root is \(\alpha_i\) alone, and therefore, each time an arbitrary Weyl group element \(w\) is multiplied by a simple reflection, the number of positive roots that \(w\) sends to negative roots increases or decreases by exactly \(1\).

Therefore, tracing this from the identity along a reduced expression, we see that the change in length when passing from \(w\) to \(ws_i\),

\[\ell(ws_i)=\ell(w)\pm1\]

precisely reflects this in its increase or decrease. That is, for any \(w\in W\),

\[\ell(w)=\lvert\Phi^+\cap w^{-1}\Phi^-\rvert\]

holds. The set \(\Phi^+\cap w^{-1}\Phi^-=\{\alpha\in\Phi^+\mid w\alpha\in\Phi^-\}\) on the right-hand side is called the inversion set of \(w\), and its size coincides exactly with the dimension of the Bruhat cell corresponding to \(w\).

Example 4 As a brief example, consider the case of the Weyl group of type \(A_{n-1}\). In this case \(W=S_n\), and each \(s_i\) is \((i\;i+1)\). Here, the positive roots are \(\Phi^+=\{e_i-e_j\mid i<j\}\), and an arbitrary Weyl group element \(w\in W\) sends \(e_i-e_j\) to \(e_{w(i)}-e_{w(j)}\).

Now, this being negative is equivalent to \(w(i)>w(j)\), and therefore

\[\ell(w)=\lvert\{(i,j)\mid i<j,\ w(i)>w(j)\}\rvert=\operatorname{inv}(w)\]

is equal to the number of inversions of \(w\).

Bruhat decomposition

Now we consider the Bruhat decomposition using the results reviewed above. The following theorem is the result already seen in §Borel Subgroups, ⁋Proposition 16, restated here for convenience.

Theorem 5 (Bruhat decomposition) For a connected reductive algebraic group \(G\), a Borel subgroup \(B\), a maximal torus \(T\subseteq B\), and the Weyl group \(W=N_G(T)/T\), the following disjoint union holds:

\[G=\bigsqcup_{w\in W}BwB\]

The simplest and most intuitive way to view this decomposition is to consider the \(B\times B\)-action on \(G\) defined by

\[(b_1,b_2)\cdot g=b_1gb_2^{-1}\]

The orbits of this action are precisely the double cosets \(BwB\), and the theorem above means that these orbits are indexed by \(W\).

To examine the geometric meaning this carries, let us look at the example of \(G=\GL_n(\mathbb{C})\). Here, fixing the reference flag \(E_i=\span\{e_1,\ldots,e_i\}\), we saw that an arbitrary flag \(V_\bullet\) is \(V_i=\span\{ge_1,\ldots,ge_i\}\) corresponding to \(gB\). (§Borel Subgroups, ⁋Example 13) In general, the relative position formed by the reference flag \(E_\bullet\) and \(V_\bullet\) is represented by information about the intersection dimensions

\[d_{ij}=\dim(V_i\cap E_j)\]

Then, since the \(B\)-action on \(G\) organizes the coordinates on the flag variety by upper triangular matrices, two flags in the same \(B\)-orbit share these intersection dimensions, and conversely. Now what the Bruhat decomposition says is that for an arbitrary flag \(V_\bullet\), the intersection dimensions \(d_{ij}\) satisfy

\[d_{ij}=\dim(V_i\cap E_j)=\#\{k\leq i\mid w(k)\leq j\}\]

for exactly one \(w\in S_n\). That is, the relative position of \(V_\bullet\) is in one-to-one correspondence with an element of \(W\) in this way, and \(BwB\) is the collection of all \(g\) whose relative position is \(w\). Here, each piece \(BwB\) is called a Bruhat cell.

This, as its name suggests, forms an open cell. Concretely, \(B\) decomposes as the semidirect product of a maximal torus \(T\) and the unipotent radical, \(B=U\rtimes T\), and this unipotent radical \(U\) is the product of the positive root subgroups \(U=\prod_{\alpha\in\Phi^+}U_\alpha\) (each \(U_\alpha\cong\mathbb{G}_a\)). Letting \(U^-\) be the unipotent radical of the opposite Borel subgroup \(B^-\), for each \(w\in W\) let us define

\[U_w=U\cap wU^-w^{-1}\]

Then \(U_w\) is given as the product of root subgroups \(U_\gamma\) for positive roots \(\gamma\) satisfying \(w^{-1}\gamma\in\Phi^-\):

\[U_w=\prod_{\substack{\gamma\in\Phi^+\\ w^{-1}\gamma\in\Phi^-}}U_\gamma\]

Since the number of roots appearing in the product is \(\ell(w)\), \(U_w\) is isomorphic to the affine space \(\mathbb{A}^{\ell(w)}\). That is, \(U_w\) is the unipotent subgroup collecting only the “positive roots that \(w^{-1}\) sends to negative roots”, and its dimension is precisely the length (\(\ell(w^{-1})=\ell(w)\)).

In what follows, when we treat \(w\in W\) directly as a matrix, as in \(BwB\) or the product \(uwb\), we view it as choosing a representative in \(N_G(T)\). Since different representatives differ only by \(T\subseteq B\), the double coset \(BwB\) and its coset \(BwB/B\) are independent of the choice of representative.

Proposition 6 For each \(w\in W\), the product map

\[U_w\times B\longrightarrow BwB,\qquad (u,b)\longmapsto uwb\]

is an isomorphism of varieties. Hence the Bruhat cell is \(BwB\cong\mathbb{A}^{\ell(w)}\times B\), and projecting to the flag variety,

\[X_w^\circ:=BwB/B\cong\mathbb{A}^{\ell(w)}\subseteq G/B\]

holds.

Proof

\(B=U\rtimes T\) and \(U\) decomposes into a product of root subgroups. Writing \(U\) as the product of \(U_w\) and \(U_w'=U\cap wUw^{-1}\), we have \(U=U_wU_w'\) and \(U_w\cap U_w'=\{e\}\). Since \(U_w'\) corresponds to the roots sent from positive roots to positive roots by \(w^{-1}\), we have \(w^{-1}U_w'w\subseteq U\), and therefore

\[BwB=UwB=U_wU_w'wB=U_ww(w^{-1}U_w'w)B=U_wwB\]

Now if \(u_1wb_1=u_2wb_2\) (\(u_i\in U_w\), \(b_i\in B\)), then \(w^{-1}u_2^{-1}u_1w=b_2b_1^{-1}\in B\). On the other hand, since \(u_2^{-1}u_1\in U_w\), we have \(w^{-1}u_2^{-1}u_1w\in U^-\), and thus \(w^{-1}u_2^{-1}u_1w\in B\cap U^-=\{e\}\). From this, \(u_1=u_2\) and \(b_1=b_2\), so the map is bijective, and in fact an isomorphism of varieties. Finally, \(U_w\) is a product of \(\ell(w)\) root subgroups and each root subgroup is isomorphic to \(\mathbb{G}_a\), so \(U_w\cong\mathbb{A}^{\ell(w)}\).

The true meaning of this proposition is that each \(B\)-orbit \(X_w^\circ=BwB/B\) is not merely a locally closed subset, but the affine space \(\mathbb{A}^{\ell(w)}\) itself, and moreover that these cover all of \(G/B\) without overlap:

\[G/B=\bigsqcup_{w\in W}X_w^\circ,\qquad X_w^\circ\cong\mathbb{A}^{\ell(w)}\]

Since the closure of each cell is a union of cells of lower dimension (§Borel Subgroups, ⁋Proposition 16), this decomposition forms an affine paving of \(G/B\), and the classes \([X_w]\) defined by cell closures define a basis of the Chow ring \(A^\ast(G/B)\) (and further of cohomology \(H^\ast(G/B)\)). The cell of largest dimension is the big cell \(X_{w_0}^\circ\) corresponding to the longest element \(w_0\), which is open dense in \(G/B\) with \(\dim X_{w_0}^\circ=\ell(w_0)=\lvert\Phi^+\rvert=\dim G/B\). Conversely, the smallest cell is the single point \(X_e^\circ=\{eB\}\), which is a \(B\)-fixed point. In this way the Bruhat decomposition reduces the geometry of the flag variety to the combinatorics of \((W,S,\ell)\). Let us examine this in the concrete example \(\GL_n\) discussed above.

Example 7 Let us follow through the case \(G=\GL_n(\mathbb{C})\) to the end. Here \(B\) is the group of invertible upper triangular matrices, \(T\) is the group of invertible diagonal matrices, and the Weyl group is \(W=N_G(T)/T\cong S_n\), where \(w\in S_n\) is identified with the permutation matrix acting by \(we_k=e_{w(k)}\). Under this notation, the Bruhat decomposition \(\GL_n=\bigsqcup_{w\in S_n}BwB\) can be thought of as a coordinate-invariant version of Gauss elimination. This is because if we reduce an invertible matrix \(g\) only by multiplying on the left by an upper unipotent matrix and on the right by an upper triangular matrix, what remains at the end, with exactly one \(1\) in each row and column, is only a single permutation matrix \(w\). The fact that this \(w\) is uniquely determined is precisely the disjointness of Theorem 5 (Bruhat decomposition), and that \(w\) distinguishes \(g\)’s Bruhat cell \(BwB\).

Let us look explicitly at the case \(n=2\). Then an arbitrary element of \(G\) is of the form

\[g=\begin{pmatrix}a&b\\c&d\end{pmatrix}\in\GL_2(\mathbb{C})\]

and here if \(c=0\), then \(g\) is already upper triangular, so \(g\in B=BeB\), that is, \(g\) lies in the cell corresponding to the identity. Let us examine the other elements. If \(c\neq 0\), then

\[\begin{pmatrix}a&b\\c&d\end{pmatrix}=\begin{pmatrix}1&a/c\\0&1\end{pmatrix}\begin{pmatrix}0&1\\1&0\end{pmatrix}\begin{pmatrix}c&d\\0&\frac{bc-ad}{c}\end{pmatrix}\in BsB\]

and therefore the cells of \(\GL_2(\mathbb{C})\) are divided into upper triangular matrices and the rest.

Now let us project these to \(\GL_2(\mathbb{C})/B\cong \mathbb{P}^1\) following Proposition 6. As seen above, since the part corresponding to \(c=0\) is \(B\) itself, these collapse to a single point, which corresponds to the \(\ell(w)=0\) part of the proposition. On the other hand, in the part where \(c\neq 0\), as examined above, with a single coordinate \(a/c\) parametrizing it, we obtain a point of \(\mathbb{P}^1\), \([a:c]\in \mathbb{P}^1\). That is, the point of the flag variety corresponding to \(c=0\) is \([1:0]\), and the rest is attached to it in the form of \(\mathbb{A}^1\).

In the Bruhat decomposition of \(\GL_n(\mathbb{C})\) above, we were able to examine it in the language of linear algebra by exploiting the fact that the Borel subgroup \(B\) consists of upper triangular matrices. On the other hand, since the opposite Bruhat cell is the collection of lower triangular matrices, we can obtain a similar decomposition using them as well, and moreover we can consider the following mixed decomposition.

Theorem 8 (Birkhoff decomposition) Let \(B^-\) be the opposite Borel subgroup corresponding to \(B\). Then the following holds:

\[G=\bigsqcup_{w\in W}B^-wB^-\]

More generally, for two opposite Borel subgroups \(B^+\), \(B^-\), the following mixed decomposition holds:

\[G=\bigsqcup_{w\in W}B^+wB^-\]
Proof

Since \(B^-=w_0Bw_0^{-1}\) and \(w_0=w_0^{-1}\), conjugating both sides of Theorem 5 by \(w_0\) gives

\[G=w_0Gw_0^{-1}=\bigsqcup_{w\in W}(w_0Bw_0^{-1})(w_0ww_0^{-1})(w_0Bw_0^{-1})=\bigsqcup_{w\in W}B^-(w_0ww_0)B^-\]

Since \(w\mapsto w_0ww_0\) is an automorphism of \(W\), the first decomposition holds. The mixed decomposition reduces to Theorem 5 by substituting \(B^+=B\) and \(B^-=w_0Bw_0^{-1}\), writing \(BwB^-=Bww_0Bw_0^{-1}\), and reindexing by \(w\mapsto ww_0\).

In \(\GL_n(\mathbb{C})\), this has a clear meaning: the identity cell \(B^-B\) is the collection of matrices expressible as a product of a lower triangular matrix and an upper triangular matrix, that is, matrices having an LU decomposition. As is well known in linear algebra, this coincides exactly with matrices all of whose leading principal minors are not \(0\), and such matrices are open dense in \(\GL_n\).

Thinking back to the \(n=2\) situation of Example 7 earlier, the leading principal minors of a \(2\times2\) matrix are two: the first entry \(g_{11}\) and the full determinant \(\det g\). However, in \(\GL_2(\mathbb{C})\), since \(\det g\neq0\) is automatic, the LU condition reduces to the single condition \(g_{11}\neq0\); thus the elements of \(B^-B\) are precisely matrices whose \((1,1)\)-entry is not \(0\), and these are precisely the elements for which the first pivot survives so that Gauss elimination proceeds without row exchanges. Likewise, in general, the leading principal minors correspond to the pivots in Gauss elimination, and if a minor becomes \(0\) at some stage, the pivot at that position disappears and a row exchange becomes unavoidable. The permutation \(w\) records the pattern of these row exchanges, and what Birkhoff showed is that any \(g\) can be written in the form

\[g=LwU\qquad(L\in B^-,\ U\in B,\ w\in W)\]

and that this \(w\) is uniquely determined. This is precisely the Bruhat decomposition for the pair \((B^-,B)\), namely \(G=\bigsqcup_w B^-wB\), and \(w\) measures how far \(g\) deviates from the LU decomposition.

Geometrically, the Bruhat decomposition showed the corresponding incidence conditions by increasing the size of the reference flag. Then, in the case of the mixed cell above, incidence conditions are imposed taking into account also the direction in which the reference flag descends from the total space (opposite Bruhat cell). In order to do intersection theory inside the flag variety, one must choose reference flags in general position when considering Schubert varieties, so this decomposition becomes genuinely useful.

Parabolic subgroup and generalized Bruhat decomposition

The cell decomposition so far was for the complete flag variety \(G/B\). Extending this to a larger subgroup containing \(B\), namely a parabolic subgroup, yields the cell decomposition of partial flag varieties \(G/P\), including the Grassmannian. Intuitively, \(P\) corresponds to remembering only some stages of the flag, and correspondingly, the indexing by \(W\) also becomes coarser by the subgroup \(W_I\).

Definition 9 In \(G\), a closed subgroup \(P\) is called a parabolic subgroup if the quotient \(G/P\) is a projective variety. Equivalently, \(P\) is a connected closed subgroup containing some Borel subgroup.

The standard parabolic subgroups containing \(B\) are in one-to-one correspondence with subsets of the simple root system \(\Delta\), \(I\subseteq\Delta\). Here, the parabolic subgroup corresponding to \(I\) is defined by

\[P_I=BW_IB=\bigsqcup_{w\in W_I}BwB\]

where \(W_I=\langle s_i\mid\alpha_i\in I\rangle\) is the subgroup generated by the simple reflections in \(I\), forming a parabolic subgroup of \(W\). The two extremes are: if \(I=\emptyset\), then \(P_I=B\), and if \(I=\Delta\), then \(P_I=G\); the standard parabolics in between define flag varieties lying between the complete flag variety and the 0-step variety.

Proposition 10 \(P_I=BW_IB\) is a connected closed subgroup of \(G\) and has a Levi decomposition \(P_I=L_I\ltimes U_I\). Here, the Levi factor \(L_I\) is the reductive group generated by \(T\) and the root spaces of roots in \(I\), and the unipotent radical \(U_I\) is generated by the root spaces of positive roots not in \(I\).

Proof

Since \(B=U\rtimes T\) and \(W_I\subseteq W\), \(P_I\) is the subgroup generated by \(B\) and representatives of \(W_I\). In \(W_I\), for each element \(w\), \(BwB\) is locally closed, and by the disjointness in Theorem 5 their union \(P_I\) is a well-defined subgroup and a closed subset. At the level of root spaces, \(\mathfrak{p}_I\) is \(\mathfrak{b}\) plus the root spaces of negative roots generated by \(I\); splitting this into the reductive part \(\mathfrak{l}_I\) (the part where positive and negative roots are paired) and the nilpotent part \(\mathfrak{u}_I\) (the remaining positive roots) gives the above Levi decomposition. Therefore, \(P_I\) is a connected closed subgroup.

It is natural to view the Levi decomposition of Proposition 10 as a step up from the decomposition \(B=U\rtimes T\) of the Borel subgroup. That is, just as \(B\) consists of the two pieces of information (the torus \(T\) and the upper unipotent \(U\)), \(P_I\) is the semidirect product of the larger reductive part \(L_I\) and the unipotent \(U_I\) above it. The roots in \(I\) survive as pairs of positive and negative roots to form, with \(T\) as maximal torus, the reductive group \(L_I\), while the positive roots outside \(I\) have no partners and form the nilpotent radical \(U_I\). In particular, the Weyl group of \(L_I\) is precisely \(W_I\), the very subgroup by which we will quotient \(W\) right below.

In \(G=\GL_n(\mathbb{C})\), this decomposition appears immediately as block matrices. For each simple root missing from \(I\), \(\alpha_k\), the connection between \(k\) and \(k+1\) is broken and \(\{1,\ldots,n\}\) is partitioned into blocks; \(P_I\) is then the collection of block upper triangular matrices having these blocks as diagonal blocks. Here, the diagonal blocks form the reductive Levi \(L_I\cong\GL_{k_1}\times\cdots\times\GL_{k_r}\), and the blocks above the diagonal form the unipotent radical \(U_I\). Now, for the parabolic subgroup \(P=P_I\), to obtain the cell decomposition of \(G/P\), one must quotient the Weyl group \(W\) by \(W_I\). At this point, the standard way to represent each coset is to choose the minimal length element.

Definition 11 For a parabolic subgroup \(W_I\subseteq W\), the collection of minimal length coset representatives, \(W^I\), is defined as follows:

\[W^I=\{w\in W\mid\ell(ws_i)>\ell(w)\text{ for all }\alpha_i\in I\}\]

The condition \(\ell(ws_i)>\ell(w)\) means that multiplying \(w\) on the right by a generator of \(W_I\) can no longer reduce the length, and therefore \(W^I\) is the collection of elements of minimal length in each left coset \(wW_I\). Just as the length of a Weyl group element previously gave the dimension of a Bruhat cell, these will soon become the dimension of each cell when decomposing the partial flag variety. For this, the following bridge is needed.

Proposition 12 Each \(w\in W\) decomposes uniquely as \(w=w^I w_I\) (\(w^I\in W^I\), \(w_I\in W_I\)), where \(\ell(w)=\ell(w^I)+\ell(w_I)\). In particular, each coset \(wW_I\) has exactly one minimal length element, so the projection \(W^I\rightarrow W/W_I\) is a bijection.

Proof

Since \(W_I\) is a finite group, there exists an element \(w^I\) of minimal length in the coset \(wW_I\). For any \(\alpha_i\in I\), \(w^Is_i\) also belongs to the same coset, so \(\ell(w^Is_i)\geq\ell(w^I)\), and since \(\ell(w^Is_i)=\ell(w^I)\pm1\) in a Coxeter group, we have \(\ell(w^Is_i)=\ell(w^I)+1\), that is, \(w^I\in W^I\). The uniqueness of the decomposition and the additivity of length \(\ell(w)=\ell(w^I)+\ell(w_I)\) are the parabolic factorization theorem for Coxeter groups. (See [BB]) From this, since each element of \(W^I\) represents a distinct coset, \(W^I\rightarrow W/W_I\) is a bijection.

Now we obtain the cell decomposition of \(G/P_I\) using minimal length representatives. The key point is that under the projection \(G/B\rightarrow G/P_I\), Bruhat cells belonging to the same \(W_I\)-coset merge into one, and the representative surviving from each coset is precisely an element of \(W^I\).

Theorem 13 (Generalized Bruhat decomposition) Let \(P=P_I\) be a standard parabolic subgroup. Then the following holds:

\[G=\bigsqcup_{w\in W^I}BwP\]

Hence the partial flag variety \(G/P\) decomposes into affine cells:

\[G/P=\bigsqcup_{w\in W^I}BwP/P,\qquad BwP/P\cong\mathbb{A}^{\ell(w)}\]
Proof

From \(G=\bigsqcup_{w\in W}BwB\) and \(P=\bigsqcup_{v\in W_I}BvB\) of Theorem 5, we have \(G=\bigcup_{w\in W}BwP\), and by the decomposition \(w=w^Iw_I\) of Proposition 12, \(BwP=Bw^IP\), so \(G=\bigcup_{w\in W^I}BwP\). To show disjointness, suppose \(Bw_1P=Bw_2P\) for \(w_1,w_2\in W^I\). Then \(w_1\in Bw_2P\), and since \(P=\bigsqcup_{v\in W_I}BvB\), we have \(Bw_2P=\bigsqcup_{v\in W_I}Bw_2vB\). (Here, since \(\ell(w_2v)=\ell(w_2)+\ell(v)\) for \(w_2\in W^I\) and \(v\in W_I\), \(Bw_2BvB=Bw_2vB\) merges into a single cell.) Thus for some \(v\in W_I\), \(w_1\in Bw_2vB\), so from the disjointness of Theorem 5, \(w_1=w_2v\). That is, \(w_1\) and \(w_2\) belong to the same coset \(w_2W_I\), and since each coset has a unique minimal length element, \(w_1=w_2\). Finally, if \(w\in W^I\), then \(\ell(w)=\ell(w^I)\) gives the cell dimension, and by the same argument as in Proposition 6 we obtain \(BwP/P\cong\mathbb{A}^{\ell(w)}\).

Grassmannian

The most representative example of the generalized Bruhat decomposition is the Grassmannian \(\Gr(k,n)\). ([Algebraic Varieties] §Grassmann Varieties, ⁋Definition 1) By its definition, this can be thought of as a 1-step partial flag variety. To this end, we choose the subset \(I=\Delta\setminus\{\alpha_k\}\) obtained by removing only \(\alpha_k\) from the simple root system \(\Delta=\{\alpha_1,\ldots,\alpha_{n-1}\}\), and let \(P_k\) be the corresponding maximal parabolic subgroup. \(P_k\) is the collection of block upper triangular matrices

\[P_k=\left\{\begin{pmatrix}A&C\\0&D\end{pmatrix}\in \GL_n(\mathbb{C})\;\middle\vert\;A\in \GL_k(\mathbb{C}),\;D\in \GL_{n-k}(\mathbb{C})\right\}\]

This subgroup fixes the standard \(k\)-plane \(E_k=\span\{e_1,\ldots,e_k\}\), so the action of \(\GL_n(\mathbb{C})\) on \(\Gr(k,n)\) is transitive and its isotropy group is exactly \(P_k\). Hence

\[\Gr(k,n)\cong \GL_n(\mathbb{C})/P_k\]

On the other hand, since there is a canonical isomorphism between \(\Gr(k,n)\) and \(\Gr(n-k,n)\) via \(V\mapsto\mathbb{C}^n/V\) or \(V\mapsto V^\perp\) under a suitable inner product, we can also view \(\Gr(n-k,n)\cong \GL_n(\mathbb{C})/P_k\) for the same \(P_k\).

Proposition 14 In the case where \(\GL_n(\mathbb{C})/P_k\cong \Gr(k,n)\), the parabolic subgroup \(W_{P_k}\) of the Weyl group \(W=S_n\) is isomorphic to \(S_k\times S_{n-k}\), and the minimal length coset representatives \(W^{P_k}\) are as follows:

\[W^{P_k}=\{w\in S_n\mid w(1)<\cdots<w(k),\ w(k+1)<\cdots<w(n)\}\]

These are called \((k,n-k)\)-shuffles and there are \(\binom{n}{k}\) of them in total.

This ultimately means that since the Grassmannian is a 1-step partial flag variety, out of the whole space \(\GL_n(\mathbb{C})\) and the full \(S_n\) acting on it, \(S_k\times S_{n-k}\) with one disconnected can be thought of as the same thing.

Since the Grassmannian is the simplest and most powerful among concrete examples, let us organize the notation for this case. First, let us write the elements of an arbitrary \(w\in S_n\) as

\[w=w(1)w(2)\ldots w(n)\]

For example, the element \(2413\) of \(S_4\) is the element satisfying

\[w(1)=2, \quad w(2)=4, \quad w(3)=1,\quad w(4)=3\]

Then we can check that this element is precisely a \((2,2)\)-shuffle, and for example \(1342\) is a \((3,1)\)-shuffle. That is, in this notation, the blocks are distinguished by the rule that a new block starts at the position where the numbers decrease.

Meanwhile, we recall that fundamentally the Grassmannian (or more generally the partial flag variety) arises from an incidence condition with respect to a reference flag. Consider the flag variety \(\Fl(d_1, d_2, \ldots, d_m; n)\). The elements of this variety consist of the flags

\[0\subseteq V_1\subseteq \cdots \subseteq V_m\subseteq \mathbb{C}^n,\qquad \dim V_k=d_k\]

and the position of this flag is completely determined by the intersection dimensions \(\dim(V_i\cap E_j)\) with the reference flag, and the objects sharing this information were precisely the Bruhat cells.

To link these two pieces of information, let us write the jump data with respect to the reference flag as a word \(u_1\cdots u_n\) of length \(n\). Then for each \(j\), \(u_j\) is the index, assigned starting from \(0\), of the position where the new direction arising when going from \(E_{j-1}\) to \(E_j\) is first absorbed. For example, consider the case of the Grassmannian \(\Gr(2,4)\). Fixing the reference flag as the standard flag \(E_j=\span\{e_1,\ldots,e_j\}\), reading the position of a point \(V=\span\{e_1,e_2+e_3\}\) in the preceding manner gives the following.

  • When going up from \(E_0\) to \(E_1\), the arising direction is the \(e_1\) direction, and this direction is in \(V\) from the start. That is, \(u_1=0\).
  • When going up from \(E_1\) to \(E_2\), the arising direction is in the \(ae_1+be_2\) (\(b\neq 0\)) direction, and this direction does not belong to \(V\). That is, \(u_2=1\).
  • When going up from \(E_2\) to \(E_3\), the arising direction is of the form \(ae_1+be_2+ce_3\) (\(c\neq0\)) where the \(e_3\) component is present, but this time the vector \(e_2+e_3\) of \(V\) is precisely such a direction, so \(\dim(V\cap E_3)\) increases by one dimension. That is, since this direction is absorbed into \(V\), \(u_3=0\).
  • When going up from \(E_3\) to \(E_4\), the arising direction is the \(e_4\) direction, but since \(V\subseteq E_3\) already, there is no vector of \(V\) to be newly absorbed. That is, \(u_4=1\).

Collecting the four components, the \(u\) word we construct is \(u=0101\). Conversely, recovering the jump data when such a word is given is also immediate; for example, in this example, the places where the dimension jumps are the first and third positions where \(0\) is located. For more general flag varieties, the numbers making up \(u\) include not only \(0\) and \(1\) but other numbers appearing as well, and these numbers tell us which component of the flag we are looking at, while their positions tell us where this component jumps.

Hence, from this we can establish the relationship between \(01\)-words (more generally, \(012\)-words, etc.) and jumping positions. However, this also simultaneously encodes the \((k, n-k)\)-shuffle as well. That is, since the positions of \(0\) are at the \(1, 3\)-th positions, this corresponds to the shuffle \(1324\), and for example, in a case such as the \(012\)-word \(1022101\), \(2615734\) is recovered.

Example 15 Now let us push this example through to the end in \(\Gr(2,4)\). In this case \(W=S_4\), \(W_{P_2}=S_2\times S_2\), and the minimal length representatives are the six \((2,2)\)-shuffles, namely

\[W^{P_2}=\{1234,\,1324,\,1423,\,2314,\,2413,\,3412\}\]

The length of each representative can be verified by counting inversions as in Example 4:

\[\ell(1234)=0,\quad\ell(1324)=1,\quad\ell(1423)=\ell(2314)=2,\quad\ell(2413)=3,\quad\ell(3412)=4\]

Therefore, these form six Schubert cells of dimensions \(0,1,2,2,3,4\), respectively. Now let us write these down more explicitly. To do this, if we represent a \(2\)-plane \(V\) as a \(2\times4\) matrix and set the pivot of each row to be the rightmost nonzero entry, namely the position where \(\dim(V\cap E_j)\) jumps, then the pivots lie precisely in columns \(\{w(1),w(2)\}\), and only the non-pivot column positions to their left remain as free coordinates \(\ast\). In the order \(W^{P_2}=\{1234,1324,1423,2314,2413,3412\}\), these are

\[\begin{pmatrix}1&0&0&0\\0&1&0&0\end{pmatrix},\quad\begin{pmatrix}1&0&0&0\\0&\ast&1&0\end{pmatrix},\quad\begin{pmatrix}1&0&0&0\\0&\ast&\ast&1\end{pmatrix},\] \[\begin{pmatrix}\ast&1&0&0\\\ast&0&1&0\end{pmatrix},\quad\begin{pmatrix}\ast&1&0&0\\\ast&0&\ast&1\end{pmatrix},\quad\begin{pmatrix}\ast&\ast&1&0\\\ast&\ast&0&1\end{pmatrix}\]

The number of free coordinates \(\ast\), namely \(0,1,2,2,3,4\), is precisely the \(\ell(w)\) counted above, and this is the explicit coordinate system of \(BwP/P\cong\mathbb{A}^{\ell(w)}\).

Schubert Cells and Schubert Varieties

Now let us name and organize the cells on the partial flag variety \(X=G/P\) and their closures. Fixing \(B\) and its opposite Borel \(B^-\), we obtain cell structures in both directions simultaneously.

Definition 16 For \(w\in W^P\), we define the Schubert cell \(X_w^\circ\) and the opposite Schubert cell \(X^w_\circ\) respectively by

\[X_w^\circ=BwP/P\subseteq G/P,\qquad X^w_\circ=B^-wP/P\subseteq G/P\]

and call their closures

\[X_w=\overline{X_w^\circ},\qquad X^w=\overline{X^w_\circ}\]

the Schubert variety and the opposite Schubert variety, respectively.

By definition, \(X_w^\circ\cong\mathbb{A}^{\ell(w)}\) and \(X^w_\circ\cong\mathbb{A}^{\dim(G/P)-\ell(w)}\). In particular, \(X_{w_0^P}^\circ\) (where \(w_0^P\) is the longest element of \(W^P\)) is the open dense cell with \(\ell(w_0^P)=\dim(G/P)\), and \(X_e^\circ=\{eP\}\) is a \(B\)-fixed point. Symmetrically, on the opposite side, \(X^e_\circ=B^-P/P\) is the open dense cell, and \(X^{w_0^P}_\circ=\{w_0^PP\}\) is a \(B^-\)-fixed point. That is, the two cell structures interlock in a dimension-reversed form.

The inclusion relations among Schubert varieties are governed by the Bruhat order on the Weyl group. The Bruhat order \(\leq\) is the order defined by \(v\leq w\) when some reduced expression of \(v\) appears as a subword of some reduced expression of \(w\), and geometrically it is revealed through the cell closure \(\overline{BwB}=\bigsqcup_{v\leq w}BvB\) seen in §Borel Subgroups, ⁋Proposition 16.

Proposition 17 For \(x,w\in W^P\), the following holds:

\[X_x\subseteq X_w\iff x\leq w\text{ in Bruhat order}\]

In particular,

\[X_w=\bigsqcup_{\substack{x\leq w\\ x\in W^P}}X_x^\circ\]
Proof

Since \(X_w=\overline{BwP/P}\) and \(B\) is a connected solvable group, the closure of a \(B\)-orbit is a union of \(B\)-orbits of lower dimension. That \(\overline{BwB/B}=\bigsqcup_{v\leq w}BvB/B\) holds in the complete flag variety \(G/B\) follows from the cell closure recalled above, and under the projection \(G/B\rightarrow G/P\), the differences inside \(W_P\)-cosets collapse, so for \(x,w\in W^P\), \(X_x^\circ\subseteq X_w\) holds precisely when \(x\leq w\).

Example 18 For \(G/P=\Gr(2,4)\), the Bruhat order on \(W^{P_2}\) is drawn as two maximal chains:

\[1234\leq 1324\leq 1423\leq 2413\leq 3412\] \[1234\leq 1324\leq 2314\leq 2413\leq 3412\]

That is, below \(1324\) there is only \(1234\), and \(1423\) and \(2314\), which have the same length, are incomparable with each other, both lying above \(1324\) and below \(2413\). This Hasse diagram has a diamond shape branching into two and then rejoining, directly showing the inclusion relations among the Schubert classes of \(\Gr(2,4)\). For example, the Schubert variety \(X_{2413}\) is a subvariety of dimension \(3\) containing all of \(X_{1423}^\circ\), \(X_{2314}^\circ\), \(X_{1324}^\circ\), and \(X_{1234}^\circ\).

This order is read directly from the jump sets in Example 15. Viewing \(w\) as its jump set \(\{w(1)<w(2)\}\), the Bruhat order is the componentwise order, i.e., \(v\le w\iff v(1)\le w(1)\) and \(v(2)\le w(2)\). Thus the two maximal chains are \(\{1,2\}\le\{1,3\}\le\{1,4\}\le\{2,4\}\le\{3,4\}\) and \(\{1,2\}\le\{1,3\}\le\{2,3\}\le\{2,4\}\le\{3,4\}\), and \(1423\leftrightarrow\{1,4\}\) and \(2314\leftrightarrow\{2,3\}\) are incomparable because \(4\not\le3\) and \(2\not\le1\). Geometrically, as we saw in Example 15, this can also be confirmed from the fact that the matrices determined by these two elements are

\[\begin{pmatrix}1&0&0&0\\0&\ast&\ast&1\end{pmatrix},\quad \begin{pmatrix}\ast&1&0&0\\\ast&0&1&0\end{pmatrix}\]

Points of the left cell always contain \(e_1\) (\(\dim(V\cap E_1)=1\)), but because of the last entry \(1\) in the second row they are not in \(E_3\) (\(\dim(V\cap E_3)=1\)), while points of the right cell are always in \(E_3\) since the last column is entirely \(0\), but because no linear combination of the two rows is a multiple of \(e_1\), they meet \(E_1\) only trivially (\(\dim(V\cap E_1)=0\)). Thus the left cell violates the rank condition \(\dim(V\cap E_3)\geq2\) of \(X_{2314}\) and the right cell violates the rank condition \(\dim(V\cap E_1)\geq1\) of \(X_{1423}\), so by Proposition 17 neither Schubert variety contains the other.

The inclusion relations can also be grasped through rank conditions. Of the conditions \(\dim(V\cap E_2)\ge1\) and \(\dim(V\cap E_4)\ge2\) for \(X_{2413}\), the latter is automatic since \(E_4=\mathbb{C}^4\), so

\[X_{2413}=\{V\in\Gr(2,4)\mid\dim(V\cap E_2)\ge1\},\]

that is, all \(2\)-planes meeting \(E_2\). Among the six cells of Example 15, only the big cell \(3412\) transverse to \(E_2\) violates this condition, so \(X_{2413}\) exactly contains the remaining five cells.

Finally, we record one direct consequence of the Bruhat decomposition. The cell decomposition completely classifies the fixed points of the action of a maximal torus \(T\) on \(G/P\).

Proposition 19 For the action of a maximal torus \(T\subseteq B\) on \(G/P\), the fixed points are precisely the coordinate points \(wP\) (\(w\in W^P\)), with one contained in each Bruhat cell \(X_w^\circ\).

Proof

First, each coordinate point is a fixed point. This is because for a representative \(\dot{w}\in N_G(T)\) of \(w\), we have \(\dot{w}^{-1}t\dot{w}\in T\subseteq P\), so \(t\cdot\dot{w}P=\dot{w}(\dot{w}^{-1}t\dot{w})P=\dot{w}P\). Conversely, let \(x\) be a fixed point. By the Bruhat decomposition, \(x\) belongs to some cell \(X_w^\circ=BwP/P\), and since \(T\subseteq B\), each cell is \(T\)-stable. However, in the coordinatization \(X_w^\circ\cong\mathbb{A}^{\ell(w)}\) of the cell, \(T\) scales each coordinate by a nontrivial character. In Type \(A\), this can be seen directly in the matrix coordinates of Example 15: \(t=\diag(t_1,\ldots,t_n)\) multiplies the free entry (in column \(b\)) of a row whose pivot is in column \(p\) by \(t_bt_p^{-1}\) (it suffices to move each row by \(t\) and then normalize the pivot back to \(1\)). In the general case, the cell is coordinatized as a product of root subgroups \(\prod_\alpha U_\alpha\) and \(T\)-conjugation acts on each \(U_\alpha\cong\mathbb{G}_a\) by the root \(\alpha\) (see [Spr]). In either case, all characters are nontrivial, so the only fixed point of the cell is the origin where all coordinates are \(0\), namely \(wP\).

In particular, the number of fixed points is finite, equal to \(\lvert W^P\rvert\). In \(\Gr(2,4)\), the six coordinate flags of Example 15 are all of them, and in the complete flag variety \(\Fl_n\), the coordinate flags \(E^w_\bullet\) (\(w\in S_n\)), numbering \(n!\), are all of them.

A Schubert variety \(X_w\subseteq G/P\) is generally singular, and its singular locus is also expressed as a union of smaller Schubert varieties. On the other hand, the cohomology classes \([X_w]\in H^\ast(G/P)\) form an additive basis of \(H^\ast(G/P)\) as discussed after Proposition 6, and from this develops the intersection theory called classical Schubert calculus. In particular, for the Grassmannian, Schubert varieties are indexed by Young diagrams, and their intersection numbers are given by Littlewood–Richardson coefficients.


References

[BB] A. Björner, F. Brenti, Combinatorics of Coxeter groups, Graduate Texts in Mathematics 231, Springer, 2005.
[Ful] W. Fulton, Young tableaux, London Mathematical Society Student Texts 35, Cambridge University Press, 1997.
[Hum] J. E. Humphreys, Linear algebraic groups, Graduate Texts in Mathematics 21, Springer, 1975.
[Man] L. Manivel, Symmetric functions, Schubert polynomials and degeneracy loci, SMF/AMS Texts and Monographs 6, 2001.
[Spr] T. A. Springer, Linear algebraic groups, Progress in Mathematics 9, Birkhäuser, 1998.

Comments

  • Public repository: a deleted comment stays in the Git history.
  • The password and the email are encrypted and kept in Cloudflare KV alone.

No comments yet.

Leave a comment