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.
Category O for a rational Cherednik algebra
Definition
Fix as in The rational Cherednik algebra H_{t,c}(W,h) and consider . By The PBW theorem for rational Cherednik algebras, the subalgebra generated by is the polynomial algebra , and the subalgebra generated by is .
The category O, denoted , is the full subcategory of left -modules satisfying:
- is finitely generated as an -module.
- The augmentation ideal acts locally nilpotently: for every , there is such that every homogeneous polynomial in of degree at least kills .
Since is generated by a finite basis of and its elements commute, the second condition is equivalent to each acting locally nilpotently. Morphisms in are the -module homomorphisms.
Remarks
The category depends on and uses . No semisimplicity of , -module decompositions beyond finite-dimensional -representations, or regularity of KZ monodromy is built into this definition.
Depends on
Used by
- Category O is not semisimple at the rank-one parameter c=1/2 Counterexample
- Standard modules for rational Cherednik category O Definition
- The KZ monodromy functor and the reflection Hecke algebra Definition
- Dunkl localization gives flat connections on the regular locus Lemma
- Every rational Cherednik category-O object has finite length Lemma
- Nilpotent induced Cherednik connections have uniform moderate growth on generic lines Lemma
- Standard modules lie in rational Cherednik category O Theorem
Dependency tree · two levels
4 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)