Search arXivSearch

arXiv · math/0412358

Primitive ideals and automorphism group of $U_q^+(B_2)$

Abstract

Let g be a complex simple Lie algebra of type B_2 and q be a non-zero complex number which is not a root of unity. In the classical case, a theorem of Dixmier asserts that the simple factor algebras of the positive part U^+(g) of the enveloping algebra of g, whose Gelfand-Kirillov dimension is equal to 2, are isomorphic to the first Weyl algebra. In order to obtain some new quantized analogues of the first Weyl algebra, we explicitly describe the prime and primitive spectra of the positive part U_q^+(g) of the quantized enveloping algebra of g and then we study the simple factor algebras of U_q^+(g) whose Gelfand-Kirillov dimension is equal to 2. In particular, we show that the centers of such simple factor algebras are reduced to the ground field C and we compute their group of invertible elements. These computations suggest that we distinguish between two families of such simple factor algebras of U_q^+(g). The first family consists of those simple factor algebras whose group of units is non-trivial; algebras in this first family are the so-called Weyl-Hayashi algebras and turn out to be examples of generalized Weyl algebras over a Laurent polynomial ring in one indeterminate. In contrast, the second family consists of those simple factor algebras whose group of units is trivial; algebras in this second class can not be presented as generalized Weyl algebras over a (Laurent) polynomial ring in one indeterminate. Finally we use these results to describe the structure of the automorphism group of U_q^+(g). More precisely, we prove that this group is isomorphic to the torus (C^*)^2, as conjectured by Andruskiewitsch and Dumas. As a corollary, we obtain that the action of this group on the set of all (left) primitive ideals of U_q^+(g) has exactly 8 orbits that we describe explicitly.

Explore related subjects

Keep this discovery

BibTeXRIS

Stéphane Launois. 2006-01-19. Primitive ideals and automorphism group of $U_q^+(B_2)$. https://arxiv.org/abs/math/0412358

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