Alphabeta Math
Pipeline-generated
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.

✓ 28 results · all verified · 10 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 18 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Cyclotomic KLR Algebras and Highest-Weight Categorification

1 · Prerequisites

2 · Summary

Objective. This page builds the cyclotomic quotient of a quiver Hecke (KLR) algebra at a dominant integral weight and proves the highest-weight categorification statements attached to it. The first-strand relation aν1(x1)e(ν)=0 of The cyclotomic KLR quotient at a dominant integral weight is fixed once and for all, with right-append induction as in Cyclotomic KLR induction and restriction functors; the entire page is written in that side convention, and the word-mirror involution The word-mirror involution of a KLR algebra and the quantum star records the dictionary with the opposite one. On that foundation the page proves the mixed relations and the projectivity/exactness of the descended functors (Generic KLR induction and restriction: mixed relations and the opposite-end exact sequence, Cyclotomic induction is projective on the right), the categorical sl2 commutator with its explicit shifts (The categorical sl2 commutator for cyclotomic KLR functors), the finite-dimensional graded symmetric structure with its trace degree (Cyclotomic KLR blocks are finite-dimensional graded symmetric algebras), the normalized integrable quantum action on both Grothendieck groups (Normalized cyclotomic functors give an integrable quantum action, Cyclotomic KLR functors define an integrable quantum action on K0 and G0), the identification of projective K0 with the integral highest-weight module and of G0 with its restricted dual (The cyclotomic projective K0 is the integral highest-weight module, The cyclotomic module G0 is the restricted dual integral highest-weight module), and the crystal identification B(Λ) for the normalized simple and projective-cover graphs (Simple and indecomposable-projective crystals agree with B(Λ)).

Proof-tool layer. Two formal proof tools are carried locally rather than imported as axioms: the minimal-parabolic diagram proof category The minimal-parabolic KLR diagram proof category with its graded polynomial flag model (The minimal-parabolic polynomial flag model realizes the graded diagram relations), PBW/bubble normal form (PBW and bubble normal form in the minimal-parabolic diagram category) and cap-off identification (The cyclotomic cap-off quotient has no extra downward relations); and the word-mirror involution above. The formal Hi is normalized projective restriction with its input-weight shift, distinct from the basic restriction Eibasic, and every statement records which of the two is meant.

Conditional global-basis layer. The three items Cyclotomic extension of scalars respects the based quotient, Self-dual indecomposable cyclotomic projectives give the lower global basis and Self-dual simple cyclotomic modules give the upper global basis are conditional on the generic geometric global theorem of the parent KLR page and are kept separate from the unconditional cyclotomic results; their statements record the normalizations, the πΛ∘∗ side convention and the surviving-cover non-merging, and they are not used to prove anything else on this page.

Scope and dependence. The page depends on the divided-power integral forms of balanced-triples-and-global-crystal-bases for the lower and upper global bases, on klr-algebras-induction-and-quantum-serre-categorification for the generic KLR algebra, induction bimodules, PBW and negative-half categorification, on grothendieck-groups-and-graded-cartan-pairings for the graded Grothendieck and Cartan-pairing conventions, and on quantum-affine-type-a-and-level-one-fock-space for the affine/level-one context in which the general parameters are used. The Axiom of Choice is inherited through the declared quantum and generic suppliers of the integral projective identification, restricted-dual identification, crystal comparison and conditional global-basis layer. The finite cyclotomic polynomial, quotient and rank-one computations introduce no further choice.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

The cyclotomic KLR quotient at a dominant integral weight

Definition

Fix a symmetrizable Cartan datum with finite color set I and no imaginary simple roots, a KLR datum Q=(Qij)i≠j satisfying (Q1)-(Q4), and a field k placed in degree zero (The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, Symmetrizable Cartan data for quantum groups); let R=⨁β∈Q+R(β) be the resulting graded KLR algebra, with its idempotents e(ν), dots xa, crossings τa and degrees deg⁡xa=2dνa, deg⁡τa=−bνaνa+1 (The KLR grading and the diagrammatic multiplication). Let Λ be a dominant integral weight and put λi:=⟨hi,Λ⟩≥0 (Kac moody integral and dominant integral weights).

Cyclotomic data. For every color i choose a monic polynomial ai(u)∈k[u] of degree exactly λi (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution); the standard choice made below is ai(u)=uλi. For n≥1 write a(xs)=∑ν∈Inaνs(xs)e(ν)(1≤s≤n), the element of Rn(Q) that acts on the ν-component by the monic polynomial aνs in the dot at position s.

The cyclotomic quotient. For β∈Q+ define Ja(β) to be the two-sided ideal of R(β) generated by the first-strand elements aν1(x1)e(ν), ν∈Iβ; equivalently Ja(β)=∑ν∈IβR(β) aν1(x1)e(ν) R(β), and put RaΛ(β):=R(β)/Ja(β),RaΛ(0):=k. The cyclotomic KLR algebra is the direct sum RaΛ:=⨁β∈Q+RaΛ(β); it carries the local units e(β)=∑ν∈Iβe(ν), which act as the identity on RaΛ(β) and annihilate the other summands, and it is a k-algebra with these orthogonal idempotents.

Standard choice and grading. The STANDARD choice ai(u)=uλi is used throughout the graded categorification, duality-normalization and based statements below; for it we write RΛ:=RaΛ. Under the standard choice each individual first-strand generator x1λν1e(ν) is homogeneous of degree 2dν1λν1 in the grading of The KLR grading and the diagrammatic multiplication, so the ideal Ja(β) and the quotient RΛ(β) are graded, and RΛ is a Z-graded algebra with local units. The sum a(x1) itself need not have one common degree across different colors, and no single degree is assigned to it.

Boundary of the definition. Arbitrary monic polynomials with lower coefficients in degree-zero k give an UNGRADED deformation RaΛ; nilpotent dots, homogeneous trace degree and the highest-weight graded K0 identification are not asserted for that branch, and the ungraded branch is used only where a statement explicitly says so. Finite dimension, finite root strings, ordinary projectivity and symmetry of the standard quotient have the separately stated monic conclusions below. The cyclotomic relation is imposed on the FIRST strand, and cyclotomic induction appends strands on the RIGHT (Cyclotomic KLR induction and restriction functors); this convention fixes the side on which the quotient map acts throughout the page.

This definition uses no choice.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

The minimal-parabolic KLR diagram proof category

Definition

Fix a symmetrizable Cartan datum with real simple roots (so aii=2 for every color i), a field k placed in degree zero, and weighted-homogeneous KLR polynomials Qjk satisfying (Q1)-(Q4) as in The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum; write bjk=djajk=bkj. Fix a color i. The minimal-parabolic KLR diagram proof category Pi is the additive graded k-linear 2-category of weighted oriented diagrams described by the generators, objects and equations below.

Generators and composition. The objects are the weights μ∈P. The generating 1-morphisms are the downward generators Gj:μ→μ−αj, one for every color j, and the single upward generator Hi:μ→μ+αi. Horizontal composition reads chronological negative words from the vacuum outward. Take additive sums of objects and grading shifts, and use idempotent completion when speaking of word projectives. The generator Hi denotes normalized projective restriction: in the polynomial flag realization at input weight h=⟨hi,μ⟩ it is basic reversed flag restriction shifted by −di(1+h); it is distinct from unshifted basic restriction.

The graded 2-morphism spaces. The weights are 0-objects. A 1-morphism is a finite composable word in the Gj,Hi, with its specified source and target weights; identities are empty words. For parallel words u,v, define Hom⁡n(u,v) as the degree-n part of the k-span of formal oriented string diagrams generated by the dots, downward crossings and four units/counits below, modulo the displayed local relations. Every strand is labeled by its color, and its direction is downward for Gj and upward for Hi. The top boundary is the source word and the bottom boundary the target word. Regions carry the unique weights obtained from the outside source weight by the indicated simple-root changes. Diagrams are generic: transverse double crossings, isolated dots and nondegenerate cups/caps, with no triple crossing or dot at a crossing/extremum. Oppositely oriented crossings denote the specified adjunction mates of a downward crossing, not new generators. Use planar isotopies preserving the ordered oriented local events; moving a crossing past an extremum uses the mate relations below. Vertical composition is stacking and horizontal composition is juxtaposition at a common weight; degrees add under either operation. The interchange relation and bilinearity are imposed. A degree-n map from u to v is a degree-zero map u{n}→v with the internal-shift convention of the grading supplier. Additive sums, shifts and idempotent completion have their usual graded 2-category meanings applied to these Hom spaces.

Degrees and the native crossing. Dots have degree 2dj and downward crossings have degree −bjk, matching the grading of The KLR grading and the diagrammatic multiplication. The native crossing is τ, with native equal-color divided difference (f−sf)/(x1−x2); for expressing the source diagram equations put κ=−τ for every color pair, retaining dots, idempotents and Q. Thus the native cubic braid numerator is globally opposite to the source numerator, while the quadratic Q is unchanged. Impose the full downward KLR relations of the cited Definition.

Adjunctions and the rank-one matrix. At input i-weight h, the first unit 1→HiGi and the second counit HiGi→1 have degree di(1−h); the first counit GiHi→1 and the second unit 1→GiHi have degree di(1+h). Impose both adjunction triangles with their adjacent input-weight shifts and cyclicity of the dot. For h≥0 prescribe the degree-zero rank-one matrix HiGi≅GiHi⊕⨁r=0h−11{di(1−h+2r)}; for h<0 prescribe GiHi≅HiGi⊕⨁r=0−h−11{di(1+h+2r)}. The off-diagonal crossing component is the cup--source-crossing--cap transfer, and the identity columns and rows are the indicated dotted units/counits. Adjoin its actual inverse blocks, requiring both matrix inverse equations; the dotted dual rows and columns are the finite triangular coefficient convolution determined by bubble inversion, and the crossing block satisfies the local cross-and-cap equations. In particular, at h<0, if rh:GiHi→HiGi⊕D−h is this matrix, then rh−1jH and pHrh are the specified natural inclusion and projection with product 1HiGi.

Explicit rank-one inverse blocks. Put P=GiHi, V=HiGi at the common outside weight μ, and write ημ:1μ→HiGi, εμ:GiHi→1μ for the first adjunction and ημ′:1μ→GiHi, εμ′:HiGi→1μ for the second. Let τGG be the native equal-color downward crossing and τHH its twofold adjunction mate. Fix the native sideways mates by T=(HiGiεμ)(HiτGGHi)(ημGiHi),S=(GiHiεμ′)(GiτHHGi)(ημ′HiGi). Their middle words are respectively HiGiGiHi and GiHiHiGi; the displayed final counits consume their rightmost GiHi and HiGi. Thus T:P→V and S:V→P are typed, with degree di(1−h)−2di+di(1+h)=0. The source-crossing component in the preceding rank-one matrix is −T. For h≥0, its identity columns are Ck=xkημ, and its identity rows are Rk=∑a+j=h−1−kAμ,j εμ′xa,0≤k<h, where a,j≥0. The matrix is ρ=(−T,(Ck)k):P⊕Dh→V and its specified inverse is σ=(S,(Rk)k):V→P⊕Dh. Impose both equations σρ=1 and ρσ=1; in components these say −ST=1P, RkT=0, SCk=0, RkCℓ=δkℓ and −TS+∑kCkRk=1V. For h<0, take Ck−=xkημ′ and Rk−=∑a+j=−h−1−kHμ,j εμxa,0≤k<−h, again with a,j≥0. Now ρ=(−T,(Rk−)k):P→V⊕D−h and σ=(S,(Ck−)k):V⊕D−h→P; impose ρσ=1, σρ=1. Equivalently −TS=1V, TCk−=0, Rk−S=0, Rk−Cℓ−=δkℓ and −ST+∑kCk−Rk−=1P. The shift summands Dh,D−h are exactly those displayed above. The row degrees are respectively di(h−1−2k) and −di(1+h+2k), opposite the column degrees, so every matrix component is degree zero after the indicated shifts. Empty identity sums at h=0 give the same inverse equations. These are imposed relations in the presentation; a claim that the concrete flag bimodules satisfy them still requires their local realization proof.

Bubble series and slides. The normalized far-left bubble series Aμ(t),Hμ(t) have constant coefficient 1 and satisfy Aμ(t)Hμ(t)=1. Genuine negative-degree bubbles vanish. The A coefficient with index m is the clockwise bubble with −h−1+m dots when this count is nonnegative, extended by formal inverse coefficients otherwise; its degree is 2dim. The other family has dot count h−1+ℓ and degree 2diℓ. Impose the finite-coefficient slides verified on the monic flag model: adjoining an i root z divides A by (1−zt)2 and multiplies H by that factor; adjoining a spectator root y of color j≠i multiplies A by qijrev(y,t)=t−aijQij(t−1,y)/tij, where tij is the nonzero extremal coefficient, and divides H by it. Every reciprocal coefficient is defined by the finite recursion with constant coefficient 1.

Four oriented same-color equations. The following notation specifies actual local diagrams, all with color i. The two-crossing equations have common outside weight μ; the single curls have the adjacent region weights specified individually below. Read tangent directions in the page. Let CL,CR be the cap arch (two bottom endpoints and no top endpoints), whose tangent at its peak points left or right, respectively. Their bottom arrows, from left to right, are (↓,↑) and (↑,↓). Let UL,UR be the cup valley (two top endpoints and no bottom endpoints), whose tangent at its trough points left or right; their top arrows are (↑,↓) and (↓,↑). An exponent on C or U counts dots on its open arc. Let Bccwb and Bcwb be the counterclockwise and clockwise bubbles with literal dot count b, located to the right of the cap/cup in the outside region of weight μ. Their negative dot counts are exactly the fake bubbles defined by the coefficient conventions above, not zero by convention. Write ημ:1μ→HiGi and εμ′:HiGi→1μ for the first unit and second counit, and ημ′:1μ→GiHi, εμ:GiHi→1μ for the second unit and first counit. Let τHH be the twofold adjunction mate of the native equal-color downward crossing. Define Lμ=(Hiεμ′)(τHHGi)(Hiημ),Rμ=(εμHi)(GiτHH)(ημ′Hi). The first formula starts and ends at Hi with input μ; the second starts and ends at Hi with input μ−αi. Thus both units and counits in Lμ have degree di(1−h), while those in Rμ have degree di(1+h). The crossing degree −2di makes their degrees −2dih and 2dih respectively. Products in these formulas apply the rightmost map first, with adjacent weights determined by composition. Geometrically Lμ is an upward-strand curl with its loop bulging LEFT and its left-adjacent region of weight μ. This is an endomorphism of Hi at input μ, and its bubble on the right-hand side is in the left region μ. Let Rμ be the upward-strand curl with its loop bulging RIGHT and its right-adjacent region of weight μ. Its left region is μ−αi, so it is an endomorphism of Hi at input μ−αi, and its bubble is in the right region μ. Both have one native crossing and the two extremal turns of the loop. Let D↓↑ and D↑↓ be the two opposite crossing mates composed in the two orders on their indicated straight boundaries, with common outside region μ. Impose Lμ=∑a+b=−1xaBccw,μb,Rμ=−∑a+b=−1xaBcw,μb, D↓↑=−1↓↑+∑a+b+c=−2CLaBcw,μbURc, D↑↓=−1↑↓+∑a+b+c=−2CRaBccw,μbULc. Composition in the last two displays is top-to-bottom: U first, then the outside bubble, then C. The single-curl equations are upward-strand endomorphism equations; their cup/cap forms are their specified adjunction mates, not cap drawings with unspecified endpoint arrows. In every sum, a,c on open strands are nonnegative. The clockwise bubble with literal b dots is the Aμ coefficient of index b+h+1, and the counterclockwise bubble is the Hμ coefficient of index b−h+1, where h=⟨hi,μ⟩. Coefficients of negative index are zero and the index-zero coefficient is one. The nonnegative coefficient and open-dot indices make each sum finite. The opposite-crossing equations have degree zero: their correction degrees are 2di(1−h)+2di(a+b+c+h+1)=0 and 2di(1+h)+2di(a+b+c−h+1)=0. The two curls have degrees −2dih and 2dih at their respective, different input weights.

The native single-crossing signs follow from κ=−τ; two-crossing signs are unchanged. The literal triple-dot sum is −2, not the compact −1 printed in Webster's Figure 2: in the full positive-weight equation, coefficient indices satisfy f1+f2+f3=h−1 and the bubble has literal count b=−h−1+f2, giving a+b+c=−2; the negative-weight equation uses g1+g2+g3=−h−1 and b=h−1+g2, giving the same value. Reflection exchanges the two bubble orientations and preserves region weights. The single-curl coefficient sums instead have total h or −h, yielding literal a+b=−1. At h=0 the triple sums are empty and the single curls are respectively +1 and −1 on their specified shifted input weights. At the h=1, p(u)=u vacuum, HiGi=k, GiHi=0, Aμ=1 and the only surviving clockwise bubble has b=−2; thus the first cancellation is 0=−1k+1k, with no degree or vacuum contradiction.

Distinct-color crossing mates. For j≠i, at input weight μ put ξ=μ+αi−αj, so X=GjHi and Y=HiGj both go from μ to ξ. Let τGiGj:GiGj→GjGi and τGjGi:GjGi→GiGj denote the two native downward crossings. Specify the handed pair by the actual typed mate composites a=(HiGjεμ)(HiτGiGjHi)(ηξGjHi):X→Y, b=(εξ′GjHi)(HiτGjGiHi)(HiGjημ′):Y→X. The intermediate words are respectively HiGiGjHi and HiGjGiHi; in a the final first counit consumes the rightmost GiHi, while in b the final second counit consumes the leftmost HiGi. Impose ba=tij1X and ab=tij1Y for this same handed pair. Thus a and tij−1b are mutually inverse and give HiGj≅GjHi, commuting with the j dot. If h=⟨hi,μ⟩, both composites have degree di(1+h)+di(−1−h+aij)−bij=0. Replacing both native crossings by the source crossings κ=−τ negates a and b separately and leaves both cancellation scalars unchanged.

There is no Hj in this minimal category. The analogous calculation in the separately distinguished category Pj has scalar tji in both orders for its own handed pair. That does not assign tji to the other composition of the fixed pair a,b above. Comparing the two partial actions, or asserting a full double-right-mate ratio, requires the separate coherent assembly proof; it is not an additional relation imposed here.

Status of the relations. These equations are relations of this proof-tool category. Their consistency and homogeneous realization are established by the polynomial flag model (The minimal-parabolic polynomial flag model realizes the graded diagram relations ↗), rather than assumed for the actual cyclotomic induction/restriction action; no claim about the latter is made here. This definition uses no choice: it is a presentation by generators and homogeneous equations, and every sl(2) infinite family appearing in the matrix and bubble clauses is a finite coefficient recursion from a constant coefficient 1.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Mixed relations, local nilpotence and weights give the integrable quantum action

Statement

Let V=⨁μ∈PVμ be a label-weight-graded Q(q)-vector space with toral operators Kh (h∈P∨) acting on Vμ by q⟨μ,h⟩, and operators Ei,Fi of weights αi,−αi mapping Vμ to Vμ+αi and Vμ−αi. Assume the toral conjugation and mixed relations, and local nilpotence of each Ei and Fi; vectors have finite label support. Then these operators uniquely define an integrable type-one Uq(g)-module structure on V for EVERY real symmetrizable Cartan datum. Every vector has a finite rank-one Ui orbit and the admissible Kashiwara i-string decomposition applies. Finite weight spaces do not imply finite-dimensional full-g orbits; no such conclusion is asserted.

Facts & Assumptions

Given: A symmetrizable Cartan datum (I,A,D,P,P∨,q) with aii=2, over Q(q), and a label-graded space V=⨁μ∈PVμ with operators Kh (h∈P∨), Ei, Fi satisfying:

[A1]

(toral and toral conjugation) K0=1, KhKh′=Kh+h′, Kh acts on Vμ by q⟨μ,h⟩, KhEiKh−1=q⟨αi,h⟩Ei and KhFiKh−1=q−⟨αi,h⟩Fi; write Ki:=Kdihi, so Ki acts on Vμ by qi⟨μ,hi⟩ with qi=qdi.

[A2]

(mixed relations) EiFj−FjEi=δij(Ki−Ki−1)/(qi−qi−1) for all i,j; in particular EiFj=FjEi for i≠j.

[A3]

(local nilpotence) for every v∈V and every i there are Ne(v,i),Nf(v,i) with EiNe(v,i)v=FiNf(v,i)v=0; every vector is a finite sum of label components.

[F1]

In Uq(g) the displayed toral, toral-action, mixed and Serre relations hold, and a linear map on the generators satisfying all of them extends uniquely to a Uq(g)-module structure (The Drinfeld-Jimbo quantized enveloping algebra by generators and relations, Symmetrizable Cartan data for quantum groups, A ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring).

[F2]

[m]i=(qim−qi−m)/(qi−qi−1) and [m]i!≠0 for m≥0, and [m]i=0 exactly when m=0, because qi is transcendental over Q (Quantum integers, factorials, Gaussian binomials and divided powers at qi).

[F3]

In the rank-one algebra generated by Ei,Fi,Ki±1, with Fi(b)=Fib/[b]i!, one has EiFi(b)=Fi(b)Ei+Fi(b−1)Θi,b,Θi,b=1qib−qi−b∑s=0b−1(qi−2sKi−qi2sKi−1) for b≥1, and KiEiKi−1=qi2Ei, KiFiKi−1=qi−2Fi (Divided-power commutation and the simple Uqi(sl2) string modules, parts (i) and (ii)).

[F4]

The Gaussian quotients satisfy the Pascal recurrence Cm,r=qirCm−1,r+qir−mCm−1,r−1 with Cm,r=0 outside 0≤r≤m (The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality).

[F5]

Once V is a chosen P-graded type-one quantum weight module on which Ei and Fi are locally nilpotent, the i-string decomposition theorem applies to V (Uniqueness of the i-string decomposition of an integrable module, Quantum weight modules, weights in P, and integrability).

Proof

technique · finite rank-one reductions: enclose each vector in a finite-dimensional rank-one module, use the rank-one adjoint action on a Hom space to turn $F_j$ into a highest vector, bound its string by the divided-power commutation formula, and read the Serre sum off the surviving coefficient
1.1A1A2A3

Finite rank-one orbits. Fix i and v∈V. Then W:=span⁡{FiaEibKicv:a,b≥0, c∈Z} is a finite-dimensional Ai-stable subspace, where Ai is the algebra generated by Ei,Fi,Ki±1: the toral operator Ki acts diagonally on the finitely many nonzero label components of v, so the vectors Kicv span a finite-dimensional subspace; by [A3] there is B with Eibv=0 for b≥B; the mixed relation of [A2] rewrites any word in Ei,Fi as a linear combination of words FiaEib with coefficients in the algebra generated by Ki; and one may choose finitely many Kicv spanning the toral orbit and use local nilpotence of Fi on their finitely many Eib-images to bound a. The span of the resulting finite set is stable under Ei,Fi,Ki±1.

2.1step 1.1A1A2A3

The second finite module. Fix i≠j and set W′:=span⁡{FiaEibKicFjw:w∈W, a,b≥0, c∈Z}. Since W is finite-dimensional, step 1.1 applied to each of the finitely many vectors Fjw exhibits W′ as a finite union of finite-dimensional Ai-stable subspaces; hence W′ is a finite-dimensional Ai-stable subspace of V containing FjW.

3.1A1A2step 2.1

The rank-one adjoint module. On the finite-dimensional space Hom⁡(W,W′) define operators by Ad(Ki)(T)=KiTKi−1, Ad(Ei)(T)=(EiT−TEi)Ki and Ad(Fi)(T)=FiT−KiTKi−1Fi. Substituting these formulas, using KiEi=qi2EiKi, KiFi=qi−2FiKi and EiFi−FiEi=(Ki−Ki−1)/(qi−qi−1) on W,W′, gives Ad(Ki)Ad(Ei)Ad(Ki)−1=qi2Ad(Ei), Ad(Ki)Ad(Fi)Ad(Ki)−1=qi−2Ad(Fi) and [Ad(Ei),Ad(Fi)]=(Ad(Ki)−Ad(Ki)−1)/(qi−qi−1). Thus these formulas give a rank-one module directly. Moreover Ad(Ki) is diagonalizable because Ki acts diagonally on W and W′, and Ad(Ei),Ad(Fi) are locally nilpotent: Ad(Ei) raises and Ad(Fi) lowers the Ad(Ki)-weight by 2, the weights of Hom⁡(W,W′) form a finite set, and decomposing any T into weight components each orbit is supported on distinct weights and hence terminates.

4.1A1A2step 3.1

Fj is a highest vector of weight m. Since FjW⊆W′, the restriction T:=Fj∣W lies in Hom⁡(W,W′). By [A2], EiFj=FjEi for i≠j, so Ad(Ei)(T)=(EiT−TEi)Ki=0; and by [A1], Ad(Ki)(T)=KiFjKi−1=qi−aijT, because ⟨αj,dihi⟩=diaij. Put m:=−aij≥0, the off-diagonal Cartan entries being nonpositive. Thus T is annihilated by Ad(Ei) and has Ad(Ki)-weight qim with m≥0.

5.1F2F3step 4.1

The rank-one string bound. Assume T≠0. In the rank-one module Hom⁡(W,W′) of steps 3.1-4.1 let t≥1 be minimal with Ad(Fi)tT=0; it exists by the local nilpotence of step 3.1. For b≥1 the divided-power formula of [F3] gives Ad(Ei)Ad(Fi)(b)(T)=Ad(Fi)(b−1)Θi,b(T), and Θi,b acts on T by the scalar 1qib−qi−b∑s=0b−1(qim−2s−qi−m+2s)=qim−b+1−qi−m+b−1qi−qi−1=[m−b+1]i, by summing the two geometric progressions. Taking b=t and using Ad(Fi)tT=0 together with Ad(Fi)(t−1)T=[t−1]i!−1Ad(Fi)t−1T≠0 gives [m−t+1]i=0, hence m−t+1=0 by [F2], that is t=m+1; therefore Ad(Fi)m+1T=0.

6.1F4step 1.1step 5.1

The Serre sum. By induction on n≥0, using Ad(Ki)(T)=qimT and the Pascal recurrence of [F4], the powers of the adjoint action expand as Ad(Fi)n(T)=∑r=0n(−1)rqir(m−n+1)(nr)iFin−rTFir: the case n=0 is clear, and applying Ad(Fi) to the formula for n, conjugating KiFin−rTFirKi−1=qim−2nFin−rTFir and comparing the coefficient of Fin+1−rTFir uses exactly Cn+1,r=qirCn,r+qir−n−1Cn,r−1, the second form of [F4]. At n=m+1=1−aij every Laurent exponent r(m−n+1) is zero, so step 5.1 gives ∑r=01−aij(−1)r(1−aijr)iFi1−aij−rFjFir=0 on W. Since every v∈V lies in such a W by step 1.1, the negative Serre relation holds as an operator on all of V.

7.1A1A2A3step 6.1

The positive Serre relation. Put Ei′:=Fi, Fi′:=Ei and Kh′:=K−h for all i and h. The primed data again satisfies the toral, toral-action, mixed and local-nilpotence hypotheses [A1]-[A3]: for instance Kh′Ei′Kh′−1=K−hFiKh=q⟨αi,h⟩Fi=q⟨αi,h⟩Ei′, while Ei′Fi′−Fi′Ei′=FiEi−EiFi=−(Ki−Ki−1)/(qi−qi−1)=(Ki′−Ki′−1)/(qi−qi−1). Applying steps 1.1-6.1 to the primed data gives ∑r(−1)r(1−aijr)iEi1−aij−rEjEir=0 on V, which is the positive Serre relation for the original data.

8.1A3F1F5step 1.1step 6.1step 7.1∎

Conclusion. By [A1]-[A3] the operators satisfy all the defining relations of Uq(g): the toral and toral-action relations, the mixed commutators, and both Serre families by steps 6.1 and 7.1. Hence the universal property [F1] equips V with a Uq(g)-module structure; it is unique because Uq(g) is generated by these operators, and it is a chosen P-graded type-one weight module by construction. Local nilpotence is exactly [A3], so the module is integrable, and by [F5] the admissible i-string decomposition applies to every vector; step 1.1 supplies the finite rank-one Ui orbit. No finite-dimensionality of the full weight spaces is asserted or used.

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Cyclotomic KLR induction and restriction functors

Definition

Use the standard graded cyclotomic quotient of The cyclotomic KLR quotient at a dominant integral weight, and keep the conventions fixed there: the cyclotomic relation is imposed on the FIRST strand and cyclotomic induction appends strands on the RIGHT. Fix β∈Q+ and a color i; put A:=RΛ(β),B:=RΛ(β+αi),e:=e(β,i), where e(β,i)=∑ν∈Iβe(νi)∈R(β+αi) is the idempotent of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum supported on the sequences ending in i.

The right-append corner homomorphism. Right append defines a k-algebra homomorphism ιi:A⟶eBe,1A⟼e,e(ν)⟼e(νi),xa⟼xae,τa⟼τae, sending each old dot or crossing to the same-named generator multiplied by the endpoint idempotent e, at the same position in the first ∣β∣ strands of RΛ(β+αi) and each old idempotent to the longer idempotent obtained by appending i. It is a graded homomorphism of degree zero: each generic relation (1)-(7) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum is preserved under right append, and the first-strand cyclotomic generator of A maps to the first-strand cyclotomic generator of B, so the cyclotomic relation is preserved and ιi is well defined on the quotient. The unit is sent to the corner unit e, not to a global unit of B; it is not asserted that ιi is injective, and e is allowed to be zero.

The functors. On graded left modules define Fibasic(M):=Be⊗AM,Eibasic(N):=eN, the tensor over the graded balanced tensor product of Graded balanced tensor product and homogeneous Hom and the idempotent restriction of the graded B-module N (Associative graded algebras, bimodules, and internal shifts). Both are additive k-linear functors between the graded module categories, they preserve degree-zero maps, and they extend to direct sums over the root degrees β∈Q+.

Adjunction, weights and shifts. Evaluation at e identifies HOM⁡B(Be,N) with eN by the degree-zero tensor--Hom adjunction, giving Fibasic⊣Eibasic with its actual grading. The functor Fibasic increases ROOT degree by αi, taking modules at root β to modules at root β+αi, and decreases the module weight Λ−β by αi; restriction does the reverse. Both composites are endofunctors at a fixed root degree. Grading shifts satisfy Fibasic(M{r})≅Fibasic(M){r} and Eibasic(N{r})≅Eibasic(N){r}, using the internal shifts of Associative graded algebras, bimodules, and internal shifts.

Ungraded monic deformations. For a general monic specialization aj(u) the quotient RaΛ(β) of The cyclotomic KLR quotient at a dominant integral weight carries no grading, and the same formulas define the ungraded functors Fibasic and Eibasic; no graded statement is asserted on that branch.

Status of further structure. Exactness, preservation of projectives and a shifted second adjunction are theorems below, not part of this definition; in particular no unshifted right adjunction Eibasic⊣Fibasic is asserted here, and the explicit shift of the second adjunction is supplied by the coherent-biadjunction lemma of this page. This definition uses no choice.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Cyclotomic dot annihilators, finite-dimensional blocks, and finite root strings

Statement

Let k be any field and let Q satisfy (Q1)-(Q4) for a real symmetrizable Cartan datum with finite color set. For monic aj(u)∈k[u] of degree λj≥0, impose aν1(x1)e(ν)=0 and write Ra(β) for the resulting ordinary quotient. Then: every dot has a scalar-coefficient monic annihilator in each fixed block; every Ra(β) is finite dimensional over k; and, for fixed β and i, Ra(β+mαi)=0 for all sufficiently large m. Thus right-append induction has finite i-strings. In the standard homogeneous specialization aj(u)=uλj, every dot is nilpotent and these are statements about the induced graded algebra and graded functors. For an inhomogeneous monic specialization the assertions are ungraded; no graded highest-weight Grothendieck identification is included.

Facts & Assumptions

Given: A field k, a KLR datum Q for a real symmetrizable Cartan datum with finite color set I, monic polynomials aj∈k[u] of degrees λj≥0, and the quotient Ra(β) of The cyclotomic KLR quotient at a dominant integral weight for the monic specialization (aj).

[F1]

The KLR algebra Rn(Q) is generated by idempotents e(ν), dots xa and crossings τa subject to relations (1)-(7) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum: in particular τa2e(ν)=Qνaνa+1(xa,xa+1)e(ν); for νa=νa+1 one has τaxa−xa+1τa=e(ν) and τaxa+1−xaτa=−e(ν); for νa≠νa+1 one has τaxa=xa+1τa and τaxa+1=xaτa; the xa commute, and the far commutation and braid relations hold. The polynomials Qij are homogeneous of degree −2bij for deg⁡u=2di, deg⁡v=2dj, and the two extremal coefficients of Qij are nonzero (Q3)-(Q4) (The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, The KLR grading and the diagrammatic multiplication).

[F2]

R(β) has the PBW basis of The PBW (monomial) basis theorem for KLR algebras: for a fixed reduced-expression system, the monomials τwx1a1⋯xnane(ν) with w∈Sn, ar≥0, ν∈In, and ∑rανr=β, form a k-basis of R(β); equivalently the monomials x1a1⋯xnanτwe(ν) form a basis.

[F3]

For a single color i, the subalgebra R(nαi) is the nil-Hecke algebra generated by k[x1,…,xn] and τ1,…,τn−1 with τa2=0, the braid and far commutation relations and the nil-Hecke dot moves; ∂w0=τi1⋯τi(n2) for a reduced expression of w0 is independent of the reduced expression, the element x1n−1x2n−2⋯xn−1∂w0 is a nonzero idempotent, and the monomials x1a1⋯xnanτw form a k-basis (Nil-Hecke idempotents and divided-power KLR projectives).

Proof

Proof technique: propagate one explicit first-strand annihilator to every position by the equal-colour mixed relations and a determinant elimination over k[x]/g, read finite-dimensionality off the PBW basis, then bound i-strings by an induction on the number of non-i letters.

1.1givenF1

The vacuum and the first-strand annihilator. At β=0, the sole word is empty and Ra(0)=k, since there is no first strand and no cyclotomic relation to impose. This block is finite dimensional of dimension 1, and its no-dot annihilator and nilpotence assertions are vacuous. The first-strand computation now concerns only nonempty words in positive-height blocks. Let g1:=∏j∈Iaj∈k[u], monic of degree Λ:=∑j∈Iλj. For every nonempty ν and every positive-height block, aν1(x1)e(ν)=0 by definition of the quotient, and g1 is divisible by aν1, so g1(x1)e(ν)=0 for all such ν: the monic polynomial g1 with scalar coefficients annihilates the first dot x1 in every positive-height block, with the convention that a zero corner satisfies the identity trivially.

1.2F1givenalgebra

Equal-colour exchange. Suppose a one-variable polynomial f satisfies f(xa)e(ν)=0 on a block with νa=νa+1=j; write x=xa, y=xa+1 and put κa:=−τa. Then κa2=τa2=Qjj(x,y)=0 because Qjj:=0 (Q1), and from the equal-colour dot moves κax=yκa−e and κay=xκa+e one computes κaf(x)=f(y)κa+∂f and κaf(x)κa=f(y)κa2+∂fκa=∂fκa, where ∂f:=(f(y)−f(x))/(x−y)∈k[x,y] is the divided difference and f(y) is the same one-variable polynomial evaluated at y. Applying the identity (x−y)κafκae(ν)=(saf−f)κae(ν)=(κaf−∂f−fκa)e(ν) to a module on which f(x)e(ν) acts as zero, the terms containing f vanish and give ∂fe(ν)M=0, whence f(y)e(ν)M=(f(x)+(x−y)∂f)e(ν)M=0. Hence f(xa+1)e(ν) also annihilates the module, where ∂f=(saf−f)/(x−y) is the divided difference of [F3] with the sign convention of the polynomial representation. For any multivariate polynomial H in the commuting dots on an equal-colour corner, the same relations give κaH=(saH)κa+∂aH. If He(ν)=0, then (xa−xa+1)κaHκae(ν)=(κaH−∂aH−Hκa)e(ν) implies ∂aHe(ν)=0; multiplying the defining divided-difference equation also gives (saH)e(ν)=0. Thus this closure applies to each polynomial produced by the iterated differences, not just the initial one-variable annihilator.

1.3F1algebra

Unequal-colour exchange. Let f∈k[u] be monic of degree d and suppose f(xa)e(ν′)=0 for every word ν′ in the current block; this is the global position annihilator supplied by the induction below. Fix ν with νa=j≠l=νa+1 and write x=xa, y=xa+1. Since saν is another word in that same block, f(x)e(saν)=0, and the dot slides give τaf(x)τae(ν)=f(y)Qjl(x,y)e(ν)=0. Put m=−alj and let cy be the coefficient of ym in Qjl(x,y). By (Q3), positivity of the dot degrees excludes all higher y-powers and any x factor in that coefficient, while (Q4) makes cy∈k×; thus Qjl(x,y)=cyym+∑b<mqb(x)yb. The algebra k[y][x]/(f(x)) is free of rank d on 1,x,…,xd−1. Multiplication by Qjl has matrix cyymI+∑b<mTbyb, so its determinant ρ(y)=Res⁡x(f(x),Qjl(x,y)) has degree dm and leading coefficient cyd. The adjugate identity, applied to 1 in that free algebra, gives a polynomial B(x,y) with QjlB≡ρ(modf), hence ρ=Af(x)+BQjl for a polynomial A(x,y). Therefore h(y):=cy−df(y)ρ(y) is monic of degree d(1−alj) and annihilates the ν corner: both f(x)f(y) and f(y)Qjl in its displayed polynomial-ideal expression vanish there. If d=0 the block is already zero; if m=0, (Q3) makes Qjl=cy and f(y) itself annihilates that corner. Only the actual nonzero extremal scalar is inverted, so the argument works over every stated field.

2.1step 1.1step 1.2step 1.3

Global monic position annihilators. Step 1.1 supplies a single monic g1 with scalar coefficients annihilating x1 on every word corner. Suppose a monic ga annihilates xa on all word corners of a fixed block. Across an equal-colour pair, step 1.2 shows that ga(xa+1) vanishes; across an unequal pair (j,l), step 1.3 applies because ga also vanishes on the adjacent swapped word, and supplies a monic hjl in the next dot. The finite product ga+1:=ga∏j≠lhjl is monic with scalar coefficients and annihilates xa+1 on every corner, whichever adjacent pair occurs. This is a constructive finite product over the finite colour set, and the same formulas can be used simultaneously for every block of the given length. The resulting degree bounds depend on the fixed position and length, as well as the Cartan datum and the initial annihilator degree. Induction gives genuine global position annihilators; a finite product over positions also gives one annihilator for every dot of a fixed block.

3.1F2step 2.1

Finite-dimensionality. Fix β with ∣β∣=n and let ga be a monic annihilator of xa on Ra(β) as in step 2.1, of degree da. By the PBW basis [F2], each corner e(ν)Ra(β)e(ν′) is spanned by the classes of τwx1m1⋯xnmne(ν); using ga(xa)=0, any exponent ma≥da is reduced to a k-linear combination of smaller powers of xa (the x's commute), so every element of the corner is a combination of the finitely many classes with 0≤ma<da. Since Iβ is finite and Sn is finite, Ra(β) is finite dimensional over k.

3.2F1step 1.2step 2.1

Nilpotence in the standard homogeneous case. Suppose aj(u)=uμj for monic powers, so x1 is killed by x1Λ with Λ=max⁡jμj. If xaN=0 on a block and the colours are equal, the computation of step 1.2 with f(u)=uN gives xa+1N=0 (both f(x) and ∂f=yN−xNx−y=−∑r=0N−1xN−1−ryr kill the module). If the colours differ j≠l, write Qjl(x,y)=c yq+xH(x,y) with q:=−alj≥0 and c≠0, using (Q3)-(Q4); the identity κaxNκa=yNQjl(x,y) gives c yN+q=−x yNH(x,y) on the module, and raising this identity of commuting polynomials in x,y to the Nth power kills the right side (xN=0), so yN(N+q)=0. Starting from x1Λ=0 and iterating over positions, every dot xa is nilpotent, with an exponent obtained by the finitely many displayed transformations.

3.3F3step 1.2step 2.1

All-i tails vanish. Fix a prefix length ℓ. For each of the finitely many prefixes w∈Iℓ, choose the explicit scalar monic position annihilator gw for xℓ+1 on the block wi supplied by step 2.1, of degree dw, and put d=max⁡wdw. On the word widw+1, the first-ℓ+1-strand embedding carries the cyclotomic relations and gw(xℓ+1)e(wi) into the same relations in Ra(ℓ+dw+1), so that polynomial vanishes on the longer corner. The general equal-colour polynomial calculation of step 1.2 then shows successively that ∂ℓ+dw⋯∂ℓ+1gw(xℓ+1) vanishes there. For the sign convention ∂a=(sa−1)/(xa−xa+1), direct subtraction of the generating functions ∏j(1−zjt)−1 gives ∂r⋯∂1z1s=(−1)rhs−r(z1,…,zr+1), where ht is the complete homogeneous polynomial, h0=1 and ht=0 for t<0. Applied with r=dw, this length-dw chain sends the monic leading term to (−1)dw and every lower term to 0. Thus the vanishing polynomial is the unit (−1)dwe(widw+1), and that word corner is zero. No full longest-permutation alternator is substituted for this shorter chain. Further suffix extension shows every word with d+1 consecutive i's starting at position ℓ+1 is zero; the case dw=0 already has gw=1 and the corner zero.

4.1step 3.3

Finite i-strings. Fix i. For a word w over I let #i(w) be the number of letters equal to i. Claim: for every b≥0 there is an integer Lb such that every word with at most b letters different from i and ∣w∣≥b+Lb is zero in the quotient. For b=0: an all-i word of length ≥L0:=d+1, where d is a uniform annihilator degree at prefix length 0 from step 2.1, is zero by step 3.3. Assume Lb−1; put k:=Lb−1, ℓ:=b−1+k, and let m be an all-i tail bound at prefix length ℓ obtained from step 3.3 (a finite maximum over the finitely many prefixes of length ℓ). Set Lb:=k+m−1 and let w have at most b non-i letters and ∣w∣≥b+Lb=ℓ+m. If the prefix of length ℓ contains at least k letters i it has at most b−1 non-i letters and length ℓ=(b−1)+Lb−1, so it is zero by the induction hypothesis and w=0. Otherwise the prefix contains at most k−1 letters i and therefore at least ℓ−(k−1)=b non-i letters. It already contains all the at most b non-i letters of w, so every remaining letter is i; there are at least m remaining positions, and the tail is zero by step 3.3; in both cases w=0.

5.1step 3.1step 3.2step 4.1∎

Conclusion. Fix β and put b=∑j≠iβj. For every integer m≥max⁡(0,Lb−βi), a word of weight β+mαi has exactly b non-i letters and length b+βi+m≥b+Lb, so step 4.1 makes every such word corner zero. Hence Ra(β+mαi)=0 for all sufficiently large m, giving finite right-append i-strings. Step 3.1 gives finite dimensionality of every block, and step 3.2 gives nilpotence of every dot in the standard homogeneous specialization. The monic inhomogeneous branch is ungraded throughout. The global annihilator, determinant normalization and tail argument use only finite polynomial computations and units already provided by (Q4), with no new hypotheses.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

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.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

One-step simple restriction and induction, and the first-dot index

Statement

Let k be any field and R(Q) the graded KLR algebra for a real symmetrizable Cartan datum and any homogeneous Q satisfying the standing symmetry and nonzero extremal-coefficient conditions. Graded simple modules are compared up to internal shift. For a simple S of root weight β and r=ϵi(S)>0, its ordinary one-step last-i restriction has a single simple graded socle and a single simple graded head, each once and of the same shift orbit, with ϵi=r−1; its maximum-ϵ composition part has coefficient a grading shift of [r]i. The last-dot nilpotence index on that restriction is exactly r. The first-end statements hold with ϵiL and the first dot. For every n≥1, Ind⁡(S⊠L(in)) has a unique simple graded head finS, occurring once in its whole composition series, with ϵi=r+n (also when r=0); all other constituents have smaller ϵi. One-step simple socle and simple induction head are partial inverses. A simple S survives the first-strand cyclotomic quotient with exponents λi exactly when ϵiL(S)≤λi for all i. 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 R for a real symmetrizable Cartan datum, a color i, a graded simple R(β)-module S, and r:=ϵi(S)=max⁡{s:e(β−sαi,sαi)S≠0}.

[F1]

The nil-Hecke algebra of rank m acts on the coinvariant algebra Cm=k[t1,…,tm]/(e1,…,em) by polynomial multiplication and divided differences, Cm=k[t1,…,tm−1]⊗k[E1,…,Em−1]k[z]/(zm) with Ea=(−z)a and z=tm, every positive symmetric polynomial acts by zero, and Cm is the unique NHm simple up to shift, with composition multiplicity one. After restriction to NHm−1 for m≥1 (with NH0=k), its graded socle and head are one shifted NHm−1 simple each and its composition coefficient is a shift of [m]i (Nil-Hecke idempotents and divided-power KLR projectives, Quantum integers, factorials, Gaussian binomials and divided powers at qi).

[F2]

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.

[F3]

Maximal-tail restriction: for simple S with r=ϵi(S)>0 there is a simple N with ϵi(N)=0 and ΔirS≅N⊠L(ir), and dually Ind⁡(N⊠L(ir)) has a unique simple graded head occurring once, with maximal tail (Maximal KLR tails give a unique induction head and absolute simple modules).

[F4]

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 R(αi)-factor L(i) and therefore the last-dot-zero part of block restriction. The shuffle bound is: the maximal i-tail of a constituent of EiT is at most the maximal tail of T 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

technique · compute the nil-Hecke branching explicitly, then use adjunction, the maximal-tail recursion and the shuffle bound to pin the socle, head and dot index of one-step restriction, and read off the induction head and the cyclotomic survival criterion
1.1F1F4algebra

Nil-Hecke branching. Put z=tr and write Ea for the elementary symmetric polynomials in t1,…,tr−1. The relations ea=Ea+zEa−1=0 give Ea=(−z)a for 1≤a≤r−1, and the top relation gives zr=0; hence Cr=k[t1,…,tr−1]⊗k[E1,…,Er−1]k[z]/(zr) with Ea acting by (−z)a. The polynomial representation of NHr−1 is free of rank (r−1)! over its symmetric center and identifies NHr−1 with the matrix algebra over that center; after the specialization its image on Cr is Mat(r−1)!(k[z]/(zr)) with standard column Cr. Therefore the graded socle and head of Cr are each one shifted copy of the nil-Hecke simple, the simple composition coefficient is a shift of [r]i, multiplication by z has nilpotence index exactly r, the socle is the column over zr−1k and the head the column modulo z. For r=1 this reads C1=k, z=0. 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 L(ir)⊠L(in) 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 (r+nr)r!n!=(r+n)! by the shuffle basis. The augmentation quotient of NHr+n is the full matrix algebra with simple column dimension (r+n)!, so this induced module is one shifted copy of L(ir+n).

1.2F1F2F4

Simple socle of one-step restriction. Let S have r=ϵi(S)>0 and let U⊆EiS be a simple subobject with t=ϵi(U). The final dot z commutes with R(β−αi) and acts nilpotently on EiS (positive dot degree and finite graded support), preserving the socle and its ungraded isotypic components; on the isotypic component containing U a nonzero power of z has a nonzero kernel copy of the same simple type killed by z, 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 Ind⁡(U,L1)→S, hence a surjection, and the shuffle bound [F4] gives r≤t+1 while the exact defining corners give t≤r−1; so t=r−1.

2.1step 1.2F3

The maximal corner. Apply the maximal (r−1)-tail corner p to EiS, retaining R(β−rαi)⊗NHr−1. By [F3], ΔirS≅N⊠L(ir) with ϵi(N)=0, so p(EiS)=N⊠Res⁡NHr−1L(ir); by step 1.1 and the absolute simplicity of N this has a single simple socle. Every simple subobject U of EiS has t=r−1 by step 1.2, so [F3] makes pU a nonzero simple object; exactness of p makes p(soc⁡EiS) semisimple and injects it into the one-simple socle of p(EiS). Hence soc⁡EiS is a single simple object, once, with ϵi=r−1; moreover every nonzero submodule of EiS contains a simple graded submodule whose p-image is nonzero (detection).

3.1step 2.1F1F2

Simple head, detection and the dot index. Finite graded duality D is exact, takes simples to simples, fixes corner idempotents and commutes with restriction, so applying step 2.1 to DS (same ϵi) and dualising gives a single simple head of EiS, once; the maximal corner of its head is the head of N⊠Res⁡L(ir), while the maximal corner of its socle is that tensor's socle. By step 1.1 these are shifts of the same N⊠L(ir−1). The unique-head recursion of [F3] therefore identifies their simple shift orbits. On p(EiS), step 1.1 gives zr=0 and zr−1≠0; the image of zr on all of EiS is a graded submodule with zero p-corner, so detection in step 2.1 forces it to be zero, while nonvanishing of zr−1 in the corner forces it to be nonzero globally. Hence the last-dot nilpotence index on EiS is exactly r; repeating with the first variable gives first-dot index exactly ϵiL(S).

4.1step 1.1step 3.1F3F4

Nonreduced induction and its unique head. Put Mn=Ind⁡(S⊠L(in)), n≥1. Its maximum tail is at most r+n by the shuffle bound; at tail r+n the Mackey filtration retains exactly all n added i-strands together with r terminal i-strands of S, its surviving corner is N⊠Ind⁡NHr⊗NHnNHr+n(L(ir)⊠L(in)). The final computation of step 1.1 makes this N⊠L(ir+n) up to the fixed shift. Every simple quotient T of Mn has that maximum tail: adjunction gives a nonzero injection S⊠L(in)↪ΔinT, and restricting the first factor to the maximal r-tail retains a nonzero corner of T's maximal corner, so ϵi(T)≥r+n, and the shuffle bound gives equality. Hence the finite semisimple head of Mn has only constituents detected by its simple maximal corner, so it is one simple constituent, once; the kernel of Mn→hd⁡Mn has zero maximal corner, so every other composition factor has smaller ϵi and the head occurs exactly once in the whole composition series. Write fiS:=hd⁡M1.

5.1step 2.1step 3.1step 4.1F1F2∎

Partial inverses, iterates and the cyclotomic criterion. Adjunction realises S in Ei(fiS), so step 2.1 gives soc⁡EifiS=S with shifts restored; conversely S=soc⁡EiT implies T is a simple quotient of Ind⁡(S,L1), hence T=fiS. Thus one-step socle and head are partial inverses, fi raises ϵi by one and soc⁡Ei lowers it by one; iterating the one-strand argument gives hd⁡Ind⁡(S⊠L(in))=finS. Let JΛ be generated by x1λi on every word beginning with i; it annihilates a simple S exactly when each first-i corner has first-dot index at most λi, which by step 3.1 is ϵiL(S), so JΛS=0 iff ϵiL(S)≤λi for every i; if a generator is nonzero, simplicity forces JΛS=S. 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 [r]i by step 1.1. No choice and no self-dual representative is used.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

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.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The two-colour jump formula and strict elementary embeddings

Statement

Let k be any field and R(Q) the graded KLR algebra for a real symmetrizable Cartan datum and any homogeneous Q satisfying the standing symmetry and nonzero extremal-coefficient conditions. Graded simple modules are compared up to internal shift. Set ci(S)=ϵiL(S) and Ji(S)=max⁡{n≥0:ci(finS)=ci(S)}. This maximum is finite and Ji(S)=ϵi(S)+ci(S)−⟨hi,β⟩ for S of root weight β∈Q+. For i≠j one has ci(fjS)=ci(S); for j=i it stays constant or increases by 1, and increase is equivalent to fiS=fiLS and to simplicity of Ind⁡(S,L(i)). Once it increases, it increases at every later right-i step. Put wt⁡(S)=−β and ϕi=ϵi+⟨hi,wt⁡⟩. The maps Ψi(S)=(eiL)ci(S)S⊗bi(−ci(S)) are strict injective elementary-crystal maps, and every nonvacuum simple has positive extraction at some i. The simple graph is lowering-generated with every generic fi nonzero. In any first-strand cyclotomic quotient containing S the actual surviving lowering length is λi+ϵi(S)−⟨hi,β⟩. All containing-weight arguments take place in the auxiliary primitive-coroot finite-support datum, leaving R,A,D,Q unchanged, so no positive-dominant-label assumption on the original P is added. Linear divided restriction/G0 operators satisfy the quantum Serre relation; the simple-socle crystal operators are not asserted to satisfy a linear Serre identity.

Facts & Assumptions

Given: A graded KLR algebra R for a real symmetrizable Cartan datum, a graded simple R(β)-module S, and the simple socle/head operators ei,fi of One-step simple restriction and induction, and the first-dot index; write ϵi,ϵiL for the right and first-end tail lengths.

[F1]

One-step results of One-step simple restriction and induction, and the first-dot index: eiS has simple socle and head once with ϵi=r−1; Ind⁡(S⊠L(in)) has a unique simple head finS occurring once, with ϵi=r+n; the one-step socle and head are partial inverses; the maximal-tail restriction/induction statements of Maximal KLR tails give a unique induction head and absolute simple modules hold, with exact block induction left adjoint to block restriction and restriction left adjoint to the shifted reversed-block coinduction (Generic KLR induction and restriction adjunctions preserve projectives).

[F2]

Finite-support regularization (Finite-support regularization of quantum label-weight modules): for every finite containing-weight argument one restricts to the finite colour support of the modules and the selected strings; the auxiliary primitive coroots carry independently prescribed nonnegative labels λl, and A,D,Q and all KLR module, shuffle, restriction and induction calculations are unchanged.

[F3]

Finite graded modules have the Krull-Schmidt property and semisimple socles; simple graded modules are absolutely simple and finite dimensional (Graded Krull-Schmidt and shift-orbit bases for finitely generated KLR modules, Maximal KLR tails give a unique induction head and absolute simple modules).

[F4]

The constructive monic-position and all-i-tail bounds of Cyclotomic dot annihilators, finite-dimensional blocks, and finite root strings: for fixed finite support, labels λ, root weight β and colour i, there is a finite integer Bi(β,λ) such that Rλ(β+nαi)=0 for every n≥Bi(β,λ).

[F5]

The split projective divided-power Serre identity of The KLR Grothendieck ring satisfies the divided-power quantum Serre relations, and the unscaled projective/simple pairing of [F1]. Applying homogeneous Hom to that identity gives the linear divided restriction relation on finite-module classes.

Proof

technique · prove the two-colour structure directly with nil-Hecke columns, obtain a finite jump from a containing cyclotomic quotient, calculate its initial value by containing-weight annihilation and induction from the vacuum, and verify every elementary tensor branch
1.1F1F2algebra

Work on the finite support supplied by [F2], prescribing the cyclotomic labels independently there. Write Lr=L(ir), ci=ϵiL, and write Ind⁡(A,B) for induction of the external tensor product; all module identifications below are on shift orbits. Two consequences of exact induction will be used. A surjection Ind⁡(A,H)→T with T simple induces a surjection Ind⁡(A,U)→T for some simple composition factor U of H: take the first nonzero image in an induced composition series. If ϵi(A)=0, a nonzero map Ind⁡(A,U)→T with A,U,T simple forces ϵi(T)=ϵi(U), since the shuffle bound gives the upper bound and adjunction injects A⊠U into the defining restriction, giving the lower bound. More particularly, a surjection Ind⁡(A,B,Lh)→T with ϵi(A)=0 factors through Ind⁡(A,fihB)→T: its tail is ϵi(B)+h, whereas every constituent of the kernel of Ind⁡(B,Lh)→fihB has smaller tail by [F1], so an induced composition series of that kernel has zero image in T.

1.2F1F3algebraconstruct

Here is the rank-two structure needed below, including its parameter calculation. Fix j≠i, put a=−aij and t=[ua]Qij(u,v)∈k×. For p+q≤a, define L(ipjiq) to have only the word ipjiq in its support, with column Lp⊠L(j)⊠Lq, the j-dot zero and both crossings adjacent to j zero. All relations hold: Qij(u,0)=tua, which kills either neighbouring column, and the native i,j,i braid correction is −t∑r=0a−1xrza−1−r. Each monomial kills the column since r≥p or a−1−r≥q when p+q≤a. The other mixed and braid equations have zero terms or are internal nil-Hecke equations. This module is simple by the matrix-column calculation in [F1], with right tail q, first tail p and ungraded character p!q!ipjiq. These are all simples of weight ci+j when c≤a: induct on c; a simple with positive right tail is the unique fi-image of its predecessor, whose tail identifies the constructed column; a simple of right tail zero is supported only on icj, and the same column argument gives L(icj). For c>a no simple can have right tail zero: such a module would again be the column Lc⊠L(j) supported only on icj, but the last mixed crossing has square txca, nonzero on Lc since its dot index is c. This contradicts its zero crossing.

2.1step 1.1F1F3algebra

Adjunction and the shuffle bound give ci(M)≤ci(fjM)≤ci(M)+δij; first-end symmetry gives ϵj(fiLM)=ϵj(M) for j≠i. If ci(fiM)=ci(M)+1, then fiM=fiLM: the two orders of induction have the same character at q=1 and hence the same ungraded composition multiplicities, while the first order's factor with maximum first tail is uniquely fiLM, once. The character implication here follows from the triangular divided-word/projective pairing in [F1]: divided-word corner dimensions are obtained from ordinary word-corner dimensions by dividing the corresponding nil-Hecke block factorials at q=1, and their triangular matrix with diagonal 1 remains invertible there. Conversely, equality of the two simple heads forces the increase. The coinduction formula in [F1], together with maximal-tail restriction, gives soc⁡Ind⁡(M,Lh)=(fiL)hM and soc⁡Ind⁡(Lh,M)=fihM: coinduction has only one simple socle, since every simple subobject has the maximum tail by adjunction and its simple maximum corner detects it. Thus fiM=fiLM forces Ind⁡(M,L1) simple: its head and socle agree and this factor occurs once; in a nonsimple module the socle would lie in the radical and supply a second occurrence. Conversely simplicity forces its socle and head to agree. Commuting M successively past the h single-colour factors, and using Ind⁡(Lr,Ls)=Lr+s, gives Ind⁡(M,Lh)=Ind⁡(Lh,M); its simple head equals its simple socle and occurs once, so it too is simple. Hence one increase forces increases at all later steps.

3.1step 2.1step 1.2F1F5algebra

Put Dn=L(ia−njin) for 0≤n≤a. The module Ind⁡(Dn,L1) has only two word corners, ia−njin+1 and ia−n+1jin, each a simple product of nil-Hecke columns by [F1]. Its simple head has the first corner nonzero. The linear divided restriction Serre relation forces the second corner nonzero too: when applied to that head at weight (a+1)i+j, all terms Ei(a+1−s)EjEi(s) vanish except s=n,n+1, and the s=n+1 term is nonzero. The relation is available on finite modules by applying homogeneous Hom to the split projective Serre identity; exact projective Hom and the unscaled pairing in [F1] identify these Hom spaces with the divided corners. Thus the head fills both simple corners and induction is simple, so fiDn=fiLDn. Step 2.1 proves Ind⁡(Dn,Lh)=Ind⁡(Lh,Dn) simple for every h. For c≥a, induction on c now classifies all simples of weight ci+j as Ind⁡(Dn,Lc−a), 0≤n≤a, with right tail n+c−a: step 1.2 excludes right tail zero for c>a, and the one-step partial inverse identifies every positive-tail simple from the preceding weight. For a=0, Qij is a nonzero constant, the mixed crossing is invertible, and Ind⁡(L(j),Lh)=Ind⁡(Lh,L(j)) is the unique simple, giving the same classification. No characteristic, splitting-field or special binomial-parameter assumption was used.

3.2step 2.1F1F2F4algebra

Define viλ(M) as the number of surviving right-i lowering steps in a quotient with labels λ containing M. It is finite by [F4]. Choose such labels with λl≥cl(M), possible by [F2] and [F1]. If ci(finM) never increased, step 2.1 would keep every first tail within those labels for every n, contrary to [F4]. Hence Ji(M) is finite; more explicitly, the bound Bi(β,λ) of [F4] with Rλ(β+Biαi)=0 gives Ji(M)<Bi(β,λ). Step 2.1 gives, for all h≥0, ci(fihM)=ci(M)+max⁡(0,h−Ji(M)), and the other first tails are unchanged. The survival criterion in [F1] therefore gives viλ(M)=Ji(M)+λi−ci(M). In particular differences viλ(X)−viλ(Y) for two surviving simples are independent of the containing labels, and Ji(fiM)=max⁡(0,Ji(M)−1). This proves finiteness and the recurrence without using the numerical jump formula.

3.3step 1.1step 2.1F1algebra

For extraction put c=ci(M) and U=(eiL)cM, so M=(fiL)cU and ci(U)=0. If ci(fjM)=c, then (eiL)cfjM=fjU. Indeed induce Lc,U,L(j) onto fjM and apply maximal first-i restriction, then its simple quotient. In the Mackey filtration the U-contribution of first i's is zero; for j≠i the only surviving factors after forgetting the first column are shifts of Ind⁡(U,L(j)). Thus the target is its unique simple head. For j=i there can also be shifts of Ind⁡(L(i),U), but these have no nonzero map to the extracted target of first tail zero, by adjunction; the same unique-head conclusion follows. If ci(fiM)=c+1, step 2.1 instead gives eiLfiM=M and therefore extraction yields U. For j≠i, ϵj(U)=ϵj(M) because first-i lowering preserves the right j-tail (step 2.1). The preceding lowering compatibility and partial inverses then give extraction compatibility with ej whenever ejM≠0; when ejM=0, the equality of tails makes ejU=0 too.

4.1step 1.1step 3.2F1F2algebra

We record the two containing-weight annihilation tests, with their proofs. If A survives and k=viλ(A), then the quotient of Ind⁡(A,Lk+1) is zero: its only simple head is the killed fik+1A, while any nonzero finite quotient has a simple head. Appending any further block preserves zero, since a cyclotomic relation on an initial block is also a relation on the larger initial block. Consequently Ind⁡(A,B) has zero quotient if ci(B)>k, by the surjection Ind⁡(Lci(B),(eiL)ci(B)B)→B. Conversely suppose ϵi(A)=ϵj(A)=0, B has weight ci+dj, and Ind⁡(A,B)→T is surjective and simple. If b=ci(B)≤k, write C=(eiL)bB and induce A,Lb,C. Its map to T factors through fibA,C: all other constituents U of Ind⁡(A,Lb) have ϵi(U)<b. The defining corner of T with an initial block of weight wt⁡root(A) followed by a suffix of colours i,j and beginning with ib is nonzero by adjunction. Every word in any such U has a non-i,j letter after the original A-block length: otherwise its last A-letter, necessarily different from i,j, would already lie in that initial block and all b added i's would be a tail, contradicting ϵi(U)<b. Shuffling with C preserves that non-i,j letter in the suffix, so this corner vanishes on Ind⁡(U,C). Thus no such factor maps onto T, proving the factorisation. The shuffle bound gives ci(T)≤ci(fibA)+ci(C)≤λi. Taking λj larger than the total root-height of the finitely many modules being considered makes the j inequality automatic; other first tails of T are at most those of A. Hence this converse guarantees survival. In these comparisons we may enlarge every label except λi to cover the fixed non-i content of all the i-strings, so no assertion of a converse for a small λj is needed.

4.2step 1.1step 1.2step 3.1algebra

First calculate the containing-length change in rank two. Any simple N of weight ci+dj with ϵi(N)=0 is a quotient of Ind⁡(L(ib1j),…,L(ibrj)) with 0≤bs≤a: strip one right j, then its maximal i-tail, and repeat. A positive-height N has a right j since its right i is zero; the factors of Ind⁡(Lb,L(j)) are classified by step 3.1, so tail zero forces b≤a and the unique factor L(ibj). This justifies each factor selection by step 1.1 and decreases height, so the process terminates. For arbitrary M, put m=ϵi(M) and strip that tail to obtain such an N. The simple fjM is a quotient induced from N and a factor U of Ind⁡(Lm,L(j)). Step 1.1 determines its tail γ=ϵi(U); by step 3.1 it equals m−a+n for some 0≤n≤a and fiaU=Ind⁡(Dn,Lm). This holds also for m<a, where U=L(ia−njim−a+n) and m−a+n≥0.

5.1step 1.1step 3.1step 3.2step 4.2F2algebra

For any simple B, every simple quotient of Ind⁡(B,Dn) has right tail ϵi(B)+n: strip the right tail Lϵi(B) of B, commute it past Dn by step 3.1, and split Dn as the head of L(ia−nj),Ln. The resulting surjection with terminal block Lϵi(B)+n gives the lower bound by adjunction; the shuffle bound gives the upper bound. This also holds for a string of Dn factors by iteration. Let ds=a−bs and D=∑sds. For m+h≥D, the surjection from the factors in step 4.2 to fihM can be rewritten as a surjection Ind⁡(Dd1,…,Ddr,Lm+h−D)→fihM. To verify it, start at the rightmost L(ibrj): the unique constituent of Ind⁡(L(ibrj),Lm+h) with tail m+h is Ind⁡(Ddr,Lm+h−dr) by step 3.1. Every other constituent has smaller tail and cannot map to the target through the preceding tail-zero factors by step 1.1. Commute this Ddr past the remaining pure-colour block using step 3.1 and repeat with r−1,…,1. Each suffix of the ds has sum at most D, so all consumed block lengths are nonnegative. If a simple Q is a quotient of Ind⁡(Dn1,…,Dnr,Lg), its right and first tails are exactly g+∑sns and g+∑s(a−ns). Indeed commute Lg past each Dns, split Dns as the head of L(ia−nsj),Lns, and move its Lns to the right; adjunction gives the lower right-tail bound, the shuffle bound the matching upper bound. Repeat with the first-end split to obtain the first-tail bound. Therefore, with C=m−ar+2∑sbs, we have ci(fihM)=h+C for h sufficiently large. For fihfjM first absorb a pure strands into U using step 4.2 and the factorisation of step 1.1, and perform the same replacements on the preceding factors. For h≥a+D this gives a quotient of Ind⁡(Dd1,…,Ddr,Dn,Lm+h−a−D), whose first tail is h+C−n. Choose h still larger so both these tails are nonnegative and take the containing i label to be ωi=h+C, with other labels large. The next first tail of M is ωi+1, whereas fjM survives exactly h+n steps. Thus viω(fjM)−viω(M)=n; label independence in step 3.2 gives for every quotient containing both viλ(fjM)−viλ(M)=n=ϵi(fjM)−ϵi(M)+a. This is the rank-two containing-length calculation, with an actual finite saturation threshold.

6.1step 1.1step 2.1step 3.2step 4.1step 5.1F2algebra

Reduce an arbitrary M and fjM to that calculation. First strip the right i-tail of M, then alternately strip maximal right j- and i-tails until the remaining simple A has ϵi(A)=ϵj(A)=0; each nonzero stripping decreases root-height. Group the removed blocks into a simple rank-two factor B0 with a surjection Ind⁡(A,B0)→eiϵi(M)M, by step 1.1. Append the removed i-tail and apply the factorisation of step 1.1 to get Ind⁡(A,B)→M with B=fiϵi(M)B0. For both l=i,j, the corner lower bound and shuffle upper bound give ϵl(B)=ϵl(M). Appending j and applying step 1.1 with colour j gives Ind⁡(A,fjB)→fjM, also with ϵi(fjB)=ϵi(fjM). The same factorisation gives Ind⁡(A,fihB)→fihM and Ind⁡(A,fih′fjB)→fih′fjM for all h,h′. Choose containing labels ω for these initial modules with all non-i labels large, and set h=viω(M), h′=viω(fjM) and k=viω(A). The two annihilation tests in step 4.1 imply ci(fihB)≤k<ci(fih+1B) and ci(fih′fjB)≤k<ci(fih′+1fjB). Step 2.1 makes the inequalities equalities at the surviving endpoints and gives zero jump there. Step 3.2, applied to B and fjB, now gives viω(B)=h+ωi−k and viω(fjB)=h′+ωi−k. Their difference equals h′−h; step 5.1 evaluates it as ϵi(fjM)−ϵi(M)+a. Label independence in step 3.2 transfers this to any quotient containing M,fjM.

7.1step 3.2step 6.1F1algebra

The initial value is now fixed, not inferred from a decrement recurrence. On the vacuum, fin1=Ln has ci=n, so its containing length is exactly λi by [F1]. Every nonvacuum simple has some positive right tail (choose the last letter of any nonzero word corner), so write M=fjN with N=ejM of lower height. Both survive whenever M survives by [F1]. If j=i, surviving length decreases by one, right tail increases by one and ⟨hi,β⟩ increases by two. If j≠i, step 6.1 gives the change in surviving length as ϵi(M)−ϵi(N)−aij. Induction on height from the vacuum therefore yields viλ(M)=λi+ϵi(M)−⟨hi,β⟩. Combining this with the independently proved formula in step 3.2 gives Ji(M)=ϵi(M)+ci(M)−⟨hi,β⟩. In particular the initial zero-jump test is precisely ϵi(M)+ci(M)=⟨hi,β⟩; its value follows from the rank-two/annihilation calculation and the vacuum base, rather than the recurrence alone. The formula is symmetric in the two ends, so the corresponding first-end jump and its decrement formula also hold.

8.1step 2.1step 7.1step 3.3F1algebra

Define the elementary crystal Bi by wt⁡(bi(n))=nαi, ϵi(bi(n))=−n, ϕi(bi(n))=n, eibi(n)=bi(n+1), fibi(n)=bi(n−1); other-colour epsilon and phi are −∞ and other-colour operators zero. On a tensor X⊗Y, epsilon is max⁡(ϵl(X),ϵl(Y)−⟨hl,wt⁡(X)⟩); el acts on X iff ϕl(X)≥ϵl(Y) and fl acts on X iff ϕl(X)>ϵl(Y), otherwise on Y. To check the i-data and both branches set s=Ji(U)=ϵi(U)+⟨hi,wt⁡(U)⟩≥0. Along the first-i string from U, the symmetric jump recurrence and step 2.1 give ϵi(M)=ϵi(U)+max⁡(0,c−s). This is exactly max⁡(ϵi(U),c−⟨hi,wt⁡(U)⟩), the tensor epsilon. Weight is also preserved since wt⁡(U)=wt⁡(M)+cαi. For lowering, if s>c then Ji(M)=s−c>0, ci(fiM)=c, and step 3.3 gives extracted factor fiU; if s≤c then Ji(M)=0, ci(fiM)=c+1 and its extracted factor is U. These are precisely the strict fi branches. For raising, if s<c then the predecessor (fiL)c−1U has zero jump, so eiM=eiLM, first tail c−1 and extracted factor U. If s≥c>0, that predecessor has positive jump; a zero jump at eiM would force eiM=eiLM by step 2.1 and contradict that positive jump. Hence ci(eiM)=c and step 3.3 applied to eiM gives extracted factor eiU. When c=0 the same first branch holds directly. If eiM=0, the epsilon formula forces eiU=0 and s≥c, so the tensor operator is also zero. Thus both raising branches, including equality and zero cases, agree. For j≠i, step 3.3 gives the epsilon equality and both operator compatibilities; phi equality follows from epsilon and weight. Finally U,c recover M=(fiL)cU, giving injectivity. Every nonvacuum has a nonzero word corner and therefore positive first tail at its first letter, while right-tail stripping decreases height to the unique vacuum and its partial inverse recovers every lowering word. All generic fi are nonzero by [F1].

9.1step 2.1step 3.1step 3.2step 7.1step 8.1F2F5∎

Step 7.1 proves the actual surviving right lowering length in every containing first-strand quotient, including zero length and the vacuum. The linear divided restriction Serre relation is the Hom-dual of the projective Serre identity used in step 3.1; it is a statement about the exact linear G0 operators, and makes no linear Serre assertion about the simple-socle operators. All containing labels and support reductions used [F2], so no new original-weight-lattice hypothesis has been imposed. Steps 2.1, 3.2 and 7.1 give every jump assertion, and step 8.1 gives strict injective elementary embeddings and lowering generation, completing the stated claims.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

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.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Normalized cyclotomic functors give an integrable quantum action

Statement

For the standard graded quotient over arbitrary k and graded admissible Q, let h=⟨hi,Λ−β⟩. On projective K0 take Fi=Fibasic and Ei=qi1−hEibasic on input β+i to output β. On module G0 take the KK action Ei=Eibasic and Fi=qi1−hFibasic on input β; also the canonical action with the SAME shifts as projectives. The torus acts on root component β by Ka=q⟨a,Λ−β⟩. Each action satisfies all mixed relations, and Ei,Fi are locally nilpotent. After scalar extension to Q(q) these are integrable type-one Uq(g)-modules. This does not assert a decomposition into finite-dimensional full-g submodules and does not cover ungraded monic deformations.

Facts & Assumptions

Given: The standard cyclotomic quotient RΛ and its graded Grothendieck groups as in Graded Grothendieck groups, shift action, and Cartan map; the basic functors and the projectivity results of Cyclotomic induction is projective on the right.

[F1]

The basic categorical commutator (The categorical sl2 commutator for cyclotomic KLR functors): qi−2FiEi⊕⨁k=0h−1qi2kId≅EiFi for h≥0, and its negative counterpart.

[F2]

The generic mixed relations (Generic KLR induction and restriction: mixed relations and the opposite-end exact sequence), with their unequal-color cyclotomic descent proved in the final step of The categorical sl2 commutator for cyclotomic KLR functors: for i≠j EiFj≅q−(αi∣αj)FjEi, and the equal-colour decomposition of [F1].

[F3]

Finite root strings and dot nilpotence (Cyclotomic dot annihilators, finite-dimensional blocks, and finite root strings): RΛ(β+nαi)=0 for n large, so Fin vanishes on each component; and the mixed-relations-to-integrable-action lemma (Mixed relations, local nilpotence and weights give the integrable quantum action).

Proof

Proof technique: compute the normalized operators on the two Grothendieck groups from the basic categorical commutator, check the mixed relations and local nilpotence, and apply the abstract integrability lemma.

1.1F3algebra

The normalized operators. Projectivity of the cyclotomic bimodules supplies exact functors preserving finite projectives, so the displayed shifts define A-linear operators on the graded Grothendieck groups, where A=Z[q,q−1]. The torus acts on the root component β by Ka=q⟨a,Λ−β⟩, and each Grothendieck element has finite root support.

2.1step 1.1F1algebra

The mixed relation on K0. Let h=⟨hi,Λ−β⟩ at input root β. The Ei in EiFi has output root β, so its normalization contributes qi1−h. The Ei in FiEi has output root β−αi, whose coroot label is h+2, so its normalization contributes qi1−(h+2)=qi−1−h. Multiplying the positive basic commutator of [F1] by qi1−h therefore turns its qi−2FibasicEibasic term into precisely the normalized FiEi, and its identity terms into ∑k=0h−1qi1−h+2k=[h]i. For h≤0, the negative basic branch similarly gives FiEi=EiFi+∑k=0−h−1qi−1−h−2kId, whose sum is [−h]i, so the same signed relation follows. Thus EiFi−FiEi=[h]iId=(Ki−Ki−1)/(qi−qi−1) on root β, with Ki=qih; the quantum integer is integral, so no division in the coefficient ring is needed.

3.1step 2.1F2algebra

The unequal-color relation and the module actions. Write hi(β)=⟨hi,Λ−β⟩ and bij=diaij=(αi∣αj) for i≠j. At input root β, the normalization of Ei in EiFj is qi1−hi(β+αj−αi), whereas that in FjEi is qi1−hi(β−αi). Since hi(β+αj−αi)=hi(β−αi)−aij, their ratio is qiaij=qbij. This cancels the basic crossing factor q−bij in [F2], giving the normalized relation EiFj=FjEi. The canonical G0-action has the same shifts and hence the same computations as K0. For the KK G0-action the shift is instead carried by F: its exponent on input root β is 1−hj(β), so the ratio between EiFj and FjEi is qjhj(β−αi)−hj(β)=qjaji=qbij, again cancelling the basic factor. For the KK same-color relation, EiFi has shift qi1−h and FiEi has shift qi−1−h, exactly as in step 2.1. Both module actions therefore satisfy the required mixed relations; restriction lowers root height and the weight labels give the toral conjugation relations.

4.1step 2.1step 3.1F3∎

Local nilpotence and integrability. By [F3], RΛ(β+nαi)=0 for n large, so the induction operator Fi is locally nilpotent componentwise; restriction lowers height, so Ei is locally nilpotent as well. The toral conjugation, mixed relations and local nilpotence are exactly the hypotheses of the abstract lemma [F3], which then proves both full symmetrizable Serre families and equips the scalar extension to Q(q) with the unique integrable type-one Uq(g)-module structure. No finite-dimensionality of full weight spaces and no ungraded monic deformation is asserted; no cyclic input from vacuum generation or the integral highest-module identification is used.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The word-mirror involution of a KLR algebra and the quantum star

Statement

On the generic graded KLR algebra define ρ(e(ν))=e(rev⁡ν), ρ(xa)=xn+1−a, ρ(τa)=−τn−a. This is a degree-preserving ALGEBRA AUTOMORPHISM with ρ2=1, commuting with the generator-fixing anti-involution ψ. It maps e(ν)Re(η) to e(rev⁡ν)Re(rev⁡η). Twisting LEFT modules by a⋅m=ρ(a)m is an equivalence and commutes with finite vector duality and projective Hom duality. Its separated-block formula is ρ∗Ind⁡(M,N)≅Ind⁡(ρ∗N,ρ∗M), without a shift. Under γ:UA−→K0(R) it induces the quantum multiplication-reversing star, fixing every Fi and q. The first cyclotomic generator maps to aν1(xn)e(rev⁡ν), with the SAME original first color. Thus it identifies the first- and last-strand quotients; preservation of the first ideal itself is not asserted in general.

Facts & Assumptions

[F1]

The relations (1)-(7) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum with Qij(u,v)=Qji(v,u) (Q2), the equal-color mixed relations with their two opposite constants and the braid defect with the global sign.

[F2]

The KLR PBW/PBW-basis and divided-power conventions of Nil-Hecke idempotents and divided-power KLR projectives; the negative-half categorification γ:UA−→K0(R) of The KLR category categorifies the negative quantum half, under which the word projective of ν represents Fν1⋯Fνn; the Cartan pairing of The KLR Cartan (graded Hom) pairing on the projective Grothendieck group.

[F3]

The graded bimodule and shift conventions of Associative graded algebras, bimodules, and internal shifts; the cyclotomic first-strand quotient of The cyclotomic KLR quotient at a dominant integral weight.

Proof

technique · check the mirrored generators against the full KLR presentation relation by relation, verify the involution and duality compatibility, and read the induced Grothendieck action as the quantum star
1.1F1F3

Relation check. Assign to each generator its mirror image ρ; the idempotents map to idempotents, dots to dots with reversed positions, and crossings to minus crossings with reversed positions, all of the same degrees because dot colors are mirrored and bij=bji. The quadratic relation uses (Q2): Qij(u,v)=Qji(v,u), and the two crossing signs cancel in the square, so ρ(τa2−Qνaνa+1)=0. The two mixed equal-color constants exchange under reversal and the crossing minus corrects their sign; the three-crossing braid words exchange positions, and their odd crossing sign together with the reversal of numerator and denominator gives the actual native divided-braid correction. Far commutativity, dot commutativity and the dot slides map to the same relations with mirrored indices, and applying ρ twice fixes every generator, so ρ is a degree-preserving algebra automorphism with ρ2=1; since the generator-fixing anti-involution ψ fixes all generators and reverses multiplication while ρ is a homomorphism, ρψ=ψρ.

2.1step 1.1F2F3

Module twist and dualities. Twisting left modules by a⋅m=ρ(a)m is an equivalence of graded module categories, since ρ is an automorphism. Finite vector duality M↦M∗ satisfies (M∗)∗=M and the twist commutes with it because the dual action is built from ρ(a) applied to the same finite-dimensional spaces; projective Hom duality P↦HOM⁡B(P,B) likewise commutes, as the evaluation pairings are preserved. The separated-block formula is ρ∗Ind⁡(M,N)≅Ind⁡(ρ∗N,ρ∗M) without a shift: reflecting the block embedding exchanges the β and γ blocks and the tensor-factor flip gives the reflected induced module, with the same degrees because the reflection uses the equal-degree assignment.

3.1step 2.1F2

The induced quantum star. Under the categorification γ of [F2] the word projective of ν represents Fν1⋯Fνn, so the reflection equivalence acts on K0(R) by reversing the order of multiplication of the divided generators and fixing each Fi and q; this is exactly the quantum multiplication-reversing star anti-automorphism ∗.

4.1step 1.1F3∎

The cyclotomic generator. Applying ρ to the first-strand cyclotomic generator aν1(x1)e(ν) gives aν1(xn)e(rev⁡ν), with the SAME original first color, so ρ identifies the first-strand and last-strand cyclotomic quotients; preservation of the first ideal itself is not asserted in general, since a monic polynomial in the first dot is moved to the last dot unless the polynomial is constant. All computations are finite and choice-free.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Cyclotomic projective covers and dualities descend through the quotient

Statement

Let A=R(β) and B=A/J be the standard homogeneous cyclotomic quotient. For an indecomposable finite graded projective generic cover P(S), B⊗AP(S) is its same-head indecomposable B-cover if JS=0, and is zero otherwise. Every graded simple/indecomposable projective B-orbit arises this way, and distinct surviving heads do not merge. Finite projective Hom duality commutes with this base change, and finite vector duality commutes with inflation. Thus generic normalized #-self-dual covers and Dψ-self-dual simples supply unique normalized B-covers/simples. For these labels h(P,S)=gdim⁡HOM⁡B(P,S) and T(P,S)=gdim⁡(Pψ⊗BS) are both δP,S; T is bilinear and h first-bar sesquilinear. Extension induces a surjection on projective K0. No Frobenius, geometric basis or cyclotomic crystal premise is used.

Facts & Assumptions

Given: The generic KLR algebra A=R(β) for a real symmetrizable Cartan datum, a homogeneous ψ-stable ideal J (the standard cyclotomic ideal of The cyclotomic KLR quotient at a dominant integral weight), and B=A/J.

[F1]

A has the Krull-Schmidt property, finite graded simples are absolutely simple with endomorphism ring k, every simple has a finitely generated projective cover, and the local endomorphism ring of an indecomposable projective is local (Graded Krull-Schmidt and shift-orbit bases for finitely generated KLR modules, Maximal KLR tails give a unique induction head and absolute simple modules).

[F2]

The normalized #-self-dual divided-power covers and their positive divided-string leading terms, with the choice-free finite-module normalization clauses only (Self-dual KLR projectives have positive first-block divided-string leading terms, Nil-Hecke idempotents and divided-power KLR projectives).

[F3]

The dot-annihilator lemma (Cyclotomic dot annihilators, finite-dimensional blocks, and finite root strings) supplies finite dimensionality of B-blocks, hence every nonzero finite B-module has a simple quotient; the Cartan pairing conventions are The KLR Cartan (graded Hom) pairing on the projective Grothendieck group.

Proof

technique · apply the quotient adjunction to projective covers, control indecomposability through the local degree-zero endomorphism rings, then compare the two dualities and the two pairing forms
1.1F1F3

Base change of projectives and covers. A finite graded projective P is a retract of a finite sum of shifted copies of A, so B⊗AP is a retract of a finite sum of shifted copies of B: it is finite graded projective. The quotient adjunction identifies Hom⁡A(P,B⊗AP′)=Hom⁡B(B⊗AP,B⊗AP′), and every degree-zero endomorphism of B⊗AP lifts through the canonical map P→B⊗AP; endomorphisms preserve JP, so the induced map End⁡A0(P)→End⁡B0(B⊗AP) is a surjective ring homomorphism. If P is indecomposable, its finite-dimensional local degree-zero endomorphism ring has no nontrivial idempotent, so a nonzero quotient has none either: B⊗AP is zero or indecomposable. If JS=0, the old cover map factors through P/JP and remains essential (a submodule of B⊗AP mapping onto S pulls back to a submodule of P mapping onto S; essentiality of the old cover makes it all of P), so B⊗AP is the projective cover of S with the same head. If JS≠0 and B⊗AP≠0, finite dimension [F3] supplies a simple quotient, which must be the unique head S; as a B-module that quotient is annihilated by J, forcing JS=0 and contradicting the assumption, so B⊗AP=0.

2.1step 1.1F1

Every B-orbit arises and heads do not merge. Every simple B-module is a simple A-module by inflation, and its descended cover B⊗AP(S) is a nonzero cover, so every B-simple/projective orbit arises this way. Distinct surviving heads remain distinct after quotienting because an isomorphism of the descended covers induces an isomorphism of their simple heads as B-modules, hence also as A-modules after inflation; hence the surviving projective-cover shift orbits cannot merge, and extension of scalars is surjective on projective K0.

3.1step 2.1F2

Dualities. For finite P, evaluation on shifted free modules and restriction to retracts identifies HOM⁡B(B⊗AP,B)=HOM⁡A(P,A)⊗AB, and applying the generator-fixing anti-involution ψ gives (B⊗AP)#=B⊗AP#. Inflation does not change the finite vector duality Dψ of a simple, since the underlying vector space and the ψ-action are unchanged. The choice-free normalization clauses of [F2] therefore carry the unique #-self-dual generic covers and Dψ-self-dual simples to unique normalized B-covers and simples.

4.1step 2.1step 3.1F2∎

The two pairings. For normalized labels, h(P,S)=gdim⁡HOM⁡B(P,S)=qa in a single shift a because End⁡(S)=k absolutely, while distinct heads give zero; assigning the simple's shift makes h=δP,S. Similarly T(P,S)=gdim⁡(Pψ⊗BS)=δP,S by finite-projective evaluation and D(Pψ⊗S)=HOM⁡B(P,DψS) for evaluation of a tensor functional; T is bilinear in the two arguments and h(P,M)=T(P#,M) is first-bar sesquilinear. Extension of scalars induces the surjection on projective K0 by step 2.1. No Frobenius, geometric basis or cyclotomic crystal statement is used.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Canonical elementary crystal extraction and highest-weight survivors

Statement

For every real symmetrizable Cartan datum, the canonical negative-half crystal has strict elementary embeddings Ψi(b)=bˉ⊗bi(−ci(b)), where ci(b)=ϵi(∗b), bˉ=(ei∗)ci(b)b, ci(bˉ)=0, and every nonvacuum vertex has positive extraction for some i. The negative-half reversal ∗ permutes B(∞) without signs; this unsigned conclusion is proved from the existing signed lattice theorem and positive highest-weight tensor residues, not assumed. The survivors of πλ are exactly ci(b)≤λi for all i; with weight λ+wt⁡(b), inherited raising and surviving lowering, and ϵ/φ, they are B(λ). Any two lowering-generated, everywhere-lowerable negative crystals with strict nonpositive elementary extractions and positive extraction at every nonvacuum vertex are uniquely isomorphic by their lowering words; the proof uses finite color cycles and terminates after a height bound. Consequently for any field and any general homogeneous nondegenerate Q of the first two lemmas, the shift-orbit simple-module crystal is canonically B(∞), its first-strand cyclotomic simple graph is B(λ), and the graph labeled by indecomposable projective COVERS P(S) is the same graph under the unscaled cover--simple pairing. Projective crystal operators here mean operators transported on cover labels; no arbitrary #-dual-of-simple identification, generic global-basis theorem, or independent linear Kashiwara action on the projective class is used.

Facts & Assumptions

Given: A real symmetrizable Cartan datum, its negative quantum half and the canonical external data listed in the dependencies.

[F3]

The categorified simplicity inputs (One-step simple restriction and induction, and the first-dot index, The two-colour jump formula and strict elementary embeddings, Finite-support regularization of quantum label-weight modules): the shift-orbit simple-module crystal with its socle/head operators, the survival criterion and the strict embeddings. The unscaled same-head cover pairing is supplied by Cyclotomic projective covers and dualities descend through the quotient.

[F4]

The coproduct of The Drinfeld–Jimbo formulas define a Hopf algebra is ΔFj=Fj⊗1+Kj⊗Fj, with KiFjKi−1=qi−aijFj. The auxiliary realization of Finite-support regularization of quantum label-weight modules supplies integral fundamental weights while preserving the negative-half relations, lattices, operators and all finite word computations.

[F5]

The elementary crystal Bi={bi(n):n∈Z} has weight nαi, εi=−n, φi=n, eibi(n)=bi(n+1) and fibi(n)=bi(n−1); for j≠i its εj,φj are −∞ and its j-operators are zero. On abstract crystals use εj(x⊗y)=max⁡(εj(x),εj(y)−⟨hj,wt(x)⟩) and φj(x⊗y)=max⁡(φj(y),φj(x)+⟨hj,wt(y)⟩), with ej acting on the first factor when φj(x)≥εj(y) and on the second otherwise, and fj using the strict inequality >. These definitions apply to the elementary factors without an integrability hypothesis; their max formulas give associative tensor products and show that tensoring a strict injection with an identity is strict and injective.

Proof

Proof technique: lift the right-string decomposition of the negative half to lattice components, read the strict elementary embeddings off the top residue, identify the survivors of the highest-weight projection, and use the lattice comparison to identify the categorified simple graph.

1.1F1algebra

The correctly oriented signed right-string decomposition. Put ei∗=∗e~i∗, fi∗=∗f~i∗ and Pi∗=∗Pi∗, where Pi is the left-string projector of [F1]. Applying the anti-involution to the unique left decomposition of ∗u gives u=∑n≥0vnFi(n), with vn∈ker⁡(∗ei′∗) and vn=qin(n−1)/2Pi∗(∗ei′∗)nu. In particular the divided powers are on the RIGHT. If Tn=(ei∗)nu, shifting this right decomposition gives vn=Tn−fi∗Tn+1; all these coefficients lie in the crystal lattice because the signed lattice theorem makes ei∗,fi∗ lattice-preserving. On its residue ei∗,fi∗ preserve the SIGNED crystal set and are partial inverses. For a residue b, let c=max⁡{n:(ei∗)nb≠0}, finite by root height. Then for n<c the residue of vn is zero by the partial-inverse identity, for n=c it is (ei∗)cb, and for n>c it is zero. Thus precisely one right-string coefficient has nonzero residue, and that top residue is a signed basis vector. This proves oriented extraction and signed uniqueness; it does not determine the sign of the extracted residue or prove the unsigned-star assertion.

2.1step 1.1F1F2algebra

Signed adaptation already determines the kernel. This calculation precedes the unsigned conclusion. By balanced uniqueness, the signed reversal of a global lift is the global lift of its signed residue. Reversing the adapted LEFT-string global basis therefore makes the saturated RIGHT ideal Uq−Fis the span of the global vectors whose signed right depth in step 1.1 is at least s; the signs do not change that span. The exact based kernel of [F2] is the sum of these right ideals at s=λi+1. A sum of subspaces spanned by subsets of one basis is spanned by the union of those subsets. Consequently πλ(b)≠0 precisely when every signed right depth satisfies ci(b)≤λi, without presupposing unsigned star or elementary strictness. In particular, when λi=0 and the other coordinates exceed a fixed height bound, projection is a bijection from the positive vertices of that bound with ci=0 to the corresponding highest-module vertices. For a surviving vertex, raising preserves survival: if ejb≠0 then fjejb=b, and lowering compatibility forces πλ(ejb)≠0. Thus projection preserves every raising depth on survivors.

2.2step 1.1F1F2F4algebra

Exact tensor coefficient comparison. Put Di=∗ei′∗. Write the part of Δu whose second factor has degree −nαi as Cn(u)Kin⊗Fi(n). The coefficient is Cn(u)=qin(n−1)/2Dinu. Indeed appending Fj to a word gives Cn(uFj)=qi−naijCn(u)Fj+δij[n]iCn−1(u), with C0(u)=u and Cn(1)=0 for n>0. The right Leibniz rule gives Di(uFj)=qi−aijDi(u)Fj+δiju; iterating it gives the same recurrence for qin(n−1)/2Din, since 1+qi−2+⋯+qi−2(n−1)=qi−(n−1)[n]i. This proves the formula on words and by linearity on the Serre quotient. Hence if Div=0 the only pure-i second component of Δv is v⊗1. Also ΔFi(r)=∑s=0rqi−s(r−s)Fi(r−s)Kis⊗Fi(s), by expanding the two qi−2-commuting summands of [F4]. Choose auxiliary dominant weights with λi=0, λj arbitrarily large for j≠i, μ=mΛi and m arbitrarily large. For the right decomposition u=∑rvrFi(r) of step 1.1, project Φλ,μπλ+μ(u)=Δu(vλ⊗vμ) onto the direct sum of second-factor weights μ−rαi. Since Fivλ=0, the terms s<r vanish and Kirvλ=vλ. The resulting exact field-vector identity is ∑rπλ(vr)⊗Fi(r)vμ. No unsigned-star assertion has entered this coefficient computation.

3.1step 1.1step 2.1step 2.2F2F4algebra

Positivity of the extracted coefficient. Fix a height bound H and take m>H and the other λj large enough that λ+μ projects isomorphically in degrees of height at most H, while φj(x)>H for every first-factor vertex x of those degrees and j≠i. The tensor map is lattice-preserving by the grand loop and commutes with the module string operators. Its image of a positive negative-half lowering word is therefore a positive tensor-basis vertex: start at vλ⊗vμ and apply the same lowering word, using [F2]. It is nonzero because the reverse tensor map is lattice-preserving and their composite is the identity. Throughout these bounded words the second factor stays on its pure-i string. In fact for j≠i that factor has εj=0 (as EjFi(n)vμ=0), and the large first-factor φj selects the first tensor branch; the i-operator either acts on the first factor or advances that pure-i string. Now take a lattice lift u of a positive vertex b. Step 1.1 gives exactly one nonzero coefficient residue, at c=ci(b), equal to a signed vertex bˉ with ci(bˉ)=0. By step 2.1 its projection πλ(bˉ) is nonzero. The direct second-weight projection preserves the tensor lattice, so the identity of step 2.2 gives the tensor residue πλ(bˉ)⊗ficvμ. Its positivity forces bˉ to be positive, since the positive residue projection is a bijection on the ci=0 survivors and a negative residue projects to its negative. Thus the actual extraction of every positive vertex has a positive first component.

4.1step 2.1step 3.1F2F4F5algebra

Strictness in both branches and every color. Define Ψi(b)=bˉ⊗bi(−c) using the elementary crystal and abstract tensor conventions of [F5]. It is injective because signed partial inverses recover b=(fi∗)cbˉ. To check an operator, enlarge the finite height bound to include the vertex and its one-step neighbors and use the same λ,μ throughout. Step 3.1 identifies the positive tensor lift with πλ(bˉ)⊗ficvμ. Projection preserves raising depths on survivors by step 2.1, so εi(πλbˉ)=εi(bˉ) and, since λi=0, φi(πλbˉ)=φi(bˉ). The second factor has εi=c. The finite tensor rule therefore sends ei to the first factor if φi(bˉ)≥c, and to the second if φi(bˉ)<c; it sends fi to the first if φi(bˉ)>c, and to the second if φi(bˉ)≤c. These are exactly the two elementary branches, including their different equality choices. For j≠i the large first-factor φj selects the first factor for both operators; the elementary factor, with εj=φj=−∞, selects that same factor. Applying step 3.1 to the resulting neighbor and using uniqueness of the surviving first-factor lift identifies its actual extraction with this computed tensor result. If the first-factor raising is zero, both calculations give zero; lowering has no end in the half, and m>H avoids the finite second-factor end. The finite tensor max formula gives εi(b)=max⁡(εi(bˉ),c−⟨hi,wt(bˉ)⟩) and εj(b)=εj(bˉ) for j≠i, because the large λj suppress the second term there. Subtracting the auxiliary highest weights gives the elementary weight formula, and φ=ε+⟨h,wt⟩ gives all φ identities. Thus Ψi is an actual strict positive elementary embedding in every color, using only integrable tensor crystals for the finite calculation.

5.1step 1.1step 3.1step 4.1F1F2F4algebra

Unsigned star and positive extraction. For each positive b, the signed partial inverse gives (ei∗)cb=bˉ>0 and b=(fi∗)cbˉ. Applying signed extraction to each intermediate (ei∗)rb gives the same positive top component bˉ and position c−r. A negative intermediate residue would instead have a negative top component by linearity and step 3.1, so every intermediate is positive. Likewise, for a positive right-primitive vertex a and n≥0, the signed vertex (fi∗)na has top coefficient a and depth n, and cannot be negative because the extraction of a negative vertex has negative top coefficient. Thus the right operators preserve the positive crystal wherever nonzero. Every nonvacuum b has some ci(b)>0: its signed reversal has the same positive height, and its underlying positive vertex is a nonempty lowering word, hence has a nonzero raising in some color. Now induct on height. The vacuum is star-fixed; choose i with c=ci(b)>0. Its positive extracted bˉ has smaller height, so ∗bˉ is positive by induction. Reversing b=(fi∗)cbˉ gives ∗b=fic(∗bˉ), which is positive. Involutivity proves ∗B(∞)=B(∞) without signs, and the previously defined signed depth is now exactly εi(∗b). All auxiliary computations involved only finitely many degrees and colors and preserve the original negative half, so the conclusions hold for the original real symmetrizable datum.

6.1step 2.1step 5.1F1F2

Survivors of the highest-weight projection. The projection πλ kills exactly the negative-half crystal vertices with ci(b)>λi for some i, by the signed adapted-kernel computation of step 2.1 and the unsigned conclusion of step 5.1. This is a consequence of the actual sum of based right ideals, not a presupposed elementary embedding or survivor comparison. The crystal-lattice comparison of [F2] makes the projection commute with the crystal operators modulo q. The survivors therefore carry weight λ+wt⁡(b) with inherited raising and surviving lowering operators and the induced ϵ/φ; the grand-loop and tensor-product theorems of [F2] identify the resulting crystal with B(λ).

6.2step 4.1step 5.1F5algebraconstruct

Recognition once strict positive extractions exist. The canonical extractions have been constructed in steps 2.2–5.1; we now prove the abstract comparison used also by the categorical graph. By the abstract tensor definitions of [F5], let C,C′ be the negative crystals in the Statement, with unique weight-zero vacuums and extractions x↦x′⊗bi(−ci(x)), so wt(x′)=wt(x)+ci(x)αi. First, zero extraction fixes the first factor. Indeed the vacuum maps to u⊗bi(0) by nonpositive weights and uniqueness of weight zero. Induct on height and write x=fjy. If the last position of Ψi(x) is zero, the tensor lowering rule and nonpositive last positions imply that Ψi(y) also has last position zero and fj acted on its first factor: the second branch, possible only for j=i, strictly decreases that last position. By induction its first factor is y, so the new first factor is fjy=x. This proves the claim without an extra identity hypothesis on zero extractions. Fix a finite set I0 supporting the weights of two lowering words under comparison and cycle through all its colors H times, where H is their maximum height. Apply each successive extraction to the first factor. Its height never increases; during a whole cycle either it is already the vacuum or at least one extraction is positive: if none is positive the first factor stays fixed and has all its extractions zero, contradicting the nonvacuum hypothesis. Colors outside I0 have zero extraction because the first factor's weight stays in −Q+,I0. Hence after H cycles every vertex of height at most H maps injectively into {u}⊗BiN⊗⋯⊗Bi1. The resulting composite remains strict on the whole crystal, and sends its vacuum to u⊗biN(0)⊗⋯⊗bi1(0). Consequently the image of a lowering word is computed by applying that same word to this common tensor vacuum, for both C and C′. If two words agree in C, their tensor images agree, so injectivity forces agreement in C′; the reverse follows identically. Matching lowering words therefore defines inverse strict isomorphisms, independent of paths. This finite argument proves recognition conditional on the stated strict positive extraction hypotheses, without using height termination alone as a substitute for path independence.

7.1step 6.1step 6.2F3

The categorified graph. For any field and any general homogeneous nondegenerate Q satisfying the hypotheses of the two one-step lemmas of [F3], the shift-orbit simple-module graph is lowering-generated with strict elementary extractions by [F3]; step 6.2 identifies it canonically with B(∞). In a first-strand cyclotomic quotient the surviving simple graph is exactly the survivor set of step 6.1, hence is B(λ); the graph labeled by indecomposable projective covers P(S) is the same graph under the unscaled cover--simple pairing of the cover-descent lemma, since the pairing matches each cover label with its simple head without rescaling. Operators on cover labels are transported from the simple graph; no arbitrary #-dual-of-simple identification and no general global-basis theorem is used.

8.1step 1.1step 6.1F1F2∎

Choice bookkeeping. The argument is a chain of the inherited suppliers [F1] and [F2]; the Axiom of Choice is inherited through the grand-loop crystal-basis and highest-weight projection contracts used for the signed based kernel, positive tensor residues and survivor comparison in steps 2.1–6.1. No additional infinite choice is made in the right-string, finite auxiliary tensor, height and word computations of steps 1.1–5.1 and 7.1.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The vacuum projective is a highest-weight generator

Statement

For the standard graded quotient, 1Λ=[k]∈K0(RΛ(0)) is a nonzero highest-weight vector of weight Λ for the normalized action. Every finite projective is a finite retract of a sum of shifted word projectives Pν=RΛ(β)e(ν), and [Pν]=Fνn⋯Fν11Λ for right append. The stronger integral generation statement is by DIVIDED words: the classes Fir(ar)⋯Fi1(a1)1Λ span K0(RΛ) over A. Thus UA−1Λ=K0(RΛ). The retract statement alone is not claimed to make ordinary word classes an A-spanning set.

Facts & Assumptions

Given: The standard cyclotomic quotient RΛ and the normalized action of Normalized cyclotomic functors give an integrable quantum action.

[F1]

The rank-zero algebra is RΛ(0)=k and restriction from root zero has zero target, so the vacuum class is nonzero and killed by every Ei; its weight is Λ (The cyclotomic KLR quotient at a dominant integral weight, Cyclotomic KLR induction and restriction functors).

[F2]

The finitely many word idempotents sum to the unit of each finite root block, and every finite projective is a retract of finitely many shifted copies of their principal projectives; the append bimodule sends the word ν to νi, so composition acts from the rightmost functor first (Nil-Hecke idempotents and divided-power KLR projectives).

[F3]

The quotient-cover lemma (Cyclotomic projective covers and dualities descend through the quotient) says every cyclotomic indecomposable cover is the extension of its normalized generic cover, so extension of scalars is surjective on split K0; the generic negative-half categorification (The KLR category categorifies the negative quantum half) identifies generic K0 with UA−, generated as an A-module by products of the actual divided-power projectives.

Proof

technique · check the vacuum's highest-weight property directly, realise every finite projective as a retract of word projectives, and transfer divided generation from the generic negative half through the quotient
1.1F1

The vacuum is a nonzero highest-weight vector. The rank-zero block is RΛ(0)=k, so 1Λ=[k] is nonzero; restriction from root zero has zero target, so Ei1Λ=0 for every i; and the torus acts on the root-zero component by q⟨a,Λ⟩, so its weight is Λ.

2.1step 1.1F2

Word projectives and retracts. The finitely many word idempotents of a root block sum to its unit, so the regular module is the sum of the corresponding word projectives and every finite projective is a retract of a finite sum of shifted copies. The append bimodule sends the word ν to νi, and since operators in a composite act from right to left, [Pν]=Fνn⋯Fν11Λ. This is a statement about retracts of ordinary word projectives; it does not by itself make ordinary word classes an A-spanning set.

3.1step 2.1F3∎

Divided generation. The quotient-cover lemma [F3] makes extension of scalars surjective on split K0, so it suffices to generate the generic K0 by extensions of divided words. The generic negative-half categorification identifies generic K0 with UA− and its divided-power projectives with the divided generators; their extensions are the cyclotomic divided functors applied to the vacuum, so the classes Fir(ar)⋯Fi1(a1)1Λ span K0(RΛ) over A. This does not divide by a quantum factorial: Fia=[a]qi!Fi(a) has a generally nonunit coefficient, which is exactly why the stronger generation statement must use divided words. Combining this generation with the independent normalized-action result of Normalized cyclotomic functors give an integrable quantum action gives UA−1Λ=K0(RΛ) without a circular appeal to the integral highest-weight theorem.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Cyclotomic KLR functors define an integrable quantum action on K0 and G0

Statement

For the STANDARD graded cyclotomic quotient over any field and any real symmetrizable Cartan datum with admissible graded KLR parameters, put A=Z[q,q−1], hi(β)=⟨hi,Λ−β⟩, and qi=qdi. On projective K0 use Fi=Fibasic and Ei∣β=qi−1−hi(β)Eibasic; on module G0 use either the SAME canonical normalization, or the Kang--Kashiwara normalization EiKK=Eibasic, FiKK∣β=qi1−hi(β)Fibasic. In all cases Ki∣β=qihi(β). These operators satisfy the full quantum mixed and Serre relations and are locally nilpotent; their scalar extensions to Q(q) are integrable weight modules. No decomposition into finite-dimensional full-g submodules is asserted in affine or indefinite type.

The tensor pairing Tβ(P,M)=gdim⁡(Pψ⊗RΛ(β)M) is A-BILINEAR and weightwise perfect in normalized projective-cover/simple bases. The Hom pairing h(P,M)=gdim⁡HOM⁡(P,M) instead satisfies h(P,M)=T(P#,M) and is first-bar-sesquilinear. For T, projective Ei is adjoint to module FiKK and projective Fi to module EiKK. The two module actions are conjugate by the weight rescaling qdef⁡Λ(β), where def⁡Λ(β)=(Λ,β)−(β,β)/2.

Facts & Assumptions

Given: The standard cyclotomic quotient RΛ, its graded Grothendieck groups and Cartan map (Graded Grothendieck groups, shift action, and Cartan map), and the normalized-action lemma Normalized cyclotomic functors give an integrable quantum action.

[F1]

The normalized operators displayed in the Statement on both Grothendieck groups satisfy the mixed relations and the full symmetrizable Serre families, with local nilpotence and torus action Ki∣β=qihi(β) (Normalized cyclotomic functors give an integrable quantum action).

[F2]

The tensor and Hom pairings and the normalized cover/simple bases (Cyclotomic projective covers and dualities descend through the quotient); the Cartan pairing conventions of The KLR Cartan (graded Hom) pairing on the projective Grothendieck group.

[F3]

The basic functors and their adjunctions (Cyclotomic KLR induction and restriction functors).

Proof

Proof technique: combine the two normalizations, verify the pairings and the adjointness by corner tensor evaluation, and compare the two module actions by the defect rescaling.

1.1F1

The two normalizations agree with the actions. The normalized-action supplier [F1] gives, for Ei applied to input root β+αi, the exponent −1−hi(β+αi)=1−hi(β), exactly the target-weight normalization; the same computation with the factor on F gives the Kang--Kashiwara normalization. Both satisfy the mixed relations, the full Serre families and local nilpotence, and Ki∣β=qihi(β) in all cases; hence all four displayed operator families are integrable weight module structures after scalar extension to Q(q), with no assertion of finite-dimensional full-g submodules in affine or indefinite type.

2.1step 1.1F2

Bilinearity and perfectness of T. Tensor products of finite modules are finite, so T has Laurent-polynomial values. The quotient-cover lemma [F2] gives absolutely simple normalized heads and T(P(S),S′)=δS,S′, proving weightwise perfectness in normalized bases; shifting either tensor factor multiplies by the same power of q, which is exactly A-bilinearity. Finite-projective evaluation identifies HOM⁡(P,M) with (P#)ψ⊗M, so h(P,M)=T(P#,M), which is first-bar-sesquilinear rather than bilinear.

3.1step 2.1F3

Adjointness of the two normalized actions. For the corner Aβ→eBβ+ie, associativity of the balanced tensor over the corner gives TB(FbasicP,M)=TA(P,EbasicM): both sides are the dimension of the same balanced tensor. The generator-fixing anti-involution flips balanced tensors, so TB(P,FbasicM)=TA(EbasicP,M) as well, the corner factors becoming eB and Be in opposite order with multiplication giving the evaluation isomorphism. Multiplying the second identity by qi1−hi(β) gives the first normalized adjoint statement, and the first identity gives the other; neither the Frobenius theorem nor the highest-weight K0 theorem is used.

4.1step 1.1step 3.1F1∎

The defect rescaling. Adding an i changes the defect by di(hi(β)−1), so the two module actions of step 1.1 are conjugate by the weight rescaling qdef⁡Λ(β) with def⁡Λ(β)=(Λ,β)−(β,β)/2; the same computation applies on projective K0 with the roles of E and F exchanged. Hence the canonical and Kang--Kashiwara normalizations define the same quantum structure up to the stated conjugation, completing the proof.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The cyclotomic projective K0 is the integral highest-weight module

Statement

Assume the Axiom of Choice The Axiom of Choice. For the standard homogeneous graded quotient over any field, with arbitrary real symmetrizable Cartan datum and admissible graded KLR parameters, there is a unique UA-module isomorphism ϕ:K0(Proj RΛ)→VA(Λ) sending 1Λ to vΛ and intertwining all normalized Ei,Fi,Ki and divided powers. In particular K0 is free over A. On the NEGATIVE half the vacuum map has exact kernel ker⁡(UA−→K0(RΛ))=∑i∈I∑s>λiUA−Fi(s). This is the integral negative-half presentation; neither a full-UA quotient by only Fi(λi+1) nor invertibility of divided-power factorials is asserted. For projectives, the tensor form T(P,Q)=gdim(Pψ⊗Q) transports to the highest-weight contravariant form normalized by (vΛ,vΛ)=1 and σ(Fi)=qi−1KiEi, σ(Ei)=qiFiKi−1, σ(Ki)=Ki. It is not the generic negative-half Lusztig form with a newly alleged radical.

Facts & Assumptions

Given: The standard homogeneous cyclotomic quotient over an arbitrary degree-zero field, the real symmetrizable Cartan datum, admissible graded parameters, A=Z[q,q−1], and the normalized projective operators. Write λi=⟨hi,Λ⟩.

[F1]

The vacuum is nonzero, of weight Λ, and killed by all Ei. Divided words generate its projective K0 over A, by extension of generic normalized covers and the actual divided-power idempotents; ordinary-word retracts alone do not prove integral generation (The vacuum projective is a highest-weight generator).

[F2]

The normalized operators satisfy the full mixed and Serre relations and are locally nilpotent, for every stated field and graded parameter datum. The basic corner tensor identities and A-bilinear pairing are proved in Cyclotomic KLR functors define an integrable quantum action on K0 and G0.

[F3]

The standard pure-i quotient imposes x1λi=0. Its divided-power idempotent is x1s−1x2s−2⋯xs−1∂w0 and its generator-fixing anti-involution image, as supplied by Nil-Hecke idempotents and divided-power KLR projectives. The actual integral projection has kernel ∑i∑s>λiUA−Fi(s), and VA(Λ) is its lattice in V(Λ) (The based quotient: projection of the lower global basis to a highest weight module, The integral residue lattices LA(∞) and LA(λ)). Every nonzero integrable cyclic highest-weight module over Q(q) is the simple V(Λ) (The integrable quantum highest weight module exists and is unique).

[F4]

Projective Hom duality and finite simple duality are distinct. Normalized cover/simple classes give free shift-orbit bases, and the generator-fixing anti-involution flips tensor factors (Cyclotomic projective covers and dualities descend through the quotient, The KLR Cartan (graded Hom) pairing on the projective Grothendieck group). The normalized highest-weight contravariant form is unique, for the linear anti-involution σ(Fi)=qi−1KiEi, σ(Ei)=qiFiKi−1, σ(Kh)=Kh (The contravariant form on an integrable highest weight module).

[F5]

For nonnegative upper index the Gaussian binomials are Laurent polynomials in qi with integer coefficients (The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality, part (iv)).

Proof

technique · factor the divided vacuum map through the exact integral highest-weight presentation, prove it is an isomorphism by rational simplicity and the torsion-free source lattice, and identify the tensor form by its actual corner adjunction and normalization

Given: The data of F1–F4, with AC inherited through the declared generic and quantum highest-weight suppliers.

1.1F1F3constructalgebra

By F1 the map UA−→K0(RΛ), u↦u1Λ, is surjective. For every s>λi, the staircase idempotent in F3 is divisible on the left by x1λi, since s−1≥λi, and therefore is zero in the standard quotient. The generator-fixing anti-involution preserves its cyclotomic ideal, so the dual projector defining the divided-power projective is zero as well. Hence Fi(s)1Λ=0 without dividing by a quantum factorial. All translates UA−Fi(s) therefore lie in its kernel. The exact integral projection presentation in F3 gives a well-defined surjective A-linear map f:VA(Λ)→K0(RΛ) sending vΛ to 1Λ and every divided word to the corresponding divided-functor class.

1.2F2F4algebra

The anti-involution identifies Pψ⊗Q with Qψ⊗P by interchanging the factors, so the projective tensor form T is symmetric and A-bilinear. Different root blocks pair by zero. The basic corner identities of F2 give T(FiP,Q)=T(P,EibasicQ) and T(EibasicP,Q)=T(P,FiQ). At input β+αi and output β, put h=⟨hi,Λ−β⟩. Projective Ei=qi1−hEibasic and qi−1KiEi=qih−1Ei=Eibasic on this target. Thus the first identity is T(FiP,Q)=T(P,σ(Fi)Q).

1.3F2F3F4F5algebra

The integral positive operators are defined as well. On n-fold basic restriction the last n equal-color dots and crossings give a nil-Hecke action commuting with the target algebra. Its graded matrix-column decomposition in F3 expresses this restriction as [n]i! shifted copies of an idempotent summand, with the symmetric centering of the polynomial column. Restriction preserves finite projectives by F2, so this summand is finite projective. Multiplying it by the integral grading shift from the n successive Ei normalizations realizes the rational operator Ein/[n]i! on K0; thus it preserves K0 without inverting the factorial in A. Negative divided powers are realized by the analogous induction idempotents of F3. A toral binomial acts on an integral weight by ∏s=1t[m+c−s+1]i/[s]i. For m+c≥0 this is the integral Gaussian binomial (or zero), and for m+c<0 it is (−1)t(−(m+c)+t−1t)i, again integral by The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality. Hence the full UA acts on K0; its relations follow from the rational action because the cover basis in F4 makes K0 torsion-free.

2.1F2F3F4step 1.1algebra

The quotient-cover bases in F4 make K0 free over A; in particular its nonzero vacuum stays nonzero after tensoring with Q(q). By F2 the rationalized target is an integrable cyclic highest-weight module of weight Λ. The universality and ordinary simplicity in F3 identify it with V(Λ) by the unique map preserving the highest vector. This map is the rationalization of f, since both agree on every divided word. Thus f becomes an isomorphism after localization.

3.1F1F3F4step 2.1algebra

An element z∈ker⁡f maps to zero on localization, so some nonzero a∈A kills z. The source VA(Λ) is an actual submodule of the vector space V(Λ) over the fraction field, by F3, and is consequently torsion-free. Hence z=0, proving f injective. Its inverse ϕ is the required integral isomorphism; the original vacuum map has exactly the integral projection kernel in the Statement. The rational isomorphism intertwines all normalized positive, negative and toral operators. Each difference of their integral operator maps has zero localization, and the target K0 is torsion-free by F4, so the equality holds integrally, including the actual divided powers. Uniqueness follows from divided-word generation.

4.1F2F4step 3.1step 1.2algebra

For the second identity, take P at root β+αi and Q at root β. Its normalization yields T(EiP,Q)=qi1−hT(P,FiQ). On Q, qiFiKi−1=qi1−hFi, so this is T(EiP,Q)=T(P,σ(Ei)Q). The torus is scalar on each root component and preserves its label, giving toral contravariance. The vacuum tensor product is k, of norm one. Transported by ϕ, these identities and symmetry give exactly the normalized highest-weight contravariant form; uniqueness in F4 identifies it. This uses the highest-weight form, rather than the generic negative-half form or a supposed new radical of that form.

5.1step 3.1step 4.1F4∎

Steps 1.1, 2.1 and 3.1 prove the unique integral highest-weight isomorphism and its exact divided right-power kernel in the full stated general-field/general-Cartan scope. Steps 1.2 and 4.1 prove the tensor-form assertion. Projective-cover shift orbits give the independent free A-basis, without treating all divided words as a basis or making a quantum factorial invertible. AC is inherited only through the declared generic categorification and quantum highest-weight suppliers; the localization, torsion-free kernel and finite corner computations introduce no further choice.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

The polynomial flag comparison has the prescribed second-mate inverse

Statement

Let p(u) be monic of degree N≥0 over a commutative ring D. Let Lr be the monic factor ring p=crbN−r, where cr is monic of degree r, and put Lr=0 for r<0 or r>N. Put Br=Lr[z]/bN−r(z)=Lr+1[z]/cr+1(z),h=N−2r. Use the native nil-Hecke crossing τ=(1−s)/(X−Y) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, dots of degree 2d, and the matrix idempotent convention of Nil-Hecke idempotents and divided-power KLR projectives. Induction is G(r)=Br{−2dr}⊗Lr−, basic restriction is the reversed Br−1 tensor functor, and normalized restriction at input r is H(r)=Br−1{−d(1+h)}⊗Lr−. The first adjunction uses the coefficient form τnew:Br→Lr+1 extracting zr; the second uses τold:Br→Lr extracting zN−r−1. Units are the trace-dual power-basis Casimirs. Write η:1→HG, ε:GH→1, η′:1→GH, ε′:HG→1 for these maps, at their indicated input weights.

Set P=GH, V=HG at input r. Define the actual native mates, rather than freely adjoined inverses, by T=(HGε)(HτGGH)(ηGH):P→V,S=(GHε′)(GτHHG)(η′HG):V→P, where τHH is the twofold first-adjunction mate of τGG. Put A(t)=thb(t−1)c(t−1),H(t)=A(t)−1,A0=H0=1. Coefficients with negative index are zero. For h≥0, let Ck=xkη and Rk=∑a+j=h−1−kAjε′xa(0≤k<h). Then the actual flag bimodule maps ρ=(−T,C):P⊕Dh→V and σ=(S,R):V→P⊕Dh satisfy −ST=1P,RkT=0,SCk=0,RkCℓ=δkℓ,−TS+∑kCkRk=1V. For h<0, set Ck−=xkη′ and Rk−=∑a+j=−h−1−kHjεxa(0≤k<−h). The maps ρ=(−T,R−):P→V⊕D−h and σ=(S,C−):V⊕D−h→P satisfy −TS=1V,TCk−=0,Rk−S=0,Rk−Cℓ−=δkℓ,−ST+∑kCk−Rk−=1P. Here Dh=⨁k<h1{d(1−h+2k)} and D−h=⨁k<−h1{d(1+h+2k)}. At h=0 both sums are empty.

These maps also give the two typed upward curls Lμ=(Hεμ′)(τHHG)(Hημ),Rμ=(εμH)(GτHH)(ημ′H), where Lμ has input μ and Rμ input μ−αi, with ⟨hi,μ⟩=h. Their formulas are Lμ=∑a+j=−hxaHj,Rμ=−∑a+j=hxaAj. All indices in these sums are nonnegative. Mating the two matrix-completeness equations gives the two opposite-crossing cancellation equations with literal-dot sum a+b+c=−2: the HG boundary uses Ab+h+1, and the GH boundary uses Hb−h+1. Single curls instead have literal-dot sum a+b=−1.

For a symmetrizable datum and distinguished color i, take a dominant integral framing λi≥0 and p(u)=ai(u)∏j≠i∏y∈YjQij(u,y)/tij,tij=[u−aij]Qij(u,y)∈D×. This realizes every r≥0, including both signs of h, with zero modules past N. Appending a color j root uses the quotient and multiplication by Qij, and the mixed mate pair constructed with the first unit/first cap and second unit/second cap has composites tij in both orders. This identifies the actual mixed mates in the distinguished-i flag model. Compatibility with adjunctions for a second distinguished color is a separate assembly question.

Under the nil-Hecke matrix equivalence the first cap is exactly τnew and the normalized relative second cap is exactly τold: the normalization is ε^r=(−1)N+1εr for the ordered-residue relative form defined in the proof. No formal diagram-model realization, categorical commutator, cyclotomic Frobenius theorem, or one-dimensional Hom hypothesis is a premise. Every assertion is an integral polynomial identity, hence survives arbitrary monic specialization. Grading is asserted only when the coefficients are homogeneous in their natural degrees.

Facts & Assumptions

Given: A monic polynomial p, the actual flag bimodules and coefficient adjunctions above, the native nil-Hecke crossing, and, for the mixed-color clauses, a weighted-homogeneous KLR datum and a dominant framing.

[F1]

In The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, the native divided difference is (1−s)/(X−Y), and the source crossing is κ=−τ for every color pair; the dot and crossing degrees are those of The KLR grading and the diagrammatic multiplication.

[F2]

The Artin polynomial module, its perfect longest-divided-difference pairing and its matrix units are proved in the matrix calculation of Nil-Hecke idempotents and divided-power KLR projectives.

Proof

technique · constructive: evaluate the actual cups, crossings and caps on universal root paths, identify both diagonal matrices with polynomial interpolation and monic division, and descend their identities from the generic roots to integral flag bimodules
1.1F2constructalgebra

Work first over S=Z[p1,…,pN] with universal monic p. Its full splitting ring is Z[X1,…,XN], finite free over S on the successive monic Artin basis. The block-invariant ring Lr is a direct summand of this module: multiply by the staircase in each of the two blocks and apply the two longest divided differences; the resulting Lr-linear map fixes Lr by [F2]. Thus Lr is finite projective over S. The same argument with blocks of sizes r,1,N−r−1 applies to Br. Monic division gives its displayed free bases over Lr and Lr+1. Consequently P=Br−1⊗Lr−1Br−1 and V=Br⊗Lr+1Br, with their shifts restored later, are finite projective over S: choose a relative power basis in one tensor factor and use projectivity of the other. They inject into their generic-root scalar extensions. The coefficient pairings are perfect because their power-basis Gram matrices have unit antidiagonal and zero entries below it. For a monic f, their Casimir is Kf(X,Y)=(f(X)−f(Y))/(X−Y), since coefficient extraction in X gives τX(XaKf)=Ya. This proves both triangles by dual-basis contraction and defines all four maps integrally before any localization.

2.1step 1.1algebra

Localize the universal root ring at all root differences. Vertices are now indexed by subsets J of roots of size r. Put c(u)=∏w∈J(u−w) and b(u)=∏z∉J(u−z). A path in P removes w∈J and then adds a root; a path in V adds z∉J and then removes a root. Paths with different initial and final subsets are the single common swap path J→J−w+z. Paths with equal endpoints are the Pw and Vz components. The coefficient trace on a monic root extension is f↦∑ξf(ξ)/f0′(ξ); this is polynomial Lagrange interpolation followed by top-coefficient extraction. Therefore ηz=c(z), εz′=1/b′(z), ηw′=b(w) and εw=1/c′(w). Units and caps have zero components on swap paths because their source or target is the identity bimodule.

2.2step 1.1F2constructalgebra

We verify the claimed Morita normalization independently. Let Ir:Lr→S be the positive parabolic trace: over generic roots it is Ir(f)=∑∣J∣=rf(J)/∏w∈J,z∉J(w−z). This is an integral polynomial map: factor the full monic splitting-tower trace through the two block traces; equivalently apply the normalized parabolic longest divided difference. It is perfect. Indeed, on the block Artin basis the perfect full pairing is the direct sum of copies of the Ir pairing composed with the invertible block Gram matrix; its inverse shows each copy is invertible. The actual nil-Hecke quotient is this matrix algebra: in the power basis of the monic X1 extension, the first column of multiplication by the remainder of p modulo cr contains all remainder coefficients, and every matrix entry belongs to their ideal. Matrix units therefore identify the two-sided ideal (p(X1)) with that coefficient ideal. Monic division identifies its vanishing quotient with Lr. Put Vr for the resulting first-block Artin module, Mr=End⁡Lr(Vr)=NHr/(p(X1)) and tr=srIrTr⁡r,sr=(−1)r(N−r)+r(r−1)/2. The sign is also the ordered-residue sign: in (−1)r(N−r)Res⁡(ΔrX1r−1⋯Xr−1Tr⁡r(−)/∏ap(Xa)), group ordered tuples by subsets; their alternating determinant contributes Δr2, while the internal derivative factors contribute (−1)r(r−1)/2Δr2. Cancellation gives exactly tr, without 1/r!. Define the bilinear relative cap by trεr=tr+1 using the perfect tr pairing. The constant-vector matrix idempotent identifies the induction corner with Br and its dual corner with g↦[v↦τnew(gv)]; matrix evaluation is therefore precisely τnew. On the rank-one operator v↦fτnew(gv), its matrix trace is τnew(gf).

3.1step 2.1F1algebra

Compute the displayed mates on these path components, using the actual crossing (1−s)/(X−Y). On the equal-endpoint components the result is (−T)z,w=c(z)c′(w)(z−w),Sw,z=b(w)b′(z)(w−z). Here the first expression is the cup factor c(z), the no-switch divided-difference entry 1/(w−z) on the ordered additions (w,z) in T, and the first-cap factor 1/c′(w). For S, the twofold first mate reverses the addition path. Its no-switch coefficient on ordered removals (z,w) is 1/(w−z); its switch coefficient, evaluated on the output removal order (z,w), is 1/(z−w). To check this transposition, the composed first-cap weight on the additions (z,w) over a common subset K is 1/[cK(z)cK(w)(w−z)], and the exchanged order has its negative. Their ratio changes the sign of the off-diagonal transposed crossing and leaves the diagonal coefficient unchanged. Thus the second cup in S contributes b(w), its no-switch entry is 1/(w−z), and the second cap contributes 1/b′(z). This is a computation of the defined mate, not a definition of S by the inverse matrix. On a swap path J→J′=J−w+z, the first contraction in T instead has numerator cJ′(w)=(w−z)cJ−w(w) and denominator (w−z)cJ′(w)=(w−z)cJ−w(w), together with the native minus sign; thus T=−1. For the switched second contraction, the complementary factor at J′=J−w+z is bJ′(z)=(z−w)bJc−{z}(z); its second-cap denominator is bJ′(z)=bJc−{z}(z), and its switched upward crossing contributes 1/(z−w). Therefore S=1 on this path. One may check the transposition without notation for diagrams: replace each root delta-vector by its dual vector multiplied by the derivative of its monic root polynomial, apply (1−s)/(X−Y), and contract; the two derivative multipliers are exactly the four factors just displayed. Hence −ST=−TS=1 on every swap component.

4.1step 2.1step 3.1algebra

Write n=N−r=deg⁡b. On the equal-endpoint components U=−T sends values (fw) to the values at z∉J of the unique polynomial F(u) of degree <r with F(w)=fw, because its matrix is c(z)/(c′(w)(z−w)). Similarly S sends (gz) to the values at w∈J of the unique polynomial G(u) of degree <n with G(z)=gz. If h=n−r≥0, then SU=1. Monic division writes G=cq+v uniquely with deg⁡q<h, deg⁡v<r. Thus US is evaluation of v and Cq is evaluation of cq, proving US+CR=1 once the rows R extract the coefficients of q. To identify these rows, expand G(u)b(u)=∑zgzb′(z)(u−z),G(u)c(u)=uhA(u−1)G(u)b(u). The coefficient of uk in the polynomial part of the second expansion is precisely ∑a+j=h−1−kAj∑zgzza/b′(z), which is the prescribed Rk. Therefore RU=0, SC=0, RC=1 and US+CR=1, as well as SU=1. These prove all five positive-branch equations, including the prescribed inverse rather than an unspecified polynomial section. At h=0 monic division has no quotient, and U,S are mutually inverse.

5.1step 1.1step 3.1step 4.1algebra

If h<0, interchange c and b in the preceding division. Interpolate the P values by F of degree <r, and write F=bq+v with deg⁡q<−h, deg⁡v<n. Now US=1 on V, SU is evaluation of v on P, and C−q is evaluation of bq. Expanding F/b=u−hH(u−1)F/c identifies the coefficient rows of q with Rk− exactly. Hence UC−=0, R−S=0, R−C−=1 and SU+C−R−=1. With U=−T these are the five asserted negative-branch equations. This proof includes r=0, r=N and N=0 by empty interpolation sets; beyond the factor range every module is zero. All equations were identities between integral maps on the projective modules in step 1.1, so injection into the generic-root extension proves them over S. Base change gives them over every D; no root difference is inverted in the resulting maps.

6.1step 1.1step 3.1step 4.1step 5.1algebra

The single-curl contraction uses one crossing instead of the two in US or SU. On the reversed flag removing w, cup, the no-switch upward crossing and cap contract to −∑zc(z)/[b′(z)(w−z)], using the weights of step 2.1 and the upward crossing entries of step 3.1. This is the polynomial part of c(u)/b(u) evaluated at w: explicitly, subtracting ∑zc(z)/(b′(z)(u−z)) from c(u)/b(u) removes all its simple poles and leaves its monic-division quotient. On the reversed flag removing z at the adjacent input r+1, the other-handed contraction is ∑wb(w)/[c′(w)(z−w)]. Since b(z)=0, this is minus the polynomial part of b(u)/c(u) evaluated at z. Since c/b=u−hH(u−1) and b/c=uhA(u−1), these are the two stated finite sums. The first has degree −2dh at input μ; the second has degree 2dh at input μ−αi. The two-turn contractions are respectively d(1−h)+d(1−h)−2d and d(1+h)+d(1+h)−2d, verifying the input-weight distinction. At h=0 they give +1 and −1. Mating the completeness identities in steps 4.1-5.1 uses only the already proved triangles, and expands CkRk or Ck−Rk− as the finite triple convolution. In the first case a+j+c=h−1 and literal clockwise dots are b=−h−1+j, so a+b+c=−2; in the other case a+j+c=−h−1 and counterclockwise dots are b=h−1+j, with the same total. These are actual opposite-crossing boundary maps, with the bubble in outside region μ. The same conversion on the single-curl sums gives a+b=−1. Integral descent is as in step 5.1.

6.2step 1.1step 2.2algebra

For f∈Br, comparison of root denominators gives Irτold(f)=(−1)rIr+1τnew(f): the two denominators agree except for the r factors w−z versus z−w. Moreover sr+1/sr=(−1)N−r−1, hence (−1)N+1sr+1/sr=(−1)r. Testing the relative cap on the rank-one operators of step 2.2, also after multiplication by every element of Lr, now identifies ε^r=(−1)N+1εr with τold by perfection. The corresponding relative unit is its dual-power-basis Casimir, so the identification includes the unit and both triangles, not only a trace value on dots. All denominator comparisons are comparisons of already integral polynomial maps between projective modules, and descend exactly as in step 5.1.

7.1step 2.2step 6.2algebra

For the mixed clauses write p′=pq, q=Qij(u,y)/tij monic of degree A=−aij, and Ur=∏a=1rQij(Xa,y). Multiplication by Ur defines the matrix-quotient map from the old factor block to the new one; cancellation in the ordered-residue polynomial expression gives trp′(Urz)=(−1)rAtijrtrp(z). Testing the relative cap against Ura and using its bilinearity and the perfect old trace gives πrεrp′(Qij(Xr+1,y)lift⁡(z))=(−1)Atijεrp(z). The test also proves independence of the lift. The normalized caps of step 6.2 cancel (−1)A, because N changes to N+A. Thus the actual flag cap constant is tij. For r=0 this is simply top-coefficient extraction τpq(Qf)=tijτp(f); arbitrary polynomial reduction gives the same equality. Dual-basis contraction proves the companion cup equation.

8.1F1step 7.1algebra

More explicitly, fix the mixed boundaries GjHi and HiGj and source crossings κ=−τ. The handed pair is a=(HiGjε)(HiκijHi)(ηGjHi),b=(ε′GjHi)(HiκjiHi)(HiGjη′). The intermediate words are HiGiGjHi and HiGjGiHi. The quotient/switch gives a the canonical underlying flag identification; the multiplication-by-Q switch and the normalized coefficient cap in step 7.1 give b its scalar tij. Consequently ba=tij1GjHi and ab=tij1HiGj. Native crossings multiply both a,b by −1 and preserve these products. Thus the inverse mixed crossing is obtained by dividing its companion mate by tij. The same calculation for a separately distinguished color j gives tji for its own pair; identifying both partial actions inside a coherent full action is not a consequence of these two scalar tests alone. Dots commute with the quotient and multiplication maps. With i last, the downward shift sj(m)=−2djmj+∑ℓ>j(−bjℓ)mℓ gives both downward crossings degree −bij; the basic mixed flag identification has shift −bij, canceled by the input-weight change in Hi(m)=Eibasic(m){−di(1+hm)}. The normalized mixed maps are therefore degree zero.

9.1step 4.1step 5.1step 6.1step 6.2step 8.1discharge-construct: actual polynomial flag maps∎

The first unit and second cap have degree d(1−h), and the first cap and second unit degree d(1+h), by coefficient extraction of zr and zN−r−1 with the displayed shifts. Hence T,S have degree zero, Ck has degree d(1−h+2k) and Rk its negative, while Ck− has degree d(1+h+2k) and Rk− its negative. Steps 4.1-5.1 establish both actual matrix inverses, step 6.1 the typed curls and cancellations, and steps 2.2, 6.2, 7.1 and 8.1 the normalized cap transport and mixed orientations. Universal construction followed by base change includes every dominant framing, every permitted color and every weight in its factor range, with no characteristic restriction or choice principle. Nonhomogeneous monic specializations preserve the maps and equations as ungraded identities.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The minimal-parabolic polynomial flag model realizes the graded diagram relations

Statement

Fix a color i and the formal proof category of The minimal-parabolic KLR diagram proof category, on a symmetrizable real Cartan datum with finite index set and arbitrary field k. Use the native KLR parameters of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, degrees of The KLR grading and the diagrammatic multiplication, the PBW convention of The PBW (monomial) basis theorem for KLR algebras, and the nil-Hecke matrix/idempotent convention of Nil-Hecke idempotents and divided-power KLR projectives. Then the polynomial flag construction described below realizes all the defining graded diagram relations of that formal category, including its rank-one cross/cap, bubble-slide/inversion and mixed-color cup/cap relations; it asserts a representation of the formal proof category, not faithfulness or a cyclotomic quotient identification.

The model. Choose a color order with i last. For spectator alphabets Yj of sizes mj (j≠i) put C=⨂j≠ik[Yj]Smj, r=mi, Aij=−aij, tij=[uAij]Qij(u,v)∈k×, qij=Qij/tij, and choose a monic framing polynomial ai(u) of degree λi≥0; initially its coefficients have their universal homogeneous degrees, so all formulas are graded, and the standard specialization is ai(u)=uλi. Set pm(u)=ai(u)∏j≠i∏y∈Yjqij(u,y),N=λi+∑j≠iAijmj,hm=N−2r, and cr(u)=ur−e1ur−1+⋯+(−1)rer. The vertex ring Lm is the monic factor ring for pm=crbN−r, equivalently C[e1,…,er] modulo all coefficients beyond degree N−r of the monic expansion pm/cr; it is finite free over C of rank (Nr) and is zero for r>N. Its i flag is Bm=Lm[z]/bN−r(z), free of rank N−r over Lm and rank r+1 over Lm+i, with the target root alphabet obtained by adjoining z. The underlying spectator flag is Cmj=Lm[y]; its target action appends y to Yj and replaces pm by pmqij(u,y).

The shifts and generators. Every downward generator carries the ordered shift sj(m)=−2djmj+∑ℓ>j(−bjℓ)mℓ. Thus Gi=Fibasic is the Bm{−2dir} tensor functor; Gj for j≠i is the Cmj{sj(m)} tensor functor. The basic reversed i flag is Eibasic=Bm⊗Lm+i− without a shift, whereas the formal upward generator at INPUT vertex m is Hi(m)=Eibasic(m){−di(1+hm)}. These are distinct conventions. The basic flags have degree-zero Fibasic⊣Eibasic and Eibasic{ti(m)}⊣Fibasic, where ti(m)=−2di(hm−1). At vertex m the formal first unit and second cap have degree di(1−hm), and the formal first cap and second unit have degree di(1+hm).

The four maps and the Casimir. All four maps are the explicit dual-basis maps of the two monic coefficient forms on Bm: τold:Bm→Lm extracts zN−r−1 and has degree −2di(N−r−1); τnew:Bm→Lm+i extracts zr and has degree −2dir. The first cap is b1⊗b2↦τnew(b1b2) and the first cup is its dual-power-basis Casimir; the second cap and cup use τold. For a monic polynomial f their Casimir is the polynomial kernel Kf(X,Y)=(f(X)−f(Y))/(X−Y) in the two-root quotient.

Crossings, colors and bubbles. Source crossings are κ=−τnative for EVERY color pair. Source equal-color operators are (s−1)/(X−Y); source unequal operators are the switch/quotient in the increasing-color direction and switch times Q in the reverse direction. Thus native operators are their negatives, and both actual crossing degrees are −bjk with the ordered shifts above. On the i,j pair the successive underlying rings are D1=Lm[y,z]/(b(z)qij(z,y)) and D0=Lm[y,z]/b(z), with source maps π:D1→D0 and f↦Qij(z,y)f:D0→D1; the actual handed pair a:GjHi→HiGj, b:HiGj→GjHi of the formal Definition satisfies ba=tij1GjHi and ab=tij1HiGj. Thus a and tij−1b are mutually inverse. Native minus signs negate both source mates and preserve both cancellation scalars. Full comparison with a separately distinguished j-adjunction belongs to coherent assembly, rather than to this category with only Hi. The basic isomorphism EiGj≅(GjEi){−bij} holds, and the normalized formal HiGj≅GjHi is unshifted.

Realized equations. The canonical rank-one ρ and its prescribed second-mate and finite coefficient-convolution inverse of The polynomial flag comparison has the prescribed second-mate inverse, the same-color cross/cap equations, the bubble series Φi(u)=pm(u)/cr(u)2 and its reciprocal, and the finite-coefficient bubble-slide identities are realized by the stated polynomial maps. In particular the normalized positive h identity columns have degrees di(1−h+2k) for 0≤k<h, and the negative branch uses the inverse crossing plus the dot/cap rows. All polynomial pairings and relations persist after arbitrary monic coefficient specialization as UNGRADED identities; such a specialization does not assert nilpotence, a homogeneous trace degree, or a highest-weight K0 claim. No geometry, characteristic restriction, or one-dimensional-Hom hypothesis is imposed.

Facts & Assumptions

Given: The formal proof category of The minimal-parabolic KLR diagram proof category; the native KLR datum Q and its degrees; a fixed color i; the monic framing polynomial ai and the spectator alphabets Yj.

[F1]

The native relations (1)-(7) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, with Qii=0, the equal-color mixed relations τx−yτ=e, τy−xτ=−e and the correction τf=(sf)τ+(∂f)e in the sign convention ∂f=(f−sf)/(x−y) (The KLR grading and the diagrammatic multiplication).

[F2]

The nil-Hecke algebra of rank r has PBW basis {x1a1⋯xrarτw}, the Artin monomials x1a1⋯xrar, 0≤ak≤r−k, form a k-basis of the coinvariants, the staircase pairing is perfect with unit anti-diagonal over every coefficient ring, and the divided-power idempotents of Nil-Hecke idempotents and divided-power KLR projectives provide the matrix units; in particular NHr is the full matrix algebra over the symmetric polynomial ring on the Artin module.

[F3]

The PBW basis and integrality conventions of The PBW (monomial) basis theorem for KLR algebras: monic division by a monic polynomial of degree q produces an Artin basis of the quotient, with no division by factorials and no characteristic restriction.

[F4]

The actual monic flag comparison, its prescribed second-adjunction mate S, both finite A/H convolution inverse systems, typed curls and cancellations, normalized matrix-Morita cap transport and distinguished-i mixed mate pair are proved independently in The polynomial flag comparison has the prescribed second-mate inverse. The supplier uses only the downward nil-Hecke matrix algebra, actual coefficient cups/caps and integral interpolation; it does not assume this realization.

Proof

technique · constructive: build the monic splitting rings and their Artin bases, define the flag modules and the four coefficient maps, identify the actual rank-one comparison and prescribed mate inverse by interpolation and monic division, and verify each family of formal relations by the displayed polynomial identities
1.1F2F3F4constructalgebra

Monic splitting and the vertex ring. Over universal graded S=k[p1,…,pN], successive monic division gives the full splitting Artin basis X1a1⋯XNaN with 0≤ak≤N−k and perfect coefficient pairing. The two-block staircase and longest-divided-difference retraction of [F4] shows the block-invariant factor ring Lr is finite graded projective over S. Lift a homogeneous basis modulo S+; graded Nakayama gives a finite graded free-module surjection onto Lr. A projective splitting and the least-degree argument kill its kernel, whose S+ fiber is zero, so Lr is graded free. The full splitting algebra has Artin ranks N! over S and r!(N−r)! over Lr, hence the free rank is (Nr). Base change to the coefficients of pm proves the claimed finite free C-module in every characteristic. For r>N the excessive coefficient ideal contains 1, since a monic degree-r factor cannot divide degree-N pm, so Lm=0.

2.1step 1.1F2F3algebra

The vertex ring as a matrix quotient. Representing NHr as the matrix algebra on its Artin module (step 1.1, [F2]) shows that the two-sided ideal generated by a monic p(X1) is the matrix ideal of the coefficients of the remainder of p modulo cr, and monic division makes these coefficients a unit triangular change from the consecutive relations; hence NHr/(p(X1)) is the matrix algebra over the monic factor ring Lm of the Statement. The same computation shows the i-flag Bm is free of rank N−r over Lm and rank r+1 over Lm+i, giving the two root extensions of the model.

3.1step 2.1F4algebra

Coefficient maps, triangles and normalized transport. The kernel Kf(X,Y)=(f(X)−f(Y))/(X−Y) is the trace-dual power-basis Casimir: coefficient extraction gives τX(XaKf)=Ya in the root quotient. Its contractions prove both adjunction triangles, and symmetry gives cyclic dots. The actual nil-Hecke matrix corners identify induction with Bm and its dual with g↦[v↦τnew(gv)] [F4], so evaluation and coevaluation are the stated first cap and cup. The same supplier proves the ordered-residue relative cap normalized by (−1)N+1=(−1)hm+1 transports exactly to τold, and its dual unit to that Casimir. This fixes actual second maps, not merely dimensions or trace values. The coefficient forms have degrees −2dir and −2di(N−r−1); after the basic induction shift their adjunction degrees are 0 and −2di(hm−1). Normalizing Hi at its input gives first unit/second cap degree di(1−hm) and first cap/second unit degree di(1+hm).

4.1step 2.1step 3.1F4algebra

The actual canonical comparison and prescribed inverse. Take the typed native mates T:GiHi→HiGi and S:HiGi→GiHi built from the actual maps of step 3.1 and the downward crossing and its twofold mate. On equal-endpoint generic root paths their matrices are (−T)z,w=c(z)/[c′(w)(z−w)] and Sw,z=b(w)/[b′(z)(w−z)], with w selected and z complementary; swap paths have T=−1,S=1 [F4]. Thus they are the two polynomial interpolation maps. At hm≥0, divide the degree-<N−r interpolant by c: its remainder has degree <r, and its quotient degree <hm. Expanding b/c=uhmA(u−1) identifies quotient coefficients with the prescribed Rk=∑a+j=hm−1−kAjε′xa, with columns Ck=xkη. The supplier proves all five equations −ST=1, RT=0, SC=0, RC=1, −TS+CR=1. At hm<0, division of the degree-<r interpolant by b gives Rk−=∑a+j=−hm−1−kHjεxa, Ck−=xkη′ and all five equations −TS=1, TC−=0, R−S=0, R−C−=1, −ST+C−R−=1. At zero weight both identity blocks are empty. These are identities on actual finite projective tensor bimodules, descended integrally before specialization, with degree-zero components after the prescribed shifts.

5.1step 3.1step 4.1F4algebra

Typed curls, cancellation and bubble coefficients. The downward crossing κ=(s−1)/(X−Y) has square zero and obeys the braid and mixed dot equations by expansion; the symmetric Casimir gives dot mates. The actual curls of [F4] are Lμ=∑a+j=−hmxaHj on Hi at input μ, and Rμ=−∑a+j=hmxaAj at input μ−αi, of degrees −2dihm and 2dihm. Mating the completeness equations of step 4.1 gives the cancellation corrections. Positively, a+j+c=hm−1 and the clockwise bubble has literal dots b=−hm−1+j; negatively, a+j+c=−hm−1 and counterclockwise dots are b=hm−1+j. Both give a+b+c=−2, with the prescribed native signs; the single-curl sums give a+b=−1. Actual pairings determine the bubble coefficients: ε′xnη=∑zc(z)zn/b′(z) is the u−1 coefficient of unc/b, namely Hn−hm+1, whereas εxnη′=∑wb(w)wn/c′(w)=An+hm+1. Here A(t)=thmpm(t−1)/cr(t−1)2 and H=A−1; negative indices vanish and coefficient zero is 1. Integral descent proves these identities without distinct-root hypotheses after specialization. Thus Φi=pm/cr2 has the prescribed normalized series and reciprocal. Appending i root z divides A by (1−zt)2, and appending spectator root y multiplies it by qijrev(y,t); reciprocal coefficients give the opposite slides. All recursions are finite at each coefficient. At a monic vacuum, closing ai(x)xℓ−1=0 gives H(t)airev(t)=1.

6.1step 2.1step 3.1step 5.1F1algebra

Downward Q-relations and exact word grading. Give every flag the ordered shift sj(m) of the Statement. For j<k the increasing word (j,k) maps to the word (k,j) by a quotient/switch of underlying degree 0, with target-minus-source unit shift −bjk; the reverse operator has underlying degree −2bjk and unit-shift +bjk, so both have actual degree −bjk, and same-color divided differences have degree −2dj. Native operators are the negatives of the source operators, so their degrees and two-crossing composites are unchanged. The ordinary polynomial operators satisfy the idempotent, dot, far-commutation and quadratic Q-relations directly; expanding a three-strand composition gives zero difference for distinct outer colors and the divided difference of Q for equal outer colors, and the global substitution κ=−τ changes all cubic signs to the native numerator. The quotient relations descend: on an i,j pair D1 has bq=0 and D0 has b=0, and Qb=tijbq makes multiplication by Q well defined while the other crossing is the literal quotient.

7.1step 2.1step 3.1step 5.1step 6.1F4algebra

The typed partial-color mixed pair. At input μ put ξ=μ+αi−αj, X=GjHi, Y=HiGj. The native maps are a=(HiGjεμ)(HiτGiGjHi)(ηξGjHi):X→Y and b=(εξ′GjHi)(HiτGjGiHi)(HiGjημ′):Y→X. Their middle words are HiGiGjHi and HiGjGiHi; final counits consume respectively the rightmost GiHi and leftmost HiGi. For p′=pqij, [F4] proves the actual normalized cap equation πε^p′(Qijlift⁡(z))=tijε^p(z) with lift independence on every matrix-corner element, and its dual cup equation. The ordered-residue sign (−1)N+1 transports precisely to τold of step 3.1. Substituting the quotient/switch and multiplication-by-Q in the two mate contractions therefore proves ba=tij1X and ab=tij1Y for this same pair. Source crossings negate both maps and preserve the products. They commute with the j dot and have degree di(1+hm)+di(−1−hm+aij)−bij=0, giving the unshifted mixed isomorphism. The separately distinguished-j model has its own scalar tji; a full two-color adjunction comparison is not a relation of the category containing only Hi.

8.1step 3.1step 4.1step 5.1step 6.1step 7.1discharge-construct: explicit flag modules∎

Conclusion. Steps 3.1-7.1 verify every defining relation of The minimal-parabolic KLR diagram proof category on the explicit flag modules: the generators and their degrees, both adjunction triangles, the rank-one matrices in both branches with their inverses, the bubble series and slides, the cross-and-cap equations, the mixed isomorphism with its scalars, and the downward Q-relations. Monic extensions, their Casimirs, the finite rank-one inverses and the coefficient identities survive arbitrary monic specialization as ungraded maps, and the construction is choice-free. This proves only the formal MODEL relations; faithfulness and the cyclotomic word-corner transfer belong to separate suppliers.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Oriented minimal-parabolic normal forms and the cyclotomic cap ideal

Statement

For the formal category Pi of The minimal-parabolic KLR diagram proof category, fix one reduced perfect-matching diagram for each compatible boundary matching, one dot position on each component, and the positive normalized far-left bubble family Aμ(t)=1+∑m>0Aμ,mtm. These matching diagrams multiplied by open-component dot monomials and monomials in the Aμ,m form a basis. There is a finite straightening procedure with this output; its coefficients are independent of all choices of permissible straightening moves. At all-downward boundaries its basis is the ordinary KLR PBW basis tensored with k[Aμ,1,Aμ,2,…]. The universal graded polynomial flag models are jointly faithful at every fixed physical source weight.

Let Λ be dominant, let aj(u) be monic of degree λj=⟨hj,Λ⟩, and let J be the representable ideal generated by 1HivΛ and aj(x)1GjvΛ, closed under vertical compositions and all allowed horizontal whiskers. For downward words u,v of weight difference β, J∩e(v)R(β)e(u)=e(v)Ia(β)e(u),Ia(β)=∑jR(β)aj(x1)e(j,β−αj)R(β). The vacuum specialization is AΛ=airev and HΛ=AΛ−1. The downward Hom corners of Pi(Λ)/J are therefore exactly the ordinary monic cyclotomic corners. Here the corner e(v)Re(u) acts as a map e(u)Roe(v)R between right projectives. Every word in this quotient is a retract of a finite sum of downward words. Consequently its additive idempotent completion is equivalent to the category of finite right cyclotomic word projectives, with Gj acting by actual word induction. The first adjunction identifies Hi with the corresponding normalized projective restriction; the second adjunction maps transport through this equivalence as actual natural transformations.

These assertions hold for every degree-zero field and every admissible homogeneous Q. The monic deformation is first taken over the universal graded coefficient ring; arbitrary monic field specializations assert the ungraded conclusions. No cyclotomic Frobenius theorem is assumed.

Facts & Assumptions

Given: The formal category Pi, a color i, and, for the quotient assertions, Λ, aj, and the representable ideal J of the Statement.

[F1]

The formal definition supplies both adjunction triangles, cyclic dots, all four typed same-color equations, the finite bubble slides, distinct-color mate cancellation, and the actual positive and negative rank-one matrix inverse component equations (The minimal-parabolic KLR diagram proof category).

[F2]

The polynomial flag models realize these equations as homogeneous maps (The minimal-parabolic polynomial flag model realizes the graded diagram relations). The prescribed crossing and dotted inverse blocks are actual flag maps, rather than inverses postulated in the model (The polynomial flag comparison has the prescribed second-mate inverse). At an i-background count r their normalized bubble series is prev/(crrev)2.

[F3]

Ordinary KLR PBW, its faithful polynomial representation, and its shorter-crossing braid corrections are proved in The PBW (monomial) basis theorem for KLR algebras. The ordinary monic first-strand ideal is the one in The cyclotomic KLR quotient at a dominant integral weight.

Proof

Proof technique: straighten planar intersections before extrema; separate finite normal-form combinations by universal framing; then compute every ideal generator using a typed closure and a finite word normalization.

1.1F1construct

A finite planar routing schedule. Forget dots temporarily and count all transverse intersections, including self-intersections, by C. An arc with a self-intersection has an innermost monogon or bigon; two simple arcs with more intersections than their endpoint alternation requires have a bigon. To see the latter, cut along one arc: successive entrances and exits of the other arc in the resulting disk either delimit a bigon or delimit a subarc containing a self-intersection, to which the first case applies. A closed component similarly has a monogon, a bigon with another component, or is a simple disjoint circle: cut along a path from the circle to the exterior and use successive entrances and exits. Clear the chosen disk as follows. An interior arc returning to the same side cuts off a smaller disk; choose that disk first. Otherwise its segment joins two sides, and push the disk corner past its nearest intersection by a triangle move. This removes that intersection from the chosen disk. A whole closed component in the disk is handled first by the same procedure. Thus the number of intersection vertices on or inside the chosen disk, apart from its defining corners, strictly decreases on every main triangle move, until its monogon or bigon is empty. This is a finite schedule: the diagram has finitely many vertices, and selection of a smaller disk strictly decreases that number too. Local extrema are carried along by isotopy; a crossing carried past an extremum is its specified adjunction mate. No new crossing pair is inserted. Once every component is simple and every pair crosses at most once, cut the disk along one component at a time and repeat the same nearest-intersection triangle sweep to route that component to its chosen reduced path. The already routed components remain fixed; the number of unrouted components decreases. This gives a finite sequence of triangle moves between reduced drawings of the same matching.

2.1step 1.1F1F3construct

Algebraic use of the schedule. A triangle move is a downward KLR braid equation or its adjunction mate. Its leading term has the same three crossings, and every correction has fewer crossings. An empty downward bigon is reduced by the quadratic KLR equation; an opposite-orientation bigon is reduced by the prescribed cancellation equation, whose correction has no crossings but may insert a cup and cap. A monogon is reduced by the appropriate curl equation or its adjunction mate, removing its one crossing. Distinct-color opposite bigons have their specified unit cancellation. Move dots along components by cyclicity and the KLR dot equations; every correction again has fewer crossings. Induct first on C. At a fixed C use the finite disk schedule of step 1.1, and apply the induction hypothesis separately to each correction. All sums are finite: curl and cancellation coefficients have nonnegative open-dot and bubble indices with fixed total. In particular an inserted cup and cap cannot defeat this induction, since its branch has already lowered C. After intersections are reduced, extra extrema on a simple component cancel by the triangles; these decrease the finite extremum count without changing C. Move each isolated circle to the far left by the coefficient slides, in decreasing order of its distance from the left edge. For a fixed coefficient every slide is a finite polynomial identity; it creates no intersection and decreases that distance. Replace the reciprocal bubble family by its finite inverse-coefficient recursion. Finally route the reduced open matching as in step 1.1, handling its shorter-crossing corrections by induction, and place the dots at the chosen positions. This proves finite spanning by the stated normal forms; it does not presuppose their independence.

3.1step 2.1F2F3algebra

Leading matching coefficients in the actual model. Work over the universal framing ring and then its generic splitting fraction field, localizing distinct root differences and the finitely many nonzero spectator Q values used in the diagram. This is permitted solely to find a nonzero witness, not to prove an identity by specialization. Use the flag summands in which every background or visited i root is a distinct root of the free universal framing polynomial. These summands are indexed by root additions and removals and are one-dimensional over the splitting fraction field. They exist because r may grow while the framing degree grows as 2r+h−Aspect. The spectator factors of p need not be separable: they are placed entirely in the complementary factor, and their values at these free framing roots are nonzero. Chinese remainder against the separable free framing factor gives the indicated summands even when a spectator factor has repeated roots. A dot multiplies by that root. A native equal-color crossing is (1−s)/(x−y): its root-switching term has coefficient −1/(x−y), and its other term retains the labels and deletes that crossing. A distinct-color crossing switches the labeled roots with coefficient either a unit or a nonzero Q value. The monic coefficient cap at a simple root z has coefficient 1/f′(z) up to its specified unit normalization, and its dual cup has the inverse coefficient; these follow by evaluating the dual-power Casimir (f(X)−f(Y))/(X−Y) on the root idempotents. All these coefficients are nonzero. Consequently expanding a reduced matching diagram on these summands has a leading term that carries a root label along each of its matched components, with a nonzero product coefficient. All other terms delete at least one crossing, and hence are smaller in the minimal crossing number of their boundary matching after step 2.1. Choose pairwise distinct free framing roots for the different open i components and independent spectator roots for the other components. The endpoint equalities of this leading term specify exactly its matching: a different matching must identify two labels assigned to different components. In a finite proposed relation select a matching of maximal minimal crossing number. No smaller matching can contribute to its root-labeled leading coefficient, and another matching of the same crossing number has different endpoint equalities. Its coefficient is therefore its dot polynomial on the selected component roots times its bubble polynomial, times a nonzero rational factor. This replaces an invalid independent bending of interior upward endpoints; only the explicit root flags and their already proved cup/cap maps are used.

4.1step 3.1F2F3algebra

A faithful witness at a fixed physical weight. Let h=⟨hi,μ⟩ be fixed, choose spectator background counts mj, and put Aspect=∑j≠i(−aij)mj. For increasing r put N=h+2r and λi=N−Aspect. Choose the universal monic framing ai(u)=uλi+z1uλi−1+⋯+zλi with deg⁡zs=2dis, independent of the root variables. In the flag model, p=ai∏j≠iQij/tij and B=prev/(crrev)2=airevU with U0=1. Its first D coefficients have the unit triangular form Bs=zs+∑0<ℓ<szℓUs−ℓ+Us for s≤D whenever λi≥D. Thus substituting bubbles in any nonzero finite downward PBW/bubble combination leaves a nonzero polynomial-operator combination before truncation. By the faithful polynomial representation it has a test vector with nonzero output. Take a homogeneous component of that vector and output, and let B bound their degrees and all framing indices used. These bounds can be fixed while r grows: only the finitely many appended strand variables, bubble indices, and fixed-degree symmetric background coefficients occur in the operator and test vector. Let L bound the number of appended i flags. Every flag/factor coefficient relation encountered has degree at least 2di(h+r−L+1); all variables have nonnegative degrees. Choose r with λi≥D and this bound greater than B. No nonzero output of degree at most B can belong to the ideal of these higher-degree relations, so it survives in that actual flag model. For the general-boundary leading coefficient of step 3.1, choose r also large enough to supply distinct free framing roots for every component and at least D unused free complementary roots. The selected component roots are algebraically independent; the first D elementary coefficients of those unused roots are algebraically independent over them. In the factor identity B=bN−rrev/crrev, each of the first D coefficients is a unit triangular polynomial in these complementary elementary coefficients. Thus the nonzero dot/bubble coefficient of step 3.1 remains nonzero in this actual localized flag model. Clearing its finitely many nonzero denominators gives an actual nonzero model operator. This proves independence at all boundaries in every characteristic; it uses unit framing or complementary-factor coefficients, not a root coefficient such as 2e1.

5.1step 2.1step 3.1step 4.1

Basis and confluence. Step 2.1 gives spanning at all boundaries, and steps 3.1–4.1 prove independence in the actual model at all boundaries. Two finite straightening schedules have outputs whose difference represents zero; their basis coefficients therefore agree. This proves the asserted confluence of the output without assuming unchecked critical-pair identities. The same separating witnesses prove joint faithfulness before quotienting.

6.1step 5.1F1algebra

Forced vacuum coefficients. Write hℓ for the counterclockwise bubble coefficient with literal λi−1+ℓ dots, with h0=1 and hℓ<0=0. Closing the marked relation ai(x)xℓ−1=0, for ℓ≥1, is lawful in J and gives hℓ+ci,λi−1hℓ−1+⋯+ci,0hℓ−λi=0. Thus HΛairev=1 and AΛ=airev. Let S be this coefficient-specialization ideal; then S⊂J. The basis of step 5.1 shows that specializing these far-left central coefficients alone leaves the ordinary downward corner exactly R(β). This conclusion concerns S alone and does not assume the conclusion about J. For λi=0, ai=1 kills the first i word and the same recurrence gives A=H=1.

7.1step 6.1F1algebra

The correctly typed local closure. Work modulo S. A straight vacancy closure with q≥0 dots has clockwise A-index λi+1+q, so is zero. The crossed closure on the first physical Gi at input Λ is the first-adjunction mate of RΛ, whose Hi input is Λ−αi and whose clockwise bubble region is Λ. In its exact native equation the bubble literal count is b=−λi−1+m and a+b=−1, hence a=λi−m. Its value is consequently −∑m=0λiAmxλi−m=−ai(x); its degree is 2diλi. Taking the mate preserves this polynomial because the dot is cyclic. If P(u,x) gives additional dots on the added and physical strands, the native relation τ1u=xτ1+1 gives C(uP)=xC(P)+B(P) with B a straight closure, up to the fixed cap convention's unit sign. Since B(P)=0, induction on the nonnegative exponents gives C(P)=−ai(x)P(x,x). Before these closures, slide any bubble at the bent source Λ+αi across the added root z: AΛ+αi=(1−zt)2AΛ and the reciprocal equation for H. Each coefficient is finite, so this reduces it to polynomial dots and the already specialized vacuum coefficients. No bubble is assigned the wrong ambient weight.

7.2step 6.1F1F2algebra

The marked operator at the dominant vacuum. Modulo the killed-upward ideal, the actual positive rank-one matrix identifies HiGivΛ with Dλi. Its columns are vr=xrη, 0≤r<λi, and its dual rows are the finite bubble-weighted counit rows of the prescribed inverse. A raw row with s≥0 extra dots sends xrv0 to hr+s−λi+1. Its value on ai(x)v0 is therefore the zero recurrence of step 6.1 at index s+1. Every actual dual row is a finite combination of raw rows, so all projections of ai(x)v0 vanish; the matrix inverse equation implies the column itself is zero. Multiplying by powers of x kills ai(x) on all columns and hence on HiGivΛ. When λi=0 this object is already zero. This uses the actual inverse rows, rather than assuming raw rows are dual bases.

8.1step 5.1step 7.1F3constructalgebra

Every killed-upward factor. A term through WHivΛ has factor maps f:GuvΛ→WHivΛ and g:WHivΛ→GvvΛ. Bend that vacuum Hi in both maps. The triangles recover gf by closing the composite of the bent maps, which has all-downward boundaries with an additional first i strand at source Λ+αi. The interior word W need not be downward. Apply step 5.1 to the composite and then the coefficient slide of step 7.1. Put n=∣β∣ and let WP⊂Sn+1 fix position one. There are two double cosets, WP and WPs1WP. Removing the distinguished input and output and inserting them in their required positions supplies length-additive representatives us1v, u,v∈WP, in the second case; the first case uses only s2,…,sn. Choose these reduced words for PBW. Shorter braid corrections still straighten in this family. In the first case the first strand closes to the zero straight vacancy loop. In the second the exterior words fix position one, whose color is i at both boundaries; therefore both colors at the unique s1 crossing are i. The exterior downward diagrams pull past the closure, and its local value from step 7.1 is −ai(x1)P(x1,x1). Every such term is in the ordinary first-strand i ideal. For n=0 only the zero straight closure occurs.

9.1step 5.1step 8.1step 7.2F1constructalgebra

Every marked monic whisker. In a term vertically sandwiching W(aj(x)1GjvΛ), select the chronologically earliest Hi in its intermediate word and move it toward the vacuum. Distinct-color commutation is natural and commutes with the marked j dot. For h≥0 the rank-one isomorphism moves HiGi to GiHi plus finitely many identity branches; the latter remove an Hi. For h<0 use the reverse isomorphism rh:GiHi→HiGi⊕D−h and its actual retract maps ι=rh−1jH, π=pHrh, with πι=1. Naturality gives (HiGi)(b)=π(GiHi)(b)ι for every input endomorphism b. Absorb these retract maps into the outer factor maps; the intermediate word has moved its earliest Hi one place toward the vacuum. At the marked first strand, j≠i gives a killed-upward factor by mixed dot compatibility; j=i gives zero by step 7.2 and the dominant vacuum matrix. The lexicographic measure (number of Hi letters in the intermediate word, distance of its earliest Hi from the vacuum) strictly decreases on each finite branch. It counts the intermediate word, not cups and caps in adapted factor maps. After that word is downward, step 5.1 straightens its factor maps. Consequently all marked whiskers reduce to ordinary first-strand ideal insertions and killed-upward factors, already handled in step 8.1.

10.1step 6.1step 8.1step 9.1F3algebra

Exact intersection. Express an ordinary downward element x∈J as a finite sum of factored whiskers of the defining generators. Specialize S⊂J first. The killed-upward summands land in Ia by step 8.1, and the marked monic summands do so by step 9.1; specialization summands vanish. Step 6.1 shows that specialization leaves the included ordinary element x unchanged. Thus J∩e(v)R(β)e(u)⊂e(v)Iae(u). The reverse inclusion follows from the defining monic generators and downward compositions. Every downward quotient morphism is represented by an ordinary downward element by step 6.1, giving the corner isomorphism, with composition equal to multiplication.

11.1step 9.1step 10.1F1constructalgebra∎

Generation and transport. Apply the word induction of step 9.1 without a marker. At the vacuum HivΛ is zero; positive rank-one branches give finite sums and negative branches give actual retracts, so every word is a retract of a finite sum of downward words. Downward words under the corner identification of step 10.1 are the representable word projectives e(u)R/Ia. They generate the finite projectives by additive sums and idempotents; the corner isomorphisms extend to a fully faithful and essentially surjective equivalence of their additive idempotent completions. Appending Gj acts on these representables by the ordinary appended-strand bimodule, hence by actual induction. Transporting the first adjunction identifies Hi with its normalized projective restriction by uniqueness of adjoints. Restriction preserves finite projectives because its values are the transported retracts just proved. The second units and counits transport through the same fully faithful equivalence, so their naturality and both triangles hold as actual bimodule natural transformations. This transports the maps; a claim that their second cap equals a separately prescribed trace would require an additional calculation. All constructions used finite coefficient operations and unit identities over the universal coefficient ring; arbitrary monic specialization gives the ungraded claims.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

PBW and bubble normal form in the minimal-parabolic diagram category

Statement

Fix a color i. In the formal graded minimal-parabolic proof category of The minimal-parabolic KLR diagram proof category, the reduced perfect-matching diagrams, dot monomials on their open components, and monomials in the independent far-left normalized i-bubble coefficients form a basis of every morphism space. In particular, at all-downward boundaries of weight difference β, the morphism space is the corresponding KLR PBW corner tensored with the polynomial ring in one positive bubble family; the opposite/fake family is its coefficientwise reciprocal. The graded polynomial flag models of The minimal-parabolic polynomial flag model realizes the graded diagram relations, with universal monic framing and arbitrarily large auxiliary framing at each fixed physical source weight, are jointly faithful. The assertion is about this formal proof category before cyclotomic quotient transfer.

Facts & Assumptions

Given: The formal graded minimal-parabolic proof category Pi of The minimal-parabolic KLR diagram proof category for a fixed color i, with its generators, graded shifts and relations.

[F1]

The relations of Pi are the model-verified local equations of The minimal-parabolic polynomial flag model realizes the graded diagram relations: downward KLR relations, both rank-one triangles with cyclic dots, the rho/cross-and-cap equations, bubble inversion, the mixed cap/cup equations and the finite-coefficient bubble slides; the polynomial flag models realize all of them.

[F3]

The complete oriented normal-form and fixed-weight faithful-witness construction is proved in Oriented minimal-parabolic normal forms and the cyclotomic cap ideal: its disk routing lowers crossing count before accounting for inserted extrema, and its generic free-root leading matching test treats arbitrary oriented boundaries without individually bending interior upward endpoints.

Proof

Proof technique: apply the independently proved finite oriented straightening and faithful universal-framing separation, retaining the exact normal forms.

1.1F1F2F3construct

Finite spanning and the downward corner. The construction in [F3] first counts intersections, clears an innermost monogon/bigon by its finite disk sweep and uses the typed curl/cancellation and KLR equations. A correction may add extrema, but it removes crossings and hence enters a smaller primary induction value. After intersections are reduced, triangles remove extra extrema, finite coefficient slides move bubbles left, and reciprocal coefficients are finite polynomials in the positive family. The output is precisely the reduced matching, open-dot and far-left bubble family of the Statement. With all boundaries downward, each open component is a colored permutation strand and the reduced crossings and dots are the chosen KLR PBW family [F2]. Thus the claimed downward tensor product follows once independence is established.

2.1step 1.1F1F2F3algebra

Independence and joint faithfulness. The actual flag witness of [F3] assigns distinct free framing roots to the open components of a maximal crossing-number matching. Its leading root-label transport has a nonzero crossing/cup/cap coefficient; any other term deletes a crossing, and a different maximal matching imposes different endpoint equalities. Unused complementary framing roots make the finitely many bubble coefficients a unit triangular independent family over the component roots. This remains valid when spectator factors are inseparable: only free framing roots enter the selected flag summands. For a downward PBW combination the same construction has the concrete fixed-source-weight degree witness: take background count r increasing, total degree N=h+2r and framing degree N−Amathrmspect; all tested flag relations then have degree greater than the fixed nonzero polynomial output. Every finite nonzero normal-form combination therefore survives in an actual flag model. This proves independence at arbitrary boundaries and joint faithfulness, with the normalized Hi and word shifts already fixed by [F1]. No unrelated cyclotomic quotient or Frobenius conclusion is used.

3.1step 1.1step 2.1F3∎

The family spanning in step 1.1 is independent by step 2.1, so it is a basis and its all-downward corner is the stated KLR PBW corner tensored with the polynomial positive-bubble ring. Bubble inversion expresses the opposite family by its reciprocal, and the finite straightening has unique output coefficients because this basis is independent. The assertions hold in every characteristic for all the admissible homogeneous parameters and concern the formal category before quotient transfer.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The cyclotomic cap-off quotient has no extra downward relations

Statement

Let Λ be dominant, λj=⟨hj,Λ⟩, and let Pi be The minimal-parabolic KLR diagram proof category, with its homogeneous polynomial realization and PBW/bubble normal form. Fix monic aj(u)=uλj+∑r<λjcj,rur; for the standard graded cyclotomic quotient take aj(u)=uλj as in The cyclotomic KLR quotient at a dominant integral weight. More generally first take universal graded coefficients of degree 2dj(λj−r); arbitrary monic specializations over the field are interpreted as ungraded.

In the representable category Pi(Λ), let J be the ideal generated by 1HivΛ and aj(x)1GjvΛ for every j, closed under arbitrary vertical pre/postcomposition and horizontal whiskering by the allowed 1-morphisms. For downward words μ,ν of the same weight β, include their ordinary KLR corner by the PBW/bubble normal form. Then J∩e(ν)R(β)e(μ)=e(ν)Ia(β)e(μ),Ia(β)=∑jR(β)aj(x1)e(j,β−αj)R(β). The vacuum bubble specialization is forced by these generators: AΛ(t)=1+ci,λi−1t+⋯+ci,0tλi and HΛ=AΛ−1. Consequently the map from the ordinary monic cyclotomic corner to the downward-word Hom corner of Pi(Λ)/J is an isomorphism, with composition corresponding to multiplication. This holds over every degree-zero field for the entire admissible homogeneous Q family, without finite-type or characteristic-zero restrictions. Inhomogeneous monic specializations assert the ungraded corner equality, not a graded quantum-action conclusion.

Facts & Assumptions

Given: A dominant Λ, the formal category Pi of The minimal-parabolic KLR diagram proof category with its model and normal form, and the monic polynomials aj of the Statement.

[F1]

The formal relations of Pi — the two triangles, the rho inverse blocks, mixed dot compatibility, the cross-and-cap identities and the normalized bubble slides — are realized in the polynomial flag model (The minimal-parabolic polynomial flag model realizes the graded diagram relations).

[F2]

The PBW/bubble normal form (PBW and bubble normal form in the minimal-parabolic diagram category): reduced matchings, dot monomials and independent far-left bubble monomials form a basis; specializing the central vacuum bubble coefficients alone gives the all-downward corner R(β) with its ordinary polynomial/crossing part unchanged.

[F3]

The cyclotomic quotient RΛ(β) of The cyclotomic KLR quotient at a dominant integral weight is the quotient by the two-sided ideal generated by aν1(x1)e(ν); the ordinary unquotiented PBW spanning family of The PBW (monomial) basis theorem for KLR algebras descends to the quotient. No cyclotomic PBW basis or quotient-faithfulness assertion is assumed.

[F4]

The constructive exact ideal-intersection and word-retract theorem of Oriented minimal-parabolic normal forms and the cyclotomic cap ideal proves the forced coefficient specialization, correctly typed crossed closure, complete two-double-coset reduction of every killed-upward factor, and finite marked-monic normalization in both signs of the rank-one weight. It depends on the independent flag realization and ordinary PBW, and uses no cyclotomic Frobenius or quotient-faithfulness premise.

Proof

Proof technique: use the proved typed cap computation and complete finite normalization of all representable ideal generators.

1.1F1F2F4algebra

Coefficient specialization. The lawful closure of ai(x)xℓ−1 for ℓ≥1 gives the finite recurrence hℓ+ci,λi−1hℓ−1+⋯+ci,0hℓ−λi=0, with h0=1 and negative indices zero, as proved in [F4]. Hence HΛ=(airev)−1 and AΛ=airev. The resulting coefficient ideal S belongs to J. The tensor-product basis [F2] shows that passing to Pi/S leaves each ordinary downward element unchanged. Actual clockwise vacancy closures have coefficient index λi+1+r for r≥0 and vanish; fake coefficients of indices 1,…,λi retain the prescribed monic values. The case λi=0 gives A=H=1.

2.1step 1.1F1F2F3F4constructalgebra

Every killed-upward factor. The crossed closure at the first physical Gi input Λ is the first-adjunction mate of the exact RΛ composite, whose Hi input is Λ−αi and bubble region is Λ. Its native value is −∑m=0λiAmxλi−m=−ai(x); with extra dots P(u,x) it is −ai(x)P(x,x) because the dot-crossing correction is a zero straight closure. This is the typed local calculation of [F4], with no ambient weight substituted by analogy. Bend a factor through any WHivΛ at its vacuum Hi endpoint; the triangles give a composite with all-downward boundaries and one added first i strand at source Λ+αi. This does not require W to be downward. Apply [F2], slide its bubble coefficients across the added root by AΛ+αi=(1−zt)2AΛ, and specialize S. With the stabilizer WP of position one in Sn+1, [F4] uses exactly the two double cosets WP and WPs1WP, with a length-additive word us1v in the second. The first gives the zero vacancy loop; the second has its sole s1 crossing equal-colored, since the first boundary color is i on both sides. Exterior diagrams pull past the closure, whose value lies in the ordinary first-strand i ideal. Thus every such factor lands in Ia, including arbitrary internal words and factor maps.

3.1step 1.1step 2.1F1F2F4constructalgebra

Every marked monic whisker. At the dominant vacuum the actual dotted columns and bubble-convolution dual rows of the positive matrix, modulo the killed-upward factor, identify HiGivΛ with Dλi. A raw cap row with s extra dots evaluates ai(x)v0 by the zero recurrence at index s+1. Every actual dual row is a finite combination of those rows, so the inverse matrix kills ai(x) on the entire direct sum. To normalize an arbitrary marked whisker, move its earliest Hi toward the initial marked strand. Mixed dot-natural isomorphisms preserve that marker; a nonnegative same-color branch uses the matrix decomposition, while a negative branch uses the actual retract ι=rh−1jH, π=pHrh and (HiGi)(b)=π(GiHi)(b)ι. Absorb retract maps into the factor maps. The intermediate word's pair (number of Hi letters, distance of its earliest one from the vacuum) decreases on every finite branch. At the marked first strand, a different color gives a killed-upward factor; color i gives the zero vacuum matrix calculation. Once the intermediate word is downward, [F2] reduces its factor maps. This complete normalization of [F4] leaves only ordinary first-strand ideal insertions and the factors already treated in step 2.1.

4.1step 1.1step 2.1step 3.1F2F3F4algebra∎

Exact intersection and corners. Expand x∈J∩e(ν)R(β)e(μ) as a finite sum of vertically factored whiskers of the defining generators and pass first to Pi/S. Steps 2.1–3.1 put every surviving generator summand in e(ν)Iae(μ), while coefficient-specialization summands vanish. Step 1.1 leaves the ordinary x unchanged, proving the reverse inclusion. Every ordinary first-strand ideal insertion belongs to J by its definition, proving the forward inclusion. The basis [F2] and the coefficient specialization represent every downward quotient morphism by an ordinary downward element, so the resulting monic cyclotomic corner map is bijective and respects multiplication. All computations hold over the universal graded coefficient ring and then under arbitrary monic specialization with grading forgotten; no finite-type, characteristic-zero, quotient-faithfulness or generic Frobenius assumption is used.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Cyclotomic induction and restriction have compatible Frobenius dual bases

Statement

For the standard first-strand cyclotomic quotient of a real symmetrizable KLR datum over any degree-zero field and every homogeneous (Q1)–(Q4) parameter family, put A=RΛ(β), B=RΛ(β+αi), e=e(β,i), X=Be, Y=eB, h=⟨hi,Λ−β⟩ and t=2di(1−h). There are explicit, compatible homogeneous maps Ti:eBe⟶A,deg⁡Ti=t, and finite homogeneous tensors Ci=∑αxα⊗Ayα∈X⊗AY,deg⁡xα+deg⁡yα=−t, such that Ti is an A-bimodule map, bCi=Cib for every b∈B, and x=∑αxαTi(yαx),y=∑αTi(yxα)yα. In particular X{t}≅HOM⁡A(Y,A) as (B,A)-bimodules, where Hom is left-A-linear, the left B-action is precomposition with right multiplication on Y, and the right A-action is multiplication on values. The second unit is b↦bCi and the second counit is y⊗Bx↦Ti(yx), giving Ei{t}⊣Fi⊣Ei on all graded modules. They are obtained by finite normal-form/cap transport, not by assuming an actual Frobenius trace. Dots and same-color crossing mates have the native cyclic normalization. Each specified distinguished-i different-color sideways pair has both composites tij times the identity. The separately distinguished-j construction has both composites tji times the identity. These are different partial actions, not two different scalar values for the two orders of one pair; their full word-closure comparison is not inferred here. Arbitrary monic field specializations have the same ungraded construction, with grading shifts forgotten. No finite-type, characteristic-zero, geometric-global-basis or symmetric-trace premise is used.

Facts & Assumptions

Given: The algebras, corner bimodules and shift in the Statement, with right append and the first-strand cyclotomic ideal.

[F1]

The fully typed formal category and its independently constructed flag inverse/cap maps (The minimal-parabolic KLR diagram proof category, The polynomial flag comparison has the prescribed second-mate inverse): both rank-one inverse equations, both formal adjunction triangles, dot/same-color cyclicity, and the normalized partial different-color mate pairs. At outside weight h the first unit and second counit have degree s=di(1−h); at the adjacent outside weight h−2 the first counit and second unit have degree −s. The same distinguished-i pair has both composites tij; the separately distinguished-j construction has scalar tji.

[F2]

The normal-form/cap-ideal supplier (Oriented minimal-parabolic normal forms and the cyclotomic cap ideal): the quotient representable category has the exact cyclotomic downward Hom corners, its ideal is stable under all allowed whiskers, and every mixed word is a retract of a finite sum of downward words by its specified finite rank-one reduction. No extra downward relation occurs. Its corner identifications respect composition, word idempotents and generator append maps, also for arbitrary monic specializations.

[F3]

The actual basic functors and ordinary adjunction are Cyclotomic KLR induction and restriction functors; Cyclotomic induction is projective on the right independently proves that they preserve finite graded projectives. Tensor/Hom and shifts are those of Graded balanced tensor product and homogeneous Hom and Associative graded algebras, bimodules, and internal shifts.

Proof

Proof technique: explicitly extend the downward-corner equivalence to projectives, identify the first right adjoint with restriction, evaluate the transported second unit/counit on regular modules, and read both dual-basis identities from their triangles.

1.1F1F2constructalgebra

The concrete projective equivalence. For each root γ let Qγ be the finite direct sum of all downward words of weight γ from the vacuum. Its cyclotomic quotient endomorphism algebra is RΛ(γ) by [F2]. A mixed word is reduced by moving its earliest upward letter toward the vacuum. An unequal-color step uses the normalized mixed isomorphism; a nonnegative equal-color step replaces it by the prescribed finite direct sum, while a negative step uses the prescribed inclusion/projection to exhibit the needed summand as a retract. Every term decreases the pair consisting of the number of upward letters and their distance from the vacuum; an upward letter at the vacuum is killed by the quotient ideal. Thus the stated finite downward retraction is an actual matrix of formal maps, with its two retraction equations. Apply the downward Hom identification entrywise to such matrices and their idempotents. For the target-first corner convention, downward Yoneda first sends a word ν to the right module e(ν)RΛ(γ); twisting by the generator-fixing anti-involution sends it to the left module RΛ(γ)e(ν). A diagram p then acts by right multiplication by ψ(p). This explicit double reversal makes composition correct; it is not an implicit opposite-algebra identification. Full faithfulness on sums follows entrywise from the corner isomorphism, on retracts by cutting the matrix with its idempotents, and essential surjectivity from the definition of a finite projective as a finite free retract. Denote this equivalence by Ξγ.

2.1step 1.1F1F3constructalgebra

Induction and its actual right adjoint. Appending Gi sends every downward generator and old algebra action to its right-append image. Hence Ξβ+αiGiΞβ−1 is F=X⊗A− on the regular-word summands, their morphisms, finite sums and retracts. The formal Hi on this pair is normalized restriction shifted by s=di(1−h): its input weight is h−2, so its defining shift is −di(1+h−2)=s. Put Eˉ=ΞβHiΞβ+αi−1{−s}. The first formal unit/counit, after this deshift, give F⊣Eˉ in degree zero. The actual functor E=Y⊗B− is also a right adjoint by [F3] and takes finite projectives to finite projectives. If (ηˉ,εˉ) and (η,ε) are these two first adjunctions, define αN=E(εˉN)ηEˉN:EˉN→EN and βN=Eˉ(εN)ηˉEN:EN→EˉN. Substitution and the two first triangles give αNβN=1 and βNαN=1; the same substitutions show these isomorphisms preserve the first units/counits. This identifies Hi with actual E{s} by explicit maps.

3.1step 1.1step 2.1F1constructalgebra

Actual second maps, including their shifts. Write εˉM′:EˉFM→M and ηˉN′:N→FEˉN for the transported second maps after deshifting Hi. Their degrees are 2s=t and −2s=−t: the second counit originally has degree s on HiGi=EˉF{s}, whereas the second unit at the adjacent weight has degree −s into GiHi=FEˉ{s}. Define εM′=εˉM′βFM and ηN′=F(αN)ηˉN′. The equations αβ=1, naturality, and the second triangles in [F1] give the second triangles for these actual maps, with precisely the indicated degrees. This construction involves only applying the explicit matrices of step 1.1 and the displayed maps of step 2.1 to the diagram units/caps; the cup/cap images are not assumed to be a previously named coefficient trace.

4.1step 1.1step 2.1step 3.1F2F3constructalgebra

Evaluation on the regular modules constructs the bimodule functional and tensor. Identify EFA=Y⊗BX=eBe and FEB=X⊗AY. Set Ti=εA′ under the first identification and Ci=ηB′(1B) under the second. These are explicit finite normal-form computations: use the specified retraction matrices for HiGiQβ and GiHiQβ+αi, the corner isomorphisms, the first-adjoint maps α,β, and finally the second cap or cup. For an input z∈eBe, the target-first convention uses the formal normal-form lift of ψ(z), so its left-projective image is right multiplication by z. Different generic lifts differ by the exact cyclotomic ideal of [F2] and hence give the same quotient computation. Left A-linearity of εA′ gives Ti(ι(a)z)=aTi(z); naturality with right multiplication by a on A gives Ti(zι(a))=Ti(z)a. Similarly ηB′ is left B-linear, so ηB′(b)=bCi, and naturality with right multiplication by b on B gives bCi=Cib. The degrees in step 3.1 give deg⁡Ti=t, deg⁡Ci=−t. A tensor element has a finite expression by the definition of the balanced tensor product; taking its homogeneous components gives the asserted finite sum Ci=∑xα⊗yα.

4.2step 1.1step 2.1step 3.1F1algebra

Native compatibility and the two partial constructions. All transformations were transported through a fully faithful equivalence preserving append generators and the first adjunction. Therefore the actual dot and same-color mate equations are exactly the realized equations of [F1], with κ=−τ throughout. For the i-partial different-color pair, its maps are the concrete cup--κij--cap and opposite cup--κji--cap contractions in [F1]; both composites are tij times their respective identities. Passing to native crossings negates each of these single-crossing maps, so the two signs cancel in either composite. Repeating the entire construction with distinguished color j gives its actual pair with scalar tji in both orders. This proves the stated partial mate compatibilities at their actual source/target weights, without identifying an Hj inside Pi, which contains only Hi. A full word-closure comparison between the two separately constructed partial actions requires an additional calculation.

5.1step 3.1step 4.1algebra

Both dual-basis identities and the actual perfect pairing. Evaluate the second triangle for F at A: x↦∑xα⊗yα⊗x↦∑xαTi(yαx) is the identity on X. Evaluate the second triangle for E at B: y↦∑y⊗xα⊗yα↦∑Ti(yxα)yα is the identity on Y. Thus the claimed identities are actual bimodule equations. Define Φ:X{t}→HOM⁡A(Y,A) by Φ(x)(y)=Ti(yx). The bimodule properties in step 4.1 give the specified B,A-actions, and the degrees give a degree-zero map. Its inverse sends f to ∑xαf(yα), regarded in X{t}. The first identity proves this inverse composed with Φ fixes x, and left A-linearity of f and the second identity prove Φ composed with it fixes f. Hence the pairing is perfect without a symmetric-algebra or dimension argument.

6.1step 4.1step 5.1F3algebra

Extension to all modules. At regular modules, naturality identifies the second counit with y⊗Bx↦Ti(yx) and the unit with b↦bCi. A natural transformation between tensor functors on finite projectives is determined by its regular-module bimodule map: finite sums and shifts follow additively and retracts follow by cutting with their idempotents. The displayed maps therefore reproduce the transported transformations there. Define them on arbitrary modules by tensoring these actual bimodule maps. Their balancing uses A-bilinearity of Ti and B-centrality of Ci, and their two triangle composites are the exact identities of step 5.1 tensored with the input. They consequently give E{t}⊣F on all modules, including infinitely generated ones, together with the independently existing F⊣E. No projective-presentation limit or assumed quotient flatness is used.

7.1step 4.1step 5.1step 6.1F1F2F3algebra∎

Boundaries and monic specializations. If A=0, unital right append forces e=0; if e=0 for any other reason, X=Y=0, Ti=Ci=0, the pairing is the zero-to-zero isomorphism and both functor triangles are identities of zero functors. At the vacuum the actual construction is the monic coefficient trace on k[z]/ai(z) and its monic dual-power Casimir from [F1], including ai=1 and degree-zero quotients. In the standard case its degree is 2di(1−λi), agreeing with t at β=0. All reductions use finitely many words, matrices and polynomial remainder coefficients; no arbitrary-index choice, factorial denominator, splitting field or separability argument is used. The two independent suppliers and the ordinary adjunction/projectivity in [F3] work for arbitrary monic specializations, so forgetting grading gives the same actual maps and identities there. No trace theorem was used to construct its own adjunction.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Actual terminal dot caps have a prefix residue formula

Statement

Fix a real symmetrizable KLR datum over a degree-zero field k, every homogeneous (Q1)–(Q4) parameter family, a dominant framing Λ, and the standard first-strand cyclotomic quotient. More generally let ai(z) be any monic field specialization of degree λi=⟨hi,Λ⟩, using the ungraded monic quotient. Let A=RaΛ(γ), let η=(η1,…,ηn) have root weight γ, and put hi=⟨hi,Λ−γ⟩ and qij(z,x)=Qij(z,x)/tij for i≠j. The maps Tiγ are the actual regular-module second counits constructed in Cyclotomic induction and restriction have compatible Frobenius dual bases, with its canonical first-adjoint identification and ordinary first unit. Define the formal Laurent expansion at infinity Riη(z)=∏a:ηa=i(z−xa)2ai(z)∏a:ηa≠iqiηa(z,xa)∈e(η)Ae(η)((z−1)). Every denominator is expanded by its monic leading coefficient; its coefficients are polynomials in the old dots. Then for every integer m≥0, Tiγ(e(ηi)xn+1m)=e(η)[z−1]zmRiη(z). The associated series coefficients, collected over all η of weight γ, are central in A.

For distinct i,j, take u,v to label respectively the i,j terminal dots, and let g∈(e(η)Ae(η))[u,v], with coefficients placed on the left. Use the right-append homomorphisms to evaluate its coefficients. Relabel u,v in the ηji corner by color, so that u=xn+2 and v=xn+1 there. Both following compositions are actual maps to e(η)Ae(η): TiγTjγ+αi(e(ηij)Qij(u,v)g(u,v))=tjiDη(g), TjγTiγ+αj(e(ηji)Qji(v,u)g(u,v))=tijDη(g), where a common residual map is explicitly Dη(g)=[u−1v−1]g(u,v)Riη(u)Rjη(v). These identities include arbitrary downward prefixes, all input weights and zero corners. They establish the two-return terminal quadratic contraction. They do not identify the residual maps of the zero-return or one-return terminal patterns. In the homogeneous standard case the cap has degree 2di(1−hi); arbitrary monic specializations assert the ungraded formulas.

Facts & Assumptions

Given: The datum, framing, actual caps, old word, and polynomial input of the Statement, with first-strand cyclotomic relations and right append.

[F1]

The actual cap is A-bilinear, and its transport uses an isomorphism of first adjoints preserving the first unit (Cyclotomic induction and restriction have compatible Frobenius dual bases). Thus the ordinary first unit is inclusion into the append corner, while the actual second cap is the transported formal second counit, including shifts.

[F2]

The formal normalized counterclockwise bubble with m literal dots has coefficient index m−h+1 in Hμ, with negative coefficients zero. Adjoining an i root x multiplies H by (1−xt)2; adjoining a distinct j root x divides it by t−aijQij(t−1,x)/tij (The minimal-parabolic KLR diagram proof category). These equations hold under the actual quotient transport; at the vacuum HΛ=(airev)−1 (Oriented minimal-parabolic normal forms and the cyclotomic cap ideal).

[F3]

The KLR dot relations commute an old crossing with appended terminal dots, distinct-color crossings permute their two dots without correction, and equal-color crossings commute with symmetric polynomials in those dots. Also Qij(u,v)=Qji(v,u), and tij∈k× is the monic extremal coefficient (The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum). The monic quotient is The cyclotomic KLR quotient at a dominant integral weight.

Proof

Proof technique: identify the actual terminal cap with its transported bubble coefficient, slide that coefficient through the old word, and cancel the terminal quadratic before taking two formal coefficients.

1.1F1F2givenalgebra

Actual cap and index. Apply the ordinary first unit to e(η) and decorate its appended strand with m dots; the resulting element is e(ηi)xn+1m. The canonical first-adjoint transport preserves that unit by [F1]. Its actual second counit consequently evaluates this element as the transported diagram εμ′xmημ, with μ=Λ−γ. This is the counterclockwise bubble of [F2], hence e(η)Hη,m−hi+1. This calculation identifies the constructed Tiγ itself; it does not replace it by a chosen coefficient functional. Negative indices give zero, and no sign or weight shift is omitted: the literal-dot index is m−hi+1, and its degree is 2di(m−hi+1)=2dim+deg⁡Tiγ.

2.1step 1.1F2algebra

Slide through the prefix. Starting with the vacuum value in [F2], slide the bubble through the chronological letters of η. Each coefficient computation is finite because every reversed monic factor has constant coefficient one. The resulting series is Hη(t)=∏a:ηa=i(1−xat)2/(airev(t)∏a:ηa≠iqiηarev(xa,t)). The numerator has degree 2#{a:ηa=i} in z, the denominator has degree λi+∑a:ηa≠i(−aiηa), and their difference is −hi. Therefore Riη(z)=z−hiHη(z−1). Extracting coefficient z−1 from zmRiη(z) extracts precisely index m−hi+1 from Hη. Combined with step 1.1 this proves the actual terminal-dot formula, without restriction on the sign of hi.

3.1step 2.1F1F3algebra

Centrality and old algebra factors. For an equal-color adjacent pair in η, the two factors of Hη are symmetric in their dot variables, so each coefficient commutes with its crossing by [F3]. For a distinct-color pair, swapping the color-variable pairs sends the coefficient in the η summand to the coefficient in the swapped-word summand; its crossing has precisely that dot-permutation relation with no correction. Thus the finite sum of these coefficients over the words commutes with every crossing, every dot and every idempotent, which generate A. They are central. Appended terminal dots commute with all old generators. For any b∈e(η)Ae(η), [F1] consequently evaluates ιi(b)e(ηi)xn+1m as b e(η)[z−1]zmRiη(z). By linearity this identifies the actual cap on every polynomial terminal with arbitrary old algebra coefficients.

4.1step 2.1step 3.1F3algebra

First actual quadratic contraction. Put the i dot u on the appended prefix ηi. Its actual terminal-j formula of step 2.1 uses Rjηi(v)=tjiRjη(v)/Qji(v,u). In this identity the inverse is expanded at infinity in v and has polynomial coefficients in u and the old dots. Apply step 3.1 termwise to the polynomial Qij(u,v)g(u,v): its old coefficients lie in the append image of A[u]. Since Qij(u,v)=Qji(v,u), the denominator cancels in the Laurent series before taking the coefficient. The actual inner cap therefore gives tji[v−1]g(u,v)Rjη(v). This is a polynomial in u with old algebra coefficients: g has finitely many powers of u,v, and only finitely many series coefficients contribute to v−1. Apply the actual outer i cap by step 3.1. The result is tji[u−1][v−1]g(u,v)Rjη(v)Riη(u).

5.1step 3.1step 4.1algebra

Second contraction and common map. Interchange i,j and keep the variables labeled by color. Now the inner i cap uses Riηj(u)=tijRiη(u)/Qij(u,v), giving tij[v−1][u−1]g(u,v)Riη(u)Rjη(v) after the outer j cap. Following the quadratic cancellation, each series depends on only its own terminal variable and the old commuting dots. Their coefficients commute with one another. On the finite polynomial g, both extractions use finitely many coefficients and therefore commute. The result of step 4.1 and this result are respectively tjiDη(g) and tijDη(g) in the same old algebra corner. This is an equality of actual cap compositions, with an explicit common residual map before any prefix closure; no common finite flag coefficient ring or symmetric trace was assumed.

6.1step 1.1step 2.1step 4.1step 5.1F1F3algebra∎

Quotients and boundaries. Every input is evaluated by the actual append homomorphisms and actual quotient caps; two polynomial inputs with the same terminal quadratic image give the same cap value. Because tij,tji are nonzero, the identities also show that Dη vanishes on each kernel of the corresponding quadratic evaluation. No injectivity of the append homomorphisms is required. If an old or terminal corner is zero, the same equations are identities of zero actual maps. For the empty prefix Ri(z)=1/ai(z), giving ordinary monic top-coefficient extraction; ai=1 and negative bubble indices are included by step 1.1. Every inverse-series coefficient is obtained by finite recursion from a unit constant term. Thus arbitrary monic field specialization preserves the argument, with grading forgotten, and there is no separability, characteristic-zero, finite-type or choice hypothesis. In the standard homogeneous case the degree asserted in step 1.1 agrees with [F1], and the two composite cap degrees agree in the two orders by diaij=djaji. The two-return contraction is proved; no conclusion about other terminal matching patterns is used or needed.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Actual partial Frobenius caps satisfy all two-color terminal contractions

Statement

Use the standard first-strand cyclotomic KLR quotient over a degree-zero field, any real symmetrizable datum and every homogeneous (Q1)–(Q4) parameter family. The same ungraded assertions hold for arbitrary monic field specializations ai of degrees ⟨hi,Λ⟩. Let η be any downward prefix of root weight γ, let i≠j, and put A=RaΛ(γ), B=RaΛ(γ+αi+αj), eij=e(ηij) and eji=e(ηji). Use the actual caps Tiγ of Cyclotomic induction and restriction have compatible Frobenius dual bases. There is an explicitly computed linear residual map Dη:eijBeji⟶e(η)Ae(η) such that, with p=τn+1eij∈ejiBeij and n=∣η∣, TiγTjγ+αi(ap)=tjiDη(a),TjγTiγ+αj(pa)=tijDη(a). These are exact corner identities after the arbitrary prefix, before any prefix closure. They hold separately on every reduced matching with k=0,1,2 distinguished terminals connected to distinguished terminals; all shorter-crossing terms are included. In particular, composing with any fixed prefix functional gives the same residual evaluation in all three terminal patterns. No common finite coefficient ring for the separately transported distinguished-color actions is assumed.

The computation uses a downward generic PBW lift, expands its faithful polynomial operator by root-labeled permutations, cancels the quadratic factor attached to the distinguished pair, and extracts the two terminal Laurent coefficients. This produces an element of the old algebra and is independent of the lift. It uses no Frobenius symmetry or full two-color action premise. The typed formulas specify the scalar orientation without an implicit reversal of source and target corners.

Facts & Assumptions

Given: The datum, monic quotient, prefix, actual caps and typed corner maps of the Statement, with right append.

[F1]

Actual caps are bimodule maps, their canonical first-adjoint transport preserves the ordinary first unit, and their transported diagrams have both adjunction triangles (Cyclotomic induction and restriction have compatible Frobenius dual bases). The formal partial-category normal forms are jointly faithful in the universal flag models before quotienting, and their downward quotient transport identifies actual generator append maps (Oriented minimal-parabolic normal forms and the cyclotomic cap ideal).

[F2]

The actual terminal-dot formula and central bubble coefficients are Actual terminal dot caps have a prefix residue formula. Write h=⟨hi,Λ−γ⟩ and Riη(z)=z−hHη(z−1). Appending a distinct color j gives Riηj(u)=tijRiη(u)/Qij(u,v).

[F3]

Ordinary PBW and the faithful polynomial representation are The PBW (monomial) basis theorem for KLR algebras and Faithful polynomial representation of a KLR algebra. Choose its factorization with one Pij=Qij and the opposite Pji=1, for each unordered pair. A distinct crossing switches labeled variables with a P factor; an equal crossing is (1−s)/(x−y). The generic algebra embeds in rational permutation operators; their coefficients have denominators only differences between same-color labeled variables when no P is inverted.

[F4]

In the actual normalized flag maps, for an old i-subset J and a new root v∉J, the first unit has coefficient cJ(v) and the second cap has coefficient 1/bJ′(v); cups/caps are zero on paths with different endpoint subsets. Moreover the polynomial part of cJ(z)/bJ(z) is ∑a+ℓ=−hzaHJ,ℓ (The polynomial flag comparison has the prescribed second-mate inverse). The formal bubble and native-dot conventions are The minimal-parabolic KLR diagram proof category and The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum; in particular τnv=uτn−1 for equal terminal colors. The quotient is The cyclotomic KLR quotient at a dominant integral weight.

Proof

Proof technique: compute the same-color transfer cap, identify every actual relative cap by two PBW double cosets, and compare the two terminal orders in one faithful generic downward permutation representation.

1.1F1F4givenconstructalgebra

The typed transfer base. Suppose the old prefix ends in i, with last old dot u, and append another i with dot v. Closing the appended strand on τn is the natural transformation K=(εμ′Gi)(HiτGG)(ημGi) on Gi whose input is μ+αi and output is μ=Λ−γ; its intermediate word is HiGiGi. The first unit is at the old output weight μ, and the second cap deletes the marked appended flag. First evaluate with an independent universal monic flag polynomial, on the root path K0→J=K0∪{u}. The unit sums paths adding v∉J, with coefficient cJ(v). The retained term of the native crossing on ordered additions (u,v) has coefficient 1/(u−v), and the subsequent marked deletion returns to J with second-cap coefficient 1/bJ′(v). Its switched term instead gives the old subset K0∪{v}; the cap-to-identity component at J is zero by [F4]. Thus the diagonal coefficient of the actual composite is ∑v∉JcJ(v)/(bJ′(v)(u−v)). Polynomial interpolation subtracts these simple poles from cJ(z)/bJ(z); since cJ(u)=0, this sum is minus its polynomial part at u, hence −∑a+ℓ=−huaHJ,ℓ. Both sides are integral flag maps; the generic-root computation descends by the projectivity and injection proved in [F4], and then specializes to every framing/spectator polynomial, including repeated spectator factors. Joint faithfulness of the universal partial models in [F1] gives this identity of formal maps on Gi, with its bubble in the output region μ. Transport through the quotient and the first-unit-preserving identification of [F1] therefore gives Tiγ(τne(ηi))=−∑a+ℓ=−huaHη,ℓ in the actual old corner. No faithfulness of the cyclotomic quotient under localization is used.

1.2F3F4constructalgebra

Two relative PBW summands. Work now in the ordinary generic algebras A~=R(γ) and B~i=R(γ+αi), with the same scalar monic framing coefficients used in the series. Choose PBW reduced words adapted to the two double cosets of Sn in Sn+1. A permutation fixing the appended position gives the summand A~[v]. Every other permutation has a length-additive expression w1snw2, with w1,w2∈Sn, giving old factors sandwiching τnvm. In the append-i corner, the two colors meeting at this middle crossing must both be i: the exterior permutations fix the appended position, whose color is i at both boundaries. Thus these two sorts span the entire append corner as an old-algebra bimodule, by [F3]. Dot powers and coefficients can be moved to the indicated locations with the native dot relations, whose correction terms belong to the same span.

2.1step 1.1F1F2F4algebra

All transfer powers. Put Km=Tiγ(τnvme(ηi)). The native dot relation in [F4], old-algebra bilinearity of [F1], and the actual dot formula in [F2] give Km=uKm−1−Hη,m−h for m≥1. With step 1.1 this yields Km=−∑a+ℓ=m−huaHη,ℓ. All indices in the sum are nonnegative. Equivalently Km=[v−1]vmRiη(v)/(u−v), with (u−v)−1=−∑a≥0uav−a−1. This is a finite coefficient computation even for h≤0.

3.1step 2.1step 1.2F1F2F3algebra

A single generic lift of the actual cap. Expand a generic downward element in the faithful rational permutation representation of [F3]. Discard the permutation terms that move the appended position, delete that position from all retained permutations, multiply their coefficients by the corresponding word series Riη(v), and extract [v−1]. Denote this explicitly defined map by T~i. Its output initially lies in rational old permutation operators. The coefficient-by-coefficient centrality calculation in [F2] uses only the generic dot and crossing relations, so it also holds before the cyclotomic quotient. It is an old-algebra bimodule map: old permutations fix v, the word-indexed coefficients of Ri(v) commute with the old algebra by [F2], and projection to the subgroup fixing v commutes with multiplication by old permutation operators. On the first summand of step 1.2 it is exactly the dot-cap formula. On the second summand, τn=(1−sn)/(u−v) has retained coefficient 1/(u−v); its switched term cannot fix the appended position after multiplication by either old exterior permutation. Therefore it is exactly the transfer formula of step 2.1, including both old exterior factors. Both summands consequently have outputs in the ordinary polynomial algebra A~, not merely its rational localization. The actual quotient cap agrees with this generic map followed by the cyclotomic quotient on every spanning term. Hence Ti has this one downward lift, and T~i sends the generic cyclotomic kernel into the old cyclotomic kernel. This last assertion follows from equality with the actual quotient map, not from localization of the quotient.

4.1step 3.1F3constructalgebra

A common representation for both colors. For the original prefix use the one ordinary generic algebra B~=R(γ+αi+αj) and its representation of [F3]. Give the two terminal labeled variables names u of color i and v of color j, independently of their position. Let a~∈eijB~eji lift a. For a term retained after both terminal projections in a~p or pa~, its permutation in a~ must be sπ=πs, where s switches these two terminal positions and π fixes them both. It maps the ji word to the ij word and induces the old prefix permutation π. All other terms are discarded in both orders. This is an exact condition on labeled permutations; it does not require that the original reduced matching itself preserve the terminal pair. In particular, the no-switch terms in equal-color divided differences are retained where necessary in the zero-return and one-return patterns.

5.1step 4.1F3algebra

The complementary factor is present. Track the two distinguished labeled roots through any expanded generator word contributing the permutation sπ of step 4.1. Their relative order is reversed, so they undergo an odd number of distinct-color switches. Equal-color retained terms do not switch labels; equal-color switched terms switch roots of the same color and cannot supply this distinguished i,j reversal. With the Q/1 factorization of [F3], the net reversed path contains the complementary factor of the reverse terminal crossing; every extra pair of switches contributes a further quadratic factor. Thus the coefficient of sπ is divisible by that complementary P factor. The only denominators in this expansion are differences of same-color labeled roots. They cannot involve both u,v, since i≠j. The divisibility holds termwise and therefore after adding all generator-word contributions. Multiplying by the singled-out crossing in either order gives its complementary factor times its own factor, exactly Qij(u,v), with the same residual coefficient gπ after the variables are identified by color. Indeed sπ=πs and π fixes u,v, so the two operator products have coefficients Qij(u,v)gπ on the same old permutation π. The equality includes all native divided-difference signs.

6.1step 3.1step 5.1F2F3algebra

Cancel before taking coefficients. In the ij corner the two actual generic cap weights of step 3.1 have product Riη(u)Rjηi(v)=tjiRiη(u)Rjη(v)/Qij(u,v). In the ji corner their product is tijRiη(u)Rjη(v)/Qij(u,v) by [F2]. Cancel the Q factor of step 5.1 before coefficient extraction. Every remaining terminal-dependent denominator of gπ is a same-color difference involving one terminal variable and old variables of its own color, or an old difference; there is no denominator coupling u,v. Expand the first kind at its own terminal infinity and localize only the old same-color differences. The two coefficient operations then commute: each monomial contributing to [u−1v−1] uses finitely many coefficients, and all coefficients lie in the same commutative localized old-dot ring. Consequently the common old permutation operator is ∑π[u−1v−1]gπRiη(u)Rjη(v) π. It equals the first actual generic cap composition divided by tji, and the second divided by tij. By step 3.1 these cap compositions belong to e(η)A~e(η). Faithfulness of the generic representation implies they are equal there; the rational computation introduces no new relation. This constructs the common polynomial downward residual map.

7.1step 3.1step 4.1step 6.1F2constructalgebra

Actual quotient descent and the three typed patterns. Define Dη(a) by quotienting the common generic residual of step 6.1. If another lift differs by the cyclotomic ideal, the first cap composition of its product with p has zero image by step 3.1, so division by the nonzero tji gives zero residual. Thus the map is well defined on the actual opposite corner, and its two compositions are precisely the typed identities in the Statement. To isolate a terminal pattern, expand a~ in reduced PBW matchings and partition them by how many of the two distinguished top terminals meet distinguished bottom terminals, namely k=0,1,2. Apply the same projection and coefficient rule of steps 4.1–6.1 to each individual matching term. Restrict the already well-defined map Dη to the image of the span of the kth matching family; this gives Dη,k with the same input and output corners and the same scalar factors. These images may intersect; no direct-sum decomposition of the cyclotomic quotient by matching types is asserted. The expansions include every lower permutation term of the original crossing word. Therefore no unproved slide of external maps or identification of separately transported flag modules is needed for either k=0 or k=1. For k=2 and polynomial terminal inputs the rule is exactly the explicit Dη(g) of [F2]. Prefix crossings and dots are part of the same common downward lift throughout.

8.1step 1.1step 2.1step 6.1step 7.1F1F2algebra∎

Boundary, specialization and scope. Only the generic ordinary polynomial representation is localized, and its equality has already descended to the ordinary old algebra before taking the quotient. No claim of cyclotomic faithfulness after localization is made. At empty prefix the same computation is monic coefficient extraction; zero corners give zero residuals by step 7.1. Negative h, ai=1, repeated roots and arbitrary field characteristic are covered by the finite series formulas and universal integral descent in steps 1.1–2.1. The construction uses only finitely many PBW terms and Laurent coefficients, so no choice principle is needed. Arbitrary monic specialization preserves the identities with grading forgotten; in the homogeneous branch every actual map retains its stated adjunction degree. Finally one may compose both corner identities with the identical actual prefix closure: this gives their crossing scalar ratio without assuming symmetry. Diagonal inversion weights can subsequently cancel those ratios along adjacent exchanges; that global trace assembly and the full adjunction-mate interpretation are separate consequences, not premises of this proof.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Cyclotomic word traces assemble a perfect symmetric form

Statement

For the standard first-strand cyclotomic KLR quotient over any degree-zero field, any real symmetrizable datum, and every homogeneous (Q1)–(Q4) parameter family, fix B=RΛ(β) and put tβ=(β,β)−2(Λ,β). Compose the actual second caps of Cyclotomic induction and restriction have compatible Frobenius dual bases along a word ν to obtain ϵν:e(ν)Be(ν)→k. Then τβ(a)=∑ν∈Iβϵν(e(ν)ae(ν)) is homogeneous of degree tβ, and a↦[b↦τβ(ba)] is an isomorphism B→DB{−tβ}. This proves perfectness of the actual word form, including off-diagonal corner pairings, without assuming that a nonzero closure detects every ideal. For the native crossing pν=τre(ν) with bottom adjacent colors (i,j), i≠j, and the i strand directed SW to NE, τβ(pνa)=(tij/tji)τβ(apν),a∈e(ν)Be(srν). Dots, idempotents and same-color crossings have ratio 1. The twofold right-adjunction mate of pν has the same ratio to pν; this is a comparison of the actual separately constructed color adjunctions. Choose a total order on the finite color support and set cν=∏a<b, νa>νbtνaνbtνbνa,c=∑νcνe(ν). Then tr⁡β(a)=τβ(ca) is perfect and symmetric of degree tβ, so DB≅B{tβ} as graded bimodules. For a finite projective P, DψP≅P#{tβ}. For arbitrary monic field deformations the same actual constructions give an ungraded perfect symmetric form; a homogeneous degree is not asserted. On zero blocks the functional is zero and perfectness is vacuous. At rank zero it is the identity on k; at one strand it is monic top-coefficient extraction, of degree −2di(λi−1) in the standard case.

Facts & Assumptions

Given: The cyclotomic quotient and the actual basic first/second adjunction maps, with the first-strand/right-append conventions.

[F1]

The actual A-bilinear cap, central Casimir and both bimodule triangles of Cyclotomic induction and restriction have compatible Frobenius dual bases. They give Ei{ti(γ)}⊣Fi⊣Ei on all modules, where ti(γ)=2di(1−⟨hi,Λ−γ⟩); they have native dot/same-color cyclicity and actual partial different-color mate pairs, each with the same scalar in both orders.

[F2]

The concrete flag-normalization identities of The polynomial flag comparison has the prescribed second-mate inverse: for p′=pQij/tij the normalized relative cap satisfies πϵ^p′(Qijlift⁡(z))=tijϵ^p(z), and its dual cup satisfies the corresponding identity. The i-partial handed mate pair aij,bij has bijaij=tij1 and aijbij=tij1; its inverse is its companion divided by tij. The separately distinguished-j calculation uses tji. These are actual normalized cap identities, not a conclusion of full two-color cyclicity.

[F3]

The exact normal forms, cap-ideal intersection and downward-retract transport of Oriented minimal-parabolic normal forms and the cyclotomic cap ideal identify these contractions with maps of actual cyclotomic word modules. They allow all finite downward diagrams to be expanded as dot-polynomial reduced matchings and shorter-crossing corrections. The local cap and cup identities in [F2] may be whiskered and evaluated in arbitrary such contexts.

[F5]

The actual common downward residual of Actual partial Frobenius caps satisfy all two-color terminal contractions: for p=τe(ηij) and a∈e(ηij)Be(ηji), TiTj(ap)=tjiDη(a),TjTi(pa)=tijDη(a). Its generic polynomial-operator lift identifies the actual caps on both relative Mackey summands, cancels the complementary crossing factor, and descends the common old-corner map before quotienting. The identity holds for every terminal matching pattern, with no simultaneous finite flag coefficient-ring premise.

Proof

Proof technique: assemble the explicit word adjunction pairings, calculate the three terminal contractions with the actual normalized partial caps, and remove the ordered crossing ratios by an intrinsic inversion product.

1.1F1F4constructalgebra

Composed actual word adjunctions. If ν=(ν1,…,νn) and γr=∑a≤rανa, compose [F1] in chronological right-append order. This gives Eν{tβ}⊣Fν⊣Eν, because ∑rtνr(γr−1)=∑r[2dνr−2(Λ,ανr)+2(γr−1,ανr)]=(β,β)−2(Λ,β). The equality uses (αi,αi)=2di and expansion of the square of the sum, so it is independent of the chosen word. Composing the actual counits gives ϵν, and composing the actual units gives the reverse word Casimir; each composition obeys both triangles by successive applications of the component triangles. This is a construction of maps, not a inference from a Grothendieck-module relation.

1.2F1algebra

Reduce an arbitrary crossing to the terminal pair. Put ν=(η,i,j,ζ), where the singled crossing is between positions r,r+1 and ∣η∣=r−1. First apply the actual caps for the suffix ζ, in reverse right-append order, to each product pνa and apν. Each cap is bilinear over its old algebra by [F1]; the singled crossing belongs to that old algebra, so each suffix cap moves it outside on its own side. The same suffix map therefore gives an opposite-corner element a0∈e(ηij)RΛ(γ+αi+αj)e(ηji), with products p0a0 and a0p0. Here p0=τre(ηij) is the terminal crossing in the shorter tower. Dots and crossings in the suffix need not commute with a: they are included in a, and only bimodule linearity moves the singled old crossing. Thus the same incoming algebra element is used in both terminal calculations.

1.3F1F3algebra

The actual arbitrary-prefix two-return contraction. Use Actual terminal dot caps have a prefix residue formula at the remaining prefix η, with the i,j dots denoted u,v. Its proof identifies the constructed Ti itself with [u−1]umRiη(u), including its canonical first-unit transport. For every old algebra coefficient and terminal dot polynomial g, it constructs a common residual map Dη(g)=[u−1v−1]g(u,v)Riη(u)Rjη(v) and proves TiTj(Qijg)=tjiDη(g) and TjTi(Qjig)=tijDη(g). The inner cap cancels its own spectator factor before extraction; the two remaining finite coefficient extractions commute in the old algebra corner. Thus the two-return quadratic pattern has the required ratio for arbitrary prefixes and all weights, not only at the vacuum. This does not identify the actual residual external maps for the zero- and one-return patterns.

2.1step 1.1F1F4algebra

The actual functional and its whole regular pairing. Word induction from the vacuum gives Fνk=Be(ν), and word restriction is EνM=e(ν)M. The composed second adjunction sends f∈HOM⁡B(M,Be(ν)) to the functional e(ν)m↦ϵν(e(ν)f(m)), with shift {−tβ}. This is an isomorphism by the actual word unit/counit triangles. There are finitely many words of the fixed root weight, so summing gives HOM⁡B(M,B)≅DM{−tβ}. At M=B, right multiplication by a maps to b↦τβ(ba); hence that map is an isomorphism B→DB{−tβ}. In particular the mixed corner e(η)Be(ν) pairs perfectly with its opposite corner; no diagonal-only nondegeneracy argument is used. The counit degrees in step 1.1 give deg⁡τβ=tβ.

3.1step 2.1step 1.2step 1.3F1F5algebra

All terminal contractions and the actual double mate. Apply [F5] to a0 from step 1.2. Its two cap compositions give tijDη(a0) for p0a0 and tjiDη(a0) for a0p0 in the same old corner. Closing the unchanged prefix η by its actual composed counit proves τ(pνa)=(tij/tji)τ(apν). This includes all zero-, one- and two-return matchings and their lower-crossing corrections; step 1.3 identifies the two-return polynomial special case directly. For dots and equal-color crossings use the actual cyclic normalization of [F1], whiskered through the same suffix/prefix argument. Choose finite homogeneous dual bases xα,yα for the actual word form of step 2.1, so b=∑αxατ(yαb)=∑ατ(bxα)yα. Contracting the actual word unit and counit gives the right rotation pν∗∗=∑αxατ(pνyα); its order is fixed by using the right mate, and the opposite rotation would use the inverse order. Hence τ(apν∗∗)=∑ατ(axα)τ(pνyα)=τ(pνa) by the second dual-basis identity. The perfect opposite-corner pairing therefore identifies pν∗∗=(tij/tji)pν. This contraction is the unit/counit definition of the actual mate, independent of the chosen dual bases. To obtain equality of natural transformations at every input algebra, apply the calculation to every vacuum word projective of that input: their finite sum is its regular module, so equality there is equality of the actual tensor-bimodule maps. Tensoring those maps gives the same equality on arbitrary modules. Thus the result concerns the actual separately constructed color adjunctions, with all prefix and suffix triangles, rather than a single scalar closure test.

4.1step 2.1step 3.1constructalgebra

Diagonal weights and symmetry. Fix a total order on the finite color support of β and define cν by the inversion product in the Statement. An adjacent pair (i,j) creates or removes exactly its own inversion, so csrν/cν=tji/tij; an equal-color swap changes nothing. The product is intrinsic to the word, hence independent of any sorting path. Equivalently the square move multiplies reciprocal factors, a far move commutes disjoint factors and the three-strand move has the same three pair factors on both sides. All factors are nonzero degree-zero field scalars. With tr⁡(a)=τ(ca), the ordered closure identity of step 3.1 gives tr⁡(pνa)=csrν(tij/tji)τ(apν)=cντ(apν)=tr⁡(apν). Dots, idempotents and equal-color crossings already have the same cyclicity without changing c. Any element is a linear combination of products of these generators, and moving the generators one at a time through the functional gives tr⁡(ab)=tr⁡(ba) for every a,b. Since multiplication by c is invertible, the perfect pairing of step 2.1 stays perfect; its degree remains tβ.

5.1step 4.1F4algebra

The symmetric bimodule consequence. The symmetric perfect pairing of step 4.1 identifies B{tβ} with DB as graded left and right bimodules: the map sends a to the functional b↦tr⁡(ba); symmetry makes left and right multiplication agree with the two dual actions. For a finite graded projective P, evaluation on shifted free modules and restriction to a retract gives DψP≅HOM⁡B(P,DB)ψ≅HOM⁡B(P,B)ψ{tβ}=P#{tβ}. No assertion that every shifted projective is self-dual, or that every finite module is projective, is made.

6.1step 1.1step 2.1step 3.1step 4.1F1F2F3F4F5algebra∎

Zero, vacuum and deformation cases. If B=0, all word projectives and functionals vanish and the pairing is the zero-to-zero isomorphism. At β=0 the sole empty word has the identity counit on k and degree zero. At β=αi the actual cap from [F1] is top-coefficient extraction on k[z]/zλi, with degree −2di(λi−1); if λi=0 the positive-root block is zero. For a monic ai the same remainder coefficient and Casimir work ungraded. The constructions in [F1]–[F3] are actual monic polynomial identities, and only nonzero tij and units of triangular matrices are inverted, so arbitrary monic specialization preserves the constructed word perfect pairing with shifts forgotten. The actual terminal identities of [F5] are also monic identities descended before quotienting, so step 3.1 and the inversion rescaling retain the ordered mates and symmetry under the same specialization. Finite dimension is supplied separately by [F4]. Fixed root degree involves finitely many colors, words and tensor summands; no additional infinite choice, characteristic-zero or finite-type hypothesis occurs.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Coherent graded biadjunction and the crossing mates

Statement

For the standard homogeneous first-strand cyclotomic quotient over any field and every homogeneous (Q1)-(Q4) datum, use basic right-append induction Fi from β to β+αi and basic restriction Ei in the reverse direction. Put h=⟨hi,Λ−β⟩ and ti(β)=2di(1−h)=(αi∣αi)−2(Λ−β∣αi). Then there are explicit homogeneous bimodule units and counits with both triangle identities giving Ei{ti(β)}⊣Fi⊣Ei on all graded module categories. They preserve the standard dot-cyclic and same-color crossing-mate identities and the coherent different-color double-mate identity: for pν=τre(ν) with bottom adjacent colors (i,j), i≠j, its double right mate is (tij/tji)pν, where tij is the coefficient of u−aij in Qij(u,v) and the strand of color i runs SW to NE. Equivalently the associated right closure satisfies cl⁡(pνa)=(tij/tji)cl⁡(apν) for a∈e(ν)RΛ(β)e(srν); dots, idempotents and equal-color crossings have ratio 1. The corresponding arbitrary monic field quotients have the same underlying ungraded biadjunction and ordered crossing-mate identities after forgetting internal shifts. No Frobenius, integral Grothendieck-module or crystal theorem is a premise.

Facts & Assumptions

Given: The standard right-append induction and basic restriction of Cyclotomic KLR induction and restriction functors, with the algebra diagram convention of The KLR grading and the diagrammatic multiplication.

[F1]

The actual cap Ti:eBe→A, finite central Casimir Ci=∑xα⊗Ayα, both dual-basis equations and actual dot/same-color cyclicity of Cyclotomic induction and restriction have compatible Frobenius dual bases. They are constructed by independent flag/normal-form transport, preserving the first adjunction, without a trace premise.

[F2]

The actual word pairings and ordered closure/double-mate calculation of Cyclotomic word traces assemble a perfect symmetric form. Its full two-color terminal supplier constructs a common old-corner residual map from generic PBW lifts before quotienting, rather than equating the scalars of two separately distinguished partial pairs.

Proof

technique · use the constructed regular-module bimodule maps and dual-basis identities for the second adjunction, and apply the proved typed all-pattern closure calculation to its actual crossing mates
1.1F1constructalgebra

Explicit units, counits and triangles. Put A=RΛ(β), B=RΛ(β+αi), e=e(β,i), X=Be, Y=eB and t=ti(β). The ordinary first unit is the append homomorphism ιi:A→eBe, a↦ιi(a), and its counit is multiplication; the map need not be injective. On a module the unit is m↦e⊗m, and both triangles follow from tensor balancing and multiplication, including when e=0. For the second adjunction use the actual map y⊗Bx↦Ti(yx) and unit b↦bCi of [F1], tensoring with the input module. The balancing uses A-bilinearity of Ti and B-centrality of Ci. Its two triangle composites send x to ∑xαTi(yαx)=x and y to ∑Ti(yxα)yα=y. Their degrees are respectively t and −t, so the resulting degree-zero adjunction is Ei{t}⊣Fi, together with Fi⊣Ei. These exact bimodule identities hold after tensoring with every graded module; no finite-projective-only extension or quotient flatness is assumed.

2.1step 1.1F1F2algebra

Actual crossing compatibility. The cap/Casimir maps in step 1.1 were transported through the canonical first-adjoint comparison, so [F1] gives native dot and equal-color mate cyclicity. For unequal colors, let pν=τre(ν)∈e(srν)Be(ν) with bottom pair (i,j) and a∈e(ν)Be(srν). The common residual in [F2] evaluates apν in the ij corner with scalar tji and pνa in the ji corner with scalar tij. Close a suffix first using actual cap bilinearity and then the unchanged prefix to obtain cl⁡(pνa)=(tij/tji)cl⁡(apν). The constructed perfect opposite-corner word pairing and unit/counit evaluation compatibility identify the double right mate with (tij/tji)pν. This fixes its direction under bottom-to-top operator composition; reversing the chosen crossing exchanges the ratio. Passing from source κ to native τ=−κ negates both paired single crossings and does not change the ratio. No conclusion is inferred from assigning different scalars to the two orders of one fixed partial pair. Apply the actual mate equality to every vacuum word projective of the input algebra. Their finite sum is its regular module, so the equality is one of tensor-bimodule maps, and tensoring gives it on arbitrary modules.

3.1step 1.1step 2.1F1F2algebra∎

Boundaries, monic quotients and conclusion. The construction of [F1] includes zero append corners, where both functors and tensors are zero, and the vacuum monic coefficient cap and dual-power Casimir. All maps and both triangles are integral monic coefficient identities, and the full terminal comparison of [F2] descends to the ordinary polynomial algebra before quotienting. Arbitrary monic field specialization therefore retains the same maps, triangles and ordered mates with shifts forgotten. In the standard homogeneous branch the cap/Casimir degrees in step 1.1 give the displayed ti(β) at every weight. Thus the full stated biadjunction and native ordered mate identities hold on all graded modules, with no finite-type, characteristic-zero, Frobenius, Grothendieck-module or crystal premise.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Cyclotomic KLR blocks are finite-dimensional graded symmetric algebras

Statement

For the STANDARD graded cyclotomic quotient over any degree-zero field and admissible graded real symmetrizable KLR datum, every block B=RΛ(β) is finite-dimensional, all dots are nilpotent, and RΛ(β+nαi)=0 for large n. Put def⁡Λ(β)=(Λ,β)−(β,β)/2. A nonzero block has a perfect symmetric homogeneous functional tr⁡β:B→k of degree tβ=−2def⁡Λ(β); on a zero block perfectness is vacuous and the functional is zero. Thus DB≅B{tβ} as graded bimodules. For finite projective P, with P#=HOM⁡B(P,B)ψ, one has DψP≅P#{tβ}, so vector duality preserves projectives. This does not assert P#=P for every shifted projective, nor self-duality of every indecomposable finite module. For arbitrary monic deformation polynomials the separate conclusion is finite-dimensional and symmetric UNGRADED, with finite root strings and monic dot annihilators; nilpotence and homogeneous trace degree are not asserted. In rank one the standard trace is the top coefficient on k[x]/xλi and has degree −2di(λi−1).

Facts & Assumptions

Given: The standard cyclotomic quotient RΛ of The cyclotomic KLR quotient at a dominant integral weight and a block B=RΛ(β).

[F1]

The dot-annihilator/root-string lemma (Cyclotomic dot annihilators, finite-dimensional blocks, and finite root strings): B is finite dimensional, every dot is nilpotent in the standard case, and RΛ(β+nαi)=0 for large n; in the monic branch the statements are ungraded.

[F2]

The actual composed word adjunctions and perfect symmetric functional of Cyclotomic word traces assemble a perfect symmetric form, constructed from the cap/Casimir maps of Coherent graded biadjunction and the crossing mates. Its inversion weights use the typed closure ratio tij/tji for p=τe(ij); the full two-color residual is proved before quotienting, not assumed from projectivity or a categorical commutator.

[F3]

The KLR Cartan pairing of The KLR Cartan (graded Hom) pairing on the projective Grothendieck group and the finitely generated graded projective module conventions of Finite graded projective modules, with internal shifts of Associative graded algebras, bimodules, and internal shifts.

Proof

Proof technique: sum the vacuum-word projectives to the regular module, use the shifted second adjunction to produce a natural degree-tβ functional, show its induced pairing is perfect and symmetric, then restrict to finite projectives.

1.1F1

Finite dimensionality and the regular module. By [F1] every block B is finite dimensional (ungraded in the monic branch), every dot is nilpotent in the standard case, and RΛ(β+nαi)=0 for large n. Sum the vacuum word projectives Fνk=Be(ν) over the words ν of weight β to obtain the regular module B=⨁νBe(ν).

2.1step 1.1F2

The actual perfect word form. Compose the actual second caps along ν to obtain ϵν, and put τ(a)=∑νϵν(e(ν)ae(ν)). By [F2], the composed shift is tβ=(β,β)−2(Λ,β)=−2def⁡Λ(β). The actual word adjunctions identify HOM⁡B(M,B) with DM{−tβ}; at M=B the isomorphism is a↦[b↦τ(ba)]. It proves perfectness of every opposite-corner pairing, including off-diagonal corners, rather than assuming that a nonzero diagram closure detects every ideal.

3.1step 2.1F2F3constructalgebra

Symmetry and its exact weights. Choose a total order on the finite color support and set cν=∏a<b,νa>νbtνaνb/tνbνa, c=∑cνe(ν). The inversion product is intrinsic to the word and gives csrν/cν=tji/tij for a bottom pair (i,j). By [F2], τ(pa)=(tij/tji)τ(ap); hence tr⁡(a)=τ(ca) is cyclic on unequal crossings. It is cyclic on dots, idempotents and equal-color crossings by the actual native mate identities. Moving generators successively through the functional proves symmetry on every product. All cν are nonzero degree-zero scalars, so multiplication by c is invertible, preserving perfectness and degree. The symmetric pairing therefore identifies DB with B{tβ} as graded bimodules.

4.1step 3.1F1F2F3algebra∎

Finite projectives, boundaries and monic specialization. Evaluating the symmetric bimodule isomorphism on shifted free modules and cutting by an idempotent gives DψP≅HOM⁡B(P,DB)ψ≅P#{tβ} for every finite projective P. Thus vector duality preserves projectives, without asserting P#=P for every shift or self-duality of every finite module. At a zero block the form is zero and its pairing is zero-to-zero; at rank zero it is the identity of k. At one strand it is the monic top-coefficient form, with degree −2di(λi−1) in the standard homogeneous case. The actual cap/terminal identities of [F2] are monic identities descended before taking the quotient. They therefore construct the same perfect symmetric form in every monic field deformation with shifts forgotten. Finite dimension and finite root strings in that branch come independently from [F1]; neither nilpotence nor homogeneous trace degree is claimed there.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Cyclotomic diagram duality and graded module duals

Definition

Let B=RΛ(β) be a standard graded cyclotomic block (The cyclotomic KLR quotient at a dominant integral weight) and let ψ be the descended anti-involution fixing e(ν),xa,τa; it is well defined because its individual first-strand polynomial generators are fixed, and it is the generator-fixing member of the two ψ's in play (The KLR Cartan (graded Hom) pairing on the projective Grothendieck group). Write shifts internally as (M{r})m=Mm−r (Associative graded algebras, bimodules, and internal shifts).

Vector duality. For a finite graded B-module M define DψM:=HOM⁡k(M,k)ψ, the finite k-linear dual with B-action (af)(m)=f(ψ(a)m). It is a finite graded B-module, reverses internal shifts, and Dψ2M≅M.

Projective Hom duality. For a finite graded PROJECTIVE P define instead P#:=HOM⁡B(P,B)ψ, with the ψ-twisted B-action. This is again a finite graded projective, it reverses internal shifts, and (P#)#≅P on finite graded projectives (Finite graded projective modules).

They are different dualities. Hom duality is not applied to a nonprojective simple to produce its cover; Dψ and # differ already in rank one, where B=k[x]/xλ has B#=B while DψB≅B{−2di(λ−1)}.

Normalizations used in the based statements. By Cyclotomic projective covers and dualities descend through the quotient, each simple shift orbit has a unique Dψ-self-dual representative S, and its unique normalized cover P with Hom⁡0(P,S)=k is #-self-dual; these normalized representatives are the ones used in the based statements below. The symmetric theorem Cyclotomic KLR blocks are finite-dimensional graded symmetric algebras additionally gives DψP≅P#{−2def⁡Λ(β)}; it does not change the canonical projective normalization. No self-dual shift is asserted for every indecomposable finite module, and no choice is used.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The cyclotomic module G0 is the restricted dual integral highest-weight module

Statement

For the same standard homogeneous general-field/general-Cartan parameters as the integral projective theorem, the tensor pairing T(P,M)=gdim⁡(Pψ⊗M) is weightwise perfect and A-bilinear, with normalized cover/simple dual bases. Its associated map Ψcan:G0(RΛ)⟶VA(Λ)∨=⨁βHom⁡A(VA(Λ)Λ−β,A),Ψcan(M)(ϕ(P))=T(P,M) is an isomorphism to the RESTRICTED weight dual, identified inside V(Λ) using the highest-weight contravariant form. It intertwines the CANONICAL module action having the same normalization as projective K0, and sends normalized simple classes to the form-dual projective basis. The KK module action is also sound, but its intertwiner is ΨKK∣β=qdef⁡Λ(β)Ψcan∣β. Thus an unrescaled KK identification is not asserted to send simples to the upper global basis. The Hom pairing is instead first-bar-sesquilinear, h(P,M)=T(P#,M); this does not alter the bilinear tensor-dual identification.

Facts & Assumptions

Given: The standard cyclotomic quotient RΛ, the two Grothendieck groups with their normalizations (Cyclotomic KLR functors define an integrable quantum action on K0 and G0), and the projective identification The cyclotomic projective K0 is the integral highest-weight module.

[F1]

The quotient-cover lemma (Cyclotomic projective covers and dualities descend through the quotient): finite blocks have finitely many absolutely simple graded shift orbits and normalized projective covers; T(P,S)=δP,S in normalized bases and T is A-bilinear with h(P,M)=T(P#,M).

[F2]

The projective identification The cyclotomic projective K0 is the integral highest-weight module: K0(RΛ)≅VA(Λ) with highest vector 1Λ under the vacuum normalization.

Proof

Proof technique: dualize the perfect tensor pairing to an isomorphism onto the restricted weight dual, then check that the adjunction identities of the functors translate into the restricted contravariant-dual action and compare the two normalizations.

1.1F1F2

Perfectness and the dual isomorphism. By [F1] each weight component has finitely many absolutely simple graded shift orbits and normalized projective covers, and the exactness of projective tensor pairing together with the unscaled diagonal values gives perfectness over A on each weight. Hence G0 is free on the simple classes and the functional map Ψcan(M)(ϕ(P))=T(P,M) is an isomorphism from G0(RΛ) to the weightwise dual ⨁βHom⁡A(VA(Λ)Λ−β,A), i.e. the restricted weight dual and not a full unrestricted product dual.

2.1step 1.1F2F3

Intertwining with the canonical action. Transport K0 by ϕ; its tensor form is the actual highest-weight contravariant form with σ(Fi)=qi−1KiEi (The contravariant form on an integrable highest weight module). From tensor adjunction, T(P,FibasicM)=T(EibasicP,M)=T(σ(Fi)P,M), and the analogous normalized identity is T(P,EicanM)=T(σ(Ei)P,M); these are precisely the restricted contravariant-dual action relations, so Ψcan intertwines the canonical module action with the dual action and sends normalized simple classes to the form-dual projective basis.

3.1step 2.1F1F3∎

The KK normalization and the Hom pairing. The Kang--Kashiwara action differs from the canonical one by the weight rescaling qdef⁡Λ(β) on root β, so its intertwiner is ΨKK∣β=qdef⁡Λ(β)Ψcan∣β; in particular the unrescaled KK identification is not asserted to send simples to the upper global basis. The Hom pairing satisfies h(P,M)=T(P#,M) by [F1] and is first-bar-sesquilinear, which concerns the other duality and does not alter the bilinear tensor-dual identification. The Axiom of Choice is inherited only through the integral projective identification [F2] and the contravariant-form suppliers [F3].

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Simple and indecomposable-projective crystals agree with B(Λ)

Statement

Assume the Axiom of Choice The Axiom of Choice.

For the standard homogeneous cyclotomic quotient over any field with the general real symmetrizable datum and graded KLR parameters, let BΛ be the normalized Dψ-self-dual simple classes. Set wt⁡(S)=Λ−β, εi(S)=max⁡{r:(Eibasic)rS≠0} and φi(S)=εi(S)+⟨hi,wt⁡(S)⟩. For εi>0, define e~iS by the unique simple isomorphism type in the socle of one-step right restriction, with its unique self-dual normalization, and set e~iS=0 when εi(S)=0; define f~iS by the unique self-dual normalization of the simple head of right induction when nonzero, otherwise zero. The one-step socle/head is one shifted copy, not a quantum-factorial multiplicity. These data form a crystal canonically isomorphic to B(Λ), with vacuum sent to uΛ. The normalized indecomposable projectives carry the same crystal by their normalized simple heads and covers. The projective graph here is explicitly transported from these labels, rather than obtained by applying linear Kashiwara operators to an unspecified projective basis. The highest-weight quotient has simple survivors exactly when εiLEFT(S)≤λi for every i.

Facts & Assumptions

Given: The Axiom of Choice and the standard cyclotomic quotient over any field with general real symmetrizable datum and graded KLR parameters, and the normalized simple and projective labels of Cyclotomic projective covers and dualities descend through the quotient and Cyclotomic diagram duality and graded module duals.

[F1]

The one-step theorem One-step simple restriction and induction, and the first-dot index: for a cyclotomic (or generic) simple S, one-step restriction has a single simple socle and head once, with εi decreasing by one, induction has the unique simple head fiS occurring once, and the first-dot index identifies the first-strand ideal criterion with εiLEFT≤λi; this works over the original field including positive characteristic.

[F2]

The two-colour jump formula and strict elementary embeddings The two-colour jump formula and strict elementary embeddings: the full general-Q jump formula, strictness and everywhere-positive extraction, from actual shuffle filtrations and divided restriction multiplicities; the linear Serre relation is applied in G0, not to a non-linear simple operator.

Proof

Proof technique: inflate to the generic algebra, apply the one-step and two-colour inputs to the simple graph, identify it with the canonical crystal and its highest-weight quotient, and transport the labels to projective covers.

1.1givenF1F2

The simple graph. Inflate a cyclotomic simple to the generic algebra; by [F1] the one-step restriction has a single simple socle and head once and induction has the unique simple head, giving well-defined operators e~i,f~i on shift orbits with εi decreasing by one under e~i and increasing by one under f~i. By [F2] the graph is lowering-generated with strict elementary extractions and positive extraction at every nonvacuum vertex, over every field including positive characteristic. The normalized-label supplier in the Given identifies each simple shift orbit with its unique Dψ-self-dual representative. Taking that representative for each nonzero socle and induction head lifts both operators to BΛ and preserves their partial-inverse identities.

2.1step 1.1F3

Identification with B(Λ). Apply the canonical elementary extraction of [F3]: the generic simple graph is canonically B(∞) and the first-strand cyclotomic survivors are exactly the vertices with ci(b)≤λi for all i, which is the crystal B(Λ) with vacuum uΛ; the survivor criterion is εiLEFT(S)≤λi for every i by the first-dot index of [F1]. The one-step socle/head is one shifted copy, so no quantum-factorial multiplicity enters.

3.1step 2.1F3∎

Projective labels. The normalized indecomposable projectives carry the same crystal by their normalized simple heads and covers: the quotient-cover lemma pairs each projective cover with its simple head without scaling and preserves the label under the quotient, while the two Grothendieck identifications of [F3] record the same labels on K0 and G0. The projective graph is therefore explicitly transported from the simple labels, not obtained by applying linear Kashiwara operators to an unspecified projective basis. The assumed Axiom of Choice supplies the inherited hypotheses of the canonical-extraction and Grothendieck-identification suppliers of [F3], including the integral projective theorem and its restricted-dual consequence; transporting normalized cover labels introduces no further choice.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Cyclotomic extension of scalars respects the based quotient

Statement

Assume the Axiom of Choice (The Axiom of Choice), inherited through the generic global-basis, quantum-projection and canonical crystal suppliers.

Assume the full symmetric normalized-di=1, characteristic-zero, loopless-quiver geometric-parameter scope of the generic global theorem, and the STANDARD homogeneous first-strand cyclotomic quotient with RIGHT append. Let γ:UA−→K0(R) be the approved generic categorification and ϕ:K0(RΛ)→VA(Λ) the vacuum-normalized integral isomorphism. Then the raw extension qΛ(P)=RΛ⊗RP satisfies ϕ[qΛ(P)]=πΛ(∗(γ−1[P])). Composing extension with the generic mirror twist gives πΛ without star. For b∈B(∞) and the generic normalized indecomposable projective Pb with γ−1[Pb]=G−(b), raw extension is zero or a SINGLE normalized indecomposable cyclotomic projective; its image is πΛG−(b∗), which is zero or GΛ−(πΛb∗). The surviving cover orbits do not merge, and every normalized cyclotomic cover is obtained. In RIGHT-simple labels c, the generic FIRST-recursion theorem gives γ−1[P(Sc)]=G−(c∗), so raw extension sends it to GΛ−(πΛc); these are exactly the crystal-compatible survivor labels of the preceding theorem. The claim is for indecomposable projectives, not every finite projective quotient.

Facts & Assumptions

Given: Assume the Axiom of Choice. The standard first-strand cyclotomic quotient with right append, the generic categorification γ and the vacuum-normalized integral isomorphism ϕ, in the geometric parameter scope above.

[F2]

The word-mirror involution and the quantum star (The word-mirror involution of a KLR algebra and the quantum star): it commutes with projective Hom duality, reverses separated-block induction, and induces the multiplication-reversing star fixing every Fi and q.

[F4]

The positive FIRST-block coefficient-1 expansion and integral LEFT-string ideal equality of Self-dual KLR projectives have positive first-block divided-string leading terms, and the FIRST/RIGHT one-step simple recursion of One-step simple restriction and induction, and the first-dot index. These are the existing algebraic inputs to the approved FIRST/RIGHT comparison; the crystal graph on covers is transported from heads, not an independent linear action on a projective basis.

Proof

Proof technique: compare the side conventions on divided words, use the mirror twist to convert star into the identity, and read survival and non-merging off the cover-descent lemma.

1.1F1F2

The raw extension map on divided words. Right append sends a word ν1⋯νn to Fνn⋯Fν1vΛ, whereas the generic multiplication convention assigns Fν1⋯Fνn; on actual divided word classes the map is therefore πΛ∘∗. Their A-span is all generic K0 by [F1], so this determines the map integrally, giving ϕ[qΛ(P)]=πΛ(∗(γ−1[P])); composing with the generic mirror twist of [F2], which supplies exactly ∗ and commutes with projective Hom duality, gives πΛ without star.

1.2F1F2

Positive star on the global basis. The generic mirror equivalence of [F2] preserves indecomposability and commutes with projective Hom duality, hence permutes the normalized generic covers. Once the generic global theorem in [F1] is instantiated, their classes are exactly the positive lower global vectors. Its induced quantum star therefore permutes these vectors with positive sign: ∗G−(b)=G−(b∗). This is a consequence of the generic global theorem used here, not an input to its geometric or sign proof.

2.1step 1.1step 1.2F1F3

Survival and non-merging. For a surviving normalized generic simple S, quotient Hom base change in the cover-descent lemma [F3] sends its normalized projective cover to the cyclotomic normalized cover, commutes with #, and preserves its unscaled head pairing; if its simple is killed, the quotient is zero, because any nonzero finite quotient of the cover has a simple head and adjunction would produce a surviving generic head of the original cover. Thus raw extension of a generic normalized indecomposable projective is zero or a single normalized indecomposable cyclotomic projective, and distinct surviving heads do not merge; the image is πΛG−(b∗) respectively GΛ−(πΛb∗) under the projections of [F1].

3.1step 1.2step 2.1F1F2F3F4algebra∎

All-color label comparison in exact string quotients. In the scope where the generic global theorem [F1] has been established, define η(S) by γ−1[P(S)]=G−(η(S)); equality of positive basis sets makes η a bijection, not yet a crystal comparison. For every color i the LEFT-string ideal equality of [F4], together with the adapted global basis, gives εi(η(S))=ϵiL(S). If this common number is r>0, put T=(eiL)rS, so ϵiL(T)=0 and T has smaller height. The coefficient-1 projective expansion of [F4] gives Fi(r)G−(η(T))−G−(η(S))∈I(i,≥r+1). The exact adapted quantum transition in [F4] gives Fi(r)G−(η(T))−G−(f~irη(T))∈I(i,≥r+1). Subtract these congruences. Both global vectors have exact i-position r, and their classes belong to the free adapted basis of I(i,≥r)/I(i,≥r+1); equality of these classes therefore forces η(S)=f~irη(T), rather than merely equality of tail lengths. Replacing S by eiLS in the same calculation with r−1 gives η(eiLS)=e~iη(S), and the partial-inverse identities give the corresponding fiL equality. This holds for EVERY color with positive first tail. The unit maps to 1, and every nonvacuum simple has a positive first tail since some first-word corner is nonzero; finite height induction now proves compatibility along every first-end lowering word. No path choice enters: η was already defined by its actual global vector, and the exact quotient equality proves that all paths compute this same label. The mirror equivalence of [F2] exchanges FIRST and RIGHT operators on simple shift orbits, fixes the vacuum and induces star on normalized cover classes. Hence, once the general canonical RIGHT-label identification of [F3] is supplied, γ−1[P(Sc)]=G−(c∗) and step 1.1 cancels the two stars to give GΛ−(πΛc). Every normalized cyclotomic cover is obtained by inflating its simple and descending its generic cover. The Axiom of Choice is inherited through the generic global-basis, adapted quantum-string and quantum-projection contracts in [F1], [F4] and the canonical-extraction supplier of [F3]; no additional infinite choice is used. This proves the exact all-color adapted comparison conditional on the actual generic global theorem and canonical graph identification, and does not establish either unresolved supplier by an equality of basis sets.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Self-dual indecomposable cyclotomic projectives give the lower global basis

Statement

Assume the Axiom of Choice (The Axiom of Choice), inherited through the based-quotient, generic global-basis, projection and canonical crystal suppliers.

For a symmetric Cartan datum normalized by di=1, over any characteristic-zero field, and the SAME finite loopless quiver with arbitrary edge multiplicities and Qij=(−1)hij(u−v)hij+hji as the generic global theorem, use the STANDARD homogeneous first-strand quotient and RIGHT append. The vacuum-normalized isomorphism ϕ:K0(Proj RΛ)→VA(Λ) maps the classes of normalized #-self-dual indecomposable cyclotomic projectives bijectively onto the lower global basis. The normalization is by projective HOM duality and normalized simple heads, not by finite vector duality or a half-trace shift. The projective with RIGHT crystal label c∈B(Λ) maps to GΛ−(c). Every such projective is the surviving extension of a generic normalized cover, with the raw map πΛ∘∗ and the FIRST/RIGHT label cancellation proved in the based-quotient lemma. The uniqueness is at the level of normalized indecomposable projective isomorphism classes; this is not an assertion that its generic lift is unique. No arbitrary-parameter based extension is asserted.

Facts & Assumptions

Given: Assume the Axiom of Choice. The symmetric normalized di=1, characteristic-zero, loopless-multiedge geometric-parameter scope, the standard first-strand quotient with right append, and the vacuum-normalized integral isomorphism ϕ.

[F1]

The based-quotient lemma (Cyclotomic extension of scalars respects the based quotient): raw extension sends each surviving normalized generic cover to a single normalized cyclotomic cover with the map πΛ∘∗, distinct survivors do not merge, and every normalized cyclotomic cover is obtained.

[F2]

The generic global theorem (Self-dual indecomposable KLR projectives give the lower global basis (symmetric type)) and the quantum global projection (The based quotient: projection of the lower global basis to a highest weight module): normalized self-dual generic projectives give the negative-half lower global basis, and every lower global vector of VA(Λ) has a generic lift.

Proof

Proof technique: map each normalized cyclotomic cover to its based-quotient class, show injectivity by the free normalized basis, and show surjectivity by lifting lower global vectors through the generic theorem.

1.1F1

Cover classes land on lower global vectors. By [F1] all normalized cyclotomic covers are precisely the nonzero extensions of normalized generic covers, with distinct surviving simple heads; the based-quotient lemma sends each such class to a single positive lower global vector of VA(Λ), with no grading ambiguity because Hom base change preserves the #-normalization and the degree-zero head pairing.

2.1step 1.1F2

Surjectivity. Conversely the quantum global projection theorem [F2] supplies a generic global vector lifting every lower global vector of VA(Λ), and the generic theorem supplies its normalized generic cover; mirroring if necessary to use the raw first/right convention, its extension has that nonzero class and is a normalized indecomposable cover. Hence the assignment is surjective onto the lower basis.

3.1step 2.1F1F2F3∎

Bijectivity and labels. The integral K0 isomorphism and its free normalized projective basis make the assignment injective; the RIGHT crystal label identification of [F3] shows that the projective with RIGHT label c∈B(Λ) maps to GΛ−(c), with the FIRST/RIGHT label cancellation proved in the based-quotient lemma. The uniqueness is at the level of normalized indecomposable projective isomorphism classes, not of generic lifts, and no arbitrary-parameter based extension is asserted. The Axiom of Choice is inherited through the generic global-basis and projection contracts of [F2], and the based-quotient and canonical crystal identifications of [F1] and [F3].

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Self-dual simple cyclotomic modules give the upper global basis

Statement

Assume the Axiom of Choice (The Axiom of Choice), inherited through the lower projective, canonical crystal, restricted-dual and global-basis duality suppliers.

In exactly the symmetric normalized-di=1, characteristic-zero, loopless arbitrary-multiedge geometric-parameter regime of the lower projective theorem, the CANONICAL restricted-dual identification Ψcan:G0(RΛ)→VA(Λ)∨ maps normalized Dψ-self-dual simple classes bijectively to the upper global basis, form-dual to the lower projective basis under the actual highest-weight contravariant form. A simple and its normalized projective COVER have the same B(Λ) label; this is the cover/simple correspondence, not projective Hom duality applied to a simple. Canonical G0 operators have the same projective normalization. The alternative KK module action remains valid, but its intertwiner is ΨKK=qdef⁡Λ(β)Ψcan on root β and sends a simple to that defect-rescaled upper vector. The unrescaled upper-basis claim is made only for Ψcan.

Facts & Assumptions

Given: Assume the Axiom of Choice. The geometric-parameter regime of the lower projective theorem, the normalized Dψ-self-dual simples and normalized covers, and the two restricted-dual identifications.

[F1]

The quotient-cover pairing (Cyclotomic projective covers and dualities descend through the quotient): T(P(S),S′)=δS,S′ in normalized bases.

[F2]

The lower projective theorem (Self-dual indecomposable cyclotomic projectives give the lower global basis): ϕ(P(S)) is the lower global vector with the same crystal label.

Proof

Proof technique: pair the normalized simple functional against the lower basis, identify it with the form-dual lower functional, and apply the upper/lower duality theorem; then compare the two normalizations.

1.1F1F2

The functional Ψcan(S). By [F1] the pairing is diagonal in normalized bases, and by [F2] the class ϕ(P(S)) is the lower global vector with the same crystal label; therefore Ψcan(S) is exactly the weightwise dual lower-basis functional with that label.

2.1step 1.1F3

Identification with the upper global basis. The integral projective identification [F3] identifies the tensor form on projectives with the actual highest-weight contravariant form; the upper/lower duality theorem identifies these restricted dual functionals with the upper global vectors and preserves crystal labels. This proves the bijection and the normalization statements, using neither a generic negative-half form nor a vector-dual trace shift.

3.1step 2.1F2F3∎

Cover/simple correspondence and the two actions. A simple and its normalized projective cover have the same B(Λ) label by the cover/simple correspondence of [F2], not by applying projective Hom duality to a simple. The G0 theorem [F3] proves the canonical action and its defect-rescaled KK version; keeping the two maps distinct preserves both sound quantum actions and the rank-one λ=2 check, with ΨKK=qdef⁡Λ(β)Ψcan on root β, so that only Ψcan gives the unrescaled upper-basis claim. The Axiom of Choice is inherited through the lower projective and canonical crystal suppliers, the QG-5 global-basis duality and the restricted-dual identifications of [F2] and [F3].

5 · Examples, counterexamples and false statements

None yet.

Sources