Preprint
Article

This version is not peer-reviewed.

Generalized Right Weighted Core Inverse in Banach Algebras

Submitted:

11 July 2025

Posted:

16 July 2025

You are already at the latest version

Abstract
In this paper, we introduce the generalized right weighted core inverse, defined via the canonical polar decomposition using a right weighted core invertible element and a quasinilpotent. We present various characterizations of this new generalized inverse with weights and utilize these results to establish new properties of the right pseudo core inverse and the weighted core-EP inverse.
Keywords: 
;  ;  ;  ;  ;  

1. Introduction

A Banach algebra is called a Banach *-algebra if there exists an involution * : x → x * satisfying ( x + y ) * = x * + y * , ( λ x ) * = λ ¯ x * , ( x y ) * = y * x * , ( x * ) * = x . An element a in a Banach *-algebra A has core inverse if and only if there exists x ∈ A such that
x a 2 = a , a x 2 = x , ( a x ) * = a x .
If such x exists, it is unique, and denote it by a # ◯ . Core inverse is extensively studied by many authors from different views, e.g., [1,6,21,25].
Let C n × n be the Banach *-algebra of all n × n complex matrices with conjugate transpose * and R ( X ) represent the range space of a complex matrix X. In 2014, Prasad and Mohana extended core inverse and introduced core-EP inverse for a complex matrix (see [17]). A matrix A ∈ C n × n has core-EP inverse X if and only if
X A X = X , R ( X ) = R ( X * ) = R ( A k ) ,
where k = i n d ( A ) is the Drazin index of A. Such X is unique, and we denote it by A † ◯ .
In 2020, Gao et al. extended the concept of the core-EP inverse and introduced the notion of weighted core-EP inverse for a complex matrix (see [9]). Let A , W ∈ C n × n and k = m a x { i n d ( A W ) , i n d ( W A ) } . The weighted core-EP inverse of A is the unique solution to the system:
W A W X = ( W A ) k [ ( W A ) k ] † , R ( X ) ⊆ R ( ( A W ) k ) ,
and we denote such X by A † ◯ , W . Then Mosić introduced and studied weighted core-EP inverse for a bounded linear operator between two Hilbert spaces as a generalization of the weighted core-EP inverse of a matrix (see [14]). In 2021, Mosić further extended the weighted core-EP inverse of bounded linear operators on Hilbert spaces to elements of a C * -algebra and the weighted core-EP inverse in a C * -algebra was characterized by means of range projections (see [15]).
Wang et al. generalized the core inverse to the right core inverse (see [18]). An element a ∈ A has right core inverse if there exist x ∈ A such that
a x 2 = x , a x a = a , ( a x ) * = a x .
If such x exists, we denote it by a r # ◯ .
An element a ∈ A has right pseudo core if there exists a x ∈ A such that
a x 2 = x , ( a x ) * = a x , a k = a x a k
for some k ∈ N (see [18]).
In [5], the authors introduced and studied generalized right core inverse. An element a ∈ A has generalized right core inverse if there exists 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 generalized inverse in [18,19,22,27].
Recently, many authors studied generalized inverse with wights (see [2,8,9,12,16,20,23,24]). In [28], Zhu et al. introduced and studied a weighted generalized inverse as a generalization of core inverse. Let a , w ∈ A . An element a ∈ A is w-core invertible if there exists some x ∈ A such that
a w x 2 = x , ( a w x ) * = a w x , x a w a = a .
Such an x is called a w-core inverse of a. Many properties of w-core inverse are presented by many authors, e.g., [26,27]. In [29], Zhu et al. extended w-core inverse and introduce right w-core inverse. An element a ∈ A has right w-core inverse if there exists x ∈ A such that
a w x 2 = x , ( a w x ) * = a w x , a w x a = a .
Many properties of right w-core inverse are investigated in [29]. However, the right w-core inverse is unrelated to the weighted core-EP inverse mentioned above. The motivation of this paper is to introduce and study a new class of weighted generalized inverses, such that the class of weighted core-EP inverses can be viewed as a subclass of this new class.
 Definition 1.1. 
An element a ∈ A has generalized right w-weighted core inverse if there exists a x ∈ A such that
a ( w x ) 2 = x , ( w a w x ) * = w a w x , lim n → ∞ | | ( a w ) n − ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
The preceding x is denoted by a r d ◯ , w . It is evident that for any complex matrix, the generalized right weighted core inverse coincides with the weighted core-EP inverse. Consequently, many properties of the weighted core-EP inverse naturally extend to this broader class.
In Section 2, we introduce right w-weighted core inverse for an element in a Banach *-algebra.
 Definition 1.2. 
An element a ∈ A has right w-weighted core inverse if there exists x ∈ A such that
a ( w x ) 2 = x , ( w a w x ) * = w a w x , a w x w a = a .
If such x exists, we denote it by a r # ◯ , w . The investigation explores several elementary properties of the right w-weighted core inverse, which will be utilized subsequently.
In Section 3, we characterize generalized right weighted core inverse by combining right w-weighted core inverse and quasinilpotent in a Banach *-algebra. We prove that a ∈ A has generalized right w-core inverse if and only if there exist z , y ∈ A such that
a = z + y , ( w z ) * ( w y ) = y w z = 0 , z ∈ A r # ◯ , w , y ∈ A w q n i l .
Here, A w q n i l = { x ∈ A ∣ lim n → ∞ | | ( x w ) n | | 1 n = 0 . Surprisingly, we observe that the preceding condition ( w z ) * ( w y ) = 0 can be dropped, which add some new properties for the weighted core-EP inverse as well. The polar-like property of the generalized right weighted core inverse is thereby established.
An element a ∈ A has right wg-Drazin inverse x if there exists a x ∈ A such that
a ( w x ) 2 = x = x w a w x , a w − x w ( a w ) 2 ∈ A q n i l .
We denote such a x by a r d , w . The right wg-Drazin inverse is an one-sided version of weighted generalized Drazin inverse (see [13]). In Section 4, we characterize generalized right weighted core inverse by using the right wg-Drazin inverse. The generalized right weighted core inverse is then constructed based on the right weighted core inverse.
 Definition 1.3. 
An element a ∈ A has right pseudo w-core inverse if there exist x ∈ A such that
a ( w x ) 2 = x , ( w a w x ) * = w a w x , ( a w ) k = ( a w ) ( x w ) ( a w ) k
for some k ∈ N .
Finally, in Section 5, we investigate the right pseudo w-core inverse for elements in a Banach *-algebra by using the generalized right w-core inverse. This approach allows us to present many new properties of the weighted core-EP inverse.
Throughout the paper, all Banach *-algebras are complex with an identity. A r d , w , A r D , w , A r # ◯ , w , A r d ◯ , w and A r D ◯ , w denote the sets of all right weighted g-Drazin invertible, right weighted Drazin invertible, right weighted core invertible, generalized right weighted core invertible and generalized right pseudo w-core invertible elements in A , respectively.

2. Right w-Weighted Core Inverse

The objective of this section is to elucidate the fundamental properties of the right w-weighted core inverse. If a , x and w satisfy the equations a = a w x w a and ( w a w x ) * = w a w x , then x is called w-weighted ( 1 , 3 ) -inverse of a and is denoted by a w ( 1 , 3 ) . We use A w ( 1 , 3 ) to stand for sets of all w-weighted ( 1 , 3 ) -invertible elements in A .
 Theorem 2.1. 
Let a ∈ A . Then the following are equivalent:
(1)
a ∈ A r # ◯ , w .
(2)
There exists some x ∈ A such that
x w a w x = x = a ( w x ) 2 , a w x w a = a , ( w a w x ) * = w a w x .
(3)
a ∈ A w ( 1 , 3 ) and a A = a w a A .
Proof. ( 1 ) ⇒ ( 2 ) By hypothesis, there exists some z ∈ A such that
a ( w z ) 2 = z , ( w a w z ) * = w a w z , a w z w a = a .
Set x = z w a w z . Then we verify that
a w x = ( a w z w a ) w z = a w z , a ( w x ) 2 = [ a ( w z ) 2 ] w a w z = z w a w z = x , x w a w x = z w a w z w ( a w z ) = z w ( a w z w a ) w z = z w a w z = x , a w x w a = ( a w z ) w a = a , ( w a w x ) * = ( w a w z ) * = w a w z = w a w x .
as desired.
( 2 ) ⇒ ( 1 ) This is trivial.
( 1 ) ⇒ ( 3 ) By hypothesis, there exists some x ∈ A such that
a ( w x ) 2 = x , ( w a w x ) * = w a w x , a w x w a = a .
Then w a w x w a = w a . Hence, a ∈ A w ( 1 , 3 ) .
Clearly, a w a ∈ a A . On the other hand, we have a = ( a w ) x ( w a ) = a w [ a ( w x ) 2 ] w a ∈ a w a A . Therefore a A = a w a A .
( 3 ) ⇒ ( 1 ) Since a ∈ A w ( 1 , 3 ) , we can find some x ∈ A such that w a w x w a = w a and ( w a w x ) * = w a w x . Write a = a w a t for some t ∈ A . Set x = a t w a w ( 1 , 3 ) . Then we verify that
a w x = ( a w a t ) w a w ( 1 , 3 ) = a w a w ( 1 , 3 ) , ( w a w x ) * = ( w a w a w ( 1 , 3 ) ) * = w a w a w ( 1 , 3 ) = w a w x , a ( w x ) 2 = ( a w x ) ( w x ) = ( a w a w ( 1 , 3 ) ) w ( a t w a w ( 1 , 3 ) ) = ( a w a w ( 1 , 3 ) w a ) t w a w ( 1 , 3 ) = a t w a w ( 1 , 3 ) = x , a w x w a = ( a w x ) w a = a w a w ( 1 , 3 ) w a = a .
Therefore a ∈ A r # ◯ , w . □
 Corollary 2.2. 
Let a ∈ A . Then the following are equivalent:
(1)
a ∈ A r # ◯ , w .
(2)
A a = A ( w a ) * ( w a ) and a A = a w a A .
Proof. ( 1 ) ⇒ ( 2 ) By virtue of Theorem 2.1, a A = a w a A . By hypothesis, w a ∈ A ( 1 , 3 ) . In light of [7, Lemma2.3], we have A w a = A ( w a ) * ( w a ) . As a = a w a r # ◯ , w w a , we see that A w a = A a , and then A a = A ( w a ) * ( w a ) .
( 2 ) ⇒ ( 1 ) Write a = t ( w a ) * ( w a ) for a t ∈ A . Then w a = ( w t ) ( w a ) * ( w a ) , and so ( w a ) ( w t ) * = ( w t ) ( w a ) * ( w a ) ( w t ) * . Moreover, ( w a ) * = ( w a ) * ( w a ) ( w t ) * ; hence, ( w a ) * ( w a ) = ( w a ) * ( w a ) ( w t ) * ( w a ) . Thus, t ( w a ) * ( w a ) = t ( w a ) * ( w a ) ( w t ) * ( w a ) . Since a A = a w a A , we can find a z ∈ A such that a = a w a z . Then we derive
a = t ( w a ) * ( w a ) = t ( w a ) * ( w a ) ( w t ) * ( w a ) = a ( w t ) * ( w a ) = a w a z ( w t ) * w a = a w x w a ,
where x = a z ( w t ) * . Clearly, w a w x = w a w a z ( w t ) * = w a ( w t ) * = ( w t ) ( w a ) * ( w a ) ( w t ) * . This implies that ( w a w x ) * = w a w x . Accordingly, a ∈ A w ( 1 , 3 ) . This completes the proof by Theorem 2.1. □
 Theorem 2.3. 
Let a ∈ A r # ◯ , w . Then there exists a projection p ∈ A such that
p w a = 0 a n d w a + p ∈ A r − 1 .
 Proof. 
Let x = a r # ◯ , w . Then
a ( w x ) 2 = x = x w a w x , ( w a w x ) * = w a w x , a w x w a = a .
Let p = 1 − w a w x . Then p 2 = p = p * ∈ A and p w a = 0 . We directly check that
[ w a + 1 − w a w x ] [ w x + 1 − w a w x ] = ( w a ) ( w x ) + ( w a ) ( 1 − w a w x ) + ( 1 − w a w x ) ( w x ) + ( 1 − w a w x ) 2 = ( w a ) ( w x ) + ( w a ) ( 1 − w a w x ) + w x − w a ( w x ) 2 + ( 1 − w a w x ) = 1 + ( w a ) ( 1 − w a w x ) .
By hypothesis, we verify that
[ 1 + w a ( 1 − w a w x ) ] [ 1 − ( w a ) ( 1 − w a w x ) ] = 1 .
Then
[ w a + 1 − w a w x ] [ w x + 1 − w a w x ] [ 1 − ( w a ) ( 1 − w a w x ) ] = 1 .
Thus, w a + 1 − w a w x ∈ A is right invertible, as required. □
 Corollary 2.4. 
Let a ∈ A , w ∈ A − 1 . Then the following are equivalent:
(1)
a ∈ A r # ◯ , w .
(2)
There exists a unique projection p ∈ A such that
p w a = 0 a n d w a + p ∈ A r − 1 .
(3)
There exists a projection p ∈ A such that
p w a = 0 a n d w a + p ∈ A r − 1 .
Proof. ( 1 ) ⇒ ( 2 ) By virtue of Theorem 2.3, here exists a projection p ∈ A such that
p w a = 0 a n d w a + p ∈ A r − 1 .
Assume that there exists a projection q ∈ A such that
q w a = 0 a n d w a + q ∈ A r − 1 .
Then ( 1 − p ) w a = w a , and so ℓ ( 1 − p ) ⊆ ℓ ( w a ) . On the other hand, w a = ( 1 − p ) ( w a + p ) , and then 1 − p = w a ( w a + p ) r − 1 . This implies that ℓ ( w a ) = ℓ ( 1 − p ) . Thus, we have ℓ ( 1 − p ) = ℓ ( w a ) . Likewise, we have ℓ ( 1 − p ) = ℓ ( w a ) . It follows that ℓ ( 1 − p ) = ℓ ( 1 − q ) . This implies that p = p q and q = q p . Accordingly, p = p q = p * q * = ( q p ) * = q * = q , as required.
( 2 ) ⇒ ( 3 ) This is obvious.
( 3 ) ⇒ ( 1 ) By hypothesis, there exists a projection p ∈ A such that
p w a = 0 , ( w a + p ) s = 1 a n d p s ( 1 − p ) = 0 .
Since ( 1 − p ) ( w a + p ) = ( 1 − p ) w a = w a , we see that 1 − p = w a s = w a s ( 1 − p ) . Since s ( 1 − p ) = ( 1 − p ) s ( 1 − p ) ∈ w A , we may write s ( 1 − p ) = w x for some x ∈ A . Then w a w x = w a s ( 1 − p ) = 1 − p ; and so ( w a w x ) * = ( 1 − p ) * = 1 − p = w a w x . Obviously, we have a w x w a = ( 1 − p ) w a = w a , and so a w x w a = a .
Since p ( w a + p ) = p , we see that p = p s and ( 1 − p ) s = s − p s = s − p . Thus,
a ( w x ) 2 = a w x w x = ( 1 − p ) w x = ( 1 − p ) ( w a + p ) r − 1 ( 1 − p ) = [ ( w a + p ) r − 1 − p ] ( 1 − p ) = w [ w − 1 ( w a + p ) r − 1 ( 1 − p ) ] = x .
As w ∈ A − 1 , we deduce that a ( w x ) 2 = x . Therefore a r # ◯ = x , as asserted. □
 Corollary 2.5. 
Let a ∈ A and n ∈ N . Then the following are equivalent:
(1)
a ∈ A r # ◯ .
(2)
There exists a projection p ∈ A such that
p a = 0 ∈ A q n i l , a n d a n + p ∈ A r − 1 .
 Proof. 
Straightforward by choosing w = 1 in Theorem 2.3. □
Let p , q ∈ A be idempotents. Then for any x ∈ A , we have x = p x q + p x ( 1 − p ) + ( 1 − p ) x q + ( 1 − p ) x ( 1 − q ) . Thus x can be represented in the matrix form x = p x p p x ( 1 − p ) ( 1 − p ) x p ( 1 − p ) x ( 1 − q ) ( p , q ) . We have at our disposal all the information necessary to prove the following.
 Theorem 2.6. 
Let a , w ∈ A . Then the following are equivalent:
(1)
a r # ◯ , w = x .
(2)
There exist an idempotent p ∈ A and a projection q ∈ A such that
a = a 1 a 2 0 0 p × q , w = w 1 w 2 0 w 3 q × p
and x is represented as
x = ( w 1 a 1 w 1 ) r − 1 x 2 0 0 p × q ,
where w 1 a 1 w 1 x 2 = 0 , a 1 w 1 ( w 1 a 1 w 1 ) − 1 w 1 x 2 = x 2 .
Proof. ( 1 ) ⇒ ( 2 ) Let p = ( a w ) ( a r # ◯ , w w ) and q = ( w a ) ( w a r # ◯ , w ) . Then we verify that
( 1 − p ) a = [ 1 − ( a w ) ( a r # ◯ , w w ) ] a = a − a w a r # ◯ , w w a = 0 .
and
( 1 − q ) w p = [ 1 − ( w a ) ( w a r # ◯ , w ) ] w ( a w ) ( a r # ◯ , w w ) = w [ a − a w a r d , w ) w a ] w a r d , w w = 0 .
Hence, we may write
a = a 1 a 2 0 0 p × q , w = w 1 w 2 0 w 3 q × p .
Then we have
a w = a 1 w 1 a 1 w 2 + a 2 w 3 0 0 p × p , w a = w 1 a 1 w 1 a 2 0 0 q × q .
Since ( 1 − p ) x = [ 1 − ( a w ) ( a r d , w w ) ] a r d ◯ , w = 0 , we may write x = x 1 x 2 0 0 p × q .
We compute that
w a w x = w 1 a 1 w 1 a 2 0 0 q × q w 1 w 2 0 w 3 q × p x 1 x 2 0 0 p × q = w 1 a 1 w 1 a 2 0 0 q × q w 1 x 1 w 1 x 2 0 0 q × q = w 1 a 1 w 1 x 1 w 1 a 1 w 1 x 2 0 0 q × p .
Since ( w a w x ) * = w a w x , we have w 1 a 1 w 1 x 2 = 0 .
It is easy to verify that
( w 1 a 1 w 1 ) x 1 = [ ( w a w x ) w ( a w x w ) ] [ ( a w x w ) a ( w a w x ) ] [ ( w a w x ) w ( a w x w ) ] [ ( a w x w ) x ( w a w x ) ] = w a w x = q .
Therefore
x = ( w 1 a 1 w 1 ) r − 1 x 2 0 0 p × p ,
as required.
( 2 ) ⇒ ( 1 ) By hypothesis, we have an idempotent p ∈ A and a projection q ∈ A such that
a = a 1 a 2 0 0 p × q , w = w 1 w 2 0 w 3 q × p
and x is represented as
x = ( w 1 a 1 w 1 ) r − 1 x 2 0 0 p × q ,
where w 1 a 1 w 1 x 2 = 0 , a 1 w 1 ( w 1 a 1 w 1 ) − 1 w 1 x 2 = x 2 . Then we verify that
a w x = a 1 a 2 0 0 p × q w 1 w 2 0 w 3 q × p ( w 1 a 1 w 1 ) r − 1 x 2 0 0 p × q = a 1 w 1 a 1 w 2 + a 2 w 3 0 0 p × q ( w 1 a 1 w 1 ) r − 1 x 2 0 0 p × q = a 1 w 1 ( w 1 a 1 w 1 ) r − 1 a 1 w 1 x 2 0 0 p × q , a ( w x ) 2 = a 1 w 1 ( w 1 a 1 w 1 ) r − 1 a 1 w 1 x 2 0 0 p × q w 1 ( w 1 a 1 w 1 ) r − 1 w 1 x 2 0 0 p × q = a 1 w 1 ( w 1 a 1 w 1 ) r − 1 w 1 ( w 1 a 1 w 1 ) r − 1 a 1 w 1 ( w 1 a 1 w 1 ) r − 1 w 1 x 2 0 0 p × q = ( w 1 a 1 w 1 ) r − 1 x 2 0 0 p × q .
Moreover, we have
w a w x = w 1 w 2 0 w 3 q × p a 1 w 1 ( w 1 a 1 w 1 ) r − 1 0 0 0 p × q = w 1 a 1 w 1 ( w 1 a 1 w 1 ) r − 1 0 0 0 q × q = q = q * = ( w a w x ) * , a w x w a = a 1 w 1 ( w 1 a 1 w 1 ) r − 1 a 1 w 1 x 2 0 0 p × q w 1 a 1 w 1 a 2 0 0 q × q = w 1 − 1 w 1 − 1 ( w 1 a 1 w 1 x 2 ) 0 0 p × q w 1 a 1 w 1 a 2 0 0 q × q = a .
Therefore a ∈ A # ◯ , w = x , as required. □
 Corollary 2.7. 
Let a , w ∈ A . Then the following are equivalent:
(1)
a r # ◯ = x .
(2)
There exist an idempotent p ∈ A and a projection q ∈ A such that a = a 1 a 2 0 0 p × q and x is represented as
x = ( a 1 ) r − 1 x 2 0 0 p × q ,
where a 1 x 2 = 0 , a 1 ( a 1 ) r − 1 x 2 = x 2 .
 Proof. 
We obtain the result by choosing w = 1 in Theorem 2.6. □

3. Generalized Right w-Weighted Core Decomposition

The purpose of this section is to characterize generalized w-weighted core inverse in a Banach *-algebra by using right weight core inverse and quasinilpotent. The following theorem contains new characterizations for a generalized right w-weighted core inverse.
 Theorem 3.1. 
Let a , w ∈ A . Then the following are equivalent:
(1)
a ∈ A r d ◯ , w .
(2)
There exist z , y ∈ A such that
a = z + y , ( w z ) * ( w y ) = y w z = 0 , z ∈ A r # ◯ , w , y ∈ A w q n i l .
(3)
There exist z , y ∈ A such that
a = z + y , y w z = 0 , z ∈ A r # ◯ , w , y ∈ A w q n i l .
In this case, a r d ◯ , w = z r # ◯ , w .
Proof. ( 1 ) ⇒ ( 2 ) By hypotheses, there exists x ∈ A such that
a ( w x ) 2 = x , ( w a w x ) * = w a w x , lim n → ∞ | | ( a w ) n − ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
Set z = a w x w a and y = a − a w x w a . Then a = z + y . Since lim n → ∞ | | ( a w ) n − ( a w ) ( x w ) ( a w ) n | | 1 n = 0 , we prove that
( a w ) x w a w x = a w x , ( a w ) x w ( a w ) 2 x = ( a w ) 2 x .
Step 1. We claim that z has right w-weighted core inverse x. One easily checks that
z ( w x ) 2 = ( a w x w a ) ( w x ) 2 = a w x w [ a ( w x ) 2 ] = ( a w x w ) x = a ( w x ) 2 = x , w z w x = w ( a w x w a ) w x = ( w a w x ) 2 , ( w z w x ) * = [ ( w a w x ) * ] 2 = ( w a w z ) 2 = w z w x , z w x w z = ( a w x w a ) w x w ( a w x w a ) = ( a w x w a w ) x w a w x w a = ( a w x w a w ) x w a = a w x w a = z .
Thus, z ∈ A r # ◯ , w and x = z r # ◯ , w .
Moreover, we see that
[ a w − ( a w ) x w ( a w ) ] a w x = 0 .
Then we verify that
| | [ a w − ( a w ) x w ( a w ) ) n | | 1 n + 1 = | | [ a w − ( a w ) x w ( a w ) ) n − 1 [ a w − ( a w ) x w ( a w ) ] | | 1 n + 1 = | | [ a w − ( a w ) x w ( a w ) ) n − 1 a w | | 1 n + 1 = | | [ a w − ( a w ) x w ( a w ) ) n − 2 ( a w ) 2 | | 1 n + 1 = … = | | [ a w − ( a w ) x w ( a w ) ) ( a w ) n − 1 | | 1 n + 1 = | | [ ( a w ) n − ( a w ) x w ( a w ) n | | 1 n + 1 .
Accordingly,
lim n → ∞ | | [ ( a w ) n − ( a w ) x w ( a w ) n ) n + 1 | | 1 n + 2 = 0 .
We infer that a w − ( a w ) x w ( a w ) ∈ A q n i l . Therefore y w = a w − a w x w a w ∈ A q n i l . That is, y ∈ A w q n i l .
Moreover, we verify that
( w z ) * w y = ( w a w x w a ) * ( w a − w a w x w a ) = ( w a ) * ( w a w x ) * ( 1 − w a w x ) w a = ( w a ) * ( w a w x ) ( 1 − w a w x ) w a = ( w a ) * ( w a w x w − w a w x w a w x w ) a = ( w a ) * [ w a w x w − w ( a w x w a w x w ) ] a = ( w a ) * [ w a w x w − w ( a w x w ) ] a = 0 , y w x = ( a − a w x w a ) w ( a w x w a ) = a w a w x w a − [ a w x w ( a w ) 2 ] x w a = a w a w x w a − ( a w ) 2 x w a = 0 ,
as required.
( 2 ) ⇒ ( 3 ) This is obvious.
( 3 ) ⇒ ( 1 ) By hypothesis, there exist z , y ∈ A such that
a = z + y , y w z = 0 , z ∈ A r # ◯ , w , y ∈ A w q n i l .
Set x = z r # ◯ , w . Then
z ( w x ) 2 = x , ( w z w x ) * = w z w x , ( a w ) x w ( z w ) = z w .
It is easy to verify that
a ( w x ) 2 = ( z + y ) ( w x ) 2 = z ( w x ) 2 = x , ( w a w ) x = w ( z + y ) w x = w z w x , ( ( w a w ) x ) * = ( w z w x ) * = w z w x = ( w a w ) x .
We verify that
( a w ) 2 − ( a w ) ( x w ) ( a w ) 2 = a w ( z w + y w ) − ( a w ) ( x w z w + x w y w ) ( z w + y w ) = a w ( z w + y w ) − ( a w ) [ ( x w z w ) z w + ( x w z w ) y w + x w ( y w z ) w + x w ( y w ) 2 ] = a w ( z w + y w ) − [ a w x w ( z w ) 2 + ( z + y ) w x w z w y w + a w x w ( y w ) 2 ] = a w z w + a w y w − [ a w z w + z w x w ( z w ) y w + a w x w ( y w ) 2 ] = a w z w + a w y w − [ a w z w + z w x w ( x w ( z w ) 2 ) y w + a w x w ( y w ) 2 ] = a w y w − z ( w x ) 2 w ( z w ) 2 y w − a w x w ( y w ) 2 ] = a w y w − [ x w ( z w ) 2 ] y w − a w x w ( y w ) 2 ] = ( z + y ) w y w − z w y w − ( z + y ) w x w ( y w ) 2 ] = ( y w ) 2 − z w x w ( y w ) 2 = ( 1 − z w x w ) ( y w ) 2 .
Since y w ( a w ) = y w ( z w + y w ) = ( y w ) 2 , we deduce that
( a w ) n − ( a w ) ( x w ) ( a w ) n = [ ( a w ) 2 − ( a w ) ( x w ) ( a w ) 2 ] ( a w ) n − 2 = [ ( 1 − z w x w ) ( y w ) 2 ] ( a w ) n − 2 = ( 1 − z w x w ) ( y w ) [ y w ( a w ) n − 2 ] = ( 1 − z w x w ) ( y w ) ( y w ) n − 1 .
Then
| | ( a w ) n − ( a w ) x w ( a w ) n | | 1 n ≤ | | 1 − z w x w | | | | ( y w ) n | | .
Since y ∈ A w q n i l , we see that
lim n → ∞ | | ( y w ) n | | 1 n = 0 .
Therefore
lim n → ∞ | | ( a w ) n − ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
Accordingly, a ∈ A r d ◯ , w , as desired. □
 Corollary 3.2. 
Let a ∈ A r d ◯ , w and b ∈ A q n i l . If b w a = 0 , then a + b ∈ A r d ◯ , w . In this case, ( a + b ) r d ◯ , w = a r d ◯ , w .
 Proof. 
Since a ∈ A r d ◯ , w , by virtue of Theorem 3.1, there exist x ∈ A r # ◯ , w and y ∈ A w q n i l such that a = x + y , y w x = 0 . As in the proof of Theorem 3.1, x = a w a r d ◯ , w w a and y = a − a w a r d ◯ , w w a . Then a = x + ( y + b ) . As b w y = b w ( a − a w a r d ◯ , w w a ) = 0 , it follows by [3, Lemma 2.4] that ( y + b ) w ∈ A q n i l . Hence, y + b ∈ A w q n i l . Obviously, ( y + b ) w x = y w x + b w x = 0 . In light of Theorem 3.1, a + b ∈ A r d ◯ , w . In this case, ( a + b ) r d ◯ , w = x r # ◯ , w = a r d ◯ , w . □
 Corollary 3.3. 
Let a ∈ A . Then the following are equivalent:
(1)
a ∈ A r d ◯ .
(2)
There exist z , y ∈ A such that
a = z + y , z * y = y z = 0 , z ∈ A r # ◯ , y ∈ A q n i l .
(3)
There exist z , y ∈ A such that
a = z + y , y w z = 0 , z ∈ A r # ◯ , y ∈ A q n i l .
In this case, a r d ◯ , w = z # ◯ .
 Proof. 
This is obvious by choosing w = 1 in Theorem 3.1. □
 Corollary 3.4. 
Let a ∈ A . Then the following are equivalent:
(1)
a ∈ A r D .
(2)
There exist z , y ∈ A such that
a = z + y , z * y = y z = 0 , z ∈ A r # ◯ , y ∈ A n i l .
(3)
There exist z , y ∈ A such that
a = z + y , y z = 0 , z ∈ A r # ◯ , y ∈ A n i l .
In this case, a d = z r # ◯ .
Proof. ( 1 ) ⇒ ( 2 ) This is proved in [5, Theorem 5.2].
( 2 ) ⇒ ( 3 ) This is trivial.
( 3 ) ⇒ ( 1 ) In view of Theorem 3.1, a ∈ A r d . Since y , z ∈ A r D and y z = 0 , we directly verify that a ∈ A r D . Therefore a ∈ A r D by [5, Lemma 5.1]. □
We present the following example to illustrate Theorem 3.1.
 Example 3.5. 
The space ℓ 2 ( N ) is a Hilbert space consisting of all square-summable infinite sequences of complex numbers. Let H = ℓ 2 ( N ) ⨁ ℓ 2 ( N ) be the Hilbert space of the sum of ℓ 2 ( N ) and itself. Let σ be defined on ℓ 2 ( N ) by:
σ ( x 1 , x 2 , x 3 , … ) = ( 0 , 1 1 1 x 1 , 2 1 2 x 2 , 3 1 3 x 3 , … ) ;
τ is defined on ℓ 2 ( N ) by:
τ ( x 1 , x 2 , x 3 , … ) = ( 2 1 2 x 2 , 3 1 3 x 3 , 4 1 4 x 4 , … )
and u is defined on ℓ 2 ( N ) by:
u ( x 1 , x 2 , x 3 , … ) = ( x 1 / 1 1 1 , x 2 / 2 1 2 , x 3 / 3 1 3 , x 4 / 4 1 4 , … ) .
Obviously, we have
lim n → ∞ | | ( x n ) 2 | | / | | ( x n / n n ) 2 | | = lim n → ∞ ( n n ) 2 = 1 , lim n → ∞ | | ( x n ) 2 | | / | | ( n n x n ) 2 | | = lim n → ∞ ( 1 n n ) 2 = 1 .
Hence ∑ n = 1 ∞ n n x n 2 and ∑ n = 1 ∞ x n / n n 2 converge. Then σ , τ and u are well defined.
Let γ be the right shift operator defined on ℓ 2 ( N ) by:
γ ( x 1 , x 2 , x 3 , … ) = ( x 2 , x 3 , x 4 , … ) ,
and let v is defined on ℓ 2 ( N ) by:
v ( x 1 , x 2 , x 3 , … ) = ( 1 3 x 1 , 1 4 x 2 , 1 5 x 3 , … ) .
Since ∑ n = 1 ∞ 1 n 2 converges, we see that v is well defined.
Let δ = v γ . Then it is given by
δ ( x 1 , x 2 , x 3 , … ) = ( 1 3 x 2 , 1 4 x 3 , 1 5 x 4 , … ) .
Let e n = ( 0 , 0 , … , 0 , 1 , ︸ n 0 , 0 , … ) . Then δ ( e n ) = 1 n + 2 e n + 1 . One directly checks that
δ k ( e n ) = ∏ j = 0 k − 1 1 n + j + 2 e n + k = ( n + 1 ) ! ( n + k + 1 ) ! e n + k .
Then we derive that
| | δ k | | = 1 ( k + 1 ) ! .
By virtue of Stirling’s formula, we have ( k + 1 ) ! ∼ 2 π ( k + 1 ) k + 1 e k + 1 , and then
lim k → ∞ | | δ k | | 1 k = lim k → ∞ e 1 + 1 k ( 2 π ) 1 k [ ( k + 1 ) 1 k + 1 ] 1 + 1 k ( k + 1 ) 1 + 1 k = 0 ,
i.e., δ is quasinilpotent.
Let T = τ ⊕ γ be the direct sum of τ and γ , W = u ⊕ v be the direct sum of u and v, S = σ ⊕ 0 be the direct sum of σ and 0. Then T , W and S are operators on H. We see that T = α + β , where α = τ ⊕ 0 and β = 0 ⊕ γ .
Claim 1. α has right W-core inverse. We directly check that τ u σ u = u τ u σ = I . Then α W S W = W α W S = I ⊕ 0 . Hence,
α ( W S ) 2 = [ α W S W ] S = S , ( W α W S ) * = W α W S , α W S W α = α .
Then S = α r # ◯ , W .
Claim 2. W β is quasinilpotent. Since W β = 0 ⊕ δ , we see that W β is quasinilpotent.
Claim 3. β W α = 0 . This is obvious.
Therefore T has a generalized right W-core inverse by Theorem 3.1.
As it is well known, an element a ∈ A has g-Drazin inverse if and only if it is quasi-polar, i.e., there exists an idempotent p ∈ A such that p a = a p ∈ A q n i l , a + p ∈ A − 1 (see [4]). For generalized w-weighted core-EP inverse, we establish the following polar-like characterization.
 Theorem 3.6. 
Let a ∈ A r d ◯ , w and n ∈ N . Then there exists a projection p ∈ A such that
p w a ∈ A q n i l , ( w a ) n + p ∈ A r − 1 a n d ( 1 − p ) A = w a ( 1 − p ) w a A .
 Proof. 
Since a ∈ A r d ◯ , w , by using Theorem 3.1, there exist x , y ∈ A such that
a = x + y , ( w x ) * ( w y ) = 0 , y w x = 0 , x ∈ A r # ◯ , w , y ∈ A w q n i l .
Let z = x r # ◯ , w . By virtue of Theorem 2.1, there exist x ∈ A such that
x ( w z ) 2 = z = z w x w z , ( w x w z ) * = w x w z , x w z w x = x .
Let p = 1 − w x w z . Then p 2 = p = p * , 1 − p ∈ w A and p w x = 0 . We directly check that
[ ( w x ) n + 1 − w x w z ] [ ( w z ) n + 1 − w x w z ] = ( w x ) n ( w z ) n + ( w x ) n ( 1 − w x w z ) + ( 1 − w x w z ) ( w z ) n + ( 1 − w x w z ) 2 = ( w x ) ( w z ) + ( w x ) n ( 1 − w x w z ) + [ w z − w x ( w z ) 2 ] ( w z ) n − 1 + ( 1 − w x w z ) = 1 + ( w x ) n ( 1 − w x w z ) .
Then
[ ( w x ) n + 1 − w x w z ] [ ( w z ) n + 1 − w x w z ] [ 1 − ( w x ) n ( 1 − w x w z ) ] = 1 .
Hence, ( w x ) n + 1 − w x w z ∈ A r − 1 .
Furthermore, we check that
y w − y w x w z w = y w ∈ A q n i l , ( w − w x w z w ) y = ( 1 − w x w z ) w y ∈ A q n i l , ( 1 − w x w z ) w x + ( w − w x w z w ) y ∈ A q n i l , p w a = p w ( x + y ) = ( 1 − w x w z ) w x + p w y = p y w ∈ A q n i l , w a ( 1 − p ) w a = w ( x + y ) ( w x w z ) w a = w x w x w z ( w x + w y ) = w x ( w x w z ) * ( w x + w y ) = w x ( w z ) * [ ( w x ) * w x + ( w x ) * w y ] = w x ( w z ) * ( w x ) * w x = w x ( w x w z ) w x = ( w x ) 2 = w ( x w z w x ) w x = ( w x w z ) ( w x ) 2 = ( 1 − p ) ( w x ) 2 , 1 − p = w x w z = ( w x ) 2 ( w z ) 3 = [ w a ( 1 − p ) w a ] ( w z ) 3 , ( 1 − p ) A = w a ( 1 − p ) w a A , ( w a ) n + p = ( w x + w y ) n + p = ( w x ) n + ∑ i = 1 n ( w x ) n − i ( w y ) i + p = [ ( w x ) n + p ] + ∑ i = 1 n ( w x ) n − i ( w y ) i = [ ( w x ) n + p ] [ 1 + ( ( w x ) n + p ) r − 1 ∑ i = 1 n ( w x ) n − i ( w y ) i ] .
as required. □
 Corollary 3.7. 
Let a ∈ A , w ∈ A − 1 and n ∈ N . Then the following are equivalent:
(1)
a ∈ A r d ◯ , w .
(2)
There exists a projection p ∈ A such that
p w a ∈ A q n i l , ( w a ) n + p ∈ A r − 1 a n d ( 1 − p ) A = w a ( 1 − p ) w a A .
Proof. ( 1 ) ⇒ ( 2 ) This is obvious by Theorem 3.6.
( 2 ) ⇒ ( 1 ) By hypothesis, there exists a projection p ∈ A such that
p w a ∈ A q n i l , ( w a ) n + p ∈ A r − 1 a n d ( 1 − p ) A = w a ( 1 − p ) w a A .
Then p w a ( 1 − p ) w a = 0 .
Set x = ( 1 − p ) w a and y = p w a . Then
x * y = [ ( w a ) * ( 1 − p ) * ] p w a = 0 , y x = p w a ( 1 − p ) w a = 0 , y = p w a ∈ A q n i l .
Write ( w a + p ) s = 1 and p s ( 1 − p ) = 0 . Then ( 1 − p ) w a s = ( 1 − p ) ( w a + p ) s = 1 − p , and so ( 1 − p ) w a s ( 1 − p ) w a = ( 1 − p ) w a and ( 1 − p ) w a s = ( 1 − p ) ( w a + p ) s = 1 − p . Hence, x = ( 1 − p ) w a ∈ A ( 1 , 3 ) .
Write x = w s and t = a − s . Then a = s + t , ( w s ) * ( w t ) = x * ( w a − x ) = x * [ w a − ( 1 − p ) w a ] = x * y = 0 , t w s = w − 1 ( w t ) x = w − 1 [ w a − ( 1 − p ) w a ] x = w − 1 y x = 0 and t ∈ A w q n i l .
We compute that s w s = w − 1 x 2 = w − 1 ( 1 − p ) w a ( 1 − p ) w a = a ( 1 − p ) w a . Since ( 1 − p ) A = w a ( 1 − p ) w a A , we can find a z ∈ A such that 1 − p = w a ( 1 − p ) w a z ; hence,
s = w − 1 ( 1 − p ) w a = w − 1 [ w a ( 1 − p ) w a z ] w a = a ( 1 − p ) w a z = ( s w s ) z ;
hence, s A ⊆ s w s A . Obviously, s w s A ⊆ s A . Accordingly, s A = s w s A . Moreover, we have A s = A w s = A x = A x * x = A ( w s ) * ( w s ) . In light of Corollary 2.2, s ∈ A r # ◯ , w . Therefore a ∈ A r d ◯ , w by Theorem 2.1. □
 Corollary 3.8. 
Let a ∈ A and n ∈ N . Then the following are equivalent:
(1)
a ∈ A r d ◯ .
(2)
There exists a projection p ∈ A such that
p a ∈ A q n i l , a n + p ∈ A r − 1 a n d ( 1 − p ) A = a ( 1 − p ) a A .
 Proof. 
Straightforward by choosing w = 1 in Corollary 3.7. □

4. Connections to Right wg-Drazin Inverses

This section establishes the relationship between the generalized right weighted core inverse and the right wg-Drazin inverse. Let a ∈ A and let
{ a r d ◯ , w } = { x ∈ A | a ( w x ) 2 = x = x w a w x , a w − x w ( a w ) 2 ∈ A q n i l } .
Next, we derive:
 Theorem 4.1. 
Let a , w ∈ A . Then the following are equivalent:
(1)
a ∈ A r d ◯ , w .
(2)
{ a r d , w } ⋂ A r # ◯ , w ≠ ∅ .
In this case, a r d ◯ = ( x w ) 2 x r # ◯ , w for x ∈ { a r d ◯ , w } ⋂ A r # ◯ , w .
Proof. ( 1 ) ⇒ ( 2 ) By virtue of Theorem 3.1, there exist z , y ∈ A such that
a = z + y , ( w z ) * ( w y ) = y w z = 0 , z ∈ A r # ◯ , w , y ∈ A w q n i l .
Set x = z r # ◯ , w . Then
a ( w x ) 2 = ( z + y ) w x w x = z ( w x ) 2 = x .
Moreover, we see that x w a w x = x w ( z + y ) w x = x w z w x = x . Since a w x w = ( z + y ) w x w = z w x w , we see that
a w − ( a w ) x w ( a w ) = a w − ( z + y ) w x w ( a w ) = ( z + y ) w − z w x w ( z + y ) w .
Observing that
w ( z + y ) − w z w x w ( z + y ) = w ( z + y ) − ( w z w x ) * w ( z + y ) = w ( z + y ) − ( w x ) * ( w z ) * ( w z + w y ) = w ( z + y ) − ( w x ) * ( w z ) * w z = w z + w y − ( w z w x ) w z = w y ∈ A q n i l ,
by using Cline’s formula, we have
a w − ( a w ) x w ( a w ) ∈ A q n i l .
By Cline’s formula again, we see that a w − x w ( a w ) 2 ∈ A q n i l . Thus, a ∈ A r d ◯ , w and x ∈ { a r d , w } ⋂ A r # ◯ , w . This implies that { a r d , w } ⋂ A r # ◯ , w ≠ ∅ .
( 2 ) ⇒ ( 1 ) Let z ∈ { a r d , w } ⋂ A r # ◯ , w . Then
a ( w z ) 2 = z , a w − z w ( a w ) 2 ∈ A q n i l .
Set x = ( z w ) 2 z r # ◯ , w . It is easy to verify that
a w x = a w ( z w ) 2 z r # ◯ , w = [ a ( w z ) 2 ] w z r # ◯ , w = z w z r # ◯ , w , a ( w x ) 2 = ( a w x ) w x = ( z w z r # ◯ , w ) w ( z w ) 2 z r # ◯ , w = [ z w z r # ◯ , w w z ] w z w z r # ◯ , w = ( z w ) 2 z r # ◯ , w = x , w a w x = w ( z w z r # ◯ , w ) = w z w z r # ◯ , w , ( w a w x ) * = ( w z w z r # ◯ , w ) * = w z w z r # ◯ , w = w a w x ,
Hence, we check that
( z w z r # ◯ , w w a ) w x = z w z r # ◯ , w ( w a w x ) = z w z r # ◯ , w ( w z w z r # ◯ , w ) = z w z r # ◯ , w , w ( z w z r # ◯ , w w a ) w x * = ( w z w z r # ◯ , w ) * = w z w z r # ◯ , w = w ( z w z r # ◯ , w w a ) w x , ( z w z r # ◯ , w w a ) ( w x ) 2 = z w z r # ◯ , w w ( z w ) 2 z r # ◯ , w = ( z w ) 2 z r # ◯ , w = x , ( z w z r # ◯ , w w a ) w x w ( z w z r # ◯ , w w a ) = z w z r # ◯ , w w ( z w z r # ◯ , w w a ) = z w z r # ◯ , w w a .
Thus, z w z r # ◯ , w w a ∈ A r # ◯ , w and [ z w z r # ◯ , w w a ] r # ◯ , w = x = ( z w ) 2 z r # ◯ , w .
Write a = a 1 + a 2 , where a 1 = z w z r # ◯ , w w a and a 2 = a − z w z r # ◯ , w w a . We verify that
a 2 w a 1 = [ a − z w z r # ◯ , w w a ] w [ z w z r # ◯ , w w a ] = a w z w z r # ◯ , w w a − z w z r # ◯ , w w a w z w z r # ◯ , w w a = a w z w z r # ◯ , w w a − z w z r # ◯ , w w z r # ◯ , w w a = z r # ◯ , w w a − z ( w z r # ◯ , w ) 2 w a = 0 .
Moreover, we check that
( a w − z w ( a w ) 2 ) [ 1 − z w z r # ◯ , w w ] = a w − z w ( a w ) 2 − ( 1 − z w a w ) a w z w z r # ◯ , w w = a w − z w ( a w ) 2 − ( 1 − z w a w ) a w z w z ( w z r # ◯ , w ) 2 w = a w − z w ( a w ) 2 − ( 1 − z w a w ) [ a ( w z ) 2 ] ( w z r # ◯ , w ) 2 w = a w − z w ( a w ) 2 − ( 1 − z w a w ) z ( w z r # ◯ , w ) 2 w = a w − z w ( a w ) 2 ∈ A q n i l .
By using Cline’s formula (see [11, Theorem 2.1]),
a 2 = a − z w z r # ◯ , w w a = [ 1 − z w z r # ◯ , w w ] ( a − z a 2 ) ∈ A q n i l .
Thus a = a 1 + a 2 is the generalized right weighted core decomposition of a. Accordingly,
a r e , d = ( a 1 ) r # ◯ , w = ( z w ) 2 z r # ◯ , w ,
as asserted. □
As an immediate consequence, we provide formulas of the weighted core-EP inverse of a complex matrix.
 Corollary 4.2. 
Let A , W ∈ C n × n . Then
A † ◯ , W = [ A D , W W ] 2 ( A D , W ) # ◯ , W ,
where k = m a x { i n d ( A W ) , i n d ( W A ) } .
 Proof. 
This is obvious by Theorem 4.1. □
 Lemma 4.3. 
Let z ∈ { a r d , w } . Then
lim n → ∞ | | ( ( a w ) n − a w z w ( a w ) n ) * | | 1 n = lim n → ∞ | | ( a w ) n − a w z w ( a w ) n | | 1 n = 0 .
 Proof. 
Let x = a − a w z w a . Then x w ∈ A q n i l . For any λ ∈ C , we have 1 − λ ¯ x w ∈ A − 1 , and so 1 − λ ( x w ) * ∈ A − 1 . Thus, ( x w ) * ∈ A q n i l . Obviously, ( 1 − a w z w ) a w z w = 0 , we see that ( a w − a w z w ) n = ( 1 − a w z w ) ( a w ) n . Hence, we derive that
| | ( ( a w ) n − a w z w ( a w ) n ) * | | 1 n = | | ( ( a w ) n ) * ( 1 − a w z w ) * | | = | | ( ( a w ) n ) * [ ( 1 − a w z w ) n ] * | | = | | [ ( a w − a w z w a w ) n ] * | | = | | ( ( x w ) * ) n | | .
Since ( x w ) * ∈ A q n i l , we have
lim n → ∞ | | ( ( a w ) n − a w z w ( a w ) n ) * | | 1 n = 0 .
Analogously, we prove that lim n → ∞ | | ( a w ) n − a w z w ( a w ) n | | 1 n = 0 . , as asserted. □
 Lemma 4.4. 
Let a ∈ A r d ◯ , w . Then
lim n → ∞ | | ( ( a w ) n − a w a r d , w w ( a w ) n ) * | | 1 n = 0 .
 Proof. 
Construct x , y as in the proof of Theorem 3.1. Since ( 1 − a w x w ) a w x w a w = 0 , we deduce that ( a w − a w x w a w ) n = ( 1 − a w x w ) ( a w ) n . Then
| | ( ( a w ) n − a x w w ( a w ) n ) * | | = | | [ ( 1 − a x w w ) ( a w ) n ] * | | = | | ( ( y w ) * ) n | | 1 n = 0 .
Therefore
lim n → ∞ | | ( a n − a n ( a r e , d ) n a n ) * | | 1 n = 0 ,
as asserted. □
We are ready to prove:
 Theorem 4.5. 
Let a ∈ A . Then a ∈ A r d ◯ , w if and only if there exist x ∈ A and z ∈ { a r d , w } such that
a ( w x ) 2 = x = x w a w x , x A = z A , A x = A ( w a w z ) * .
In this case, a r d ◯ , w = x .
 Proof. 
⟹ Choose x = a r d ◯ , w . As in the proof of Theorem 4.1, x = x w a w x = a ( w x ) 2 . By using Theorem 4.1, we can find z ∈ { a r d , w } ⋂ A r # ◯ , w such that
x = ( z w ) 2 z r # ◯ , w .
Then we have
a ( w z ) 2 = z = z w a w z , a w − ( z w ) ( a w ) 2 ∈ A q n i l .
Obviously, z = z w z r # ◯ , w w z = ( z w ) 2 ( z r # ◯ , w w ) 2 z = x w z r # ◯ , w w z . Accordingly, we have x A = z A .
Since a ( w x ) 2 = x , we have ( w a ) ( w x ) = ( w a ) n ( w x ) n , and then
x = x w a w x = x ( w a w x ) * = x ( ( w a ) n ( w x ) n ) * = x ( ( w x ) n ) * ( ( w a ) n ) * = x ( ( w x ) n ) * ( ( w a ) n − w a w z ( w a ) n ) * + x ( ( w x ) n ) * ( ( w a ) n ) * ( w a w z ) * = x ( ( w x ) n ) * ( ( w a ) n − w a w z ( w a ) n ) * + x ( w a w x ) * ( w a w z ) * .
Hence,
| | x − x ( w a w x ) * ( w a w z ) * | | 1 n = | | x ( ( w x ) n ) * ( ( w a ) n − w a w z ( w a ) n ) * | | 1 n ≤ | | x ( ( w x ) n ) * | | 1 n | | ( ( w a ) n − w a w z ( w a ) n ) * | | 1 n .
In view of Lemma 4.3,
lim n → ∞ | | ( ( w a ) n − w a w z ( w a ) n ) * | | 1 n = 0 ,
we derive that
lim n → ∞ | | x − x ( w a w x ) * ( w a w z ) * | | 1 n = 0 ;
hence, x = x ( w a w x ) * ( w a w z ) * . Then A x ⊆ A ( w a w z ) * .
Since a ( w z ) 2 = z , we have ( w a ) n ( w z ) n = w a w z , and then we derive that
| | ( w a w z ) * − ( w a w z ) * w a w x | | 1 n = | | ( ( w z ) n ) * ( ( w a ) n ) * − ( ( w z ) n ) * ( w a w x ( w a ) n ) * | | 1 n = | | ( ( w z ) n ) * ( ( w a ) n − w a w x ( w a ) n ) * | | 1 n ≤ | | ( ( w z ) n ) * | | 1 n | | ( ( w a ) n − w a w x ( w a ) n ) * | | 1 n .
In light of Lemma 4.4, we see that
lim n → ∞ | | ( ( w a ) n − w a w x ( w a ) n ) * | | 1 n = 0 .
Then
lim n → ∞ | | ( w a w z ) * − ( w a w z ) * w a w x | | 1 n = 0 ,
and so ( w a w z ) * = ( w a w z ) * w a w x . Hence A ( w a w z ) * ⊆ A x . Therefore A x = A ( w a w z ) * , as required.
⟸ By hypothesis, there exist x ∈ A and z ∈ { a r d ◯ , w } such that
a ( w x ) 2 = x = x w a w x , x A = z A , A x = A ( w a w z ) * .
We claim that a r d ◯ , w = x .
Claim 1.
lim n → ∞ | | ( a w ) n − a w x w ( a w ) n | | 1 n = 0 .
Write z = x y for some y ∈ A . For any n ∈ N , we have
( a w ) n = [ ( a w ) n − ( a w ) ( z w ) ( a w ) n ] + ( a w ) ( z w ) ( a w ) n , a w x w ( a w ) n = a w x w [ ( a w ) n − a w z w ( a w ) n ] + a w x w a w z w ( a w ) n = a w x w [ ( a w ) n − a w z w ( a w ) n ] + a w ( x w a w x ) y w ( a w ) n = a w x w [ ( a w ) n − a w z w ( a w ) n ] + a w x y w ( a w ) n = a w x w [ ( a w ) n − ( a w ) ( z w ) ( a w ) n ] + a w z w ( a w ) n .
Hence,
( a w ) n − a w x w ( a w ) n = ( 1 − a w x w ) [ ( a w ) n − ( a w ) ( z w ) ( a w ) n ] ,
and so
| | ( a w ) n − a w x w ( a w ) n | | 1 n ≤ | | 1 − a w x w | | 1 n | | ( a w ) n − ( a w ) ( z w ) ( a w ) n | | 1 n ,
we have
lim n → ∞ | | ( a w ) n − a w x w ( a w ) n | | 1 n = 0 .
Claim 2. ( w a w x ) * = w a w x .
Since A x = A ( w a w z ) * , we have x * A = w a w z A . Write w a w z = x * s for some s ∈ A . Since x w a w x = x , we have x * w * a * w * x * = x * , and so ( w a w x ) * x * = x * . We infer that ( w a w x ) * w a w z = ( w a w x ) * ( x * s ) = [ ( w a w x ) * x * ] s = ( x w a w x ) * s = x * s = w a w z . Since x A = z A , we can find t ∈ A such that x = z t . Then ( w a w x ) * ( w a w x ) = ( w a w x ) * w a w ( z t ) = [ ( w a w x ) * w a w z ] t = ( w a w z ) t = w a w ( z t ) = w a w x . Hence ( w a w x ) * = [ ( w a w x ) * ( w a w x ) ] * = ( w a w x ) * ( w a w x ) = w a w x .
Therefore a r d ◯ , w = x , as asserted. □
 Corollary 4.6. 
Let a ∈ A . Then a ∈ A r d ◯ if and only if there exist x ∈ A and z ∈ { a r d } such that
a x 2 = x = x a x , x A = z A , A x = A ( a z ) * .
In this case, a r d = x .
 Proof. 
Straightforward from Theorem 4.5. □

5. Right Pesudo Weighted Core Inverses

In this section, we are concerned with right pesudo weighted core inverse in a Banach *-algebra. Let a ∈ A , and let
{ a r D , w } = { x ∈ A | a ( w x ) 2 = x = x w a w x , ( a w ) k = a w x w ( a w ) k f o r s o m e k ∈ N } .
Evidently, a ∈ A has the right w-Drazin inverse if and only if { a r D , w } ≠ ∅ .
 Lemma 5.1. 
Let a ∈ A . Then a ∈ A r D ◯ , w if and only if
(1)
a ∈ A r d ◯ , w ;
(2)
{ a r D , w } ≠ ∅ .
In this case, a r D ◯ , w = a r d ◯ , w .
 Proof. 
⟹ This implication is obvious.
⟸ Let x = a r d ◯ , w . Then
a ( w x ) 2 = x = x w a w x , ( w a w x ) * = w a w x , lim n → ∞ | | ( a w ) n − a w x w ( a w ) n | | 1 n = 0 .
Let y ∈ { a r D , w } . Then a ( w y ) 2 = y = y w a w y , ( a w ) k = a w y w ( a w ) k f o r s o m e k ∈ N . Set z = y w a w x . Then we verify that
w a w z = w a w ( y w a w x ) = w a w y ( w a ) k ( w x ) k = w [ a w y w ( a w ) k ] x ( w x ) k − 1 = w ( a w ) k x ( w x ) k − 1 = w a w ( a w ) k − 1 ( x w ) k − 1 x = w a w ( a w ) ( x w ) x = ( w a ) 2 ( w x ) 2 = w a w x .
Hence ( w a w z ) * = ( w a w x ) * = w a w x = w a w z . We observe that
a w z w = a w y w a w x w = a w y w ( a w ) k ( x w ) k = a w x w , a ( w z ) 2 = a w z w z = a w x w z = a w x w y w a w x = a w x w [ a ( w y ) 2 ] w a w x = [ a ( w y ) 2 ] w a w x = y w a w x = z , z w a w z = y w a w x ( w a w z ) = y w a w ( x w a w x ) = y w a w x = z .
Moreover, we have
( a w ) k − a w z w ( a w ) k = ( a w ) k − a w x w ( a w ) k = ( a w ) ( a y ) ( a w ) k − a w x w [ ( a w ) ( a y ) ( a w ) k ] = ( a w ) n ( a y ) n ( a w ) k − a w x w [ ( a w ) n ( a y ) n ( a w ) k ] = [ ( a w ) n − a w x w ( a w ) n ] ( a y ) n ( a w ) k .
Hence,
| | ( a w ) k − a w z w ( a w ) k | | ≤ | | ( a w ) n − a w x w ( a w ) n | | | | ( a y ) n ( a w ) k | | .
Since lim n → ∞ | | ( a w ) n − a w x w ( a w ) n | | 1 n = 0 , we deduce that
lim n → ∞ | | ( a w ) k − a w z w ( a w ) k | | 1 n = 0 ;
and then ( a w ) k = a w z w ( a w ) k . Therefore a ∈ A r D , w . □
We are ready to prove:
 Theorem 5.2. 
Let a ∈ A . Then the following are equivalent:
(1)
a ∈ A r D ◯ , w .
(2)
There exist x , y ∈ A such that
a = x + y , x * y = y w x = 0 , x ∈ A r # ◯ , w , y w ∈ A n i l .
(3)
There exist x , y ∈ A such that
a = x + y , y w x = 0 , x ∈ A r # ◯ , w , y w ∈ A n i l .
Proof. ( 1 ) ⇒ ( 2 ) By virtue of Lemma 5.1, a ∈ A r d ◯ , w and a r d ◯ , w = a r D ◯ , w . In view of Theorem 3.1, we can find x , y ∈ A such that
a = x + y , x * y = y w x = 0 , x ∈ A r # ◯ , y ∈ A w q n i l .
Explicitly, we have y = a − a w a r d ◯ , w w a = a − a w a r D ◯ , w w a . Set z = a r D ◯ , w . Then a ( w z ) 2 = z = z w a w z , ( w a w z ) * = w a w z and a w a z ( a w ) k = ( a w ) k for some k ∈ N . It is easy to see that
( 1 − a w z w ) a w ( a w z ) = ( 1 − a w z w ) a w ( ( a w ) k − 1 z ( w z ) k − 2 ) = ( 1 − a w z w ) ( a w ) k z ( w z ) k − 2 = 0 .
Moreover, we verify that
( a w − z w ( a w ) 2 ) k + 2 = ( 1 − z w a w ) a w [ a w − z w ( a w ) 2 ] k [ a w − z w ( a w ) 2 ] = ( 1 − z w a w ) a w [ a w − z w ( a w ) 2 ] k − 1 [ a w − z w ( a w ) 2 ] a w = ( 1 − z w a w ) a w ( a w − z w ( a w ) 2 ) k − 1 ( a w ) 2 ⋮ = ( 1 − z w a w ) a w ( a w − z w ( a w ) 2 ) ( a w ) k = ( 1 − z w a w ) ( ( a w ) k − a w z w ( a w ) k ) ( a w ) = 0 .
This implies that a w − z w ( a w ) 2 ∈ A n i l . Therefore y w = a w − a w z w a w ∈ A n i l , as desired.
( 2 ) ⇒ ( 1 ) By hypothesis, there exist x , y ∈ A such that
a = x + y , x * y = y w x = 0 , x ∈ A r # ◯ , w , y w ∈ A n i l .
Since A n i l ⊆ A q n i l . In view of Theorem 3.1, a ∈ A r d ◯ , w and z : = a r d ◯ , w = x r # ◯ , w . Hence, a ( w z ) 2 = z and ( w a w z ) * = w a w z . Write ( y w ) k = 0 ( k ∈ N ) . Then
( a w ) k = ∑ i = 0 k ( x w ) i ( y w ) n − i = ( y w ) k + x w ( y w ) k − 1 + … + ( x w ) k − 1 y w + ( x w ) k = x w ( y w ) k − 1 + … + ( x w ) k − 1 y w + ( x w ) k .
Then
a w z w ( a w ) k = ( x w + y w ) x r # ◯ w x [ ( y w ) k − 1 + … + ( x w ) k − 2 y w + ( x w ) k − 1 ] = x w [ ( y w ) k − 1 + … + ( x w ) k − 2 y + ( x w ) k − 1 ] = ( a w ) k .
Therefore a ∈ A r D ◯ , w , as asserted. □
Recall that a has w-Drazin inverse x provided that the following identities are satisfied:
x w a w x = x , a w x = x w a , x w ( a w ) k = ( a w ) k + 1
for some k ∈ N .
 Corollary 5.3. 
Let a ∈ A . Then a ∈ A D ◯ , w if and only if
(1)
a ∈ A D , w ;
(2)
there exist x , y ∈ A such that
a = x + y , x * y = y w x = 0 , x ∈ A r # ◯ , y ∈ A n i l .
(3)
there exist x , y ∈ A such that
a = x + y , y w x = 0 , x ∈ A r # ◯ , y ∈ A n i l .
 Proof. 
⟹ This is obvious by Theorem 5.2 and [5, Lemma 2].
⟸ In view of Theorem 5.2, a ∈ A r D , w . Therefore we complete the proof by [5, Lemma 2]. □
 Theorem 5.4. 
Let a ∈ A . Then the following are equivalent:
(1)
a ∈ A r D ◯ , w .
(2)
There exists m ∈ N such that a ( w a ) k − 1 ∈ A r # ◯ , w for any k ≥ m .
(3)
a ( w a ) k − 1 ∈ A r # ◯ , w for some k ∈ N .
Proof. ( 1 ) ⇒ ( 2 ) By hypothesis, there exist z ∈ A and m ∈ N such that
a ( w z ) 2 = z , ( w a w z ) * = w a w z , ( a w ) m − 1 = ( a w ) ( z w ) ( a w ) m − 1 .
Let x = ( z w ) k − 1 z ( k ≥ m ) . Then ( a w ) k − 1 = ( a w ) ( z w ) ( a w ) k − 1 , and so
( w a ) k w x = ( w a ) k − 1 w a w ( z w ) k − 1 z = ( w a ) k − 1 w [ a ( w z ) 2 ] ( w z ) k − 2 = ( w a ) k − 1 w z ( w z ) k − 2 = ( w a ) k − 1 ( w z ) k − 1 = w a w z , a ( w a ) k − 1 ( w x ) 2 = w − 1 ( w a w z ) ( w x ) = a w z w ( z w ) k − 1 z = [ a ( w z ) 2 ] w ( z w ) k − 2 z = z w ( z w ) k − 2 z = ( z w ) k − 1 z = x , w a ( w a ) k − 1 w x = ( w a ) k w x = w a w z , w [ a ( w a ) k − 1 ] w x = w [ a ( w a ) k − 1 ] w x , a ( w a ) k − 1 w x w a ( w a ) k − 1 = a ( w a ) k − 1 w ( z w ) k − 1 z w a ( w a ) k − 1 = ( a w ) k ( z w ) k [ a ( w a ) k − 1 ] = a w z w a ( w a ) k − 1 = a w z w [ a ( w a ) k − 1 ] = [ a w z w ( a w ) k − 1 ] = a ( w a ) k − 1 .
Therefore a ( w a ) k − 1 ∈ A r # ◯ , w , as required.
( 2 ) ⇒ ( 3 ) This is trivial.
( 3 ) ⇒ ( 1 ) Set x = a ( w a ) k − 2 w [ a ( w a ) k − 1 ] r # ◯ , w . Then we verify that
a w x = a w a ( w a ) k − 2 w [ a ( w a ) k − 1 ] r # ◯ , w = a ( w a ) k − 1 w [ a ( w a ) k − 1 ] r # ◯ , w , ( w a w x ) * = w [ a ( w a ) k − 1 ] w [ a ( w a ) k − 1 ] r # ◯ , w * = w [ a ( w a ) k − 1 ] w [ a ( w a ) k − 1 ] r # ◯ , w = w a w x , a ( w x ) 2 = a ( w a ) k − 1 w [ a ( w a ) k − 1 ] r # ◯ , w ( w a ) k − 1 w [ a ( w a ) k − 1 ] r # ◯ , w = a ( w a ) k − 1 w [ a ( w a ) k − 1 ] r # ◯ , w w a ( w a ) k − 1 ( w a ) k − 1 [ a ( w a ) k − 1 ] r # ◯ , w 2 = [ a ( w a ) k − 1 w [ a ( w a ) k − 1 ] r # ◯ , w w a ( w a ) k − 1 ] ( w a ) k − 1 [ a ( w a ) k − 1 ] r # ◯ , w 2 = a ( w a ) k − 1 ( w a ) k − 1 [ a ( w a ) k − 1 ] r # ◯ , w 2 = a ( w a ) k − 2 w [ a ( w a ) k − 1 ] [ a ( w a ) k − 1 ] r # ◯ , w 2 = a ( w a ) k − 2 w [ a ( w a ) k − 1 ] r # ◯ , w = x , a w x w ( a w ) k = [ a ( w a ) k − 1 w [ a ( w a ) k − 1 ] r # ◯ , w w a ( w a ) k − 1 ] w = a ( w a ) k − 1 w = ( a w ) k .
This completes the proof. □
 Corollary 5.5. 
Let a ∈ A . Then the following are equivalent:
(1)
a ∈ A r D ◯ , w .
(2)
a ( w a ) k − 1 ∈ A w ( 1 , 3 ) and ( a w ) k A = ( a w ) k + 1 A for some k ∈ N .
Proof. ( 1 ) ⇒ ( 2 ) In view of Theorem 5.4, a ( w a ) k − 1 ∈ A w ( 1 , 3 ) . By hypothesis, there exist x ∈ A such that
a ( w x ) 2 = x , ( w a w x ) * = w a w x , ( a w ) k = ( a w ) ( x w ) ( a w ) k
for some k ∈ N . Then ( a w ) k = ( a w ) k + 1 ( x w ) k + 1 ( a w ) k ; hence, ( a w ) k A = ( a w ) k + 1 A , as required.
( 2 ) ⇒ ( 1 ) In view of Theorem 5.4, we will suffice to prove a ( w a ) k − 1 ∈ A r # ◯ , w .
We claim that a ( w a ) k − 1 A = a ( w a ) k − 1 w a ( w a ) k − 1 A . Obviously, we have a ( w a ) k − 1 w a ( w a ) k − 1 A ⊆ a ( w a ) k − 1 A . Since a ( w a ) k − 1 ∈ A w ( 1 , 3 ) , we can find some z ∈ A such that a ( w a ) k − 1 = a ( w a ) k − 1 w z w a ( w a ) k − 1 . As ( a w ) k A = ( a w ) k + 1 A , by induction, we have ( a w ) k A = ( a w ) k + m A for any m ∈ N . Thus, we derive that
a ( w a ) k − 1 = a ( w a ) k − 1 w z w a ( w a ) k − 1 = ( a w ) k z w a ( w a ) k − 1 ∈ ( a w ) 2 k z w a ( w a ) k − 1 A ⊆ ( a w ) k ( a w ) k − 1 a w A = a ( w a ) k − 1 w a ( w a ) k − 1 A ,
and then a ( w a ) k − 1 A = a ( w a ) k − 1 w a ( w a ) k − 1 A . By virtue of Theorem 2.1, a ( w a ) k − 1 ∈ A r # ◯ , w . Therefore a ∈ A r D , w by Theorem 5.4. □
We proceed to prove:
 Theorem 5.6. 
Let a ∈ A . Then a ∈ A r D ◯ , w if and only if there exist a projection p ∈ A and k ∈ N such that
w a + p ∈ A r − 1 , ( 1 − p ) A = w a ( 1 − p ) w a A , ( p w a ) k = 0 , a ( w a ) k − 1 ∈ A ( 1 , 3 ) .
 Proof. 
⟹ In light of Theorem 3.6, there exists a projection p ∈ A such that
w a + p ∈ A r − 1 , p w a ∈ A q n i l , ( 1 − p ) A = w a ( 1 − p ) w a A .
Explicitly, p = 1 − w a w a r D ◯ , w . As in the proof of Theorem 3.1, we check that p w a = ( 1 − w a w a r D ◯ , w ) w a ∈ A n i l . Write ( p w a ) m = 0 for some m ∈ N . By using Theorem 5.4, we can find a k ≥ m such that a ( w a ) k − 1 ∈ A ( 1 , 3 ) , as required.
⟸ By hypothesis, there exist a projection p ∈ A and k ≥ 2 such that
w a + p ∈ A r − 1 , ( 1 − p ) A = w a ( 1 − p ) w a A , ( p w a ) k − 1 = 0 , a ( w a ) k − 1 ∈ A w ( 1 , 3 ) .
Then p w a ( 1 − p ) w a = 0 , and so p w a = p w a p . Hence, p ( w a ) 2 = ( p w a ) w a = ( p w a p ) w a = ( p w a ) 2 . By induction, we have p ( w a ) k − 1 = ( p w a ) k − 1 = 0 . This implies that ( w a ) k − 1 = ( 1 − p ) ( w a ) k − 1 . Since 1 − p ∈ w a ( 1 − p ) A , by induction, 1 − p ∈ ( w a ) m for any m ≥ 2 . Then ( w a ) k − 1 ∈ ( w a ) k + 1 A . Therefore ( a w ) k = a ( w a ) k − 1 w ∈ a ( w a ) k + 1 A ⊆ ( a w ) k + 1 A . This implies that ( a w ) k A = ( a w ) k + 1 A . According to Corollary 5.5, a ∈ A r D , w . □
As an immediate consequence, we derive
 Corollary 5.7. 
Let a ∈ A . Then a ∈ A D ◯ , w if and only if a ∈ A D , w and there exist a projection p ∈ A and k ∈ N such that
w a + p ∈ A r − 1 , ( 1 − p ) A = w a ( 1 − p ) w a A , ( p w a ) k = 0 , a ( w a ) k − 1 ∈ A ( 1 , 3 ) .
 Remark 5.8. 
Generalized weighted left core inverse can be defined dually. The corresponding results for the generalized weighted left core inverse can be established in a similar way.

References

  1. O.M. Baksalary and G. Trenkler, Core inverse of matrices, Linear Multilinear Algebra, 58(2010), 681–697. [CrossRef]
  2. R. Behera; G. Gayatri and J.K. Sahoo and P.S. Stanimirović, Characterizations of the weighted core-EP inverses, Bull. Iran. Math. Soc., 48(2022), 3659–3686. [CrossRef]
  3. N. Castro-Gonzalez and J.J. Koliha, New additive results for the g-Drazin inverse, Proc. R. Soc. Edinb.Secr. A, 134(2004), 1085–1097. [CrossRef]
  4. H. Chen and M. Sheibani, Theory of Clean Rings and Matrices, Singapore: World Scientific, 2023.
  5. H. Chen and M. Sheibani, Generalized right core inverse in *-Banach algebras, Preprints 2024, 2024061246. [CrossRef]
  6. J. Chen; H. Zhu; P. Patricio and Y. Zhang, Characterizations and representations of core and dual core inverses, Canad. Math. Bull., 2016. [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. G. Chowdhry and F. Roy, A W-weighted generalization of {1,2,3,1k}-inverse for rectangular matrices, The Journal of Analysis, 32(2024), 2913–2937. [CrossRef]
  9. Y. Gao; J. Chen and P. Ptricio, Representations and properties of the W-weighted core-EP inverse, Linear Multilinear Algebra, 68(2020), 1160–1174. [CrossRef]
  10. Y. Gao and J. Chen, Pseudo core inverses in rings with involution, Comm. Algebra, 46(2018), 38–50. [CrossRef]
  11. Y. Liao; J. Chen and J. Cui, Cline’s formula for the generalized Drazin inverse, Bull. Malays. Math. Sci. Soc., 37(2014), 37–42.
  12. H. Ma, A characterization and perturbation bounds for the weighted core-EP inverse, Quaest. Math., 43(2020), 869–879. [CrossRef]
  13. D. Mosić, Weighted generalized Drazin inverse in rings, Georgian Math. J., 23(2016), 587–594.
  14. D. Mosić, Weighted core-EP inverse of an operator between Hilbert spaces, Linear Multilinear Algebra, 67(2019), 278–298. [CrossRef]
  15. D. Mosić, Weighted core-EP inverse and weighted core-EP pre-orders in a C*-algebra, J. Aust. Math. Soc., 111(2021), 76–110. [CrossRef]
  16. D. Mosić and J. Marovt, Weighted generalized core-EP inverse, Linear Multilinear Algebra, 2024, 1–22. [CrossRef]
  17. K.M. Prasad and K.S. Mohana, Core-EP inverse, Linear Multilinear Algebra, 62(2014), 792–802. [CrossRef]
  18. L. Wang; D. Mosić and Y.F. Gao, Right core inverse and the related generalized inverses, Commun. Algebra, 47(2019), 4749–4762. [CrossRef]
  19. L. Wang; P. Zhai; T. Li and H. Zou, The one-sided EP invertibility and the related generalized inverses, Commun. Algebra, 53(2025), 3046–3061. [CrossRef]
  20. C. Wu and J. Chen, The {1,2,3,1m}-inverses: a generalization of core inverses for matrices, Appl. Math. Comput., 427(2022), Paper No. 127149.
  21. D.S Rakić; N.C. Dincic and D.S. Djordjevic, Group, Moore-Penrose, core and dual core inverse in rings with involution, Linear Algebra Appl., 463(2014), 115–133. [CrossRef]
  22. Y. Ren and L. Jiang, Left and right-Drazin inverses in rings and operator algebras, J. Algebra Appl., 23(2024), No. 4, Article ID 2450064, 16 p. [CrossRef]
  23. B. Sitha; R. Behera and J.K. Sahoo, Characterizations of weighted generalized inverses, arXiv: 2311.17559v1 [math.NA] 29 Nov 2023.
  24. P.S. Stanimirović; V.N. Katsikis and H. Ma, Representations and properties of the W-weighted Darzin inverse, Linear Multilinear Algebra, 65(2017), 1080–1096.
  25. S. Xu; J. Chen and X. Zhang, New characterizations for core inverses in rings with involution, Front. Math. China, 2017. [CrossRef]
  26. Q. Zhang; C. Wang and H. Zhu, Characterizations and representations of w-core inverses in rings, Filomat, 37(2023), 3183–3190.
  27. H. Zhu; C. Wang and Q. Wang, Left w-core inverses in rings with involution, Mediterr. J. Math., 337(2023). [CrossRef]
  28. H. Zhu; L. Wu and J. Chen, A new class of generalized inverses in semigroups and rings with involution, Commun. Algebra, 51(2023), 2098–2113. [CrossRef]
  29. H. Zhu; L. Wu and D. Mosić, One-sided w-core inverses in rings with an involution, Linear Algebra Appl., 71(2023), 528–544. [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.
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.