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.

The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum

Definition

Let (I,A,D,P,P∨,q) be a symmetrizable Cartan datum with no imaginary simple roots, so aii=2, and put bij:=di aij=(αi∣αj), a symmetric matrix with bii=2di>0 (Symmetrizable Cartan data for quantum groups, Kac Moody root lattice height and positive cone). Fix a field k. A KLR datum on it is a family Q=(Qij)i≠j of polynomials Qij∈k[u,v] such that

(Q1) Qij≠0 for i≠j and Qii:=0;

(Q2) Qij(u,v)=Qji(v,u) for all i≠j;

(Q3) Qij is homogeneous of total degree −2bij for the degree assignments deg⁡u:=2di, deg⁡v:=2dj;

(Q4) the two extremal coefficients of Qij, namely that of u−aij and that of v−aji, are nonzero.

For a chosen finite quiver with a compatible automorphism having no arrow within a vertex orbit, write i⋅j=bij and let dij be the number of arrow orbits directed from vertex orbit i to vertex orbit j; the specialization applies when its induced Cartan datum is the fixed one. Then one takes Qij(u,v)=(−1)dij(ul/(i⋅i)−vl/(j⋅j))−2(i⋅j)/l with l=lcm(i⋅i,j⋅j), and Qij=1 when aij=0; the cyclic affine A1(1) double edge aij=aji=−2 is the instance Qij(u,v)=−(u−v)2 up to the fixed normalization of the top coefficients. The simply-laced standard choice is Qij(u,v)=u+v for aij=−1.

The algebra. For n≥0 let In be the set of sequences, let e(ν) for ν∈In be idempotents, and let xa (1≤a≤n) and τa (1≤a≤n−1) be generators. The KLR algebra Rn(Q) is the unital associative k-algebra generated by the e(ν),xa,τa subject to the relations, for all ν∈In (with sa the adjacent transposition acting on positions a,a+1):

(1) e(ν)e(ν′)=δνν′e(ν) and ∑ν∈Ine(ν)=1;

(2) xae(ν)=e(ν)xa and xaxb=xbxa;

(3) τae(ν)=e(saν)τa;

(4) τa2e(ν)=Qνaνa+1(xa,xa+1)e(ν);

(5) τaτb=τbτa whenever ∣a−b∣>1;

(6) (τaxb−xsa(b)τa)e(ν)=0 if b∉{a,a+1} or νa≠νa+1, while if νa=νa+1 one has (τaxa−xa+1τa)e(ν)=e(ν) and (τaxa+1−xaτa)e(ν)=−e(ν) (the sign normalization of the divided difference τa(f)=(f−saf)/(xa−xa+1); Rouquier's printed relation has the opposite global sign, the two conventions being exchanged by τa↦−τa);

(7) (τa+1τaτa+1−τaτa+1τa)e(ν)=0 if νa≠νa+2, and (τa+1τaτa+1−τaτa+1τa)e(ν)=Qνaνa+1(xa,xa+1)−Qνaνa+1(xa+2,xa+1)xa+2−xae(ν) if νa=νa+2, the numerator carrying the sign of the τ-normalization of (6) (Rouquier's printed numerator is its negative); the quotient is a polynomial in xa,xa+1,xa+2 because Qij is a polynomial in its first variable and the numerator vanishes at xa+2=xa (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution, Polynomial rings in finitely many commuting indeterminates by iteration).

For β∈Q+ put Iβ:={ν∈I∣β∣:∑aανa=β}, e(β):=∑ν∈Iβe(ν) and R(β):=e(β)R∣β∣(Q)e(β)=⨁ν,η∈Iβe(ν)R∣β∣(Q)e(η), and put R:=⨁β∈Q+R(β). The presentation is the sequence form of Rouquier's Hn(Q) via 1ν=e(ν), xa,ν=xae(ν), τa,ν=τae(ν); no sign or orientation beyond Q is part of the datum, and R(0)=k.

Remarks

Well-definedness. Rn(Q) is defined as the quotient of the free unital associative k-algebra on the symbols e(ν) (ν∈In), xa, τa by the two-sided ideal generated by the displayed relations, so no existence issue arises. Two points deserve record. First, relation (7) is stated as an equality in k[xa,xa+1,xa+2]e(ν): writing Q(u,v)=∑auaqa(v), the difference Q(u,v)−Q(w,v)=∑a(ua−wa)qa(v) is divisible by u−w in the polynomial ring, and its quotient evaluated at (u,w)=(xa,xa+2), v=xa+1 gives the displayed correction; the special case aij=0 with Qij a nonzero constant is included, where the correction vanishes and the ordinary braid relation holds on νa=νa+2. Second, the mixed relations are word-component identities: the final e(ν) is essential, since a global dot commutator has different components on equal and unequal colors. On an equal-color component they are the identities ∂axa−xa+1∂a=1 and ∂axa+1−xa∂a=−1 for ∂a=(1−sa)/(xa−xa+1). The two global sign conventions for τa are exchanged by τa↦−τa, which preserves (4) and flips the signs in (6) and (7); this page fixes the convention of (6) once and for all and every later item uses it.

Choice. The definitional clauses are choice-free: they name a presented algebra and its weight decomposition over a fixed datum, with no selection of representatives or of auxiliary sets.

Sources

Source comparison: Rouquier §3.2.1-3.2.4 (presentation, Cartan specialization, quiver-with-automorphism formula); Khovanov–Lauda I §2.1-2.2 and Khovanov–Lauda II §1-§2 (diagrammatic presentation with the dot counts dij); Kleshchev §2.11 Definition 2.14 (the affine presentation). The printed Rouquier sign in relation (6) is the opposite of the one fixed here; the passage is τa↦−τa as recorded above.

Depends on

Used by

Dependency tree · two levels

20 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