SearcharxivSearch

arXiv · 2409.16906

Jordan embeddings and linear rank preservers of structural matrix algebras

Abstract

We consider subalgebras $\mathcal{A}$ of the algebra $M_n$ of $n \times n$ complex matrices that contain all diagonal matrices, known in the literature as the structural matrix algebras (SMAs). Let $\mathcal{A} \subseteq M_n$ be an arbitrary SMA. We first show that any commuting family of diagonalizable matrices in $\mathcal{A}$ can be intrinsically simultaneously diagonalized (i.e. the corresponding similarity can be chosen from $\mathcal{A}$). Using this, we then characterize when one SMA Jordan-embeds into another and in that case we describe the form of such Jordan embeddings. As a consequence, we obtain a description of Jordan automorphisms of SMAs, generalizing Coelho's result on their algebra automorphisms. Next, motivated by the results of Marcus-Moyls and Molnar-\v{S}emrl, connecting the linear rank-one preservers with Jordan embeddings $M_n \to M_n$ and $\mathcal{T}_n \to M_n$ (where $\mathcal{T}_n$ is the algebra of $n \times n$ upper-triangular matrices) respectively, we show that any linear unital rank-one preserver $\mathcal{A} \to M_n$ is necessarily a Jordan embedding. As the converse fails in general, we also provide a necessary and sufficient condition for when it does hold true. Finally, we obtain a complete description of linear rank preservers $\mathcal{A} \to M_n$, as maps of the form $X\mapsto S\left(PX + (I-P)X^t\right)T$, for some invertible matrices $S,T \in M_n$ and a central idempotent $P\in\mathcal{A}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ilja Gogić, Mateo Tomašević. 2024-09-25. Jordan embeddings and linear rank preservers of structural matrix algebras. https://doi.org/10.1016/j.laa.2024.11.013

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