Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1103.3865

*-Clean Rings; Some Clean and Almost Clean Baer *-rings and von Neumann Algebras

Lia Vas
View original source ↗Read source document ↗Export metadata ↓

Abstract

A ring is clean (resp. almost clean) if each of its elements is the sum of a unit (resp. regular element) and an idempotent. In this paper we define the analogous notion for *-rings: a *-ring is *-clean (resp. almost *-clean) if its every element is the sum of a unit (resp. regular element) and a projection. Although *-clean is a stronger notion than clean, for some *-rings we demonstrate that it is more natural to use. The theorem on cleanness of unit-regular rings from [V. P. Camillo, D. Khurana, A Characterization of Unit Regular Rings, Communications in Algebra, 29 (5) (2001) 2293-2295] is modified for *-cleanness of *-regular rings that are abelian (or reduced or Armendariz). Using this result, it is shown that all finite, type I Baer *-rings that satisfy certain axioms (considered in [S. K. Berberian, Baer *-rings, Die Grundlehren der mathematischen Wissenschaften 195, Springer-Verlag, Berlin-Heidelberg-New York, 1972] and [L. Vas, Dimension and Torsion Theories for a Class of Baer *-Rings, Journal of Algebra, 289 (2) (2005) 614-639]) are almost *-clean. In particular, we obtain that all finite type I AW*-algebras (thus all finite type I von Neumann algebras as well) are almost *-clean. We also prove that for a Baer *-ring satisfying the same axioms, the following properties are equivalent: regular, unit-regular, left (right) morphic and left (right) quasi-morphic. If such a ring is finite and type I, it is *-clean. Finally, we present some examples related to group von Neumann algebras and list some open problems.

Explore related subjects

math.RA

Keep this discovery

BibTeXRIS

Lia Vas. 2011-03-20. *-Clean Rings; Some Clean and Almost Clean Baer *-rings and von Neumann Algebras. https://arxiv.org/abs/1103.3865

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗