Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

Grassmannians as maximal parabolic quotients

Example

Let q be a prime power, let n≥2 and 1≤r<n, put G=GL⁡n(Fq) and V=Fqn with its standard basis e1,…,en (Standard subgroups of finite general linear groups), and let α=(r,n−r) be the two-part composition of n attached to r. A partial flag of type α is a chain 0=F0⊊F1⊊F2=V with dim⁡FqF1=r and F2=V forced, so such a flag is determined by its member F1. The type-α partial flags are therefore in bijection with the r-dimensional subspaces of V, the points of the Grassmannian Gr⁡(r,n). With the standard partial flag W1=⟨e1,…,er⟩, W2=V of type α, the orbit map G/Pα⟶Gr⁡(r,n),gPα⟼g(W1)=⟨g(e1),…,g(er)⟩, is a G-equivariant bijection onto the r-dimensional subspaces, for the natural left action of G on subspaces (Compositions, partial flags, and standard parabolics, Every transitive G-set is equivariantly isomorphic to G/Gx for any chosen point x, Left group actions, transitive actions, and faithful actions), and the unquotiented orbit map G→Gr⁡(r,n), g↦g(W1), has fibres the left cosets of the stabiliser of W1, which is Pα=P(r,n−r)={ p∈G: p=(AB0D), A∈Mr(Fq), D∈Mn−r(Fq), B∈Mr×(n−r)(Fq) }. Among the standard parabolics Pβ, this one is maximal: the only composition β of n with Pβ⊋Pα is β=(n), for which P(n)=G. For r=1 the Grassmannian is the projective space of lines of V, and counting the nonzero vectors of V line by line gives #Gr⁡(1,n)=qn−1q−1=qn−1+qn−2+⋯+q+1, so that Fq2 has q+1 lines and Fq3 has q2+q+1.

Facts & Assumptions

Given: A prime power q, integers n≥2 and 1≤r<n, the space V=Fqn with standard basis e1,…,en, the group G=GL⁡n(Fq), and the composition α=(r,n−r) of n.

[F1]

The standard flag of V=Fqn consists of the coordinate subspaces Vj=⟨e1,…,ej⟩ with dim⁡FqVj=j, and G=GL⁡n(Fq) is the group of invertible n×n matrices over Fq (Standard subgroups of finite general linear groups).

[F2]

A composition α of n has blocks Ii={ di−1+1,…,di } and a block map blk⁡; a partial flag of type α is a strictly increasing chain 0=F0⊊⋯⊊Fr=V with dim⁡FqFi=di; the standard partial flag is Wi=Vdi; a matrix p∈G lies in the standard parabolic Pα exactly when pkl=0 for all k,l with blk⁡(k)>blk⁡(l), and P(n)=G while P(1n)=B is the standard Borel subgroup; the group G acts on the set Fα of partial flags of type α by g⋅F∙=(g(F0),…,g(Fr)), this action is transitive, the stabiliser of the standard partial flag is Pα, and gPα↦g⋅W∙(α) is a G-equivariant bijection G/Pα→Fα (Compositions, partial flags, and standard parabolics, Left group actions, transitive actions, and faithful actions, Every transitive G-set is equivariantly isomorphic to G/Gx for any chosen point x).

[F3]

If U⊆W are linear subspaces of a finite-dimensional vector space and dim⁡U=dim⁡W, then U=W; moreover every linearly independent subset of a finite-dimensional space is contained in a basis, so a nonzero vector spans a 1-dimensional subspace (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, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

[F4]

The span of a set is the intersection of all linear subspaces containing it, and for a linear map g and vectors v1,…,vk one has g(⟨v1,…,vk⟩)=⟨g(v1),…,g(vk)⟩ (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

[F5]

For matrices over a field, (AB)il=∑j=1kaijbjl when the shapes match, and In is the identity matrix with entries δkl (Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes, Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication).

[F6]

The finite field Fq has exactly q elements, so V=Fqn has qn elements; and in a vector space over a field, λv=0 with v≠0 forces λ=0, while λv=μv forces λ=μ (Finite fields and their order, Field, Vector space over a field).

Verification

technique · direct
1.1

The composition α=(r,n−r) has length 2, partial sums d1=r and d2=n, and blocks I1={1,…,r}, I2={r+1,…,n}; hence a partial flag of type α is a chain 0=F0⊊F1⊊F2=V with dim⁡FqF1=r, and its last member is forced to be V. Consequently F∙↦F1 is a bijection from Fα onto the set Gr⁡(r,n) of r-dimensional subspaces of V, whose inverse sends E to the chain 0⊊E⊊V; the standard partial flag is W1=Vr=⟨e1,…,er⟩, W2=Vn=V.

givenF1F2
1.2

The entry criterion of [F2] for α=(r,n−r) reads pkl=0 whenever blk⁡(k)>blk⁡(l), that is, whenever k≥r+1 and l≤r; hence Pα consists exactly of the matrices p∈G with zero bottom-left block, that is, of the invertible block matrices (AB0D) with A∈Mr(Fq), D∈Mn−r(Fq) and arbitrary B∈Mr×(n−r)(Fq). In particular Pα is the stabiliser of W1, because W2=V is fixed by every element of G and the stabiliser of the standard partial flag is Pα by [F2].

F1F2
1.3

Maximality among standard parabolics. For a composition β of n put T(β):={ (k,l):blk⁡β(k)>blk⁡β(l) }, so that by the entry criterion of [F2] a matrix p∈G lies in Pβ exactly when pkl=0 for all (k,l)∈T(β). For k≠l let τkl(c):=In+c ekelT be the elementary matrix with the single off-diagonal entry c in position (k,l); by [F5] one has τkl(c)τkl(−c)=In, so τkl(c)∈G, and τkl(c)∈Pβ if and only if (k,l)∉T(β) or c=0; taking c=1, the matrix τkl(1) lies in Pβ exactly when (k,l)∉T(β).

F2F5
2.1

Composing the bijection gPα↦g⋅W∙(α) of [F2] with the identification Fα→Gr⁡(r,n), F∙↦F1, of step 1.1 gives the map φ(gPα):=g(W1)=⟨g(e1),…,g(er)⟩; it is a bijection G/Pα→Gr⁡(r,n) by [F2] and step 1.1, it is well defined and has singleton fibres, while the unquotiented map g↦g(W1) has fibres the left cosets of Pα by step 1.2, and it is G-equivariant: φ(x⋅gPα)=φ(xgPα)=(xg)(W1)=x(g(W1))=x⋅φ(gPα), where the action on Gr⁡(r,n) is the natural one induced by the action on chains. Thus the r-dimensional subspaces of V are the left cosets of Pα in G, with gPα↔g(W1), and φ is an isomorphism of G-sets.

step 1.1step 1.2F2F4
2.2

If (k,l)∈T(β) but (k,l)∉T(α), then τkl(1) lies in Pα but not in Pβ by step 1.3, so Pβ⊉Pα; therefore Pβ⊇Pα forces T(β)⊆T(α). Conversely T(β)⊆T(α) means that every matrix vanishing on T(α) vanishes on T(β), that is, Pα⊆Pβ; hence Pβ⊇Pα  ⟺  T(β)⊆T(α).

step 1.3F2
3.1

The inclusion T(β)⊆T(α) holds if and only if every block of α is contained in a block of β: if k<l lie in a common block of α then (l,k)∉T(α), so (l,k)∉T(β), which by blk⁡β(l)≥blk⁡β(k) gives blk⁡β(l)=blk⁡β(k), so the whole α-block lies in one β-block; conversely, if every α-block lies in a β-block, then blk⁡β(k)>blk⁡β(l) puts the β-block of k strictly to the right of that of l, hence the α-block of k strictly to the right of that of l, that is blk⁡α(k)>blk⁡α(l). For α=(r,n−r) the blocks are the two nonempty intervals I1 and I2, so a composition β such that every α-block lies in a β-block is either β=α or β=(n); by step 2.2 the standard parabolics containing Pα are therefore exactly Pα and P(n)=G, so P(r,n−r) is maximal among the standard parabolics Pβ.

step 2.2F2
3.2

For r=1 a subspace is a line exactly when it is one-dimensional; for 0≠w∈V the span ⟨w⟩={λw:λ∈Fq} is such a line, since w is linearly independent, and every line L=⟨v⟩ with 0≠v consists of 0 together with the q−1 vectors λv with λ≠0, which are pairwise distinct by [F6]. Every nonzero vector w lies in the line ⟨w⟩, and if w lies in lines L,L′ then L=⟨w⟩=L′ by [F3], because both are one-dimensional subspaces containing the nonzero vector w; hence the qn−1 nonzero vectors of V are partitioned into the sets L∖{0} of the lines, each of size q−1. Counting gives qn−1=#Gr⁡(1,n)⋅(q−1), so #Gr⁡(1,n)=(qn−1)/(q−1)=qn−1+⋯+q+1; in particular Fq2 has q+1 lines and Fq3 has q2+q+1 lines.

step 2.1F3F6
4.1

At n≥2 and 1≤r<n the quotient G/P(r,n−r) is in G-equivariant bijection with the Grassmannian Gr⁡(r,n) of r-dimensional subspaces of Fqn via gPα↦g⟨e1,…,er⟩ (step 2.1), the subgroup P(r,n−r) is the stabiliser of ⟨e1,…,er⟩ (step 1.2) and is maximal among the standard parabolics, its only standard overgroup being P(n)=G (step 3.1); in the extreme case r=1 the quotient is the projective space of lines, of cardinality (qn−1)/(q−1) (step 3.2). ∎

step 1.2step 2.1step 3.1step 3.2

Remarks

The quotient in this example is the one used by Compositions, partial flags, and standard parabolics for a two-part composition, read on the Grassmannian: the parabolic P(r,n−r) contains the Borel subgroup B=P(1n), and it stabilises the r-dimensional coordinate subspace ⟨e1,…,er⟩. The maximality proved in the Verification section is maximality among the standard parabolics Pβ of the page, that is, the assertion that no Pβ with β≠(n) lies strictly between P(r,n−r) and G; maximality of P(r,n−r) among all proper subgroups of G is a different statement that is not needed here and is not proved in this example.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

55 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