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.
Braiding on the module category and triangular structures
Definition
Let be a Hopf algebra over a field and let denote the category of all left -modules and all -linear maps, with tensor action and associators as in The module category of a bialgebra and its tensor action and Bialgebra module tensor actions and their coherence. A braiding on this category is a family of -linear isomorphisms for all left -modules , natural in both variables, for which the following equalities hold after inserting the canonical associators of the module category: A quasitriangular structure is triangular if . A braiding is symmetric if for every . No finite-dimensional restriction is imposed on or on the modules in .
Remarks
For , the candidate braiding associated with is . Its well-definedness, module-linearity, naturality, hexagons, and the converse reconstruction from regular modules are supplied by A quasitriangular structure gives and is recovered from a module braiding ↗.
Depends on
Used by
- The trivial universal R-matrix for the group algebra of a two-element group Example
- A quasitriangular structure gives and is recovered from a module braiding Theorem
- Finite double and its canonical quasitriangular structure Theorem
- Modules over the finite double are left-left Yetter–Drinfeld modules Theorem
Dependency tree · two levels
13 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
- Kalle Kytölä, Introduction to Hopf Algebras and Representations (Helsinki lecture notes, Spring 2011) (standard reference, not scraped)
- Pavel Etingof and Mykola Semenyakin, A Brief Introduction to Quantum Groups, arXiv:2106.05252v3 (2024) (standard reference, not scraped)