SearcharxivSearch

arXiv · 1802.08892

Decompositions of linear spaces induced by $n$-linear maps

Abstract

Let $\mathbb V$ be an arbitrary linear space and $f:\mathbb V \times \ldots \times \mathbb V \to \mathbb V$ an $n$-linear map. It is proved that, for each choice of a basis ${\mathcal B}$ of $\mathbb V$, the $n$-linear map $f$ induces a (nontrivial) decomposition $\mathbb V= \oplus V_j$ as a direct sum of linear subspaces of $\mathbb V$, with respect to ${\mathcal B}$. It is shown that this decomposition is $f$-orthogonal in the sense that $f(\mathbb V, \ldots, V_j, \ldots, V_k, \ldots, \mathbb V) =0$ when $j \neq k$, and in such a way that any $V_j$ is strongly $f$-invariant, meaning that $f(\mathbb V, \ldots, V_j, \ldots, \mathbb V) \subset V_j.$ A sufficient condition for two different decompositions of $\mathbb V$ induced by an $n$-linear map $f$, with respect to two different bases of $\mathbb V$, being isomorphic is deduced. The $f$-simplicity -- an analogue of the usual simplicity in the framework of $n$-liner maps -- of any linear subspace $V_j$ of a certain decomposition induced by $f$ is characterized. Finally, an application to the structure theory of arbitrary $n$-ary algebras is provided. This work is a close generalization the results obtained by A. J. Calder\'on (2018).

Explore related subjects

Keep this discovery

BibTeXRIS

Antonio Jesús Calderón, Ivan Kaygorodov, Paulo Saraiva. 2018-02-24. Decompositions of linear spaces induced by $n$-linear maps. https://doi.org/10.1080/03081087.2018.1450829

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