Alphabeta Math
TheoremStatement: 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.

Standard modules lie in rational Cherednik category O

Statement

For every finite-dimensional W-module E, the standard module Δc(E) of Standard modules for rational Cherednik category O belongs to category O of Category O for a rational Cherednik algebra.

Facts & Assumptions

Given: W,h,c, the algebra H1,c(W,h), and a finite-dimensional W-module E.

[F1]

Category O for a rational Cherednik algebra: membership in Oc(W,h) means finite generation over C[h∗] and local nilpotence of the augmentation ideal of S(h).

[F2]

Standard modules for rational Cherednik category O: Δc(E)=H1,c⊗C[h]⋊CWE, with h acting by zero on E; PBW identifies it with C[h∗]⊗E.

[F3]

The rational Cherednik algebra H_{t,c}(W,h): [h,h∗] lies in CW, and W preserves polynomial degree on C[h∗].

Proof

technique · direct

Given: [F1]–[F3].

1.1F1F2choose

Since E is finite dimensional, a finite basis of E generates C[h∗]⊗E as a C[h∗]-module. By [F2] this is Δc(E), so the finite-generation condition in [F1] holds.

1.2F2F3induction

Give C[h∗]⊗E its polynomial-degree filtration. For y∈h, commute y past one factor x∈h∗ by yx=xy+[y,x]. The first term preserves the number of polynomial factors after applying y to the remaining factors; the commutator term replaces that x by an element of CW, which preserves degree and acts on the remaining polynomial. Since y kills E, induction on polynomial degree shows that y maps degree at most d into degree at most d−1.

2.1F1step 1.1step 1.2algebra∎

A product of N elements of h therefore maps every polynomial of degree at most d to zero when N>d. Each element of Δc(E) is a finite sum of such polynomial-degree vectors, so a sufficiently high-degree element of the augmentation ideal S(h)>0 kills it. This is the local-nilpotence condition in [F1]. Both conditions hold, hence Δc(E)∈Oc(W,h).

Depends on

Used by

Dependency tree · two levels

6 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