Preprint
Article

This version is not peer-reviewed.

Generalized Right e-Core Inverse in Banach *-Algebras

Submitted:

03 July 2025

Posted:

07 July 2025

You are already at the latest version

Abstract
In this paper, we introduce the concept of the generalized right weighted core inverse within the framework of a Banach *-algebra. We provide a characterization of this novel generalized inverse based on a unique type of decomposition that involves right weighted core-inverses and quasinilpotent elements. The relationships between the right weighted core inverse and the right g-Drazin inverse of an element in a Banach *-algebra are explored. We also establish representations for the generalized right weighted core inverse. As an application, we demonstrate new characteristics of the pseudo right $e$-core inverse and $\tiny\textcircled{m}$-core-EP inverse in Minkowski spaces.
Keywords: 
;  ;  ;  ;  

1. Introduction

An involution of a Banach algebra A is an anti-automorphism whose square is the identity map 1. A Banach algebra A with involution * is called a Banach *-algebra. Let A be a Banach *-algebra with an identity. An element a A has core inverse if there exists some x A such that
a x 2 = x , ( a x ) * = a x , x a 2 = a .
If such x exists, it is unique, and denote it by a # . An element a A has core-EP inverse (i.e., pseudo core inverse) if there exist x A and k N such that
a x 2 = x , ( a x ) * = a x , x a k + 1 = a k .
If such x exists, it is unique, and denote it by a D . Core and core-EP inverses are extensively studied by many authors from different views, e.g., [1,6,8,10,11,16,17,18,19,24,28,29,31].
Wang et al. generalized the core inverse to the right core inverse (see [27]). An element a A has right core inverse if there exist x A such that
a x 2 = x , ( a x ) * = a x , a x a = a .
If such x exists, it is unique, and denote it by a r # . In [3], the authors introduced and studied generalized right core inverse. An element a A has generalized right core decomposition there exist unique a x A such that
a x 2 = x , ( a x ) * = a x , lim n | | a n a x a n | | 1 n = 0 .
The preceding x is called generalized right core inverse of a and we denote it by a r d . We refer the reader more properties of right core and generalized right core inverses in [3,7,27].
Mosić et al. introduced and studied weighted core inverse (see [21]). Let a A and e A is an invertible Hermitian element (i.e., e is invertible and e * = e ). An element a A has e-core inverse if there exist x A and k N such that
a x 2 = x , ( e a x ) * = e a x , x a 2 = a .
If such x exists, it is unique, and denote it by a e , # . As a natural generalization of weighted core and core-EP inverses, the authors introduced and studied generalized weighted core inverse in a Banach *-algebra. An element a A has generalized e-core decomposition if there exists x A such that
x = a x 2 , ( e a x ) * = e a x , lim n | | a n x a n + 1 | | 1 n = 0 .
The preceding x is called generalized e-core inverse of a and we denote it by a e , d . We refer the reader for weighted core and generalized weight core inverses in [2,9,13,14,20,32].
Recently, Ke et al. generalized the e-core inverse to the right e-core inverse (see [12]). An element a A has right e-core inverse if there exist x A such that
a x 2 = x , ( e a x ) * = e a x , a x a = a .
If such x exists, it is unique, and denote it by a r e , # . Let A r e , # denote the set of all right e-core invertible elements in A . Here we list some characterizations of right e-core inverse.
Theorem 1.1
(see [12]). Let A be a Banach *-algebra, and let a A . Then the following are equivalent:
(1)
a A r e , # .
(2)
There exists x A such that a x a = a , a x 2 = x = x a x , ( e a x ) * = e a x .
(3)
There exists an idempotent p A such that ( e p ) * = e p , p a = 0 , a + p A r 1 .
(4)
a A e ( 1 , 3 ) and a A = a 2 A .
(5)
A a = A ( a * ) n e a for some n 2 .
The motivation of this paper is to introduce and study a new kind of generalized inverse as a natural generalization of generalized inverses mentioned above. In Section 2, we introduce generalized right weighted core inverse in terms of a new kind of decomposition by using right weighted core-inverses and quasinilpotents. Many new properties of the right weighted (pesudo) core inverse and generalized weighted core inverse are thereby obtained.
Definition 1.2.
An element a A has generalized right e-core decomposition if there exist x , y A such that
a = x + y , x * e y = y x = 0 , x A r e , # , y A q n i l .
Let
A q n i l = { x A lim n x n 1 n = 0 } .
Evidently, x A q n i l if and only if 1 + λ x A is invertible for any λ C . We prove that a A has generalized right e-core decomposition if and only if there exists unique x A such that
x = a x 2 , ( e a x ) * = e a x , lim n | | a n a x a n | | 1 n = 0 .
The polar-like properties of generalized right weighted core inverses are established.
In Section 3, we establish characterizations between generalized right weighted core inverse and right g-Drazin inverse for an element in a Banach *-algebra by using involved images. We prove that a A r e , d if and only if a has right g-Drazin inverse x which has right e-core inverse.
In Section 4, we shift our focus to the study of representations for the generalized right weighted core inverse. We explore the generalized right weighted core inverse through an examination of diverse matrix conditions.
An element a in A has pseudo right e-core inverse if there exists x A such that x = a x 2 , ( e a x ) * = e a x , a n = a x a n . Such x is unique, if exists, and denote it by a r e , D . Finally, in Section 5, the pseudo right e-core inverse is characterized by certain new ways. As an application, m -core-EP inverse in Minkowski spaces are studied.
Throughout the paper, all Banach *-algebras are complex with an identity. We use A r 1 , A r d , A r e , # , A r e , D and A r e , d to denote the sets of all right invertible, generalized right core invertible, right e-core invertible, right e-core-EP invertible and generalized right e-core invertible elements in A , respectively. If a and x satisfy the equations a = a x a and ( a x ) * = e a x , then x is called ( 1 , 3 , e ) -inverse of a and is denoted by a e ( 1 , 3 ) . We use A e ( 1 , 3 ) to stand for the set of all ( 1 , 3 , e ) -invertible elements in A .

2. Generalized Right e-Core Decomposition

The aim of this section is to introduce the notion of the generalized weighted core inverse in a Banach *-algebra. We begin with
Theorem 2.1.
Let a A . Then the following are equivalent:
(1)
a A has generalized right e-core decomposition.
(2)
There exists x A such that
x = a x 2 , ( e a x ) * = e a x , lim n | | a n a x a n | | 1 n = 0 .
Proof.  ( 1 ) ( 2 ) By hypothesis, there exist z , y A such that
a = z + y , z * e y = y z = 0 , z A e , # , y A q n i l .
Set x = z e , # . One easily checks that
a x = ( z + y ) z e , # = z z e , # + y z ( z e , # ) 2 = z z e , # , a x 2 = ( z + y ) ( z e , # ) 2 = z ( z e , # ) 2 = z e , # = x , z e , # y = x y = x z x y = x e 1 ( e z x ) y = x e 1 ( e z x ) * y = x e 1 x * ( z * e y ) = 0 .
Now by applying z e , # y = 0 and Theorem 1.1, we deduce that
a x a = ( a x ) a = z z e , # ( z + y ) = z z e , # z = z .
Then
( e a x ) * = ( e z z e , # ) * = e z z e , # = e a x , a ( 1 x a ) = a a x a = a z = y A q n i l .
Since y z = 0 , we see that
( a a x a ) z = ( z + y z ) z = y z = 0 .
Thus we have
| | a n a x a n | | 1 n = | | ( a a x a ) a n 1 | | 1 n = | | ( a a x a ) ( z + y ) n 1 | | 1 n = | | ( a a x a ) y n 1 | | 1 n | | a a x a | | 1 n [ | | y n 1 | | 1 n 1 ] 1 1 n .
Since y A q n i l , we deduce that
lim n | | a n a x a n | | 1 n = 0 ,
as required.
( 2 ) ( 1 ) By hypotheses, we have z A such that
z = a z 2 , ( e a z ) * = e a z , lim n | | a n a z a n | | 1 n = 0 .
For any n N , we have
a z = a ( a z 2 ) = a 2 z 2 = a 2 ( a z 2 ) z = a 3 z 3 = = a n z n .
Hence
| | a z a z a z | | = | | ( a n z n a z a n z n | | = | | ( a n a z a n ) z n | | .
Then
| | a z a z a z | | 1 n | | ( a n a z a n ) | | 1 n | | z | | .
We infer that
lim n | | a z a z a z | | 1 n = 0 ,
hence, a z = a z a z .
Moreover, we check that
( a 2 a z a 2 ) z = ( a 2 a z a 2 ) a z 2 = ( a 2 a z a 2 ) a 2 z 3 = ( a 2 a z a 2 ) a n 2 z n 1 = ( a n a z a n ) z n 1 .
Therefore
| | ( a 2 a z a 2 ) z | | 1 n | | a n a z a n | 1 n | | | z n 1 | | 1 n .
Since
lim n | | a n a z a n | | 1 n = 0 ,
we prove that
lim n | | ( a 2 a z a 2 ) z | | 1 n = 0 .
This implies that ( a 2 a z a 2 ) z = 0 . That is, a ( a z a 2 ) z = 0 .
Set x = a z a and y = a a z a . Then a = x + y . We claim that x has right e-core inverse. Evidently, we verify that
z x z = z a z a z = z a z z , x z 2 = a z a z 2 = ( a z a z ) z = a z 2 = z , ( e x z ) * = ( e a z a z ) * = ( e a z ) * = e a z = e ( a z a ) z = e x z .
Therefore x A r e , # and z = x r e , # .
We verify that
| | ( a z a 2 ) n + 2 | | 1 n + 2 = | | ( 1 z a ) a ( a z a 2 ) n ( a z a 2 ) | | 1 n + 2 = | | ( 1 z a ) a ( a z a 2 ) n 1 ( a z a 2 ) a | | 1 n + 2 = | | ( 1 z a ) a ( a z a 2 ) n 1 a 2 | | 1 n + 2 = | | ( 1 z a ) a ( a z a 2 ) a n | | 1 n + 2 | | 1 z a | | 1 n + 2 | | a n + 2 a z a n + 2 | | 1 n + 2 | | a n | | 1 n + 2 .
Accordingly,
lim n | | a n + 2 a z a n + 2 | | 1 n + 2 = 0 .
This implies that a z a 2 A q n i l . By using Cline’s formula (see [15], Theorem 2.1), y = a a z a A q n i l .
Moreover, we see that
x * e y = ( a z a ) * e ( 1 a z ) a = a * ( a z ) * e * ( 1 a z ) a = a * ( e a z ) * ( 1 a z ) a = 0 , = a * ( e a z ) ( 1 a z ) a = 0 , y x = ( a a z a ) a z a = a ( a z a 2 ) z a = 0 .
Then we have a generalized right e-core decomposition a = x + y , thus yielding the result. □
We denote x in Theorem 2.1 by a r e , d , and call it a generalized right e-core inverse of a. As an immediate consequence, we derive
Corollary 2.2.
Let a A . Then the following are equivalent:
(1)
a A has generalized right core decomposition.
(2)
There exists x A such that
x = a x 2 , ( a x ) * = a x , lim n | | a n a x a n | | 1 n = 0 .
Theorem 2.3.
Let a = x + y be the generalized right e-core decomposition of a A . Then a r e , d = x r e , # .
Proof. 
Let a = x + y be the generalized right e-core decomposition of a A . Analogously to the proof of Theorem 2.1, x r e , # is the generalized right e-core inverse of a. This completes the proof. □
Corollary 2.4.
Let a A . Then a A e , d if and only if a A r e , d A d .
Proof. 
This is obvious by Theorem 2.3 and [4], Theorem 2.5 □
Let C n × n be the Banach algebra of all n × n complex matrices, with conjugate transpose as the involution. For a complex A C n × n , it follows by Theorem 2.3 that the pseudo core inverse and generalized right core inverse coincide with each other for a complex matrix, i.e., A D = A r 1 , d .
Next, we present a polar-like property for the generalized right e-core inverse in a Banach *-algebra and establish its related characterizations.
Theorem 2.5.
Let a A and n N . Then the following are equivalent:
(1)
a A r e , d .
(2)
There exists an idempotent p A such that
a n + p A r 1 , ( e p ) * = e p , a p A q n i l , ( 1 p ) A = a ( 1 p ) A .
Proof.  ( 1 ) ( 2 ) Since a A r e , d , by virtue of Theorem 2.1, there exist x , y A such that
a = x + y , x * e y = y x = 0 , x A r e , # , y A q n i l .
In view of Theorem 1.1, we have
x r e , # = x ( x r e , # ) 2 = x r e , # x x r e , # , ( e x x r e , # ) * = e x x r e , # , x = x x r e , # x .
Let p = 1 x x r e , # . Then p 2 = p , ( e p ) * = e p and p x = 0 . We directly check that
[ x n + 1 x x r e , # ] [ ( x r e , # ) n + 1 x x r e , # ] = x x r e , # + x n ( 1 x x r e , # ) + 1 x x r e , # = 1 + x n ( 1 x x r e , # ) A 1 .
Let q = [ ( x r e , # ) n + 1 x x r e , # ] [ 1 + x n ( 1 x x r e , # ) ] 1 . Then ( x n + p ) q = 1 . We further verify that
1 + y q i = 1 n x n i y i 1 = 1 + [ y ( x r e , # ) n + y y x x r e , # ] [ 1 + x n ( 1 x x r e , # ) ] 1 i = 1 n x n i y i 1 = 1 + y [ 1 + x n ( 1 x x r e , # ) ] i = 1 n x n i y i 1 = 1 + y i = 1 n x n i y i 1 = 1 + y n A 1 .
By using Cline’s formula (see [15], Theorem 2.1), 1 + q i = 1 n x n i y i A 1 . Accordingly, we derive that
p a = p ( x + y ) = p y = ( 1 x x r e , # ) y = y e 1 ( e x x r e , # ) y = y e 1 ( e x x r e , # ) * y = y e 1 ( x r e , # ) * ( x * e y ) = y A q n i l , p a ( 1 p ) = y x x r e , # = 0 , a n + p = ( x + y ) n + p = x n + i = 1 n x n i y i + p = [ x n + p ] + i = 1 n x n i y i = [ x n + p ] [ 1 + q i = 1 n x n i y i ] A r 1 .
Moreover, we see that 1 p = x x r e , # = [ ( x + y ) x x r e , # ] x r e , # a ( 1 p ) A . On the other hand, a ( 1 p ) = ( 1 p ) a ( 1 p ) ( 1 p ) A . Then
( 1 p ) A = a ( 1 p ) A .
( 2 ) ( 1 ) By hypothesis, there exists an idempotent p A such that
a n + p A r 1 , ( e p ) * = e p , a p A q n i l , ( 1 p ) A = a ( 1 p ) A .
Set x = ( 1 p ) a and y = p a . Then
x * e y = [ a * ( 1 p ) * ] e p a = [ a * ( 1 p ) * ] ( e p ) * a = a * [ ( 1 p ) * p * ] e * a * = 0 , y x = p a ( 1 p ) a = 0 , y = p a A q n i l .
Write ( a n + p ) q = 1 for some q A . Then ( 1 p ) a n q = ( 1 p ) ( a n + p ) q = 1 p . Set z = a n 1 q . Then ( 1 p ) a z ( 1 p ) a = ( 1 p ) a and [ ( 1 p ) a z ] * = ( 1 p ) * = 1 p = ( 1 p ) a z . This implies that ( 1 p ) a A e ( 1 , 3 ) .
Since ( 1 p ) A = a ( 1 p ) A , we have p a ( 1 p ) = 0 . Write 1 p = a ( 1 p ) r for some r A . Then 1 p = ( 1 p ) a ( 1 p ) r ; hence,
1 p = ( 1 p ) [ a ( 1 p ) r ] = ( 1 p ) a [ ( 1 p ) r ] = [ ( 1 p ) a ] [ ( 1 p ) a ( 1 p ) r ] r [ ( 1 p ) a ] 2 A .
Then we have ( 1 p ) a A = [ ( 1 p ) a ] 2 A . According to Theorem 1.1, ( 1 p ) a A r e , # . That is, x A r e , # . Therefore a A r e , d . □
Corollary 2.6.
Every power of a generalized right core invertible element in a Banach *-algebra is the sum of two invertible and a right invertible elements.
Proof. 
Let a A r e , d and n N . In view of Theorem 2.5, we can find p 2 = p A such that u : = a n + p A r 1 . Then a n = u p . Obviously, we have p = 1 2 p 2 1 2 and 1 2 p 2 2 = 1 4 . Then
1 2 p 2 1 = 2 ( 1 2 p ) .
Accordingly, a n = u + 1 2 p 2 1 2 , as desired. □
Corollary 2.7.
Let a A and n N . Then the following are equivalent:
(1)
a A r e , d .
(2)
a n A r e , d .
In this case, a e , d = a n 1 ( a n ) r e , d .
Proof.  ( 1 ) ( 2 ) In light of Theorem 2.5, there exists an idempotent p A such that
a n + p A r 1 , ( e p ) * = e p , a p A q n i l , ( 1 p ) A = a ( 1 p ) A .
By virtue of Cline’s formula, p a p A q n i l . Hence ( p a p ) n A q n i l . Clearly, p a ( 1 p ) = 0 , and so p a = p a p . This implies that p a n = ( p a p ) n A q n i l . By using Cline’s formula again, a n p A q n i l . Since a n ( 1 p ) = ( 1 p ) a n ( 1 p ) ( 1 p ) A and 1 p a ( 1 p ) A a n ( 1 p ) A , we deduce that ( 1 p ) A = a n ( 1 p ) A . By using Theorem 1.1, a n A r e , d .
( 2 ) ( 1 ) Let x = a n 1 ( a n ) r e , d . Then we directly verify that
a x = a ( a n 1 ( a n ) r e , d ) = a n ( a n ) r e , d , a x 2 = [ a n ( a n ) r e , d ] a n 1 ( a n ) r e , d = x , ( e a x ) * = ( a n ( a n ) r e , d ) * = a n ( a n ) r e , d = e a x , | | a m a x a m | | 1 m | | ( 1 a n ( a n ) r e , d ) a m | | 1 m | .
For any m n k , we see that
| | a m a x a m | | 1 m | | ( 1 a n ( a n ) r e , d ) ( a n ) k | | 1 m = 0 .
Since lim k | | ( 1 a n ( a n ) r e , d ) ( a n ) k | | 1 k = 0 , we derive that
lim m | | a m a x a m | | 1 m = 0 .
Therefore a e , d = a n 1 ( a n ) r e , d .
We are now ready to prove:
Theorem 2.8.
Let a A . Then the following are equivalent:
(1)
a A r e , d .
(2)
There exists b A such that
b a b = b , ( e a b ) * = e a b , a b a A = a 2 b a A , a a 2 b A q n i l .
Proof.  ( 1 ) ( 2 ) By hypothesis, there exist x , y A such that
a = x + y , x * e y = y x = 0 , x A r e , # , y A q n i l .
It is easy to verify that
x r e , # y = x r e , # x x r e , # y = [ x r e , # ] e 1 [ e x x r e , # ] y = [ x r e , # e 1 ] ( e x x r e , # ) * y = [ x r e , # e 1 ] ( x r e , # ) * ( x * e y ) = 0 .
Set b = x r e , # . Then a b = ( x + y ) x r e , # = x x r e , # + y x ( x r e , # ) 2 = x x r e , # . Hence, ( e a b ) * = ( e x x r e , # ) * = e x x r e , # = e a b . We easily verify that
a b 2 = ( a b ) b = ( x x r e , # ) x r e , # = x r e , # = b , b ( 1 a b ) = x r e , # [ 1 x x r # ] = 0 , a a 2 b = a ( 1 a b ) = a ( 1 x x # ) .
Thus b = b a b , and so a b 2 = b a b .
Moreover, we see that
a b a = ( x x r e , # ) ( x + y ) = x x r e , # x = x ; a 2 b a = a ( a b a ) = ( x + y ) x = x 2 .
Since x A r e , # , it follows by Theorem 1.1 that x A = x 2 A . Thus, a b a A = a 2 b a A . Since ( 1 x x # ) a = ( 1 x x # ) ( x + y ) = y A q n i l , by using Cline’s formula, a a 2 b = a ( 1 x x # ) A q n i l .
( 2 ) ( 1 ) By hypothesis, there exists b A such that
b a b = b , ( e a b ) * = e a b , a b a A = a 2 b a A , a a 2 b A q n i l .
Let x = a b a and y = a a b a . Then
a = x + y , x * e y = ( a b a ) * e * ( a a b a ) = a * ( e a b ) * ( 1 a b ) a = a * e a b ( 1 a b ) a = 0 , y x = ( a a b a ) a b a = ( 1 a b ) a 2 b a = ( 1 a b ) a b a r = 0 f o r a r A .
Since a a 2 b A q n i l . By using Cline’s formula, we have y = ( 1 a b ) a A q n i l . Clearly, we have x b = ( a b a ) b = a ( b a b ) = a b , and so x b x = a b ( a b a ) = a ( b a b ) a = a b a = x and ( e x b ) * = ( e a b ) * = e a b = e x b . This implies that x A e ( 1 , 3 ) . We easily verify that
a b a = a b a b a a b a 2 b a A = ( a b a ) 2 A .
Hence, x A = x 2 A . In view of Theorem 1.1, x A r e , # . Therefore a A r e , d . □
Corollary 2.9.
Let a A . Then the following are equivalent:
(1)
a A r e , d .
(2)
There exists b A such that
b a b = b = a b 2 , ( e a b ) * = e a b , a b a A = a 2 b a A , a a 2 b A q n i l .
Proof.  ( 1 ) ( 2 ) Construct x , y and a , b as in the proof of Theorem 2.8, we have
b a b = b , ( e a b ) * = e a b , a b a A = a 2 b a A , a a 2 b A q n i l .
Moreover, we verify that
a b = ( x + y ) x r e , # = x x r e , # + y x ( x r e , # ) 2 = x x r e , # , a b 2 = ( a b ) b = ( x x r e , # ) x r e , # = x r e , # = b ,
as desired.
( 2 ) ( 1 ) This is obvious by Theorem Theorem 2.8. □

3. Characterizations by Using Right g-Drazin Inverse

Let a A . Set
{ a r d } = { x A | a x 2 = x , a x a 2 A q n i l } .
We now derive the following.
Theorem 3.1.
Let a A . Then the following are equivalent:
(1)
a A r e , d .
(2)
{ a r d } A r e , # .
In this case, a r e , d = z 2 z r e , # for z { a r d } A r e , # .
Proof.  ( 1 ) ( 2 ) In view of Theorem 2.1, there exist x , y A such that
a = x + y , x * e y = y x = 0 , x A r e , # , y A q n i l .
Let z = x r e , # . Then
Claim 1. z { a r d } . We directly verify that
a z = ( x + y ) x r e , # = ( x + y ) x ( x r e , # ) 2 = x x r e , # , a z 2 = [ x x r e , # ] x r e , # = x ( x r e , # ) 2 = x r e , # = z , a z a = x x r e , # ( x + y ) = x x r e , # x + ( x r e , # ) * ( x * y ) = x x r e , # x + e 1 ( e x x r e , # ) * y = x x r e , # x + e 1 ( x r e , # ) * ( x * e y ) = x , a a z a = a x = y A q n i l .
By using Cline’s formula, we have a z a 2 A q n i l . Therefore z { a r d } .
Claim 2. z A r e , # . We verify that
z [ x 2 z ] = x r e , # [ x 2 x r e , # ] = x x r e , # , z [ x 2 z ] 2 = [ x x r e , # ] ( x 2 z ) = x 2 z , e z ( x 2 z ) * = ( e x x r e , # ) * = e x x r e , # = e z ( x 2 z ) , z ( x 2 z ) z = [ x x r e , # ] x r e , # = x r e , # = z .
Accordingly, z A r e , # and z r e , # = x 2 z . Therefore { a r d } A r e , # .
( 2 ) ( 1 ) Let z { a r d } A r e , # . Then
a z 2 = z , a z a 2 A q n i l .
Set x = z 2 z r e , # . Then we check that
( z z r e , # a ) x = z z r e , # ( a z 2 ) z r e , # = [ z z r e , # ] 2 = z z r e , # ,
hence, we see that
[ e ( z z r e , # a ) x ] * = [ e z z r e , # ] * = e z z r e , # = e ( z z r e , # a ) x , z z r e , # a x 2 = [ z z r e , # ] [ z 2 z r e , # ] = z 2 z r e , # = x , z z r e , # a x z z r e , # a = z z r e , # z z r e , # a = z z r e , # a .
Then z z r e , # a A r e , # and [ z z r e , # a ] r e , # = z 2 z r e , # .
Write a = a 1 + a 2 , where a 1 = z z r e , # a and a 2 = a z z r e , # a . It is easy to verify that
a 2 a 1 = [ a z z r e , # a ] z z r e , # a = a z z r e , # a z z # a z z r e , # a = a z z r e , # a z z # ( a z 2 ) ( z r e , # ) 2 a = a z z r e , # a z z # z ( z r e , # ) 2 a = ( a z 2 ) ( z r e , # ) 2 a z ( z # ) 2 a = 0 , a 1 * a 2 = a * ( z z r e , # ) * [ a z z r e , # a ] = a * ( z z r e , # ) [ a z z r e , # a ] = a * z z r e , # [ 1 z z r e , # ] a = 0 .
Moreover, we check that
[ 1 z z r e , # ] a = [ 1 z z r e , # ] a [ 1 z z r e , # ] z a 2 = [ 1 z z r e , # ] ( a z a 2 ) .
Obviously,
a z = a z z r e , # z = a z 2 ( z r e , # ) 2 z = z ( z r e , # ) 2 z = z r e , # z .
It is easy to verify that
( a z a 2 ) [ 1 z z r e , # ] = a z a 2 ( 1 z a ) ( a z ) z r e , # = a z a 2 ( 1 z a ) ( z r e , # z ) z r e , # = a z a 2 ( 1 z a ) z r e , # = a z a 2 ( 1 z a ) z 2 ( z r e , # ) 3 = a z a 2 [ z r e , # z ( a z 2 ) ( z r e , # ) 3 ] = a z a 2 [ z r e , # z 2 ( z r e , # ) 3 ] = a z a 2 A q n i l .
By using Cline’s formula again,
a 2 = [ 1 z z r e , # ] a = [ 1 z z r e , # ] ( a z a 2 ) A q n i l .
Therefore a = a 1 + a 2 is the generalized right core decomposition of a. Therefore
a r e , d = ( a 1 ) r e , # = z 2 z r e , # ,
as asserted. □
Corollary 3.2.
Let a A . Then the following are equivalent:
(1)
a A e , d .
(2)
a A d and a d A r # .
In this case, a e , d = ( a d ) 2 ( a d ) e , # .
Proof. 
This is obvious by Theorem 3.1 and Corollary 2.4. □
Lemma 3.3.
Let z { a r d } . Then
lim n | | ( a n a z a n ) * | | 1 n = 0 .
Proof. 
Let x = a a z a . Then x A q n i l . For any λ C , we have 1 λ ¯ x A 1 , and so 1 λ x * A 1 . This implies that x * A q n i l . We easily check that
| | ( a n a z a n ) * | | 1 n = | | ( a n ) * ( 1 a z ) * | | = | | ( a n ) * [ ( 1 a z ) n ] * | | = | | [ ( a a z a ) n ] * | | = | | ( x * ) n | | .
Since x * A q n i l , we have
lim n | | ( a n a z a n ) * | | 1 n = 0 .
Lemma 3.4.
Let a A r e , d . Then
lim n | | ( ( a w ) n a w a r e , d w ( a w ) n ) * | | 1 n = 0 .
Proof. 
Construct x , y , z as in the proof of Theorem 2.1. Then
lim n | | ( a n x a n + 1 ) * | | 1 n = lim n | | ( y * ) n | | 1 n = 0 .
Similarly to Corollary 2.2, we check that
| | ( a n a n x n a n ) * | | 1 n ( 1 + | | a * | | | | x * | | ) | | ( a n x a n + 1 ) * | | 1 n .
Therefore
lim n | | ( a n a n ( a r e , d ) n a n ) * | | 1 n = 0 .
In view of Corollary 2.4, we have
lim n | | ( a n a a r e , d a n ) * | | 1 n = 0 ,
as asserted. □
We are ready to prove:
Theorem 3.5.
Let a A . Then a A r e , d if and only if there exist x A and z { a r d } such that
x a x = x = a x 2 , x A = z A , A x = A ( a z ) * e .
In this case, a r e , d = x .
Proof. 
⟹ Choose x = a r e , d . In view of Theorem 1.1, x = x a x = a x 2 . By using Theorem 3.1, we can find z { a r d } A r e , # such that
x = z 2 z r e , # .
Then we have
a z 2 = z , a z a 2 A q n i l .
Obviously, z = z z r e , # z = ( z 2 z r e , # ) z r e , # z = x z r e , # z . Accordingly, we have x A = z A .
Since a x 2 = x , we have a x = a n x n , and then
x = x a x = x e 1 ( e a x ) * = x e 1 ( e a n x n ) * = x e 1 ( x n ) * ( a n ) * e = x e 1 ( x n ) * ( a n a z a n ) * e + x e 1 ( x n ) * ( a n ) * ( a z ) * e = x e 1 ( x n ) * ( a n a z a n ) * e + x e 1 ( a n x n ) * ( a z ) * e = x e 1 ( x n ) * ( a n a z a n ) * e + x e 1 ( a x ) * ( a z ) * e .
Hence,
| | x x e 1 ( a x ) * ( a z ) * e | | 1 n = | | x e 1 ( x n ) * ( a n a z a n ) * e | | 1 n | | x e 1 ( x n ) * | | 1 n | | ( a n a z a n ) * | | 1 n | | e | | 1 n .
In view of Lemma 3.4,
lim n | | ( a n a z a n ) * | | 1 n = 0 ,
we derive that
lim n | | x x e 1 ( a x ) * ( a z ) * e | | 1 n = 0 ;
hence, x = x e 1 ( a x ) * ( a z ) * e . Then A x A ( a z ) * e .
Since a z 2 = z , we have a n z n = a z , and then we derive that
| | ( a z ) * e ( a z ) * e a x | | 1 n = | | ( z n ) * ( e a n ) * ( z n ) * ( e a x a n ) * | | 1 n = | | ( ( z ) n ) * ( a n a x a n ) * e | | 1 n | | ( z n ) * | | 1 n | | ( a n a x a n ) * | | 1 n | | e | | 1 n .
In light of Lemma 3.4, we see that
lim n | | ( a n a x a n ) * | | 1 n = 0 .
Then
lim n | | ( a z ) * e ( a z ) * e a x | | 1 n = 0 ,
and so ( a z ) * e = ( a z ) * e a x . Hence A ( a z ) * e A x . Therefore A x = A ( a z ) * e , as required.
⟸ By hypothesis, there exists x A such that there exist x A and z { a r d } such that
x a x = x = a x 2 , x A = z A , A x = A ( a z ) * e .
We claim that a r e , d = x .
Claim 1.
lim n | | a n a x a n | | 1 n = 0 .
Write z = x y for some y A . For any n N , we have
a n = ( a n a z a n ) + a z a n , a x a n = a x ( a n a z a n ) + a x a z a n = a x ( a n a z a n ) + a ( x a x ) y a n = a x ( a n a z a n ) + ( a x y ) a n = a x ( a n a z a n ) + a z a n .
Hence,
a n a x a n = ( 1 a x ) ( a n a z a n ) ,
and so
| | a n a x a n | | 1 n | | 1 a x | | 1 n | | a n a z a n + 1 | | 1 n ,
we have
lim n | | a n a x a n | | 1 n = 0 .
Claim 2. ( e a x ) * = e a x .
Since A x = A ( a z ) * e , we have x * A = e a z A . Write e a z = x * y for some y A . Since x a x = x , we have x * a * x * = x * , and then ( a x ) * x * = x * . This implies that ( a x ) * e a z = ( a x ) * ( x * y ) = [ ( a x ) * x * ] y = x * y = e a z . Since x A = z A , we can find s A such that x = z s . Then ( a x ) * e ( a x ) = ( a x ) * e a ( z s ) = [ ( a x ) * e a z ] s = ( e a z ) s = e a x . Hence ( e a x ) * = [ ( a x ) * e ( a x ) ] * = ( a x ) * e ( a x ) = e a x .
Therefore a r e , d = x , as asserted. □
Corollary 3.6.
Let a A . Then a has pseudo right e-core inverse if and only if
(1)
a A r e , d ;
(2)
a has right Drazin inverse.
Proof. 
⟹ By virtue of Theorem 2.1, a has generalized right e-core inverse. Therefore a has right Drazin inverse by Theorem 3.5.
⟹ Since a has generalized right e-core inverse, by Theorem 3.5, there exists x A and z A r e , # such that
x a x = x = a x 2 , x A = z A , A x = A ( a z ) * e .
Since a has right Drazin inverse, we have a r d = a r D . Let n = i n d ( a ) . Then a n = a n + 1 a d , a a d = a d a and a d = a ( a d ) 2 . Hence, a d = a n [ ( a d ) n + 1 ] and a n = a d a n + 1 . Then a n A = a d A . On the other hand, we have
( a d ) * = [ ( a d ) n + 1 ] * ( a n ) * , ( a n ) * = ( a n + 1 ) * ( a d ) * .
Therefore A ( a d ) * e = A a n e , and so A x = A ( a n ) * e . This implies that a has pseudo right e-core inverse, as asserted. □

4. Representations of Generalized Right e-Core Inverse

Let T = a c b d A 2 × 2 . Let e A be an Hermitan invertible element and E = d i a g ( e , e ) . Using a similar approach, we now extend the result in Proposition 4.4 of [7] to the right e-core inverse.
Lemma 4.1.
Let s = d b a 1 c A e , # , p = 1 s s r e , # and t = s r e , # + 1 s r e , # s . If v = a + c ( 1 t s ) b a 1 A r 1 , then T M 2 ( A ) = T 2 M 2 ( A ) .
Proof. 
Obviously, we have
T = P A Q , P = 1 0 b a 1 1 , A = a 0 0 s , Q = 1 a 1 c 0 1 .
Since s A r e , # , it follows by Theorem 1.1 that s A e ( 1 , 3 ) . Hence we verify that A E ( 1 , 3 ) = a 1 0 0 s e ( 1 , 3 ) . Set U = A Q P + I 2 A A E ( 1 , 3 ) . Then
U = a + c b a 1 c s b a 1 s + 1 s s e ( 1 , 3 ) .
One easily checks that
( s + 1 s s e ( 1 , 3 ) ) ( s e ( 1 , 3 ) + 1 s s e ( 1 , 3 ) ) = 1 + s ( 1 s s e ( 1 , 3 ) ) = [ 1 s ( 1 s s e ( 1 , 3 ) ) ] 1 .
Then U is right inverse and
U r 1 = v r 1 v r 1 c t t s b a 1 v r 1 t + t s b a 1 v r 1 c t .
Thus, U M 2 ( A ) = M 2 ( A ) . As s A is regular, so is T M 2 ( A ) . In view of [7], T M 2 ( A ) = T 2 M 2 ( A ) , as required. □
Lemma 4.2.
Let s = d b a 1 c A r e , # , p = 1 s s r e , # , t = s r e , # + 1 s r e , # s and e ( b a 1 ) = ( b a 1 ) e . If u = 1 + ( b a 1 ) * p b a 1 A 1 , v = a + c ( 1 t s ) b a 1 A r 1 , then T M 2 ( A ) r E , # . In this case,
T r E , # = β γ δ ϵ ,
where
β = v r 1 u 1 + v r 1 c t s s r e , # b a 1 u 1 , γ = v r 1 u 1 ( b a 1 ) * p v r 1 c t s s r e , # [ 1 b a 1 u 1 ( b a 1 ) * p ] , δ = ( 1 t s ) b a 1 v r 1 u 1 + [ ( 1 t s ) b a 1 v r 1 c 1 ] t s s r e , # b a 1 u 1 , ϵ = ( 1 t s ) b a 1 v r 1 u 1 ( b a 1 ) * p [ ( 1 t s ) b a 1 v r 1 c 1 ] t s s r e , # [ 1 b a 1 u 1 ( b a 1 ) * p ] .
Proof. 
Set
S = α u 1 α u 1 ( b a 1 ) * p a 1 c s r e , # s r e , # b a 1 u 1 s r e , # [ 1 b a 1 u 1 ( b a 1 ) * p ] ,
where α = [ 1 + a 1 c s r e , # b ] a 1 .
Then we verify that
a α u 1 c s r e , # b a 1 u 1 = ( 1 + c s r e , # b a 1 ) u 1 c s r e , # b a 1 u 1 = u 1 ,
a [ α u 1 ( b a 1 ) * p a 1 c s r e , # ] + c s r e , # [ 1 b a 1 u 1 ( b a 1 ) * p ] = ( 1 + c s r e , # b a 1 ) u 1 ( b a 1 ) * p c s r e , # + c s r e , # [ 1 b a 1 u 1 ( b a 1 ) * p ] = ( 1 + c s r e , # b a 1 ) u 1 ( b a 1 ) * p c s r e , # b a 1 u 1 ( b a 1 ) * p = u 1 ( b a 1 ) * p ,
b α u 1 d s r e , # b a 1 u 1 = [ b α a d s r e , # b ] a 1 u 1 = [ b ( 1 + a 1 c s r e , # b ) d s r e , # b ] a 1 u 1 = [ b ( d b a 1 c ) s r e , # b ] a 1 u 1 = p b a 1 u 1
and
b [ α u 1 ( b a 1 ) * p a 1 c s r e , # ] + d s r e , # [ 1 b a 1 u 1 ( b a 1 ) * p ] = b a 1 ( 1 + c s r e , # b a 1 ) u 1 ( b a 1 ) * p b a 1 c s r e , # + d s r e , # d s r e , # b a 1 u 1 ( b a 1 ) * p = b a 1 u 1 ( b a 1 ) * p [ d b a 1 c ] s r e , # b a 1 u 1 ( b a 1 ) * p + [ d b a 1 c ] s r e , # = b a 1 u 1 ( b a 1 ) * p s s r e , # b a 1 u 1 ( b a 1 ) * p + s s r e , # = s s r e , # + p b a 1 u 1 ( b a 1 ) * p .
Then we verify that
T S = a c b d α u 1 α u 1 ( b a 1 ) * p a 1 c s r e , # s r e , # b a 1 u 1 s r e , # [ 1 b a 1 u 1 ( b a 1 ) * p ] = u 1 u 1 ( b a 1 ) * p p ( b a 1 ) u 1 s s r , e # + p ( b a 1 ) u 1 ( b a 1 ) * p .
We observe that
u * e = [ 1 + ( b a 1 ) * p * ( b a 1 ) ] e = e + ( b a 1 ) * p * e ( b a 1 ) = e + ( b a 1 ) * ( e p ) * ( b a 1 ) = e + ( b a 1 ) * e p ( b a 1 ) = e + e ( b a 1 ) * p ( b a 1 ) = e u , ( e u 1 ) * = e u 1 ,
[ e u 1 ( b a 1 ) * p ] * = p * ( b a 1 ) ( u 1 ) * e = p * ( b a 1 ) ( e u 1 ) * = p * ( b a 1 ) e u 1 = p * e ( b a 1 ) u 1 = ( e p ) * ( b a 1 ) u 1 = e p ( b a 1 ) u 1
and
[ e p ( b a 1 ) u 1 ( b a 1 ) * p ] * = [ ( b a 1 ) u 1 ( b a 1 ) * p ] * ( e p ) * = [ ( b a 1 ) u 1 ( b a 1 ) * p ] * e p = [ e ( b a 1 ) u 1 ( b a 1 ) * p ] * p = [ ( b a 1 ) ( e u 1 ) ( b a 1 ) * p ] * p = [ p * ( b a 1 ) ( e u 1 ) * ( b a 1 ) * ] p = [ p * ( b a 1 ) e u 1 ) ( b a 1 ) * ] p = [ p * e ( b a 1 ) u 1 ) ( b a 1 ) * ] p = [ ( e p ) * ( b a 1 ) u 1 ) ( b a 1 ) * ] p = e p e p ( b a 1 ) u 1 ( b a 1 ) * p ,
and then
[ e s s r , e # + p ( b a 1 ) u 1 ( b a 1 ) * p ] * = e s s r , e # + p ( b a 1 ) u 1 ( b a 1 ) * p .
Thus E T S * = E T S . Moreover, we see that
u 1 a + u 1 ( b a 1 ) * p b = a , u 1 c + u 1 ( b a 1 ) * p d = c , p ( b a 1 ) u 1 a + [ s s r , e # + p ( b a 1 ) u 1 ( b a 1 ) * p ] b = b , p ( b a 1 ) u 1 c + [ s s r , e # + p ( b a 1 ) u 1 ( b a 1 ) * p ] d = d .
Hence, we have
T S T = u 1 u 1 ( b a 1 ) * p p ( b a 1 ) u 1 s s r , e # + p ( b a 1 ) u 1 ( b a 1 ) * p a c b d = T .
Hence T E ( 1 , 3 ) = S .
In view of Lemma 4.1, T M 2 ( A ) = T 2 M 2 ( A ) . According to Theorem 1.1, T M 2 ( A ) r E , # . Moreover, we have
T r E , # = P U r 1 A Q T E ( 1 , 3 ) = ( P U r 1 ) ( A Q T E ( 1 , 3 ) ) = v r 1 v r 1 c t ( 1 t s ) b a 1 v r 1 t ( 1 t s ) b a 1 v r 1 c t u 1 u 1 ( b a 1 ) * p s s r e , # b a 1 u 1 s s r e , # [ 1 b a 1 u 1 ( b a 1 ) * p ] = β γ δ ϵ ,
where β , γ , δ and ϵ as mentioned before. □
We are ready to prove:
Theorem 4.3.
Let s = d b a 1 c A r e , d , p = 1 s s r e , d , t = s r e , d + 1 s r e , d s , and let u = 1 + ( b a 1 ) * p b a 1 A 1 , v = a + c ( 1 t s ) b a 1 A r 1 . If e ( b a 1 ) = ( b a 1 ) e and p s b = ( e p b ) * s = 0 , then T M 2 ( A ) r E , d . In this case,
T r E , d = β γ δ ϵ ,
where
β = v r 1 u 1 + v r 1 c t s s r e , # b a 1 u 1 , γ = v r 1 u 1 ( b a 1 ) * p v r 1 c t s s r e , # [ 1 b a 1 u 1 ( b a 1 ) * p ] , δ = ( 1 t s ) b a 1 v r 1 u 1 + [ ( 1 t s ) b a 1 v r 1 c 1 ] t s s r e , # b a 1 u 1 , ϵ = ( 1 t s ) b a 1 v r 1 u 1 ( b a 1 ) * p [ ( 1 t s ) b a 1 v r 1 c 1 ] t s s r e , # [ 1 b a 1 u 1 ( b a 1 ) * p ] .
Proof. 
By virtue of Theorem 2.1, we have
d b a 1 c = x + y , x A e , # , y A q n i l , x * e y = y x = 0 .
Evidently,
x = s s r e , # s , y = s s s r e , # s .
Then
M = A + B , A = a c b d y , B = 0 0 0 y .
Step 1. A has right E-core inverse and B is quasinilpotent.
Clearly, ( d y ) b a 1 c = [ d b a 1 c ] y = ( x + y ) y = x A r e , # .
It is easy to verify that
p = 1 s s r e , d = 1 ( x + y ) x r e , # = 1 x x r e , # , t = 1 + s r e , d s r e , d s = 1 + x r e , # x r e , # ( x + y ) = 1 + x r e , # x r e , # x + x r e , # x x r e , # y = 1 + x r e , # x r e , # x + [ x r e , # e 1 ] ( e x x r e , # ) y = 1 + x r e , # x r e , # x + [ x r e , # e 1 ] ( e x x r e , # ) * y = 1 + x r e , # x r e , # x .
By hypothesis, we have
u = 1 + ( b a 1 ) * p b a 1 A 1 , v = a + c ( 1 t x ) b a 1 A r 1 .
By hypothesis, we have e ( b a 1 ) = ( b a 1 ) e . In light of Lemma 4.2, A M 2 ( A ) r E , # . Moreover, we have
A r E , # = β γ δ ϵ ,
where
β = v r 1 u 1 + v r 1 c t s s r e , # b a 1 u 1 , γ = v r 1 u 1 ( b a 1 ) * p v r 1 c t s s r e , # [ 1 b a 1 u 1 ( b a 1 ) * p ] , δ = ( 1 t s ) b a 1 v r 1 u 1 + [ ( 1 t s ) b a 1 v r 1 c 1 ] t s s r e , # b a 1 u 1 , ϵ = ( 1 t s ) b a 1 v r 1 u 1 ( b a 1 ) * p [ ( 1 t s ) b a 1 v r 1 c 1 ] t s s r e , # [ 1 b a 1 u 1 ( b a 1 ) * p ] .
Step 2. M has generalized right e-core inverse.
Obviously, d y = x + b a 1 c . Then we check that
A * E B = a * b * c * ( d y ) * 0 0 0 e y = 0 b * e y 0 ( d y ) * e y = 0 , B A = 0 0 0 y a c b d y = 0 0 y b y ( d y ) = 0 .
We verify that
b * e y = b * e [ s s s r e , # s ] = b * [ e ( 1 s s r e , # ) ] s = b * [ e ( 1 s s r e , # ) ] * s = ( e p b ) * s = 0 , ( d y ) * e y = ( x + b a 1 c ) * e y = x * e y + ( a 1 c ) * ( b * e y ) = 0 ; y b = [ s s s r e , # s ] b = p s b = 0 , y ( d y ) = y ( x + b a 1 c ) = ( y b ) a 1 c = 0 .
According to Theorem 2.1, M has generalized right E-core inverse. In this case,
M r E , d = A r E , # = β γ δ ϵ ,
where β , γ , δ and ϵ as mentioned before. □
Corollary 4.4.
Let a A 1 , d A r e , d . Then a c 0 d M 2 ( A ) r E , d . In this case,
a c 0 d r E , d = a 1 a 1 c d r e , d 0 d r e , d .
Proof. 
Since ( 1 d r e , d d ) d d r e , d = 0 , we easily obtain the result by Theorem 4.3. □
We are now ready to prove:
Theorem 4.5.
Let a , x A . Then the following are equivalent:
(1)
a r e , d = x .
(2)
a A r d and there exists an idempotent p A such that ( e p ) * = e p and
a = a 1 a 2 a 3 a 4 p , x = x 1 x 2 0 0 p ,
where a 1 ( p A p ) r 1 , x 1 = ( a 1 ) r 1 , a 1 x 2 = a 3 x 1 = a 3 x 2 = 0 and ( 1 p ) a m ( { a r d } ) for any m N .
(3)
a A r d and there exists an idempotent q A such that ( e q ) * = e q and
a = a 1 a 2 a 3 a 4 q , x = 0 0 x 1 x 2 q ,
where a 4 ( ( 1 q ) A ( 1 q ) ) r 1 , x 2 = ( a 4 ) r 1 , a 2 x 1 = a 2 x 2 = a 4 x 1 = 0 and q a m ( { a r d } ) for any m N .
Proof.  ( 1 ) ( 2 ) Let p = a a r e , d . Then ( 1 p ) a r e , d = 0 . Write
a = a 1 a 2 a 3 a 4 q , x = x 1 x 2 0 0 q .
Since
a 1 a 2 a 3 a 4 q x 1 x 2 0 0 q = a x = q = q 0 0 0 q ,
we deduce that a 1 ( p A p ) r 1 , x 1 = ( a 1 ) r 1 , a 1 x 2 = a 3 x 1 = a 3 x 2 = 0 .
Let z { a r d } and m N . For any n m , we have z = a z 2 = a 2 z 3 = = a n z n for any n N . Hence,
| | ( 1 p ) a m z | | 1 n = | | ( 1 a x ) a n z n m | | 1 n | | a n a x a n | | 1 n | | z | | 1 m n .
Since lim n | | a n a x a n | | 1 n = 0 , we derive that
lim n | | ( 1 p ) a m z | | 1 n = 0 ;
hence, ( 1 p ) a m z = 0 , as required.
( 2 ) ( 1 ) By hypothesis, there exists an idempotent p A such that ( e p ) * = e p and
a = a 1 a 2 a 3 a 4 p , x = x 1 x 2 0 0 p ,
where a 1 ( p A p ) r 1 , x 1 = ( a 1 ) r 1 , a 1 x 2 = a 3 x 1 = a 3 x 2 = 0 and ( 1 p ) a m ( { a r d } ) for any m N . Then we check that
a x = a 1 x 1 0 0 0 p = p , ( e a x ) * = ( e p ) * = e p = e a x , a x 2 = ( a x ) x = p x = p x 1 p x 2 0 0 p = x .
Let z ( { a r d } ) and m N . Then a z 2 = z , a z a 2 A q n i l and ( 1 p ) a m z = 0 . Hence, ( 1 p ) z = ( 1 p ) a z 2 = [ ( 1 p ) a z ] z = 0 . One easily checks that
| | a n a x a n | | 1 n = | | ( 1 p ) a n | | 1 n = | | ( 1 p ) ( a z a 2 ) n | | 1 n | | 1 p | | 1 n | | ( a z a 2 ) n | | 1 n .
As a z a 2 A q n i l , we see that
lim n | | ( a z a 2 ) n | | 1 n = 0 ,
and then
lim n | | a n a x a n | | 1 n = 0 .
Therefore a r e , d = x , as desired.
( 1 ) ( 3 ) This is proved as as the preceding discussion for q = 1 a a r e , d . □
Corollary 4.6.
Let a , x A . Then the following are equivalent:
(1)
a d = x .
(2)
a A d and there exists a projection p A such that
a = a 1 a 2 a 3 a 4 p , x = x 1 x 2 0 0 p ,
where a 1 ( p A p ) 1 , x 1 = a 1 1 , a 1 x 2 = a 3 x 1 a 3 x 2 = 0 and ( 1 p ) a d = 0 .
(3)
a A d and there exists a projection q A such that
a = a 1 a 2 a 3 a 4 q , x = 0 0 x 1 x 2 q ,
where a 4 ( ( 1 q ) A ( 1 q ) ) 1 , x 2 = a 4 1 , a 2 x 1 = a 2 x 2 = a 4 x 1 = 0 and q a d = 0 .
Proof. 
This is obvious by choosing e = 1 in Theorem 4.5. □

5. Pseudo Right e-Core Inverse

Recall that a A has pseudo right e-core inverse provided that there exists x A such that
x = a x 2 , ( e a x ) * = e a x , a n = a x a n .
We denote x by a r e , D . The aim of this section is to investigate pseudo right e-core inverse in a Banach *-algebra. Let a A . Set
{ a r D } = { x A | a x 2 = x , a n = a x a n } .
We now derive the following.
Lemma 5.1.
Let a A . Then the following are equivalent:
(1)
a A r e , D .
(2)
a n A r e , # for some n N .
(3)
a A r D and a n A e ( 1 , 3 ) for some n N .
(4)
a A r D A r e , d .
Proof. 
These are proved as in [27], Theorem 4.8 and Theorem 4.9. □
Theorem 5.2.
Let a A . Then the following are equivalent:
(1)
a A r e , D .
(2)
There exist x , y A such that
a = x + y , x * e y = y x = 0 , x A r e , # , y A n i l .
(3)
There exists an idempotent p A such that
a n + p A r 1 , ( e p ) * = e p , a p A n i l , ( 1 p ) A = a ( 1 p ) A .
(4)
{ a r D } A r e , # .
In this case, a r e , D = z 2 z r e , # for z { a r D } A r e , # .
Proof. 
This is obvious by Theorem 2.1, Theorem 2.5, Theorem 3.1 and Lemma 5.1. □
Corollary 5.3.
Let a , b A r e , D . If a b = b a = a * e b = 0 , then a + b A r e , D . In this case,
( a + b ) r e , D = a r e , D + b r e , D .
Proof. 
In view of Theorem 5.2, we have decompositions:
a = x + y , x * e y = y x = 0 , x A r e , # , y A n i l ; b = s + t , s * e t = t s = 0 , s A r e , # , t A n i l .
Explicitly, we have x = a a e , D a a and s = b b e , D b . Then a + b = ( x + s ) + ( y + t ) . We directly check that
x + s = ( x + s ) ( x r e , # + s r e , # ) ( x + s ) , x r e , # + s r e , # = ( x + s ) ( x r e , # + s r e , # ) 2 , ( x + s ) ( x r e , # + s r e , # ) * = ( x + s ) ( x r e , # + s r e , # ) .
Then x + s A r e , # and ( x + s ) r e , # = x r e , # + s r e , # . Since y t = ( a a a e , D a ) ( b b b e , D b ) = 0 , it follows by ??? that y + t A n i l .
Obviously, we check that
( x + s ) * e ( y + t ) = x * e y + x * e t + s * e y + s * e t = x * e t + s * e y = ( a e , D a ) * ( a * e b ) ( 1 b e , D b ) + ( b e , D b ) * ( b * e a ) ( 1 a e , D a ) = 0 , ( y + t ) ( x + s ) = y x + y s + t x + t s = y s + t x = ( a a a e , D a ) b b e , D b + ( b b b e , D b ) a a e , D a = 0 .
By using Theorem 2.1,
( a + b ) e , D = ( x + s ) e , # = x e , # + s e , # = a e , D + b e , D ,
as asserted. □
Theorem 5.4.
Let a A . Then the following are equivalent:
(1)
a A r e , D .
(2)
There exists b A such that
b a b = b , ( e a b ) * = e a b , a b a A = a 2 b a A , a a b a A n i l .
(3)
There exists b A such that
b a b = b , ( e a b ) * = e a b , a b a A = a 2 b a A , a n = a b a n
for some n N .
Proof. 
This is proved by Theorem 2.8 and Lemma 5.1. □
Corollary 5.5.
Let a A . Then the following are equivalent:
(1)
a A D .
(2)
There exists b A such that
b a b = b , ( a b ) * = a b , a b a A = a 2 b a A , a a b a A n i l .
(3)
There exists b A such that
b a b = b , ( a b ) * = e a b , a b a A = a 2 b a A , a n = a b a n
for some n N .
Proof. 
This is obvious by choosing e = 1 in Theorem 5.4. □
Let A C n × n and G be the Minkowski matric matrix, that is, G = d i a g ( 1 , I n 1 ) . The Minkowski adjoint of the matrix A is defined as A = G A * G . The m -core-EP inverse of A is defined as the matrix X C n × n satisfying four conditions:
X A X = X , X A k + 1 = A k , ( A X ) = A X a n d R ( X ) R ( A k ) ,
is called the m -core-EP inverse of A, and denoted by A E (see [25,26])
Theorem 5.6.
Let A C n × n and G be the Minkowski matric matrix. Then
A E = A r G , D = A G , D .
Proof. 
Since G = d i a g ( 1 , I n 1 ) , we check that G * = G and G 2 = I n . Thus, G is an Hermitian invertible matrix. It is easy to verify that
( A X ) = A X G ( A X ) * G = A X ( G A X ) * = ( A X ) * G * = ( A X ) * G = G 1 A X = G A X .
Therefore A r G , D = A E , as asserted. □
The m -core inverse of A is defined as the matrix X C n × n satisfying four conditions:
X A X = X , X A 2 = A , ( A X ) = A X a n d R ( X ) R ( A ) ,
is called the m -core inverse of A, and denoted by A m .
Corollary 5.7.
Let A C n × n . Then
A = X + Y , X * E Y = Y X = 0 , X h a s m -core i n v e r s e , Y i s n i l p o t e n t .
In this case, A E = X m .
Proof. 
We obtain the result by Theorem 5.2 and Theorem 5.6. □
Remark 5.8.
Generalized left e-core inverse can be defined dually. We can establish the corresponding results for generalized left e-core inverse in a similar way.

References

  1. O.M. Baksalary and G. Trenkler, Core inverse of matrices, Linear Multilinear Algebra, 58(2010), 681–697.
  2. R. Behera; G. Maharana and J.K. Sahoo, Further results on weighted core-EP inverse of matrices, Result. Math., 75(2020), Paper No. 174, 20 p. [CrossRef]
  3. H. Chen and M. Sheibani, Generalized right core inverse in *-Banach algebras, Preprints 2024, 2024061246. [CrossRef]
  4. H. Chen and M. Sheibani, Generalized weighted core inverse in Banach *-algebras, Filomat, 38(2024), 3691–3706.
  5. H. Chen and M. Sheibani, Properties of generalized weighted core inverses in Banach *-algebras, J. Algebra Appl., 2025, 2550358 (20 pages). [CrossRef]
  6. J. Chen; H. Zhu; P. Patrício and Y. Zhang, Characterizations and representations of core and dual core inverses, Canad. Math. Bull., 60(2018), 269-282. [CrossRef]
  7. X. Chen and J. Chen, Right core inverses of a product and a companion matrix, Linear Multilinear Algebra, 69(2021), 2245–2263. [CrossRef]
  8. X. Chen; J. Chen and Y. Zhou, The pseudo core inverses of differences and products of projections in rings with involution, Filomat, 35(2021), 181–189. [CrossRef]
  9. S. Das; J.K. Sahoo and R. Behera, Further results on weighted core inverse in a ring, Linear Multilinear Algebra, 71(2023), 2915–2934. [CrossRef]
  10. Y. Gao and J. Chen, Pseudo core inverses in rings with involution, Commun. Algebra, 46(2018), 38–50. [CrossRef]
  11. Y. Gao and J. Chen, The pseudo core inverse of a lower triangular matrix, Rev. R. Acad. Cienc. Exactas Fiś. Nat. Ser. A Mat., 113(2019), 423–434. [CrossRef]
  12. Y. Ke; L. Wang; J. Liang and L. Shi, Right e-core inverse and related generalized inverses in rings, Filomat, 37(2023), 5039–5051. [CrossRef]
  13. T. Li, Characterizations of weighted core inverse in rings with involution, J. Algebra Appl., 2022. [CrossRef]
  14. T. Li and M. Zhou, The absorption laws for the weighted core inverse in rings, Linear Multilinear Algebra, 71(2023), 480–495. [CrossRef]
  15. Y. Liao; J. Chen and J. Cui, Cline’s formula for the generalized Drazin inverse, Bull. Malays. Math. Sci. Soc., 37(2014), 37–42.
  16. K. Manjunatha Prasad and K.S. Mohana, Core-EP inverse, Linear Multilinear Algebra, 62(2014), 792–802.
  17. D. Mosić, Core-EP pre-order of Hilbert space operators, Quaest. Math., 41(2018), 585–600.
  18. D. Mosić, Core-EP inverse in ring with involution, Publ. Math. Debrecen, 96(2020), 427–443.
  19. D. Mosić, Core-EP inverses in Banach algebras, Linear Multilinear Algebra, 69(2021), 2976–2989.
  20. D. Mosić, Weighted core-EP inverse and weighted core-EP pre-orders in a C*-algebra, J. Aust. Math. Soc., 111(2021), 76–110.
  21. D. Mosić; C. Deng and H. Ma, On a weighted core inverse in a ring with involution, Commun. Algebra, 46(2018), 2332–2345.
  22. D. Mosić and D.S. Djordjević, The gDMP inverse of Hilbert space operators, J. Spectral Theory, 8(2018), 555–573.
  23. D. Mosić; G. Dolinar and J. Marovt, EP-quasinilpotent decomposition and its applications, Rev. R. Acad. Cienc. Exactas Fiś. Nat. Ser. A Mat., 115(2021), No. 4, Paper No. 188, 25 p.
  24. D.S Rakić; N.Č. Dinčić and D.S. Djordjević, Group, Moore-Penrose, core and dual core inverse in rings with involution, Linear Algebra Appl., 463(2014), 115–133.
  25. H. Wang; N. Li and X. Liu, The m-core inverse and its applications, Linear Multilinear Algebra, 69(2021), 2491–2509.
  26. H. Wang; H. Wu and X. Liu, The m-core-EP inverse in Minkowski space, Bull. Iran. Math. Soc., 48(2022), 2577–2601.
  27. L. Wang; D. Mosić and Y.F. Gao, Right core inverse and the related generalized inverses, Commun. Algebra, 47(2019), 4749–4762.
  28. S. Xu; J. Chen and X. Zhang, New characterizations for core inverses in rings with involution, Front. Math. China, 2017,12(2017), 231–246. [CrossRef]
  29. M. Zhou and J. Chen, Characterizations and maximal classes of elements related to pseudo core inverses, Rev. R. Acad. Cienc. Exactas Fis. Nat., Ser. A Mat., 114(2020), No. 2, Paper No. 104, 10 p. [CrossRef]
  30. L. Wang; D. Mosić and Y. Gao, Right core inverse and the related generalized inverses, Commun. Algebra, 47(2019), 4749–4762.
  31. H. Zhu and P. Patrício, Characterizations for pseudo core inverses in a ring with involution, Linear Multilinear Algebra, 67(2019), 1109–1120. [CrossRef]
  32. H. Zhu and Q. Wang, Weighted pseudo core inverses in rings, Linear Multilinear Algebra, 68(2020), 2434–2447. [CrossRef]
  33. H. Zhu and Q. Wang, Weighted Moore-Penrose inverses and weighted core inverses in rings with involution, Chin. Ann. Math., Ser. B, 42(2021), 613–624.
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated