Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

The PBW (monomial) basis theorem for KLR algebras

Statement

Let Q be a KLR datum as in The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum and fix a reduced-expression system: for each w∈Sn one reduced word w=si1⋯sir, and for ν∈In put τw:=τi1⋯τir∈Rn(Q). Then the monomials τwx1a1⋯xnane(ν), over all w∈Sn, a1,…,an≥0 and ν∈In, form a k-basis of Rn(Q); equivalently Rn(Q) is a free k-module on these monomials, and R(β) has the corresponding basis. Moreover each R(β) has finite-dimensional homogeneous components, and the graded dimension of the summand e(ν)Rn(Q)e(ν′) is the formal Laurent Hilbert series counting the monomials (bounded below, equivalently the finite sum of the corresponding rational geometric series), so the graded ranks are independent of the parameters Q: for each fixed β, dim⁡kR(β)m<∞ for all m and R(β)m=0 for m≪0; if I is finite the same holds for Rn(Q). In particular R(β) is a locally finite graded algebra; its degree-zero part need not be one-dimensional (already x1τ1∈R(2αi)0 is a nontrivial idempotent).

Facts & Assumptions

Given: A KLR datum Q with the algebra Rn(Q) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, its grading of The KLR grading and the diagrammatic multiplication, a reduced-expression system for Sn, and the faithful graded polynomial representation of Faithful polynomial representation of a KLR algebra on Poln.

[F1]

Faithfulness (Faithful polynomial representation of a KLR algebra): the operators of the polynomial representation satisfy relations (1)-(7) and the homomorphism ρ:Rn(Q)→Endkgr(Poln{w}) is injective for nonzero Pij, and it becomes an isomorphism onto the localized skew group algebra k(I)[x]⋊Sn after inverting the nonzero polynomials Pij(xa,xb) and differences xa−xb.

[F2]

Relations (4), (5), (6), (7) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, used as rewriting rules for words in the generators, and the degree assignment deg⁡xa=2dνa>0, deg⁡τa=−bνaνa+1 of The KLR grading and the diagrammatic multiplication.

[F3]

Reduced-word moves and deletion: Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups, clauses (1) and (2), applied to the type-A Coxeter system of adjacent transpositions, connects reduced words by far and three-term braid moves and transforms any nonreduced word by such moves to an adjacent repeat.

Proof

technique · direct; first reduce arbitrary words to monomials with reduced crossing words and right-hanging dots, then obtain independence from the faithful polynomial representation
1.1givenF2algebra

(Dots move right.) Move the word idempotents to the right using relations (2)–(3). On each resulting component, if xb stands immediately left of τa, relation (6) gives xbτae(ν)=τaxsa(b)e(ν) except for adjacent equal colours. In that case the exact rules are xaτae(ν)=τaxa+1e(ν)+e(ν) and xa+1τae(ν)=τaxae(ν)−e(ν). The leading term moves one dot past one crossing, and each correction removes that dot and crossing; hence every term has fewer dot/crossing inversions. Induction on their number puts all dots to the right of all crossings.

2.1step 1.1F2F3inductionalgebra

(Crossing words reduce.) Induct on crossing length. By [F3], a nonreduced transposition word can be changed by finitely many far and braid moves into a word with an adjacent repeat; each braid correction has three fewer crossings and is handled by induction after step 1.1, and relation (4) removes the repeated pair. For a reduced word, [F3] connects it to the chosen reduced word by finitely many braid moves; their correction terms again have fewer crossings. Thus every crossing word is a sum of chosen τw times dot polynomials, and step 1.1 puts the dots on the right. This proves spanning without a decreasing-length claim for braid moves themselves.

3.1step 2.1F1choosealgebra

(Independence.) Under the representation of [F1], the image of τwxae(ν) in the localization at the nonzero Pij(xa,xb) and xa−xb is triangular: expanding the operators of the chosen reduced word, its highest term is a nonzero scalar times the permutation w acting on the summand, and all other terms are permutations of strictly smaller length (an unequal crossing contributes its nonzero P-factor together with the transposition, an equal crossing contributes (1−sa)/(xa−xa+1)=−(sa−1)/(xa−xa+1), again transposition plus lower-length terms). A linear relation ∑cw,a,ντwxae(ν)=0 in Rn(Q) would therefore give, after applying ρ and looking at a source/destination block and the maximal occurring length, a nontrivial linear relation ∑wdww=0 among distinct permutations w of the field k(x1,…,xn). Distinct field automorphisms are linearly independent: in a shortest nonzero relation choose two different automorphisms w,w0 and g with w(g)≠w0(g). Evaluation on fg minus w0(g) times evaluation on f removes one term and leaves the w term nonzero, contradicting minimality; a one-term relation is impossible by evaluation on 1. Hence the spanning monomials of step 2.1 have linearly independent images, and since ρ is injective by [F1] applied to the fixed factorization, the monomials themselves are linearly independent; together with step 2.1 they form a basis.

4.1step 3.1F2algebra

(Grading bookkeeping.) The bidegree of the basis monomial τwx1a1⋯xnane(ν) is (ν,wν) together with the integer deg⁡(τw on ν)+∑jaj⋅2dνj, where deg⁡(τw on ν) is the sum of the degrees −bνrνr+1 of its crossings read in the successive permuted sequences; this is independent of the parameters Q and of the factorization. The summand e(ν)Rn(Q)e(ν′) therefore has the Laurent Hilbert series ∑w:wν′=νqdeg⁡(τw on ν′)∏j=1n(1−q2dνj′)−1, a finite sum of rational geometric series bounded below (each dνj>0 and the finitely many crossing degrees are bounded below), which proves the displayed graded-dimension claim and shows that R(β)m=0 for m below the finite minimum of the finitely many crossing contributions over the finitely many ν,w with wν=ν′ and ∑jανj=β.

5.1step 3.1step 4.1algebra∎

(Local finiteness.) Fix β∈Q+ and a degree m. The basis monomials of R(β)m involve only the finitely many sequences ν∈Iβ and the finitely many w∈S∣β∣; each crossing degree is one of the finitely many integers −bpq and each dot degree 2dνj is at least 2min⁡idi>0, so ∑jaj is bounded, leaving finitely many exponent tuples; hence dim⁡kR(β)m<∞. If I is finite, Iβ is finite for every ∣β∣, so the same argument applies to Rn(Q) degree by degree. The element x1τ1∈R(2αi)0 is nonzero by the basis of step 3.1 and squares to itself by the nil-Hecke dot move, so degree zero need not be one-dimensional.

Depends on

Used by

Dependency tree · two levels

19 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