Search arXivSearch

arXiv · 1502.05184

Infinite-dimensional diagonalization and semisimplicity

Abstract

We characterize the diagonalizable subalgebras of End(V), the full ring of linear operators on a vector space V over a field, in a manner that directly generalizes the classical theory of diagonalizable algebras of operators on a finite-dimensional vector space. Our characterizations are formulated in terms of a natural topology (the "finite topology") on End(V), which reduces to the discrete topology in the case where V is finite-dimensional. We further investigate when two subalgebras of operators can and cannot be simultaneously diagonalized, as well as the closure of the set of diagonalizable operators within End(V). Motivated by the classical link between diagonalizability and semisimplicity, we also give an infinite-dimensional generalization of the Wedderburn-Artin theorem, providing a number of equivalent characterizations of left pseudocompact, Jacoboson semisimple rings that parallel various characterizations of artinian semisimple rings. This theorem unifies a number of related results in the literature, including the structure of linearly compact, Jacobson semsimple rings and cosemisimple coalgebras over a field.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Miodrag C. Iovanov, Zachary Mesyan, Manuel L. Reyes. 2016-10-21. Infinite-dimensional diagonalization and semisimplicity. https://doi.org/10.1007/s11856-016-1395-5

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA