Canonical Bases in Higher-Level Fock Spaces
- Canonical basis elements are explicit bar-invariant bases that bridge combinatorics, categorification, and modular representation theory.
- The construction employs q-wedge products, abacus models, and straightening rules to index multipartitions and compute q-decomposition matrices.
- Recent advances provide closed formulas, reduction theorems, and categorified interpretations via quiver Schur algebras, enhancing practical computations.
Canonical basis elements in higher-level Fock spaces play a central role in the representation theory of quantum groups, Hecke algebras, and related categorifications. They provide explicit, bar-invariant bases for modules arising from combinatorial and geometric constructions, encode graded decomposition numbers for cyclotomic Schur algebras, and serve as bridges between combinatorics, categorification, and modular representation theory. In higher-level settings, their structure is governed by multipartitions and symbols, straightening relations for q-wedges, and intricate conditions imposed by multicharges. Recent advances enable closed formulas, reduction theorems, and categorified interpretations via quiver Schur algebras.
1. Higher-Level q-Deformed Fock Spaces and Canonical Basis Construction
Given integers and level , together with a multi-charge , the level- q-deformed Fock space is a -vector space with standard basis labelled by multipartitions , each being a partition. This basis may be realized through ordered q-wedge products , subject to straightening rules that depend on (Iijima, 2011, Iijima, 2012). The bijection between q-wedges and multipartitions is mediated via the abacus model and Maya diagrams: the combinatorics of bead configurations encodes module elements and allows explicit indexing by "symbols" representing multipartitions (Jacon et al., 23 Jan 2026).
The action of the quantum group , or , is defined via Chevalley generators and Heisenberg operators, where addition/removal of -residue nodes in the Young diagrams corresponds to raising/lowering operators on . The bar-involution, central to canonical basis theory, sends and reverses wedge order up to explicit powers of , fixing generators (Iijima, 2011, Chuang et al., 2015). The involution admits a unitriangular expansion in the dominance (or Jantzen) order imposed on multipartitions.
2. Definition and Properties of Canonical Basis Elements
Canonical basis elements in higher-level Fock spaces, as constructed by Uglov and Leclerc-Thibon, are characterized as unique bar-invariant elements satisfying
for multipartitions in the dominance order (Iijima, 2011, Iijima, 2012). The transition matrices expressing the canonical basis in terms of the standard basis — the q-decomposition matrices — encode graded decomposition numbers for associated Schur algebras, rational Cherednik algebra category , and Ariki-Koike algebras (Stroppel et al., 2011, Jacon et al., 23 Jan 2026).
The canonical basis can also be indexed combinatorially using symbols, with explicit closed formulas now available under various structural hypotheses. In particular, for standard symbols with multi-charge , there is a monomial expression for and a generalization of the Leclerc-Miyachi formula for arbitrary level: where are spine-permutations and is the Coxeter length (Jacon et al., 23 Jan 2026).
3. Reduction and Comparison Theorems: Lowering Level via Multi-charge Separation
Two pivotal results describe stability of canonical basis elements under changes in level determined by extremal multi-charges (Iijima, 2011):
- Theorem A: If is sufficiently large for (in the sense that and for all ), then the corresponding block of the q-decomposition matrix at level coincides with the one for level with the -th coordinate removed:
- Theorem B: If is sufficiently small for and , then the same identification holds.
These results use abacus combinatorics and wedge straightening rules, and enable inductive or truncation-based computations for canonical bases as the level increases or decreases, thereby explicating “stability” phenomena in decomposition matrices (Iijima, 2011).
4. Closed Formulas, Algorithms, and Inversion Relations
Explicit formulas for canonical basis elements are available in several situations:
- The generalized Leclerc-Miyachi theorem expresses for standard symbols via spine-permutations, producing monomial expansions (Jacon et al., 23 Jan 2026).
- In the asymptotic multi-charge regime where , canonical bases factor as tensor products:
with each a smaller charge symbol (Jacon et al., 23 Jan 2026).
- At level 3, all canonical basis elements are single monomials (Jacon et al., 23 Jan 2026).
For completion Fock spaces with varying sequence , Cao–Lam provide symmetric bilinear forms with canonical and dual canonical bases in perfect duality, as well as explicit inversion formulas for the standard basis in terms of the canonical/dual canonical bases: alongside Brundan’s recursive algorithm for computation and stepwise isomorphisms for arbitrary (Cao et al., 2015).
5. Categorification and Relation to Quiver Schur Algebras
Canonical basis elements in higher-level Fock spaces correspond, under categorification, to indecomposable projective modules in graded cyclotomic and quiver Schur algebras. The graded decomposition numbers coincide with transition coefficients between canonical and standard bases: and under the bar-involution and Serre-twisted duality, they remain fixed, confirming their canonical status (Stroppel et al., 2011).
Categorification yields weak module categorifications for -modules, with the actions of , , represented geometrically (convolution, induction, restriction) and diagrammatically (splits, merges, dots). The decomposition matrices for Ariki-Koike algebras and rational Cherednik category can be recovered from these canonical bases (Stroppel et al., 2011, Iijima, 2012, Jacon et al., 23 Jan 2026).
6. Representation-Theoretic and Combinatorial Applications
The canonical basis in higher-level Fock spaces provides graded decomposition numbers for cyclotomic Hecke and Schur algebras, realizes Calogero-Moser cellular characters in complex reflection group types such as , and encodes branching coefficients under restriction to : with factorization theorems stating that decompositions across components having non-adjacent residues factor as products, vanishing otherwise (Chuang et al., 2015).
Structure theorems such as the column removal theorem enable reduction of complex computations to lower charge cases, simplifying both combinatorial and categorical analyses (Jacon et al., 23 Jan 2026). The product formula (higher-level Leclerc-Thibon theorem) formally parallels the Steinberg tensor product theorem, decomposing canonical basis elements into Schur functor actions on restricted and twisted parts (Iijima, 2012).
7. Examples and Explicit Computations
Worked examples, such as for , , and various choices of multipartitions, demonstrate direct computations of -decomposition numbers: and analogous results under level reduction (Iijima, 2011, Iijima, 2012).
In small ranks, canonical basis elements admit explicit expansions and correspond to projective resolutions:
- For the cyclotomic -Schur algebra at , the expansion directly matches graded decomposition numbers (Stroppel et al., 2011).
- In the general symbol framework, monomial expansions of canonical basis elements are algorithmically computable and encode the block structure and cellular character data for associated representation categories (Jacon et al., 23 Jan 2026).
References:
(Iijima, 2011, Stroppel et al., 2011, Iijima, 2012, Chuang et al., 2015, Cao et al., 2015, Jacon et al., 23 Jan 2026)