Journal of Pure and Applied Algebra 220 (2016) 633–646
Contents lists available at ScienceDirect
Journal of Pure and Applied Algebra
www.elsevier.com/locate/jpaa
Nil-clean and strongly nil-clean rings
Tamer Koşan a, Zhou Wang b, Yiqiang Zhou c,∗ a Department of Mathematics, Gebze Technical University, Gebze/Kocaeli, Turkey b Department of Mathematics, Southeast University, Nanjing 210096, PR China c Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John’s, Nfld A1C 5S7, Canada a r t i c l e i n f o a b s t r a c t
Article history: An element a of a ring R is nil-clean if a = e + b where e2 = e ∈ R and b is a Received 28 August 2014 nilpotent; if further eb = be, the element a is called strongly nil-clean. The ring R Received in revised form 8 May 2015 is called nil-clean (resp., strongly nil-clean) if each of its elements is nil-clean (resp., Available online 5 August 2015 strongly nil-clean). It is proved that an element a is strongly nil-clean iff a is a sum Communicated by S. Iyengar of an idempotent and a unit that commute and a −a2 is a nilpotent, and that a ring MSC: R is strongly nil-clean iff R/J(R)is boolean and J(R)is nil, where J(R) denotes the Primary: 16U99; secondary: 16E50; Jacobson radical of R. The strong nil-cleanness of Morita contexts, formal matrix 16N40; 16S34; 16S50; 16S70 rings and group rings is discussed in details. A necessary and sufficient condition is obtained for an ideal I of R to have the property that R/I strongly nil-clean implies R is strongly nil-clean. Finally, responding to the question of when a matrix ring is nil-clean, we prove that the matrix ring over a 2-primal ring R is nil-clean iff R/J(R)is boolean and J(R)is nil, i.e., R is strongly nil-clean. © 2015 Elsevier B.V. All rights reserved.
1. Introduction
There has been considerable interest in the structure of the rings whose elements are sums of certain special elements. For instance, a ring is called 2-good if every element is a sum of two units, while a ring is called (strongly) clean if every element is a sum of an idempotent and a unit (that commute with each other). Clean and strongly clean rings, and 2-good rings are active subjects, which can be traced back to Nicholson’s work [25] in 1977 and Zelinsky’s paper [31] in 1954, respectively. Not to mention, there are other important examples in the literature. This paper is concerned with two interesting variants of the clean property of rings, introduced by Diesl in [10]. Following Diesl [10], an element of a ring is called (strongly) nil-clean if it is a sum of an idempotent and a nilpotent (that commute with each other), and a ring is called (strongly) nil-clean if every element is (strongly) nil-clean. It comes as no surprise that nil-clean and strongly nil-clean rings are naturally connected to clean and strongly clean rings. Besides, the
* Corresponding author. E-mail address: [email protected] (Y. Zhou). http://dx.doi.org/10.1016/j.jpaa.2015.07.009 0022-4049/© 2015 Elsevier B.V. All rights reserved. 634 T. Koşan et al. / Journal of Pure and Applied Algebra 220 (2016) 633–646 study of (strongly) nil-clean rings finds their close connections to strongly π-regular rings, boolean rings, and uniquely strongly clean rings. Furthermore, the nil-cleanness of a matrix ring is tightly linked to the famous Köthe Conjecture (see Section 6). The reader is referred to the papers [10,5,16,2] for the background and current stage of the study of nil-clean and strongly nil-clean rings. We continue the study of nil-clean and strongly nil-clean rings with the focus on the structure and construction of strongly nil-clean rings and the question of when a matrix ring is nil-clean. We start by proving that strongly nil-clean elements are exactly those strongly clean elements a with a − a2 nilpotent, with which some useful equivalent conditions of a strongly nil-clean element are obtained. These equivalent conditions are then used to prove the structure of a strongly nil-clean ring. This structure theorem, improving several results in [10], is utilized to conduct a detailed discussion regarding the strong nil-cleanness of Morita contexts, formal matrix rings and group rings in Sections 3 and 4, and the results obtained give various new families of strongly nil-clean rings. In Section 5, we go further to show the structure of a non-unital strongly nil-clean ring, and prove an extension theorem as an application. In Section 6, we prove that the matrix ring over a 2-primal ring R is nil-clean iff R/J(R)is boolean and J(R)is nil, i.e., R is a strongly nil-ring. This seems to be the best answer, so far, to the question of when a matrix ring is nil-clean. Throughout, R is an associative ring with identity, and C(R), J(R), U(R)and Nil(R)denote the center, the Jacobson radical, the unit group and the set of all nilpotent elements of R, respectively.
2. Strongly nil-clean rings
Let R be a ring and a ∈ R. If a = e + b where e2 = e ∈ R, b ∈ R is a nilpotent and eb = be, then this expression is called a strongly nil-clean decomposition of a in R. Similarly, we define clean, nil-clean and strongly clean decompositions of an element. In this section, we give important equivalent conditions of a strongly nil-clean element, and prove the structure theorem of a strongly nil-clean ring. We also show that the so-called Jacobson Lemma holds for strongly nil-clean elements.
Theorem 2.1. An element a ∈ R is strongly nil-clean iff a is strongly clean in R and a − a2 is a nilpotent.
Proof. (⇒). Let a = e + b be a strongly nil-clean decomposition in R. Then a =(1 − e) +(2e − 1 + b)is a strongly clean decomposition in R. Moreover, a2 = e +2eb + b2, so a − a2 =(1 − 2e − b)b is a nilpotent. (⇐). Let a = e +u be a strongly clean decomposition in R and a −a2 be a nilpotent. Then a2 = e +2eu +u2 and so a − a2 =(1 − 2e − u)u. It follows that 1 − 2e − u is a nilpotent. So a =(1 − e) +(−1 +2e + u)is a strongly nil-clean decomposition in R. 2
Corollary 2.2. (See [10, Corollary 3.10].) A unit u of a ring R is strongly nil-clean iff 1 − u is a nilpotent.
A uniquely strongly clean element of R is an element having a unique strongly clean decomposition in R. An element a ∈ R is called strongly π-regular if an ∈ Ran+1 ∩ an+1R for some positive integer n.
Lemma 2.3. Let a be a strongly nil-clean element of R. Then:
(1) a has a unique strongly nil-clean decomposition in R. (2) a is a strongly π-regular element of R. (3) a is a uniquely strongly clean element of R.
Proof. (1) is [10, Corollary 3.8]; (2) is by [10, p. 203, Remark]. (3) By Theorem 2.1, we know that a is strongly clean and a2−a is a nilpotent. By the proof of Theorem 2.1, two different idempotents which give strongly clean decompositions of a must yield two different idempotents T. Koşan et al. / Journal of Pure and Applied Algebra 220 (2016) 633–646 635 which give strongly nil-clean decompositions of a. But this is impossible. Thus a is uniquely strongly clean. 2
By [10, Proposition 2.5], an element a ∈ R is strongly π-regular iff there is an idempotent e ∈ R and a unit u ∈ R such that a = e + u, ae = ea and eae is nilpotent; this elementwise decomposition of a strongly π-regular element is referred to as a strongly π-regular decomposition. By [10, Proposition 2.6], a strongly π-regular element has only one such decomposition. Strongly nil-clean elements, uniquely strongly clean elements and strongly π-regular elements share the following interesting property. For a ∈ R, the commutant of a in R is denoted by C(a), i.e., C(a) = {x ∈ R : ax = xa}.
Proposition 2.4. Let a ∈ R. Then C(a) ⊆ C(e) holds in any of the following cases:
(1) a is a strongly nil-clean element of R with a strongly nil-clean decomposition a = e + b. (2) a is a strongly π-regular element of R with a strongly π-regular decomposition a = e + u. (3) a is a uniquely strongly clean element of R with a strongly clean decomposition a = e + u. eRe eR(1 − e) Proof. Let x ∈ C(a). Consider the Peirce decomposition R = with respect (1 − e)Re (1 − e)R(1 − e) ea 0 to the idempotent e. Then a = . 0(1− e)a e 0 eb 0 eex(1 − e) eb −ex(1 − e) e 0 (1) Since a = + = + = + 00 0(1− e)b 00 0(1− e)b (1 − e)xe 0 eb 0 are all strongly nil-clean decompositions of a in R, it follows that ex(1 − e) = −(1 − e)xe (1 − e)b (1 − e)xe =0. So x ∈ C (e). e 0 eu 0 eex(1 − e) eu −ex(1 − e) e 0 (2) Since a = + = + = + 00 0(1− e)u 00 0(1− e)u (1 − e)xe 0 eu 0 are all strongly π-regular decompositions of a in R, it follows that ex(1 − e) = −(1 − e)xe (1 − e)u (1 − e)xe =0. So x ∈ C(e). (3) It is similar to (2). 2
An element of a ring is called uniquely clean if it has only one clean decomposition in the ring. For a uniquely clean element a ∈ R with a clean decomposition a = e + u, C(a) need not be contained in C(e). In fact, a and e may not commute (see [15]). The next corollary follows from Theorem 2.1 and Lemma 2.3.
Corollary 2.5. Let a ∈ R. The following are equivalent:
(1) a is strongly nil-clean. (2) a is strongly π-regular and a − a2 is a nilpotent. (3) a is uniquely strongly clean and a − a2 is a nilpotent.
Corollary 2.6. A strongly nil-clean ring is uniquely strongly clean, i.e., every element is uniquely strongly clean.
A uniquely strongly clean element need not be strongly nil-clean. In fact, a uniquely strongly clean ring need not be strongly nil-clean: Z2[[t]] is a uniquely strongly clean ring by [8, Theorem 20], but its Jacobson radical is not nil, so it is not strongly nil-clean by Theorem 2.7 below. 636 T. Koşan et al. / Journal of Pure and Applied Algebra 220 (2016) 633–646
Diesl [10, Corollary 3.11] obtained a characterization of a strongly nil-clean ring: A ring R is strongly nil-clean iff R is a strongly π-regular ring and U(R) =1 +Nil(R). We now present the structure of a strongly nil-clean ring.
Theorem 2.7. A ring R is strongly nil-clean iff R/J(R) is boolean and J(R) is nil.
Proof. (⇐). Let a ∈ R. Then a − a2 ∈ J(R). As J(R)is nil, there exists a polynomial f(t)over Z such that e := f(a)is an idempotent of R and a − e ∈ J(R). Hence a = e +(a − e)is a strongly nil-clean decomposition. (⇒). By Corollary 2.6, R is uniquely strongly clean, so R/J(R)is boolean by [8, Corollary 18]. Let a ∈ J(R), and let a = e + b be a strongly nil-clean decomposition. As R/J(R)is boolean and b is a nilpotent, it follows that b ∈ J(R). Thus, e = a − b ∈ J(R), so e =0. Hence a = b is a nilpotent. 2
Corollary 2.8. (See [10, Corollary 3.20].) Let R be a commutative ring. Then R is nil-clean iff R/J(R) is boolean and J(R) is nil.
It is well-known that, for a, b ∈ R, 1 −ab ∈ U(R) ⇔ 1 −ba ∈ U(R). This result is also known as Jacobson’s Lemma. In [19], the authors proved that Jacobson Lemma holds for Drazin invertible elements, π-regular elements, strongly clean elements, and uniquely strongly clean elements. Here we show that Jacobson Lemma holds for strongly nil-clean elements.
Theorem 2.9. Let R be a ring and let a, b ∈ R. If ab is strongly nil-clean, then so is ba.
Proof. Since it is known that ab is strongly clean iff ba is strongly clean, we need only show that (ab)2 −ab is nilpotent iff (ba)2 − ba is nilpotent. However, this is clear because [(xy)2 − xy]n+1 = x[(yx)2 − yx]n(yxy − y) for any x, y ∈ R. 2
Corollary 2.10. Let R be a ring and let a, b ∈ R. If 1 − ab is strongly nil-clean, then so is 1 − ba.
Proof. Note that x ∈ R is strongly nil-clean iff 1 − x is strongly nil-clean. Suppose 1 − ba is strongly nil-clean. Then ba is strongly nil-clean, and so ab is strongly nil-clean by Theorem 2.9. Hence 1 − ab is strongly nil-clean. 2
Question 2.11. Does Jacobson Lemma hold for nil-clean elements?
3. Morita contexts and formal matrix rings AM In [10], the author showed that a formal matrix ring is strongly nil-clean iff A, B are strongly 0 B nil-clean, and that a proper matrix ring is never strongly nil-clean. This suggests that strongly nil-clean rings may be constructed through Morita contexts. Here we consider when a Morita context is a strongly nil-clean ring, and determine when a formal matrix ring is strongly nil-clean. AM A Morita context is a 4-tuple , where A, B are rings, M and N are bimodules, and NB A B B A there exist context products M × N → A and N × M → B written multiplicatively as (w, z) → wz and AM (z, w) → zw, such that is an associative ring with the obvious matrix operations. NB The next result (in fact, a more general result) can be found in [28]. T. Koşan et al. / Journal of Pure and Applied Algebra 220 (2016) 633–646 637 AM J(A) M Lemma 3.1. (See [28].) Let R := be a Morita context. Then J(R) = 0 , where NB N0 J(B) M0 = x ∈ M : xN ⊆ J(A) and N0 = y ∈ N : yM ⊆ J(B) . Canonically, M/M0 is an A/J (A), B/J(B) -bimodule and N/N0 is a B/J(B), A/J(A) -bimodule, and A/J(A) M/M this induces a Morita context 0 where the context products are given by N/N0 B/J(B)
(x + M0)(y + N0)=xy + J(A), (y + N0)(x + M0)=yx + J(B) for all x ∈ M and y ∈ N. AM Lemma 3.2. (See [29, Proposition 2.6].) Let R := be a Morita context, and let NB A/J(A) M/M0 N/N0 B/J(B) ∼ A/J(A) M/M0 be defined above. Then R/J(R) = . N/N0 B/J(B) AM Lemma 3.3. Let R := be a Morita context. Then R/J(R) is boolean iff A/J(A), B/J(B) are NB boolean, MN ⊆ J(A) and NM ⊆ J(B). ∼ A/J(A) M/M0 Proof. By Lemma 3.2, R/J(R) = . If R/J(R)is boolean, then it must be that N/N0 B/J(B) M/M0 =0and N/N0 =0, i.e., M = M0 and N = N0. It follows that MN ⊆ J(A)and NM ⊆ J(B)and ∼ that R/J(R) = A/J(A) × B/J(B). So A/J(A), B/J(B)are boolean. ∼ Conversely, MN ⊆ J(A)and NM ⊆ J(B)gives M0 = M and N0 = N. So, it follows that R/J(R) = A/J(A) M/M0 ∼ = A/J(A) ×B/J(B). Thus, A/J(A)and B/J(B)being boolean implies that R/J(R) N/N0 B/J(B) is boolean. 2 AM Theorem 3.4. Let R := be a Morita context. If R is a strongly nil-clean ring, then A, B are NB strongly nil-clean rings, MN ⊆ J(A) and NM ⊆ J(B); the converse holds if MN, NM are nilpotent ideals of A and B respectively.
Proof. Suppose R is strongly nil-clean. Then A, B are strongly nil-clean by [10, Corollary 3.26]. Since R/J(R)is boolean, one infers MN ⊆ J(A)and NM ⊆ J(B)by Lemma 3.3. For the converse, we see that R/J(R)is boolean by Lemma 3.3. Moreover, A, B are strongly π-regular rings by [10, Corollary 3.7]. With the assumption that MN, NM are nilpotent ideals of A and B respectively, we infer that R is strongly π-regular by [29, Theorem 3.5]. Hence J(R)is nil, and so R is strongly nil-clean by Theorem 2.7. 2
We do not know whether the condition that MN, NM are nilpotent is necessary in Theorem 3.4. RR Given a ring R and a central element s of R, the 4-tuple becomes a ring with addition defined RR componentwise and with multiplication defined by a x a x a a + sx y a x + x b 1 1 2 2 = 1 2 1 2 1 2 1 2 . y1 b1 y2 b2 y1a2 + b1y2 sy1x2 + b1b2 638 T. Koşan et al. / Journal of Pure and Applied Algebra 220 (2016) 633–646 AM This ring is denoted by K (R). A Morita context with A = B = M = N = R is called a s NB generalized matrix ring over R. It was observed by Krylov in [17] that a ring S is a generalized matrix ring over R iff S = Ks(R)for some s ∈ C(R). Here MN = NM = sR, so ‘MN ⊆ J(A) ⇔ s ∈ J(R)’, ‘NM ⊆ J(B) ⇔ s ∈ J(R)’, and ‘MN, NM are nilpotent ⇔ s is a nilpotent’. Thus, Theorem 3.4 has the following quick consequence.
Corollary 3.5. Let R be a ring with s ∈ C(R). Then Ks(R) is strongly nil-clean iff R is strongly nil-clean and s ∈ J(R).
Corollary 3.5 clearly implies that Ks2 (R)is strongly nil-clean iff R is strongly nil-clean and s ∈ J(R). As explained below, Ks2 = M2(R; s), a formal matrix ring defined by s. Following [30], for n ≥ 2and for s ∈ C(R), the n × n formal matrix ring over R defined by s, denoted as Mn(R; s), is the set of all n × n matrices over R with usual addition of matrices and with multiplication defined below: for (aij)and (bij)in Mn(R; s),