Search arXivSearch

arXiv · 1804.08441

Fractal nil graded Lie, associative, Poisson, and Jordan superalgebras

Abstract

We construct a just infinite fractal 3-generated Lie superalgebra $\mathbf Q$ over arbitrary field, which gives rise to an associative hull $\mathbf A$, a Poisson superalgebra $\mathbf P$, and two Jordan superalgebras $\mathbf J$, $\mathbf K$. One has a natural filtration for $\mathbf A$ which associated graded algebra has a structure of a Poisson superalgebra and $\mathrm{gr} \mathbf A\cong\mathbf P$, also $\mathbf P$ admits an algebraic quantization. The Lie superalgebra $\mathbf Q$ is finely $\mathbb Z^3$-graded by multidegree in the generators, $\mathbf A$, $\mathbf P$ are $\mathbb Z^3$-graded, while $\mathbf J$, $\mathbf K$ are $\mathbb{Z}^4$-graded. These five superalgebras have clear monomial bases and slow polynomial growth. We describe multihomogeneous coordinates of bases of $\mathbf Q$, $\mathbf A$, $\mathbf P$ in space as bounded by "almost cubic paraboloids". A similar hypersurface in $\mathbb R^4$ bounds monomials of $\mathbf J$, $\mathbf K$. Constructions of the paper can be applied to Lie superalgebras studied before and get Poisson and Jordan superalgebras as well. The algebras ${\mathbf Q}$, ${\mathbf A}$, and the algebras without unit $\mathbf P^o$, $\mathbf J^o$, $\mathbf K^o$ are direct sums of two locally nilpotent subalgebras and there are continuum such decompositions. Also, $\mathbf Q=\mathbf Q_{\bar 0}\oplus \mathbf Q_{\bar 1}$ is a nil graded Lie superalgebra. In case $\mathrm{char}\, K=2$, $\mathbf Q$ has a structure of a restricted Lie algebra with a nil $p$-mapping. The Jordan superalgebra $\mathbf K$ is just infinite nil finely $\mathbb Z^4$-graded, while such examples (say, analogues of the Grigorchuk group) of Lie and Jordan algebras in characteristic zero do not exist. We call $\mathbf Q$, $\mathbf A$, $\mathbf P$, $\mathbf J$, $\mathbf K$ fractal because they contain infinitely many copies of themselves.

Explore related subjects

Keep this discovery

BibTeXRIS

Victor Petrogradsky, Ivan Shestakov. 2018-04-20. Fractal nil graded Lie, associative, Poisson, and Jordan superalgebras. https://arxiv.org/abs/1804.08441

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