Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

Block Levi decomposition of standard parabolics

Statement

Let n≥1, let q be a prime power and let α=(a1,…,ar) be a composition of n, with standard parabolic Pα, standard Levi subgroup Lα and standard unipotent radical Uα (Compositions, partial flags, and standard parabolics). Then Lα and Uα are subgroups of Pα, Lα∩Uα={In}, Uα⊴Pα, and the multiplication map Lα×Uα⟶Pα,(l,u)⟼lu, is a bijection; equivalently Pα=Lα⋉Uα. Moreover the block diagonal map is an isomorphism of groups Lα⟶GL⁡a1(Fq)×⋯×GL⁡ar(Fq),l⟼(A11,…,Arr), whose inverse assembles the blocks, and the two extreme cases are P(n)=G=L(n), U(n)={In} and P(1n)=B=L(1n)⋉U(1n) with L(1n)=T the diagonal torus and U(1n)=U the standard maximal unipotent subgroup.

Facts & Assumptions

Given: An integer n≥1, a prime power q, a composition α=(a1,…,ar) of n with blocks I1,…,Ir and partial sums di=a1+⋯+ai, the group G=GL⁡n(Fq), and the subgroups Pα, Lα, Uα≤G of Compositions, partial flags, and standard parabolics.

[L1]

Pα is the set of invertible matrices p=(pkl) with pkl=0 whenever blk⁡(k)>blk⁡(l), and it is a subgroup of G containing B; Lα is the set of block diagonal matrices in Pα, Uα the set of u∈Pα with ukk=1 all k and ukl=0 whenever k≠l and blk⁡(k)≥blk⁡(l); P(n)=G and P(1n)=B (Compositions, partial flags, and standard parabolics).

[L2]

B=T⋉U where T is the set of invertible diagonal matrices and U the set of unitriangular matrices; U(1n)=U and L(1n)=T in the notation of [L1] (Standard subgroups of finite general linear groups, Compositions, partial flags, and standard parabolics).

[L3]

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 In, including zero-sized shapes, Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication).

[L4]

For A∈Mn(F) the following are equivalent: A is invertible; and N(A)={0} (Invertible matrix theorem: invertibility, full pivot rank, RREF I, trivial nullspace and unique solvability are equivalent).

[L5]

For every field F and natural m, GL⁡m(F) is a group under matrix multiplication (GL⁡n(F) is a group under matrix multiplication, including the trivial group GL⁡0(F)).

Proof

technique · direct
1.1

Lα is a subgroup of Pα: it contains In; if l,l′∈Lα then l l′∈Lα and l−1∈Lα, 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.

L1L3given
1.2

The diagonal block map φ:Pα→Lα, φ(p):=diag⁡(A11,…,Arr) formed from the diagonal blocks Aii of p, is a well-defined group homomorphism. It is well defined because p is invertible and each diagonal block is invertible: since p−1∈Pα by [L1], write its diagonal blocks as Bii. The block product rule [L3] applied to pp−1=p−1p=In gives AiiBii=BiiAii=Iai, so each Aii is invertible and belongs to GL⁡ai(Fq) by [L4], so each diagonal block lies in the group GL⁡ai(Fq) 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].

L1L3L4L5given
2.1

The kernel of φ is Uα: a matrix p∈Pα satisfies φ(p)=In exactly when pkk=1 for every k and pkl=0 for k≠l with blk⁡(k)≥blk⁡(l), which is the definition of Uα; since φ is a homomorphism by step 1.2, this makes Uα a subgroup of Pα and Uα⊴Pα.

step 1.2L1
3.1

The map φ:Pα→Lα is surjective, since φ(l)=l for every l∈Lα; thus inclusion Lα↪Pα is a section of φ. Separately, the block-extraction map ψ:Lα→∏i=1rGL⁡ai(Fq), ψ(l)=(A11,…,Arr), is a group homomorphism by [L3]. Its inverse is the assembly map (g1,…,gr)↦diag⁡(g1,…,gr): both composites are identities by inspection of the blocks. This proves the asserted isomorphism for Lα, while ker⁡φ=Uα remains as in step 2.1.

step 1.2step 2.1L3L5
4.1

Every p∈Pα factors as p=φ(p)⋅φ(p)−1p with φ(p)∈Lα by step 3.1 and φ(p)−1p∈Uα by step 2.1, so Pα=LαUα; if p=lu=l′u′ with l,l′∈Lα and u,u′∈Uα, then l−1l′=u(u′)−1 lies in Lα∩Uα, and a block diagonal matrix in Uα has ukk=1 and ukl=0 for k≠l, hence equals In, so l=l′ and u=u′. Therefore the multiplication map Lα×Uα→Pα is a bijection and, with Lα∩Uα={In} and Uα⊴Pα from step 2.1, the group Pα is the internal semidirect product Pα=Lα⋉Uα.

step 2.1step 3.1L1given
5.1

The extreme cases: at α=(n) there is one block, so P(n)=G by [L1] and every matrix is block diagonal of type (n), whence L(n)=G and U(n)={In}; at α=(1n) every block is a singleton, so L(1n) is the set of diagonal matrices in G and U(1n) the set of unitriangular matrices, that is L(1n)=T and U(1n)=U by [L2], with P(1n)=B and B=T⋉U. ∎

step 4.1L1L2

Depends on

Used by

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