Next Article in Journal
Wave Scattering through Step Down Cascading Junctions
Previous Article in Journal
A New RP1PR Type Coupling for Shafts with Crossed Axes
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Co-EP-Ness and EP-Ness Involving the Inverse along an Element

1
College of Basic Science, Zhejiang Shuren University, Hangzhou 310015, China
2
Faculty of Sciences and Mathematics, University of Niš, P.O. Box 224, 18000 Niš, Serbia
3
School of Mathematics, Hefei University of Technology, Hefei 230009, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(9), 2026; https://doi.org/10.3390/math11092026
Submission received: 24 February 2023 / Revised: 11 April 2023 / Accepted: 23 April 2023 / Published: 24 April 2023
(This article belongs to the Section Algebra, Geometry and Topology)

Abstract

:
Let a , d be two elements in rings and a d be the inverse of a along d. When a d exists, we obtain several characterizations for the invertibility of a a d a d a , which is related to the invertibility of elements expressed by certain functions of a , d and suitable elements from the center of the ring. On the other hand, some equivalent conditions for the equality a a d = a d a , as the complement of the previous invertibility in some sense, are given by means of the group inverses and the ring units, respectively. Then, the results obtained are applied in a -ring, namely, when d = a , the co-EP and EP properties are deduced correspondingly.
MSC:
15A09; 16W10; 16N20; 16B99

1. Introduction

Throughout this paper, R denotes an associative ring with unity 1, and N means the set of all positive integers. Denote by C ( R ) the center of R, that is, the set of such elements that commute with all elements of R. The right and left annihilator of a R are defined by a 0 = { x R | a x = 0 } and 0 a = { x R | x a = 0 } , respectively. An involution ∗: RR is an anti-isomorphism: ( a ) = a , ( a + b ) = a + b and ( a b ) = b a for all a , b R . We call R a ∗-ring if there exists an involution ∗ on R. In a ∗-ring R, an element a R is left (resp. right) ∗-cancelable if a a x = a a y (resp. x a a = y a a ) implies a x = a y (resp. x a = y a ). Then, a R is ∗-cancelable if it is both left and right ∗-cancelable.
For the readers’ convenience, we first recall the definitions of some types of generalized inverses. An element a R is said to be Moore–Penrose invertible with respect to the involution ∗ [1] if the following equations
( 1 ) a x a = a , ( 2 ) x a x = x , ( 3 ) ( a x ) = a x , ( 4 ) ( x a ) = x a
have a common solution. Such solution is unique if it exists, and is denoted by a . An element a is regular if there exists x satisfying the Equation (1), such particular solution x is denoted by a . If x R satisfies both Equations (1) and (3), then x is called a { 1 , 3 } -inverse of a and denoted by a ( 1 , 3 ) . The set of all { 1 , 3 } -invertible elements of R is denoted by R { 1 , 3 } . Similarly, if x R satisfies both Equations (1) and (4), then x is called a { 1 , 4 } -inverse of a and denoted by a ( 1 , 4 ) . The set of all { 1 , 4 } -invertible elements of R is denoted by R { 1 , 4 } . As is well known, if a R is Moore–Penrose invertible, then a is ∗-cancelable [2].
The Drazin inverse [3] of a R is the element x R which satisfies
x a x = x , a x = x a and a k = a k + 1 x , for some k N .
The element x is unique if it exists and is denoted by a D . Particularly, if aa D a = a , then the Drazin inverse a D is called the group inverse of a, and it is denoted by a # .
In 2011, Mary [4] defined a new generalized inverse, called the inverse along an element in a ring or semigroup, which covers the usual concept of unit and the above classic generalized inverses. The element a R is said to be invertible along d R [4] if there exists b R such that
b a d = d = d a b ,   b R d R   and   R b R d
i.e.,
b a b = b ,   b R = d R   and   R b = R d .
If such b exists, then it is unique and is said to be the inverse of a along d, which is denoted by a d . In particular, a 1 = a 1 , a a = a # and a a = a . Moreover, if a a d a = a , then we say that a d is an inner inverse of a along d, and a is inner invertible along d.
The symbols R d , R d , R , R # , R 1 and R mean the sets of all invertible along d, inner invertible along d, Moore–Penrose invertible, group invertible, invertible and regular elements of the ring R, respectively.
This whole story began with the notion of EP matrix A C n × n [5], that is R ( A ) = R ( A ) , i.e., A A = A A , where R ( A ) denotes the column space of A. This was followed by further research in different settings, such as complex matrices, operators on a Hilbert space, C -algebras and ∗-rings. In a ∗-ring R, naturally, an element a R is said to be an EP element if a R and a a = a a . We use R EP to stand for the sets of all EP elements of R. Koliha and Patrício [2] proved that a R EP if and only if a R # and a a # = ( a a # ) . Later, Patrício and Puystjens [6] deduced that a R EP if and only if ( a R # and a R = a R ) if and only if ( a R and a R = a R ). In [7], Mosić and Djordjević characterized the EP element by a R # R and a # n = a n , where n N . More results about this topic can be found in [8,9].
Based on the EP matrix, another class of matrices called co-EP was introduced by Benítez and Rakočević [10]. A square matrix A is said to be co-EP if A A A A is invertible. In some sense, the class of co-EP matrices is the complement of the class of EP matrices. It is interesting that if A is a co-EP matrix, then
A A , A A + A A and A A + A A ,
are all nonsingular matrices [10]. In 2021, Zuo, Baksalary and Cvetković-Ilić [11] proved that for a , b , c C and a b 0 , the following matrices
a A + b A + c A A , a A + b A + c A A and a A A + b A A + c A ( A ) 2 A ,
are also nonsingular matrices, under the condition that A is a co-EP matrix. Recently, for a , b , c , d , λ , μ , ξ , η C , a b c d and μ ξ 0 , the invertibility of the following linear combinations
a A + b A + c A A + d A A and λ A + μ A A + ξ A A + η A ( A ) 2 A ,
was proved, when A is a co-EP matrix [12]. For the ∗-ring case, Benítez, Liu and Rakočević [13] studied some characterizations for the co-EP element, namely a R and a a a a is invertible. In addition, they investigated more general cases, that is, the invertibility of a b b a , where a b a = a and b a b = b . This invertibility was also considered in [12]. More results about co-EP properties can be seen in [8,10,14,15,16,17].
As we all know that the Moore–Penrose inverse belongs to the inverse along an element, in this paper, we consider generalizations of the co-EP and EP properties by means of the inverse along an element in two directions. One is the characterizations for the invertibility of a a d a d a , when a R d . We show that this invertibility can imply the invertibility of λ 1 a d + λ 2 d a + λ 3 a d 2 a + λ 4 d a 2 d , where λ i C ( R ) , i = 1 , 4 ¯ . Furthermore, when a R d , the invertibility of a a d a d a is related to that of δ 1 a + δ 2 d + δ 3 a d + δ 4 d a , where δ i C ( R ) , i = 1 , 4 ¯ . In particular, when both a and d are idempotents, such invertibility is also investigated. The other is the characterizations for the equality a a d = a d a , when d R a . Some equivalent conditions for a a d = a d a are given by means of the group inverses and the ring units, respectively. As applications, some existence criteria of co-EP and EP elements are directly obtained.

2. Preliminaries

In this section, we start with some existence criteria for the inverse along an element.
Lemma 1
([18] Theorem 2.1). Let  a , d R . Then, the following statements are equivalent:
(i)
a R d .
(ii)
d R d a R and d a R # .
(iii)
R d R a d and a d R # .
In this case,  a d = d ( a d ) # = ( d a ) # d .
Lemma 2
([18] Theorem 2.2). Let  a , d R . Then,  a R d  if and only if  R d = R d a d  and  d R = d a d R .
Applying Lemmas 1 and 2, we obtain
Lemma 3.
Let  a , d R . Then, the following statements are equivalent:
(i)
a R d .
(ii)
d R a .
(iii)
a R d and d R a .
In this case,  a a d = d a d  and  a d a = d d a .
Proof. 
(i) ⇔ (ii). Suppose that a R d . Applying Lemma 1, we obtain
a = a a d a = a ( d a ) # d a = ( a d a ) ( d a ) # 3 d ( a d a ) a d a R R a d a .
Hence, by Lemma 2, we obtain d R a and d a = a ( d a ) # = ( a d ) # a . In addition, we conclude a a d = a ( d a ) # d = d a d and a d a = d ( a d ) # a = d d a . Then, d d a d = a d a d = d , so d R a .
(i) ⇒ (iii) is trivial by the implication (i) ⇒ (ii).
(iii) ⇒ (i). Using the hypotheses, we obtain a a d a = a ( d a ) # d a = d a d a = a . Hence, a R d . □
Remark that a R d does not imply d R a in general. For example, let R = C 2 × 2 , d = 0 and a = 0 1 0 0 , clearly a R d , but d R a . The next lemma gives some equivalent conditions for the invertibility of the difference of idempotents, which plays an important role in the sequel.
Lemma 4
([13] Theorem 1 and [19] Theorem 3.2). Let   f , g R  be idempotents. Then, the following statements are equivalent:
(i)
f g R 1 .
(ii)
f R g R = R and R f R g = R .
(iii)
There exist idempotents h , k R such that f h = h , h f = f , g ( 1 h ) = 1 h , ( 1 h ) g = g , k f = k , f k = f , ( 1 k ) g = 1 k and g ( 1 k ) = g .
(iv)
1 f g R 1 and f + g f g R 1 .
(v)
f + g f g R 1 , f R g R = { 0 } and f 0 + g 0 = R .
As an application of Lemma 4, we obtain the following result.
Lemma 5.
Let a , d R be such that a R d . If a a d a d a R 1 , then there exist idempotents h , k R satisfying
a a d h = h ,   h a d = a d ( i . e . , h a a d = a a d ) , a d a ( 1 h ) = 1 h ,   h d = 0 ( i . e . , h a d a = 0 ) , a n d ( ) k a a d = k ,   d k = d ( i . e . , a a d k = a a d ) ,   ( 1 k ) a d a = 1 k ,   d a k = 0 ( i . e . , a d a k = 0 ) .
Proof. 
Since a d a a d = a d , we have that both a a d and a d a are idempotents. By Lemma 4 (i) and (iii), there exist idempotents h , k R such that
a a d h = h ,   h a a d = a a d ,   a d a ( 1 h ) = 1 h ,   h a d a = 0 ,
and
k a a d = k ,   a a d k = a a d ,   ( 1 k ) a d a = 1 k ,   a d a k = 0 .
Note that a d a d = d = d a a d . So, we get h a d = h a a d a d = a a d a d = a d and h d = h a d a d = 0 . Similarly, we have d k = d and d a k = 0 . □
Lemma 6.
(Jacobson’s lemma) Let  a , b R . Then,  1 a b R 1  if and only if  1 b a R 1 .
Lemma 7
([20] Theorem 1). Let  a R . Then  a R #  if and only if  a a 2 R R a 2 . In this case, if  a = a 2 x = y a 2 , then  a # = a x 2 = y 2 a = y a x .
Lemma 8
([21] p. 201). Let R be a ∗-ring and  a R . Then,
(i)
a R { 1 , 3 } if and only if a = x a a for some x R . In this case, x is a { 1 , 3 } -inverse of a.
(ii)
a R { 1 , 4 } if and only if a = a a y for some x R . In this case, y is a { 1 , 4 } -inverse of a.
Let R co EP stand for the set of all co-EP elements of R. Recall that the Jacobson radical of R is defined by
J ( R ) = { a R | 1 + a x R 1 , f o r a n y x R } .
Note that J ( R ) is a two-sided ideal and R ¯ : = R / J ( R ) is a quotient ring. For a R and A R , we use a ¯ and A ¯ to denote the element a + J ( R ) and the set { a ¯ | a A } , respectively. Then, from ([22] Lemma 2.1), we can see that a R 1 if and only if a ¯ R ¯ 1 . Given a R , it is clear that a R ¯ = a ¯ R ¯ . If R is a ∗-ring R, then a J ( R ) if and only if a J ( R ) .

3. Characterizations for the Invertibility of aa d a d a

The theme of this section is to focus on the equivalent conditions for the invertibility of a a d a d a under different conditions in rings, which extend the properties of co-EP elements. In particular, we find that this invertibility is related to the invertibility of the ring element expressed by certain functions of a , d and suitable elements from the center of the ring. In addition, some examples are given to illustrate our results.
Now, we present the main result of this section as follows.
Theorem 1.
Let a , d R be such that a R d . Then, the following statements are equivalent:
(i)
a a d a d a R 1 .
(ii)
a d R d R = R and R d a R d = R .
(iii)
a d R + d R = R , R d a + R d = R , 0 ( a d ) + 0 d = R and ( d a ) 0 + d 0 = R .
(iv)
r = λ 1 a d + λ 2 d a + λ 3 a d 2 a + λ 4 d a 2 d R 1 and one of the following conditions holds:
( 1 )
a d R d R J ( R ) and R d a R d J ( R ) ,
( 2 )
There exist h , k R such that h a d = a d , h d J ( R ) , d k = d and d a k J ( R ) ,
( 3 )
d = λ 1 d r 1 a d = λ 2 d a r 1 d , λ 1 λ 2 d a r 1 a d = λ 4 d a 2 d and λ 1 λ 2 d r 1 d = λ 3 d 2 ,
( 4 )
1 a a d 2 a R 1 ,
where λ i C ( R ) ( i 1 , 4 ¯ ) , λ 1 λ 2 R 1 and λ 3 λ 4 a 0 .
(v)
r = λ 1 a d + λ 2 d a + λ 3 a d 2 a + λ 4 d a 2 d R and
a d R d R = { 0 } , R d a R d = { 0 } , 0 ( a d ) 0 d = { 0 } , ( d a ) 0 d 0 = { 0 } .
where λ i C ( R ) ( i 1 , 4 ¯ ) , λ 1 λ 2 R 1 and λ 3 λ 4 a 0 .
Proof. 
(i) ⇔ (ii). Applying the definition of the inverse along an element, we have
a a d R = a d R ,   a d a R = d R ,   R a a d = R d   and   R a d a = R d a .
Then, in view of Lemma 4 (i) and (ii), we deduce the equivalence of (i) and (ii).
(i) ⇒ (iii). By the equivalence (i) ⇔ (ii), we only need to show 0 ( a d ) + 0 d = R and ( d a ) 0 + d 0 = R . Lemma 4 (i) and (v) ensures a a d 0 + a d a 0 = R . Note that a d a 0 = ( d a ) 0 and a a d 0 = d 0 , which gives ( d a ) 0 + d 0 = R . The proof of 0 ( a d ) + 0 d = R goes similarly.
(iii) ⇒ (ii). Since 0 ( a d ) + 0 d = R , we obtain 1 = p + q , where p 0 ( a d ) and q 0 d . Setting s a d R d R . Then, s = a d t 1 = d t 2 , for t 1 , t 2 R . Therefore, s = 1 s = ( p + q ) s = p a d t 1 + q d t 2 = 0 , which implies a d R d R = { 0 } , so a d R d R = R . Similarly, R d a R d = R .
(i) ⇒ (iv). Suppose that aa d a d a R 1 . Because of Lemma 5, there exist idempotents h , k R satisfying (∗). Now, let
r = λ 1 ( 1 k ) ( d a ) # ( 1 h ) + λ 2 k ( a d ) # h λ 3 k ( 1 h ) λ 4 ( 1 k ) h .
Observe that a d = d ( a d ) # = ( d a ) # d and λ i C ( R ) ( i 1 , 4 ¯ ) , λ 3 λ 4 a 0 . Combining all these, we deduce that
r r = λ 1 a d + λ 2 d a + λ 3 a d 2 a + λ 4 d a 2 d · λ 1 ( 1 k ) ( d a ) # ( 1 h ) + λ 2 k ( a d ) # h λ 3 k ( 1 h ) λ 4 ( 1 k ) h = λ 1 λ 2 a d ( a d ) # h λ 1 λ 3 a d ( 1 h ) + λ 1 λ 2 d a ( d a ) # ( 1 h ) λ 2 λ 4 d a h + λ 1 λ 3 a d 2 a ( d a ) # ( 1 h ) + λ 2 λ 4 d a 2 d ( a d ) # h = λ 1 λ 2 a a d h λ 1 λ 3 a d ( 1 h ) + λ 1 λ 2 a d a ( 1 h ) λ 2 λ 4 d a h + λ 1 λ 3 a d a d a ( 1 h ) + λ 2 λ 4 d a 2 a d h = λ 1 λ 2
and
r r = λ 1 ( 1 k ) ( d a ) # ( 1 h ) + λ 2 k ( a d ) # h λ 3 k ( 1 h ) λ 4 ( 1 k ) h · λ 1 a d + λ 2 d a + λ 3 a d 2 a + λ 4 d a 2 d = λ 1 λ 2 ( 1 k ) ( d a ) # d a + λ 1 λ 4 ( 1 k ) ( d a ) # d a 2 d + λ 1 λ 2 k ( a d ) # a d + λ 2 λ 3 k ( a d ) # a d 2 a λ 3 λ 2 k d a λ 1 λ 4 ( 1 k ) a d = λ 1 λ 2 ( 1 k ) a d a + λ 1 λ 4 ( 1 k ) a d a 2 d + λ 1 λ 2 k a a d + λ 2 λ 3 k a a d d a λ 3 λ 2 k d a λ 1 λ 4 ( 1 k ) a d = λ 1 λ 2 .
Recall that λ 1 λ 2 R 1 . Thus, r R 1 with r 1 = ( λ 1 λ 2 ) 1 r . By using the expression of r 1 , it is not difficult to check that item (3) holds. By reason of the equivalence (i) ⇔ (ii), we conclude that item (1) is true. In addition, it follows from Lemma 4 (i) and (iv) that 1 a ( a d ) 2 a R 1 .
(iv) ⇒ (i) Firstly, suppose that r R 1 and item (1) holds. Let f = a a d and g = a d a . In order to prove f g R 1 , it suffices to show f ¯ g ¯ R ¯ 1 . Note that r ¯ R ¯ 1 . So, we claim
1 ¯ = r ¯ · r ¯ 1 = a d ¯ λ 1 ¯ + λ 3 d a ¯ r ¯ 1 + d ¯ λ 2 a ¯ + λ 4 a 2 d ¯ r ¯ 1 ,
which gives that a d ¯ R ¯ + d ¯ R ¯ = R ¯ . Let x ¯ a d ¯ R ¯ d ¯ R ¯ . Then, x ¯ = a d u ¯ = d v ¯ for suitable u , v R . So, j : = a d u d v J ( R ) , which implies
a d u d v = 1 · j = r r 1 j = a d ( λ 1 + λ 3 d a ) r 1 j + d ( λ 2 a + λ 4 a 2 d ) r 1 j .
Thus,
j : = a d u ( λ 1 + λ 3 d a ) r 1 j = d ( v + ( λ 2 a + λ 4 a 2 d ) r 1 j ) a d R d R J ( R ) .
Hence,
a d u = j + a d ( λ 1 + λ 3 d a ) r 1 j J ( R ) ,
which leads to x ¯ = a d u ¯ = 0 ¯ . Hence, we deduce a d ¯ R ¯ d ¯ R ¯ = { 0 ¯ } , which implies a d ¯ R ¯ d ¯ R ¯ = R ¯ . Note that a d R = f R and d R = g R . Therefore, f ¯ R ¯ g R ¯ = R ¯ . A similar argument yields R ¯ f ¯ R g ¯ = R ¯ . Applying Lemma 4 (i) and (ii), we obtain f ¯ g ¯ R ¯ 1 , as required.
Secondly, suppose that r R 1 and item (2) holds. By what we saw above, the condition r R 1 implies a d R ¯ + d R ¯ = R ¯ and R d a ¯ + R d ¯ = R ¯ . So, it only remains to verify that a d R ¯ d R ¯ = { 0 ¯ } and R d a ¯ R d ¯ = { 0 ¯ } . Let y ¯ a d ¯ R ¯ d ¯ R ¯ . So, y ¯ = a d h 1 ¯ = d h 2 ¯ , where h 1 , h 2 R . Then, applying item (2), we obtain y ¯ = h a d h 1 ¯ = h d h 2 ¯ = 0 ¯ , which gives a d ¯ R ¯ d R ¯ = { 0 ¯ } . Similarly, R d a ¯ R d ¯ = { 0 ¯ } .
Thirdly, suppose that r R 1 and item (3) holds. Let
h = ( λ 1 a d + λ 3 a d 2 a ) r 1   and   k = r 1 ( λ 1 a d + λ 4 d a 2 d ) .
By the hypotheses, we obtain
h a d = ( λ 1 a d + λ 3 a d 2 a ) r 1 a d = λ 1 a d r 1 a d ( λ 1 λ 2 ) 1 λ 3 λ 4 a d 2 a 2 d = a d
and
h d = λ 1 a d + λ 3 a d 2 a r 1 d = r λ 2 d a λ 4 d a 2 d r 1 d = d λ 2 d a r 1 d λ 4 d a 2 d r 1 d = ( λ 1 λ 2 ) 1 λ 3 λ 4 d a 2 d 2 = 0 J ( R ) .
Similarly, we have d k = d and d a k J ( R ) , which means that h , k satisfy item (2). This proves that item (i) holds.
Fourthly, suppose that r R 1 and item (4) holds. By the invertibility of r, we conclude that a d R + d R = R . If z a d R d R , then we get z = a d w 1 = d w 2 , for w 1 , w 2 R . Thus, we have
1 a a d 2 a z = z a a d 2 a z = z a a d 2 a d w 2 = z a a d d w 2 = z a a d z = z a a d a d w 1 = z a d w 1 = 0 .
Applying 1 a ( a d ) 2 a R 1 , we obtain z = 0 and so a d R d R = { 0 } . Therefore, a d R d R = R . Moreover, R d a R d = R can be obtained similarly. The statement a a d a d a R 1 now follows immediately from the equivalence (i) ⇔ (ii).
(i) ⇒ (v). By the equivalences of (i), (ii) and (iv), it therefore suffices to verify 0 ( a d ) 0 d = { 0 } and d 0 ( d a ) 0 = { 0 } . Let m 0 ( a d ) 0 d , keeping in mind that a d R + d R = R . So, a d l 1 + d l 2 = 1 for l 1 , l 2 R . Then, m = m 1 = m a d l 1 + m d l 2 = 0 , which gives that 0 ( a d ) 0 d = { 0 } . Similarly, we obtain ( d a ) 0 d 0 = { 0 } .
(v) ⇒ (i). First, we show that r 0 = { 0 } . For any n r 0 , we have
0 = r n = λ 1 a d n + λ 2 d a n + λ 3 a d 2 a n + λ 4 d a 2 d n ,
which implies
λ 2 d a n + λ 4 d a 2 d n = a d ( λ 1 n λ 3 d a n ) a d R d R = { 0 } .
So, λ 2 d a n + λ 4 d a 2 d n = 0 = λ 1 a d n λ 3 a d 2 a n . Multiplying the equality λ 2 d a n + λ 4 d a 2 d n = 0 by λ 3 from the left, we obtain λ 2 λ 3 d a n = 0 , i.e., λ 3 d a n = 0 . Thus, λ 1 a d n = λ 3 a d 2 a n = 0 , i.e., a d n = 0 . Consequently, d n = a d a d n = 0 and d a n = λ 2 1 λ 4 d a 2 d n = 0 . Therefore, n d 0 ( d a ) 0 = { 0 } , which means n = 0 ; then, r 0 = { 0 } . Since r R , there exists r R such that r ( 1 r r ) = 0 , Hence, we conclude r r = 1 . Analogously, r r = 1 , and thus r R 1 . Applying the implication (iv) ⇒ (i), which has been proved before, we claim that item (i) holds. □
Remark 1.
(a) The following example shows that the implication (i) ⇒ (iv) in Theorem 1 does not hold in general if one of the assumptions, λ 1 λ 2 R 1 or λ 3 λ 4 a 0 , is dropped. For example, setting R = C 2 × 2 and choosing a = 1 1 1 0 , d = 1 0 0 0 R . Then, we deduce that a d = d and a a d a d a = 0 1 1 0 R 1 . ( 1 ) Let λ 1 = λ 2 = I , λ 3 = I a n d λ 4 = 1 2 I , where I is the identity matrix. Obviously, λ 1 λ 2 R 1 . However, we have r = 0 0 0 1 R 1 . ( 2 ) Let λ 1 = λ 2 = λ 3 = λ 4 = 0 . Clearly, λ 3 λ 4 a 0 . However, r = 0 R 1 .
( b ) When a R d , the invertibility of a a d a d a can also imply the invertibility of s; here,
s = μ 1 a d + μ 2 a d a + μ 3 a d a d a + μ 4 a d a 2 d ,
where  μ i C ( R )   ( i 1 , 4 ¯ ) ,  μ 1 μ 2 R 1  and  μ 3 μ 4 a 0 , as well as the invertibility of t. Here
t = ξ 1 a a d + ξ 2 a d a + ξ 3 a a d 2 a + ξ 4 a d a 2 a d ,
where  ξ i C ( R ) ( i 1 , 4 ¯ ) ,  ξ 1 ξ 2 R 1  and  ξ 3 ξ 4 a 0 . Indeed, let  h , k  be defined as in Lemma 5, then we can directly check that
s 1 = ( μ 1 μ 2 ) 1 μ 1 ( 1 k ) ( 1 h ) + μ 2 k ( a d ) # h μ 3 k ( 1 h ) μ 4 ( 1 k ) h
and
t 1 = ( ξ 1 ξ 2 ) 1 ξ 1 ( 1 k ) ( 1 h ) + ξ 2 k h ξ 3 k ( 1 h ) ξ 4 ( 1 k ) h .
If we replace the condition a R d with a R d in Theorem 1, then we further obtain the following result, which can be proved by using the same strategy as the proof of Theorem 1. Here, we give a simple proof for it.
Theorem 2.
Let a , d R be such that a R d . Then, the following statements are equivalent:
(i)
a a d a d a R 1 .
(ii)
d d a d a d R 1 .
(iii)
a R d R = R and R a R d = R .
(iv)
a R + d R = R , R a + R d = R , 0 a + 0 d = R and a 0 + d 0 = R .
(v)
One of the following conditions holds:
(1)
m = δ 1 a + δ 2 d + δ 3 a d + δ 4 d a R 1 , where δ i C ( R ) ( i 1 , 4 ¯ ) , δ 1 δ 2 R 1 , δ 3 δ 4 a 0 ;
(2)
n = γ 1 a + γ 2 a d + γ 3 d a + γ 4 a d 2 a R 1 , where γ i C ( R ) ( i 1 , 4 ¯ ) , γ 2 γ 3 R 1 ;
and one of the following conditions holds:
(1′)
a R d R J ( R ) and R a R d J ( R ) ;
(2′)
There exist h , k R such that h a = a , h d J ( R ) , d k = d and a k J ( R ) .
(vi)
One of the following conditions holds:
( 1 )
m = δ 1 a + δ 2 d + δ 3 a d + δ 4 d a R , where δ i C ( R ) ( i 1 , 4 ¯ ) , δ 1 δ 2 R 1 , δ 3 δ 4 a 0 ;
( 2 )
n = γ 1 a + γ 2 a d + γ 3 d a + γ 4 a d 2 a R , where γ i C ( R ) ( i 1 , 4 ¯ ) , γ 2 γ 3 R 1 ,
and the following condition holds:
a R d R = { 0 } ,   R a R d = { 0 } ,   0 a 0 d = { 0 } ,   a 0 d 0 = { 0 } .
Proof. 
(i) ⇔ (ii) follows directly by Lemma 3.
(i) ⇔ (iii) ⇔ (iv). Since a R d , we have a = a a d a = a d ( a d ) # a = a d ( ( a d ) # ) 2 a d a . Hence, a d R = a R , R d a = R a , 0 ( a d ) = 0 a and ( d a ) 0 = a 0 , which leads to the equivalences of (i), (iii) and (iv) by Theorem 1 (i)–(iii).
(i) ⇒ (v). As in the proof of Theorem 1, by a a d a d a R 1 , it follows that there exist idempotents h , k R satisfying (∗). Moreover,
h a = h a a d a = ( h a d ) ( a d ) # a = a d ( a d ) # a = a a d a = a
and
a k = a a d a k = a ( d a ) # ( d a k ) = 0 .
Hence, item (2′) holds. Note that a d R = a R and R d a = R a . Then, by Theorem 1 (i) and (iv), we obtain that item (1′) is true.
Next, by a direct computation, we conclude that m , n R 1 and
m 1 = ( δ 1 δ 2 ) 1 δ 1 k a ( d a ) # ( 1 h ) + δ 2 ( 1 k ) a d h δ 3 ( 1 k ) ( 1 h ) δ 4 k h ,
n 1 = ( γ 2 γ 3 ) 1 γ 1 k d a a d d a ( 1 h ) + γ 2 ( 1 k ) ( d a ) # ( 1 h ) + γ 3 k ( a d ) # h γ 4 k ( 1 h ) .
(v) ⇒ (i). Assume that item (v) holds. Setting f = a a d and g = a d a . Similar to the proof of Theorem 1 (iv) ⇒ (i), we obtain a R ¯ d R ¯ = R ¯ . Note that a R = f R and d R = g R . Hence, f ¯ R ¯ g R ¯ = R ¯ . On the other hand, R ¯ f ¯ R g ¯ = R ¯ . So, a a d a d a R 1 .
(i) ⇔ (vi). We check this part in a manner analogous to Theorem 1 (i) ⇔ (v). □
In Theorem 2, the condition a R d cannot be replaced by a R d in general. The following example illustrates that under the condition a R d , item (i) holds, but item (v) fails to hold.
Example 1.
Let R = C 2 × 2 . Choose a = 0 1 1 0 a n d d = 0 1 0 0 . Then, we can check that a d = d and a a d a d a = 1 0 0 1 R 1 . However, a + d = a + a d R 1 and a + a d d a R 1 .
Let us mention that a R if and only if a R a , if and only if a R a . Thus, on the basis of Theorems 1 and 2, we obtain some new results about the characterizations of co-EP elements as follows.
Corollary 1.
Let R be a ∗-ring and a R . Then, the following statements are equivalent:
(i)
a R c o EP .
(ii)
a R + a R = R and 0 a + 0 ( a ) = R .
(iii)
One of the following conditions holds:
( 1 )
λ 1 a a + λ 2 a a + λ 3 a ( a ) 2 a + λ 4 a a 2 a R 1 , where λ i C ( R ) ( i 1 , 4 ¯ ) , λ 1 λ 2 R 1 , λ 3 λ 4 a 0 ;
( 2 )
δ 1 a + δ 2 a + δ 3 a a + δ 4 a a R 1 , where δ i C ( R ) ( i 1 , 4 ¯ ) , δ 1 δ 2 R 1 , δ 3 δ 4 a 0 ;
( 3 )
γ 1 a + γ 2 a a + γ 3 a a + γ 4 a ( a ) 2 a R 1 , where γ i C ( R ) ( i 1 , 4 ¯ ) , γ 2 γ 3 R 1 ,
and one of the following conditions holds:
( 1 )
a R a R J ( R ) ;
( 2 )
There exists h R such that h a = a and h a J ( R ) .
(iv)
One of the following conditions holds:
( 1 )
λ 1 a a + λ 2 a a + λ 3 a ( a ) 2 a + λ 4 a a 2 a R , where λ i C ( R ) ( i 1 , 4 ¯ ) , λ 1 λ 2 R 1 , λ 3 λ 4 a 0 ;
( 2 )
δ 1 a + δ 2 a + δ 3 a a + δ 4 a a R , where δ i C ( R ) ( i 1 , 4 ¯ ) , δ 1 δ 2 R 1 , δ 3 δ 4 a 0 ;
( 3 )
γ 1 a + γ 2 a a + γ 3 a a + γ 4 a ( a ) 2 a R , where γ i C ( R ) ( i 1 , 4 ¯ ) , γ 2 γ 3 R 1 ,
and a R a R = { 0 } , 0 a 0 ( a ) = { 0 } .
Proof. 
Taking d = a in Theorems 1 and 2, we deduce that Corollary 1 holds by the following facts:
  • a R = a a R and R a = R a a because of a R ([2] Theorem 5.4).
  • 0 ( a a ) = 0 a and ( a a ) 0 = a 0 , because a is ∗-cancelable.
  • The next equivalences are obvious by taking the involution:
    (a)
    0 a + 0 a = R a 0 + ( a ) 0 = R .
    (b)
    0 a 0 ( a ) = { 0 } a 0 ( a ) 0 = { 0 } .
    (c)
    a R + a R = R R a + R a = R .
    (d)
    a R a R = { 0 } R a R a = { 0 } .
    (e)
    a R a R J ( R ) R a R a J ( R ) .
  • Let h R be such that h a = a and h a J ( R ) . Then, the element k : = h satisfies a k = a and a a k J ( R ) , owing to ( a a h J ( R ) h a a J ( R ) h a = h a a a J ( R ) ) and ( a h = a h a = a ).
In what follows, we further discuss some equivalent conditions for the invertibility of a a d a d a , when both a and d are idempotents. By R idem , we denote the set of all idempotents in R.
Theorem 3.
Let a , d R idem . Then, the following statements are equivalent:
(i)
a R d and a a d a d a R 1 .
(ii)
d R a and d d a d a d R 1 .
(iii)
For λ i C ( R ) ( i 1 , 4 ¯ ) such that λ 1 λ 2 R 1 , λ 3 λ 4 a 0 and i = 1 4 λ i = 0 , we have
r = λ 1 a d + λ 2 d a + λ 3 a d a + λ 4 d a d R 1 .
(iv)
For δ i C ( R ) ( i 1 , 4 ¯ ) such that δ 1 δ 2 R 1 , δ 3 δ 4 a 0 and i = 1 4 δ i = 0 , we have
a R d and m = δ 1 a + δ 2 d + δ 3 a d + δ 4 d a R 1 .
(v)
For γ i C ( R ) ( i 1 , 4 ¯ ) such that γ 2 γ 3 R 1 and i = 1 4 γ i = 0 , we have
a R d and n = γ 1 a + γ 2 a d + γ 3 d a + γ 4 a d a R 1 .
Proof. 
(i) ⇒ (iii) follows directly from Theorem 1.
(iii) ⇒ (i). According to the hypotheses, we have
a = a r r 1 = ( λ 1 a d + λ 2 a d a + λ 3 a d a + λ 4 a d a d ) r 1 a d R
and
d = d r r 1 = ( λ 1 d a d + λ 2 d a + λ 3 d a d a + λ 4 d a d ) r 1 d a R ,
which implies that d d a d R . Similarly, d R d a d . Then, Lemma 2 quickly leads to a R d .
By Theorem 1 (i) and (iv), it remains to show a d R d R J ( R ) and R d a R d J ( R ) . Let x a d R d R . So, x = a d u = d v for u , v R . Since a , d R idem , we have a x = a a d u = a d u = x = d v = d ( d v ) = d x , which gives that
x = r 1 λ 1 a d + λ 2 d a + λ 3 a d a + λ 4 d a d x = r 1 i = 1 4 λ i x = 0 .
Thus, a d R d R = { 0 } J ( R ) . Similarly, R d a R d J ( R ) , as required.
(ii) ⇔ (iii) can be obtained by the equivalence (i) ⇔ (iii) and the symmetry of a , d .
(i) ⇔ (iv). Suppose that item (i) holds. So, using the equivalence (i) ⇔ (ii), we obtain d R a . This proves a R d by Lemma 3. We can now make use of Theorem 2 (i) and (v) to show that item (iv) holds.
Conversely, as in the proof of the implication (iii) ⇒ (i), we deduce that a R d R J ( R ) and R a R d J ( R ) . Applying Theorem 2 (i) and (v) again, we obtain a a d a d a R 1 .
(i) ⇔ (v) can be proved following similar steps to those in the proof of the equivalence (i) ⇔ (iv). □
In the light of Theorem 3, we derive
Corollary 2.
Let a , d R idem . Then, the following statements are equivalent:
(i)
a R d and a a d a d a R 1 .
(ii)
d R a and d d a d a d R 1 .
(iii)
a d d a R 1 .
(iv)
a R d and a d R 1 .
(v)
a R d and 2 a a d d a R 1 .
In general, the idempotence of d in Corollary 2 cannot be dropped, as is shown by the next example.
Example 2.
In the ring R = M 2 ( Z 4 ) , let
a = 1 0 0 0 a n d d = 2 1 1 0 .
Clearly, a = a 2 and a d d a R 1 . Therefore, a and d satisfy item ( i i i ) of Corollary 2. However, a d R # , which means a R d . Hence, item ( i ) does not hold.
In the same way, the idempotence of a in Corollary 2 cannot be deleted, either. This can be seen from the following example.
Example 3.
In the ring R = M 2 ( Z 2 ) , let
a = 0 1 1 1 a n d d = 1 0 1 0 .
Obviously, d = d 2 , a d = d and a a d a d a R 1 . So, a and d satisfy item ( i ) of Corollary 2. However, d R a . Thus, item ( i i ) does not hold.
We close this section by considering two classes of special idempotents.
Remark 2.
Let R be a ring. For x , y R , consider the following idempotents in M 2 ( R ) ,
a = 1 x 0 0 a n d d = 0 0 y 1 .
Then, we have the following fact:
a R d   and   a a d a d a R 1 y x   R 1   and   x ( y x ) 1 ( y x ) 2 y R 1 .
Indeed, by Lemma 2, we obtain that  a R d  if and only if  y x R 1 . In this case, we have
a d = 0 0 ( y x ) 1 y ( y x ) 1 a n d a a d a d a = x ( y x ) 1 y x ( y x ) 1 ( y x ) 1 y 1 .
Clearly, a a d a d a R 1 if and only if x ( y x ) 1 y · ( 1 ) x ( y x ) 1 · ( y x ) 1 y R 1 . Furthermore, if R is a commutative ring, then
a R d and a a d a d a R 1 x y , 1 x y R 1 a R d and a + d R 1 .
From Remark 1 (b), we see that the element d can be replaced by a d , which motivates us to consider the same properties between d and a d , as follows.
Theorem 4.
Let  a , d R  be such that  a R d  (R is a ∗-ring in (ii)–(iv)). Then, we have the following:
(i)
d R # if and only if a d R # . In this case, ( a d ) # = d # d a d d # .
(ii)
d R { 1 , 3 } if and only if a d R { 1 , 3 } . In this case, a d d ( 1 , 3 ) is a { 1 , 3 } -inverse of a d .
(iii)
d R { 1 , 4 } if and only if a d R { 1 , 4 } . In this case, d ( 1 , 4 ) d a is a { 1 , 4 } -inverse of a d .
(iv)
d R if and only if a d R . In this case, ( a d ) = d d a d d .
Proof. 
(i). Assume that d R # . Since a R d , we obtain
a d = d ( a d ) # = d # d d ( a d ) # = d # d a d = d # d a ( a d ) 2 R ( a d ) 2 .
Dually, a d = ( a d ) 2 a d d # ( a d ) 2 R . So, a d R # and ( a d ) # = d # d a d d # by Lemma 7.
Conversely, if a d R # , then
d = d a a d = d a a d a d ( a d ) # = d a d ( a d ) # = d 2 ( a d ) # ( a d ) # d 2 R .
On the other hand, we can infer that d R d 2 . Hence, d R # .
(ii). Assume that d R { 1 , 3 } . Then, it is clear that
a d = d ( a d ) # = d d ( 1 , 3 ) d ( a d ) # = d d ( 1 , 3 ) a d = d ( 1 , 3 ) d a d = d ( 1 , 3 ) a d a d a d = d ( 1 , 3 ) d a a d a d = d d ( 1 , 3 ) a ( a d ) a d .
Hence, from Lemma 8 (i), it follows that a d R { 1 , 3 } and a d d ( 1 , 3 ) is a { 1 , 3 } -inverse of a d .
Now, let a d R { 1 , 3 } . Then,
d = a d a d = a d a d ( 1 , 3 ) a d a d = a d ( a d ) ( 1 , 3 ) d = ( a d ) ( 1 , 3 ) a d d = ( a d ) ( 1 , 3 ) d ( a d ) # d = ( a d ) ( 1 , 3 ) ( a d ) # d d = ( a d ) # ( a d ) ( 1 , 3 ) d d .
Hence, d R { 1 , 3 } .
(iii). This can be obtained in the same way as the proof of item (ii).
(iv). Note that a d R if and only if a d R { 1 , 3 } R { 1 , 4 } . Then, applying items (ii) and (iii), together with ( a d ) = ( a d ) ( 1 , 4 ) a d ( a d ) ( 1 , 3 ) , we claim that item (iv) holds. □

4. Characterizations for the Equality aa d = a d a

Given a , d R , if a R d and a a d = a d a , then a d is called the commutative inverse of a along d [23]. Benítez and Boasso took advantage of the group invertibility to characterize the commutative inverse along an element and obtained some equivalent conditions for this inverse under the condition a R d . Recently, Wang, Mosić and Yao [24] also studied this topic. In this section, we continue to consider it under the new hypothesis d R a .
We start this part with two useful lemmas on which we rely.
Lemma 9
([23] Theorems 7.1 and 7.3). Let a , d R be such that a R d . Then, the following statements are equivalent:
(i)
a a d = a d a .
(ii)
d R # and a d d # = d d # a .
(iii)
d a R d and a d d R .
Lemma 10.
Let  a , d R  be such that  d R a . Then, the following statements are equivalent:
(i)
a R d and a a d = a d a .
(ii)
a R = d R and R a = R d .
(iii)
d R # , a R d R and R a = R d .
(iv)
a R d , a R d R and R a R d .
Proof. 
By the condition d R a , it follows that a = a d a t 1 and a = t 2 a d a for suitable t 1 , t 2 R . Moreover, we obtain a d R # and d a R # .
(i) ⇒ (ii). Suppose that a R d and a a d = a d a . Then, by Lemma 3, we deduce a = a d a 2 = d d a a d R and d = a d a d = a a d d a R . Hence, a R = d R . By a symmetric argument, we have R a = R d .
(ii) ⇒ (iii). By a R = d R , we have d = a u for some u R . Then, multiplying the equality a = t 2 a d a by u from the right side, we obtain d = t 2 a d 2 R d 2 . Similarly, using R a = R d , we deduce that d d 2 R . So, in view of Lemma 7, we obtain d R # .
(iii) ⇒ (iv). We only need to show that a R d . Note that d = v a , where v R . Hence,
d = d # d d = d # v a d = d # v a d a t 1 d = d # d d a t 1 d = d a t 1 d d a R .
By Lemma 1 (i) and (ii), we obtain a R d .
(iv) ⇒ (i). Applying the hypotheses a R d R and R a R d , we directly obtain d a R d and a d d R . In the light of Lemma 9 (i) and (iii), we claim that item (i) holds. □
Next, we present an existence criterion for the commutative inverse along an element, which covers the related EP properties.
Theorem 5.
Let  a , d R  be such that  d R a  and  k N ,  m N { 0 } . Then, the following statements are equivalent:
(i)
a R d and a a d = a d a .
(ii)
a , d R # and a a # = d d # .
(iii)
a R d R # and ( a d ) k = a # k .
(iv)
a R d , d ( a d ) m R # and d ( a d ) m # = d a ( a d d a ) m .
Proof. 
(i) ⇒ (ii), (iii) and (iv). Suppose that a R d and a a d = a d a . By Lemma 3, we have d d a = d a d . Lemma 9 now yields a , d R # , d a R d and a d d R . So, d a = s d , for s R . Then, d a d d # = s d d d # = s d = d a . Hence, a d a = ( d a ) # d a = ( d a ) # d a d d # = a d a d d # = d d # . Similarly, d a d = a a # , i.e., a a d = a a # . Therefore, a a # = d d # . Moreover, a d = a d a a d = a d a a # = d # d a # = a # a a # = a # , and correspondingly, d a = d # . Let x = d a ( a d d a ) m . Then,
d ( a d ) m x = d ( a d ) m d a ( a d d a ) m = d ( a d ) m d # a # d # m = d ( a d ) m 1 a ( d d # ) a # d # a # d # m 1 = d ( a d ) m 1 a a a # a # d # a # d # m 1 = d ( a d ) m 1 a a # d # a # d # m 1 = d ( a d ) m 1 d # a # d # m 1 = d d # .
In the same manner, we obtain x d ( a d ) m = d # d , which gives d ( a d ) m x = x d ( a d ) m . Moreover, we conclude x d ( a d ) m x = d # d d # a # d # m = d # a # d # m = x and d ( a d ) m x d ( a d ) m = d d # d ( a d ) m = d ( a d ) m . So, d ( a d ) m R # and d ( a d ) m # = x .
(ii) ⇒ (i). By the hypotheses, we obtain a = a a # a = d d # a d R and d = d d # d = a a # d a R , which show that a R = d R . Similarly, we have R a = R d . Applying Lemma 10 (i) and (ii), we obtain a R d and a a d = a d a .
(iii) ⇒ (i). It is clear that a = a k + 1 ( a # ) k = a k + 1 ( a d ) k 1 ( d a ) # d R d , which yields R a R d . On the other hand, we have a R d R . From Lemma 10 (i) and (iv), it follows that item (i) holds.
(iv) ⇒ (i). Note that d a d a = a = a d d a and a d a d = d = d a a d . So, we have
d ( a d ) m d ( a d ) m # = d ( a d ) m d a ( a d d a ) m = d ( a d ) m 1 ( a d d a ) a d d a ( a d d a ) m 1 = d ( a d ) m 1 ( a a d ) d a ( a d d a ) m 1 = d ( a d ) m 1 ( d a d d a ) ( a d d a ) m 1 = d ( a d ) m 1 d a ( a d d a ) m 1 = d d a .
Similarly, we have d ( a d ) m # d ( a d ) m = d a d . Hence, a a d = d a d = d d a = a d a . □
In a ∗-ring, it is clear that a R if and only if a R a . Applying Theorem 5, we obtain the following well-known results (see [2] [Theorem 7.3] and [7] [Theorem 2.1]).
Corollary 3.
Let  a R  and  k N ,  m N { 0 } . Then, the following statements are equivalent:
(i)
a R EP .
(ii)
a R # and a a # = ( a a # ) .
(iii)
a R # and a k = a # k .
(iv)
a ( a a ) m R EP .
Proof. 
Let d = a in Theorem 5. Then, the equivalences of (i), (ii) and (iii) are straightforward. So, we only need to show that (i) ⇔ (iv). Since a R , we can directly check a ( a a ) m = ( a ) a ( a ) m . Hence,
a R EP a ( a a ) m R # a n d a ( a a ) m # = ( a ) a ( a ) m a ( a a ) m R # R a n d a ( a a ) m # = a ( a a ) m a ( a a ) m R EP .
The second characterization of the commutative inverse along an element is given in terms of the ring units as follows.
Theorem 6.
Let  a , d R  be such that  d R a  and  k N . Then, the following statements are equivalent:
(i)
a R d and a a d = a d a .
(ii)
There exist u , v R 1 such that d = a k u = v a k .
(iii)
There exist u , v R 1 such that ( d a ) k = u d and ( a d ) k = d v .
(iv)
There exist p R and q R 1 such that p a = a p = p d = d p = 0 and a k = p + q .
Proof. 
(i) ⇒ (ii) and (iii). By Theorem 5 (i) and (ii), we have a , d R # and a a # = d d # . Let u = ( a # ) k d + 1 d d # and v = d ( a # ) k + 1 d d # . Then, we can verify that
u ( d # a k + 1 d d # ) = 1 = ( d # a k + 1 d d # ) u .
Hence, u R 1 , which gives that v R 1 by Lemma 6. Moreover, it is obvious that d = a k u = v a k .
Similarly, let u = ( d a ) k d # + 1 d d # and v = d # ( a d ) k + 1 d d # . Then, such u and v satisfy item (iii).
(ii) ⇒ (i). By the hypotheses, we obtain a a d a R = a k + 1 u a R a 2 R . On the other hand, a R a 2 . So, a R # . Hence, a = a k a # k 1 = d u 1 a # k 1 d R , together with d = a k u a R , yields a R = d R . Similarly, R a = R d . In view of Lemma 10 (i) and (ii), we infer that item (i) holds.
(iii) ⇒ (i). Clearly, we have a a d a R = ( a d ) k ( a d ) # k 1 a R = d v ( a d ) # k 1 a R d R and d = ( a d ) k v 1 a R . Hence, a R = d R . Dually, R a = R d , as desired.
(i) ⇒ (iv). Recall that a , d R # and a a # = d d # . In view of ([25] Corollary 2.10), we obtain q : = a k + 1 a a # R 1 . Let p = a a # 1 . Then, p a = a p = p d = d p = 0 and a k = p + q .
(iv) ⇒ (i). Note that a q = q a and a = a q q 1 = a ( a k p ) q 1 = a k + 1 q 1 a 2 R R a 2 . Then, a R # and a # = a 2 k 1 q 2 = q 2 a 2 k 1 . In addition, we deduce that
q 2 d a 2 k = ( a k p ) 2 d a 2 k = a 2 k d a 2 k = a 2 k d ( a k p ) 2 = a 2 k d q 2 .
Hence, we have
d a a # = q 2 q 2 d a 2 k q 2 = q 2 a 2 k d q 2 q 2 = q 2 a 2 k d = a # a d ,
which implies d d a = d a d by Lemma 9 (i) and (ii). Since d = q 1 q d = q 1 ( p + q ) d = q 1 a k d , we conclude R d R a d . Hence, by Lemma 1, we have a R d . So, a a d = a d a . □

Author Contributions

Investigation, H.Z. (Huihui Zhu); Writing—original draft, H.Z. (Honglin Zou); Writing—review & editing, conceptualization, methodology, validation, formal analysis, D.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by Key Laboratory of Applied Mathematics of Fujian Province University (Putian University) (No. SX202202), China Postdoctoral Science Foundation (No. 2020M671281), the National Natural Science Foundation of China (No. 11871145), the Ministry of Education, Science and Technological Development, Republic of Serbia, grant number 451-03-47/2023-01/200124, and the project “Linear operators: invertibility, spectra and operator equations” supported by the Branch of SANU in Niš, grant number O-30-22.

Conflicts of Interest

No potential conflict of interest was reported by the author.

References

  1. Penrose, R. A generalized inverse for matrices. Proc. Camb. Philos. Soc. 1955, 51, 406–413. [Google Scholar] [CrossRef]
  2. Koliha, J.J.; Patrício, P. Elements of rings with equal spectral idempotents. J. Austral. Math. Soc. 2002, 72, 137–152. [Google Scholar] [CrossRef]
  3. Drazin, M.P. Pseudo-inverses in associative rings and semigroups. Amer. Math. Mon. 1958, 65, 506–514. [Google Scholar] [CrossRef]
  4. Mary, X. On generalized inverses and Green’s relations. Linear Algebra Appl. 2011, 434, 1836–1844. [Google Scholar] [CrossRef]
  5. Schwerdtfeger, H. Introduction to Linear Algebra and the Theory of Matrices; P. Noordhoff: Groningen, The Netherlands, 1950. [Google Scholar]
  6. Patrício, P.; Puystjens, R. Drazin-Moore-Penrose invertiblity in rings. Linear Algebra Appl. 2004, 389, 159–173. [Google Scholar] [CrossRef]
  7. Mosić, D.; Djordjević, D.S. New characterizations of EP, generalized normal and generalized Hermitian elements in rings. Appl. Math. Comput. 2012, 218, 6702–6710. [Google Scholar] [CrossRef]
  8. Karanasios, S. EP elements in rings and in semigroups with involution and in C-algebras. Serdica Math. J. 2015, 41, 83–116. [Google Scholar]
  9. Mosić, D. Generalized Inverses; Faculty of Sciences and Mathematics, University of Niš: Niš, Serbia, 2018. [Google Scholar]
  10. Benítez, J.; Rakoćević, V. Matrices A such that AAAA are nonsingular. Appl. Math. Comput. 2010, 217, 3493–3503. [Google Scholar] [CrossRef]
  11. Zuo, K.Z.; Baksalary, O.M.; Cvetković-Ilić, D.S. Further characterizations of the co-EP matrices. Linear Algebra Appl. 2021, 616, 66–83. [Google Scholar] [CrossRef]
  12. Zou, H.L.; Cvetković-Ilić, D.S.; Zuo, K.Z. A generalization of the co-EP property. Comm. Algebra 2022, 50, 3364–3378. [Google Scholar] [CrossRef]
  13. Benítez, J.; Liu, X.J.; Rakoćević, V. Invertibility in rings of the commutator abba, where aba = a and bab = b. Linear Multilinear Algebra 2012, 60, 449–463. [Google Scholar] [CrossRef]
  14. Benítez, J. Moore-Penrose inverses and commuting elements of C-algebras. J. Math. Anal. Appl. 2008, 345, 766–770. [Google Scholar] [CrossRef]
  15. Benítez, J.; Rakoćević, V. Invertibility of the commutator of an element in a C-algebra and its Moore-Penrose inverse. Stud. Math. 2010, 200, 163–174. [Google Scholar] [CrossRef]
  16. Benítez, J.; Rakoćević, V. Canonical angles and limits of sequences of EP and co-EP matrices. Appl. Math. Comput. 2012, 218, 8503–8512. [Google Scholar] [CrossRef]
  17. Mosić, D.; Li, T.T.; Chen, J.L. Core inverse in Banach algebras. Banach J. Math. Anal. 2020, 14, 399–412. [Google Scholar] [CrossRef]
  18. Mary, X.; Patrício, P. Generalized inverses modulo H in semigroups and rings. Linear Multilinear Algebra 2013, 61, 1130–1135. [Google Scholar] [CrossRef]
  19. Koliha, J.J.; Rakoćević, V. Invertibility of the difference of idempotents. Linear Multilinear Algebra 2003, 51, 97–110. [Google Scholar] [CrossRef]
  20. Hartwig, R.E.; Luh, J. A note on the group structure of unit regular ring elements. Pac. J. Math. 1977, 71, 449–461. [Google Scholar] [CrossRef]
  21. Hartwig, R.E. Block generalized inverses, Arch, Ration. Mech. Anal. 1976, 61, 197–251. [Google Scholar] [CrossRef]
  22. Chen, J.L.; Zhu, Z.Q.; Shi, G.Q. The pseudo Drazin inverses in Banach algebras. Commun. Math. Res. 2021, 37, 484–495. [Google Scholar] [CrossRef]
  23. Benítez, J.; Boasso, E. The inverse along an element in rings. Electron. J. Linear Algebra 2016, 31, 572–592. [Google Scholar] [CrossRef]
  24. Wang, L.; Mosić, D.; Yao, H. The commuting inverse along an element in semigroups. Comm. Algebra 2022, 50, 433–443. [Google Scholar] [CrossRef]
  25. Chen, J.L.; Zou, H.L.; Zhu, H.H.; Patrício, P. The one-sided inverse along an element in semigroups and rings. Mediterr. J. Math. 2017, 14, 208. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zou, H.; Mosić, D.; Zhu, H. Co-EP-Ness and EP-Ness Involving the Inverse along an Element. Mathematics 2023, 11, 2026. https://doi.org/10.3390/math11092026

AMA Style

Zou H, Mosić D, Zhu H. Co-EP-Ness and EP-Ness Involving the Inverse along an Element. Mathematics. 2023; 11(9):2026. https://doi.org/10.3390/math11092026

Chicago/Turabian Style

Zou, Honglin, Dijana Mosić, and Huihui Zhu. 2023. "Co-EP-Ness and EP-Ness Involving the Inverse along an Element" Mathematics 11, no. 9: 2026. https://doi.org/10.3390/math11092026

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop