Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0504475

Generators and defining relations for the ring of differential operators on a smooth affine algebraic variety

V. V. Bavula
View original source ↗Read source document ↗Export metadata ↓

Abstract

For the ring of differential operators on a smooth affine algebraic variety $X$ over a field of characteristic zero a finite set of algebra generators and a finite set of defining relations are found explicitly. As a consequence, a finite set of generators and a finite set of defining relations are given for the module $\Der_K(\OO (X))$ of derivations on the algebra $\OO (X)$ of regular functions on the variety $X$. For the variety $X$ which is not necessarily smooth, a set of natural derivations ${\rm der}_K(\OO (X))$ of the algebra $\OO (X)$ and a ring $\gD (\OO (X))$ of natural differential operators on $\OO (X)$ are introduced. The algebra $\gD (\OO (X))$ is a Noetherian algebra of Gelfand-Kirillov dimension $2\dim (X)$. When $X$ is smooth then ${\rm der}_K(\OO (X))=\Der_K(\OO (X))$ and $\gD (\OO (X))=\CD (\OO (X))$. A criterion of smoothness of $X$ is given when $X$ is irreducible ($X$ is smooth iff $\gD (\OO (X))$ is a simple algebra iff $\OO (X)$ is a simple $\gD (\OO (X))$-module). The same results are true for regular algebras of essentially finite type. For a singular irreducible affine algebraic variety $X$, in general, the algebra of differential operators $\CD (\OO (X))$ needs not be finitely generated nor (left or right) Noetherian, it is proved that each term $\CD (\OO (X))_i$ of the order filtration $\CD (\OO (X))=\cup_{i\geq 0}\CD (\OO (X))_i$ is a finitely generated left $\OO (X)$-module.

Explore related subjects

math.RA

Keep this discovery

BibTeXRIS

V. V. Bavula. 2005-04-22. Generators and defining relations for the ring of differential operators on a smooth affine algebraic variety. https://arxiv.org/abs/math/0504475

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗