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 be a KLR datum as in The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum and fix a reduced-expression system: for each one reduced word , and for put . Then the monomials , over all , and , form a -basis of ; equivalently is a free -module on these monomials, and has the corresponding basis. Moreover each has finite-dimensional homogeneous components, and the graded dimension of the summand 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 : for each fixed , for all and for ; if is finite the same holds for . In particular is a locally finite graded algebra; its degree-zero part need not be one-dimensional (already is a nontrivial idempotent).
Facts & Assumptions
Given: A KLR datum with the algebra 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 , and the faithful graded polynomial representation of Faithful polynomial representation of a KLR algebra on .
Faithfulness (Faithful polynomial representation of a KLR algebra): the operators of the polynomial representation satisfy relations (1)-(7) and the homomorphism is injective for nonzero , and it becomes an isomorphism onto the localized skew group algebra after inverting the nonzero polynomials and differences .
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 , of The KLR grading and the diagrammatic multiplication.
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- 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
(Dots move right.) Move the word idempotents to the right using relations (2)–(3). On each resulting component, if stands immediately left of , relation (6) gives except for adjacent equal colours. In that case the exact rules are and . 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.
(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 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.
(Independence.) Under the representation of [F1], the image of in the localization at the nonzero and is triangular: expanding the operators of the chosen reduced word, its highest term is a nonzero scalar times the permutation acting on the summand, and all other terms are permutations of strictly smaller length (an unequal crossing contributes its nonzero -factor together with the transposition, an equal crossing contributes , again transposition plus lower-length terms). A linear relation in would therefore give, after applying and looking at a source/destination block and the maximal occurring length, a nontrivial linear relation among distinct permutations of the field . Distinct field automorphisms are linearly independent: in a shortest nonzero relation choose two different automorphisms and with . Evaluation on minus times evaluation on removes one term and leaves the term nonzero, contradicting minimality; a one-term relation is impossible by evaluation on . 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.
(Grading bookkeeping.) The bidegree of the basis monomial is together with the integer , where is the sum of the degrees of its crossings read in the successive permuted sequences; this is independent of the parameters and of the factorization. The summand therefore has the Laurent Hilbert series , a finite sum of rational geometric series bounded below (each and the finitely many crossing degrees are bounded below), which proves the displayed graded-dimension claim and shows that for below the finite minimum of the finitely many crossing contributions over the finitely many with and .
(Local finiteness.) Fix and a degree . The basis monomials of involve only the finitely many sequences and the finitely many ; each crossing degree is one of the finitely many integers and each dot degree is at least , so is bounded, leaving finitely many exponent tuples; hence . If is finite, is finite for every , so the same argument applies to degree by degree. The element 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
- Degenerate parameters Qᵢⱼ destroy the faithful polynomial-representation route Counterexample
- Induction and restriction bimodules for KLR algebras Definition
- Nil-Hecke idempotents and divided-power KLR projectives Definition
- Cyclotomic KLR quotients in ranks zero, one and two Example
- The double-edge (e=2) KLR braid correction Example
- The KLR algebras in root degrees αᵢ and 2αᵢ Example
- The two-vertex KLR polynomial representation Example
- Actual partial Frobenius caps satisfy all two-color terminal contractions Lemma
- Coherent graded biadjunction and the crossing mates Lemma
- Cyclotomic dot annihilators, finite-dimensional blocks, and finite root strings Lemma
- Generic KLR induction and restriction: mixed relations and the opposite-end exact sequence Lemma
- Graded Krull-Schmidt and shift-orbit bases for finitely generated KLR modules Lemma
- Oriented minimal-parabolic normal forms and the cyclotomic cap ideal Lemma
- PBW and bubble normal form in the minimal-parabolic diagram category Lemma
- Rational Garnir annihilator lines present the specified Specht generator Lemma
- The cyclotomic cap-off quotient has no extra downward relations Lemma
- The minimal-parabolic polynomial flag model realizes the graded diagram relations Lemma
- Cyclotomic induction is projective on the right Theorem
- Generic KLR induction and restriction adjunctions preserve projectives Theorem
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
- Raphael Rouquier, 2-Kac-Moody Algebras, arXiv:0812.5023v3 (66 pages) (standard reference, not scraped)
- Mikhail Khovanov and Aaron D. Lauda, A diagrammatic approach to categorification of quantum groups I, Representation Theory 13 (2009) 309-347, arXiv:0803.4121v2 (standard reference, not scraped)
- Mikhail Khovanov and Aaron D. Lauda, A diagrammatic approach to categorification of quantum groups II, Transactions of the AMS 363 (2011) 2685-2700, arXiv:0804.2080v1 (standard reference, not scraped)