Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedverified 2026-10-22 (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.

KLR categorical action contract for line-changing data

Definition

Fix a field k, a finite color set I, a symmetrizable Cartan matrix A=(aij)i,j∈I, and positive integers di satisfying diaij=djaji. Here aii=2, aij≤0 for i≠j, and aij=0 exactly when aji=0. Fix a weight lattice X (a free abelian group), simple roots αi∈X, and integer-valued pairings ⟨λ,αi∨⟩ with ⟨αj,αi∨⟩=aij. Choose polynomials Qij(u,v)∈k[u,v] with Qii=0, Qij(u,v)=Qji(v,u), and Qij≠0 for i≠j; each Qij is homogeneous for deg⁡u=2di, deg⁡v=2dj, of weighted degree −2diaij.

For ν=∑i∈Imii∈N[I] of height r=∑imi, a quiver Hecke algebra RQ(ν) is the graded k-algebra generated by idempotents e(i) for sequences i=(i1,…,ir) with content ν, dots y1,…,yr, and crossings ψ1,…,ψr−1. Put ski=(i1,…,ik+1,ik,…,ir). The defining relations are

e(i)e(j)=δi,je(i),∑ie(i)=1,yae(i)=e(i)ya,yayb=ybya, ψke(i)=e(ski)ψk,ψkya=yaψk  (a≠k,k+1), (ψkyk+1−ykψk)e(i)=(yk+1ψk−ψkyk)e(i)=δik,ik+1e(i),ψk2e(i)=Qik,ik+1(yk,yk+1)e(i), ψkψl=ψlψk  (∣k−l∣>1),(ψk+1ψkψk+1−ψkψk+1ψk)e(i)={Qik,ik+1(yk+2,yk+1)−Qik,ik+1(yk,yk+1)yk+2−yke(i),ik=ik+2≠ik+1,0,otherwise.

The displayed quotient is a polynomial because its numerator vanishes when yk+2=yk. The degrees are deg⁡e(i)=0, deg⁡(yke(i))=2dik, and deg⁡(ψke(i))=−dikaikik+1.

For this definition, a small additive k-linear graded abelian category has a set of objects and morphisms, finite biproducts, kernels and cokernels with every monomorphism a kernel and every epimorphism a cokernel, k-vector-space Hom groups with bilinear composition, and a decomposition Hom⁡C(M,N)=⨁s∈ZHom⁡Cs(M,N) with identities in degree zero and composition adding internal degrees. This internal degree is separate from any cohomological degree. An exact functor is a k-linear functor preserving short exact sequences in the underlying abelian categories. A functor G:C→D between such graded categories is degree-preserving (degree zero) if

G ⁣(Hom⁡Cs(M,N))⊆Hom⁡Ds(GM,GN)

for every M,N and s∈Z. An adjunction F⊣E is specified by natural unit and counit maps satisfying the two triangle identities. A natural transformation is a family of morphisms commuting with every source morphism; homogeneous degree s means each component belongs to the internal degree-s Hom space. If a proposed action uses internal shifts in an adjunction, those shifts and the degrees of its unit and counit maps are part of the specified data. For an abelian category C, its exact Grothendieck group K0(C) is generated by isomorphism classes [M] with relations [B]=[A]+[C] for each short exact sequence 0→A→B→C→0.

A KLR categorical action contract specifies, for each λ∈X, such a small additive k-linear graded abelian category Cλ, degree-preserving exact functors Fi:Cλ→Cλ−αi with specified degree-preserving exact right adjoints Ei:Cλ−αi→Cλ, and homogeneous natural transformations xi:Fi⇒Fi of degree 2di and τij:FiFj⇒FjFi of degree −diaij. If a proposed adjunction convention uses internal shifts, those shifts and the degrees of its unit and counit maps must be stated explicitly. For each ν and λ, the direct sum of composite functors Fi1⋯Fir over sequences of content ν must carry an action of RQ(ν): e(i) is projection to the indicated sequence summand, yk acts by the dot on the kth factor, and ψk acts by the crossing on adjacent factors, all with the relations displayed above. Functor-composition order and grading shifts must be fixed in the proposed action and used consistently.

This contract records required data and checks; it does not assert that any such categories, functors, or transformations exist. A claim of an integrable action additionally states and proves local nilpotence: for every object M and color i, some powers EiN(M) and FiN(M) vanish. A claimed highest-weight action additionally specifies a weight λ, a chosen object in Cλ killed by every Ei, and the precise subcategory generated from it by the Fi, shifts, finite sums, and summands. To assert that the induced operators on K0(C):=⨁λ∈XK0(Cλ) form a representation of Uq(g), the contract must identify the exact Grothendieck-group convention, establish every required quantum-group relation, and cite a decategorification theorem whose hypotheses match the specified categories and functors. Merely satisfying the positive KLR relations does not establish those extra conclusions.

A physical interpretation as line-changing defects requires a separately specified defect 2-category, whose objects are declared defect sectors, whose 1-morphisms are declared defects changing sectors, and whose 2-morphisms are declared junction maps. A 2-functor here assigns objects, functors, and natural transformations while preserving identities and both compositions; a weak target additionally requires its coherence isomorphisms and equations. No physical defect realization is part of this mathematical contract.

Diagrammatic convention

The diagram depicts the generating 2-morphism that exchanges adjacent functor factors. The lower labels are the source order (i,j) and the upper labels the target order (j,i); time/composition is read upward. The crossing is the formal natural transformation τij, not an invertible topological braid crossing. The overpass convention is only a drawing convention and carries no extra algebraic relation; the displayed KLR relations, not the picture, define the action.

diagram failed to render:
\begin{tikzpicture}[baseline=(current bounding box.center),>=stealth,thick]
  \draw (0,0) .. controls (0,0.4) and (1,1.1) .. (1,1.5);
  \draw[white,line width=5pt] (1,0) .. controls (1,0.4) and (0,1.1) .. (0,1.5);
  \draw (1,0) .. controls (1,0.4) and (0,1.1) .. (0,1.5);
  \node at (0,-0.25) {$i$};
  \node at (1,-0.25) {$j$};
  \node at (0,1.75) {$j$};
  \node at (1,1.75) {$i$};
  \node at (0.5,0.75) {$\tau_{ij}$};
  \draw[->] (1.7,0.1) -- (1.7,1.4) node[midway,right] {$\text{composition}$};
\end{tikzpicture}

Remarks

The Khovanov–Lauda and Rouquier presentations use convention choices for root data, grading shifts, and polynomial parameters. The data above fixes one symmetrizable Cartan convention explicitly. A proposed action in another convention must provide a checked translation to these formulas before it can be used as a supplier.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources