Search arXivSearch

arXiv · 1512.01351

Classical invariant theory for free metabelian Lie algebras

Abstract

Let $KX_d$ be a vector space with basis $X_d=\{x_1,\ldots,x_d\}$ over a field $K$ of characteristic 0. One of the main topics of classical invariant theory is the study of the algebra of invariants $K[X_d]^{SL_2(K)}$, where $KX_d$ is a module of the special linear group $SL_2(K)$ isomorphic to a direct sum $V_{k_1}\oplus\cdots\oplus V_{k_r}$ and $V_k$ is the $SL_2(K)$-module of binary forms of degree $k$. Noncommutative invariant theory deals with the algebra of invariants $F_d({\mathfrak V})^G$ of the group $G<GL_d(K)$ acting on the relatively free algebra $F_d({\mathfrak V})$ of a variety of $K$-algebras $\mathfrak V$. In this paper we consider the free metabelian Lie algebra $F_d({\mathfrak A}^2)$ which is the relatively free algebra in the variety ${\mathfrak A}^2$ of metabelian (solvable of class 2) Lie algebras. We study the algebra $F_d({\mathfrak A}^2)^{SL_2(K)}$ of $SL_2(K)$-invariants of $F_d({\mathfrak A}^2)$. We describe the cases when this algebra is finitely generated. This happens if and only if $KX_d\cong V_1\oplus V_0\oplus\cdots\oplus V_0$ or $KX_d\cong V_2$ as an $SL_2(K)$-module (and in the trivial case $KX_d\cong V_0\oplus\cdots\oplus V_0$). For small $d$ we give a list of generators even when $F_d({\mathfrak A}^2)^{SL_2(K)}$ is not finitely generated. The methods for establishing that the algebra $F_d({\mathfrak A}^2)^{SL_2(K)}$ is not finitely generated work also for other relatively free algebras $F_d({\mathfrak V})$ and for other groups $G$.

Explore related subjects

Keep this discovery

BibTeXRIS

Vesselin Drensky, Sehmus Findik. 2015-12-04. Classical invariant theory for free metabelian Lie algebras. https://arxiv.org/abs/1512.01351

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