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.
Block Levi decomposition of standard parabolics
Statement
Let , let be a prime power and let be a composition of , with standard parabolic , standard Levi subgroup and standard unipotent radical (Compositions, partial flags, and standard parabolics). Then and are subgroups of , , , and the multiplication map is a bijection; equivalently Moreover the block diagonal map is an isomorphism of groups whose inverse assembles the blocks, and the two extreme cases are , and with the diagonal torus and the standard maximal unipotent subgroup.
Facts & Assumptions
Given: An integer , a prime power , a composition of with blocks and partial sums , the group , and the subgroups , , of Compositions, partial flags, and standard parabolics.
is the set of invertible matrices with whenever , and it is a subgroup of containing ; is the set of block diagonal matrices in , the set of with all and whenever and ; and (Compositions, partial flags, and standard parabolics).
where is the set of invertible diagonal matrices and the set of unitriangular matrices; and in the notation of [L1] (Standard subgroups of finite general linear groups, Compositions, partial flags, and standard parabolics).
Matrix multiplication over a field is associative and distributive over addition, products of compatible blocks are computed blockwise, and the diagonal blocks of a product of upper block triangular matrices are the products of the diagonal blocks (Rectangular matrix multiplication and the identity matrix , including zero-sized shapes, Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication).
For the following are equivalent: is invertible; and (Invertible matrix theorem: invertibility, full pivot rank, RREF , trivial nullspace and unique solvability are equivalent).
For every field and natural , is a group under matrix multiplication ( is a group under matrix multiplication, including the trivial group ).
Proof
is a subgroup of : it contains ; if then and , because block diagonal matrices of the given block sizes multiply and invert blockwise by [L3], the inverse of an invertible block diagonal matrix having the inverted diagonal blocks.
The diagonal block map , formed from the diagonal blocks of , is a well-defined group homomorphism. It is well defined because is invertible and each diagonal block is invertible: since by [L1], write its diagonal blocks as . The block product rule [L3] applied to gives , so each is invertible and belongs to by [L4], so each diagonal block lies in the group of [L5]. It is a homomorphism because the diagonal blocks of a product of upper block triangular matrices are the products of the diagonal blocks, by [L3].
The kernel of is : a matrix satisfies exactly when for every and for with , which is the definition of ; since is a homomorphism by step 1.2, this makes a subgroup of and .
The map is surjective, since for every ; thus inclusion is a section of . Separately, the block-extraction map , , is a group homomorphism by [L3]. Its inverse is the assembly map : both composites are identities by inspection of the blocks. This proves the asserted isomorphism for , while remains as in step 2.1.
Every factors as with by step 3.1 and by step 2.1, so ; if with and , then lies in , and a block diagonal matrix in has and for , hence equals , so and . Therefore the multiplication map is a bijection and, with and from step 2.1, the group is the internal semidirect product .
The extreme cases: at there is one block, so by [L1] and every matrix is block diagonal of type , whence and ; at every block is a singleton, so is the set of diagonal matrices in and the set of unitriangular matrices, that is and by [L2], with and . ∎
Depends on
- Compositions, partial flags, and standard parabolics
- Standard subgroups of finite general linear groups
- Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication
- Invertible matrix theorem: invertibility, full pivot rank, RREF $I$, trivial nullspace and unique solvability are equivalent
- $\operatorname{GL}_n(F)$ is a group under matrix multiplication, including the trivial group $\operatorname{GL}_0(F)$
- Subgroup
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
Used by
- Cuspidal representations and Harish-Chandra series Definition
- Harish-Chandra induction and restriction for finite general linear groups Definition
- Ordered partitions and coordinate parabolics Definition
- GL₁ and the trivial parabolic endpoints Example
- Finite-group invariants are exact when the group order is invertible Lemma
- Unipotent double-coset biset splitting Lemma
- Existence and uniqueness of cuspidal support Theorem
- Parabolic Mackey formula for finite GLₙ Theorem
- Transitivity and parabolic independence of Harish-Chandra induction Theorem
Dependency tree · two levels
36 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 8.4(a) and Proposition 8.1, printed pp. 30 and 29 (standard reference, not scraped)
- Jay Taylor, Finite Reductive Groups - Section 5.1, printed p. 42 (standard reference, not scraped)