Alphabeta Math
LemmaStatement: 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.

Unipotent double-coset biset splitting

Statement

Let n≥1, let q be a prime power, put G=GL⁡n(Fq) and let α=(a1,…,ar) and β=(b1,…,bs) be compositions of n with blocks I1,…,Ir and J1,…,Js and standard parabolics Pα=Lα⋉Uα, Pβ=Lβ⋉Uβ (Compositions, partial flags, and standard parabolics, Block Levi decomposition of standard parabolics). Let τ∈Sn be any permutation and let w:=Pτ be its permutation matrix. One may in particular choose the block-increasing representative of a (Wα,Wβ)-double coset (Parabolic double cosets and block permutations, Permutation Weyl group and inversion length), and put M:=wLβw−1,V:=wUβw−1,X:=wPβw−1,C:=Lα∩M,A:=Lα∩V,D:=Uα∩M. Then:

  1. Subgroups and normalities. M,V,X are subgroups of G with X=MV, M∩V={In} and V⊴X; and C,A,D are subgroups of G with C≤Lα, C≤M, A≤V, D≤Uα, C normalising both A and D and A∩C={In}.
  2. The biset splitting. Let (Lα/A)×C(D\M) be the set of equivalence classes of the pairs (lA,Dm) with l∈Lα and m∈M under the equivalence relation generated by (lcA,Dm)∼(lA,Dcm)(l∈Lα, m∈M, c∈C), the balanced product of the right C-set Lα/A and the left C-set D\M, and write [lA,Dm] for the class of (lA,Dm). Then Φ([lA,Dm]):=Uα l m w Uβ is well defined and is a bijection from (Lα/A)×C(D\M) onto the set { UαxUβ:x∈PαwPβ } of (Uα,Uβ)-double cosets inside PαwPβ.
  3. Equivariance. The formulas a⋅(UαxUβ):=UαaxUβ and (UαxUβ)⋅b:=UαxbUβ define a left action of Lα and a right action of Lβ on the set of claim 2; the formulas a⋅[lA,Dm]:=[alA,Dm],[lA,Dm]⋅b:=[lA,D m wbw−1] define a left action of Lα and a right action of Lβ on the balanced product; and Φ is equivariant for them, that is Φ(a⋅x)=a⋅Φ(x) and Φ(x⋅b)=Φ(x)⋅b.

Facts & Assumptions

Given: An integer n≥1, a prime power q, the group G=GL⁡n(Fq), compositions α=(a1,…,ar) and β=(b1,…,bs) of n with blocks I1,…,Ir and J1,…,Js, the standard parabolics Pα=Lα⋉Uα and Pβ=Lβ⋉Uβ, a permutation τ∈Sn, its permutation matrix w=Pτ, and the groups M,V,X,C,A,D displayed in the statement.

[L1]

For every composition γ of n with blocks K1,…,Kt, writing blk⁡γ(k) for the index with k∈Kblk⁡γ(k), the standard parabolic Pγ, its Levi subgroup Lγ and its unipotent radical Uγ of Compositions, partial flags, and standard parabolics satisfy Lγ∩Uγ={In}, Uγ⊴Pγ, the multiplication map Lγ×Uγ→Pγ is a bijection (so that each g∈Pγ has a unique factorisation g=lu with l∈Lγ, u∈Uγ), Pγ=Lγ⋉Uγ, and, with the γ-block diagonal part diag⁡γ(g) of g∈Pγ defined by diag⁡γ(g)kl=gkl when blk⁡γ(k)=blk⁡γ(l) and diag⁡γ(g)kl=0 otherwise, one has 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, gkl=0 whenever k≠l and blk⁡γ(k)≥blk⁡γ(l) }, and diag⁡γ(g) is the Levi factor of g, that is g=diag⁡γ(g)⋅u with u∈Uγ (Compositions, partial flags, and standard parabolics, Block Levi decomposition of standard parabolics).

[L2]

For σ,τ∈Sn the permutation matrix Pσ satisfies (Pσ)ij=1 exactly when i=σ(j), PσPτ=Pσ∘τ and Pσ−1=Pσ−1, and the classes wσ=PσT identify Sn with the Weyl group W=N/T≅Sn (Permutation Weyl group and inversion length); consequently w=Pτ is invertible with w−1=Pτ−1, and for every matrix A and all k,l one has (wAw−1)kl=Aτ−1(k),τ−1(l), the entry formula for the product coming from the permutation-matrix entries together with (AB)kl=∑iAkiBil (Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication, Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

[L3]

Matrix multiplication over a field is associative, distributes over addition and is compatible with scalar multiplication (Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication), and the (k,l) entry of a product AB of matrices is (AB)kl=∑iAkiBil (Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

[L4]

In a group, the intersection of a nonempty family of subgroups is a subgroup (The intersection of a nonempty family of subgroups of G is a subgroup of G); a subgroup N≤G is normal when gNg−1=N for all g∈G (Normal subgroup: invariance under conjugation); and for a subgroup H≤G the left coset is gH={ gh:h∈H } (Left and right cosets gH and Hg of a subgroup, Subgroup).

[L5]

Every (Wα,Wβ)-double coset of W contains exactly one (α,β)-block-increasing permutation τ, which is its unique element of minimal inversion length, and τ↦PαPτPβ is a bijection from the set of these double cosets onto the set of (Pα,Pβ)-double cosets of G (Parabolic double cosets and block permutations).

[L6]

A left action of a group K on a set S is a map K×S→S with e⋅s=s and (kk′)⋅s=k⋅(k′⋅s) for all k,k′∈K, s∈S (Left group actions, transitive actions, and faithful actions); a right action of K on S is a map S×K→S, written (s,k)↦s⋅k, with s⋅e=s and s⋅(kk′)=(s⋅k)⋅k′ for all k,k′∈K, s∈S, an axiom pair verified below directly from associativity in G.

[L7]

The two extreme compositions give P(n)=G with L(n)=G, U(n)={In} and P(1n)=B with L(1n)=T, U(1n)=U, where T∩U={In} is the diagonal torus and U the standard maximal unipotent subgroup; and for n=1 one has G=B=T=Fq× and U={I1} (Compositions, partial flags, and standard parabolics, Block Levi decomposition of standard parabolics, Standard subgroups of finite general linear groups).

Proof

technique · direct
1.1

The transported blocks and the groups M,V,X. Put κ(k):=blk⁡β(τ−1(k)) for 1≤k≤n, so that k∈τ(Jj) exactly when κ(k)=j; by [L2] one has (wAw−1)kl=Aτ−1(k),τ−1(l) for every matrix A, so applying the criteria of [L1] to the composition β gives X={ g:gkl=0 whenever κ(k)>κ(l) },M={ g:gkl=0 whenever κ(k)≠κ(l) },V={ g∈X:gkk=1 for all k, gkl=0 whenever k≠l and κ(k)≥κ(l) }, and then M,V⊆X, M∩V={In} (both contain wInw−1=In, and an element wpw−1=wqw−1 with p∈Lβ, q∈Uβ satisfies p=q∈Lβ∩Uβ={In}), X=MV (as Pβ=LβUβ), X,M,V are subgroups of G and V⊴X, because products and inverses are carried by w(pq)w−1=(wpw−1)(wqw−1) and (wqw−1)−1=wq−1w−1 by [L3], and for x=wpw−1∈X and v=wuw−1∈V one has xvx−1=w(pup−1)w−1∈V since pup−1∈Uβ by [L1].

L1L2L3
2.1

The subgroups C,A,D. The sets C=Lα∩M, A=Lα∩V and D=Uα∩M are subgroups of G by [L4], and C⊆Lα, C⊆M, A⊆V, D⊆Uα hold by definition; moreover A∩C⊆V∩M={In} by step 1.1.

step 1.1L4
2.2

The projection onto M. Since X=MV with M∩V={In} and V⊴X by step 1.1, every g∈X has a unique factorisation g=m u with m∈M and u∈V: if m1u1=m2u2 with mi∈M, ui∈V, then m2−1m1=u2u1−1∈M∩V={In}, so m1=m2 and u1=u2. Define π:X→M by π(g):=m for g=mu; then π(g)−1g∈V for all g∈X, and π is a group homomorphism with kernel V, because for g=mu and g′=m′u′ one has gg′=m m′ (m′−1um′ u′) with m′−1um′∈V and u′∈V by [L3] and step 1.1, so the factorisation of gg′ is (mm′)⋅(m′−1um′u′) and π(gg′)=mm′=π(g)π(g′), while π(g)=In holds exactly when g∈V.

step 1.1L3
2.3

The components of Pα∩X lie in X. Let g∈Pα∩X and let g=l0u0 be its factorisation from [L1] with l0∈Lα and u0∈Uα; put l:=l0 and u:=gl0−1=l0u0l0−1∈Uα, so that g=u l with u∈Uα and l∈Lα. Then l is the α-block diagonal part of g: if k,j lie in the same α-block It, then, since l is block diagonal and u has identity diagonal blocks, gkj=(ul)kj=∑mukmlmj=∑m∈Itukmlmj=lkj; entries of l between different α-blocks are zero. Hence l∈X: if κ(k)>κ(j) then either blk⁡α(k)≠blk⁡α(j) and lkj=0, or blk⁡α(k)=blk⁡α(j) and lkj=gkj=0 because g∈X by the criterion of step 1.1. Finally u=gl−1∈X, because X is a subgroup containing g and l by step 1.1.

step 1.1L1L3
2.4

Φ is well defined. First, changing representatives of the two cosets does not change the image. If a∈A=Lα∩V, then m−1am∈V because M normalises V by step 1.1; hence UαlamwUβ=Uαlm(m−1am)wUβ=UαlmwUβ, because w−1(m−1am)w∈Uβ. If d∈D=Uα∩M, then ldl−1∈Uα by [L1], so UαldmwUβ=UαlmwUβ. Second, for c∈C the two sides of the generating balancing relation have the same image, since (lc)m=l(cm) by [L3]: Uα (lc) m w Uβ=Uα l (cm) w Uβ. Finally, Φ takes values in the specified (Uα,Uβ)-double cosets inside PαwPβ: writing m=wm0w−1 with m0∈Lβ gives lmw=lwm0∈PαwPβ.

step 1.1L1L3
3.1

Normalisation by C. Let c∈C. Then cLαc−1=Lα and cUαc−1=Uα, because C⊆Lα⊆Pα and Uα⊴Pα by [L1]; and cMc−1=M, because C⊆M; and cVc−1=V, because C⊆X and V⊴X by step 1.1. Hence cAc−1=c (Lα∩V) c−1=(cLαc−1)∩(cVc−1)=Lα∩V=A and cDc−1=c (Uα∩M) c−1=(cUαc−1)∩(cMc−1)=Uα∩M=D, so C normalises A and D. Consequently right multiplication by C on Lα/A and left multiplication by C on D\M are well defined.

step 1.1step 2.1L1L4
3.2

The κ-block diagonal part, and Lα∩X. For g∈X let d be the κ-block diagonal part of g, that is dkl:=gkl when κ(k)=κ(l) and dkl:=0 otherwise; then d=π(g). Indeed, write g=wpw−1 with p∈Pβ and p=λu with λ∈Lβ, u∈Uβ as in [L1]; the conjugation formula of [L2] gives d=wλw−1, and wλw−1∈M={ g:gkl=0 whenever κ(k)≠κ(l) } by step 1.1, while d−1g=w(λ−1p)w−1∈V by [L1], so the factorisation g=d⋅(d−1g) with d∈M and d−1g∈V is the one of step 2.2 and d=π(g). Consequently, for g∈Lα∩X the element π(g) lies in Lα: its entries are entries of g inside κ-blocks and zero elsewhere, and g vanishes off the α-block diagonal by [L1]; hence π(g)∈C=Lα∩M. Moreover g=a π(g) with a:=π(g) (π(g)−1g) π(g)−1: here π(g)−1g∈V by step 2.2, and a∈V because π(g)∈M⊆X normalises the normal subgroup V⊴X of step 1.1, while a∈Lα as a product of elements of Lα; so a∈A=Lα∩V.

step 1.1step 2.2L1L2L3
3.3

Φ is surjective. Let x∈PαwPβ, say x=p w q with p∈Pα and q∈Pβ. By [L1] write p=lu with l∈Lα, u∈Uα and q=m0u0 with m0∈Lβ, u0∈Uβ, and put m:=wm0w−1∈M, so that wm0=mw and x=l u m w u0. Then UαxUβ=Uα l u m w u0 Uβ=Uα l m w Uβ=Φ([lA,Dm]), because lul−1∈Uα (as Uα⊴Pα and l∈Lα⊆Pα by [L1]) makes Uαlu=Uαl, and u0Uβ=Uβ since u0∈Uβ. Hence every (Uα,Uβ)-double coset inside PαwPβ lies in the image of Φ.

step 1.1step 2.4L1L3
3.4

Claim 3: the two biset structures agree. For a∈Lα and b∈Lβ the formulas a⋅(UαxUβ):=UαaxUβ and (UαxUβ)⋅b:=UαxbUβ are well defined (as aUαa−1=Uα and bUβb−1=Uβ by [L1]) and satisfy the axioms of [L6], so they are a left action of Lα and a right action of Lβ. On the balanced product the formulas a⋅[lA,Dm]:=[alA,Dm] and [lA,Dm]⋅b:=[lA,D m wbw−1] are well defined, because they carry the generating relation to a relation of the same form, ((al)cA,Dm)∼(alA,Dcm) and (lcA,D m wbw−1)∼(lA,D c m wbw−1) for c∈C; they are actions because M is a subgroup and b↦wbw−1 is a homomorphism Lβ→M (it is conjugation by the fixed element w and wLβw−1=M, while w(bb′)w−1=(wbw−1)(wb′w−1) and wInw−1=In by [L3]). Finally, for bw:=wbw−1 one has bww=wb, so Φ(a⋅[lA,Dm])=Uα a l m w Uβ=a⋅Φ([lA,Dm]),Φ([lA,Dm]⋅b)=Uα l m bw w Uβ=Uα l m w b Uβ=Φ([lA,Dm])⋅b.

step 1.1step 2.1step 2.4L1L3L6
4.1

The M-component of Uα∩X. For u∈Uα∩X one has π(u)∈D=Uα∩M. Indeed π(u) is the κ-block diagonal part d of u by step 3.2, so d∈M and dkk=ukk=1 for all k, while dkl=0 whenever k≠l and blk⁡α(k)≥blk⁡α(l): if κ(k)≠κ(l) then dkl=0, and if κ(k)=κ(l) then dkl=ukl=0 by the criterion for Uα in [L1]. Hence d∈Uα and d∈D.

step 3.2L1
5.1

Φ is injective. Let l,l′∈Lα and m,m′∈M with Φ([l′A,Dm′])=Φ([lA,Dm]), that is Uαl′m′wUβ=UαlmwUβ. Then there are u0∈Uα and u2∈Uβ with l′m′wu2=u0lmw; putting v:=wu2w−1∈V gives l′m′v=u0lm and hence m′=l′−1u0lmv−1=(l′−1u0l′) (l′−1l) m v−1=u′ λ m v1, where u′:=l′−1u0l′∈Uα, λ:=l′−1l∈Lα and v1:=v−1∈V. Therefore m′m−1=u′λ (mv1m−1)=u′λv2 with v2:=mv1m−1∈V, because m∈M⊆X normalises V⊴X by step 1.1; so u′λ=(m′m−1)v2−1∈M⋅V⊆X by step 1.1 and u′λ∈UαLα=Pα by [L1], that is u′λ∈Pα∩X, and step 2.3 gives u′∈X and λ∈X. Applying the homomorphism π of step 2.2 to m′m−1=u′λv2 gives m′m−1=π(m′m−1)=π(u′) π(λ) π(v2)=π(u′) π(λ), since m′m−1∈M satisfies π(m′m−1)=m′m−1 and v2∈V=ker⁡π by step 2.2; with d:=π(u′)∈D by step 4.1 and c:=π(λ)∈C by step 3.2 this is m′=d c m. By step 3.2 applied to λ∈Lα∩X we have λ=a c with a∈A, so l′=lλ−1=l c−1a−1. Hence l′A=lc−1A and Dm′=Dcm, and the pair (l′A,Dm′)=(lc−1A,Dcm) is related to (lA,Dm) by the generating relation, because (lc−1) c=l and c (Dm)=Dcm; therefore [l′A,Dm′]=[lA,Dm], so Φ is injective.

step 1.1step 2.2step 2.3step 3.2step 4.1L1L3L4
6.1

Claims 1 and 2. Steps 1.1, 2.1 and 3.1 prove claim 1. Step 2.4 shows that Φ is well defined on the balanced product, step 3.3 that it is surjective onto the set of (Uα,Uβ)-double cosets inside PαwPβ, and step 5.1 that it is injective; hence Φ is a bijection, which is claim 2, the set PαwPβ being by [L5] the double coset attached to the (Wα,Wβ)-double coset of τ. The entry and projection arguments above used no block-increasing hypothesis.

step 1.1step 2.1step 3.1step 2.4step 3.3step 5.1L5
7.1

The extreme cases. For α=β=(n) one has Uα=Uβ={In} and Lα=Lβ=G by [L7], so M=X=G=Lα, V={In}, C=G and A=D={In}; the balanced product is the quotient of G×G by (gc,m)∼(g,cm) and is in bijection with G via the well-defined map (l,m)↦lm (with inverse g↦(g,In)), while the double cosets inside PαwPβ=G are the singletons, so claim 2 reads G≅G via g↦gw, each target double coset being a singleton. For α=β=(1n) one has Uα=Uβ=U and Lα=Lβ=T by [L7], so M=wTw−1=T (the conjugation formula of [L2] only permutes the diagonal positions), V=wUw−1, C=T∩T=T, and A=T∩V={In}, D=U∩T={In} because T∩U={In} by [L7] and V is a conjugate of U; the balanced product is therefore (T/{In})×T({In}\T)≅T and claim 2 specialises to a bijection T→U\(BwB)/U. For n=1 one has α=β=(1), G=B=T=Fq× and U={I1} by [L7], so M=C=G, A=D={I1} and claim 2 is the tautological bijection from G onto the singletons {g}=Uα{g}Uβ inside PαwPβ=G.

step 2.1step 6.1L1L2L7
8.1

Conclusion. Claims 1, 2 and 3 of the statement are steps 6.1, 6.1 and 3.4, with the extreme cases verified in step 7.1; the proof is complete. ∎

step 6.1step 3.4step 7.1

Depends on

Used by

Dependency tree · two levels

46 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