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 type-A finite W-algebra and the Whittaker category

Definition

Keep the type-A pyramid data (g,p,h,m,e,χ) of The type-A nilpotent pyramid, good grading and Whittaker character, with λ=(0≤p1≤⋯≤pn), transpose q1≥⋯≥ql, and χ(x)=tr⁡(xe) on m. Let η ⁣:U(p)→U(p) be the algebra automorphism with η(ei,j)=ei,j+δi,j(n−qcol(j)−qcol(j)+1−⋯−ql) for all matrix units ei,j∈p. Let Iχ be the kernel of the algebra homomorphism χ ⁣:U(m)→C extending the Lie character χ, that is, the two-sided ideal generated by x−χ(x), x∈m (Universal enveloping algebra, Left, right and two-sided ideals, The ideal generated by a subset and principal ideals), and let U(g)Iχ be the left ideal it generates in U(g).

The type-A finite W-algebra is W(λ)={u∈U(p):[x,η(u)]∈U(g)Iχ for all x∈m}. It is a subalgebra of U(p), and Qχ=U(g)/U(g)Iχ is a (U(g),W(λ))-bimodule with right action vˉ⋅u=v η(u)‾. This is a module quotient by a left ideal; no quotient-ring multiplication is imposed.

The Whittaker category C(λ) is the category of g-modules on which x−χ(x) acts locally nilpotently for every x∈m (Representations of Lie algebras). For M∈C(λ) the Whittaker vectors Wh(M)={v∈M:xv=χ(x)v for all x∈m} form a W(λ)-module with u⋅v=η(u)v, and Wh(M)=0 implies M=0.

The verification below establishes the algebra and module structures just stated. The associated graded of the loop filtration on U(p) makes W(λ) a filtered deformation of U(ge); that statement is proved later on this page (The loop filtration on the type-A finite W-algebra has associated graded U(g^e)), and the filtration used is the loop (good) filtration, not the Kazhdan filtration.

Facts & Assumptions

Given: The pyramid data of The type-A nilpotent pyramid, good grading and Whittaker character, the automorphism η of U(p), the ideal Iχ of U(m) generated by x−χ(x) and the left ideal U(g)Iχ of U(g).

[F1]

The grading g=⨁r∈Zgr is multiplicative, e∈g1, p=⨁r≥0gr, m=⨁r<0gr, and χ([m,m])=0 (The type-A nilpotent pyramid, good grading and Whittaker character).

[F2]

Enveloping algebras: U(g) is the quotient of the tensor algebra by the two-sided ideal generated by xy−yx−[x,y]; a Lie character on a Lie subalgebra extends to an algebra homomorphism of the enveloping algebra, and U(g) is generated by p∪m (Universal enveloping algebra, Representations of Lie algebras, Classical complex matrix Lie algebras).

[F3]

Quotients and ideals: multiplication in a quotient ring is well defined modulo a two-sided ideal, and left ideals are additive subgroups stable under left multiplication (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).

Proof

technique · direct

Given: The pyramid data, the automorphism η, the ideal Iχ and the left ideal U(g)Iχ.

1.1F1F2algebra

Write cj=n−qcol⁡(j)−⋯−ql. The scalar functional κ(eij)=δijcj kills [p,p]: a bracket can have a diagonal component only from eij,eji∈p, forcing equal columns and equal ci,cj. Thus x↦x+κ(x)1 preserves brackets and extends to η by the enveloping universal property; the negative scalar shift is its inverse.

2.1F2F3step 1.1algebra

Put J=U(g)Iχ. For v∈W and x∈m, (x−χ(x))η(v)=η(v)(x−χ(x))+[x,η(v)]∈J. Since these shifted generators generate J as a left ideal, Jη(v)⊆J. Hence for u,v∈W, [x,η(uv)]=[x,η(u)]η(v)+η(u)[x,η(v)]∈J, using this normalizer property for the first term and the left-ideal property for the second. Additivity, scalar closure and [x,1]=0 give a unital subalgebra.

3.1F2F3step 1.1step 2.1algebra

Left multiplication makes Qχ=U(g)/J a left module. Step 2.1 proves that aˉ⋅u=aη(u)‾ is well defined for u∈W. Since η(uv)=η(u)η(v), (aˉ⋅u)⋅v=aˉ⋅(uv), and left multiplication commutes with this right action. Thus Qχ is the stated bimodule, with right-action homomorphism into End⁡U(g)(Qχ)op.

4.1F1step 1.1step 3.1algebra∎

Wh(M) is a W(λ)-module. Let M∈C(λ) and v∈Wh(M). First, uv=χ(u)v for every u∈U(m): this holds for u∈m by definition and extends to products by induction, since if yv=χ(y)v then (xy)v=x(yv)=χ(y)xv=χ(x)χ(y)v. Hence Iχv=0, because Iχ=ker⁡(χ ⁣:U(m)→C) and every element of Iχ acts on v by its χ-value, which is zero. Consequently U(g)Iχ⋅v=0, since a general element of U(g)Iχ is a sum of products a i with a∈U(g), i∈Iχ, and (ai)v=a(iv)=0. Now take u∈W(λ), x∈m. Then x(η(u)v)=η(u)xv+[x,η(u)]v=χ(x)η(u)v+0, because [x,η(u)]∈U(g)Iχ by the definition of W(λ). Hence η(u)v∈Wh(M), and the map (u,v)↦η(u)v is bilinear and associative by the algebra structure of U(p) and step 1.1. Here the character χ and the parabolic data are those of [F1]. This verifies the module structure; the vanishing statement Wh(M)=0⇒M=0 is the cohomological detection theorem proved in Gan-Ginzburg and Skryabin inputs for the type-A pyramid good grading and Skryabin's equivalence for the type-A Whittaker pair, and is recorded here as part of the categorical interface.

Remarks

  • The dictionary η is the type-A ρ-shift of the source; it is the automorphism used (in the form ηc) on the deformed tensor space later on this page. The undoubled pyramid grading has e in degree 1; the doubled Gan-Ginzburg grading used for the Kazhdan filtration has e in degree 2 and vanishing degree −1 part.

  • The ideal Iχ is two-sided by construction: it is the kernel of an algebra homomorphism, and equivalently the two-sided ideal generated by the elements x−χ(x).

Depends on

Used by

Dependency tree · two levels

24 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