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.
Faithful polynomial representation of a KLR algebra
Statement
Let be a KLR datum as in The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum. Choose a factorization with nonzero for all ; with (Q1) one may order the pairs and take , . On the graded space define operators: projects to the -summand; multiplies by ; for set where permutes the variables; for set , the divided difference operator of the sign convention fixed in relation (6) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum (the quotient lies in because vanishes at ; the variable permutation of Polynomial rings in finitely many commuting indeterminates by iteration makes this precise). Give the grading of The KLR grading and the diagrammatic multiplication with , together with the summand shifts that make each homogeneous of degree (they exist by the antisymmetry of the increments and are unique up to one constant on each fixed-weight sequence orbit). Then each word-component generator acts homogeneously of its degree, the operators satisfy relations (1)-(7), and they define a homomorphism of graded algebras , the graded algebra of homogeneous endomorphisms, with . For nonzero this homomorphism is injective. After localizing at the nonzero polynomials () and the differences (), it becomes an isomorphism onto the localization of the skew group algebra ; consequently has finite-dimensional homogeneous components and is a faithful representation.
Facts & Assumptions
Given: A KLR datum of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum with and , a factorization with all , and the space with the degree assignment and idempotents of degree~.
(Q3) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum: is homogeneous of total degree for , .
Homogeneity of factors: for the positive weighting with , , the least and greatest weighted degrees of a product of nonzero polynomials are the sums of those of its factors, since the polynomial ring over is a domain. Thus (Q3) and force both factors to be homogeneous, with . No homogeneity for the swapped weighting is asserted.
Relation list (1)-(7) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, and the identity for divided differences: with acting on polynomials by and , one has , , and for all polynomials .
Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups, clauses (1)–(2), connects reduced expressions by braid moves and transforms a nonreduced word by braid moves to an adjacent repeat; here the Coxeter system is that of adjacent transpositions in .
Proof
(Shifts.) Write and for . By [F2], , so . Fix the given finite order on and set . An adjacent unequal swap only changes the contribution of that pair, hence . This explicit formula supplies the shifts on every sequence; any two shift functions differ by a constant on each fixed-content orbit, since adjacent unequal swaps connect it.
(Spanning.) Move dots to the right using relation (6), inducting on the number of dot/crossing inversions and the crossing length of correction terms. By [F4], any nonreduced transposition word admits finitely many braid moves exposing an adjacent repeat, and any reduced word connects to the chosen one by braid moves. Each braid correction has three fewer crossings and each quadratic substitution removes two; induction on crossing length therefore reduces all correction terms, while the finite chosen sequence of braid moves handles the leading term. Hence the monomials span.
(Definition and homogeneity.) Define and as stated and by the two displayed formulas. Each formula is a finite sum of polynomials times a permutation of the variables, hence a well-defined -linear endomorphism; the equal-colour quotient lies in because vanishes on (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution, Polynomial rings in finitely many commuting indeterminates by iteration). With the shifts of step 1.1, on each word component is homogeneous of degree (the shifts are constant on a summand and do not change dot degrees), and is homogeneous of degree : on unequal colours in the target summand , the variable has color and has color , so the factor has degree , so multiplying by it and passing to the summand with shift changes the total degree by ; on equal colours the divided difference has degree because its numerator has degree and the denominator has degree .
(Relations (1), (2), (3), (5), (6).) Relations (1)-(3) are immediate from the definitions: the are orthogonal idempotents summing to , 's commute and commute with the , and both displayed 's map the -summand to the -summand. Relation (5) holds because and with act on disjoint sets of variables and their polynomial factors commute. For (6): if the multiplication by commutes with and with the factor , giving ; if and then , and is the same with ; if the two identities and of [F3] are exactly the two displayed dot moves.
(Relation (4).) On equal colours by [F3] and . On unequal colours a double application gives , which is relation (4) because evaluated at equals .
(Relation (7), equal outer colours .) Work on in variables , write , , , let , and ; write and . Expanding the definitions on and collecting the outer factor, and . Using and with first, then the mirrored expansion of with , gives and . Subtracting, the two -terms cancel and the remaining coefficient is , so , which is relation (7) on .
(Relation (7), remaining colours.) If , then all three operators are divided differences and both braid words equal the same antisymmetrizer expression , so , consistent with ; if exactly the outer two colours agree, step 4.1 applies with the two adjacent colours distinct; if only the first two colours agree, say , then with , which is symmetric in , the two expansions give and , and the product rule plus the Demazure identity valid for the -cycle yield ; the case is the mirror image, obtained by reading the same identities from the other end. If the three colours are distinct, both and act as the same product (with arguments placed by the two expansions, all three factors read off the three crossed pairs) times the longest permutation , and ; the expansion is by the same substitution as in step 4.1 applied to three distinct colours, where the two middle expressions coincide because the two factorizations of the long element have the same length. Hence relation (7) holds in every case.
(The homomorphism.) Steps 3.1, 3.2, 4.1 and 5.1 verify relations (1)-(7) for the operators, and step 2.1 shows each word-component generator acts homogeneously of its assigned degree, so the universal property of the presented algebra gives a homomorphism of graded algebras with .
(Faithfulness.) Localize for this step only at the nonzero elements and ; the localized operators of a reduced word on a fixed source sequence have the form where is the product of the nonzero -factors (unequal crossings) and the nonzero coefficient (equal crossings), and the terms are strictly shorter permutations. Suppose acted as zero; for the maximal occurring in a fixed source/destination block the leading terms give a nontrivial linear relation among distinct automorphisms of the field . Distinct automorphisms are linearly independent: take a relation with the least positive number of nonzero coefficients; one term cannot vanish on . With at least two terms, choose and with , evaluate on , and subtract times the evaluation on . The term disappears and the coefficient stays nonzero, contradicting minimality; hence no nonzero combination of the spanning monomials of step 1.2 acts as zero and is injective.
(Localized isomorphism and finiteness.) Inverting the factors and differences makes every unequal-colour crossing equal to up to an invertible scalar, and every equal-colour crossing satisfy , so the localized image contains all variable permutations and all multiplications , i.e. the localization of the skew group algebra ; with injectivity from step 7.1 and the evident containment of the image in the localized algebra, becomes an isomorphism after localization. For finiteness of homogeneous components: by step 1.2 the monomials with and dot exponents span ; for fixed weight and degree the finitely many and occur, each crossing degree is one of finitely many integers bounded below, and each dot has positive degree , so the total dot degree of a spanning monomial of degree is bounded, leaving only finitely many exponent tuples; hence .
Depends on
- The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum
- The KLR grading and the diagrammatic multiplication
- Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups
- The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution
- Polynomial rings in finitely many commuting indeterminates by iteration
Used by
- Degenerate parameters Qᵢⱼ destroy the faithful polynomial-representation route Counterexample
- Nil-Hecke idempotents and divided-power KLR projectives Definition
- The two-vertex KLR polynomial representation Example
- Actual partial Frobenius caps satisfy all two-color terminal contractions Lemma
- Cyclotomic induction is projective on the right Theorem
- Self-dual indecomposable KLR projectives give the lower global basis (symmetric type) Theorem
- The PBW (monomial) basis theorem for KLR algebras Theorem
Dependency tree · two levels
21 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)
- Alexander Kleshchev, Representation theory of symmetric groups and related Hecke algebras, Bulletin of the AMS 47 (2010) 419-481 (survey), arXiv:0909.4844 (standard reference, not scraped)