Math 2.0

Group theory and generalizations Linear and matrix groups Theorem

Bruhat decomposition

Builds on General linear groupUpper triangular matrixPermutation matrixSymmetric group

Statement

Let GG be a connected reductive linear algebraic group over an algebraically closed field kk. Let BB be a Borel subgroup of GG, let T⊆BT \subseteq B be a maximal torus, and let W=NG(T)/TW = N_G(T)/T be the Weyl group. For w∈Ww \in W, the double coset Bw˙BB \dot w B does not depend on the choice of a representative w˙∈NG(T)\dot w \in N_G(T) of ww, and it is written BwBBwB. Then GG is the disjoint union G=⨆w∈WBwB.G = \bigsqcup_{w \in W} BwB.

Remarks

For the general linear group G=GLn(k)G = \mathrm{GL}_n(k), take BB the invertible upper triangular matrices, TT the invertible diagonal matrices, and WW the symmetric group SnS_n realised by permutation matrices. Then the theorem says that each invertible matrix is b1wb2b_1 w b_2 with b1,b2∈Bb_1, b_2 \in B and a unique permutation matrix ww. The proof in this case is Gaussian elimination: row and column operations by upper triangular matrices clear an invertible matrix down to a permutation matrix. The permutation is unique because the ranks of the lower left corner submatrices are unchanged by these operations, and they determine it.

Example: for n=2n = 2, W={1,s}W = \set{1, s} with s=(0110)s = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}. A matrix (abcd)\begin{pmatrix} a & b \\ c & d \end{pmatrix} lies in BB when c=0c = 0 and in BsBBsB when c≠0c \ne 0, so GL2(k)=B⊔BsB\mathrm{GL}_2(k) = B \sqcup BsB.

The same decomposition holds for every group with a BN-pair, and this is the basis of the theory of buildings and of groups of Lie type.

Going deeper

For a student

For a finite field 𝔽q\F_q, the decomposition counts the elements of GLn(𝔽q)\mathrm{GL}_n(\F_q) cell by cell, and it gives the order of many finite groups of Lie type. In geometry, the images of the double cosets BwBBwB in the flag variety G/BG/B are the Schubert cells. The closure order of the cells is the Bruhat order on WW. Abstracting the two subgroups BB and NG(T)N_G(T) gives the notion of a BN-pair, whose geometric picture is a building.

Reading path

To understand this page from the ground up, read these 5 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. General linear group object
  2. Permutation matrix concept
  3. Symmetric group concept
  4. Upper triangular matrix concept
  5. Bruhat decomposition statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Bruhat_decomposition
About this page
TagT91E86D0RH
URIm2://T91E86D0RH
Kindstatement, theorem
WritingW0 stub
MSC20G15, 20E42
StatusThis copy of the site has no build data. Run m2 status T91E86D0RH.
UsesGeneral linear group, Upper triangular matrix, Permutation matrix, Symmetric group
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.