SearcharxivSearch

arXiv · 2512.05755

Complete and cocomplete Lie algebras with injective- and projective-type properties

Abstract

In the category of modules, injective and projective objects are characterized by the splitting of short exact sequences. Motivated by this principle, we investigate analogous phenomena in the category of finite-dimensional Lie algebras over a field of characteristic zero. Since this category is not abelian, extensions admit two distinct notions of splitting, which we call \emph{trivial} and \emph{semi-trivial}. The first main result establishes the converse of Jacobson's classical theorem: a Lie algebra $\A$ trivially splits every extension by it if and only if $\A$ is complete. This identifies completeness as the ``injective-type'' property in this category -- although, seemingly weaker than category-specific injectivity. By contrast, no nontrivial Lie algebra has the dual property: the second main result asserts that, for every nontrivial Lie algebra $\Cc$, some extension of $\Cc$ fails to split trivially, so no ``projective-type'' analogue exists. Restricting to central extensions restores a workable dual notion: a Lie algebra $\Cc$ is called cocomplete if every central extension of it splits trivially, and we prove that this holds if and only if $H^2(\Cc, \K) = 0$; in particular, semisimple Lie algebras are both complete and cocomplete. Each of these results admits an equivalent homomorphism-lifting reformulation, paralleling the lifting properties of injective and projective modules. For almost abelian Lie algebras, cocompleteness reduces to an explicit spectral condition on the defining derivation. These characterizations underlie three corresponding algorithms, which yield tabulations of the complete, the cocomplete, and the almost abelian cocomplete Lie algebras of dimension at most 4.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vu A. Le, Hoa Q. Duong, Tuan A. Nguyen. 2025-12-05. Complete and cocomplete Lie algebras with injective- and projective-type properties. https://arxiv.org/abs/2512.05755

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