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 cyclotomic Hecke algebra

Definition

Let Hd be the degenerate affine Hecke algebra of The degenerate affine Hecke algebra and let a=(a1,…,al) be a multiset of complex numbers, l≥1. The degenerate cyclotomic Hecke algebra is H0(a)=C for d=0, and for d≥1 is the quotient Hd(a):=Hd/(∏j=1l(x1−aj)), the two-sided ideal being the one generated by the displayed polynomial (Left, right and two-sided ideals, The ideal generated by a subset and principal ideals, For a two-sided ideal I, the additive cosets form a ring R/I with identity 1+I).

Assume the Axiom of Choice The Axiom of Choice for the tensor-realization verification below; the quotient definition itself is choice-free.

The verification below records the structure of Hd(a) used on this page. A C-basis is given by the ordered monomials x1r1⋯xdrdw,0≤r1,…,rd<l, w∈Sd, so that dim⁡Hd(a)=ldd!; the polynomial-degree filtration has associated graded the algebra C[x1,…,xd]/(x1l,…,xdl)⋊C[Sd]. For integral roots aj∈Z this is the cyclotomic quotient Hd(Λ) attached to the dominant weight Λ=∑jmjΛj of the integer type-A root system, with mj=#{i:ai=j}; for general complex roots one uses a separate integer chain in each coset of C/Z, and the symbol Λa denotes a formal fundamental weight on that chain, not an index of the integer-only lattice. The pyramid roots of the finite-W-algebra constructions are aj=cj+qj−n for the origin c=(c1,…,cl) and the pyramid columns q1≥⋯≥ql. If l=1, then xj=a1+∑k<j(k j) in the quotient. The generator-fixing anti-involution of Hd descends to Hd(a). The top coefficient functional of the monomial basis is a nondegenerate symmetric trace on Hd(a), and it restricts to a nondegenerate trace on every central block corner.

Facts & Assumptions

Given: The degenerate affine Hecke algebra Hd, a multiset a=(a1,…,al) of arbitrary complex numbers with l≥1, and its quotient A=Hd/(f(x1)), where f(t)=∏j(t−aj) and the ideal is two-sided. Assume AC The Axiom of Choice for the Skryabin/tensor realization used in PBW independence.

[F1]

The affine ordered monomials form a basis, xi commute, and the cross relations are sixi+1=xisi+1 and sixi=xi+1si−1. Its generator-fixing anti-involution exists (The degenerate affine Hecke algebra).

[F2]

The pyramid construction provides g,p,m,e,χ and the automorphism η(Eab)=Eab+δab(n−∑h≥col(a)qh). The Whittaker bimodule is Qχ=U(g)/U(g)Iχ with right W-action by η. PBW identifies it as a vector space with U(p) (The type-A nilpotent pyramid, good grading and Whittaker character, The type-A finite W-algebra and the Whittaker category, PBW gives an ordered monomial basis for the enveloping algebra).

[F3]

For any p-module M and finite-dimensional g-module X, the tensor-isomorphism of Skryabin's equivalence for the type-A Whittaker pair identifies Wh((Qχ⊗WM)⊗X) with M⊗X by (η(u)1χ⊗m)⊗v↦um⊗v. These identifications are natural and compatible with tensor associativity. No cyclotomic quotient is part of this input.

[F4]

The Casimir operators on M⊗V⊗d satisfy the affine Hecke relations, commute with g, and therefore restrict to Whittaker vectors; their naturality transports them through F3 (The Casimir and place-permutation operators satisfy the degenerate affine Hecke relations).

[F5]

Filtered leading symbols multiply in the associated graded (Associated graded algebra of a filtered algebra).

Proof

technique · direct

Given: A=Hd/(f(x1)), the polynomial-degree filtration, and F1–F5; assume AC for F3 and the transported representation.

1.1F1algebra

Bounded spanning in every variable. For each r, put wr=sr−1⋯s1 (and w1=1). In the affine algebra the cross relations give wrx1wr−1=xr+ terms of polynomial degree zero. Hence wrf(x1)wr−1=xrl+ terms of degree at most l−1. This element is zero in A. Every affine ordered monomial with an exponent at least l can therefore have a factor xrl replaced by terms of strictly smaller total polynomial degree; straightening those terms never increases that degree. Induction on total degree, applied to every such replacement, expresses every monomial as a linear combination of x1r1⋯xdrdw with 0≤ri<l. The same induction proves that FmA is spanned by bounded monomials of degree at most m.

1.2F2F3F4construct

A realization for arbitrary complex roots. For d≥1 choose an integer n≥d and the rectangular partition λ=(l,…,l) with n rows, so every column has height qj=n and e has n strings of length l. On p define the one-dimensional module Ca by Eab↦δabacol(a). This is a Lie character: it vanishes on the strictly positive nilradical and is aj times the trace on the jth Levi block. In particular no integrality or coset condition on aj is needed. Restrict this module to W and use F3 with X=V⊗d. Restrict the affine Hecke operators on (Qχ⊗WCa)⊗V⊗d to Whittaker vectors, then transport through F3. This defines an affine Hecke action on Va⊗d=Ca⊗V⊗d; the si are place permutations. The following step computes x1 before asserting any quotient factorization.

1.3F2F3F4step 1.2algebra

The transported first operator. Write Qc=Qχ⊗WCa and define πc:Qc→C by πc(η(u)1χ⊗1)=u⋅1. It is well defined: the right W-relations become multiplication by the restricted character, and PBW gives representatives η(u)1χ. For a tensor basis vector vj write its unique Whittaker preimage under F3 as z=∑izi⊗vi, with zi∈Qc. Then πc(zi)=δi,j. If col(a)≤col(b), then Eab∈p and πc(Eabzi)=δab(acol(a)+∑h≥col(a)qh−n)δi,j, since η−1(Eab)=Eab−δab(n−∑h≥col(a)qh). If col(a)>col(b), the Whittaker equation for Eab instead gives Eabzi=χ(Eab)zi−∑kzk, where k runs over tensors obtained from i by replacing an occurrence of a by b. Apply πc⊗1 to Ω01z=∑a,b,iEabzi⊗Eba(1)vi. The terms with col(a)≤col(b) give (acol(j1)+∑h≥col(j1)qh−n)vj. The χ term gives vL1(j), because χ(Eab)=1 exactly when b=L(a). In the negative sum, replacing the first occurrence gives −∑h>col(j1)qh vj; replacing an occurrence in position k>1 gives −vj⋅(1 k) exactly when col(jk)<col(j1). Consequently the transported right action is vjx1=vL1(j)+(acol(j1)+qcol(j1)−n)vj−∑k>1: col(jk)<col(j1)vj⋅(1 k). Here a nonexistent left-shift term is zero. In our rectangle qj=n, so the diagonal coefficient is precisely acol(j1).

2.1F1F5step 1.3algebra

The cyclotomic relation and the leading symbols. Let Ck be the span of tensors whose first entry has column at most k, with C0=0. Step 1.3 gives Ck(x1−ak)⊆Ck−1: both the left shift and every exchange strictly lower the first column, while x1 preserves Ck−1. Thus successively applying (x1−al),…,(x1−a1) kills Cl=V⊗d. The factors commute, so f(x1)=0 and the action factors through A. Grade V by deg⁡vb=l−col(b) and give its endomorphism algebra the induced filtration. In step 1.3 the left shift has degree one and every other term has total tensor degree zero. Hence gr⁡1x1=e1. The recursion xj+1=sjxjsj+sj shows by induction that all xj are filtered of degree one with leading symbol ej, and that sj have degree zero with symbols the place permutations.

3.1F1F5step 1.1step 2.1algebra

Independence and the associated graded algebra. The cross relations and the conjugated relations in step 1.1 give a surjection B=C[X1,…,Xd]/(X1l,…,Xdl)⋊C[Sd]↠gr⁡A. Its composite with the associated graded tensor representation is Xj↦ej, w↦ place permutation. Choose the rightmost box in each of d distinct rows and let v be the tensor of those boxes. For bounded r and w, the vectors ve1r1⋯edrdw are distinct tensor basis vectors: their row labels identify the permutation, and their columns identify all ri. Therefore this composite is injective. It follows that B≅gr⁡A. Taking leading symbols of a hypothetical linear relation among bounded monomials, first in its largest total degree and then inductively, proves their independence. Along with step 1.1 this gives the claimed PBW basis, its filtration compatibility, and dim⁡A=ldd!. The longest strings have length l, the number of columns, and there are n=ql≥d of them; no column height is used as their length. For d=0 the algebra, basis and associated graded are all C, so the assertions hold directly.

4.1step 1.3step 3.1algebra

Integral roots and the pyramid dictionary. For integral roots write mi=#{j:aj=i}; then f(x1)=∏i(x1−i)mi, the quotient attached to Λ=∑imiΛi. For arbitrary complex roots the same algebraic definition applies, with integer-chain bookkeeping separately in each coset of C/Z. The rectangle above has cj=aj and qj=n, hence aj=cj+qj−n; the general pyramid dictionary is the displayed diagonal term of step 1.3. No general complex root is identified with an integer-only fundamental-weight index.

4.2F1step 3.1algebra

Level one and the anti-involution. For l=1, x1=a1 and xj+1=sjxjsj+sj give xj=a1+∑k<j(k j) by induction; the basis of step 3.1 identifies the quotient with C[Sd]. The generator-fixing anti-involution fixes f(x1) and preserves its two-sided ideal, so descends to A.

4.3F5step 3.1algebra

The graded top pairing. Put D=d(l−1) and T=x1l−1⋯xdl−1. Let τ0:B→C be the coefficient of X1l−1⋯Xdl−1⋅1. For graded monomials Xrw,Xsv, this coefficient is one exactly when wv=1 and r+w(s)=(l−1,…,l−1), and is zero otherwise. The equivalent reversed condition is vw=1 and s+w−1(r)=(l−1,…,l−1); thus τ0 is symmetric. Each basis element pairs with its unique complementary element, so the pairing is perfect, including between degrees m and D−m. Define τ:A→C as the coefficient of T⋅1 in the PBW basis. By filtration compatibility τ=τ0∘gr⁡D on A=FDA, and it vanishes on FD−1A. Therefore, if a∈FmA and b∈FD−mA, then τ(ab)=τ0(gr⁡m(a)gr⁡D−m(b))=τ(ba). This establishes cyclicity only under the stated degree bound so far.

5.1F1step 4.3algebra

Full generator cyclicity. Since permutations have degree zero, step 4.3 gives τ(aw)=τ(wa) for every a∈A, w∈Sd. To check τ(xib)=τ(bxi) for all bounded basis monomials b, step 4.3 suffices when deg⁡b<D. The remaining ones are exactly b=Tw. The polynomial T is central: it commutes with the xj, and the cross relations directly give sj(xjxj+1)=(xjxj+1)sj, while sj commutes with the other variables. Hence sjT=Tsj. Applying the already proved permutation cyclicity twice gives τ(xiTw)=τ(wxiT)=τ(wTxi)=τ(Twxi). This proves cyclicity with every generator on every element; successively moving generators of a word from the beginning to the end proves τ(ab)=τ(ba) for all a,b∈A. It also covers l=1 (where T=1 and D=0).

6.1F5step 4.3step 5.1algebra∎

Nondegeneracy and block restriction. For 0≠a∈A, take its largest filtration degree m, so gr⁡m(a)≠0. By the perfect graded pairing of step 4.3 choose homogeneous b0∈BD−m with τ0(gr⁡m(a)b0)≠0, and lift it to b∈FD−mA. Then τ(ab)≠0. Thus the pairing has zero left radical, and symmetry gives zero right radical; this proves nondegeneracy without claiming that products of excess total degree have zero trace. If e is a central idempotent and 0≠a∈eA, choose b as above; then τ(aeb)=τ(ab)≠0, so the restriction to eA=eAe is nondegenerate and symmetric as well.

Remarks

  • The integer and nonintegral cases are kept separate on purpose: the integral case is the classical cyclotomic quotient of the type-A root system, while the general complex roots are handled through the pyramid realization whose columns are chosen large enough to make the tensor action faithful.

  • The trace of steps 4.3, 5.1 and 6.1 is the top PBW coefficient functional; it is the tool that rules out nonzero ideals in the radical in the double centralizer arguments on this page.

Depends on

Used by

Dependency tree · two levels

59 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