Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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.

Depends on

Used by

Dependency tree · two levels

24 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources