Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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 two-vertex KLR polynomial representation

Example

Take I={i,j}, n=2 and the KLR datum with Qij=1 if aij=0 and Qij(u,v)=u+v if aij=aji=−1 (simply-laced edge, hence di=dj), Qji determined by (Q2). Then Iαi+αj={ij,ji} and the PBW basis of R(αi+αj) is {x1ax2bτ1εe(ν) : ε∈{0,1}, ν∈{ij,ji}}, so R(αi+αj) is free of rank 4 over k[x1,x2] (and rank 2 over the direct-sum polynomial algebra with its two idempotents) with graded dimension 2(1+q−bij)(1−q2di)(1−q2dj). (a) aij=0: τ12=e(ij)+e(ji) and τ1x1=x2τ1 and τ1x2=x1τ1; right multiplication by τ1 gives a degree-zero isomorphism R(αi+αj)e(ij)≅R(αi+αj)e(ji) of graded left modules, hence [Pij]=[Pji] in K0(R) — the categorical form of θiθj=θjθi. (b) aij=−1: choose the factorization Pij(u,v)=u+v, Pji(u,v)=1; the polynomial action of Faithful polynomial representation of a KLR algebra is τ1(fe(ij))=(x1+x2)f(x2,x1)e(ji),τ1(fe(ji))=f(x2,x1)e(ij), so τ12=(x1+x2) on both components, i.e. τ12e(ν)=Qν1ν2(x1,x2)e(ν); the algebra is free of rank 2 over the two-idempotent polynomial algebra k[x1,x2]e(ij)⊕k[x1,x2]e(ji) (rank 4 over the bare k[x1,x2]), and the three-strand divided-power classes satisfy [Piji]=[Pi(2)j]+[Pji(2)] in K0(R), the simply-laced Serre relation at aij=−1.

Facts & Assumptions

Given: The two-vertex KLR datum with aij=aji∈{0,−1}, di,dj (equal on an edge), and the algebra R(αi+αj) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum with the polynomial representation of Faithful polynomial representation of a KLR algebra and the PBW basis of The PBW (monomial) basis theorem for KLR algebras.

[F1]

Relations (4) and (6) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum: τ12e(ν)=Qν1ν2(x1,x2)e(ν) and the dot slides, with τ12=Qij read on e(ij) and Qji on e(ji).

[F2]

Polynomial action (Faithful polynomial representation of a KLR algebra): with a factorization Qij(u,v)=Pij(u,v)Pji(v,u) the action on unequal colours is τ1(fe(ν))=Pν1ν2(x2,x1)s1(f)e(s1ν), and this action is faithful; a factorization with both factors nonzero exists.

[F3]

PBW basis (The PBW (monomial) basis theorem for KLR algebras): the monomials τ1εx1ax2be(ν), ε∈{0,1}, ν∈{ij,ji}, form a k-basis of R(αi+αj).

[F4]

Serre relation for the Grothendieck ring (The KLR Grothendieck ring satisfies the divided-power quantum Serre relations): in K0(R) the divided classes satisfy ∑a+b=−aij+1(−1)a[Pi,a][Pj,1][Pi,b]=0, which at aij=−1 reads [Piji]=[Pi(2)j]+[Pji(2)].

Verification

technique · direct; read off the two-strand PBW basis and check both parameter cases
1.1givenF3algebra

(Two-strand basis and dimension.) In weight αi+αj the sequences are ij and ji, and S2={1,s1}, so the PBW basis [F3] consists of the four families x1ax2be(ij), x1ax2bτ1e(ij), x1ax2be(ji), x1ax2bτ1e(ji), which is rank 4 over k[x1,x2]; grouping by idempotent gives rank 2 over k[x1,x2]e(ij)⊕k[x1,x2]e(ji). The graded dimension is the two geometric series for the dots in degrees 2di,2dj in each corner plus the crossing contributions: in the ij-corner, τ1e(ij) has degree −bij, and in the ji-corner τ1e(ji) has degree −bji=−bij, giving 1+q−bij(1−q2di)(1−q2dj) in each corner, total 2(1+q−bij)(1−q2di)(1−q2dj).

1.2givenF1algebra

(Case aij=0.) Here Qij=1 is a nonzero constant with Qji=1, so [F1] gives τ12e(ij)=e(ij) and τ12e(ji)=e(ji), i.e. τ12=e(ij)+e(ji), and the dot slides τ1x1=x2τ1, τ1x2=x1τ1 (distinct colours). Right multiplication by τ1 is an isomorphism of graded left modules R(αi+αj)e(ij)→R(αi+αj)e(ji) with inverse right multiplication by τ1 on the other side: both composites are τ12=id on the respective corners, and the map is degree-zero because deg⁡τ1=−bij=0. Hence [Pij]=[R(αi+αj)e(ij)]=[R(αi+αj)e(ji)]=[Pji] in K0(R).

2.1step 1.1F2F4algebra∎

(Case aij=−1.) With Pij=u+v, Pji=1 we have Pij(u,v)Pji(v,u)=(u+v)⋅1=Qij(u,v), a valid factorization with both factors nonzero, so [F2] applies: τ1(fe(ij))=(x1+x2)f(x2,x1)e(ji) and τ1(fe(ji))=1⋅f(x2,x1)e(ij). Applying twice, τ12(fe(ij))=(x1+x2)f and τ12(fe(ji))=(x1+x2)f, so τ12e(ν)=Qν1ν2(x1,x2)e(ν) on both summands, as required by [F1]. The freeness statements are step 1.1. For the Serre relation, apply [F4] with aij=−1: the sum runs over a+b=2 with signs +,−,+, i.e. [Pi,2][Pj]−[Pi,1][Pj][Pi,1]+[Pj][Pi,2]=0, which in the divided-word notation is [Pi(2)j]−[Piji]+[Pji(2)]=0, i.e. [Piji]=[Pi(2)j]+[Pji(2)].

Depends on

Used by

Dependency tree · two levels

24 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