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 , let be a prime power, put and let be a composition of with standard parabolic (Compositions, partial flags, and standard parabolics, Harish-Chandra induction and restriction for finite general linear groups). Write for the trivial representation of , on which every element of acts as the identity (The trivial representation, the regular representation, and permutation representations from finite -sets). Then the Harish-Chandra induction of the trivial module is the permutation representation of on the partial flags of type : where the middle isomorphism is the induced-trivial isomorphism of Inducing the trivial representation gives the permutation representation on and the last is the transport of structure along the -equivariant bijection of Compositions, partial flags, and standard parabolics. Under this identification is the space of complex functions on the type- partial flags, with In the two extreme cases this reads for , where there is a single type- partial flag, and for , the permutation module on the complete flags (Complete flags are G/B). Since , the dimension of this permutation module is the number of partial flags of type .
Facts & Assumptions
Given: A prime power , an integer , the group , and a composition of .
The standard parabolic is an internal semidirect product, the projection (with kernel ) inverts the isomorphism , and the inflation of an -module is with ; the Harish-Chandra induction is , and for complex finite-dimensional one has (Harish-Chandra induction and restriction for finite general linear groups, Compositions, partial flags, and standard parabolics).
For a finite group and a subgroup , inducing the trivial complex representation of to gives the permutation representation of on the left coset set : the induced module is identified with the functions on , and the action is the left permutation action on cosets (Inducing the trivial representation gives the permutation representation on ).
The trivial representation of a group over a field is with every group element acting as the identity, and for a finite left -set the free -module with is the permutation representation attached to (The trivial representation, the regular representation, and permutation representations from finite -sets).
The set of partial flags of type is a -set under , the standard partial flag has and stabiliser , and is a -equivariant bijection ; for the set has the single element (Compositions, partial flags, and standard parabolics, Left group actions, transitive actions, and faithful actions).
For the partial flags of type are the complete flags of , and is a -equivariant bijection from the left cosets onto the complete flags, where is the standard Borel subgroup (Complete flags are G/B, Compositions, partial flags, and standard parabolics, Standard subgroups of finite general linear groups).
Verification
The trivial representation of has for every and , because is the trivial -module; hence the inflated action of [F1] is , so the inflation is the trivial -module.
By [F2] applied to the subgroup , the induction of the trivial -module is the permutation representation of on the left cosets , so by step 1.1 the Harish-Chandra induction satisfies .
The orbit map is a -equivariant bijection by [F4]; transporting functions along it defines a linear isomorphism by , which is well defined and bijective because the orbit map is. It is -equivariant: for one has , using the left-coset action on and the action of [F4] on flags; hence as -modules, with the action .
Combining steps 2.1 and 3.1 gives : the Harish-Chandra induction of the trivial -module is the permutation representation of on the partial flags of type , the space of complex functions on with the action .
For the standard parabolic is with and , and by [F4] the set has the single element , so is the permutation representation on a one-point set, that is, the trivial -module ; for the identification of [F5] gives with , the permutation module of on the complete flags.
Finally by the dimension formula of [F1], and under the bijection of [F4] the index is the number of partial flags of type ; the two extremes of step 5.1 are the cases , where there is a single type- flag and the index is , and , where the flags are the complete flags and . ∎
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 matches the boundary behaviour of the functors. The identification uses the -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 ; no character theory is used, so the statement is the natural isomorphism of -modules on the nose, not merely an equality of composition factors.
Depends on
- Harish-Chandra induction and restriction for finite general linear groups
- Compositions, partial flags, and standard parabolics
- Inducing the trivial representation gives the permutation representation on $G/H$
- The trivial representation, the regular representation, and permutation representations from finite $G$-sets
- Complete flags are G/B
- Left group actions, transitive actions, and faithful actions
- Standard subgroups of finite general linear groups
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
- Olivier Dudas and Jean Michel, Lectures on Finite Reductive Groups and Their Representations - Definition 9.2 and Remark 9.3, printed p. 35 (standard reference, not scraped)
- Jay Taylor, Finite Reductive Groups - Definition 5.2, printed p. 42 (standard reference, not scraped)