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.
Ordered partitions and coordinate parabolics
Definition
Ordered partitions. An ordered partition of is a finite list of nonempty pairwise disjoint subsets with . Its members are the blocks of , its length is (so that for ), and for we write for the unique index with , so that lies in an earlier block than exactly when . A composition of is the same datum as the ordered partition whose blocks are its consecutive intervals (Compositions, partial flags, and standard parabolics); every ordered partition is of this restricted form after relabelling, and the two notions are compared below. The extreme ordered partitions are the one-block partition and the all-singleton partition , which correspond to the compositions and .
Coordinate parabolics. Let , let be a prime power, put with diagonal torus and standard basis (Standard subgroups of finite general linear groups), and let be an ordered partition of . Define the coordinate parabolic, its coordinate Levi subgroup and its coordinate unipotent radical of type . For a composition these are the standard subgroups of Compositions, partial flags, and standard parabolics. We also call the coordinate flag of type , so that is a strictly increasing chain of subspaces with , and is the stabiliser in of : a matrix satisfies for all exactly when, for every with , the -th column of has no nonzero entry in a block with , which is exactly whenever (the argument is that of Compositions, partial flags, and standard parabolics, where the same computation is carried out for consecutive blocks, and it uses only the block shape); since is injective and the chain is finite with (Invertible matrix theorem: invertibility, full pivot rank, RREF , trivial nullspace and unique solvability are equivalent, Linear subspace of a vector space), the inclusions are equalities. In particular is a subgroup of , since the stabiliser of a subset of the flag is a subgroup (Subgroup, Left group actions, transitive actions, and faithful actions), and the diagonal torus satisfies .
Change of coordinates. Let and let be the associated permutation matrix (Permutation Weyl group and inversion length), so that for every matrix (Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication, Rectangular matrix multiplication and the identity matrix , including zero-sized shapes). For an ordered partition put , again an ordered partition of ; then and applying the entry formula for conjugation to the three defining conditions above gives For instance says that and whenever and , which by the displayed formula for is the defining condition for ; the other two computations are identical. Since a composition is an ordered partition with consecutive blocks, and since an arbitrary ordered partition becomes a composition after the relabelling that replaces every block by its position, the change of coordinates shows that the coordinate parabolics of the ordered partitions are exactly the conjugates of the standard parabolics by the permutation matrices, and in particular they are split parabolic subgroups in the sense of Harish-Chandra induction and restriction for finite general linear groups.
Consequences of the change of coordinates. Fix an ordered partition , choose the composition of , and let be the unique permutation with for all that is increasing on each block ; then , and because with (Block Levi decomposition of standard parabolics), conjugation by the permutation matrix maps this decomposition to because conjugation is an automorphism of and carries the block diagonal matrices of type onto those of type ( is a group under matrix multiplication, including the trivial group , Normal subgroup: invariance under conjugation); moreover is the stabiliser of the coordinate flag , as computed above. For the Weyl group, a permutation satisfies for all exactly when for all , so with one has in the group , where is the parabolic Weyl subgroup of Permutation Weyl group and inversion length; combining that criterion with the change of coordinates shows that a monomial matrix lies in exactly when its permutation lies in , so that for the monomial subgroup of Permutation Weyl group and inversion length. Finally, varying only the order of the blocks leaves the Levi unchanged: if is obtained from by permuting the list , then holds exactly when , namely when lie in different blocks, so ; the unipotent radical on the other hand depends on the order of the blocks, as the case shows.
Remarks
- Coordinate parabolics contain the diagonal torus, and for they are all the parabolics that do. We have from the definitions above. Conversely let and let be a parabolic subgroup of containing , say for some composition and some ; since stabilises the standard partial flag of type (Compositions, partial flags, and standard parabolics), the group is the stabiliser of the partial flag , and means that every member of is -stable. Since , choose with . For each let act by on and by on every other coordinate line. If is -stable and , then , hence because is invertible. Thus is spanned by the coordinate vectors it contains; therefore every member of is a coordinate subspace, and the resulting strictly increasing chain of coordinate subspaces is the coordinate flag of a unique ordered partition of with . At the conclusion fails, and not merely for want of proof: the torus is then the trivial group, so every parabolic contains it, while for the three Borels of are the upper triangular, the lower triangular and the stabiliser of the line ; only the upper and lower triangular ones are coordinate parabolics, those of and . Consequently the theory below is stated for coordinate parabolics, which is the class that the finite general linear group controls at every ; the larger class of all parabolics containing agrees with it whenever .
- Every block order is a choice. Two ordered partitions with the same blocks in different orders give the same Levi and the same but different parabolics ; comparing the corresponding Harish-Chandra functors is the content of the parabolic-independence theorem of this page, and it is the reason the parabolics, not only the Levis, are carried as data in Harish-Chandra induction and restriction for finite general linear groups.
Depends on
- Compositions, partial flags, and standard parabolics
- Block Levi decomposition of standard parabolics
- Standard subgroups of finite general linear groups
- Permutation Weyl group and inversion length
- Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- Subgroup
- Normal subgroup: invariance under conjugation
- Left group actions, transitive actions, and faithful actions
- The symmetric group $\operatorname{Sym}(X)$: the bijections of a set $X$ under composition
- $\operatorname{Sym}(X)$ is a group under composition, and it is non-abelian whenever $X$ has at least three distinct elements
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Complete flags are G/B
- Linear subspace of a vector space
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- 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)$
- Harish-Chandra induction and restriction for finite general linear groups
Used by
Dependency tree · two levels
75 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 and the proof of Lemma 9.9, printed pp. 30 and 40 (standard reference, not scraped)
- Jay Taylor, Finite Reductive Groups - Sections 3.5, 4.7 and 5.2, printed pp. 37-39 and 41-43 (standard reference, not scraped)