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.

Cyclotomic induction is projective on the right

Statement

Let RΛ be the cyclotomic KLR algebra of The cyclotomic KLR quotient at a dominant integral weight, and let EiΛ,FiΛ be the functors of Cyclotomic KLR induction and restriction functors. For every i∈I and β∈Q+:

(a) the bimodule RΛ(β+αi)e(β,i) is a projective right RΛ(β)-module, and e(β,i)RΛ(β+αi) is a projective left RΛ(β)-module;

(b) consequently EiΛ and FiΛ are exact and send finitely generated graded projectives to finitely generated graded projectives; moreover FiΛ preserves all projectives and EiΛ preserves finitely generated ones;

(c) there is a functorial exact sequence in Mod(R(β+αi)) 0⟶q(αi∣2Λ−β)FˉiM⟶FiM⟶FiΛM⟶0,M∈Mod(RΛ(β)), where Fi is the right-append and Fˉi the left-append generic induction of Generic KLR induction and restriction: mixed relations and the opposite-end exact sequence, regarded on RΛ-modules through the quotient, and the exponent is the Cartan pairing (αi∣2Λ−β)=2(αi∣Λ)−(αi∣β) (Quantum integers, factorials, Gaussian binomials and divided powers at qi records the normalization of the powers of q).

Facts & Assumptions

Given: The cyclotomic quotient RΛ of The cyclotomic KLR quotient at a dominant integral weight; put S=R(β+αi), A=RΛ(β), eR=e(β,i), eL=e(i,β).

[F1]

SeR is a free right R(β)-module and eLS a free left R(β)-module by the PBW/coset decomposition (The PBW (monomial) basis theorem for KLR algebras, Induction and restriction bimodules for KLR algebras); the generic functors Fi,Fˉi,Ei and their definitions and exactness are Generic KLR induction and restriction: mixed relations and the opposite-end exact sequence.

[F2]

The cyclotomic ideal is the two-sided ideal generated by aν1(x1)e(ν); in the standard graded case it is homogeneous and the quotient is graded. Multiplication by any dot xa on RΛ(β) is killed by a monic polynomial with scalar coefficients (Cyclotomic dot annihilators, finite-dimensional blocks, and finite root strings).

[F3]

A finite projective module is a direct summand of a finite free module. For a central monic polynomial f∈Z(A)[t] of degree m, polynomial division gives an A-linear decomposition A[t]=fA[t]⊕A[t]<m, with A[t]<m≅Am. The resolution splitting needed below is proved explicitly in step 1.2.

[F4]

The polynomial realization of Faithful polynomial representation of a KLR algebra is faithful, and its localized crossing words expand into independent permutation operators over the rational function field.

Proof

technique · compare the cyclotomic towers over the generic ones with an explicit monic comparison map, then use the monic-annihilator projective splitting to deduce projectivity, exactness and the exact sequence with its shift

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.1F1F2algebra

Comparison modules and their projectivity. Put n=∣β∣ and let R1(β)=ξnR(β) act on positions 2,…,n+1. For n>0 set J0=Sa(x1)R(β)eR and J1=Sa(x2)R1(β)eL; for n=0 set J0=J1=0, since the old block has no cyclotomic relation. Put K0=SeR/J0, K1=SeL/J1. The right action of A[t] on K0 uses the first n strands and t=xn+1; on K1 it uses ξn and t=x1. The labelled PBW cosets make SeR and SeL finite projective over the corresponding separated-block algebras R(β)[t]: each homogeneous coset summand is a shifted principal word-idempotent module. Tensoring these summands with A[t] gives precisely K0,K1, so both are finite projective over A[t]. At n=0 both are k[t].

1.2F3algebra

Monic annihilators and projectivity, locally. Let 0→P1→jP0→M→0 be an exact sequence of right A[t]-modules with finite projective P0,P1, and suppose a central monic f annihilates M. Multiplication by f is injective on a free A[t]-module by its unit leading coefficient, hence on its projective summands. On a finite free module monic division gives an A-linear operator pfree taking a polynomial to its quotient by f, with pfree(xf)=x. Choose split inclusion u:P1→A[t]N and projection v:A[t]N→P1; then p=vpfreeu satisfies p(xf)=x on P1, since u is A[t]-linear and vu=1. Since fM=0, multiplication by f on P0 has image in j(P1), defining h:P0→P1 by jh=f. Injectivity of j gives hj=f on P1, so phj=1. Thus j has the A-linear retraction ph, and M is a direct summand of the A-projective module P0 and is A-projective. Equivalently, Pr/fPr is a summand of (A[t]/fA[t])N≅AmN and is A-projective, which is the monic-quotient reason for the splitting. This argument uses finite projective presentations and division and does not assume f invertible or the target M projective.

2.1step 1.1F1algebra

The cyclotomic ideal and the map P. Throughout put κa=−τa. The first-position PBW cosets give S=∑r=0n(kI[x1]⊗R1(n))κ1⋯κr. Since a(x1) commutes with this coefficient algebra, Sa(x1)S=∑r=0nSa(x1)κ1⋯κr. After multiplying by eR, terms r<n lie in J0; the remaining term is the image of P~:SeL→K0, u↦ua(x1)κ1⋯κn. Thus its image is the kernel of K0→BeR, where B=RΛ(β+αi). To check right linearity, move xa+1 through a(x1)κ1⋯κn to xa and move x1 to xn+1. Each mixed-relation correction omits one transfer crossing and has the form, up to its color projector and sign, (κa+1⋯κn)a(x1)κ1⋯κa−1, hence belongs to J0. Moving κa+1 to κa introduces only the braid correction a(x1)κ1⋯κa−1Daκa+2⋯κn, with Da a dot polynomial; the far crossings can be moved left and the last-dot powers commute with the shorter word, again putting it in J0. Idempotents follow the cyclic transfer. These generator identities prove P~ is right R(β)[t]-linear. It therefore kills J1, and induces an (S,A[t])-map P:K1→K0 with the same image.

3.1step 2.1F1F4algebra

Intertwiners and the map Q. Define ga=κa on unequal adjacent colors and ga=(xa+1−xa)−(xa+1−xa)2κa on equal colors. The source mixed relations give xsa(b)ga=gaxb for every b. They also give κaga+1ga=ga+1gaκa+1: subtract the two sides and use the mixed relations to see that the difference intertwines xa with xa+2 and fixes xa+1. In the faithful localized polynomial realization [F4], its longest-permutation coefficients cancel, since both products cross the same three color pairs with the same factors. All remaining permutations have length at most two, and none interchanges a and a+2 while fixing the middle variable. Independence of the permutation operators then forces every coefficient to vanish. Consequently right multiplication by gn⋯g1 intertwines old dots/crossings with their shifted copies and xn+1 with x1. It descends to Q:K0→K1: the first-position cosets write J0 as the sum of the terms Sa(x1)κ1⋯κreR, r<n, and the intertwining identities send each such term to Sgn⋯g1a(x2)κ2⋯κr+1eL⊆J1. Thus Q is an (S,A[t])-map; at n=0 it is the identity.

4.1step 2.1step 3.1F1F2inductionalgebra

The comparison polynomial, including repeated colors. For a prefix ν=(ν1,…,νn) set Cν=ai(x1)∏a:νa≠iQiνa(x1,xa+1). We prove a(x1)κ1⋯κngn⋯g1e(i,ν)≡Cνe(i,ν)(modJ1) by induction on n. At n=0 it is multiplication by ai(t); at n=1 unequal colors use the quadratic relation. For equal colors, κ1g1=κ1(x2−x1), and κ1(x2−x1)−1 interchanges x1,x2; hence ai(x1)κ1g1≡ai(x1) modulo Sai(x2). For n>1, if νn≠i, the quadratic relation and the dot-intertwining identities peel off Qiνn(x1,xn+1), leaving the shorter comparison. If νn=i and νn−1=j≠i, the braid correction splits the comparison into two terms whose reductions, for ν′′=(ν1,…,νn−2), are Cν′′Qji(xn,xn+1) and −Cν′′(Qij(xn+1,xn)−Qij(x1,xn)). Their sum is Cν′′Qij(x1,xn)=Cν by Q symmetry. If the last two colors are i, expansion of gn−1, the ordinary equal-color braid, and the shorter comparison reduce the expression to Cν′[(xn+1−x1)κn−κn(xn+1−x1)κn(xn−x1)], where ν′=ν′′i. Here Cν′ commutes with κn, κn(xn+1−x1)κn=κn and κn(xn−x1)=(xn+1−x1)κn−1, so the bracket is 1 and Cν′=Cν. All congruences remain valid under dot multiplication because the shifted cyclotomic ideal defining J1 is a right dot submodule. These cases exhaust the induction and establish QP=C(t), with C(t)=∑ν∈Iβai(t)∏a:νa≠iQiνa(t,xa)e(ν)∈A[t].

5.1step 1.1step 2.1step 4.1F1algebra

Injectivity and the exact resolution. The degree of C(t) in t is λi+∑j≠i(−aij)βj, and its leading coefficient is the nonzero scalar ∏j≠itijβj, independent of ν. Its coefficients are central in A: unequal crossings merely permute the color-labelled factors, and on equal adjacent colors the factor product is symmetric, so its divided-difference correction vanishes. Normalize the leading coefficient to 1. Multiplication by this central monic polynomial is injective on a free A[t]-module by its leading term, and hence on a projective summand. Step 4.1 therefore makes QP, and consequently P, injective. With step 2.1 this proves 0→qsK1→PK0→BeR→0. In the standard homogeneous case deg⁡P=2diλi−∑abiνa=(αi∣2Λ−β)=s, so this is a graded resolution; the monic branch is ungraded.

6.1F1F2step 1.2step 5.1

Projectivity of the cyclotomic bimodules. The appended dot on M=BeR is annihilated by a central monic scalar-coefficient polynomial by [F2]. Apply step 1.2 to the projective A[t]-resolution in step 5.1, with M=BeR, to conclude that BeR is right A-projective. This module is finitely generated over A: its finite A[t]-generators together with dot powers below the degree of the annihilator generate it over A. In the homogeneous standard case the resolution and M are graded; decompose the resulting A-linear splitting into homogeneous components on finite homogeneous generators, and take its degree-zero component to get a graded splitting. The generator-fixing anti-involution sends BeR to eRB and converts this right projectivity into left A-projectivity. The same monic argument is valid for arbitrary ungraded monic cyclotomic deformations.

7.1step 6.1algebra

Exactness and preservation. Tensoring by the right A-projective module BeR is exact, so FiΛ is exact, and idempotent restriction EiΛ is exact. The left B-module BeR is a direct summand of B, hence induction sends any projective A-module, presented as a summand of a free module, to a projective B-module; finite generators remain finite under induction. A finitely generated projective B-module is a summand of a finite direct sum of shifts of B, and its restriction is consequently a summand of the corresponding finite direct sum of shifts of eRB. Left A-projectivity and finite generation of eRB from step 6.1 therefore show that restriction preserves finitely generated projectives. These arguments apply ungraded to monic deformations as well.

7.2F1step 1.1step 5.1step 6.1

The exact sequence (c). Tensor the bimodule resolution 0→qsK1→PK0→BeR→0 of step 5.1 over A with a left A-module M. It remains exact because its cokernel BeR is right A-projective by step 6.1, so the original sequence is split as a sequence of right A-modules. By their definitions in step 1.1, K1⊗AM is the left-append generic induction FˉiM and K0⊗AM is the right-append generic induction FiM, while BeR⊗AM=FiΛM. The map P is left R(β+αi)-linear and has homogeneous degree s=(αi∣2Λ−β), giving exactly the functorial sequence in (c) in the declared target category. On the ungraded monic-deformation branch the same sequence is interpreted without a grading shift.

8.1step 6.1step 7.2∎

Conclusion. The projectivity, preservation and exact-sequence arguments prove (a), (b) and (c) with the displayed shift, in the graded standard case with graded projectives and verbatim ungraded for a monic deformation; the comparison is monic and no filtered-colon citation 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