Poisson Trace Orders

Abstract

AbstractThe two main approaches to the study of irreducible representations of orders (via traces and Poisson orders) have so far been applied in a completely independent fashion. We define and study a natural compatibility relation between the two approaches leading to the notion of Poisson trace orders. It is proved that all regular and reduced traces are always compatible with any Poisson order structure. The modified discriminant ideals of all Poisson trace orders are proved to be Poisson ideals and the zero loci of discriminant ideals are shown to be unions of symplectic cores, under natural assumptions (maximal orders and Cayley–Hamilton algebras). A base change theorem for Poisson trace orders is proved. A broad range of Poisson trace orders are constructed based on the proved theorems: quantized universal enveloping algebras, quantum Schubert cell algebras and quantum function algebras at roots of unity, symplectic reflection algebras, 3D and 4D Sklyanin algebras, Drinfeld doubles of pre-Nichols algebras of diagonal type, and root of unity quantum cluster algebras.