Search arXivSearch

arXiv · 1709.05728

On Lie nilpotent associative algebras

Abstract

Let $G$ be a group generated by a set $X$. It is well known and easy to check that \[ [g_1, g_2, \dots ,g_n] = 1 \mbox{ for all } g_i \in G \qquad \iff \qquad [x_1, x_2, \dots , x_n] =1 \mbox{ for all } x_i \in X. \] Let $L$ be a Lie algebra generated by a set $X$. Then it is also well known and easy to check that \[ [h_1, h_2, \dots , h_n] = 0 \mbox{ for all } h_i \in L \qquad \iff \qquad [x_1, x_2, \dots ,x_n] = 0 \mbox{ for all } x_i \in X. \] Now let $A$ be a unital associative algebra generated by a set $X$. Then the assertion similar to the above does not hold: for $n > 2$, it is easy to find an algebra $A$ with a generating set $X$ such that $[x_1, x_2, \dots ,x_n] = 0$ for all $x_i \in X$ but $[a_1, a_2, \dots ,a_n] \ne 0$ for some $a_i \in A$. However, we prove the following result. Let $R$ be a unital associative and commutative ring such that $\frac{1}{3} \in R$. Let $A$ be a unital associative $R$-algebra generated by a set $X$. Let $X^2 = \{ x_1 x_2 \mid x_i \in X \}$ be the set of all products of $2$ elements of $X$. Then \[ [a_1, a_2, \dots ,a_n] = 0 \mbox{ for all } a_i \in A \qquad \iff \qquad [y_1, y_2, \dots , y_n] =0 \mbox{ for all } y_i \in X \cup X^2. \] Moreover, one can assume that in the commutator $[y_1, y_2, \dots , y_n]$ above $y_1, y_n \in X$.

Explore related subjects

Keep this discovery

BibTeXRIS

Claud W. G. Dias Jr, Alexei Krasilnikov. 2017-09-17. On Lie nilpotent associative algebras. https://arxiv.org/abs/1709.05728

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