Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Dunkl operators realize the polynomial standard module

Statement

For t=1, the polynomial representation of The polynomial representation of a rational Cherednik algebra has the differential-reflection action xf=xf,(wf)(z)=f(w−1z),yf=∂yf−∑s∈Scsαs(y)αs(1−s)f. Each displayed operator maps C[h∗] to itself and these operators satisfy the presentation of The rational Cherednik algebra H_{t,c}(W,h).

Facts & Assumptions

Given: The reflection representation (W,h), its reflection data and parameters, the algebra H1,c(W,h), and the polynomial module Pc(W,h).

[F1]

The rational Cherednik algebra H_{t,c}(W,h): [y,x]=x(y)1−∑scsαs(y)αs∨(x)s, the x's commute, the y's commute, and W acts by its given linear action.

[F2]

The rational Cherednik commutator satisfies Jacobi compatibility: the commutator parameter κ is W-equivariant and satisfies cyclic Jacobi compatibility.

[F3]

The PBW theorem for rational Cherednik algebras: H1,c has vector-space basis C[h∗]⊗CW⊗C[h]; the induced module Pc has polynomial basis generated by 1.

[F4]

Reflection data and parameters for a rational Cherednik algebra: each reflection fixes the hyperplane ker⁡αs, and x−sx=αs∨(x)αs for x∈h∗.

[F5]

The polynomial representation of a rational Cherednik algebra: Pc(W,h) is Δc(1), with x acting by multiplication and 1 killed by every y∈h.

Proof

technique · direct

Given: [F1]–[F5].

1.1F4constructalgebra

For f∈C[h∗] and s∈S, the polynomial f−sf vanishes on ker⁡αs, since s−1 fixes every point of that hyperplane. The ideal of this hyperplane is generated by αs, so (1−s)f/αs is a polynomial. Thus every displayed y-operator preserves C[h∗].

1.2F1F2F4algebra

Let Rs=αs−1(1−s) on the rational function field of h. For multiplication by x∈h∗, [Rs,x]=αs−1(x−sx)s=αs∨(x)s by [F4]. Using [∂y,x]=x(y) therefore gives [∂y−∑scsαs(y)Rs,x]=x(y)1−∑scsαs(y)αs∨(x)s, exactly [F1]. The x's commute, and conjugation by w sends the operator for y to that for wy because c and the reflection forms are equivariant.

2.1F1F2step 1.2algebra

Write Ty=∂y−∑scsαs(y)Rs. The commutator [Ty,Tz] is a differential-reflection operator on hreg, the complement of the reflection hyperplanes. By step 1.2 and Jacobi, ad⁡[Ty,Tz](x)=[Ty,κ(z,x)]−[Tz,κ(y,x)]=[Ty,κ(z,x)]+[Tz,κ(x,y)]=0, since κ(y,z)=0 for y,z∈h and [F2] applies. The commutator with a group element uses the same formula as in [F1], by the W-covariance just checked.

3.1step 2.1algebra

In the crossed differential-operator algebra D(hreg)⋊W=⨁w∈WD(hreg)w, the centralizer of all multiplication operators by x∈h∗ consists of multiplication by rational functions. Indeed, for a nonidentity w, choose x with wx≠x; the top differential-order term of [Dw,x] is the top term of D multiplied by wx−x, so commutation forces D=0. For w=1, a differential operator commuting with every coordinate function has order zero, since the commutator of a positive-order operator with a coordinate has nonzero top symbol in some coordinate direction. Thus [T_y,T_z], which commutes with all x by step 2.1, is multiplication by a rational function. Every Ty kills 1, so [Ty,Tz]1=0, and that multiplication function is zero. Hence the Ty commute.

4.1F1step 1.2step 3.1construct

The assignments x↦mx, w↦w, and y↦Ty now satisfy every relation in [F1]: the x's commute, the y's commute by step 3.1, the mixed commutator is step 1.2, and the W-action relation is the covariance in step 1.2. The quotient universal property therefore gives an H1,c-module structure on C[h∗].

5.1F3F5step 4.1construct∎

The constant polynomial is killed by every Ty, and W fixes it, so induction gives an H1,c-module map Pc=Δc(1)→C[h∗] sending 1⊗1 to 1. It is surjective because multiplication by h∗ generates all polynomials. By PBW [F3], both spaces have the same monomial basis and this map is the identity on that basis, hence is an isomorphism. This is the asserted polynomial representation and action.

Depends on

Used by

Dependency tree · two levels

7 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