SearcharxivSearch

arXiv · 1701.06124

The Radical of the Kernel of a Certain Differential Operator and Applications to Locally Algebraic Derivations

Abstract

Let $R$ be a commutative ring, $\mathcal A$ an $R$-algebra (not necessarily commutative) and $V$ an $R$-subspace or $R$-submodule of $\mathcal A$. By the radical of $V$ we mean the set of all elements $a\in \mathcal A$ such that $a^m\in V$ for all $m\gg 0$. We derive (and show) some necessary conditions satisfied by the elements in the radicals of the kernel of some (partial) differential operators, such as all differential operators of commutative algebras; the differential operators $P(D)$ of (noncommutative) $\mathcal A$ with certain conditions, where $P(\cdot)$ is a polynomial in $n$ commutative free variables and $D=(D_1, D_2, \dots, D_n)$ are either commuting locally finite $R$-derivations or commuting $R$-derivations of $\mathcal A$ such that for each $1\le i\le n$, $\mathcal A$ can be decomposed as a direct sum of the generalized eigen-subspaces of $D_i$; etc. In particular, we show that the kernel of certain differential operators of $\mathcal A$ is a Mathieu subspace (see \cite{GIC, MS}) of $\mathcal A$. We then apply some results above to study $R$-derivations of $\mathcal A$, which are locally algebraic or locally integral over $R$. In particular, we show that if $R$ is an integral domain of characteristic zero and $\mathcal A$ is reduced and torsion-free as an $R$-module, then $\mathcal A$ has no nonzero locally algebraic $R$-derivations. We also show a formula for the determinant of a differential vandemonde matrix over a commutative algebra $\mathcal A$. This formula not only provides some information for the elements in the radical of the kernel of all ordinary differential operators of $\mathcal A$, but also is interesting on its own right.

Explore related subjects

Keep this discovery

BibTeXRIS

Wenhua Zhao. 2017-01-22. The Radical of the Kernel of a Certain Differential Operator and Applications to Locally Algebraic Derivations. https://arxiv.org/abs/1701.06124

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