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.
Tilting objects and negligible morphisms in a root-of-unity category
Definition
Fix a finite-type symmetrizable Cartan datum (Symmetrizable Cartan data for quantum groups), a root parameter , and the Lusztig algebra De Concini–Kac, Lusztig, and small quantum-group forms at roots of unity. Put . A finite-dimensional -module is type 1 here if it is equipped with a -grading such that and for every , , and , and , . The binomial is evaluated as its Laurent polynomial, including negative upper indices, rather than by dividing specialized factorials. The grading and the full toral-binomial characters are part of the type-1 structure, so coincident ordinary torus eigenvalues at a root do not identify different labels.
The root-representation input for the following definitions is a full -linear additive braided rigid monoidal subcategory of the category of finite-dimensional left -modules (Unital left and right modules over a ring; unqualified module means left module), together with a pivotal structure and the braiding (k-linear categories and k-linear functors, Additive category, Monoidal category, Rigid object and rigid monoidal category, Braided monoidal category, Pivotal structure), and two specified finite-dimensional module families and whose members are objects of . In the intended quantum-group application these are intended to be the Weyl and dual Weyl families. Their construction, the tensor action on modules, and the compatible braiding and rigidity with the required root-order hypotheses are separate proof obligations; this definition treats them as supplied data.
A -filtration of is a finite chain of submodules in the ambient module category, , whose successive quotients are isomorphic to specified modules . A -filtration is defined in the same way using the specified family. A tilting object is an object with both filtrations; write for the full subcategory of such objects.
For , a morphism is negligible if where is the categorical trace The categorical trace of a morphism into the double dual. This defines a subspace . Linearity of composition and of the categorical trace makes this an intersection of kernels, hence a vector subspace. The vector spaces are candidate quotient morphism spaces. This definition does not assert that the form a composition or tensor ideal, or that the resulting quotient inherits the braiding, is semisimple, ribbon, or modular.
Depends on
- Additive category
- Braided monoidal category
- k-linear categories and k-linear functors
- Monoidal category
- Pivotal structure
- Rigid object and rigid monoidal category
- De Concini–Kac, Lusztig, and small quantum-group forms at roots of unity
- Unital left and right modules over a ring; unqualified module means left module
- Symmetrizable Cartan data for quantum groups
- The categorical trace of a morphism into the double dual
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
34 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, Shlomo Gelaki, Dmitri Nikshych, and Victor Ostrik, Tensor Categories (standard reference, not scraped)
- Henning Haahr Andersen and Catharina Stroppel, Fusion Rings for Quantum Groups (standard reference, not scraped)