SearcharxivSearch

arXiv · 1106.3821

On the Spectra of Quantum Groups

Abstract

Joseph and Hodges-Levasseur (in the A case) described the spectra of all quantum function algebras R_q[G] on simple algebraic groups in terms of the centers of certain localizations of quotients of R_q[G] by torus invariant prime ideals, or equivalently in terms of orbits of finite groups. These centers were only known up to finite extensions. We determine the centers explicitly under the general conditions that the deformation parameter is not a root of unity and without any restriction on the characteristic of the ground field. From it we deduce a more explicit description of all prime ideals of R_q[G] than the previously known ones and an explicit parametrization of Spec R_q[G]. We combine the latter with a result of Kogan and Zelevinsky to obtain in the complex case a torus equivariant Dixmier type map from the symplectic foliation of the group G to the primitive spectrum of R_q[G]. Furthermore, under the general assumptions on the ground field and deformation parameter, we prove a theorem for separation of variables for the De Concini-Kac-Procesi algebras U^w_\pm, and classify the sets of their homogeneous normal elements and primitive elements. We apply those results to obtain explicit formulas for the prime and especially the primitive ideals of U^w_\pm lying in the Goodearl-Letzter stratum over the 0-ideal. This is in turn used to prove that all Joseph's localizations of quotients of R_q[G] by torus invariant prime ideals are free modules over their subalgebras generated by Joseph's normal elements. From it we derive a classification of the maximal spectrum of R_q[G] and use it to resolve a question of Goodearl and Zhang, showing that all maximal ideals of R_q[G] have finite codimension. We then prove that all maximal chains in Spec R_q[G] have the same length equal to GKdim R_q[G]= dim G, i.e. R_q[G] satisfies the first chain condition for prime ideals in Nagata's terminology.

Explore related subjects

Keep this discovery

BibTeXRIS

Milen Yakimov. 2014-01-03. On the Spectra of Quantum Groups. https://arxiv.org/abs/1106.3821

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA