SearcharxivSearch

arXiv · 2101.11518

Classification problem of simple Hom-Lie algebras

Abstract

First, we construct some families of nonsolvable anticommutative algebras, solvable Lie algebras and even nilpotent Lie algebras, that can be endowed with the structure of a simple Hom-Lie algebra. This situation shows that a classification of simple Hom-Lie algebras would be unrealistic without any further restrictions. We introduce the class of \emph{strongly simple Hom-Lie algebras}, as the class of anticommutative algebras that are simple Hom-Lie with respect to all their twisting maps. We show some of its properties, provide a characterization and explore some of its subclasses. Furthermore, we provide a complete classification of regular simple Hom-Lie algebras over any arbitrary field, together with a description of a lower bound of the number of their isomorphism classes, which depends entirely on the finiteness or not of the underlying field. In addition, we establish that every simple anticommutative algebra of dimension $3$ turns out to be the outside Yau's twist of the special orthogonal Lie algebra $\mathfrak{so}(3,\mathbb{F})$ with respect to some bijective linear map. Also, we determine all the simple Hom-Lie algebras of dimension $2$, up to conjugacy, which were wrongly claimed to be nonexistent in previous literature. Finally, we establish a new \emph{simplicity criterion} for Lie algebras, which as an application shows that the simplicity in the category of multiplicative Hom-Lie algebras is equivalent to that of anticommutative algebras.

Explore related subjects

Keep this discovery

BibTeXRIS

Youness El Kharraf. 2021-01-27. Classification problem of simple Hom-Lie algebras. https://arxiv.org/abs/2101.11518

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