Alphabeta Math
TheoremStatement: 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.

The categorical sl2 commutator for cyclotomic KLR functors

Statement

Let RΛ be the cyclotomic KLR algebra of The cyclotomic KLR quotient at a dominant integral weight, let EiΛ,FiΛ be the functors of Cyclotomic KLR induction and restriction functors, and read the composites EiΛFiΛ and FiΛEiΛ as endofunctors of Mod(RΛ(β)) via the weight bookkeeping fixed there. Put λ:=Λ−β and qi:=qdi (Quantum integers, factorials, Gaussian binomials and divided powers at qi).

(a) If ⟨hi,λ⟩≥0, there is a natural isomorphism of endofunctors of Mod(RΛ(β)) qi−2FiΛEiΛ⊕⨁k=0⟨hi,λ⟩−1qi2kId  ≅  EiΛFiΛ.

(b) If ⟨hi,λ⟩≤0, there is a natural isomorphism of endofunctors of Mod(RΛ(β)) qi−2FiΛEiΛ  ≅  EiΛFiΛ⊕⨁k=0−⟨hi,λ⟩−1qi−2k−2Id.

Applied to the object RΛ(β) the same computation gives an isomorphism of graded RΛ(β)-bimodules obtained from FiΛEiΛRΛ(β) and EiΛFiΛRΛ(β) by the displayed summands (Associative graded algebras, bimodules, and internal shifts for the shift conventions).

Facts & Assumptions

Given: The cyclotomic quotient RΛ, a fixed β, the functors EiΛ,FiΛ and the generic functors Ei,Fi,Fˉi of Generic KLR induction and restriction: mixed relations and the opposite-end exact sequence; put A=RΛ(β), h=⟨hi,Λ−β⟩, p:=βi and di the symmetrizer entry.

[F1]

The projective comparison of Cyclotomic induction is projective on the right: 0→qsK1→PK0→Be→0 with s=(αi∣2Λ−β) and finite right A[t]-projective K0,K1, with t=xn+1 on K0 and t=x1 on K1, and the generic same-end/opposite-end corner maps of Generic KLR induction and restriction: mixed relations and the opposite-end exact sequence are injective with the stated polynomial cokernels; the opposite-end sequence is split as right modules.

[F2]

The dot annihilators of Cyclotomic dot annihilators, finite-dimensional blocks, and finite root strings: every dot has a monic scalar-coefficient annihilator in each fixed block, so every relevant polynomial in the appended dots is subject to monic division.

[F3]

The weights: h=⟨hi,Λ−β⟩ and qi=qdi; shifts are internal shifts of Associative graded algebras, bimodules, and internal shifts with (M{r})m=Mm−r (Quantum integers, factorials, Gaussian binomials and divided powers at qi).

Proof

technique · compute the snake map of the exact comparison square by monic division, split its cokernel or kernel by the dotted unit columns, and read the two graded isomorphisms off the snake sequence

If A=0, the comparison modules and functor values are zero, so all assertions are vacuous; polynomial degrees below are used only for A≠0.

1.1F1F3constructalgebra

The comparison square. Write n=∣β∣, s=(αi∣2Λ−β), κ=−τ, and use K0,K1,P,Q from the proved comparison in [F1]. Put C0=e(β,i)K0 and C1=e(β,i)K1. If δ=β−αi∈Q+ put D0=R(β)e(δ,i)⊗R(δ)e(δ,i)A and D1=R(β)e(i,δ)⊗R(δ)e(δ,i)A; otherwise both are zero. Restricting the comparison at β and applying the comparison at δ to EiA give exact rows 0→qsD1→P′qi−2D0→qi−2FiΛEiΛA→0 and 0→qsC1→PC0→EiΛFiΛA→0. The vertical maps are U:D1→C1, x⊗y↦xξn(y), and T:D0→C0, x⊗y↦xκny, with the indicated shifts. Here P′ multiplies the first factor by a(x1)κ1⋯κn−1; right bilinearity of P gives PU=TP′ on elementary tensors, both represented by xa(x1)κ1⋯κny. The generic PBW maps of [F1] make U,T injective, with cokernels q−(αi∣β)A[t] and A[t] respectively, retaining the transferred color i. The induced coefficient map A:qi2hA[t]→A[t] is therefore defined by AB=CP, where B takes the full-transfer coefficient in C1 and C projects C0=T(D0)⊕A[t] onto its polynomial summand. The square consists of (R(β),A)-bimodule maps; its coefficient map and snake sequence are A-bimodule maps. Only B,P commute with their endpoint-dot actions, and no A[t]-linearity of A is asserted. The snake lemma gives 0→ker⁡A→qi−2FiΛEiΛA→EiΛFiΛA→coker⁡A→0.

2.1F1F2step 1.1algebra

The two comparison products. The projectivity proof gives QP as right multiplication on K1 by ai(t)∏νa≠iQiνa(t,xa) on each old word ν. Call this central polynomial Z(t). The same element acts on K0 with t=xn+1, and P intertwines the actions. Thus (PQ−Z)P=0, so PQ−Z factors through Be. That quotient is killed by a scalar monic polynomial by [F2], whereas K0 is projective over A[t] and has no such polynomial torsion. Consequently PQ=Z on K0 as well. For p=βi, set S(t)=∑ν∏νa=i(t−xa)2e(ν) and choose γ∈k× so γ−1=(−1)p∏j≠itijβj, where tij is the leading u−aij coefficient of Qij. Then W(t)=γ(−1)pai(t)∑ν∏νa≠iQiνa(t,xa)e(ν) is central monic of degree h+2p, and S is central monic of degree 2p. In Q the leading full-transfer coefficient is (−1)pS(t): each equal-color g contributes −(t−xa)2κa and each unequal-color g contributes κa; every omitted crossing has a shorter permutation and no full-transfer coset. Applying AB=CP to Q(tk) and using PQ=Z proves A(tkS)=γ−1tkW for every k≥0.

3.1step 1.1step 2.1F3algebra

The coefficient recurrence and division. Let uk=e(β,i)κn⋯κ1x1ke(i,β)∈C1. It satisfies B(uk)=tk. In the same-end direct sum write P(uk)=T(ψk)+ϕk, with ψk∈D0 and ϕk=A(tk)∈A[t]. Since P(uk+1)=P(uk)xn+1 and T(z)xn+1=T(z(xn⊗1))+E(z), where E(x⊗y)=xy∈A, comparison of the summands gives ψk+1=ψk(xn⊗1) and ϕk+1=tϕk+E(ψk). These identities use the source κ mixed relation and the actual multiplication counit. In particular A(at)−A(a)t∈A for all a∈A[t]. Induction on the degree of f, using A(atg)−A(a)tg=[A(atg)−A(at)g]+[A(at)−A(a)t]g, gives deg⁡t(A(af)−A(a)f)<deg⁡tf. With f=S and step 2.1, this says tkW=(γϕk)S+rk, deg⁡trk<2p. Thus γϕk is exactly the monic-division quotient, zero when h+k<0 and monic of degree h+k otherwise.

4.1step 1.1step 3.1F3algebra

The positive branch. If h≥0, the values γϕk have distinct unit leading degrees h+k. Finite triangular elimination over A makes A injective and identifies its cokernel with ⨁k=0h−1Atk. The inclusion of these polynomial classes in C0, followed by C0→EiΛFiΛA, is a bimodule section of the last snake map. It is the ordinary adjunction unit followed by k endpoint dots, of degree 2dik. Hence EiΛFiΛA≅qi−2FiΛEiΛA⊕⨁k=0h−1A{2dik}. At h=0 the sum is empty.

5.1step 1.1step 3.1step 4.1F3algebra

The negative branch. If h=−r≤0, division makes A surjective with kernel qi−2r⨁j=0r−1Atj. Its snake inclusion sends tj to the image of ψj in qi−2FiΛEiΛA. The multiplication counit and its dotted versions descend from D0 to this quotient. On the included kernel, their coefficient matrix is E(ψj+k) for 0≤j,k<r. Step 3.1 gives E(ψm)=0 for m<r−1 and E(ψr−1)=γ−1, since ϕm=0 for m<r and ϕr=γ−1. Reversing column order therefore makes this matrix triangular with invertible scalar diagonal. Its finite recursive inverse, consisting of bimodule maps, supplies a retraction of the snake inclusion and splits the sequence. The dotted counit at index k has target shift −2di(k+1) after the qi−2 shift on D0, so qi−2FiΛEiΛA≅EiΛFiΛA⊕⨁k=0r−1A{−2di(k+1)}. At r=0 this agrees with step 4.1. At the vacuum the direct calculation is EiΛFiΛk=k[t]/tλi and FiΛEiΛk=0; it gives the positive branch without any negative-height algebra.

6.1F1step 4.1step 5.1algebra∎

Unequal-color descent and functoriality. For i≠j let Sn=R(n+1), L=R(n) on the first n positions, L[t]=R(n,1), w=κ1⋯κn and w′=κn⋯κ1. Expanding the first-strand cyclotomic ideal by the right cosets and then the left cosets of [F1] gives Sna(x1)Sn=Sna(x1)L+La(x1)Sn+L[t]w′a(x1)wL[t]: all partial transfer words lie in the first two summands, and only the full transfer remains. In its (i,j) last-color corner the last summand is zero, because w′ transfers its top color to the first position and w transfers its bottom color there, giving e(i,n)a(x1)e(j,n)=0. Thus the corner ideal is exactly the sum of the source and target induced cyclotomic ideals. Quotienting the generic same-end corner isomorphism gives EiΛFjΛ≅q−bijFjΛEiΛ. For equal colors, tensor the split bimodule isomorphisms of steps 4.1 and 5.1 with any graded A-module: split bimodule maps remain inverse under tensoring. They give precisely (a) and (b), naturally, with the stated bimodule form on A. No flatness of a quotient or separability assumption is used.

Depends on

Used by

Dependency tree · two levels

22 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