SearcharxivSearch

arXiv · 2411.11092

An extension of Petek-\v{S}emrl preserver theorems for Jordan embeddings of structural matrix algebras

Abstract

Let $M_n$ be the algebra of $n \times n$ complex matrices and $\mathcal{T}_n \subseteq M_n$ the corresponding upper-triangular subalgebra. In their influential work, Petek and \v{S}emrl characterize Jordan automorphisms of $M_n$ and $\mathcal{T}_n$, when $n \geq 3$, as (injective in the case of $\mathcal{T}_n$) continuous commutativity and spectrum preserving maps $\phi : M_n \to M_n$ and $\phi : \mathcal{T}_n \to \mathcal{T}_n$. Recently, in a joint work with Petek, the authors extended this characterization to the maps $\phi : \mathcal{A} \to M_n$, where $\mathcal{A}$ is an arbitrary subalgebra of $M_n$ that contains $\mathcal{T}_n$. In particular, any such map $\phi$ is a Jordan embedding and hence of the form $\phi(X)=TXT^{-1}$ or $\phi(X)=TX^tT^{-1}$, for some invertible matrix $T\in M_n$. In this paper we further extend the aforementioned results in the context of structural matrix algebras (SMAs), i.e. subalgebras $\mathcal{A}$ of $M_n$ that contain all diagonal matrices. More precisely, we provide both a necessary and sufficient condition for an SMA $\mathcal{A}\subseteq M_n$ such that any injective continuous commutativity and spectrum preserving map $\phi: \mathcal{A} \to M_n$ is necessarily a Jordan embedding. In contrast to the previous cases, such maps $\phi$ no longer need to be multiplicative/antimultiplicative, nor rank-one preservers.

Explore related subjects

Keep this discovery

BibTeXRIS

Ilja Gogić, Mateo Tomašević. 2024-11-17. An extension of Petek-\v{S}emrl preserver theorems for Jordan embeddings of structural matrix algebras. https://doi.org/10.1016/j.jmaa.2025.129497

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