Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: 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 degenerate affine Hecke algebra

Definition

Work over the field C and fix an integer d≥0 (Algebras over a commutative ring, central structure maps, and algebra homomorphisms, Commutative ring). Let Fd be the free associative unital C-algebra on the d+max⁡(d−1,0) symbols x1,…,xd,s1,…,sd−1 (for d=0 there is only the unit; for d=1 only x1), with its word basis and universal property (The free associative R-algebra on a set and descent of relations), and let Id⊴Fd be the two-sided ideal (Left, right and two-sided ideals, The ideal generated by a subset and principal ideals) generated by the following elements:

  • xixj−xjxi for all 1≤i,j≤d;
  • si2−1 for 1≤i≤d−1;
  • sisi+1si−si+1sisi+1 for 1≤i≤d−2;
  • sisj−sjsi for 1≤i,j≤d−1 with ∣i−j∣>1;
  • sixj−xjsi for j∉{i,i+1}, sixi+1−xisi−1, and xi+1si−sixi−1, for 1≤i≤d−1 and 1≤j≤d.

The degenerate affine Hecke algebra is the quotient C-algebra Hd:=Fd/Id with unit element written 1 (For a two-sided ideal I, the additive cosets form a ring R/I with identity 1+I). We keep the symbols x1,…,xd,s1,…,sd−1 for their images, and for w∈Sd we write w for the image in Hd of any word in the si representing w; this is independent of the chosen word once the basis theorem below is proved. For d≥1 and a∈C, the notation Hd/(x1−a) means the quotient by the two-sided ideal generated by x1−a.

The verification below establishes exactly the structure of Hd used throughout this page: the ordered monomials x1r1⋯xdrdw,r1,…,rd≥0, w∈Sd, form a C-basis, so that Hd≅C[x1,…,xd]⊗CC[Sd] as a vector space with polynomial and group-algebra subalgebras (The polynomial ring R[xi:i∈I] as finitely supported coefficient families on monomials, The group ring R[G] of finitely supported formal R-linear combinations of group elements); H0=C and H1=C[x1]; for d≥1 and every a there is a unique algebra isomorphism Hd/(x1−a)≅C[Sd],xj⟼a+∑k<j(k j),si⟼(i i+1); and total polynomial degree is an algebra filtration whose associated graded is the semidirect product C[x1,…,xd]⋊C[Sd] in which si acts by swapping xi and xi+1. For d≥2, the cross relation is inhomogeneous, so it does not turn Hd into a graded algebra with deg⁡xi=1 and deg⁡si=0. For d=0 the algebra C has its degree-zero grading, and for d=1 the algebra C[x1] has its natural polynomial grading.

Facts & Assumptions

Given: An integer d≥0, the field C, the free associative C-algebra Fd on the symbols x1,…,xd,s1,…,sd−1, and the two-sided ideal Id of the Definition.

[F1]

Sd is the group of bijections of {1,…,d} under composition, with si=(i i+1); it is generated by s1,…,sd−1 subject to the Coxeter relations si2=1, sisi+1si=si+1sisi+1, sisj=sjsi for ∣i−j∣>1 (The symmetric group Sym⁡(X): the bijections of a set X under composition, The finite symmetric group Sn, one-line notation, and cycle notation, The symmetric group has the Coxeter presentation).

[F2]

C[Sd] is a unital C-algebra with C-basis {w:w∈Sd}, product induced by composition and unit the identity permutation (The group ring R[G] of finitely supported formal R-linear combinations of group elements, The group ring R[G] is a unital R-algebra with basis G, and each g∈G is a unit of R[G]).

[F3]

C[x1,…,xd] is a commutative C-algebra with C-basis the monomials x1r1⋯xdrd; it is a domain with fraction field Ω in which every nonzero polynomial is invertible; since xi≠xi+1 as polynomials, di:=xi−xi+1 is invertible in Ω (The polynomial ring R[xi:i∈I] as finitely supported coefficient families on monomials, Commutative ring, A polynomial ring over an integral domain is an integral domain, The field of fractions Frac⁡(D)=(D∖{0})−1D of an integral domain, Frac⁡(D) is a field and d↦d/1 embeds the integral domain D).

[F4]

Fd has the word basis and universal property, the two-sided ideal generated by a set E is the set of finite sums ∑sasesbs with es∈E, and a homomorphism killing E factors uniquely through Fd/(E) (The free associative R-algebra on a set and descent of relations, Left, right and two-sided ideals, The ideal generated by a subset and principal ideals, A ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring, For a two-sided ideal I, the additive cosets form a ring R/I with identity 1+I).

[F5]

For C-algebras A,B the tensor product A⊗CB is a C-algebra with (a⊗b)(a′⊗b′)=aa′⊗bb′; if (ai) and (bj) are bases, then (ai⊗bj) is a basis (The tensor product of R-algebras has multiplication (a⊗b)(a′⊗b′)=aa′⊗bb′, The elementary tensors of two bases form the product basis of the tensor product).

Proof

technique · direct

Given: The data of [F1]-[F6]: the presented algebra Hd=Fd/Id, the symmetric group Sd, the group algebra C[Sd], the polynomial algebra C[x1,…,xd] with fraction field Ω, and the tensor-product and quotient structures.

1.1F3F4given

The cases d=0,1. For d=0 there are no symbols, so F0=C and I0=0, giving H0=C. For d=1 the only symbol is x1 and the list of relations is empty; the words in x1 are 1,x1,x12,…, a C-basis of F1 by [F4], so H1 is the polynomial algebra C[x1] with basis x1r, r≥0.

1.2F1F3construct

The rational-function model. On the C-vector space Ω of [F3] let mf denote multiplication by f∈Ω, and for 1≤i<d let σi be the operator (σif)(y1,…,yd)=f(y1,…,yi+1,yi,…,yd) interchanging the i-th and (i+1)-st arguments. Put ai:=di−1∈Ω (invertible by [F3]), δi:=ai(1+σi) and Ti:=σi−δi. For a word w=si1⋯sik in the generators of Sd set σw:=σi1 ⁣∘⋯∘σik and Tw:=Ti1 ⁣⋯Tik. The operators σw are well defined by the Coxeter presentation [F1], because the σi satisfy those relations and the presentation says that any two words for the same w are related by them.

1.3F3algebragiven

The skew algebra. Let D:={∑w∈Sdmfwσw:fw∈Ω}⊆End⁡C(Ω), a C-subspace. For f,g∈Ω and u,v∈Sd the identities σumg=mσu(g)σu and σuσv=σuv hold (the first expresses the substitution action on functions, the second is word concatenation), so (mfσu)(mgσv)=mf σu(g)σuv; hence D is a subalgebra of End⁡C(Ω). The set {σw} is Ω-linearly independent: suppose ∑wfwσw=0 with fw∈Ω not all zero; multiplying the resulting identity of functions by a common denominator of the fw, we may assume fw∈C[x1,…,xd]. Fix integers N1>⋯>Nd whose consecutive gaps exceed the total degree of every fw, and order the finitely many w with fw≠0 by the lexicographic order of the vectors w⋅N:=(Nw−1(1),…,Nw−1(d)); let w be maximal and let e be the exponent of a top monomial of fw. Applying the sum to the monomial yN gives ∑w′fw′(y) yw′⋅N, because σw′yN=yw′⋅N; the vectors w′⋅N are distinct, and at the first coordinate where w′⋅N differs from w⋅N the gap exceeds the degree bound, so the monomial yw⋅N+e occurs exactly once, in the summand fwyw⋅N, with nonzero coefficient. This contradicts the vanishing of the sum, proving the claim.

1.4F1F3F4givenconstruct

Spanning of Hd by ordered monomials. We show that every element of Hd is a C-linear combination of the images of ordered monomials xrw; since words span Fd by [F4], it suffices to treat the image of a word W in the symbols. Use strong induction on the pair (n,ι) ordered lexicographically, where n is the number of x-symbols in W and ι is the number of pairs of positions (p<q) such that the p-th symbol is some si and the q-th symbol is some xj. If n=0, then W is a word in the si; by the Coxeter presentation [F1] the subalgebra generated by the si is spanned by the images of the elements w∈Sd, so the claim holds. If n>0 and every x-symbol precedes every s-symbol in W, then W is of the form (word in x's)(word in s's), and the claim follows from commutativity of the x's and the case n=0. Otherwise W=W1sixjW2 with adjacent symbols; use sixi+1=xisi+1 if j=i+1, sixi=xi+1si−1 if j=i (the relation xi+1si=sixi+1 solved for sixi), and sixj=xjsi if j∉{i,i+1}. In every case W≡W1xj′siW2±W1W2, where the first word has the same n and one fewer (s,x)-inversion pair, while the second has n−1 x-symbols; both fall under the induction hypothesis. Hence the images of ordered monomials span Hd.

1.5F1F2algebra

Jucys-Murphy elements. For 1≤j≤d put Jj:=∑k<j(k j)∈C[Sd], so J1=0. Then (i) JiJj=JjJi for all i,j; (ii) siJj=Jjsi for j∉{i,i+1}; and (iii) siJi+1=Jisi+1. For (i) with i<j write Ωm:=∑1≤k<l≤m(k l) for the sum of all transpositions in Sm; Ωm is central in C[Sm] because conjugation permutes the transpositions, and Jm=Ωm−Ωm−1. Since Ji∈C[Si]⊆C[Sm−1]⊂C[Sm] for i<m, centrality of Ωm in C[Sm] and of Ωm−1 in C[Sm−1] gives [Ji,Jm]=[Ji,Ωm]−[Ji,Ωm−1]=0. For (ii), conjugation by si sends each transposition (k j) to (si(k) si(j)); if j<i both entries are fixed, and if j>i+1 the sum over k<j contains the pairs with k=i and k=i+1, whose images are interchanged, so the sum is preserved. For (iii), conjugation sends (k i+1) to (k i) for k<i and fixes (i i+1), so siJi+1si=Ji+si; multiplying on the right by si and using si2=1 gives (iii).

2.1F1F4algebra

The model satisfies the relations. Since σimai=mσi(ai)σi=m−aiσi, the operator identity (1+σi)mai=mai(1−σi) and the rules σiδi=−δi, δiσi=δi hold; hence δi2=mai(1+σi)mai(1+σi)=mai2(1−σi)(1+σi)=0 and Ti2=σi2−σiδi−δiσi+δi2=1+δi−δi+0=1. For j∉{i,i+1} both σi and δi commute with mxj, so Timxj=mxjTi. For the cross relations, use σimxi+1=mxiσi, σimxi=mxi+1σi and the two identities mxiδi−δimxi+1=1 and δimxi−mxi+1δi=1: for the first, mxiδi=maixi(1+σi) while δimxi+1=maixi+1+maixiσi, and their difference is mai(xi−xi+1)=1; the second is the same computation with the roles of xi and xi+1 interchanged. Therefore Timxi+1−mxiTi=(mxiσi−mxiσi)+(mxiδi−δimxi+1)=1 and mxi+1Ti−Timxi=1. For ∣i−j∣>1, the variables and swaps in Ti,Tj are disjoint, so they commute. For the braid relation put A=(xi−xi+1)−1, B=(xi+1−xi+2)−1, C=(xi−xi+2)−1, so AB=C(A+B). The product rule of step 1.3 expands both TiTi+1Ti and Ti+1TiTi+1 with coefficients, in the order 1,σi,σi+1,σiσi+1,σi+1σi,σiσi+1σi, equal to (−C(1+AB),BC(1−A),AC(1−B),−B(1−A)(1−C),−A(1−B)(1−C),(1−A)(1−B)(1−C)). Here A(B−C)=BC and B(A−C)=AC, both consequences of AB=C(A+B), give the two shorter-swap coefficients and the common identity coefficient. Thus the braid relation holds. Hence the assignment xi↦mxi, si↦Ti preserves all the relations of the Definition, and by the universal properties [F4] it defines an algebra homomorphism Φ ⁣:Hd→End⁡C(Ω).

2.2F1step 1.3algebra

Triangular expansion. Fix w∈Sd with a reduced word w=si1⋯sik, and put c:=∏t=1k(σi1⋯σit−1)(1−ait)≠0 in Ω, with the empty prefix acting as the identity. Every transported factor is nonzero because the prefix is a field automorphism. In the expansion of Tw=∏t((1−ait)σit−ait) by the product rule of step 1.3, the term choosing the factor (1−ait)σit for every t contributes c σw after the scalar coefficients are moved left, while every other term is mgσv with v the product of a proper subword of si1⋯sik in the induced order. If ℓ denotes the minimal number of generators needed to express a permutation, then such a proper subword J has ℓ(v)≤∣J∣<k=ℓ(w), using subadditivity of ℓ and reducedness. Collecting the expansion in the Ω-basis {σv} therefore gives Tw=c σw+∑ℓ(v)<ℓ(w)cvσv with c≠0 and cv∈Ω.

2.3F1F2F4step 1.5construct

The evaluation homomorphism. Assume d≥1. The assignment xj↦a+Jj, si↦si defines an algebra homomorphism φ ⁣:Fd→C[Sd]: the images of the x's commute by step 1.5(i); the images of the si satisfy the Coxeter relations by [F1]; and the cross relations follow from step 1.5(ii) and from si(a+Ji+1)=(a+Ji)si+1, (a+Ji+1)si=si(a+Ji)+1, which are step 1.5(iii) read in both directions. Since φ(x1−a)=a+J1−a=0, the quotient universal property [F4] yields an algebra homomorphism φˉ ⁣:Hd/(x1−a)→C[Sd], which is surjective because the si generate Sd.

3.1F3step 1.3step 2.2algebra

Independence of the monomials in the model. By step 2.2 the change-of-basis matrix from {Tw} to {σw} inside D is triangular with nonzero diagonal when permutations are ordered by length, hence invertible over the field Ω; thus {Tw:w∈Sd} is an Ω-basis of D. Suppose ∑r,wcr,wmxrTw=0 in D with cr,w∈C finitely supported. Grouping by w gives ∑wPwTw=0 with Pw=∑rcr,wxr∈C[x1,…,xd]⊆Ω; Ω-independence of the Tw forces Pw=0 for every w, and linear independence of the monomials [F3] then forces cr,w=0. Hence the elements Φ(x1r1⋯xdrdw) are C-linearly independent.

4.1F2F5step 1.1step 2.1step 3.1step 1.4

Basis theorem. Let h∈Hd and write h=∑cr,wxrw using step 1.4. If h=0, applying the homomorphism Φ of step 2.1 gives ∑cr,wmxrTw=0, and step 3.1 yields cr,w=0. Hence the ordered monomials form a C-basis of Hd, and the C-linear map C[x1,…,xd]⊗CC[Sd]→Hd, f⊗w↦fw, is an isomorphism by [F5]; in particular C[x1,…,xd] and C[Sd] are subalgebras of Hd and the cross relations hold. The elementary cases H0=C, H1=C[x1] were recorded in step 1.1.

5.1F1F2step 4.1step 2.3algebra

The inverse map. Assume d≥1. In Hd the relation sixi+1=xisi+1 gives, after left multiplication by si and use of si2=1, the recursion xi+1=sixisi+si. Hence in Hd/(x1−a) one has x1≡a and inductively xj≡a+uj with uj in the subalgebra generated by the images of the si, namely u1=0 and uj+1=sjujsj+sj. By the basis theorem of step 4.1 every element of Hd is a combination of monomials xrw, and replacing each xj by a+uj expresses its image in Hd/(x1−a) as an element of the image of the subalgebra generated by the si; by [F1] and [F2] that image is the C-span of {w:w∈Sd}. Therefore the canonical map ρ ⁣:C[Sd]→Hd/(x1−a), w↦w+(x1−a), has image equal to the whole quotient, and it is injective because φˉ∘ρ=id⁡C[Sd] by construction; hence ρ is an isomorphism. Under it xj corresponds to a+uj, and φˉ(a+uj)=a+Jj by step 2.3, so φˉ(xj)=a+∑k<j(k j); in particular x1 corresponds to the scalar a, while for j≥2 the image is not the scalar a. The specified images of both the xj and the si determine the homomorphism uniquely because these elements generate the quotient.

5.2F4step 1.4step 4.1

The degree filtration. For k≥0 let Fk⊆Hd be the image of the C-span of all words in the symbols containing at most k of the symbols x1,…,xd. Steps 1.4 and 4.1 identify Fk with the span of the monomials xrw with ∣r∣≤k. The substitution rules of step 1.4 replace an adjacent pair sixj by terms containing at most one x-symbol each, so a product of a word with k x-symbols and a word with m x-symbols rewrites into words with at most k+m x-symbols; hence FkFm⊆Fk+m and (Fk)k≥0 is an algebra filtration with 1∈F0.

6.1F2F5step 4.1step 5.2algebra

The associated graded is a semidirect product. Let S:=C[x1,…,xd]⋊C[Sd] be the algebra with C-basis xrw and product xrw⋅xr′w′=xr+w⋅r′ww′, where (w⋅r′)j=rw−1(j)′; equivalently, S is generated by the symbols xi and w subject to the relations obtained from those of Hd by deleting the inhomogeneous term 1 from both cross relations, i.e. sixi+1=xisi and xi+1si=sixi. In gr Hd the defining relations of Hd project to these relations: the commutativity, Coxeter and distant-commutation relations are homogeneous of the stated degrees, while the two cross relations have the form (degree 1 element) =1 (degree 0 element), so their degree-1 parts are exactly sixi+1=xisi and xi+1si=sixi. Consequently there is a surjective graded algebra homomorphism S→gr Hd sending xi and w to the symbols of xi and w. In degree k both sides are C-spanned by the symbols xrw with ∣r∣=k: these form a spanning set of grkHd by step 5.2 together with the basis theorem of step 4.1, and they form the basis of the degree-k part of S by construction; a surjection between C-vector spaces with a spanning set of the same finite cardinality as a basis of the target is an isomorphism. Hence gr Hd≅S in every degree, and the associated graded is the semidirect product C[x1,…,xd]⋊C[Sd] in which si swaps xi and xi+1, as claimed.

7.1F6step 1.1step 5.2∎

Polynomial grading boundaries. For d=0, step 1.1 gives H0=C with its degree-zero grading; for d=1, it gives H1=C[x1] with the usual polynomial grading. For d≥2, suppose there were an algebra grading Hd=⨁k≥0Hd(k) with xi in degree 1 and si in degree 0. Then the relation sixi+1−xisi=1 would have its left-hand side in degree 1 and its right-hand side in degree 0, forcing 1=0, which is impossible. Hence for d≥2 the polynomial-degree filtration of step 5.2 does not arise from that generator grading; its cross relation is inhomogeneous.

Remarks

  • The filtration of step 5.2 is the polynomial-degree filtration, in which xi has degree 1 and si degree 0 and the associated graded is commutative in the polynomial part and is noncommutative overall for d≥2; it is the filtration used for the cyclotomic quotients later on this page.

  • The Arakawa-Suzuki generators yj used in the tensor constructions on this page are not the xj of this presentation: on a tensor module they differ by the central endomorphism zM/N−(N−1)/2 recalled in Arakawa-Suzuki Casimir operators on tensor functors. The presentation here is the one of [BKHL] and [BKAR]; both cross relations of the Definition are recorded because the recursion xj+1=sjxjsj+sj used in step 5.1 consumes the second one.

  • All arguments above are choice-free: the only selections made are finite (a monomial for the denominator clearing, a maximal permutation among finitely many), and no family of nonempty sets is used.

Depends on

Used by

Dependency tree · two levels

66 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