ISSN 2148-838Xhttp://dx.doi.org/10.13069/jacodesmath.284954 J. Algebra Comb. Discrete Appl. 4(2) • 155–164 Received: 12 June 2015 Accepted: 20 February 2016 Journal of Algebra Combinatorics Discrete Structures and Applications Strongly nil ∗-clean rings Research Article Abdullah Harmancı, Huanyin Chen, A. Çiğdem Özcan Abstract: A ∗-ring R is called 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. 2010 MSC: 16W10, 16U99 Keywords: Rings with involution, Strongly nil ∗-clean ring, ∗-Boolean ring, Boolean ring 1. Introduction Let R be an associative ring with unity. A ring R is called strongly nil clean if every element of R is the sum of an idempotent and a nilpotent that commute. These rings were first considered by Hirano-Tominaga-Yakub [9] and refered to as [E-N]-representable rings. In [7], Diesl introduces this class and studies their properties. The class of strongly nil clean rings lies between the class of Boolean rings and strongly π-regular rings (i.e. for every a ∈ R, an ∈ Ran+1 ∩an+1R for some positive integer n) [7, Corollary 3.7]. An involution of a ring R is an operation ∗ : R → R such that (x + y)∗ = x∗ + y∗, (xy)∗ = y∗x∗ and (x∗)∗ = x for all x,y ∈ R. A ring R with an involution ∗ is called a ∗-ring. An element p in a ∗-ring R is called a projection if p2 = p = p∗ (see [2]). Recently the concept of strongly clean rings were considered for any ∗-ring. Vaš [12] calls a ∗-ring R strongly ∗-clean if each of its elements is the sum of a projection and a unit that commute with each other (see also [10]). In this paper, we adapt strongly nil cleanness to ∗-rings. We call a ∗-ring R strongly nil ∗-clean if every element of R is the sum of a projection and a nilpotent element that commute. The paper consists Abdullah Harmancı (Corresponding Author), A. Çiğdem Özcan; Hacettepe University, Department of Mathe- matics, 06800 Beytepe, Ankara, Turkey (email: harmanci@hacettepe.edu.tr, ozcan@hacettepe.edu.tr). Huanyin Chen; Hangzhou Normal University, Department of Mathematics, 310036, Hangzhou, China (email: huanyinchen@aliyun.com). 155 A. Harmancı et al. / J. Algebra Comb. Discrete Appl. 4(2) (2017) 155–164 of three parts. In Section 2, we characterize the class of strongly nil ∗-clean rings in several different ways. For example, we show that a ring 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. Also, if R is a commutative ∗-ring and R[i] = {a + bi | a,b ∈ R, i2 = −1 }, then with the involution ∗ defined by (a + bi)∗ = a∗ + b∗i, the ring R[i] is strongly nil ∗-clean if and only if R is strongly nil ∗-clean. Foster [8] introduced the concept of Boolean-like rings as a generalization of Boolean rings. In Section 3, we adapt the concept of Boolean-like rings to rings with involution and prove that a ∗-ring R is ∗-Boolean-like if and only if R is strongly nil ∗-clean and αβ = 0 for all nilpotent elements α, β in R. In the last section, we investigate submaximal ideals (see [11]) of strongly nil ∗-clean rings. We also define ∗-Boolean rings as ∗-rings over which every element is a projection and characterize them in terms of strongly nil ∗-cleanness. As a corollary, we get that R is a Boolean ring if and only if R is commutative, strongly nil clean and every primary ideal of R is maximal. Other characterizations of Boolean rings by means of (strongly) nil clean rings can be found in [7]. Throughout this paper all rings are associative with unity (unless otherwise noted). We write J(R), N(R) and U(R) for the Jacobson radical of a ring R, the set of all nilpotent elements in R and the set of all units in R, respectively. The ring of all polynomials in one variable over R is denoted by R[x]. 2. Characterization theorems The main purpose of this section is to provide several characterizations of strongly nil ∗-clean rings. First recall some definitions. A ring R is called uniquely nil clean if, for any x ∈ R, there exists a unique idempotent e ∈ R such that x − e ∈ N(R) [7]. If, in addition, x and e commute, R is called uniquely strongly nil clean [9]. Strongly nil cleanness and uniquely strongly nil cleanness are equivalent by [9, Theorem 3]. Analogously, for a ∗-ring, we define uniquely strongly nil ∗-clean rings by replacing “idempotent" with “projection" in the definition of uniquely strongly nil clean rings. We will use the following lemma frequently. Lemma 2.1. [10, Lemma 2.1] Let R be a ∗-ring. If every idempotent in R is a projection, then R is abelian, i.e. every idempotent in R is central. Proposition 2.2. Let R be a ∗-ring. Then the following are equivalent. (i) R is strongly nil ∗-clean; (ii) R is strongly nil clean and every idempotent in R is a projection; (iii) R is uniquely strongly nil ∗-clean. Proof. (i) ⇒ (ii) Assume that R is strongly nil ∗-clean. Then R is strongly ∗-clean as can be seen in the proof of [7, Proposition 3.4], i.e. if x ∈ R, there exist a projection e and a nilpotent w in R such that x− 1 = e + w and ew = we. This gives that x = e + (1 + w) where e is a projection, 1 + w is invertible and e(1 + w) = (1 + w)e. Now, by [10, Theorem 2.2], every idempotent in R is a projection and central. Hence R is uniquely nil clean by [9, Theorem 3]. (ii) ⇒ (iii) If R is uniquely nil clean, then R is uniquely strongly nil clean by Lemma 2.1. Hence R is uniquely strongly nil ∗-clean. (iii) ⇒ (i) Clear. We note that the condition “every idempotent in R is a projection" in Proposition 2.2 is necessary as the following example shows. 156 A. Harmancı et al. / J. Algebra Comb. Discrete Appl. 4(2) (2017) 155–164 Example 2.3. Let R = {( 0 0 0 0 ) , ( 1 0 0 1 ) , ( 1 1 0 0 ) , ( 0 1 0 1 )} where 0, 1 ∈ Z2. Define ∗ : R → R,( a b c d ) 7→ ( a + b b a + b + c + d b + d ) . Then R is a commutative ∗-ring with the usual matrix addition and multiplication. In fact, R is Boolean. Thus, for any x ∈ R, there exists a unique idempotent e ∈ R such that x− e ∈ R is nilpotent. But it is not strongly nil ∗-clean because the only projections are the trivial projections and there does not exist a projection e in R such that ( 1 1 0 0 ) −e is nilpotent. In [9, Theorem 3], it is proved that R is strongly nil clean if and only if N(R) is an ideal and R/N(R) is Boolean. Also, R is uniquely nil clean if and only if R is abelian, N(R) is an ideal and R/N(R) is Boolean [9, Theorem 4]. So if we adapt these results to rings with involution, immediately we have the following proposition by using Proposition 2.2. Proposition 2.4. Let R be a ∗-ring. Then R is strongly nil ∗-clean if and only if (1) Every idempotent in R is a projection; (2) N(R) forms an ideal; (3) R/N(R) is Boolean. A ring R is called strongly J-∗-clean if for any x ∈ R there exists a projection e ∈ R such that x − e ∈ J(R) and ex = xe [6], equivalently, for any x ∈ R there exists a unique projection e ∈ R such that x− e ∈ J(R) [6, Theorem 3.2]. We call R uniquely nil ∗-clean ring if for any a ∈ R, there exists a unique projection e ∈ R such that a−e ∈ N(R). Proposition 2.5. Let R be a ∗-ring. Then the following are equivalent. (i) R is strongly nil ∗-clean; (ii) R is strongly J-∗-clean and J(R) is nil; (iii) R is uniquely nil ∗-clean and J(R) is nil. Proof. (i) ⇒ (ii) Suppose that R is strongly nil ∗-clean. In view of Proposition 2.4, N(R) forms an ideal of R, and this gives that N(R) ⊆ J(R) (see also [7, Proposition 3.18]). By [7, Proposition 3.16], J(R) is nil, and so N(R) = J(R). Hence R is strongly J-∗-clean. (ii) ⇒ (i) is obvious. (i) and (ii) ⇒ (iii) Since R is strongly J-∗-clean, there exists a unique projection e ∈ R such that x−e ∈ J(R) by [6, Theorem 3.2]. Since J(R) = N(R), R is uniquely nil ∗-clean. (iii) ⇒ (ii) Since J(R) ⊆ N(R), R is strongly J-∗-clean rings by [6, Theorem 3.2]. From Proposition 2.5 and [6, Proposition 2.1], it follows that {strongly nil ∗-clean}⊂{strongly J-∗-clean}⊂{strongly ∗-clean}. The first inclusion is strict because, for example, the power series ring Z2[[x]] with the identity involution is strongly J-∗-clean but not strongly nil ∗-clean by [4, Example 2.5(5)]. The second inclusion is also strict by [6, Example 2.2(2)]. We should note that a strongly nil clean ring may not be strongly J-clean (see [4, Example on p. 3799]). Hence strongly nil clean and strongly nil ∗-clean classes have different behavior when compared to classes of strongly J-clean and strongly J-∗-clean classes respectively. 157 A. Harmancı et al. / J. Algebra Comb. Discrete Appl. 4(2) (2017) 155–164 Lemma 2.6. Let R be a ∗-ring. Then R is strongly nil ∗-clean if and only if (1) Every idempotent in R is a projection; (2) J(R) is nil; (3) R/J(R) is Boolean. Proof. Assume that (1), (2) and (3) hold. For any x ∈ R, x + J(R) = x2 + J(R). As J(R) is nil, every idempotent in R lifts modulo J(R). Thus, we can find an idempotent e ∈ R such that x − e ∈ J(R) ⊆ N(R). By Lemma 2.1, xe = ex, and so the result follows. The converse is by Propositions 2.4 and 2.5. Recall that a ring R is periodic if for any x ∈ R, there exist distinct m,n ∈ N such that xm = xn. With this information we can now prove the following. Theorem 2.7. Let R be a ∗-ring. Then R is strongly nil ∗-clean if and only if (1) Every idempotent in R is a projection; (2) R is periodic; (3) R/J(R) is Boolean. Proof. Suppose that R is strongly nil ∗-clean. By virtue of Lemma 2.6, every idempotent in R is a projection and R/J(R) is Boolean. For any x ∈ R, x − x2 ∈ N(R). Write (x − x2)m = 0, and so xm = xm+1f(x), where f(x) ∈ Z[x]. According to Herstein’s Theorem (cf. [3, Proposition 2]), R is periodic. Conversely, J(R) is nil as R is periodic. Therefore the proof is completed by Lemma 2.6. Proposition 2.8. A ∗-ring R is strongly nil ∗-clean if and only if (1) R is strongly ∗-clean; (2) N(R) = {x ∈ R | 1 −x ∈ U(R)}. Proof. Suppose that R is strongly nil ∗-clean. By the proof of Proposition 2.5, N(R) = J(R). Since R is strongly J-∗-clean, N(R) = {x ∈ R | 1 −x ∈ U(R)} by [6, Theorem 3.4]. Conversely, assume that (1) and (2) hold. Let a ∈ R. Then we can find a projection e ∈ R such that (a − 1) − e ∈ U(R) and e(a − 1) = (a − 1)e. That is, (1 − a) + e ∈ U(R). As 1 − (a − e) ∈ U(R), by hypothesis, a−e ∈ N(R). In addition, ea = ae. Accordingly, R is strongly nil ∗-clean. Let R be a ∗-ring. Define ∗ : R[x]/(xn) → R[x]/(xn) by a0 + a1x + · · · + an−1xn−1 + (xn) 7→ a∗0 + a ∗ 1x + · · · + a∗n−1xn−1 + (xn). Then R[x]/(xn) is a ∗-ring (cf. [10]). Corollary 2.9. Let R be a ∗-ring. Then R is strongly nil ∗-clean if and only if so is R[x]/(xn) for every n ≥ 1. Proof. One direction is obvious. Conversely, assume that R is strongly nil ∗-clean. Clearly, N ( R[x]/(xn) ) = {a0 + a1x + · · · + an−1xn−1 + (xn) | a0 ∈ N(R),a1, · · · ,an−1 ∈ R}. In view of Proposi- tion 2.8, N ( R[x]/(xn) ) = {a0 + a1x + · · · + an−1xn−1 + (xn) | 1 −a0 ∈ U(R),a1, · · · ,an−1 ∈ R}. Also note that R is abelian. Thus, it can be easily seen that every element in R[x]/(xn) can be written as the sum of a projection and a nilpotent element that commute. 158 A. Harmancı et al. / J. Algebra Comb. Discrete Appl. 4(2) (2017) 155–164 Let R be a commutative ∗-ring and consider the ring R[i] = {a + bi | a,b ∈ R, i2 = −1 } and i commutes with elements of R. Then R[i] is a ∗-ring, where the involution is ∗ : R[i] → R[i], a + bi 7→ a∗ + b∗i. Note that if x and y are idempotent elements that commute, then (x−y)3 = x−3xy+3xy−y = x−y. This argument will also be used in Lemma 4.6. Proposition 2.10. Let R be a commutative ∗-ring. Then with the involution (a + bi)∗ = a∗ + b∗i, R[i] is strongly nil ∗-clean if and only if R is strongly nil ∗-clean. Proof. Suppose that R[i] is strongly nil ∗-clean. Then every idempotent in R is a projection. Since R is commutative, N(R) forms an ideal. For any a ∈ R, we see that a−a2 ∈ N ( R[i] ) , and so a−a2 ∈ N(R). Thus, R/N(R) is Boolean. Therefore R is strongly nil ∗-clean by Proposition 2.4. Conversely, assume that R is strongly nil ∗-clean. As R is commutative, N ( R[i] ) forms an ideal of R[i]. Let a + bi ∈ R[i] be an idempotent. Then we can find projections e,f ∈ R and nilpotent elements u,v ∈ R such that a = e + u, b = f + w. Then a − a∗,b − b∗ ∈ N(R). This shows that (a + bi) − (a + bi)∗ = (a−a∗) + (b− b∗)i ∈ N ( R[i] ) . As a + bi, (a + bi)∗ ∈ R[i] are idempotents, we see that ( (a + bi)−(a + bi)∗ )3 = (a + bi)−(a + bi)∗ by the above argument. Hence, ( (a + bi)−(a + bi)∗ )( 1− ((a + bi) − (a + bi)∗)2 ) = 0, therefore (a + bi) − (a + bi)∗ = 0. That is, a + bi ∈ R[i] is a projection. Since R is strongly nil ∗-clean, it follows from Proposition 2.4 that 2−22 ∈ N(R), and so 2 ∈ N(R). For any a + bi ∈ R[i], it is easy to verify that (a + bi) − (a + bi)2 = (a−a2) − 2abi + bi− b2i2 ≡ b2 + bi ≡ b + bi ( mod N ( R[i] )) . This shows that ( (a+bi)−(a+bi)2 )2 ≡ 2b2i ≡ 2b ≡ 0 (mod N(R[i])). Hence, (a+bi)−(a+bi)2 ∈ N(R[i]). That is, R[i]/N ( R[i] ) is Boolean. According to Proposition 2.4, we complete the proof. 3. ∗-Boolean like rings In this section, we consider a subclass of strongly nil ∗-clean rings consisting of rings which we call ∗-Boolean-like. First recall that a ring R is called Boolean-like if it is commutative with unit and is of characteristic 2 with ab(1 +a)(1 +b) = 0 for every a,b ∈ R [8]. Any Boolean ring is clearly a Boolean-like ring but not conversely (see [8]). Any Boolean-like ring is uniquely nil clean by [8, Theorem 17]. Also, R is Boolean-like if and only if (1) R is a commutative ring with unit; (2) It is of characteristic 2; (3) It is nil clean; (4) ab = 0 for every nilpotent element a,b in R [8, Theorem 19]. Definition 3.1. A ∗-ring R is said to be ∗-Boolean-like provided that every idempotent in R is a projection and (a−a2)(b− b2) = 0 for all a,b ∈ R. The following is an example of a ∗-Boolean-like ring. Example 3.2. Let R = { ( a b c a ) | a,b,c ∈ Z2}. Define ( a b c a ) + ( a′ b′ c′ a′ ) = ( a + a′ b + b′ c + c′ a + a′ ) ,( a b c a )( a′ b′ c′ a′ ) = ( aa′ ab′ + ba′ ca′ + ac′ aa′ ) and ∗ : R → R, ( a b c a ) 7→ ( a c b a ) . Then R is a ∗-ring. Let ( a b c a ) ∈ R be an idempotent. Then a = a2 and (2a−1)b = (2a−1)c = 0. As (2a−1)2 = 1, we see that b = c = 0, and so the set of all idempotents in R is { ( 0 0 0 0 ) , ( 1 0 0 1 ) }. Thus, every idempotent in R is a projection. For any A,B ∈ R, we see that (A−A2)(B −B2) = ( 0 ∗ ∗ 0 )( 0 ∗ ∗ 0 ) = 0. Therefore R is ∗-Boolean-like. 159 A. Harmancı et al. / J. Algebra Comb. Discrete Appl. 4(2) (2017) 155–164 Theorem 3.3. Let R be a ∗-ring. Then R is ∗-Boolean-like if and only if (1) R is strongly nil ∗-clean; (2) αβ = 0 for all nilpotent elements α,β ∈ R. Proof. Suppose that R is ∗-Boolean-like. Then every idempotent in R is a projection; hence, R is abelian. For any a ∈ R, (a − a2)2 = 0, and so a2 = a3f(a) for some f(t) ∈ Z[t]. This implies that R is strongly π-regular, and so it is π-regular. It follows from [1, Theorem 3] that N(R) forms an ideal. Further, a−a2 ∈ N(R). Therefore R/N(R) is Boolean. According to Proposition 2.4, R is strongly nil ∗-clean. For any nilpotent elements α,β ∈ R, we can find some m,n ∈ N such that αm = βn = 0. Since α2 = α3g(α) for some g(t) ∈ Z[t], α2 = 0. Likewise, β2 = 0. This shows that αβ = (α−α2)(β−β2) = 0. Conversely, assume that (1) and (2) hold. By Proposition 2.4, every idempotent is a projection, and for any a ∈ R, a − a2 is nilpotent. Hence for any a,b ∈ R, (a − a2)(b − b2) = 0. Therefore R is ∗-Boolean-like. Corollary 3.4. ∗-Boolean-like rings are commutative rings. Proof. Let x,y ∈ R. In view of Theorem 3.3, x − e and y − f are nilpotent for some projections e,f ∈ R. Again by Theorem 3.3, (x−e)(y −f) = 0 = (y −f)(x−e). Since R is abelian, it follows that xy = yx. Hence R is commutative. Example 3.5. Let R be the ring { ( 0 0 0 0 ) , ( 1 0 0 1 ) , ( 0 1 1 0 ) , ( 1 1 0 0 ) , ( 0 0 1 1 ) , ( 1 0 1 0 ) , ( 0 1 0 1 ) , ( 1 1 1 1 ) }, where 0, 1 ∈ Z2. Define ∗ : R → R,A 7→ AT , the transpose of A. Then R is a ∗-ring in which (a−a2)(b− b2) = 0 for all a,b ∈ R. Further, αβ = 0 for all nilpotent elements α,β ∈ R. But R is not ∗-Boolean-like. We end this section with an example showing that strongly nil clean rings need not be strongly nil ∗-clean. Example 3.6. Consider the ring R = {( a 2b 0 c ) | a,b,c ∈ Z4 } . Then for any x,y ∈ R, (x − x2)(y − y2) = 0. Obviously, R is not commutative. This implies that R is not a ∗-Boolean-like ring for any involution ∗. Accordingly, R is not strongly nil ∗-clean for any involution ∗; otherwise, every idempotent in R is a projection, a contradiction (see Lemma 2.1). We can also consider the involution ∗ : R → R, ( a 2b 0 c ) 7→ ( c −2b 0 a ) and the idempotent ( 0 0 0 1 ) which is not a projection. On the other hand, since (x−x2)2 = 0 and so x−x2 ∈ N(R) for all x ∈ R, we get that R is strongly nil clean by [9, Theorem 3]. 4. Submaximal ideals and ∗-Boolean rings An ideal I of a ring R is called a submaximal ideal if I is covered by a maximal ideal of R. That is, there exists a maximal ideal I1 of R such that I $ I1 $ R and for any ideal K of R such that I ⊆ K ⊆ I1, we have I = K or K = I1. This concept was initially introduced to study Boolean-like rings (cf. [11]). A ∗-ring R is called a ∗-Boolean ring if every element of R is a projection. The purpose of this section is to characterize submaximal ideals of strongly nil ∗-clean rings, and ∗-Boolean rings by means of strongly nil ∗-cleanness. We begin with the following lemma. 160 A. Harmancı et al. / J. Algebra Comb. Discrete Appl. 4(2) (2017) 155–164 Lemma 4.1. Let R be strongly nil ∗-clean. Then an ideal M of R is maximal if and only if (1) M is prime; (2) For any a ∈ R,n ≥ 1, an ∈ M implies that a ∈ M. Proof. Suppose that M is maximal. Obviously, M is prime. Let a ∈ R and an ∈ M. If a 6∈ M, RaR + M = R. Thus, RaR = R where R = R/M and a = a + M. Clearly, R is an abelian clean ring, and so it is an exchange ring by [5, Theorem 17.2.2]. This implies that R/M is an abelian exchange ring. As in the proof of [5, Proposition 17.1.9], there exists a nonzero idempotent e ∈ R such that e ∈ aR and 1 − e ∈ (1 − a)R. Since ReR is a nonzero ideal of simple ring R, ReR = R. Thus 1 − e ∈ M. Hence, 1 −ar ∈ M for some r ∈ R. This implies that an−1 −anr ∈ M, and so an−1 ∈ M. By iteration of this process, we see that a ∈ M, as required. Conversely, assume that (1) and (2) hold. Assume that M is not maximal. Then we can find a maximal ideal I of R such that M $ I $ R. Choose a ∈ I while a 6∈ M. By hypothesis, there exists a projection e ∈ R and a nilpotent u ∈ R such that a = e + u. Write um = 0. Then um ∈ M. By hypothesis, u ∈ M. This shows that e 6∈ M. Clearly, R is abelian. Thus eR(1−e) ⊆ M. As M is prime, we deduce that 1 −e ∈ M. As a result, 1 −a = (1 −e) −u ∈ M, and so 1 = (1 −a) + a ∈ I. This gives a contradiction. Therefore M is maximal. Let R be a strongly nil ∗-clean ring, and let x ∈ R. Then there exists a unique projection e ∈ R such that x−e ∈ N(R). We denote e by xP and x−e by xN. Lemma 4.2. Let I be an ideal of a strongly nil ∗-clean ring R, and let x ∈ R be such that x 6∈ I. If xP 6∈ I, then there exists a maximal ideal J of R such that I ⊆ J and x 6∈ J. Proof. Let Ω = {K | K is an ideal in R, I ⊆ K,xP 6∈ K}. Then Ω 6= ∅. Given K1 ⊆ K2 ⊆ ··· in Ω, we set Q = ∞⋃ i=1 Ki. Then Q is an ideal of R. If Q 6∈ Ω, then xP ∈ Q, and so xP ∈ Ki for some i. This gives a contradiction. Thus, Ω is inductive. By using Zorn’s Lemma, there exists an ideal L of R which is maximal in Ω. Let a,b ∈ R such that a,b 6∈ L. By the maximality of L, we see that RaR+L,RbR+L 6∈ Ω. This shows that xP ∈ (RaR + L)∩(RbR + L). Hence, xP = x2P ∈ RaRbR + L. This yields that aRb * L; otherwise, xP ∈ L, a contradiction. Hence, L is prime. Assume that L is not maximal. Then we can find a maximal ideal M of R such that L $ M $ R. Clearly, R is abelian. By the maximality, we see that xP ∈ M, and so 1 − xP 6∈ M. This implies that 1 − xP 6∈ L. As xP R(1 − xP ) = 0 ⊆ L, we have that xP ∈ L, a contradiction. Therefore L is a maximal ideal, as asserted. Proposition 4.3. Let R be strongly nil ∗-clean. Then the intersection of two maximal ideals is submax- imal and it is covered by each of these two maximal ideals. Further, there is no other maximal ideals containing it. Proof. Let I1 and I2 be two distinct maximal ideals of R. Then I1∩I2 $ I1. Suppose I1∩I2 ⊆ L $ I1. Then we can find some x ∈ I1 while x 6∈ L. Write xnN = 0. Then x n N ∈ I1. In light of Lemma 4.1, xN ∈ I1. Likewise, xN ∈ I2. Thus, xN ∈ I1 ∩ I2 ⊆ L. This shows that xP 6∈ L. By virtue of Lemma 4.2, there exists a maximal ideal M of R such that L ⊆ M and x 6∈ M. Hence, I1∩I2 ⊆ M and I1 6= M. If I2 6= M, then I2 +M = R. Write t+y = 1 with t ∈ I2,y ∈ M. Then for any z ∈ I1, z = zt+zy ∈ I1∩I2 +M = M, and so I1 = M. This gives a contradiction. Thus I2 = M, and then L ⊆ M ⊆ I2. As a result, L ⊆ I1∩I2, and so I1 ∩ I2 = L. Therefore I1 ∩ I2 is a submaximal ideal of R. We claim that I1 ∩ I2 is semiprime. If K2 ⊆ I1 ∩ I2, then for any a ∈ K, we see that a2 ∈ I1 ∩ I2. In view of Lemma 4.1, a ∈ I1 ∩ I2. This implies that K ⊆ I1 ∩ I2. Hence, I1 ∩ I2 is semiprime. Therefore I1 ∩ I2 is the intersection of maximal ideals containing I1 ∩ I2. Assume that K is a maximal ideal of R such that I1∩I2 ⊆ K. If K 6= I1,I2, then I1+K = I2+K = R. This implies that I1 ∩ I2 + K = R, and so K = R, a contradiction. Thus, K = I1 or K = I2, and so the proof is completed. 161 A. Harmancı et al. / J. Algebra Comb. Discrete Appl. 4(2) (2017) 155–164 We call a local ring R absolutely local provided that for any 0 6= x ∈ J(R), J(R) = RxR. Corollary 4.4. Let R be strongly nil ∗-clean, and let I be an ideal of R. Then I is a submaximal ideal if and only if R/I is Boolean with four elements or R/I is absolutely local. Proof. Let I be a submaximal ideal of R. Case I. I is contained in more than one maximal ideal. Then I is contained in two distinct maximal ideals of R. Since I is submaximal, there exists a maximal ideal L of R such that I is covered by L. Thus, we have a maximal ideal L′ such that L′ 6= L and I $ L′. Hence, I ⊆ L∩L′ ⊆ L. Clearly, L∩L′ 6= L as L + L′ = R, and so I = L ∩ L′. In view of Proposition 4.3, there is no maximal ideal containing I except for L and L′. This shows that R/I has only two maximal ideals covering {0 + I}. For any a ∈ R, it follows from Proposition 2.4 that a−a2 ∈ R is nilpotent. Write (a−a2)n = 0. Then (a−a2)n ∈ L. According to Lemma 4.1, a−a2 ∈ L. Likewise, a−a2 ∈ L′. Thus, a−a2 ∈ L∩L′, and so a−a2 ∈ I. This shows that R/I is Boolean. Therefore R/I is Boolean with four elements. Case II. Suppose that I is contained in only one maximal ideal L of R. Then R/I has only one maximal ideal L/I. Clearly, R is an abelian exchange ring, and then so is R/I. Let e ∈ R/I be a nontrivial idempotent. Then I ⊆ I + ReR ⊆ L or I + ReR = R. Likewise, I ⊆ I + R(1 − e)R ⊆ L or I + R(1−e)R = R. This shows that I + ReR = R or I + R(1−e)R = R Thus, (R/I)(e + I)(R/I) = R/I or (R/I)(1−e + I)(R/I) = R/I, a contradiction. Therefore all idempotents in R/I are trivial. It follows from [5, Lemma 17.2.1] that R/I is local. For any 0 6= x ∈ L/I, we see that 0 6= I ⊆ RxR ⊆ L. As I is submaximal, we deduce that L = RxR. Therefore R is absolutely local. Conversely, assume that R/I is Boolean with four elements. Then R/I has precisely two maximal ideals covering {0 + I}, and so R has precisely two maximal ideals covering I. Thus, we have a maximal ideal L such that I $ L. If I ⊆ K ⊆ L. Then K = I or K is maximal, and so K = L. Consequently, I is submaximal. Assume that R/I is absolutely local. Then R/I has a unique maximal ideal L/I. Hence, L is a maximal ideal of R such that I $ L. Assume that I $ K ⊆ L. Choose a ∈ K while a 6∈ I. Then L = RaR ⊆ K, and so K = L. Therefore I is submaximal, as required. Corollary 4.5. Let R be strongly nil ∗-clean. If I1 and I2 are distinct maximal ideals of R, then R/(I1 ∩ I2) is Boolean. Proof. Since I1/(I1 ∩I2) and I2/(I1 ∩I2) are distinct maximal ideals, R/(I1 ∩I2) is not local. In view of Proposition 4.3, I1 ∩ I2 is a submaximal ideal of R. Therefore Corollary 4.4 yields the proof. Recall that an ideal I of a commutative ring R is primary provided that for any x,y ∈ R, xy ∈ I implies that x ∈ I or yn ∈ I for some n ∈ N. Clearly, every maximal ideal of a commutative ring is primary. We end this article by giving the relation between strongly nil ∗-clean rings and ∗-Boolean rings. Lemma 4.6. Let R be a commutative strongly nil ∗-clean ring. Then the intersection of all primary ideals of R is zero. Proof. Let a be in the intersection of all primary ideal of R. Assume that a 6= 0. Let Ω = {I | I is an ideal of R such that a 6∈ I}. Then Ω 6= ∅ as 0 ∈ Ω. Given any ideals I1 ⊆ I2 ⊆ ··· in Ω, we set M = ∞⋃ i=1 Ii. Then M ∈ Ω. Thus, Ω is inductive. By using Zorn’s Lemma, we can find an ideal Q which is maximal in Ω. It will suffice to show that Q is primary. If not, we can find some x,y ∈ R such that xy ∈ Q, but x 6∈ Q and yn 6∈ Q for any n ∈ N. This shows that a ∈ Q+(x), and so a = b+cx for some b ∈ Q,c ∈ R. Since R is strongly nil ∗-clean, it follows from Theorem 2.7 that there are some distinct k,l ∈ N such that yk = yl. Say k > l. Then yl = yk = yl+1yk−l−1 = ylyyk−l−1 = yl+2y2(k−l−1) = · · · = y2lyl(k−l−1). Hence, yl(k−l) = yl(yl(k−l−1)) = y2ly2l(k−l−1) = ( yl(k−l) )2 . Choose s = l(k − l). Then ys is an idempo- tent. Write y = yP + yN. Then ys − yP = (yP + yN )s − yP = yN ( syP + · · · + ys−1N ) ∈ N(R). As R is a commutative ring, we see that (ys − yP )3 = ys − yP . This implies that ys = yP . Since xy ∈ Q, we have that xys ∈ Q, and so xyP ∈ Q. It follows from a = b + cx that ayP = byP + cxyP ∈ Q. Clearly, ys 6∈ Q, and so a ∈ Q + (yP ). Write a = d + ryP for some d ∈ Q,r ∈ R. We see that ayP = dyP + ryP , 162 A. Harmancı et al. / J. Algebra Comb. Discrete Appl. 4(2) (2017) 155–164 and so ryP ∈ Q. This implies that a ∈ Q, a contradiction. Therefore Q is primary, a contradiction. Consequently, the intersection of all primary ideals of R is zero. Theorem 4.7. Let R be a ∗-ring. Then R is a ∗-Boolean ring if and only if (1) R is commutative; (2) Every primary ideal of R is maximal; (3) R is strongly nil ∗-clean. Proof. Suppose that R is a ∗-Boolean ring. Clearly, R is a commutative strongly nil ∗-clean ring. Let I be a primary ideal of R. If I is not maximal, then there exists a maximal ideal M such that I $ M $ R. Choose x ∈ M while x 6∈ I. As x is an idempotent, we see that xR(1−x) ⊆ I, and so (1−x)m ∈ I ⊂ M for some m ∈ N. Thus, 1 −x ∈ M. This implies that 1 = x + (1 −x) ∈ M, a contradiction. Therefore I is maximal, as required. Conversely, assume that (1), (2) and (3) hold. Clearly, every maximal ideal of R is primary, and so J(R) = ⋂ {P | P is primary}. In view of Lemma 4.6, J(R) = 0. Hence every element is a projection i.e. R is ∗-Boolean. Corollary 4.8. A ring R is a Boolean ring if and only if (1) R is commutative; (2) Every primary ideal of R is maximal; (3) R is strongly nil clean. Proof. Choose the involution as the identity. Then the result follows from Theorem 4.7. Acknowledgment: The authors are grateful to the referee for his/her careful reading and valuable comments on this manuscript. This research was supported by the Scientific and Technological Research Council of Turkey (TUBITAK-2221 Visiting Scientists Fellowship Programme). Huanyin Chen is thankful for the support by the Natural Science Foundation of Zhejiang Province (No. LY17A010018). References [1] A. Badawi, On abelian π–regular rings, Comm. Algebra 25(4) (1997) 1009–1021. [2] S. K. Berberian, Baer ∗–Rings, Springer-Verlag, Heidelberg, London, New York, 2011. [3] M. Chacron, On a theorem of Herstein, Canad. J. Math. 21 (1969) 1348–1353. [4] H. Chen, On strongly J–clean rings, Comm. Algebra 38(10) (2010) 3790–3804. [5] H. Chen, Rings Related Stable Range Conditions, Series in Algebra 11, World Scientific, Hackensack, NJ, 2011. [6] H. Chen, A. Harmancı A. Ç. Özcan, Strongly J–clean rings with involutions, Ring theory and its applications, Contemp. Math. 609 (2014) 33–44. [7] A. J. Diesl, Nil clean rings, J. Algebra 383 (2013) 197–211. [8] A. L. Foster, The theory of Boolean–like rings, Trans. Amer. Math. Soc. 59 (1946) 166–187. [9] Y. Hirano, H. Tominaga, A. Yaqub, On rings in which every element is uniquely expressable as a sum of a nilpotent element and a certain potent element, Math. J. Okayama Univ. 30 (1988) 33–40. [10] C. Li, Y. Zhou, On strongly ∗–clean rings, J. Algebra Appl. 10(6) (2011) 1363–1370. 163 http://dx.doi.org/10.1080/00927879708825906 http://www.ams.org/mathscinet-getitem?mr=262295 http://dx.doi.org/10.1080/00927870903286835 http://www.ams.org/mathscinet-getitem?mr=3204350 http://www.ams.org/mathscinet-getitem?mr=3204350 http://dx.doi.org/10.1016/j.jalgebra.2013.02.020 http://dx.doi.org/10.2307/1990316 http://www.ams.org/mathscinet-getitem?mr=976729 http://www.ams.org/mathscinet-getitem?mr=976729 http://dx.doi.org/10.1142/S0219498811005221 A. Harmancı et al. / J. Algebra Comb. Discrete Appl. 4(2) (2017) 155–164 [11] V. Swaminathan, Submaximal ideals in a Boolean–like rings, Math. Sem. Notes Kobe Univ. 10(2) (1982) 529–542. [12] L. Vaš, ∗–Clean rings; some clean and almost clean Baer ∗–rings and von Neumann algebras, J. Algebra 324(12) (2010) 3388–3400. 164 http://www.ams.org/mathscinet-getitem?mr=704940 http://www.ams.org/mathscinet-getitem?mr=704940 http://dx.doi.org/10.1016/j.jalgebra.2010.10.011 http://dx.doi.org/10.1016/j.jalgebra.2010.10.011 Introduction Characterization theorems *-Boolean like rings Submaximal ideals and *-Boolean rings References