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 -module , the standard module of Standard modules for rational Cherednik category O belongs to category O of Category O for a rational Cherednik algebra.
Facts & Assumptions
Given: , the algebra , and a finite-dimensional -module .
Category O for a rational Cherednik algebra: membership in means finite generation over and local nilpotence of the augmentation ideal of .
Standard modules for rational Cherednik category O: , with acting by zero on ; PBW identifies it with .
The rational Cherednik algebra H_{t,c}(W,h): lies in , and preserves polynomial degree on .
Proof
Given: [F1]–[F3].
Since is finite dimensional, a finite basis of generates as a -module. By [F2] this is , so the finite-generation condition in [F1] holds.
Give its polynomial-degree filtration. For , commute past one factor by . The first term preserves the number of polynomial factors after applying to the remaining factors; the commutator term replaces that by an element of , which preserves degree and acts on the remaining polynomial. Since kills , induction on polynomial degree shows that maps degree at most into degree at most .
A product of elements of therefore maps every polynomial of degree at most to zero when . Each element of is a finite sum of such polynomial-degree vectors, so a sufficiently high-degree element of the augmentation ideal kills it. This is the local-nilpotence condition in [F1]. Both conditions hold, hence .
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
- Pavel Etingof and Xiaoguang Ma, Lecture Notes on Cherednik Algebras (standard reference, not scraped)
- Victor Ginzburg, Nicolas Guay, Eric Opdam, and Raphael Rouquier, On the category O for rational Cherednik algebras (standard reference, not scraped)