SearcharxivSearch

arXiv · 1610.03136

Products of several commutators in a Lie nilpotent associative algebra

Abstract

Let $F$ be a field of characteristic $\ne 2,3$ and let $A$ be a unital associative $F$-algebra. Define a left-normed commutator $[a_1, a_2, \dots , a_n]$ $(a_i \in A)$ recursively by $[a_1, a_2] = a_1 a_2 - a_2 a_1$, $[a_1, \dots , a_{n-1}, a_n] = [[a_1, \dots , a_{n-1}], a_n]$ $(n \ge 3)$. For $n \ge 2$, let $T^{(n)} (A)$ be the two-sided ideal in $A$ generated by all commutators $[a_1, a_2, \dots , a_n]$ ($a_i \in A )$. Define $T^{(1)} (A) = A$. Let $k, \ell$ be integers such that $k > 0$, $0 \le \ell \le k$. Let $m_1, \dots , m_k$ be positive integers such that $\ell$ of them are odd and $k - \ell $ of them are even. Let $N_{k \ell} = \sum_{i=1}^k m_i -2k + \ell + 2 $. The aim of the present note is to show that, for any positive integers $m_1, \dots , m_k$, in general, \[ T^{(m_1)} (A) \dots T^{(m_k)} (A) \nsubseteq T^{(N_{k \ell} +1)} (A). \] It is known that if $\ell < k$ (that is, if at least one of $m_i$ is even) then, for each $A$, \begin{equation*} \label{evenabstr} T^{(m_1)} (A) \dots T^{(m_k)} (A) \subseteq T^{(N_{k \ell} )} (A) \end{equation*} so our result cannot be improved if $\ell <k$. Let $N_k = \sum_{i=1}^k m_i -k+1$. Recently Dangovski has proved that if $m_1, \dots , m_k$ are any positive integers then, in general, \[ T^{(m_1)} (A) \dots T^{(m_k)} (A) \nsubseteq T^{(N_k+1)} (A) . \] Since $ N_{k \ell} = N_k - (k - \ell -1)$, Dangovski's result is stronger than ours if $\ell = k$ and is weaker than ours if $\ell \le k-2$; if $\ell = k-1$ then $N_k = N_{k (k-1)}$ so both results coincide. It is known that if $\ell = k$ (that is, if all $m_i$ are odd) then, for each $A$, \begin{equation*} \label{alloddabstr} T^{(m_1)} (A) \dots T^{(m_k)} (A) \subseteq T^{(N_k)} (A) \end{equation*} so in this case Dangovski's result cannot be improved.

Explore related subjects

Keep this discovery

BibTeXRIS

Galina Deryabina, Alexei Krasilnikov. 2017-09-15. Products of several commutators in a Lie nilpotent associative algebra. https://doi.org/10.1142/s0218196717500473

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