Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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 affine Hecke algebra and its commuting action on tensor powers of the vector representation

Definition

Fix e≥2 and keep all conventions of The level-zero vector representation, its affinization and the level-one crystal energy: the Cartan datum, the space Vaff=⨁m∈ZQ(q)um with um=zavj (m=j−ae, j∈{1,…,e}), the operators Kh,Ei,Fi, the classical weights λj=Λj−Λj−1, and the fixed coproduct Δ(Kh)=Kh⊗Kh, Δ(Ei)=Ei⊗Ki−1+1⊗Ei, Δ(Fi)=Fi⊗1+Ki⊗Fi of The Drinfeld–Jimbo formulas define a Hopf algebra. Put Q:=q2 and c:=Q−1, and let Yj denote the operator "multiply the j-th tensor factor by z", so that Yj is invertible with Yjum=um−e in the j-th slot and different Yj commute.

The affine Hecke algebra H~N. For N≥1, H~N is the unital Q(q)-algebra with generators S1,…,SN−1 and invertible Y1±1,…,YN±1 subject to

Si2=(Q−1)Si+Q,SiSi+1Si=Si+1SiSi+1,SiSj=SjSi(∣i−j∣≥2),

YiYj=YjYi,SiYj=YjSi(j∉{i,i+1}),SiYiSi=QYi+1.

The element ti:=−q−1Si then satisfies (ti−q−1)(ti+q)=0; for a reduced word w=si1⋯sik∈SN put Sw:=Si1⋯Sik and AN:=∑w∈SNSw (well defined by the braid relations).

The two-vector operator and its extension. On residue tensors vj⊗vk (j,k∈{1,…,e}) set

S(vj⊗vk)={−q vk⊗vj,j<k,− vj⊗vj,j=k,−q vk⊗vj+(Q−1)vj⊗vk,j>k.

For a Laurent monomial f=Y1pY2q define, with s(f):=Y2pY1q the swap of the two loop variables,

S(f w):=s(f) S(w)+(1−Q) Y2 f−s(f)Y1−Y2 w(w∈V⊗V),

and extend linearly; the quotient (f−s(f))/(Y1−Y2) is a Laurent polynomial, so S is a well-defined linear endomorphism of Vaff⊗Vaff. On Vaff⊗N the generator Si acts by this operator on the tensor factors i,i+1 and Yj acts on the j-th factor as above; this defines the affine Hecke action. The whole action commutes with the derived quantum group Uq′(g) (the generators Ei,Fi and Kh with h in the span of the simple coroots). Each Si, and therefore AN, also preserves total loop degree and commutes with the full affine quantum-group action. The individual loops instead satisfy KdYjKd−1=qYj. Products are composed as left operators; right-action notation reverses their order using the anti-involution fixing the generators.

Facts & Assumptions

Given: The Laurent tensor space and its vector action from The level-zero vector representation, its affinization and the level-one crystal energy, the displayed operators Si,Yj, and the fixed coproduct from The Drinfeld–Jimbo formulas define a Hopf algebra.

[F1]

The vector basis has um=zavj with m=j−ae, Eium=δm≡i+1um−1, Fium=δm≡ium+1, and Kivj=qδi,j−δi,j−1vj. In particular E0=zE0fin, F0=z−1F0fin, Kdum=qaum, and wt(um−e)=wt(um)+δ (The level-zero vector representation, its affinization and the level-one crystal energy).

[F2]

The coproduct is Δ(Kh)=Kh⊗Kh, Δ(Ei)=Ei⊗Ki−1+1⊗Ei, Δ(Fi)=Fi⊗1+Ki⊗Fi, and is coassociative (The Drinfeld–Jimbo formulas define a Hopf algebra).

Verification

technique · establish the finite residue identities and the divided-difference identities, combine them for the full Laurent Hecke action, and verify coproduct commutation in an ordered residue window for each color
1.1givenalgebra

Write x=Y1,y=Y2, let s swap them, and set D(f)=y(f−s(f))/(x−y). For an integer l>0, (xl−yl)/(x−y)=∑r=0l−1xl−1−ryr; for l<0 it is −∑r=1−lx−ryr+l−1, obtained by factoring x−ly−l from the positive formula, and for l=0 it is zero. Factoring a common Laurent monomial proves that D preserves the Laurent ring. The identity D(fg)=D(f)g+s(f)D(g) follows by subtracting s(f)s(g) from fg. With d=y/(x−y), s(d)=−x/(x−y) and d+s(d)=−1, expansion of D=d(1−s) gives D2=−D and sD+Ds=1−s. These rational computations are identities on Laurent polynomials because the finite sums show that all the operators preserve that ring.

1.2givenalgebra

Let T be the displayed residue matrix. For a=vj⊗vk, b=vk⊗vj, j<k, one has T2a=Qa−qcb and T2b=−qca+(Q+c2)b, while T2dj=dj on dj=vj⊗vj. Hence T2=cT+Q. The finite braid is also an exact finite residue identity: abbreviate a triple by its order pattern ijk, where 1<2<3, and let L=T1T2T1, R=T2T1T2. Applying the three-case matrix gives the following common values: L(111)=R(111)=−111; L(112)=R(112)=−Q211; L(121)=R(121)=−Q121+qc211; L(211)=R(211)=−Q112+qc121+c211; L(122)=R(122)=−Q221; L(212)=R(212)=−Q212+qc221; L(221)=R(221)=−Q122+qc212+c221; L(123)=R(123)=−q3321; L(132)=R(132)=−q3231+Qc321; L(213)=R(213)=−q3312+Qc321; L(231)=R(231)=−q3132+Qc(312+231)−qc2321; L(312)=R(312)=−q3213+Qc(312+231)−qc2321; L(321)=R(321)=−q3123+Qc(213+132)−qc2(312+231)+(c3+Qc)321. These thirteen patterns exhaust all triples of residues, including repeated residues for e=2, proving the finite braid for every e.

1.3F1F2givenalgebra

For a nonzero color i, let A=vi be its top vector and B=vi+1 its bottom; Ki has eigenvalues q,q−1 there and 1 on every other residue O. On the four pairs AA,AB,BA,BB, the coproduct maps are Δ(Ei):(0,AA,q−1AA,qAB+BA) and Δ(Fi):(BA+qAB,BB,q−1BB,0) respectively. Applying T before or after them gives respectively TΔ(Ei)=Δ(Ei)T:(0,−AA,−q−1AA,−qAB−BA) and TΔ(Fi)=Δ(Fi)T:(−BA−qAB,−BB,−q−1BB,0). For spectator pairs, BO↦AO, OB↦OA under Ei, and AO↦BO, OA↦OB under Fi, with other pairs killed. Since A,B are consecutive residues, every spectator is below both or above both, so the order comparison and the coefficients in T are unchanged by these maps. This proves residue commutation in every case. T also preserves each total derived toral weight because it only permutes residues.

2.1step 1.1step 1.2algebra

On the Laurent tensor space the operator is S=Ts−cD, with T acting only on residues. It commutes with s,D on coefficients. Thus S2=T2−cT(sD+Ds)+c2D2=cT+Q−cT(1−s)−c2D=cS+Q by steps 1.1 and 1.2. This proves the quadratic relation on all loop powers, rather than only on residue tensors. Off-adjacent operators commute because their residue matrices and divided differences involve disjoint positions.

2.2step 1.1step 1.3F1F2algebra

For i≠0, Δ(Ei),Δ(Fi) and the derived torals act by constant residue matrices and commute with scalar Laurent multiplication and the coefficient operators s,D. Together with step 1.3 and S=Ts−cD this proves their commutation with S on every Laurent tensor. In particular the correct extension of a commutator is [S,Δ(X)](fw)=s(f)[S,Δ(X)]w, since the divided-difference terms cancel; it is not a formula with f instead of s(f). More generally step 1.1 gives S(fh)=s(f)S(h)−cD(f)h for every Laurent tensor h, by applying the Leibniz identity to its residue coefficients.

3.1step 1.1step 1.2step 2.1algebra

For three adjacent loop variables z1,z2,z3 put bij=−czj/(zi−zj), a=b12, b=b23, and h=b13. Then bij+bji=c and δ0:=ab−h(a+b−c)=0, the latter following on multiplying by (z1−z2)(z2−z3)(z1−z3). Write Si=(Ti−bi,i+1)si+bi,i+1. Expand S1S2S1−S2S1S2 with every coefficient on the left, using sibjk=bsi(j),si(k)si. After using Ti2=cTi+Q and T1T2T1=T2T1T2, the coefficients at 1,s1,s2,s1s2,s2s1,s1s2s1 are respectively (a−b)δ0, (T1−a)δ0, −(T2−b)δ0, 0, 0, and −(T1−T2)δ0. For example the coefficient at 1 is a2b+h(Q+a(c−a))−b2a−h(Q+b(c−b))=(a−b)δ0; the longest coefficient is (T1−a)(T2−h)(T1−b)−(T2−b)(T1−h)(T2−a)=−(T1−T2)δ0. Hence all coefficients vanish. Clearing the three differences gives the identity in the original Laurent tensor space, whose injection into its rational coefficient space is faithful; the operators already preserve the Laurent space by step 1.1. This proves the full braid, with no finite-loop truncation assumption.

4.1step 1.1step 2.1step 3.1algebra

The loop multiplication operators are invertible and commute. From step 1.1 and the extension formula, for l>0 one has Sxl=ylS−c∑r=1lxl−ryr; for l<0 one has Sxl=ylS+c∑r=1−lx−ryr+l, and for l=0 there is no correction. These identities hold on every tensor by the divided-difference Leibniz formula. In particular Sx=yS−cy and Sy=xS+cy. Therefore SxS=yS2−cyS=Qy by step 2.1. These are precisely the Bernstein and off-adjacent loop relations in the Definition. Finally t=−q−1S satisfies (t−q−1)(t+q)=q−2(S+1)(S−Q)=0, and equivalently t2=(q−1−q)t+1.

5.1step 1.1step 4.1step 1.3step 2.2F1F2algebra

For the affine color use the ordered Laurent basis w1=zve=u0, w2=v1=u1, through we=ve−1=ue−1. For 1≤j<e, the extension formula gives S(x(ve⊗vj))=−qy(vj⊗ve) and S(y(vj⊗ve))=−qx(ve⊗vj)+cy(vj⊗ve); also S(xy(ve⊗ve))=−xy(ve⊗ve). On the other pairs the residue formula is unchanged. Thus S on wa⊗wb is exactly the same three-case matrix in the order w1<⋯<we, and its extension remains the formula in step 2.2. On this basis E0w2=w1, F0w1=w2, with all other images zero, because E0=zE0fin and F0=z−1F0fin. Their toral eigenvalues are q,q−1 on w1,w2 and 1 on spectators. Consequently precisely the finite commutation calculation of step 1.3 applies to color 0, followed by the constant-matrix Laurent argument of step 2.2. This proves all affine-color commutators on arbitrary positive and negative loop powers.

6.1step 1.1step 2.2step 5.1F1F2algebra

On two factors S preserves total residue weight and total loop degree: s swaps loop powers and D has total degree zero, since its numerator is multiplied by y and divided by x−y. Hence it commutes with Kh⊗Kh for every full toral Kh, including Kd. Each Yj commutes with Ei,Fi and derived torals by [F1], but increases total loop degree by one, giving KdYjKd−1=qYj. For N>2, the iterated coproduct of Ei is the sum of terms 1⊗(r−1)⊗Ei⊗(Ki−1)⊗(N−r), and that of Fi is the sum Ki⊗(r−1)⊗Fi⊗1⊗(N−r). The two terms in the adjacent slots combine into their two-factor coproduct; a term outside those slots has either Ki±1⊗Ki±1 or 1⊗1 there. Steps 2.2 and 5.1 and the toral commutation therefore prove [Sj,Δ(N)(X)]=0 for every full generator X. Individual Yj commute with the derived action for the same slotwise reason.

7.1step 2.1step 3.1step 4.1step 2.2step 5.1step 6.1∎

The quadratic, braid, distant, loop and Bernstein identities prove the displayed affine Hecke action on the entire Laurent tensor space. The finite Hecke operators Si commute with the full quantum-group action; their products Sw are well defined by reduced words and their sum AN has the same commutation and total-degree properties. The entire affine Hecke action, including each individual loop, commutes with the derived action, with the degree covariance of step 6.1. This establishes exactly the scope and normalization claimed in the Definition.

Remarks

The loops have degree one, whereas Si and AN have degree zero. The action uses the fixed coproduct throughout; flipping to the opposite channel is a separate convention change. At q=1, Si is the negative flip, including its Laurent coefficients.

Depends on

Used by

Dependency tree · two levels

18 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