Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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 R=⨁βR(β) 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 Ei denote restriction e(β,i)(−) and Fi, Fˉi the right-append and left-append inductions of Induction and restriction bimodules for KLR algebras (so that Fˉi(M)=R(β+αi)e(i,β)⊗R(β)M with e(i,β)=∑ν∈Iβe(i∗ν)). Let ti be an indeterminate of degree (αi∣αi)=2di. Then:

(a) for i≠j there are natural isomorphisms EiFj≅q−(αi∣αj)FjEi and FˉjEi≅EiFˉj;

(b) for i=j there is a natural isomorphism EiFi≅q−(αi∣αi)FiEi⊕(Id⊗kk[ti]), where (Id⊗kk[ti])(M)=M⊗kk[ti] with ti homogeneous of degree 2di;

(c) the opposite-end corner comparison gives a functorial exact sequence in Mod(R(β)) 0⟶FˉiEiM⟶EiFˉiM⟶q−(αi∣β)M⊗kk[ti]⟶0, where ⊗kk[ti] is understood in the graded sense. For n≥1, the underlying uncolored bimodules have the exact sequence 0→R(n)⊗R1(n−1)R1(n)→R(n+1)→R(n)⊗kkI[t]→0, where kI=⨁j∈Ikϵj retains the transferred strand color, and the right R(n) action is through the shift embedding ξn. The quotient grading is the degree of the full transfer word on each labeled corner; its fixed-color i 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 R for a symmetrizable Cartan datum with aii=2, colors i,j, and β∈Q+ with ∣β∣=n; the idempotents e(β,i), e(i,β) and the functors Ei,Fi,Fˉi of Induction and restriction bimodules for KLR algebras.

[F1]

The PBW basis of The PBW (monomial) basis theorem for KLR algebras: for a reduced-expression system, {τwx1a1⋯xnane(ν)} with w∈Sn, ar≥0, ν∈In is a k-basis of Rn(Q), and each R(β) has finite-dimensional homogeneous components. In particular, for each w there is ℓ(w) and τw is a k-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.

[F2]

The native dot moves have τaxa−xa+1τa=e and τaxa+1−xaτa=−e on equal-color corners. With κa:=−τa, the polynomial dot-move identity is κaf−(saf)κa=(∂af)e, where ∂af=(saf−f)/(xa−xa+1); equivalently the native τa identity uses (f−saf)/(xa−xa+1). The far dot moves remain τaxb=xsa(b)τa for b∉{a,a+1}; on unequal-color corners τaxa=xa+1τa, τaxa+1=xaτa and τa2=Qij(xa,xa+1), and hence κa2=Qij(xa,xa+1) 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.

[F3]

The append bimodules R(β+αi)e(β,i) and e(β,i)R(β+αi) are ungraded free, respectively on the right and left, over R(β)⊗kk[ti], of shuffle rank n+1. Their graded decompositions have the labelled shuffle shifts and principal idempotent summands of Generic KLR induction and restriction adjunctions preserve projectives. On forgetting the k[ti] action they remain projective over R(β), with all powers of the extra dot retained; there is no finite shuffle basis over R(β) alone. Thus right-append induction is exact; idempotent restriction is exact, and tensor--Hom evaluation gives Fi⊣Ei (Induction and restriction bimodules for KLR algebras).

Proof

technique · compare PBW bases for the two same-end double cosets and for the opposite-end overlap, then pass to the correct colored corners and tensor only a right-split exact sequence
1.1F1F2algebra

Conventions and PBW coordinates. Put κa=−τa for every color pair, so κw=(−1)ℓ(w)τw has the same degree and is a PBW basis with the source dot and braid signs. For n≥1, embed R(n) on positions 1,…,n and R1(n)=ξnR(n) on positions 2,…,n+1; their overlap is R1(n−1) on positions 2,…,n. Write kI=⨁j∈Ikϵj for the color algebra. Choosing reduced words adapted to the cosets gives the left PBW decomposition R(n+1)=⨁a=1n+1R(n,1)κn⋯κa and the right PBW decomposition R(n+1)=⨁a=1n+1κa⋯κn(kI[xn+1]⊗kR(n)), where the product for a=n+1 is 1. 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 Sn; the resulting products have additive lengths and are precisely the chosen PBW basis.

1.2F2F3algebra

The empty-word case. At β=0 the KLR presentation gives R(0)=k and R(αj)=k[x1]e(j) with deg⁡x1=2dj. The empty word has no last strand, so its Ei-restriction is zero on the weight-graded category, without introducing a negative-height algebra. Both append inductions of a graded k-module M are k[x1]e(j)⊗kM. Orthogonality of e(i),e(j) gives EiFjM=EiFˉjM=0 for i≠j, whereas EiFiM=EiFˉiM≅M⊗kk[ti] by x1a⊗m↦m⊗tia, naturally and in degree zero. Thus (a) is zero-to-zero, (b) has precisely the polynomial summand with coefficient 1, and (c) is 0→0→M⊗kk[ti]→idM⊗kk[ti]→0, since (αi∣0)=0. The uncolored overlap formula involving R1(n−1) below is used only for n≥1.

2.1step 1.1F2algebra

The same-end double cosets. For n≥1 define T:R(n)⊗R(n−1)R(n)→R(n+1) by x⊗y↦xκny, with both outer algebras embedded on the first n positions. It is balanced because κn commutes with the generators on positions 1,…,n−1. Decompose the first factor as the right R(n−1)-module ⨁a=1nκa⋯κn−1(kI[xn]⊗kR(n−1)). For a polynomial/color coefficient f(xn), the dot move gives f(xn)κn=κnf(xn+1)+c, where c lies in the polynomial/idempotent algebra on the first n+1 positions and its last-color projector equals its adjacent-color projector; consequently κa⋯κn−1c y lies in R(n,1). Modulo R(n,1) the image is therefore exactly κa⋯κnf(xn+1)y. These are the right PBW cosets a=1,…,n, bijectively, with coefficient 1, so the induced quotient map is an isomorphism. Inclusion of R(n,1) then gives the actual bimodule isomorphism T⊕incl:R(n)⊗R(n−1)R(n)⊕R(n,1)→R(n+1): 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 a>1.

2.2step 1.1F1F2algebra

The opposite-end overlap map. For n≥1, multiplication defines a balanced (R(n),R1(n))-bimodule map U:R(n)⊗R1(n−1)R1(n)→R(n+1), x⊗y↦xy. The PBW decomposition in the last n positions is R1(n)=⨁a=2n+1(R1(n−1)⊗kkI[xn+1])κn⋯κa. Tensoring this displayed free decomposition identifies the domain of U with ⨁a=2n+1R(n,1)κn⋯κa. Multiplication maps each basis element to the identically named PBW element, so U is injective and its image J is exactly those cosets. Using the opposite PBW decomposition gives also J=⨁a=0n−1κa⋯κ1R(1,n), where a=0 is the empty product. Thus J is the overlap bimodule, not a two-sided ideal, and the quotient has the sole remaining transfer coset R(n,1)κn⋯κ1, equivalently κn⋯κ1R(1,n).

3.1step 2.1F2F3algebra

Correct same-end colored kernels. For an input weight β set δ=β−αi and γ=δ+αj. When δ∈Q+, the kernel of EiFj is e(γ,i)R(β+αj)e(β,j), an (R(γ),R(β))-bimodule. Cutting the isomorphism of step 2.1 by these idempotents gives the image under T of R(γ)e(δ,j)⊗R(δ)e(δ,i)R(β), the kernel of FjEi. The factors project onto the two colors interchanged by κn, so its degree is exactly −bij, and the image is the domain shifted by −bij. If δ∉Q+, Ei has zero restriction on the input weight because no word of weight β ends in i; the transfer summand is zero, without writing any algebra at a negative weight. For i≠j the one-strand-enlarged word then also has no i endpoint, so EiFj is zero. The other summand R(n,1) preserves the last color, so it vanishes exactly for i≠j; for i=j its corner is R(β)⊗kk[ti], with deg⁡ti=2di. Hence the bimodule maps give (a)'s same-end isomorphism and (b), with coefficient 1 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.

3.2step 2.2F2algebra

The quotient and its right splitting. Put w=κn⋯κ1. Move a dot or crossing along w by the local relations. Modulo J these moves give xaw=wxa+1 for 1≤a≤n, xn+1w=wx1, and κaw=wκa+1 for 1≤a<n. 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 a=2,…,n+1 and lies in J. Idempotents simply follow the same cyclic permutation. These generator identities prove af(xn+1)w=wξn(a)f(x1) in the quotient. Taking the coefficient of w therefore identifies the underlying bimodule quotient with R(n)⊗kkI[t], the right R(n) action being through ξn, and both indicated endpoint dots becoming t. The color algebra is retained because the transferred endpoint can have any color. Its right PBW expression w(kI[x1]⊗kR1(n)) provides a right R1(n)-linear section of the quotient map by choosing those same PBW representatives. It need not be a bimodule section. Hence the sequence defined by U and this coefficient map is right-split before any tensoring.

4.1step 3.1step 2.2step 3.2F3algebra

Opposite-end colored kernels and degrees. With δ,γ as in step 3.1 and δ∈Q+, the kernel of EiFˉj is e(γ,i)R(β+αj)e(j,β), with right R(β) action through ξn. Cutting U identifies its overlap submodule with R(γ)e(j,δ)⊗R(δ)e(δ,i)R(β), the kernel of FˉjEi, by the plain multiplication map; this map adds no crossing and has degree zero. The quotient transfer word w takes bottom (j,ν) to top (ν,j), so this quotient corner vanishes for i≠j and gives the unshifted opposite-end isomorphism in (a). For i=j and ν of weight β, we(i,ν) has degree −∑abiνa=−(αi∣β). Thus the quotient corner is q−(αi∣β)R(β)⊗kk[ti], with the label i fixed and deg⁡ti=2di. The right section in step 3.2 respects these color projectors and this degree shift, so the colored sequence is split as right R(β)-modules. Tensoring with any graded M retains its injective first map and exact quotient and gives precisely (c), functorially, with the stated shift. If δ∉Q+ the overlap corner is zero; at β=0 this agrees with step 1.2.

5.1step 1.2step 3.1step 4.1∎

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 n≥1. 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

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