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.

Parabolic induction of the trivial module as flag functions

Example

Let n≥1, let q be a prime power, put G=GL⁡n(Fq) and let α be a composition of n with standard parabolic Pα=Lα⋉Uα (Compositions, partial flags, and standard parabolics, Harish-Chandra induction and restriction for finite general linear groups). Write C for the trivial representation of Lα, on which every element of Lα acts as the identity (The trivial representation, the regular representation, and permutation representations from finite G-sets). Then the Harish-Chandra induction of the trivial module is the permutation representation of G on the partial flags of type α: RLαG(C)=Ind⁡PαG(Inf⁡LαPαC)  ≅  Ind⁡PαGC  ≅  C[G/Pα]  ≅  C[Fα], where the middle isomorphism is the induced-trivial isomorphism of Inducing the trivial representation gives the permutation representation on G/H and the last is the transport of structure along the G-equivariant bijection gPα↦g⋅W∙(α) of Compositions, partial flags, and standard parabolics. Under this identification RLαG(C) is the space of complex functions on the type-α partial flags, with (x⋅f)(F∙)=f(x−1⋅F∙)(x∈G). In the two extreme cases this reads RGG(C)=C for α=(n), where there is a single type-α partial flag, and RTG(C)≅C[G/B] for α=(1n), the permutation module on the complete flags (Complete flags are G/B). Since dim⁡CRLαG(C)=[G:Pα], the dimension of this permutation module is the number of partial flags of type α.

Facts & Assumptions

Given: A prime power q, an integer n≥1, the group G=GL⁡n(Fq), and a composition α of n.

[F1]

The standard parabolic Pα=Lα⋉Uα is an internal semidirect product, the projection π:Pα→Lα (with kernel Uα) inverts the isomorphism Lα→Pα/Uα, and the inflation of an Lα-module V is V with p⋅v=π(p)⋅v; the Harish-Chandra induction is RLαG(V)=Ind⁡PαG(Inf⁡LαPαV), and for complex finite-dimensional V one has dim⁡CRLαG(V)=[G:Pα]dim⁡CV (Harish-Chandra induction and restriction for finite general linear groups, Compositions, partial flags, and standard parabolics).

[F2]

For a finite group G and a subgroup H≤G, inducing the trivial complex representation of H to G gives the permutation representation of G on the left coset set G/H: the induced module is identified with the functions on G/H, and the action is the left permutation action on cosets (Inducing the trivial representation gives the permutation representation on G/H).

[F3]

The trivial representation of a group over a field k is k with every group element acting as the identity, and for a finite left G-set X the free k-module k(X) with g⋅ex=eg⋅x is the permutation representation attached to X (The trivial representation, the regular representation, and permutation representations from finite G-sets).

[F4]

The set Fα of partial flags of type α is a G-set under g⋅F∙=(g(F0),…,g(Fr)), the standard partial flag W∙(α) has Wi=Vdi and stabiliser Pα, and gPα↦g⋅W∙(α) is a G-equivariant bijection G/Pα→Fα; for α=(n) the set F(n) has the single element 0⊊V (Compositions, partial flags, and standard parabolics, Left group actions, transitive actions, and faithful actions).

[F5]

For α=(1n) the partial flags of type α are the complete flags of V=Fqn, and gB↦g⋅V∙ is a G-equivariant bijection from the left cosets G/B onto the complete flags, where B=P(1n) is the standard Borel subgroup (Complete flags are G/B, Compositions, partial flags, and standard parabolics, Standard subgroups of finite general linear groups).

Verification

technique · direct
1.1

The trivial representation C of Lα has π(p)⋅z=z for every p∈Pα and z∈C, because C is the trivial Lα-module; hence the inflated action of [F1] is p⋅z=π(p)⋅z=z, so the inflation Inf⁡LαPαC is the trivial Pα-module.

F1F3
2.1

By [F2] applied to the subgroup Pα≤G, the induction Ind⁡PαGC of the trivial Pα-module is the permutation representation of G on the left cosets G/Pα, so by step 1.1 the Harish-Chandra induction satisfies RLαG(C)=Ind⁡PαG(Inf⁡LαPαC)≅C[G/Pα].

step 1.1F1F2
3.1

The orbit map gPα↦g⋅W∙(α) is a G-equivariant bijection G/Pα→Fα by [F4]; transporting functions along it defines a linear isomorphism Φ:C[G/Pα]→C[Fα] by Φ(f)(g⋅W∙(α)):=f(gPα), which is well defined and bijective because the orbit map is. It is G-equivariant: for x,g∈G one has Φ(x⋅f)(g⋅W∙)=(x⋅f)(gPα)=f(x−1gPα)=Φ(f)((x−1g)⋅W∙)=Φ(f)(x−1⋅(g⋅W∙)), using the left-coset action on G/Pα and the action of [F4] on flags; hence C[G/Pα]≅C[Fα] as G-modules, with the action (x⋅f)(F∙)=f(x−1⋅F∙).

step 2.1F2F3F4
4.1

Combining steps 2.1 and 3.1 gives RLαG(C)≅C[Fα]: the Harish-Chandra induction of the trivial Lα-module is the permutation representation of G on the partial flags of type α, the space of complex functions on Fα with the action (x⋅f)(F∙)=f(x−1⋅F∙).

step 2.1step 3.1F3
5.1

For α=(n) the standard parabolic is P(n)=G with L(n)=G and U(n)={In}, and by [F4] the set F(n) has the single element 0⊊V, so RGG(C) is the permutation representation on a one-point set, that is, the trivial G-module C; for α=(1n) the identification of [F5] gives C[F(1n)]≅C[G/B] with B=P(1n), the permutation module of G on the complete flags.

step 4.1F4F5
6.1

Finally dim⁡CRLαG(C)=[G:Pα]⋅1=[G:Pα] by the dimension formula of [F1], and under the bijection of [F4] the index [G:Pα] is the number of partial flags of type α; the two extremes of step 5.1 are the cases α=(n), where there is a single type-α flag and the index is 1, and α=(1n), where the flags are the complete flags and RTG(C)≅C[G/B]. ∎

step 4.1step 5.1F1F4

Remarks

The example records the trivial case of Harish-Chandra induction on this page: the induced module is a permutation module, and the fact that the two extreme compositions give the trivial module and C[G/B] matches the boundary behaviour of the functors. The identification uses the G-equivariant bijection between cosets and flags from Compositions, partial flags, and standard parabolics and the induced-trivial theorem of Inducing the trivial representation gives the permutation representation on G/H; no character theory is used, so the statement is the natural isomorphism of G-modules on the nose, not merely an equality of composition factors.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

39 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