Group theory and generalizations Linear and matrix groups Theorem
Bruhat decomposition
Builds on General linear groupUpper triangular matrixPermutation matrixSymmetric group
Statement
Let be a connected reductive linear algebraic group over an algebraically closed field . Let be a Borel subgroup of , let be a maximal torus, and let be the Weyl group. For , the double coset does not depend on the choice of a representative of , and it is written . Then is the disjoint union
Remarks
For the general linear group , take the invertible upper triangular matrices, the invertible diagonal matrices, and the symmetric group realised by permutation matrices. Then the theorem says that each invertible matrix is with and a unique permutation matrix . 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 , with . A matrix lies in when and in when , so .
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 , the decomposition counts the elements of cell by cell, and it gives the order of many finite groups of Lie type. In geometry, the images of the double cosets in the flag variety are the Schubert cells. The closure order of the cells is the Bruhat order on . Abstracting the two subgroups and 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
- no evidence level
- General linear group object
- Permutation matrix concept
- Symmetric group concept
- Upper triangular matrix concept
- Bruhat decomposition statement
Further reading
About this page
| Tag | T91E86D0RH |
|---|---|
| URI | m2://T91E86D0RH |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 20G15, 20E42 |
| Status | This copy of the site has no build data. Run m2 status T91E86D0RH. |
| Uses | General linear group, Upper triangular matrix, Permutation matrix, Symmetric group |
| 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.