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.

Self-dual KLR projectives have positive first-block divided-string leading terms

Statement

For any graded KLR datum in this page and any field k, each finite-dimensional graded simple shift orbit has a unique representative Sb self-dual for D(M)d=Hom⁡k(M−d,k) with action (af)(m)=f(ψ(a)m). Its projective cover Pb, normalized by Hom⁡0(Pb,Sb)=k, satisfies Pb#=Pb for P#=HOM⁡R(P,R)ψ. These are unique normalizations. Induction of two self-dual finite projectives is self-dual. If ϵiL(Sb)=r>0 and Δi(L,r)Sb=L(ir)⊠Sa with ϵiL(Sa)=0, normalized as above, then [Pi,r][Pa]=[Pb]+∑ϵiL(Sc)>rmc(q)[Pc], with mc∈N[q,q−1] each invariant under q↦q−1. Under γ the integral LEFT divided-string ideal I(i,≥n)=∑r≥nFi(r)UA− is the A-span of [Pb] with ϵiL(Sb)≥n. Consequently, if the normalized projective classes are known to be a SIGNED lower-global set, this leading coefficient 1 identifies them with the POSITIVE lower-global set using the general adapted LEFT-string recursion; no finite-ADE canonical-comparison theorem is needed. For the conclusions compared with the quantum half and the conditional lower-global/LEFT-string recursion, carry the inherited Axiom of Choice of those quantum suppliers; the generic finite module duality/parity/Frobenius arguments themselves are choice-free.

Facts & Assumptions

Given: A graded KLR datum over any field k, the graded simple modules and projective covers of Graded Krull-Schmidt and shift-orbit bases for finitely generated KLR modules with the maximal-tail triangular basis and absolute simplicity of Maximal KLR tails give a unique induction head and absolute simple modules, the duality P# and pairing of The KLR Cartan (graded Hom) pairing on the projective Grothendieck group, and the isomorphism γ of The KLR category categorifies the negative quantum half.

[F1]

Maximal-tail basis (Maximal KLR tails give a unique induction head and absolute simple modules): there is a finite triangular A-matrix of divided-idempotent Homs against simples with diagonal 1, the simples are absolutely simple, and the selected divided words Yb give a triangular A-basis of K0(R(β)); the identical assertions holds for maximal FIRST-colour blocks.

[F2]

Divided powers (Nil-Hecke idempotents and divided-power KLR projectives): Pi,n is the unique indecomposable projective summand of R(nαi) up to shift and Pi,n#=Pi,n; [Pi,n]=γ(θi(n)).

[F3]

Categorification (The KLR category categorifies the negative quantum half): γ is an isomorphism of A-algebras intertwining induction products with the algebra product, restriction with the coproduct, and the bar involutions, with both sides free over A componentwise.

[F4]

Global suppliers (Bar invariance, congruence and uniqueness of the lower global basis, The highest weight and negative half integral crystal triples are balanced): the lower global basis of the negative half and its integral balanced globalization, and the adapted LEFT-string ideal decomposition and normalized transition of clause (v) of the balanced theorem: if e~ia=0, then Fi(r)G(a)−G(f~ira)∈I(i,≥r+1), are available under the stated hypotheses.

Proof

technique · direct; normalize dualities by word characters, compute the first-block expansion, then compare with the integral string ideals and the global recursion
1.1givenF1algebra

(Self-dual simples.) The maximal-tail supplier [F1] gives a triangular divided-idempotent/simple Hom matrix with diagonal 1 over A=Z[q,q−1], which remains invertible at q=1. Ordinary dimensions of divided-word corners are determined by ordinary word dimensions: in each constant-colour block the nil-Hecke matrix presentation makes the polynomial column simple of rank r! and the divided idempotent a rank-one matrix projection, so dim⁡(edivM)=dim⁡(eexpandedM)/∏rr! for every finite module M, including nonsemisimple central quotients. Hence ordinary word characters separate simple shift orbits. The vector duality D(M)d=Hom⁡k(M−d,k) preserves simple modules and fixes ordinary word dimensions because ψ fixes the word idempotents, so DS≅S{s} for some integer s.

2.1step 1.1algebra

(Evenness and normalization.) Choose a total colour order and set p(ν)=∑a<b, νa>νbbνaνb mod 2. Each adjacent unequal swap changes p by its crossing degree modulo 2, and equal crossings and dots have even degree, so the PBW basis puts e(η)Re(ν) in degrees congruent to p(η)−p(ν); a graded module therefore splits into the two submodules on which d−p(ν) is fixed modulo 2 on e(ν)Md, and a simple uses one of them. Since −d−p(ν)≡d−p(ν)(mod2), DS has the same sector as S, so the shift s above is even; replacing S by S{s/2} gives DS=S, and uniqueness follows because a nonzero finite-dimensional graded module is not isomorphic to a nonzero shift of itself (compare its finite least and greatest degrees).

3.1step 2.1F2algebra

(Self-dual covers and induction.) For a finite projective P and finite module M, evaluation gives Hom⁡(P#,DM)=DHom⁡(P,M) with ordinary homogeneous degrees: verify on P=Re(ν){a}, where both sides are the dual of the finite-dimensional space e(ν)M{−a} (Nil-Hecke idempotents and divided-power KLR projectives), and restrict to a finite summand. The duality # is an involution on finite projectives, so Pb# is the same normalized indecomposable projective cover of DSb=Sb, giving Pb#=Pb; a nonzero projective is bounded below, so the normalization is unique. If M is a finite projective over the separated block algebra B, then Hom⁡R(Re⊗BM,R)=Hom⁡B(M,eR)=Hom⁡B(M,B)⊗BeR by evaluation on finite free modules and summands, and twisting by ψ identifies this with Re⊗BM# without reversing the horizontal block order; for M=Pa⊠Pi,r this proves that IndM is self-dual. Restriction commutes with D because ψ fixes the defining block idempotent, so the maximal FIRST-block restriction of the normalized Sb is exactly the normalized L(ir)⊠Sa with no residual shift: that tensor is D-self-dual and any extra shift would contradict finite support.

4.1step 3.1F1F2algebra

(Leading coefficient 1.) Use the exact tensor/Res adjunction of Generic KLR induction and restriction adjunctions preserve projectives and the maximal-tail lemma [F1] to compute Hom⁡(Ind(Pi,r⊠Pa),Sc): it vanishes if ϵiL(Sc)<r; if ϵiL(Sc)=r, the maximal restriction is L(ir)⊠Sa′ and the Hom is zero unless a′=a, when it is exactly k in degree 0; the unique-head lemma makes c=b in that case. Since Hom from a projective detects the multiplicity polynomial of each summand in the decomposition, the induced projective has exactly [Pb] with coefficient 1 at tail r and all other summands at strictly higher tail, giving the displayed expansion. Self-duality of the induction and of each normalized projective forces every multiplicity polynomial to be bar invariant, and finite decompositions give nonnegative coefficients.

5.1step 4.1F3algebra

(Integral string ideals.) For every n, induction with a divided block of length r≥n has no summands of tail <n by the same Hom computation of step 4.1, so γ(I(i,≥n)) is contained in the span of the corresponding covers. Conversely descend on the finite possible tail r (bounded by βi): the coefficient-1 expansion expresses every [Pb] of tail r as [Pi,r][Pa] minus classes of strictly higher tail, which lie in I(i,≥r) already; this proves the reverse inclusion integrally, using the sum of all divided images and not a Gaussian-unit identification with a single ordinary power ideal.

6.1step 5.1F3F4algebra∎

(Signs.) Suppose [Pb]=γ(signb G(b′)) has been established by a separate norm/geometric argument. The ideal equality of step 5.1 and the adapted LEFT-string lower-global basis [F4] identify the tail partitions of these signed vectors with the LEFT string partitions; at the exact LEFT-string quotient the lower-global recursion has coefficient +1 for Fi(r)G(a′) when a′ has LEFT string 0. Induction on root height fixes signa=+1, and comparing the projective coefficient-1 expansion with this quotient fixes signb=+1; the unit/vacuum starts the induction. The reversal supplier used elsewhere promises only signed star preservation, so an unsigned right recursion is deliberately not inferred here. The Axiom of Choice enters only through the inherited quantum-half/global suppliers [F4] and The KLR category categorifies the negative quantum half (The Axiom of Choice); no additional simultaneous module-basis choice is used, and the finite duality, parity, Frobenius and first-block multiplicity arguments above are choice-free.

Depends on

Used by

Dependency tree · two levels

54 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