Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Maximal KLR tails give a unique induction head and absolute simple modules

Statement

Let R be any graded KLR datum in this page over any field k. For a finite-dimensional graded module M of weight β set ϵi(M)=max⁡{r:e(β−rαi,rαi)M≠0}. If S is simple and r=ϵi(S)>0, there is a simple graded R(β−rαi)-module N with ϵi(N)=0 such that ΔirS=N⊠L(ir), where L(ir) is the unique nil-Hecke simple up to shift. Conversely, for any such N, Ind(N⊠L(ir)) has a unique simple graded head S, appearing once as a composition factor, with ϵi(S)=r and ΔirS=N⊠L(ir); every other composition factor has smaller i-tail. The graded simples of every R(β) remain simple without grading and are absolutely simple; all ordinary endomorphisms are k and nonzero homogeneous endomorphisms have degree 0. The classes of normalized simples and their projective covers are therefore unscaled dual shift-orbit bases for the projective/simple Hom pairing. For each β there is a finite family of ordered divided-power words Yb whose normalized projective classes pair triangularly with the simple classes, with diagonal entries 1 after choosing the simple grading shifts. Thus the selected [P(Yb)] form an A-basis of K0(R(β)); arbitrary divided words span, but need not be a basis. The identical statements hold for maximal FIRST-color blocks, with ϵiL(M)=max⁡{r:e(rαi,β−rαi)M≠0}, restriction Δi(L,r) and induction Ind(L(ir)⊠N).

Facts & Assumptions

Given: A graded KLR datum over any field k, the functors Δi=Resβ−rαi,rαi and Ind of Generic KLR induction and restriction adjunctions preserve projectives, the finite-dimensional graded simples of Graded Krull-Schmidt and shift-orbit bases for finitely generated KLR modules, and the nil-Hecke idempotents and simple L(ir) of Nil-Hecke idempotents and divided-power KLR projectives.

[F1]

With Cr=k[x1,…,xr]Sr, the full nil-Hecke algebra NHr=R(rαi) is the graded endomorphism algebra of the Artin polynomial column, a free Cr-module of rank r!; thus it is a graded matrix algebra over Cr, with the corresponding row and column shifts. Its positive-center augmentation quotient is a graded matrix algebra over k, with its unique graded simple L(ir) absolutely simple up to shift. Every finite-dimensional graded simple over R(μ)⊗kNHr is killed by that positive-center ideal and is, up to shift, uniquely of the form N⊠L(ir) for a graded simple R(μ)-module; the center-annihilation argument is supplied in step 1.1.

[F2]

Exactness, the adjunctions and the Mackey filtration of Generic KLR induction and restriction adjunctions preserve projectives: Ind is left adjoint to Res, both are exact, and a corner restriction has a finite filtration whose subquotients are composites of four-block restrictions, flips and inductions with the displayed shifts.

[F3]

Krull-Schmidt and covers (Graded Krull-Schmidt and shift-orbit bases for finitely generated KLR modules): finite-dimensional graded modules have finite unique decompositions, simples are finite-dimensional, and the projective/simple Hom pairing has diagonal entries dim⁡kEnd⁡0(Sb).

Proof

technique · direct; identify the nil-Hecke tail by matrix units, compute the maximal restriction through the Mackey filtration, then run the triangular basis argument
1.1givenF1algebra

(Nil-Hecke tail and its matrix units.) The constant-colour block NHr=R(rαi) acts on its polynomial column over Cr=k[x1,…,xr]Sr. The Artin monomial basis and perfect symmetric-variable-linear trace of Nil-Hecke idempotents and divided-power KLR projectives give integral matrix units and identify the full algebra with graded endomorphisms of that free rank-r! column, hence with matrices over Cr carrying the Artin degree shifts. Reducing the positive-degree central elementary symmetric functions to zero gives the graded matrix quotient over k; its column simple L(ir) is absolutely simple, and the divided idempotent cuts out a one-dimensional image. Its full-algebra polynomial-column graded projective cover has degree-zero endomorphism ring k, although its entire endomorphism ring is Cr. If T is a finite-dimensional graded simple over R(μ)⊗kNHr, a positive-degree central operator has graded kernel and image. A nonzero such operator would therefore be invertible by graded simplicity, which is impossible on the finite nonzero degree support of T. Thus the positive tail center annihilates T, and it factors through R(μ)⊗kMat⁡r!(k) with the indicated shifts. Matrix units identify T with N⊠L(ir) for a graded simple R(μ)-module N, unique up to shift. This uses the augmentation matrix quotient for finite simples, not a false identification of the full nil-Hecke algebra with matrices over the ground field.

2.1step 1.1F2algebra

(Maximal restriction.) Let S be a finite-dimensional graded simple with r=ϵi(S)>0 maximal. The finite-dimensional module ΔirS is nonzero by the definition of ϵi and has a simple submodule; by step 1.1 it is of the form N⊠L(ir) for a graded simple R(β−rαi)-module N. If N carried a word ending in i, then concatenating any nonzero nil-Hecke tail word would produce a nonzero vector in S of tail r+1, contradicting maximality, so ϵi(N)=0. By the left adjunction of [F2] the inclusion N⊠L(ir)↪ΔirS corresponds to a nonzero map M:=Ind(N⊠L(ir))→S, which is surjective since S is simple. In the Mackey filtration of ΔirM every shuffle bringing t>0 colours i from the first block into the final tail contains a factor ΔitN and is zero; the only surviving filtration quotient is N⊠L(ir) with zero crossing shift, so ΔirM=N⊠L(ir) exactly. This is a one-surviving-quotient computation, not a semisimplicity assumption.

3.1step 2.1F1F3algebra

(Unique head and simplicity.) Every nonzero quotient Q of M has nonzero defining corner: if eQ=0 with e=e(β−rαi,rαi), then the composite Ae⊗B(N⊠L(ir))→M→Q is zero by the tensor/Res adjunction, hence Q=0. The finite graded semisimple head of M therefore has exactly one simple summand, occurring once, because its exact e-restriction is a quotient of the simple eM=N⊠L(ir); this head is S, and eM→eS is an isomorphism, so exactness gives eker⁡(M→S)=0 and every other composition factor of M has smaller tail. Underlying and absolute simplicity of S: induct on the height of β. For positive height choose i with r>0; by step 2.1 and induction N and L(ir) are absolutely simple, so eS=N⊠L(ir) has endomorphism ring k; if U≤S is any ungraded submodule with eU≠0, then eU=eS and U=S because S is generated by eS; if eU=0 and U≠0, filter S by FdS=⨁j≤dSj and U by FdU=U∩FdS. Every homogeneous algebra element of degree a sends FdU into Fd+aU, so gr⁡U embeds as a nonzero graded submodule of gr⁡S=S. Since e has degree 0 and annihilates U, it annihilates gr⁡U; graded simplicity gives gr⁡U=S, contradicting eS≠0. Thus S is simple as an ungraded module, and every R-endomorphism of S is determined on eS, giving End⁡R(S)=k. The finite-density matrix argument then shows absolute simplicity over every field: any m linearly independent vectors can be sent to arbitrary targets by one algebra element, by induction on m and the commutant k clause, so the action realizes all k-linear matrices and remains simple after field extension.

4.1step 3.1F3algebra

(Triangular divided-string basis.) Choose a cyclic order of the finite colour support and recursively strip maximal i-tails, producing for each simple shift orbit a finite tuple Yb of ordered divided powers; two simples with the same tuple agree by the unique-head recursion of step 3.1. Form P(Yb) from the reversed ordered normalized divided blocks. Its homogeneous Hom to Sc is the corresponding product of divided idempotents acting on Sc; comparing tuples lexicographically, if Yb>Yc at the first differing entry then the required tail exceeds the maximal tail of the successively stripped simple Sc, and the corner is zero. When the tuples agree, every maximal restriction is the simple tensor computed in step 2.1 and each nil-Hecke divided idempotent reduces the tail to one dimension, so by induction the diagonal Hom is a single Laurent monomial with coefficient 1. Shifting each Sb makes the diagonal 1. The finite matrix is triangular over A=Z[q,q−1] with diagonal 1; Krull-Schmidt and the projective-cover/simple Hom pairing (now with End⁡(S)=k from step 3.1) identify it with the matrix expressing the projective classes in the cover basis, and successive integral triangular elimination proves that the selected classes [P(Yb)] are an A-basis of K0(R(β)); the whole family of divided words spans because the recursion covers every simple, while redundancy of non-selected words is allowed. This completes the integral surjectivity argument without a PBW rank or flat-family shortcut.

5.1step 1.1step 3.1step 4.1F2algebra∎

(First-color version.) For maximal FIRST-color blocks use the defining idempotent e(rαi,μ) and M=Ind(L(ir)⊠N) with ϵiL(N)=0; a simple submodule of the maximal first-block restriction Δi(L,r)S has the form L(ir)⊠N by the same nil-Hecke matrix units of step 1.1, and any first-colour support of N would extend the maximal first block, so it vanishes. In the Mackey restriction of Δi(L,r)M every nontrivial shuffle bringing a positive number t of i-colours from N into the first block contains Δi(L,t)N and is zero, so the sole uncrossed quotient is L(ir)⊠N with shift 0; the defining-corner generation and exact-head argument of steps 3.1 and 3.1 are unchanged. Thus the first-block assertions are proved directly, with no unsigned star-crystal preservation assumed.

Depends on

Used by

Dependency tree · two levels

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

Sources