Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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.

Ordered partitions and coordinate parabolics

Definition

Ordered partitions. An ordered partition of {1,…,n} is a finite list γ=(S1,…,Sr) of nonempty pairwise disjoint subsets S1,…,Sr⊆{1,…,n} with S1∪⋯∪Sr={1,…,n}. Its members are the blocks of γ, its length is r (so that 1≤r≤n for n≥1), and for 1≤k≤n we write blk⁡γ(k) for the unique index with k∈Sblk⁡γ(k), so that k lies in an earlier block than l exactly when blk⁡γ(k)<blk⁡γ(l). A composition α=(a1,…,ar) of n is the same datum as the ordered partition (I1,…,Ir) whose blocks are its consecutive intervals Ii={ di−1+1,…,di } (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 ({1,…,n}) and the all-singleton partition ({1},{2},…,{n}), which correspond to the compositions (n) and (1n).

Coordinate parabolics. Let n≥1, let q be a prime power, put G=GL⁡n(Fq) with diagonal torus T and standard basis e1,…,en (Standard subgroups of finite general linear groups), and let γ=(S1,…,Sr) be an ordered partition of {1,…,n}. Define Pγ:={ g∈G:gkl=0 whenever blk⁡γ(k)>blk⁡γ(l) }, Lγ:={ g∈Pγ:gkl=0 whenever blk⁡γ(k)≠blk⁡γ(l) }, Uγ:={ g∈Pγ:gkk=1 for all k, and gkl=0 whenever k≠l and blk⁡γ(k)≥blk⁡γ(l) }, the coordinate parabolic, its coordinate Levi subgroup and its coordinate unipotent radical of type γ. For a composition α these are the standard subgroups Pα,Lα,Uα of Compositions, partial flags, and standard parabolics. We also call Fi(γ):=⟨ej:j∈S1∪⋯∪Si⟩(0≤i≤r) the coordinate flag of type γ, so that F∙(γ) is a strictly increasing chain of subspaces with dim⁡FqFi(γ)=∣S1∣+⋯+∣Si∣, and Pγ is the stabiliser in G of F∙(γ): a matrix p∈G satisfies p[Fi(γ)]⊆Fi(γ) for all i exactly when, for every l with blk⁡γ(l)≤i, the l-th column of p has no nonzero entry in a block Si′ with i′>i, which is exactly pkl=0 whenever blk⁡γ(k)>blk⁡γ(l) (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 p is injective and the chain is finite with dim⁡Fqp[Fi(γ)]=dim⁡FqFi(γ) (Invertible matrix theorem: invertibility, full pivot rank, RREF I, trivial nullspace and unique solvability are equivalent, Linear subspace of a vector space), the inclusions are equalities. In particular Pγ is a subgroup of G, 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 T≤Lγ≤Pγ.

Change of coordinates. Let σ∈Sn and let u:=Pσ∈G be the associated permutation matrix (Permutation Weyl group and inversion length), so that (u−1gu)ij=gσ(i),σ(j) for every matrix g (Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication, Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes). For an ordered partition γ=(S1,…,Sr) put σ(γ):=(σ(S1),…,σ(Sr)), again an ordered partition of {1,…,n}; then blk⁡σ(γ)(k)=blk⁡γ(σ−1(k))(1≤k≤n), and applying the entry formula for conjugation to the three defining conditions above gives Pσ(γ)=uPγu−1,Lσ(γ)=uLγu−1,Uσ(γ)=uUγu−1. For instance g∈uUγu−1 says that (u−1gu)kk=1 and (u−1gu)kl=0 whenever k≠l and blk⁡γ(k)≥blk⁡γ(l), which by the displayed formula for blk⁡σ(γ) is the defining condition for Uσ(γ); 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 gPαg−1 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 γ=(S1,…,Sr), choose the composition α:=(∣S1∣,…,∣Sr∣) of n, and let σ∈Sn be the unique permutation with σ(Ii)=Si for all i that is increasing on each block Ii; then γ=σ(α), and because Pα=Lα⋉Uα with Uα⊴Pα (Block Levi decomposition of standard parabolics), conjugation by the permutation matrix u=Pσ maps this decomposition to Pγ=Lγ⋉Uγ,Uγ⊴Pγ,Lγ∩Uγ={In}, because conjugation is an automorphism of G and carries the block diagonal matrices of type α onto those of type γ (GL⁡n(F) is a group under matrix multiplication, including the trivial group GL⁡0(F), Normal subgroup: invariance under conjugation); moreover Pγ is the stabiliser of the coordinate flag F∙(γ), as computed above. For the Weyl group, a permutation ρ∈Sn satisfies ρ(Si)=Si for all i exactly when (σ−1ρσ)(Ii)=Ii for all i, so with Wγ:={ ρ∈Sn:ρ(Si)=Si for every 1≤i≤r } one has Wγ=σWασ−1 in the group Sn, where Wα 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 Pγ exactly when its permutation lies in Wγ, so that N∩Pγ=T⋅{ Pρ:ρ∈Wγ } for the monomial subgroup N 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 (S1,…,Sr), then blk⁡γ′(k)≠blk⁡γ′(l) holds exactly when blk⁡γ(k)≠blk⁡γ(l), namely when k,l lie in different blocks, so Lγ′=Lγ; the unipotent radical Uγ on the other hand depends on the order of the blocks, as the case r=2 shows.

Remarks

  • Coordinate parabolics contain the diagonal torus, and for q>2 they are all the parabolics that do. We have T≤Lγ≤Pγ from the definitions above. Conversely let q>2 and let P≤G be a parabolic subgroup of G containing T, say P=gPαg−1 for some composition α and some g∈G; since Pα stabilises the standard partial flag W∙(α) of type α (Compositions, partial flags, and standard parabolics), the group P is the stabiliser of the partial flag F:=gW∙(α), and T≤P means that every member of F is T-stable. Since q>2, choose λ∈Fq× with λ≠1. For each i let ti∈T act by λ on ei and by 1 on every other coordinate line. If W⊆V is T-stable and v=∑jvjej∈W, then (ti−1)v=(λ−1)viei∈W, hence viei∈W because λ−1 is invertible. Thus W is spanned by the coordinate vectors it contains; therefore every member of F is a coordinate subspace, and the resulting strictly increasing chain of coordinate subspaces is the coordinate flag of a unique ordered partition γ of {1,…,n} with P=Pγ. At q=2 the conclusion fails, and not merely for want of proof: the torus T is then the trivial group, so every parabolic contains it, while for n=2 the three Borels of GL⁡2(F2)≅S3 are the upper triangular, the lower triangular and the stabiliser of the line ⟨e1+e2⟩; only the upper and lower triangular ones are coordinate parabolics, those of ({1},{2}) and ({2},{1}). Consequently the theory below is stated for coordinate parabolics, which is the class that the finite general linear group controls at every q; the larger class of all parabolics containing T agrees with it whenever q>2.
  • Every block order is a choice. Two ordered partitions with the same blocks in different orders give the same Levi and the same Wγ but different parabolics Pγ; 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

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