2000 character limit reached
The strong $P$-cleanness over rings (1306.0108v2)
Published 1 Jun 2013 in math.RA
Abstract: An element of a ring $R$ is strongly $P$-clean provided that it can be written as the sum of an idempotent and a strongly nilpotent element that commute. A ring $R$ is strongly $P$-clean in case each of its elements is strongly $P$-clean. We investigate, in this article, the necessary and sufficient conditions under which a ring $R$ is strongly $P$-clean. Many characterizations of such rings are obtained. The criteria on strong $P$-cleanness of $2\times 2$ matrices over commutative local rings are also determined.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.