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.
Generic KLR induction and restriction: mixed relations and the opposite-end exact sequence
Statement
Let be a KLR algebra on a symmetrizable Cartan datum with no imaginary simple roots (The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum) and let denote restriction and , the right-append and left-append inductions of Induction and restriction bimodules for KLR algebras (so that with ). Let be an indeterminate of degree . Then:
(a) for there are natural isomorphisms and ;
(b) for there is a natural isomorphism , where with homogeneous of degree ;
(c) the opposite-end corner comparison gives a functorial exact sequence in where is understood in the graded sense. For , the underlying uncolored bimodules have the exact sequence , where retains the transferred strand color, and the right action is through the shift embedding . The quotient grading is the degree of the full transfer word on each labeled corner; its fixed-color corner is the shifted polynomial term of (c). All shifts are computed in the fixed grading of The KLR grading and the diagrammatic multiplication; the functors are exact (Generic KLR induction and restriction adjunctions preserve projectives).
Facts & Assumptions
Given: A KLR algebra for a symmetrizable Cartan datum with , colors , and with ; the idempotents , and the functors of Induction and restriction bimodules for KLR algebras.
The PBW basis of The PBW (monomial) basis theorem for KLR algebras: for a reduced-expression system, with , , is a -basis of , and each has finite-dimensional homogeneous components. In particular, for each there is and is a -linear combination of products of crossings; the elementary relations of (Q1)-(Q4) and the braid relations let every product of crossings be rewritten in this form.
The native dot moves have and on equal-color corners. With , the polynomial dot-move identity is , where ; equivalently the native identity uses . The far dot moves remain for ; on unequal-color corners , and , and hence also. These are relations (4)-(7) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum and the grading conventions of The KLR grading and the diagrammatic multiplication.
The append bimodules and are ungraded free, respectively on the right and left, over , of shuffle rank . Their graded decompositions have the labelled shuffle shifts and principal idempotent summands of Generic KLR induction and restriction adjunctions preserve projectives. On forgetting the action they remain projective over , with all powers of the extra dot retained; there is no finite shuffle basis over alone. Thus right-append induction is exact; idempotent restriction is exact, and tensor--Hom evaluation gives (Induction and restriction bimodules for KLR algebras).
Proof
Conventions and PBW coordinates. Put for every color pair, so has the same degree and is a PBW basis with the source dot and braid signs. For , embed on positions and on positions ; their overlap is on positions . Write for the color algebra. Choosing reduced words adapted to the cosets gives the left PBW decomposition and the right PBW decomposition , where the product for is . These are labelled decompositions: polynomial and idempotent coefficients keep the transferred color, and crossing degrees are summed on the actual word. PBW independence follows by using those reduced coset words followed by a reduced word in ; the resulting products have additive lengths and are precisely the chosen PBW basis.
The empty-word case. At the KLR presentation gives and with . The empty word has no last strand, so its -restriction is zero on the weight-graded category, without introducing a negative-height algebra. Both append inductions of a graded -module are . Orthogonality of gives for , whereas by , naturally and in degree zero. Thus (a) is zero-to-zero, (b) has precisely the polynomial summand with coefficient , and (c) is , since . The uncolored overlap formula involving below is used only for .
The same-end double cosets. For define by , with both outer algebras embedded on the first positions. It is balanced because commutes with the generators on positions . Decompose the first factor as the right -module . For a polynomial/color coefficient , the dot move gives , where lies in the polynomial/idempotent algebra on the first positions and its last-color projector equals its adjacent-color projector; consequently lies in . Modulo the image is therefore exactly . These are the right PBW cosets , bijectively, with coefficient , so the induced quotient map is an isomorphism. Inclusion of then gives the actual bimodule isomorphism : injectivity and surjectivity follow by first passing to the quotient and then to the included summand. This retains all nonidentity cosets, rather than discarding cosets .
The opposite-end overlap map. For , multiplication defines a balanced -bimodule map , . The PBW decomposition in the last positions is . Tensoring this displayed free decomposition identifies the domain of with . Multiplication maps each basis element to the identically named PBW element, so is injective and its image is exactly those cosets. Using the opposite PBW decomposition gives also , where is the empty product. Thus is the overlap bimodule, not a two-sided ideal, and the quotient has the sole remaining transfer coset , equivalently .
Correct same-end colored kernels. For an input weight set and . When , the kernel of is , an -bimodule. Cutting the isomorphism of step 2.1 by these idempotents gives the image under of , the kernel of . The factors project onto the two colors interchanged by , so its degree is exactly , and the image is the domain shifted by . If , has zero restriction on the input weight because no word of weight ends in ; the transfer summand is zero, without writing any algebra at a negative weight. For the one-strand-enlarged word then also has no endpoint, so is zero. The other summand preserves the last color, so it vanishes exactly for ; for its corner is , with . Hence the bimodule maps give (a)'s same-end isomorphism and (b), with coefficient on the polynomial summand. Tensoring an actual bimodule isomorphism with any graded input module preserves it; no exactness or flatness assumption is needed for this passage.
The quotient and its right splitting. Put . Move a dot or crossing along by the local relations. Modulo these moves give for , , and for . Dot corrections remove one crossing and braid corrections remove the three-crossing braid block; in each case the surviving permutation fails to transfer the first endpoint all the way to the last endpoint, so its PBW coset is among and lies in . Idempotents simply follow the same cyclic permutation. These generator identities prove in the quotient. Taking the coefficient of therefore identifies the underlying bimodule quotient with , the right action being through , and both indicated endpoint dots becoming . The color algebra is retained because the transferred endpoint can have any color. Its right PBW expression provides a right -linear section of the quotient map by choosing those same PBW representatives. It need not be a bimodule section. Hence the sequence defined by and this coefficient map is right-split before any tensoring.
Opposite-end colored kernels and degrees. With as in step 3.1 and , the kernel of is , with right action through . Cutting identifies its overlap submodule with , the kernel of , by the plain multiplication map; this map adds no crossing and has degree zero. The quotient transfer word takes bottom to top , so this quotient corner vanishes for and gives the unshifted opposite-end isomorphism in (a). For and of weight , has degree . Thus the quotient corner is , with the label fixed and . The right section in step 3.2 respects these color projectors and this degree shift, so the colored sequence is split as right -modules. Tensoring with any graded retains its injective first map and exact quotient and gives precisely (c), functorially, with the stated shift. If the overlap corner is zero; at this agrees with step 1.2.
Conclusion. Steps 1.2 and 3.1 establish the same-end mixed isomorphisms, and step 4.1 establishes the opposite-end isomorphism and exact sequence for every weight. All maps are the explicit homogeneous PBW corner maps above; the opposite-end sequence is right-split before tensoring, and the uncolored expression retains its transferred-color labels and uses . The dots, crossing signs and shifts are those of the fixed native grading, with the source normalization affecting only unit PBW coefficients. No quotient flatness, uniform shift for all labelled cosets, or negative-height algebra is assumed.
Depends on
- The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum
- The KLR grading and the diagrammatic multiplication
- Induction and restriction bimodules for KLR algebras
- Nil-Hecke idempotents and divided-power KLR projectives
- The PBW (monomial) basis theorem for KLR algebras
- Generic KLR induction and restriction adjunctions preserve projectives
Used by
Dependency tree · two levels
20 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
- Seok-Jin Kang and Masaki Kashiwara, Categorification of Highest Weight Modules via Khovanov-Lauda-Rouquier Algebras, arXiv:1102.4677v4 (standard reference, not scraped)
- Mikhail Khovanov and Aaron D. Lauda, A diagrammatic approach to categorification of quantum groups I, Representation Theory 13 (2009) 309-347, arXiv:0803.4121v2 (standard reference, not scraped)