SearcharxivSearch

arXiv · 1603.05647

Virtually Semisimple Modules and a Generalization of the Wedderburn-Artin Theorem

Abstract

By any measure, semisimple modules form one of the most important classes of modules and play a distinguished role in the module theory and its applications. One of the most fundamental results in this area is the Wedderburn-Artin theorem. In this paper, we establish natural generalizations of semisimple modules and give a generalization of the Wedderburn-Artin theorem. We study modules in which every submodule is isomorphic to a direct summand and name them {\it virtually semisimple modules}. A module $_RM$ is called {\it completely virtually semisimple} if each submodules of $M$ is a virtually semisimple module. A ring $R$ is then called {\it left} ({\it completely}) {\it virtually semisimple} if $_RR$ is a left (compleatly) virtually semisimple $R$-module. Among other things, we give several characterizations of left (completely) virtually semisimple rings. For instance, it is shown that a ring $R$ is left completely virtually semisimple if and only if $R \cong \prod _{i=1}^ k M_{n_i}(D_i)$ where $k, n_1, ...,n_k\in \Bbb{N}$ and each $D_i$ is a principal left ideal domain. Moreover, the integers $k,~ n_1, ...,n_k$ and the principal left ideal domains $D_1, ...,D_k$ are uniquely determined (up to isomorphism) by $R$.

Explore related subjects

Keep this discovery

BibTeXRIS

Mahmood Behboodi, Asghar Daneshvar, Mohammad Reza Vedadi. 2016-03-17. Virtually Semisimple Modules and a Generalization of the Wedderburn-Artin Theorem. https://arxiv.org/abs/1603.05647

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