Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Nil-Hecke idempotents and divided-power KLR projectives

Definition

Let Q be a KLR datum as in The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum. For i∈I and n≥1 the subalgebra R(nαi) is generated by the polynomial subalgebra k[x1,…,xn] and the crossings τ1,…,τn−1 with τa2=0 (because Qii=0), the braid and far commutation relations, and the nil-Hecke dot moves, i.e. it is the nil Hecke algebra of rank n; its PBW basis is {x1a1⋯xnanτw}a∈Z≥0n,w∈Sn (The PBW (monomial) basis theorem for KLR algebras). Fix a reduced expression w0=si1⋯si(n2) of the longest element and put ∂w0:=τi1⋯τi(n2) (independent of the reduced expression). The divided-power idempotent is ei,n:=x1n−1x2n−2⋯xn−1 ∂w0∈R(nαi), and its horizontal reflection is ψ(ei,n):=∂w0x1n−1⋯xn−1. Both are nonzero idempotents of degree 0, and ei,n≠0 because the PBW basis separates the monomials involved. The divided-power projective is Pi,n:=R(nαi) ψ(ei,n){−di(n2)}, where the shift is the one fixed by the source normalization: as a graded left module R(nαi)ψ(ei,n) is the polynomial representation, it is indecomposable projective, and with this shift R(nαi) is a finite direct sum of [n]i! shifted copies of Pi,n, where [n]i!=∏a=1nqia−qi−aqi−qi−1 is the qi-factorial of Quantum integers, factorials, Gaussian binomials and divided powers at qi (at qi=1 it is n!); hence Pi,n is the unique indecomposable projective summand up to shift and EndR(nαi)(Pi,n)0=k. For a divided-power sequence θ=i1(n1)⋯ir(nr) put β=∑anaαia and Pθ:=Ind(Pi1,n1⊠⋯⊠Pir,nr) along the ordered concatenation of the blocks of Induction and restriction bimodules for KLR algebras; then [Pθ] represents the ordered product of these divided powers; one may reorder only by the proved commuting/Serre relations, adjacent colours need not commute, and for a single colour θ=i(n) one has the indecomposability above.

Projective duality. For a finite graded projective left R(β)-module P put P#:=HOM⁡R(β)(P,R(β))ψ, the ψ-twisted graded Hom into the rank-one free module, where ψ is the horizontal-reflection anti-involution. Evaluation P#→ (dual of P) identifies (P#)#≅P for finite shifted free modules, and hence for every finite graded projective; the duality reverses internal shifts and fixes each normalized Pi,n after the displayed shift.

Remark

Nil-Hecke matrix calculation. Put V=k[x1,…,xn], C=k[e1,…,en]=VSn and N=(n2). The elementary symmetric functions are algebraically independent and generate the symmetric ring: subtracting the leading symmetric monomial orbit successively expresses every invariant as a polynomial in them, and their distinct leading monomials give independence. Adjoin x1 as a root of the monic polynomial Tn−e1Tn−1+⋯+(−1)nen, then x2 as a root of its quotient by T−x1, and continue. Eliminating coefficients recovers the polynomial ring in the roots; each monic extension is free on powers below its degree. Hence V is free over C on xa with 0≤ar≤n−r.

Write δ=(n−1,n−2,…,0). Expanding the divided differences gives ∂w0(f)=∑w∈Snsgn⁡(w)w(f)/∏a<b(xa−xb): the braid relations make this independent of the reduced word, and the numerator of xδ is the Vandermonde determinant. Thus ∂w0(xδ)=1, its values are symmetric, and it kills every other Artin basis monomial by degree. It is therefore the coefficient-of-xδ trace of the monic tower. This trace has a perfect C-bilinear pairing ⟨f,g⟩=∂w0(fg): for a monic extension of degree m, the coefficient-of-Tm−1 trace has matrix zero below the antidiagonal and ones on it in the power basis, hence determinant ±1; composing these perfect trace pairings through the tower preserves perfection. Choose the finite trace-dual Artin basis (ba∗) to (ba). The operators f↦ba∂w0(bb∗f) are matrix units, all lying in NHn; faithfulness of Faithful polynomial representation of a KLR algebra therefore identifies NHn=End⁡C(V) in every characteristic.

Idempotents, column and duality. In this faithful action, E=∂w0xδ sends f to ∂w0(xδf)∈C and fixes C, so E2=E. Reflection ψ fixes dots and crossings and reverses products, giving ei,n=ψ(E) also idempotent and nonzero. Both have degree zero. The map NHnE→V, aE↦a(1), is an isomorphism with inverse f↦mfE: E is the rank-one projection onto C⋅1, so aE=ma(1)E. Its endomorphism ring is C and its degree-zero part is k, proving graded indecomposability. The trace pairing has degree −2diN and satisfies ⟨af,g⟩=⟨f,ψ(a)g⟩: this is immediate for dots and follows for ∂r by expanding (1−sr)/(xr−xr+1) in the trace formula. Consequently V#≅V{−2diN}, and Pi,n=V{−diN} is self-dual. The Artin basis degrees yield NHn≅⨁aV{−2di∣a∣}, since End⁡C(V)=V⊗CV∗; centering gives multiplicity qiN∏m=1n(1+qi−2+⋯+qi−2(m−1))=[n]i!. This also proves uniqueness of the indecomposable projective shift orbit: a finite graded projective over the connected positively graded ring C is shifted-free, by lifting a basis modulo C+ and using its projective splitting and the least-degree argument on kernel and cokernel, and the matrix equivalence transports that assertion to NHn.

Duality and induction. For a finite graded projective B=R(β)⊗R(γ)-module M, finite-projective evaluation gives HOM⁡R(Re⊗BM,R)≅HOM⁡B(M,eR)≅HOM⁡B(M,B)⊗BeR. Twisting by reflection yields (Ind⁡M)#≅Ind⁡(M#) with the same block order and grading. The identities are checked on finite shifted-free M and then its summands. Thus ordered inductions of the normalized one-color columns are self-dual, as required for bar compatibility.

Two colours and order. For several colours Pθ is defined by induction along the ordered blocks, so the class is the ordered induction product; blocks of orthogonal colors commute by the invertible degree-zero block shuffle, since their Qij are nonzero constants, while adjacent colours are related only by the Serre relations proved later on this page, so no silent symmetrization of the word θ is made. The construction selects no representatives beyond the fixed reduced-expression system of The PBW (monomial) basis theorem for KLR algebras and uses no choice principle.

Depends on

Used by

Dependency tree · two levels

17 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