Weakly normal rings
Junchao Wei, Libin Li
Abstract
Open-access reader
Junchao Wei, Libin Li
Abstract
Open-access reader
A ring R is defined to be weakly normal if for all a, r \in R and e \in E(R), ae = 0 implies Rera is a nil left ideal of R, where E(R) stands for the set of all idempotent elements of R. It is proved that R is weakly normal if and only if Rer(1-e) is a nil left ideal of R for each e \in E(R) and r \in R if and only if T_n(R, R) is weakly normal for any positive integer n. And it follows that for a weakly normal ring R (1) R is Abelian if and only if R is strongly left idempotent reflexive; (2) R is reduced if and only if R is n-regular; (3) R is strongly regular if and only if R is regular; (4) R is clean if and only if R is exchange. (5) exchange rings have stable range 1.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A ring R is defined to be weakly normal if for all a, r \in R and e \in E(R), ae = 0 implies Rera is a nil left ideal of R, where E(R) stands for the set of all idempotent elements of R. It is proved that R is weakly normal if and only if Rer(1-e) is a nil left ideal of R for each e \in E(R) and r \in R if and only if T_n(R, R) is weakly normal for any positive integer n. And it follows that for a weakly normal ring R (1) R is Abelian if and only if R is strongly left idempotent reflexive; (2) R is reduced if and only if R is n-regular; (3) R is strongly regular if and only if R is regular; (4) R is clean if and only if R is exchange. (5) exchange rings have stable range 1.
Key concepts: Mathematics, Idempotence, Combinatorics, Ideal (ethics), Integer (computer science), Maximal ideal, Epistemology, Computer science