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.

Faithful polynomial representation of a KLR algebra

Statement

Let Q be a KLR datum as in The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum. Choose a factorization Qij(u,v)=Pij(u,v)Pji(v,u) with Pij∈k[u,v] nonzero for all i≠j; with (Q1) one may order the pairs and take Pij=Qij, Pji=1. On the graded space Poln:=⨁ν∈Ink[x1,…,xn]e(ν) define operators: e(ν) projects to the ν-summand; xa multiplies by xa; for νa≠νa+1 set τa(fe(ν)):=Pνaνa+1(xa+1,xa) sa(f) e(saν) where sa permutes the variables; for νa=νa+1 set τa(fe(ν)):=f−sa(f)xa−xa+1e(ν), 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 k[x1,…,xn] because f−saf vanishes at xa=xa+1; the variable permutation of Polynomial rings in finitely many commuting indeterminates by iteration makes this precise). Give Poln the grading of The KLR grading and the diagrammatic multiplication with deg⁡xae(ν):=2dνa, together with the summand shifts that make each τae(ν) homogeneous of degree −bνaνa+1 (they exist by the antisymmetry of the increments −bij−deg⁡Pij 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 ρ:Rn(Q)→Endkgr(Poln), the graded algebra of homogeneous endomorphisms, with ρ(Rn(Q)m) Poln,d⊆Poln,d+m. For nonzero Pij this homomorphism is injective. After localizing at the nonzero polynomials Pij(xa,xb) (νa≠νb) and the differences xa−xb (νa=νb), it becomes an isomorphism onto the localization of the skew group algebra An(I)=(⨁ν∈Ink[x1,…,xn]e(ν))⋊Sn; consequently Rn(Q) has finite-dimensional homogeneous components and ρ is a faithful representation.

Facts & Assumptions

Given: A KLR datum Q of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum with bij=diaij=bji and bii=2di>0, a factorization Qij(u,v)=Pij(u,v)Pji(v,u) with all Pij≠0, and the space Poln=⨁ν∈Ink[x1,…,xn]e(ν) with the degree assignment deg⁡xa=2dνa and idempotents of degree~0.

[F1]

(Q3) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum: Qij is homogeneous of total degree −2bij for deg⁡u=2di, deg⁡v=2dj.

[F2]

Homogeneity of factors: for the positive weighting [i,j] with deg⁡u=2di, deg⁡v=2dj, 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 k is a domain. Thus (Q3) and Qij=Pij(u,v)Pji(v,u) force both factors to be homogeneous, with deg⁡[i,j]Pij+deg⁡[j,i]Pji=−2bij. No homogeneity for the swapped weighting is asserted.

[F3]

Relation list (1)-(7) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, and the identity for divided differences: with sa acting on polynomials by xa↔xa+1 and ∂a=(1−sa)/(xa−xa+1), one has ∂axa−xa+1∂a=1, ∂axa+1−xa∂a=−1, ∂a2=0 and ∂a(fg)=∂a(f) g+sa(f) ∂a(g) for all polynomials f,g.

[F4]

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 Sn.

Proof

technique · direct; construct the shifts, verify the relations case by case, then prove injectivity and the localized isomorphism
1.1givenF2algebra

(Shifts.) Write pij:=deg⁡[i,j]Pij and Δij:=−bij−pij for i≠j. By [F2], pij+pji=−2bij, so Δji=−Δij. Fix the given finite order on I and set w(ν):=∑a<b, νa>νbΔνbνa. An adjacent unequal swap only changes the contribution of that pair, hence w(saν)−w(ν)=Δνaνa+1. 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.

1.2F3F4algebrainduction

(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 τwxae(ν) span.

2.1givenF1F2algebraconstruct

(Definition and homogeneity.) Define e(ν) and xa as stated and τa by the two displayed formulas. Each formula is a finite sum of polynomials times a permutation of the variables, hence a well-defined k-linear endomorphism; the equal-colour quotient lies in k[x1,…,xn] because f−saf vanishes on xa=xa+1 (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 xa is homogeneous of degree 2dνa (the shifts are constant on a summand and do not change dot degrees), and τa is homogeneous of degree −bνaνa+1: on unequal colours in the target summand saν, the variable xa+1 has color p and xa has color q, so the factor Ppq(xa+1,xa) has degree deg⁡[p,q]Ppq, so multiplying by it and passing to the summand saν with shift w(saν)=w(ν)+Δpq changes the total degree by deg⁡[p,q]Ppq+Δpq=−bpq; on equal colours the divided difference has degree −2dp=−bpp because its numerator has degree deg⁡f and the denominator has degree 2dp.

3.1step 2.1F3algebra

(Relations (1), (2), (3), (5), (6).) Relations (1)-(3) are immediate from the definitions: the e(ν) are orthogonal idempotents summing to 1, x's commute and commute with the e(ν), and both displayed τa's map the ν-summand to the saν-summand. Relation (5) holds because τa and τb with ∣a−b∣>1 act on disjoint sets of variables and their polynomial factors commute. For (6): if b∉{a,a+1} the multiplication by xb commutes with sa and with the factor Pνaνa+1(xa+1,xa), giving τaxb=xbτa=xsa(b)τa; if b=a and νa≠νa+1 then τaxaf=P(xa+1,xa)xa+1saf=xa+1τaf, and b=a+1 is the same with xa; if νa=νa+1 the two identities ∂axa−xa+1∂a=1 and ∂axa+1−xa∂a=−1 of [F3] are exactly the two displayed dot moves.

3.2step 2.1F1F3algebra

(Relation (4).) On equal colours τa2=∂a2=0=Qpp(xa,xa+1)e(ν) by [F3] and Qpp=0. On unequal colours (p,q) a double application gives τa2(fe(ν))=Pqp(xa+1,xa) sa(Ppq(xa+1,xa)saf)=Ppq(xa,xa+1)Pqp(xa+1,xa)f=Qpq(xa,xa+1)f, which is relation (4) because Qpq(u,v)=Ppq(u,v)Pqp(v,u) evaluated at (u,v)=(xa,xa+1) equals Ppq(xa,xa+1)Pqp(xa+1,xa).

4.1step 2.1step 3.2F3algebra

(Relation (7), equal outer colours (i,j,i).) Work on e(i,j,i) in variables x1,x2,x3=xa,xa+1,xa+2, write P=Pij, P′=Pji, Q=PP′(v,u), let s=(12), t=(23) and r=tst=sts=(13); write A=τa+1τaτa+1 and B=τaτa+1τa. Expanding the definitions on fe(i,j,i) and collecting the outer factor, Af=P(x3,x2)⋅t[∂a(P′(x3,x2) tf)] and Bf=P′(x2,x1)⋅s[∂a+1(P(x2,x1) sf)]. Using t∂at=(1−r)/(x1−x3) and ∂a+1(hg)=∂a+1(h)g+t(h)∂a+1(g) with h=P′(x3,x2) first, then the mirrored expansion of B with h=P(x2,x1), gives Af=P(x3,x2)[P′(x2,x3)f−P′(x2,x1)rf]/(x1−x3) and Bf=P′(x2,x1)[P(x1,x2)f−P(x3,x2)rf]/(x1−x3). Subtracting, the two rf-terms cancel and the remaining coefficient is P(x3,x2)P′(x2,x3)−P(x1,x2)P′(x2,x1)=Q(x3,x2)−Q(x1,x2), so (A−B)f=Q(x1,x2)−Q(x3,x2)x3−x1f, which is relation (7) on e(i,j,i).

5.1step 3.1step 4.1F1F3algebra

(Relation (7), remaining colours.) If νa=νa+1=νa+2=i, then all three operators are divided differences and both braid words equal the same antisymmetrizer expression ∑w∈S3sgn⁡(w)w/∏i<j(xi−xj), so A−B=0, consistent with Qii=0; 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 (i,i,j), then with h=Pij(x2,x1)Pij(x3,x1), which is symmetric in x2,x3, the two expansions give Af=∂a+1(h⋅stf) and Bf=h⋅st ∂a(f), and the product rule plus the Demazure identity ∂a+1st=st ∂a valid for the 3-cycle w=st yield A−B=0; the case (i,j,j) is the mirror image, obtained by reading the same identities from the other end. If the three colours are distinct, both A and B act as the same product PijPikPjk (with arguments placed by the two expansions, all three factors read off the three crossed pairs) times the longest permutation r, and A=B; the expansion is by the same substitution t∂at=(1−r)/(x1−x3) 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.

6.1step 2.1step 3.1step 3.2step 4.1step 5.1construct

(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 ρ:Rn(Q)→Endkgr(Poln{w}) of graded algebras with ρ(Rn(Q)m)Poln,d⊆Poln,d+m.

7.1step 6.1step 1.2choosealgebra

(Faithfulness.) Localize for this step only at the nonzero elements {Pij(xa,xb):νa≠νb} and {xa−xb:νa=νb}; the localized operators of a reduced word w=si1⋯sir on a fixed source sequence ν have the form cw⋅w+∑u<wcuu where cw≠0 is the product of the nonzero P-factors (unequal crossings) and the nonzero coefficient −1/(xa−xa+1) (equal crossings), and the terms u<w are strictly shorter permutations. Suppose ∑ν∑w,acw,aτwxae(ν) acted as zero; for the maximal w occurring in a fixed source/destination block the leading terms give a nontrivial linear relation ∑wdww=0 among distinct automorphisms w of the field k(x1,…,xn). Distinct automorphisms are linearly independent: take a relation with the least positive number of nonzero coefficients; one term cannot vanish on 1. With at least two terms, choose w≠w0 and g with w(g)≠w0(g), evaluate on fg, and subtract w0(g) times the evaluation on f. The w0 term disappears and the w coefficient stays nonzero, contradicting minimality; hence no nonzero combination of the spanning monomials of step 1.2 acts as zero and ρ is injective.

8.1step 1.2step 7.1algebra∎

(Localized isomorphism and finiteness.) Inverting the factors and differences makes every unequal-colour crossing τa equal to sa up to an invertible scalar, and every equal-colour crossing satisfy sa=1−(xa−xa+1)∂a, so the localized image contains all variable permutations sa and all multiplications xa, i.e. the localization of the skew group algebra An(I)=(⨁ν∈Ink[x1,…,xn]e(ν))⋊Sn; 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 w∈Sn and dot exponents aj≥0 span Rn(Q); for fixed weight β and degree m the finitely many w and ν occur, each crossing degree is one of finitely many integers bounded below, and each dot has positive degree 2dνa, so the total dot degree of a spanning monomial of degree m is bounded, leaving only finitely many exponent tuples; hence dim⁡kR(β)m<∞.

Depends on

Used by

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