How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Standard subgroups of finite general linear groups
Definition
The ground field and the group. Let and let be a prime power, that is for a prime and an integer . There exists a field with exactly elements (For every prime and , a field with elements exists); fix one and call it , so that (Finite fields and their order). Throughout, matrices have entries in : the second being the set of invertible matrices, which is a group under matrix multiplication (Invertible matrices and the general linear group , is a group under matrix multiplication, including the trivial group ). Fixed throughout are the identity matrix and the -th standard basis vector of .
Indexing convention. On this page the rows and columns of a matrix are numbered and a matrix is written ; this is the usual relabelling of the -indexed convention of Finite rectangular matrices over a commutative ring, their entries, rows and columns. We write for the standard unit vectors of , so that has entry in position and entry elsewhere; this is the -indexed relabelling of the ordered basis of The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension . The standard flag of is the chain whose members are the standard coordinate subspaces; each has and for , since is a basis of and .
Upper triangular, diagonal and unitriangular matrices. A matrix is upper triangular when for all and diagonal when for all (Upper triangular, lower triangular and diagonal square matrices over a commutative ring). It is upper unitriangular, or simply unitriangular, when it is upper triangular and for every . Define the following subsets of : is the standard Borel subgroup, the standard (diagonal) torus and the standard maximal unipotent subgroup of .
The basic structure. , and are subgroups of , we have and , and . Here , and each of the three sets is closed under products and inverses: the product of two upper triangular (respectively diagonal, respectively unitriangular) matrices is upper triangular (respectively diagonal, respectively unitriangular), and the inverse of an invertible upper triangular matrix is upper triangular, with diagonal entries in the diagonal case. For instance, if with strictly upper triangular, then and which is again unitriangular; the displayed product is computed with the associative multiplication and distributivity of Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication, and because moves every vector at least one step up the flag . The notation is consistent with "unipotent": every satisfies .
Every element of is a unique product . Let . Since is upper triangular and invertible, its determinant is the product (The determinant of a triangular matrix is the product of its diagonal entries), so for every ; hence where . A product of a diagonal and an upper triangular matrix is upper triangular with diagonal entries , so and with , . Conversely, if with and , then comparing diagonal entries gives , and then . So the multiplication map is a bijection: every has a unique factorisation with and .
Semidirect product structure. is normal in : for and the conjugate is again unitriangular, and for , written with , , one gets because is a subgroup and normalises . Since , and , the group is the internal semidirect product with acting on by conjugation. In particular every has the form with , and this expression is unique, which is the structure used throughout this page.
Two special cases. For all matrices are , so and is trivial. For the elements of are with , and the factorisation reads .
Counting remark. Since an upper triangular matrix has the entries on and above the diagonal and an arbitrary assignment of these entries with all diagonal entries nonzero is invertible, ; with is arbitrary in . The diagonal torus is abelian and isomorphic to , while has order ; the factorisation therefore refines .
Depends on
- Finite fields and their order
- For every prime $p$ and $n\ge1$, a field with $p^n$ elements exists
- Invertible matrices and the general linear group $\operatorname{GL}_n(F)$
- The determinant of a triangular matrix is the product of its diagonal entries
- Upper triangular, lower triangular and diagonal square matrices over a commutative ring
- Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication
- $\operatorname{GL}_n(F)$ is a group under matrix multiplication, including the trivial group $\operatorname{GL}_0(F)$
- Subgroup
- The standard list $e : n \to F^{n}$ with $e_i(i) = 1_F$ and $e_i(j) = 0_F$ for $j \ne i$ is an ordered basis of $F^{n}$; hence $\dim_F F^{n} = n$, and $F^{0}$ is the zero space with basis $\varnothing$ and dimension $0$
- Finite rectangular matrices over a commutative ring, their entries, rows and columns
Used by
- Compositions, partial flags, and standard parabolics Definition
- Cuspidal representations and Harish-Chandra series Definition
- Harish-Chandra induction and restriction for finite general linear groups Definition
- Ordered partitions and coordinate parabolics Definition
- Permutation Weyl group and inversion length Definition
- Flags and Bruhat cells for GL₂(F_q) Example
- GL₁ and the trivial parabolic endpoints Example
- Grassmannians as maximal parabolic quotients Example
- Parabolic induction of the trivial module as flag functions Example
- The six relative positions of GL₃ flags Example
- Finite-group invariants are exact when the group order is invertible Lemma
- Parabolic double cosets and block permutations Lemma
- Southwest rank matrices determine Bruhat cells Lemma
- Triangular elimination produces a pivot permutation Lemma
- Unipotent double-coset biset splitting Lemma
- Cardinality of a finite Bruhat cell Proposition
- Block Levi decomposition of standard parabolics Theorem
- Bruhat decomposition of GLₙ over a finite field Theorem
- Complete flags are G/B Theorem
- Existence and uniqueness of cuspidal support Theorem
- Parabolic Mackey formula for finite GLₙ Theorem
- Relative position classifies pairs of complete flags Theorem
- Transitivity and parabolic independence of Harish-Chandra induction Theorem
Dependency tree · two levels
45 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Olivier Dudas and Jean Michel, Lectures on Finite Reductive Groups and Their Representations - Example 4.5, Lemma 4.7 and Example 8.4, printed pp. 18 and 30 (standard reference, not scraped)
- Jay Taylor, Finite Reductive Groups - Exercise 4.28 and Definition 5.2, printed pp. 38-39 and 42 (standard reference, not scraped)