Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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 n≥1 and let q be a prime power, that is q=pm for a prime p and an integer m≥1. There exists a field with exactly q elements (For every prime p and n≥1, a field with pn elements exists); fix one and call it Fq, so that ∣Fq∣=q (Finite fields and their order). Throughout, matrices have entries in Fq: Mn(Fq)={ A:{1,…,n}×{1,…,n}→Fq },G:=GL⁡n(Fq), the second being the set of invertible matrices, which is a group under matrix multiplication (Invertible matrices and the general linear group GL⁡n(F), GL⁡n(F) is a group under matrix multiplication, including the trivial group GL⁡0(F)). Fixed throughout are the identity matrix In and the i-th standard basis vector ei of Fqn.

Indexing convention. On this page the rows and columns of a matrix are numbered 1,…,n and a matrix is written A=(aij)1≤i,j≤n; this is the usual relabelling of the 0-indexed convention of Finite rectangular matrices over a commutative ring, their entries, rows and columns. We write e1,…,en for the standard unit vectors of Fqn, so that ei has entry 1 in position i and entry 0 elsewhere; this is the 1-indexed relabelling of the ordered basis e0,…,en−1 of The standard list e:n→Fn with ei(i)=1F and ei(j)=0F for j≠i is an ordered basis of Fn; hence dim⁡FFn=n, and F0 is the zero space with basis ∅ and dimension 0. The standard flag of V=Fqn is the chain V0:={0}⊊V1:=⟨e1⟩⊊V2:=⟨e1,e2⟩⊊⋯⊊Vn:=⟨e1,…,en⟩=V, whose members are the standard coordinate subspaces; each Vi has dim⁡FqVi=i and Vi−1⊊Vi for 1≤i≤n, since e1,…,ei is a basis of Vi and ei∈Vi∖Vi−1.

Upper triangular, diagonal and unitriangular matrices. A matrix A=(aij)∈Mn(Fq) is upper triangular when aij=0 for all i>j and diagonal when aij=0 for all i≠j (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 aii=1 for every i. Define the following subsets of G: B:={ b∈G:b is upper triangular },T:={ t∈G:t is diagonal },U:={ u∈G:u is unitriangular }. B is the standard Borel subgroup, T the standard (diagonal) torus and U the standard maximal unipotent subgroup of G.

The basic structure. B, T and U are subgroups of G, we have T≤B and U≤B, and T∩U={In}. Here In∈B∩T∩U, 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 aii−1 in the diagonal case. For instance, if u=In+N with N strictly upper triangular, then Nn=0 and u−1=In−N+N2−⋯+(−1)n−1Nn−1, 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 Nn=0 because N moves every vector at least one step up the flag 0≤⟨e1⟩≤⟨e1,e2⟩≤⋯≤Fqn. The notation U is consistent with "unipotent": every u∈U satisfies (u−In)n=0.

Every element of B is a unique product tu. Let b=(bij)∈B. Since b is upper triangular and invertible, its determinant is the product b11b22⋯bnn (The determinant of a triangular matrix is the product of its diagonal entries), so bii≠0 for every i; hence t:=diag⁡(b11,…,bnn)∈T,u:=t−1b, where t−1=diag⁡(b11−1,…,bnn−1). A product of a diagonal and an upper triangular matrix is upper triangular with diagonal entries bii−1bii=1, so u∈U and b=tu with t∈T, u∈U. Conversely, if b=t′u′ with t′∈T and u′∈U, then comparing diagonal entries gives t′=t, and then u′=t′−1b=t−1b=u. So the multiplication map T×U⟶B,(t,u)⟼tu, is a bijection: every b∈B has a unique factorisation b=tu with t∈T and u∈U.

Semidirect product structure. U is normal in B: for t∈T and u∈U the conjugate tut−1 is again unitriangular, and for g∈B, written g=t0u0 with t0∈T, u0∈U, one gets gug−1=t0(u0uu0−1)t0−1∈U because U is a subgroup and T normalises U. Since B=TU, T∩U={In} and U⊴B, the group B is the internal semidirect product B=T⋉U, with T acting on U by conjugation. In particular every b∈B has the form tu with t∈T, u∈U and this expression is unique, which is the structure used throughout this page.

Two special cases. For n=1 all matrices are 1×1, so G=B=T=Fq× and U={I1} is trivial. For n=2 the elements of B are (ac0d) with ad≠0, and the factorisation reads (ac0d)=(a00d)(1a−1c01).

Counting remark. Since an upper triangular matrix has the n(n+1)/2 entries on and above the diagonal and an arbitrary assignment of these entries with all diagonal entries nonzero is invertible, ∣B∣=(q−1)nqn(n−1)/2; aij with i<j is arbitrary in U. The diagonal torus T is abelian and isomorphic to (Fq×)n, while U has order qn(n−1)/2; the factorisation B=T⋉U therefore refines ∣B∣=∣T∣⋅∣U∣.

Depends on

Used by

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