Strongly nil *-clean rings
Keywords:
Rings with involution, Strongly nil ∗-clean ring, ∗-Boolean ring, Boolean ringAbstract
A $*$-ring $R$ is called {\em strongly nil $*$-clean} if every element of $R$ is the sum of a projection and a nilpotent element that commute with each other. In this paper we investigate some properties of strongly nil $*$-rings and prove that $R$ is a strongly nil $*$-clean ring if and only if every idempotent in $R$ is a projection, $R$ is periodic, and $R/J(R)$ is Boolean. We also prove that a $*$-ring $R$ is commutative, strongly nil $*$-clean and every primary ideal is maximal if and only if every element of $R$ is a projection.
Downloads
References
A. Badawi, On abelian $\pi$–regular rings, Comm. Algebra 25(4) (1997) 1009–1021.
S. K. Berberian, Baer *–Rings, Die Grundlehren der mathematischen Wissenschaften, Band 195, Springer–Verlag, Berlin, Heidelberg, New York, 1972.
M. Chacron, On a theorem of Herstein, Canad. J. Math. 21 (1969) 1348–1353.
H. Chen, On strongly $J$–clean rings, Comm. Algebra 38(10) (2010) 3790–3804.
H. Chen, Rings Related to Stable Range Conditions, Series in Algebra, vol. 11, World Scientific Publishing, Hackensack, NJ, 2011.
H. Chen, A. Harmancı, and A. Ç. Özcan, Strongly $J$–clean rings with involutions, in: Ring Theory and Its Applications, Contemporary Mathematics, vol. 609, American Mathematical Society, Providence, RI, 2014, pp. 41–56.
A. J. Diesl, Nil–clean rings, J. Algebra 383(1) (2013) 197–211.
A. L. Foster, The theory of Boolean–like rings, Trans. Amer. Math. Soc. 59(1) (1946) 166–187.
Y. Hirano, H. Tominaga, and A. Yaqub, On rings in which every element is uniquely expressible as a sum of two idempotents, Bull. Austral. Math. Soc. 38(2) (1988) 255–259.
C. Li and Y. Zhou, On strongly *–clean rings, J. Algebra Appl. 10(6) (2011) 1363–1370.
V. Swaminathan, Submaximal ideals in a Boolean–like ring, Math. Sem. Notes Kobe Univ. 9(1) (1981) 195–204.
L. Vaš, *–Clean rings; some clean and almost clean Baer *–rings and von Neumann algebras, J. Algebra 324(12) (2010) 3388–3400.
