The graph of a Weyl algebra endomorphism

TY - UNPB

T1 - The graph of a Weyl algebra endomorphism

AU - Lauritzen, Niels

AU - Thomsen, Jesper Funch

PY - 2019/4/5

Y1 - 2019/4/5

N2 - Endomorphisms of Weyl algebras are studied using bimodules. Initially, for a Weyl algebra over a field of characteristic zero, Bernstein's inequality implies that holonomic bimodules finitely generated from the right or left form a monoidal category. The most important bimodule in this paper is the graph of an endomorphism. We prove that the graph of an endomorphism of a Weyl algebra over a field of characteristic zero is a simple bimodule. The simplicity of the tensor product of the dual graph and the graph is equivalent to the Dixmier conjecture. It is also shown how the graph construction leads to a non-commutative Groebner basis algorithm for detecting invertibility of an endomorphism for Weyl algebras and computing the inverse over arbitrary fields.

AB - Endomorphisms of Weyl algebras are studied using bimodules. Initially, for a Weyl algebra over a field of characteristic zero, Bernstein's inequality implies that holonomic bimodules finitely generated from the right or left form a monoidal category. The most important bimodule in this paper is the graph of an endomorphism. We prove that the graph of an endomorphism of a Weyl algebra over a field of characteristic zero is a simple bimodule. The simplicity of the tensor product of the dual graph and the graph is equivalent to the Dixmier conjecture. It is also shown how the graph construction leads to a non-commutative Groebner basis algorithm for detecting invertibility of an endomorphism for Weyl algebras and computing the inverse over arbitrary fields.

M3 - Working paper

BT - The graph of a Weyl algebra endomorphism

ER -