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.
One-step simple restriction and induction, and the first-dot index
Statement
Let be any field and the graded KLR algebra for a real symmetrizable Cartan datum and any homogeneous satisfying the standing symmetry and nonzero extremal-coefficient conditions. Graded simple modules are compared up to internal shift. For a simple of root weight and , its ordinary one-step last- restriction has a single simple graded socle and a single simple graded head, each once and of the same shift orbit, with ; its maximum- composition part has coefficient a grading shift of . The last-dot nilpotence index on that restriction is exactly . The first-end statements hold with and the first dot. For every , has a unique simple graded head , occurring once in its whole composition series, with (also when ); all other constituents have smaller . One-step simple socle and simple induction head are partial inverses. A simple survives the first-strand cyclotomic quotient with exponents exactly when for all . Right restriction preserves surviving simples, while projected right induction has the same simple head when that generic head survives and is zero otherwise. These are shift-orbit assertions and do not assert factorial socle multiplicity.
Facts & Assumptions
Given: A graded KLR algebra for a real symmetrizable Cartan datum, a color , a graded simple -module , and .
The nil-Hecke algebra of rank acts on the coinvariant algebra by polynomial multiplication and divided differences, with and , every positive symmetric polynomial acts by zero, and is the unique simple up to shift, with composition multiplicity one. After restriction to for (with ), its graded socle and head are one shifted simple each and its composition coefficient is a shift of (Nil-Hecke idempotents and divided-power KLR projectives, Quantum integers, factorials, Gaussian binomials and divided powers at ).
Finite graded modules have the Krull-Schmidt property, finite graded semisimple socles, and finite-dimensional graded simples (Graded Krull-Schmidt and shift-orbit bases for finitely generated KLR modules). Absolute simplicity is the separate conclusion of Maximal KLR tails give a unique induction head and absolute simple modules.
Maximal-tail restriction: for simple with there is a simple with and , and dually has a unique simple graded head occurring once, with maximal tail (Maximal KLR tails give a unique induction head and absolute simple modules).
Block induction is left adjoint to block restriction; restriction is left adjoint to coinduction, which is reversed-block induction with its stated shift. All these functors are exact. The one-step simple-induction adjunction uses the -factor and therefore the last-dot-zero part of block restriction. The shuffle bound is: the maximal -tail of a constituent of is at most the maximal tail of minus one, and an induced module has no tail larger than the sum of the two input tails (Generic KLR induction and restriction adjunctions preserve projectives).
Proof
Nil-Hecke branching. Put and write for the elementary symmetric polynomials in . The relations give for , and the top relation gives ; hence with acting by . The polynomial representation of is free of rank over its symmetric center and identifies with the matrix algebra over that center; after the specialization its image on is with standard column . Therefore the graded socle and head of are each one shifted copy of the nil-Hecke simple, the simple composition coefficient is a shift of , multiplication by has nilpotence index exactly , the socle is the column over and the head the column modulo . For this reads , . The same computation with the first variable distinguished gives first-end branching, and matrix units plus a monic Artin basis make it valid in every characteristic. More generally, induction of is killed by the positive symmetric center: each total elementary symmetric function restricts to a sum of products of the positive elementary functions in the two blocks. Its dimension is by the shuffle basis. The augmentation quotient of is the full matrix algebra with simple column dimension , so this induced module is one shifted copy of .
Simple socle of one-step restriction. Let have and let be a simple subobject with . The final dot commutes with and acts nilpotently on (positive dot degree and finite graded support), preserving the socle and its ungraded isotypic components; on the isotypic component containing a nonzero power of has a nonzero kernel copy of the same simple type killed by , and absolute simplicity and the finite graded semisimple decomposition let that copy be chosen homogeneously with the appropriate shift. Adjunction therefore produces a nonzero map , hence a surjection, and the shuffle bound [F4] gives while the exact defining corners give ; so .
The maximal corner. Apply the maximal -tail corner to , retaining . By [F3], with , so ; by step 1.1 and the absolute simplicity of this has a single simple socle. Every simple subobject of has by step 1.2, so [F3] makes a nonzero simple object; exactness of makes semisimple and injects it into the one-simple socle of . Hence is a single simple object, once, with ; moreover every nonzero submodule of contains a simple graded submodule whose -image is nonzero (detection).
Simple head, detection and the dot index. Finite graded duality is exact, takes simples to simples, fixes corner idempotents and commutes with restriction, so applying step 2.1 to (same ) and dualising gives a single simple head of , once; the maximal corner of its head is the head of , while the maximal corner of its socle is that tensor's socle. By step 1.1 these are shifts of the same . The unique-head recursion of [F3] therefore identifies their simple shift orbits. On , step 1.1 gives and ; the image of on all of is a graded submodule with zero -corner, so detection in step 2.1 forces it to be zero, while nonvanishing of in the corner forces it to be nonzero globally. Hence the last-dot nilpotence index on is exactly ; repeating with the first variable gives first-dot index exactly .
Nonreduced induction and its unique head. Put , . Its maximum tail is at most by the shuffle bound; at tail the Mackey filtration retains exactly all added -strands together with terminal -strands of , its surviving corner is . The final computation of step 1.1 makes this up to the fixed shift. Every simple quotient of has that maximum tail: adjunction gives a nonzero injection , and restricting the first factor to the maximal -tail retains a nonzero corner of 's maximal corner, so , and the shuffle bound gives equality. Hence the finite semisimple head of has only constituents detected by its simple maximal corner, so it is one simple constituent, once; the kernel of has zero maximal corner, so every other composition factor has smaller and the head occurs exactly once in the whole composition series. Write .
Partial inverses, iterates and the cyclotomic criterion. Adjunction realises in , so step 2.1 gives with shifts restored; conversely implies is a simple quotient of , hence . Thus one-step socle and head are partial inverses, raises by one and lowers it by one; iterating the one-strand argument gives . Let be generated by on every word beginning with ; it annihilates a simple exactly when each first- corner has first-dot index at most , which by step 3.1 is , so iff for every ; if a generator is nonzero, simplicity forces . Right restriction preserves first strands, hence the cyclotomic subcategory; for induction, the generic unique head either survives, in which case the quotient induction has the same head, or dies, in which case the quotient induction is zero because every nonzero finite module has a simple quotient. The maximal- composition part is the same simple shift orbit as the head and socle, with coefficient a shift of by step 1.1. No choice and no self-dual representative is used.
Depends on
- The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum
- The KLR grading and the diagrammatic multiplication
- Quantum integers, factorials, Gaussian binomials and divided powers at $q_i$
- Nil-Hecke idempotents and divided-power KLR projectives
- Graded Krull-Schmidt and shift-orbit bases for finitely generated KLR modules
- Maximal KLR tails give a unique induction head and absolute simple modules
- Generic KLR induction and restriction adjunctions preserve projectives
Used by
- Canonical elementary crystal extraction and highest-weight survivors Lemma
- Cyclotomic extension of scalars respects the based quotient Lemma
- Extremal word characters detect normalized cyclotomic simple labels Lemma
- The two-colour jump formula and strict elementary embeddings Lemma
- Simple and indecomposable-projective crystals agree with B(Λ) Theorem
Dependency tree · two levels
24 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
- Aaron D. Lauda and Monica Vazirani, Crystals from categorified quantum groups, Advances in Math. 228 (2011) 803-861, arXiv:0909.1810v2 (standard reference, not scraped)
- Seok-Jin Kang and Masaki Kashiwara, Categorification of Highest Weight Modules via Khovanov-Lauda-Rouquier Algebras, arXiv:1102.4677v4 (standard reference, not scraped)