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.

Compositions, partial flags, and standard parabolics

Definition

Compositions. A positive-part composition of n, or simply a composition, is a finite list α=(a1,…,ar) of positive integers with a1+⋯+ar=n; here r≥0 is the length of α and the ai are its parts. A composition of n thus records an ordered partition of n into nonzero parts, and for n≥1 the length satisfies 1≤r≤n. Its partial sums are di:=a1+⋯+ai(0≤i≤r), so that 0=d0<d1<⋯<dr=n. The blocks of α are the disjoint intervals of indices Ii:={ di−1+1, di−1+2, …, di }⊆{1,…,n}(1≤i≤r), which cover {1,…,n} in order and have ∣Ii∣=ai. Two extreme cases occur throughout: the one-part composition α=(n), with r=1 and block {1,…,n}, and the all-singletons composition α=(1,1,…,1)=(1n), with r=n and Ii={i}. Write blk⁡(k):=i for the unique i with k∈Ii, so that k<j with blk⁡(k)<blk⁡(j) means that k lies in a strictly earlier block than j.

Partial flags of type α. Fix the n-dimensional Fq-space V=Fqn with standard basis e1,…,en and standard flag V0⊊V1⊊⋯⊊Vn=V, where Vj=⟨e1,…,ej⟩ and dim⁡FqVj=j (Standard subgroups of finite general linear groups). A partial flag of type α is a strictly increasing chain of linear subspaces 0=F0⊊F1⊊⋯⊊Fr=V,dim⁡FqFi=di, that is, a chain whose successive dimensions are the partial sums of α; equivalently, a chain of subspaces of V in which exactly the dimensions d0,…,dr occur. The standard partial flag of type α is W∙(α):Wi:=Vdi=⟨e1,…,edi⟩,dim⁡FqWi=di, and its members are standard coordinate subspaces; the standard flag of Standard subgroups of finite general linear groups is the special case α=(1n). Complete flags correspond to the composition (1,1,…,1) and arbitrary subspaces of dimension r to (r,n−r) with 1≤r<n.

The standard parabolic subgroup of type α. A matrix p=(pkl)∈Mn(Fq) is upper block triangular of type α when pkl=0whenever blk⁡(k)>blk⁡(l), that is, whenever k lies in a strictly later block than l; entries with blk⁡(k)≤blk⁡(l) are unconstrained. Thus p is upper block triangular of type α exactly when it has the block shape (A11A12⋯A1r0A22⋯A2r⋮⋱⋱⋮0⋯0Arr),Aij∈Mai×aj(Fq), with square diagonal blocks Aii and arbitrary blocks above the diagonal. The standard parabolic subgroup of type α is Pα:={ p∈G:p is upper block triangular of type α }, and it is a subgroup of G: it contains In, and sums and products of upper block triangular matrices, as well as inverses of invertible ones, are again upper block triangular, because the block shape is stable under the block matrix operations of Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication. It is the stabiliser in G of the standard partial flag of type α, as verified below, and the two extreme cases are P(n)=G,P(1n)=B, the second because "upper block triangular of type (1n)" says pkl=0 for k>l, which is exactly the definition of an upper triangular matrix (Upper triangular, lower triangular and diagonal square matrices over a commutative ring), whose invertible members form B by Standard subgroups of finite general linear groups. The subgroup Pα is the standard parabolic subgroup containing B, and B≤Pα≤G for every composition α.

Partial flags as the coset space G/Pα. The group G acts on the set Fα of partial flags of type α by g⋅F∙:=( g(F0),…,g(Fr) ); this is a well-defined left action because g is an invertible linear map, so it preserves strict inclusions and dimensions, with In acting trivially. The action is transitive: given F∙∈Fα, choose vectors as follows. Extending a basis of Fi−1 to a basis of Fi is possible by the extension clause of If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V, and doing this successively for i=1,…,r produces an ordered basis v1,…,vn of V with Fi=⟨v1,…,vdi⟩(0≤i≤r); the linear map g with g(ej)=vj then has an invertible matrix in the standard basis (Complete flags are G/B, where the same argument produces an element of G) and satisfies g(Wi)=Fi for all i, that is, g⋅W∙(α)=F∙. The stabiliser of the standard partial flag is Pα: a matrix p∈G satisfies p(Wi)=Wi for all i exactly when p(Wi)⊆Wi for all i, because p is injective and dim⁡Fqp(Wi)=dim⁡FqWi=di; and p(Wi)⊆Wi means that the column block l of p has no nonzero entries below block i whenever blk⁡(l)≤i, which is exactly pkl=0 for blk⁡(k)>blk⁡(l). Consequently the orbit map G/Pα⟶Fα,gPα⟼g⋅W∙(α), is a G-equivariant bijection by Every transitive G-set is equivariantly isomorphic to G/Gx for any chosen point x and Left group actions, transitive actions, and faithful actions, so partial flags of type α are the left cosets of Pα.

Block Levis and unipotent radicals. With α fixed, the standard Levi subgroup of type α is the group of block diagonal matrices Lα:={ l∈Pα:lkl=0 whenever blk⁡(k)≠blk⁡(l) }, isomorphic to GL⁡a1(Fq)×⋯×GL⁡ar(Fq) by the block diagonal blocks, and the standard unipotent radical is Uα:={ u∈Pα:ukk=1 for all k, and ukl=0 whenever k≠l and blk⁡(k)≥blk⁡(l) }, the upper block triangular matrices with identity diagonal blocks and the off-diagonal blocks above the block diagonal. Thus U(n)={In} and U(1n)=U is the standard maximal unipotent subgroup of G. The decomposition Pα=Lα⋉Uα and the identification Lα≅∏i≤rGL⁡ai(Fq) are proved in Block Levi decomposition of standard parabolics.

Depends on

Used by

Dependency tree · two levels

48 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