Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adapted
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.

Integer-color degenerate Hecke–KLR local inverse tables

Statement

Let k have characteristic zero, let W be a finite interval in Z, and let β be a multiset of n colors in W. Orient a→a+1 and put Qaa=0,Qa,a+1(u,v)=v−u,Qa+1,a(u,v)=u−v,Qab=1 (∣a−b∣>1). Let Rβ be the KLR algebra of this finite type-A datum in the native convention of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, and put ψr=−τr, yr=xrKLR. Let Hndg be the affine degenerate Hecke algebra with sr2=1, the symmetric-group braid relations, commuting xr, and srxr+1−xrsr=1, the same generator presentation as The degenerate affine Hecke algebra, here imposed over k. Complete Hndg at the central ideal generated by f(x)−f(β) for symmetric polynomials f, and complete Rβ at the central ideal generated by positive-degree symmetric polynomials in y. Denote these completions by H^βdg and R^β.

The polynomial coefficient algebra of either completion is Bβ=⨁ν∈Orb⁡(β)k[ ⁣[y1,…,yn] ⁣]e(ν),xre(ν)=(νr+yr)e(ν). For z=a−b+u−v choose the following rank-independent two-variable series: pab(u,v)={1a=b,z−1a≠b,qab(u,v)={1+v−ua=b,z−1a=b+1,1−z−1a≠b and a≠b+1. All denominators and every qab have nonzero constant term. There are mutually inverse continuous algebra maps fixing e(ν) and given by R^β⟶H^βdg:yre(ν)⟼(xr−νr)e(ν),ψre(ν)⟼(sr+pνrνr+1)qνrνr+1−1e(ν), H^βdg⟶R^β:xr⟼∑ν(νr+yr)e(ν),sr⟼∑ν(ψrqνrνr+1−pνrνr+1)e(ν). Here series are evaluated at (yr,yr+1) and are multiplied on the indicated right side of the crossing. The identities hold uniformly for all finite intervals, multisets and ranks, including rank zero. They therefore hold after any quotient in which the dots are nilpotent. No finite cyclic quantum-characteristic specialization is used. This lemma proves the local algebra maps; a separate cyclotomic/support/tower argument is needed to identify entire cyclotomic towers.

Facts & Assumptions

Given: The characteristic-zero field, finite integer interval, multiset, presentations, completions and specified series in the Statement.

[F1]

The native KLR presentation in The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum has the two equal-color dot moves for τ, the quadratic polynomial Q, and the reversed-word braid numerator [Q(u,v)−Q(w,v)]/(w−u). Replacing τ by −ψ gives ψu−vψ=−1, ψv−uψ=1, and ψ1ψ2ψ1−ψ2ψ1ψ2=[Q(u,v)−Q(w,v)]/(w−u) on colors (a,b,a).

[F2]

The arbitrary-base degenerate presentation of Affine type-A presentations and charged cyclotomic quotients specialized to k has exactly the relations listed in the Statement. It agrees over C with The degenerate affine Hecke algebra; no base-change of an unproved basis is assumed, because its affine basis and faithful action over k are proved below. The generators sr permute positions; the distinct notation σr below means actual permutation operators on polynomial or formal coefficient functions.

Proof

Given: The data and conventions of the Statement, and [F1]–[F2].

1.1givenF1F2algebra

The coefficient completions. A symmetric polynomial in the commuting x is central: the mixed relation gives srf=(σrf)sr−(f−σrf)/(xr−xr+1), first on monomials by induction, then on polynomials. A symmetric f has zero correction. The fiber of the elementary symmetric polynomials over their values on β consists exactly of the ordered permutations of β: the coordinates are roots with multiplicities of ∏a∈β(t−a). Its radical is the intersection of the finitely many corresponding maximal ideals, by the polynomial factorization and the fact that every coordinate satisfies this monic polynomial. The elementary-symmetric ideal and this radical have cofinal powers, since the fiber is finite dimensional and its radical nilpotent. Chinese remainders and completion therefore give Bβ with local coordinates xr−νr. On the KLR side symmetric dot polynomials are central by [F1], and the same argument at the all-zero fiber shows that its coefficient completion is Bβ.

2.1step 1.1givenalgebra

Invertible tables. If a≠b the integer a−b is a nonzero unit in k, so z−1 exists as a formal geometric series. In the backward case a=b+1, q=z−1 has constant 1. In the other unequal cases q=1−z−1 has constant 1−(a−b)−1, which could vanish only when a−b=1, already excluded. Equal colors give constant 1. For unequal colors pba(v,u)=−pab(u,v). Direct multiplication gives qab(u,v)qba(v,u)=1−z−2 on nonadjacent colors; on a forward arrow it gives −(z−1)/z2=(1−z−2)/(v−u) since z=−1+u−v; on a backward arrow it gives (z+1)/z2=(1−z−2)/(u−v) since z=1+u−v. Thus Qabqabσ(qba)=1−pab2 in all unequal cases, with no division by a nonunit left unresolved.

3.1step 2.1givenconstructalgebra

A concrete KLR action. On Bβ, dots multiply and idempotents project. Define Er=(σr−1)/(yr−yr+1) on equal adjacent colors. The numerator is divisible by the denominator for polynomials and formal series, so Er preserves the coefficient algebra. For unequal source colors (a,b) define ψr(fe(ν))=cab(yr,yr+1)σr(f)e(srν), where cab(u,v)=v−u if a=b+1 and cab(u,v)=1 otherwise. These explicit operators prove the local relations in the following five cases.

4.1F1step 3.1algebra

Quadratic and dot moves. Write δ=u−v. On equal colors E2=0, since E(f) is invariant under σ, and Eu−vE=−1, Ev−uE=1 follow by expanding the numerator. On unequal colors the dot moves are permutation identities and ψ2=cba(u,v)cab(v,u)=Qab(u,v). Indeed these products are v−u on a forward arrow, u−v on a backward arrow, and 1 off edges. Disjoint crossings commute because their variables and their two-color factors are disjoint. Idempotent moves and commutative dot relations hold by construction.

5.1step 4.1step 3.1algebra

Three distinct colors. Put u=y1,v=y2,w=y3, s=σ1,t=σ2, ρ=sts=tst, L=ψ1ψ2ψ1, M=ψ2ψ1ψ2. On a source (a,b,c) with all colors distinct, direct consecutive application of step 3.1 gives both L(f) and M(f) equal to cbc(u,v)cac(u,w)cab(v,w)ρ(f) in the (c,b,a) summand. The three pair factors commute. Hence L=M for every edge pattern among three distinct integer colors.

6.1step 5.1step 3.1algebra

Exactly the first two equal. On (a,a,b), a≠b, put h=cab(u,v)cab(u,w). Consecutive application gives L(f)=h stE1(f) and M(f)=E2(h stf). The polynomial h is symmetric in v,w, including the backward case h=(v−u)(w−u), so the product rule E2(hg)=E2(h)g+t(h)E2(g) gives M(f)=hE2stf. Finally E2st=stE1: both sides equal (ρ−st)/(v−w), with the denominator transformed when the permutation lies to its left. Thus L=M.

7.1step 6.1step 3.1algebra

Exactly the last two equal. On (a,b,b), a≠b, put h=cab(u,w)cab(v,w). The two words give L(f)=E1(h tsf) and M(f)=h tsE2(f). Here h is symmetric in u,v, including h=(w−u)(w−v) when a=b+1. The product rule gives L(f)=hE1tsf. The identity E1ts=tsE2=(ρ−ts)/(u−v) now yields L=M. This explicitly checks the second repeated-neighbor pattern.

8.1step 7.1step 3.1step 4.1algebra

Equal outer colors. On (a,b,a), a≠b, full expansion of the single middle divided difference gives L(f)=cba(u,v)[cab(v,w)ρ(f)−cab(v,u)f]/(u−w) and M(f)=cab(v,w)[cba(u,v)ρ(f)−cba(w,v)f]/(u−w). The ρ(f) terms cancel, and step 4.1 gives (L−M)(f)=[Qab(w,v)−Qab(u,v)]f/(u−w). Thus the correction is +1 for a→b, −1 for a←b, and zero off edges. The displayed expressions have removable denominators because their original numerators come from divided differences; the final quotient is a polynomial.

9.1step 8.1step 3.1algebra

All three equal. For Δ=(u−v)(u−w)(v−w), expand the three factors E=(σ−1)/(dot difference) in either order. Moving permutations to the right gives the complete identity E1E2E1=E2E1E2=(ρ−st−ts+s+t−1)/Δ. For example the ρ coefficient is 1/Δ, the st and ts coefficients are −1/Δ, the s,t coefficients are 1/Δ, and the identity coefficient is −1/Δ. Both sides preserve formal series by their original divided-difference formulas, so this rational equality proves their equality without inverting dots in the algebra. This supplies the all-equal case omitted in the cited source.

10.1step 4.1step 5.1step 6.1step 7.1step 8.1step 9.1algebra

Faithfulness for the KLR action. Moving dots to the right using step 4.1, and replacing repeated crossings and braid differences using steps 5.1–9.1, spans the presented KLR algebra by ψwf(y)e(ν) for fixed reduced words w. Termination uses crossing length: every quadratic reduction or braid correction has smaller length; reduced words for a permutation are connected by the elementary symmetric-group braid moves. In the rational-function action each ψw has leading term a nonzero coefficient times w, and all other terms have smaller permutation length. Distinct permutations of variables are linearly independent over the rational-function field: a shortest putative relation, evaluated on fg minus one selected automorphism's value on g times its evaluation on f, gives a shorter nonzero relation. Hence these spanning monomials are independent. The same triangular argument over fractions of formal series proves faithfulness of the completed action, whose elements are the finite sum over w,ν with formal coefficient f.

11.1step 1.1step 10.1algebra

Why formal extension is legitimate. There are finitely many w,ν, and each basis vector ψwe(ν) has a finite crossing degree. Symmetric positive-degree dots form a central ideal with powers cofinal with dot-degree powers in each coefficient algebra by step 1.1. The PBW module just proved is consequently finite free over its right coefficient algebra and completes coefficientwise. Multiplication extends continuously: moving a formal coefficient through a crossing uses a variable permutation or one divided difference, decreasing its order by at most one, so any finite product has a uniform finite order loss. The displayed completed PBW expansion is therefore the actual central completion, rather than an additional relation imposed on Rβ.

12.1step 11.1step 1.1algebraconstruct

The common degenerate Hecke operator. In the fraction algebra set Zr=xr−xr+1 and Sr=(1+Zr−1)σr−Zr−1. On an unequal source component the diagonal term is −z−1f, while its crossing coefficient on the target component is 1+(b−a+u−v)−1. On equal colors this operator is σr−(1−σr)/(u−v) and preserves formal series. Thus Sr acts on Bβ in every case. All identities in the next two steps are computed in the fraction algebra and then hold for these regular operators. This use of auxiliary fractions does not assert that a dot difference is invertible in the completion or its quotients.

13.1F2step 12.1algebra

Hecke quadratic and mixed identities. Let A=Zr−1; then σr(A)=−A. Expanding Sr2 gives identity coefficient (1+A)(1−A)+A2=1 and crossing coefficient (1+A)A−A(1+A)=0. Thus Sr2=1, including equal colors. In Srxr+1−xrSr the crossing terms cancel and the diagonal term is A(xr−xr+1)=1. Disjoint Sr commute, and dots outside the pair commute with Sr. These are precisely the quadratic, mixed and far-commuting relations of [F2].

14.1step 13.1step 12.1algebra

Complete Hecke braid coefficients. In spectral variables put Z=x1−x2, U=x2−x3, V=Z+U, A=Z−1, B=U−1, C=V−1. Both products S1S2S1 and S2S1S2 have coefficients, in permutation order (1,s,t,st,ts,ρ), equal to (−C−ABC, (1+A)BC, (1+B)AC, −B(1+A)(1+C), −A(1+B)(1+C), (1+A)(1+B)(1+C)). To verify the reductions, multiply using (fσ)(gη)=fσ(g)ση, s(A)=−A, s(B)=C, t(B)=−B, t(A)=C, and AB=C(A+B). For example the raw s coefficient in the first word is A(1+A)(B−C)=(1+A)BC; its raw identity coefficient is −(1−A2)C−A2B=−C−ABC. Interchanging A,B and s,t gives the second word's identical six coefficients.

15.1step 12.1step 14.1algebra

All five reverse braid cases. Step 14.1 is a rational identity in independent spectral variables, before assigning colors. Substitute (x1,x2,x3)=(a+u,b+v,c+w) on each source component and apply the color-permuting operators. It proves the full Hecke braid separately on (a,b,c) with all distinct, (a,a,b), (a,b,b), (a,b,a) and (a,a,a), because each is the restriction of the same six-coefficient identity and every Sr preserves Bβ by step 12.1. Even when a displayed spectral denominator has zero constant, cancellation occurs in the original regular operators, and injectivity into fractions preserves the equality. Thus the all-equal reverse case also has a complete coefficient computation.

16.1F2step 1.1step 10.1step 13.1step 15.1algebra

Faithfulness for the Hecke action. The mixed relation moves polynomials to the right of s-words and the exact symmetric-group relations reduce each word to sw, so Hndg is spanned by swf(x). In the action of steps 12.1–15.1 its leading permutation coefficient is the product of nonzero rational factors 1+Z−1 along a reduced word. All lower terms have shorter permutation length. The shortest-relation argument of step 10.1 proves independence and therefore the affine Hecke PBW basis. Completing at the central ideal of step 1.1 gives the finite coefficientwise PBW module ∑w,νswk[ ⁣[y] ⁣]e(ν); its operator action remains faithful by the same argument over formal fractions. The coefficients 1+Z−1 need only be nonzero in that field, not units in the coefficient ring.

17.1step 16.1step 2.1step 3.1step 12.1algebra

Comparing the explicit tables. On an unequal source (a,b), Sr+pab has only the crossing term. Its target coefficient is 1+ζ−1, where ζ=b−a+u−v. Right multiplication by qab−1 substitutes (v,u) on that target. If a→b, qab(v,u)=1+ζ−1, giving coefficient 1; if a←b, qab(v,u)=−ζ−1 and ζ=−1+u−v, giving coefficient −(ζ+1)=v−u; off edges the quotient is again 1. On equal colors Sr=σr−(1−σr)/(u−v), and (Sr+1)(1+v−u)−1=(σr−1)/(u−v)=Er by moving the inverse through σr. Thus (Sr+p)q−1=ψr in the faithful action. Equivalently ψrq−p=Sr.

18.1step 1.1step 4.1step 5.1step 6.1step 7.1step 8.1step 9.1step 11.1step 13.1step 15.1step 16.1step 17.1construct

Homomorphisms in both directions. Faithfulness in steps 10.1–11.1 and 16.1 transfers the concrete equalities to the completed presented algebras. Step 17.1 identifies the forward images with the operators checked in steps 4.1–9.1, so all KLR relations hold in H^βdg. It identifies the reverse images with the operators checked in steps 13.1–15.1, so all Hecke relations hold in R^β. The coefficient-algebra maps identify the central completion topologies: the symmetric ideal vanishing at the spectral multiset and the all-zero dot ideal have cofinal powers on Bβ by step 1.1. Therefore the maps extend continuously to the stated completions. This proves both directions locally rather than importing a cyclic finite-e theorem.

19.1step 18.1algebra∎

Inverse composites and uniformity. The coefficient maps fix every e(ν) and invert yr=xr−νr componentwise. The crossing composites are (ψrq−p+p)q−1=ψr and ((sr+p)q−1)q−p=sr, with the same right multiplication order. Hence each composite is the identity on its generators, coefficient series and completion. None of p,q,c depends on the rank, multiset, interval endpoints, level or cyclotomic charge, so enlarging an interval preserves every formula on the old tuples. Nilpotent dots permit finite evaluation of series, and every proved identity survives a quotient. Rank zero has coefficient algebra k and both maps are the identity; empty positive-rank sectors have zero algebra. No assertion about cyclotomic support, based Grothendieck classes or Specht modules is needed for this local comparison.

Remarks

The proof supplies local inverse maps for arbitrary finite integer windows. An all-level cyclotomic tower comparison additionally uses finite support, cyclotomic factorization and tower compatibility, together with the generic nondegenerate local tables. This lemma makes no finite-A canonical-basis or Specht-class claim.

Depends on

Used by

Dependency tree · two levels

31 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