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.
Cuspidal representations and Harish-Chandra series
Definition
Refinements of ordered partitions. Let and let and be ordered partitions of (Ordered partitions and coordinate parabolics). One says that refines when every block of is contained in a block of , and that is a proper refinement of when in addition the two set partitions differ, that is, when does not refine . Equivalently, is obtained from by merging blocks, and at least one block of is the union of at least two blocks of ; in particular , since a matrix that is block diagonal for the finer ordered partition is block diagonal for (Ordered partitions and coordinate parabolics). Moreover because every can be written as with and (the standard Levi decomposition of Block Levi decomposition of standard parabolics transported by Ordered partitions and coordinate parabolics), and then forces ; conversely since both factors lie in both subgroups, and . By claim 1 of Transitivity and parabolic independence of Harish-Chandra induction the case in which the order of the blocks of is compatible with that of is the one in which and is displayed there as a coordinate parabolic of ; every refinement can be reordered compatibly, that is, its blocks can be listed block by block in the order of . The group is normalised by , because normalises (Ordered partitions and coordinate parabolics) and stabilises ; hence for every complex -module the invariants form a complex -submodule of (An -linear action of on a left -module, and a -module over ). We write for this -module, the Harish-Chandra restriction of from to (along the coordinate parabolic ); by claim 2 of Transitivity and parabolic independence of Harish-Chandra induction it does not depend, up to isomorphism of -modules, on the order in which the blocks of are listed.
Cuspidal modules. Let be an ordered partition of and let be a complex -module. Then is cuspidal when that is, when the invariants of under the unipotent radical of the coordinate parabolic of vanish for every properly smaller coordinate Levi subgroup obtained from a refinement of . We also say that a complex -module is non-cuspidal when it is not cuspidal.
Cuspidal pairs and Harish-Chandra series. A cuspidal pair is a pair consisting of a coordinate Levi subgroup and an irreducible cuspidal complex -module . The Harish-Chandra series attached to such a pair is the set of isomorphism classes of irreducible complex -modules that are irreducible quotients of , the Harish-Chandra induction of Harish-Chandra induction and restriction for finite general linear groups; since is a nonzero finite-dimensional complex -module and every finite-dimensional complex module of the finite group is completely reducible, belongs to the series if and only if is isomorphic to a direct summand of , and the series is nonempty (Maschke's theorem for finite groups over fields whose characteristic does not divide ).
Transport by a permutation. Let (The symmetric group : the bijections of a set under composition, is a group under composition, and it is non-abelian whenever has at least three distinct elements) and let be the associated permutation matrix (Permutation Weyl group and inversion length), so that conjugation by maps the coordinate subgroups of type onto those of type (Ordered partitions and coordinate parabolics): for an ordered partition put , so that For a complex -module let be the vector space with the action of given by which is a complex -module because is an isomorphism (Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication, Rectangular matrix multiplication and the identity matrix , including zero-sized shapes, is a group under matrix multiplication, including the trivial group ); we call the transport of by . For a complex -module let be the vector space with the -action ; since is an automorphism of , this is again a complex -module. Transport is compatible with composition, and , and a module and its transport by have the same dimension and the same lattice of submodules, so is irreducible exactly when is.
Remarks
The definition of cuspidality above tests the quotient for the standard parabolic of the standard Levi . Dudas and Michel (Definition 10.2) define cuspidality of a -module by the vanishing of for every proper -split Levi subgroup of the ambient group; the independence of the parabolic along which the restriction is taken is their Theorem 10.1, and the case needed above (two coordinate parabolics with the same coordinate Levi) is claim 2 of Transitivity and parabolic independence of Harish-Chandra induction. Taylor (Definition 5.7) uses the same vanishing condition for the standard Levis of a fixed split BN-pair, which is the form in which cuspidality is used by the Harish-Chandra series theorems of this page.
Two extreme cases illustrate the definition. For the one-block ordered partition one has , the proper refinements of are exactly the ordered partitions of having at least two blocks, and a complex -module is cuspidal in the sense above exactly when its invariants under the unipotent radical of every proper coordinate parabolic of vanish; for a cuspidal pair the series is the singleton , because is the identity functor (Harish-Chandra induction and restriction for finite general linear groups). For the all-singleton ordered partition one has and there is no proper refinement at all, so every complex -module is cuspidal; the series of the cuspidal pairs are the principal series of . In both cases cuspidality is the standard one for the corresponding standard Levi, and the list of proper refinements does not depend on the order in which the blocks of are listed.
Depends on
- Harish-Chandra induction and restriction for finite general linear groups
- Ordered partitions and coordinate parabolics
- Compositions, partial flags, and standard parabolics
- Standard subgroups of finite general linear groups
- Block Levi decomposition of standard parabolics
- Transitivity and parabolic independence of Harish-Chandra induction
- Maschke's theorem for finite groups over fields whose characteristic does not divide $|G|$
- An $R$-linear action of $G$ on a left $R$-module, and a $G$-module over $R$
- Subgroup
- Normal subgroup: invariance under conjugation
- Left group actions, transitive actions, and faithful actions
- $\operatorname{Sym}(X)$ is a group under composition, and it is non-abelian whenever $X$ has at least three distinct elements
- The symmetric group $\operatorname{Sym}(X)$: the bijections of a set $X$ under composition
- Permutation Weyl group and inversion length
- Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- $\operatorname{GL}_n(F)$ is a group under matrix multiplication, including the trivial group $\operatorname{GL}_0(F)$
Used by
Dependency tree · two levels
61 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 10.2, Lemma 10.3 and Definition 10.5, printed pp. 41-42 (standard reference, not scraped)
- Jay Taylor, Finite Reductive Groups - Definition 5.7, printed p. 43 (standard reference, not scraped)