Preprint
Article

This version is not peer-reviewed.

The Generalized w-Core Inverse in Banach Algebras with Involution

Submitted:

25 August 2025

Posted:

27 August 2025

You are already at the latest version

Abstract
In this paper, we present the concept of the generalized w-core inverse within the context of a Banach *-algebra. We delineate the characteristics of this new generalized inverse by using the generalized weighted core decomposition and elucidate its representations via the weighted g-Drazin inverse. Additionally, we delve into an examination of the generalized w-core orders. This work broadens the scope of the weighted core inverse and pseudo core inverse, previously defined for complex matrices and linear bounded operators, to a more general setting.
Keywords: 
;  ;  ;  ;  

1. Introduction

A Banach algebra A 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 . Rakic et al. generalized the core inverse of a complex matrix to the case of an element in a ring (see [21]). An element a in a Banach *-algebra A has core inverse if and only if there exist 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 # (see [1,6]).
Zhu et al. introduced and studied w-core inverse for a ring element (see [30]). Let a , w A . An element a A has w-core inverse if there exist x A such that
a w x 2 = x , ( a w x ) * = a w x , x a w a = a .
If such x exists, it is unique, and denote it by a w # . Let A w # denote the set of all w-core invertible elements in A . The w-core inverse was studied by many authors, e.g., [7,10,11,12,24,25,30,32]. As is well known,
a A w # a w x 2 = x , ( a w x ) * = a w x , x a w a = a , a w x a = a , x a w x = x
(see [30], [Theorem 2.13]).
Prasad et al. extended the concept of the core inverse and introduced the notion of core-EP inverse (i.e., pseudo core inverse) (see [8,19]). 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 . The core-EP inverse has been investigated from many different views, e.g., [2,8,9,14,15,16,17,19,22,27,28].
The motivation of this paper is to introduce and examine a new type of generalized weighted inverse, which serves as a logical extension of the generalized inverses mentioned above. Let
A q n i l = { x A lim n x n 1 n = 0 } .
As is well known, x A q n i l if and only if 1 + λ x A is invertible for any λ C . Set A w q n i l = { x A x w A q n i l } . In Section 2, we introduce generalized weighted core inverse in terms of a new kind of generalized weighted core decomposition. Many new properties of the w-core inverse and core-EP inverse are thereby obtained.
Definition 1.1.
An element a A has generalized w-core decomposition if there exist x , y A such that
a = x + y , x * y = y w x = 0 , x A w # , y A w q n i l .
Let a , w A . We prove that a A has generalized w-core decomposition if and only if there exists unique x A such that
x = a w x 2 , ( a w x ) * = a w x , x ( a w ) 2 x = a w x , lim n | | ( a w ) n a w x ( a w ) n | | 1 n = 0 .
Recall that a A has g-Drazin inverse (i.e., generalized Drazin inverse) if there exists x A such that
a x 2 = x , a x = x a , a a 2 x A q n i l .
Such x is unique, if exists, and denote it by a d . The g-Drazin inverse is of great importance in matrix and operator theory (see [3]). An element a A has generalized w-Drazin inverse x if there exists unique x A such that
a w x = x w a , x w a w x = x a n d a a w x w a A q n i l .
We denote x by a d , w (see [13]). Evidently, a d , w = x if and only if x = [ ( a w ) d ] 2 a = a [ ( w a ) d ] 2 = ( a w ) d a ( w a ) d . In Section 3, we establish equivalences between the generalized w-core inverse and the weighted g-Drazin inverse for Banach algebra elements using involved images. We prove that a A w d if and only if a A d , w and there exists x A such that x a w x = x , x A = a d , w A , A x = A ( a d , w ) * .
The aim of Section 4 is to characterize the generalized weighted core inverse of an element in a Banach *-algebra in terms of other related generalized inverses, such as the weighted core inverse. It is shown that a A w d if and only if a A d , w and a d , w A w # .
Finally, in Section 5, we introduce the generalized w-core order for elements in a Banach *-algebra. Let w A and a , b A w d . We say that a w d b provided that
a w a w d = b w a w d , a w d a = a w d b .
The characterizations of the generalized weighted core order are present.
Throughout the paper, all Banach *-algebras are complex with an identity. A d , w and A w # denote the sets of all weighted g-Drazin and w-core invertible elements in A , respectively. Let C n × n be the Banach algebra of all n × n complex matrices with conjugate transpose *.

2. Generalized w-Core Decomposition

The objective of this section is to introduce the concept of the generalized w-core inverse within the framework of a Banach *-algebra. We begin with
Theorem 2.1.
Let a , w A . Then the following are equivalent:
(1)
a A has generalized w-core decomposition.
(2)
There exists x A such that
x = a w x 2 , ( a w x ) * = a w x , x ( a w ) 2 x = a w x , lim n | | ( a w ) n a w x ( a w ) n | | 1 n = 0 .
Proof. 
( 1 ) ( 2 ) By hypothesis, there exist z , y A such that
a = z + y , z * y = y w z = 0 , z A w # , y A w q n i l .
Set x = z w # . Then
a w x = ( z + y ) w z w # = z w z w # , ( a w x ) * = a w x , a w x 2 = ( a w x ) x = z w z w # ( z + y ) = z w z w # z = x .
It is easy to verify that
x a w x = z w # ( z w z w # ) = z w # = x , x ( a w ) 2 x = ( x a w ) ( a w x ) = z w # ( z + y ) w z w z w # = z w # z w z w z w # = z w # z w z w z w # = z w z w # = a w x .
Moreover, we have
a w x a = ( a w x ) a = z w z w # ( z + y ) = z w z w # z = z ,
and so
a a w x a = a z = y A w q n i l .
Then
| | ( a w ) n a w x ( a w ) n | | = | | ( a a w x a ) w ( a w ) n 1 | | = | | y w ( a w ) n 1 | | = | | y w a w ( a w ) n 2 | | = | | y w ( z + y ) w ( a w ) n 2 | | = | | ( y w ) 2 ( a w ) n 2 | | = = | | ( 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 ( a w ) n | | 1 n = 0 ,
as required.
( 2 ) ( 1 ) By hypotheses, there exists x A such that
x = a w x 2 , ( a w x ) * = a w x , x ( a w ) 2 x = a w x , lim n | | ( a w ) n a w x ( a w ) n | | 1 n = 0 .
Then we check that
x a w x = x a w ( a w x 2 ) = [ x ( a w ) 2 x ] x = a w x 2 = x .
Set z = a w x a and y = a a w x a . We verify that
y w z = ( a a w x a ) w a w x a = a w a w x a a w x ( a w ) 2 x a = a w a w x a a w ( a w x ) a = 0 , z * y = ( a w x a ) * y = a * ( a w x ) y = a * ( a w x ) ( a a w x a ) = a * a w ( x a x a w x a ) = 0 .
We claim that z A w # and z w # = x .
Claim 1. x = z w x 2 . We verify that
z w x 2 = a w x ( a w x 2 ) = a w x 2 = x .
Claim 2. ( z w x ) * = z w x . Clearly, we have z w x = a w ( x a w x ) = a w x , and then ( z w x ) * = ( a w x ) * = a w x = z w x .
Claim 3. x z w z = z . One checks that
x z w z = ( x a w x ) a w a w x a = x ( a w ) 2 x a = a w x a = z .
Therefore z A w # . Moreover, we see that
| | ( a w ) n a w x ( a w ) n | | = | | ( a a w x a ) w ( a w ) n 1 | | = | | y w ( a w ) n 1 | | = | | y w a w ( a w ) n 2 | | = | | y w ( z + y ) w ( a w ) n 2 | | = | | ( y w ) 2 ( a w ) n 2 | | = = | | ( y w ) n | | .
Therefore
lim n | | ( y w ) n | | 1 n = 0 ,
and then y A w q n i l . This completes the proof. □
Corollary 2.2.
Let a , w A . Then the following are equivalent:
(1)
a A has generalized w-core decomposition.
(2)
There exist unique x , y A such that
a = x + y , x * y = y w x = 0 , x A w # , y A w q n i l .
Proof. 
( 1 ) ( 2 ) In view of Theorem 2.1, there exists v A such that
v = a w v 2 , ( a w v ) * = a w v , v ( a w ) 2 v = a w v , lim n | | ( a w ) n a w v ( a w ) n | | 1 n = 0 .
Set z = a w v a and y = a a w v a . As in the proof of Theorem 2.1, we have
a = z + y , z * y = y w z = 0 , z A w # , y A w q n i l .
Suppose that there exist b , c A such that
a = b + c , b * c = c w b = 0 , b A w # , c A w q n i l .
Obviously, a w v = a w ( a w v 2 ) = ( a w ) 2 v 2 = = ( a w ) n v n . Since a = b + c , we have a w = b w + c w . As ( c w ) ( b w ) = ( c w b ) w = 0 , we have
( a w ) n = i = 0 n ( b w ) i ( c w ) n i = ( c w ) n + i = 1 n ( b w ) i ( c w ) n i .
Hence,
[ ( a w ) n ] * c = [ ( c w ) n ] * c .
Since c w b = 0 , we see that ( a w ) n b = ( a w ) n 1 ( b w + c w ) b = ( a w ) n 1 b w b = = ( b w ) n b , and then ( a w ) n b w = ( b w ) n b w = ( b w ) n + 1 . This implies that
( a w ) n b w [ ( b w ) # ] n + 1 = ( b w ) n + 1 [ ( b w ) # ] = ( b w ) ( b w ) # .
Hence
( a w ) n b w [ ( b w ) # ] n + 1 b w = b w ( b w ) # b w = b w .
Therefore
b = b w b w # b = ( b w ) ( b w # b ) = [ ( a w ) n b w [ ( b w ) # ] n + 1 b w ] ( b w # b ) = ( a w ) n [ b w [ ( b w ) # ] n + 1 b w b w # b = ( a w ) n [ b w [ ( b w ) # ] n + 1 b = ( a w ) n z ,
where z = b w [ ( b w ) # ] n + 1 b . Accordingly,
b z = b a w v a = b a w v ( b + c ) = b a w v b a w v c = b ( a w ) n v n b [ ( a w ) n v n ] * c = b ( a w ) n v n b [ ( a w ) n v n ] * c = b ( a w ) v b ( v n ) * ( ( a w ) n ) * c = ( a w ) n z ( a w ) v ( a w ) n z ( v n ) * ( ( c w ) n ) * c = [ ( a w ) n ( a w ) v ( a w ) n ] z ( v n ) * ( ( c w ) n ) * c
Hence,
| | b z | | 1 n | | ( a w ) n ( a w ) v ( a w ) n | | 1 n | | z | | 1 n + | | ( v n ) * | | 1 n | | ( ( c w ) n ) * | | 1 n | | c | | 1 n .
Since c w A q n i l ,
then 1 λ ¯ c w A 1 ; hence, 1 λ ( c w ) * A 1 . This implies that ( c w ) * A q n i l . Thus, we prove that lim n | | ( ( c w ) n ) * | | 1 n = 0 . It follows that
lim n | | b z | | 1 n = 0 .
Therefore b = z , and then c = a b = a z = y , as required.
( 2 ) ( 1 ) This is trivial. □
Theorem 2.3.
Let a , w A . Then the following are equivalent:
(1)
a A has generalized w-core decomposition.
(2)
There exists unique x A such that
x = a w x 2 , ( a w x ) * = a w x , x ( a w ) 2 x = a w x , lim n | | ( a w ) n a w x ( a w ) n | | 1 n = 0 .
Proof. 
( 2 ) ( 1 ) This is obvious by Theorem 2.1.
( 1 ) ( 2 ) By hypothesis, there exists unique x A such that
x = a w x 2 , ( a w x ) * = a w x , x ( a w ) 2 x = a w x , lim n | | ( a w ) n a w x ( a w ) n | | 1 n = 0 .
Assume that there exists y A such that
y = a w y 2 , ( a w y ) * = a w y , y ( a w ) 2 y = a w y , lim n | | ( a w ) n a w y ( a w ) n | | 1 n = 0 .
Set a 1 = a w x a , a 2 = a a 1 and b 1 = a w y a , b 2 = a b 1 . As in the proof of Theorem 2.1, we prove that
a 1 * a 2 = a 2 w a 1 = 0 , a 1 A w # , a 2 A w q n i l , b 1 * b 2 = b 2 w b 1 = 0 , b 1 A w # , b 2 A w q n i l .
As in the proof of Corollary 2.2 , we verify that a w x a = a 1 = b 1 = a w y a . Therefore
x = ( a w x a ) w # = ( a 1 ) w # = ( b 1 ) w # = ( a w y a ) w # = y .
Accordingly, x = y , the result follows. □
We denote x in Theorem 2.3 by a w d , and call it the generalized w-core inverse of a.
Corollary 2.4.
Let a = x + y be the generalized w-core decomposition of a A . Then a w d = x w # .
Proof. 
Let a = x + y be the generalized w-core decomposition of a A . Similarly to the proof of Theorem 2.1, x w # is the generalized w-core inverse of a. So the theorem is true. □
Theorem 2.5.
Let a , w A . Then a A w d if and only if there exists a projection p A such that
(1)
( 1 p ) a ( 1 p ) a w A and ( 1 p ) a w A # ;
(2)
a w + p A i s r i g h t i n v e r t i b l e and p a w = p a w p A q n i l .
Proof. 
( 1 ) ( 2 ) Since a A w d , by using Theorem 2.3, there exist x , y A such that
a = x + y , x * y = y w x = 0 , x A w # , y A w q n i l .
Since x A w # , we have
x w # = x w ( x w # ) 2 , ( x w x w # ) * = x w x w # , x w # x w x w # = x w # , x w # x w x = x , x = x w x w # x .
Let p = 1 x w x w # . Then p 2 = p = p * and p x = 0 . We directly check that
( x w + 1 x w x w # ) ( x w # + 1 x w x w # ) = 1 + x ( 1 x w x w # ) A 1 .
Let q = [ x w # + 1 x w x w # ] [ 1 + x ( 1 x w x w # ) ] 1 . Then ( x w + p ) q = 1 . This implies that x w + p A is right invertible. Moreover, we have
1 + y w q = 1 + [ y w x w ( x w # ) 2 + y w ( y w x ) w x w # ] [ 1 + x ( 1 x w x w # ) ] 1 = 1 + y w [ 1 + x ( 1 x w x w # ) ] = 1 + y w A 1 .
By using Jacobson’s lemma, 1 + q y w A 1 . Therefore we check that
p a = p ( x + y ) = p y = ( 1 x w x w # ) y = y A q n i l , p a w ( 1 p ) = y w x w x w # = 0 , a w + p = x w + y w + p = ( x w + p ) [ 1 + q y w ] A i s r i g h t i n v e r t i b l e .
Since ( 1 p ) a = x w x w # ( x + y ) = x w x w # x = x A w # , it follows by [30, Theorem 2.10] that ( 1 p ) a w A # and ( 1 p ) a ( 1 p ) a w A , as required.
( 2 ) ( 1 ) By hypothesis, there exists a projection p A such that ( 1 p ) a A w # ;
a w + p A r i g h t i n v e r t i b l e , p a w ( 1 p ) = 0 , p a A w q n i l .
Set x = ( 1 p ) a and y = p a . Then
x * y = [ a * ( 1 p ) * ] p a = 0 , y w x = p a w ( 1 p ) a = 0 , y = p a A w q n i l .
Write ( a w + p ) q = 1 for some q A . Then ( 1 p ) a w q = ( 1 p ) ( a w + p ) q = 1 p , and so ( 1 p ) a w q ( 1 p ) a = ( 1 p ) a and [ ( 1 p ) a w q ] * = ( 1 p ) * = 1 p = ( 1 p ) a w q . Hence, ( 1 p ) a A ( 1 , 3 ) .
By hypothesis, ( 1 p ) a ( 1 p ) a w A and ( 1 p ) a w A # . In light of [30, Lemma 2.8], w A | | ( 1 p ) a . According to [30, Theorem 2.6], ( 1 p ) a A w # . That is, x A w # . Therefore a A w d . □
Corollary 2.6.
Let a , w A . Then a A d if and only if there exists a projection p A such that
(1)
( 1 p ) a A # ;
(2)
a + p A i s r i g h t i n v e r t i b l e and p a = p a p A q n i l .
Proof. 
This is obvious by choosing w = 1 in Theorem 2.5. □

3. Characterizations by Weighted g-Drazin Inverses

The goal of this section is to elucidate the generalized w-core inverse through the lens of the image associated with the weighted g-Drazin inverse. Evidently, a w # = ( a w ) # . But a w A # do not imply a A w # . For instance, letting a = i 1 0 i , w = i 1 0 0 . Then a w C 2 × 2 has the core-inverse 1 0 0 0 , while a has not w-core inverse. Contract to this observation, we now derive the following result which enable us to investigate the generalized w-core inverse by using the weighted g-Drazin inverse.
Lemma 3.1.
Let a , w A . Then the following are equivalent:
(1)
a A has generalized w-core decomposition.
(2)
a w A d .
(3)
a A d , w and there exists unique x A such that
x = a w x 2 , ( a w x ) * = a w x , lim n | | ( a w ) n a w x ( a w ) n | | 1 n = 0 .
In this case, a w d = x = ( a w ) d .
Proof. 
( 1 ) ( 2 ) Since a A w d , there exist x , y A such that
a = x + y , x * y = y w x = 0 , x A w # , y A w q n i l .
Hence, a w = x w + y w . Since x A w # , we have
x w ( x w # ) 2 = x w # , ( x w x w # ) * = x w x w # , x w x w # x = x .
Then
x w ( x w # ) 2 = x w # , ( x w x w # ) * = x w x w # , x ( w x w # ) 2 = w x w # .
This shows that x w A # . Obviously, y w A q n i l . Moreover, we check that
( x w ) * ( y w ) = w * ( x * y ) w = 0 , ( y w ) ( x w ) = ( y w x ) w = 0 .
In light of [4, Corollary 2.2], a w A d . Moreover, we have a w d = x w # = ( x w ) # = ( a w ) d .
( 2 ) ( 1 ) Let x = ( a w ) d . Then a w A d . In view of [4, Theorem 2.5], we have
x = a w x 2 , ( a w x ) * = a w x , lim n | | ( a w ) n a w x ( a w ) n | | 1 n = 0 .
We easily check that
| | a w x x ( a w ) 2 x | | 1 n = | | ( a w ) n x n + 1 x ( a w ) n + 1 x n + 1 | | 1 n | | ( a w ) n x ( a w ) n + 1 | | 1 n | | x n + 1 | | 1 n .
Hence,
lim n | | a w x x ( a w ) 2 x | | 1 n = 0 .
Therefore x ( a w ) 2 x = a w x , and then a A w d .
( 2 ) ( 3 ) In view of [4, Theorem 2.5], a A d , w and there exists x A such that
x = a w x 2 , ( a w x ) * = a w x , lim n | | ( a w ) n a w x ( a w ) n | | 1 n = 0 .
Moreover, we have ( a w ) ( a w ) d x = ( a w ) d . Since x = a w x 2 , by induction, we have x = ( a w ) n x n + 1 for any n N . Then
| | x ( a w ) ( a w ) d x | | 1 n = | | x ( a w ) ( a w ) d x | | 1 n = | | [ 1 ( a w ) ( a w ) d ] ( a w ) n x n + 1 | | 1 n = | | ( a w ) n ( a w ) d ( a w ) n + 1 | | 1 n | | x | | 1 + 1 n .
As lim n | | ( a w ) n ( a w ) d ( a w ) n + 1 | | 1 n = 0 , we see that
lim n | | x ( a w ) ( a w ) d x | | 1 n = 0 ,
and therefore x = ( a w ) ( a w ) d x = ( a w ) d , as required.
( 3 ) ( 2 ) Since a A d , w , we have a w A d . Therefore a w A d by Lemma 3.1. □
We are ready to prove:
Theorem 3.2.
Let a , w A . Then a A w d if and only if
(1)
a A d , w ;
(2)
There exists x A such that
x a w x = x , x A = a d , w A , A x = A ( a d , w ) * .
In this case, a w d = x .
Proof. 
⟹ Choose x = a w d . Then a w A d and x = ( a w ) d . In view of [4, Theorem 3.3], a w A d and
x ( a w ) x = x , x A = ( a w ) d A , A x = A ( ( a w ) d ) * .
Since a d , w = [ ( a w ) d ] 2 a = a [ ( w a ) d ] 2 = ( a w ) d a ( w a ) d , we easily check that ( a w ) d = [ ( a w ) d ] 2 a w = a d , w a , and then
( a w ) d A = a d , w A .
On the other hand, we have ( a d , w ) * = [ ( a w ) d a w ] * [ ( a w ) d ] * and [ ( a w ) d ] * = [ ( ( a w ) d ) 2 a w ] * = w * ( a d , w ) * . Thus, A [ ( a w ) d ] * = A ( a d , w ) * . Therefore
x A = a d , w A , A x = A ( a d , w ) *
.
⟸ By hypothesis, There exists x A such that
x a w x = x , x A = a d , w A , A x = A ( a d , w ) * .
As the argument above, we have
( a w ) d A = a d , w A , A [ ( a w ) d ] * = A ( a d , w ) * .
Therefore we have
x a w x = x , x A = ( a w ) d A , A x = A ( ( a w ) d ) * .
In light of [4, Theorem 3.3], a w A d . According to Lemma 3.1, a w d = x . □
An element a A has pseudo w-core decomposition if there exist x , y A such that
a = x + y , x * y = y w x = 0 , x A w # , y A w n i l .
The preceding x is unique if it exists, and we denote its w-core inverse by the pseudo w-core inverse of a, i.e., a w D = x w # . Evidently, a w D = z if and only if there exists n N such that
z = a w z 2 , ( a w z ) * = a w z , z ( a w ) 2 z = a w z a n d ( a w ) n = a w z ( a w ) n .
In this case, a w D = z .
Corollary 3.3.
Let a , w A . Then a has pseudo w-core inverse if and only if
(1)
a A w d .
(2)
a w has Drazin inverse.
Proof. 
⟹ Obviously, a A w d and a w A D . In view of [8, Theorem 2.3], a w has Drazin inverse, as desired.
⟹ In view of Theorem 3.2, there exists x A such that
x a w x = x , x A = a d , w A , A x = A ( a d , w ) * .
Since a w has Drazin inverse, we have a d , w = [ ( a w ) d ] 2 a = [ ( a w ) D ] 2 a = a D , w . Hence,
x ( a w ) x = x , x A = ( a w ) D A , A x = A ( ( a w ) D ) * .
Analogously to Theorem 3.2, we prove that a w A D . Similarly to Lemma 3.1, a has pseudo w-core inverse. □
Let R ( X ) represent the range space of a complex matrix X and X * be the conjugate transpose of X. We improve [2, Theorem 3.5] and provide a new characterizations of pseudo W-core inverse for any complex matrix.
Corollary 3.4.
Let A , X , W C n × n . Then the following are equivalent:
(1)
X is the pseudo W-core inverse of A.
(2)
X A W X = X , R ( X ) = R ( X * ) = R ( A W ) D .
Proof. 
Obviously, A W C n × n has Drazin inverse. Since A D , W = [ ( A W ) D ] 2 A and ( A W ) D = [ ( A W ) D ] 2 A W = A D , W W , we see that R ( A D , W ) = R ( A W ) D . Therefore we obtain the result by Theorem 3.2 and Corollary 3.3. □
If a and x satisfy the equations a = a x a and ( a x ) * = a x , then x is called ( 1 , 3 ) -inverse of a and is denoted by a ( 1 , 3 ) . We use A ( 1 , 3 ) to stand for sets of all ( 1 , 3 ) -invertible elements in A . We now derive
Theorem 3.5.
Let a , w A . Then the following are equivalent:
(1)
a A w d .
(2)
a A d , w and a d , w A ( 1 , 3 ) .
(3)
a A d , w and there exists a projection q A such that a d , w A = q A .
In this case, a w d = a d , w w a d , w ( a d , w ) ( 1 , 3 ) = a d , w w q .
Proof. 
( 1 ) ( 2 ) In view of Theorem 3.2, a A d , w . Let x = a w d . By virtue of Theorem 2.1, there exists x A such that
x = a w x 2 , ( a w x ) * = a w x , x ( a w ) 2 x = a w x , lim n | | ( a w ) n a w x ( a w ) n | | 1 n = 0 .
Let z = ( w a ) 2 w x . Then
a d , w z = [ ( a w ) d ] 2 a [ ( w a ) 2 w x ] = ( a w ) 2 ( a w ) d x = ( a w ) 2 ( a w ) d ( a w ) d = ( a w ) ( a w ) d .
Therefore ( a d , w z ) * = [ ( a w ) ( a w ) d ] * = ( a w ) ( a w ) d = a d , w z . Moreover, we verify that
a d , w z a d , w = ( a w ) ( a w ) d a d , w = ( a w ) ( a w ) d [ ( a w ) d ] 2 a = ( a w ) ( a w ) d ( a w ) 2 [ ( a w ) d ] 4 a = ( a w ) 2 [ ( a w ) d ] 4 a = [ ( a w ) d ] 2 a = a d , w .
Accordingly, a d , w A ( 1 , 3 ) , as required.
( 2 ) ( 1 ) Let x = a d , w w a d , w ( a d , w ) ( 1 , 3 ) . Then we check that
x a w x = a d , w w a d , w ( a d , w ) ( 1 , 3 ) a w a d , w w a d , w ( a d , w ) ( 1 , 3 ) = a d , w w a d , w ( a d , w ) ( 1 , 3 ) ( a w ) a d , w w a d , w ( a d , w ) ( 1 , 3 ) = a d , w w a d , w ( a d , w ) ( 1 , 3 ) a d , w ( w a ) w a d , w ( a d , w ) ( 1 , 3 ) = a d , w w a d , w w ( a w a d , w ) ( a d , w ) ( 1 , 3 ) = a d , w w [ a d , w w a ] w a d , w ( a d , w ) ( 1 , 3 ) = [ a d , w w a w a d , w ] w a d , w ( a d , w ) ( 1 , 3 ) = [ a d , w w a w a d , w ] w a d , w ( a d , w ) ( 1 , 3 ) = a d , w w a d , w ( a d , w ) ( 1 , 3 ) = x .
Clearly, x A a d , w A . Also we see that
a d , w = ( a d , w w ) 2 a = a d , w w a d , w ( a d , w ) ( 1 , 3 ) a d , w w a = x a d , w w a ;
hence, a d , w A x A . Thus x A = a d , w A .
We easily verify that
x = a d , w w a d , w ( a d , w ) ( 1 , 3 ) = a d , w w [ a d , w ( a d , w ) ( 1 , 3 ) ] = a d , w w [ a d , w ( a d , w ) ( 1 , 3 ) ] * = a d , w w [ ( a d , w ) ( 1 , 3 ) ] * [ a d , w ] * ;
and then, A x A ( a d , w ) * . Also we check that
[ a d , w ] * = [ a d , w ( a d , w ) ( 1 , 3 ) a d , w ] * = [ ( a d , w ( a d , w ) ( 1 , 3 ) ) * a d , w ] * = [ a d , w ] * a d , w ( a d , w ) ( 1 , 3 ) = [ a d , w ] * [ a d , w w a w a d , w ] ( a d , w ) ( 1 , 3 ) = [ a d , w ] * [ a d , w w a ] w a d , w ( a d , w ) ( 1 , 3 ) = [ a d , w ] * [ a w a d , w ] w a d , w ( a d , w ) ( 1 , 3 ) = [ a d , w ] * a w [ a d , w w a d , w ( a d , w ) ( 1 , 3 ) ] = [ a d , w ] * a w x ,
and then A ( a d , w ) * A x . Hence A x = A ( a d , w ) * . Accordingly, a A w d by Theorem 3.2.
( 2 ) ( 3 ) By hypothesis, a d , w A ( 1 , 3 ) , and so a d , w = a d , w ( a d , w ) ( 1 , 3 ) a d , w and [ a d , w ( a d , w ) ( 1 , 3 ) ] * = a d , w ( a d , w ) ( 1 , 3 ) . Let q = a d , w ( a d , w ) ( 1 , 3 ) . Then a d , w A = q A , q 2 = q = q * , as required.
( 3 ) ( 2 ) Let x = a d , w w q . Then a w x = a w a d , w w q = a w [ ( a w ) d ] 2 a w q = a w ( a w ) d q = q , and so ( a w x ) * = q * = q = a w x . Moreover, we have
a w x 2 = ( a w x ) x = q a d , w w q = a d , w w q = x .
Obviously, a d , w w ( a w ) = ( a w ) a d , w w , and then we verify that
| | ( a w ) n x ( a w ) n + 1 | | = | | [ ( a w ) n ( a d , w w q ) a d , w w ( a w ) n + 2 ] [ x ( ( a w ) n + 1 a d , w w ( a w ) n + 2 ) ] | | | | ( a w ) n a d , w w ( a w ) n + 1 | | + | | x | | | | ( a w ) n + 1 a d , w w ( a w ) n + 2 | | 1 + | | x | | | | a | | | | ( a w ) n a d , w w ( a w ) n + 1 | | = 1 + | | x | | | | a | | | | ( a w ) n ( 1 a d , w w a w ) n | | = 1 + | | x | | | | a | | | | ( a w a d , w w ( a w ) 2 ) n | | .
Since a w a d , w w ( a w ) 2 = a w ( a w ) d ( a w ) 2 A q n i l , we have
lim n | | ( a w a d , w w ( a w ) 2 ) n | | 1 n = 0 .
Therefore
lim n | | ( a w ) n x ( a w ) n + 1 | | 1 n = 0 .
Then x = ( a w ) d . In view of Theorem 2.1, a A w d . In this case, a w d = x = a d , w w q = a d , w w a d , w ( a d , w ) ( 1 , 3 ) .
Corollary 3.6.
Let a , w A . Then the following are equivalent:
(1)
a has pseudo w-core inverse.
(2)
a A D , w and a D , w A ( 1 , 3 ) .
(3)
a A D , w and there exists a projection q A such that a D , w A = q A .
In this case, a w D = a D , w w a D , w ( a D , w ) ( 1 , 3 ) = a D , w w q .
Proof. 
As a A D , we have a d = a D . Therefore we complete the proof by Theorem 3.5. □

4. Relations with Weighted Core Inverses

The objective of this section is to delineate the connections between the generalized weighted core inverse and other types of weighted generalized inverses. We now proceed to the demonstration that forms the crux of this sections development.
Theorem 4.1.
Let a , w A . Then the following are equivalent:
(1)
a A w d .
(2)
a A d , w and a d , w A w # .
In this case,
a w d = [ a d , w w ] 2 ( a d , w ) w # .
Proof. 
( 1 ) ( 2 ) In view of Theorem 3.2, a A d , w . Let x = a w d . Then we have
x = a w x 2 , ( a w x ) * = a w x , x ( a w ) 2 x = a w x , lim n | | ( a w ) n a w x ( a w ) n | | 1 n = 0 .
We verify that
| | a w ( a w ) d a w x ( a w ) ( a w ) d | | = | | ( a w ) n [ ( a w ) d ] n a w x ( a w ) n [ ( a w ) d ] n | | | | ( a w ) n a w x ( a w ) n | | | | ( a w ) d ] n | | .
Since lim n | | ( a w ) n a w x ( a w ) n | | 1 n = 0 , we deduce that
lim n | | a w ( a w ) d a w x ( a w ) ( a w ) d | | 1 n = 0 .
Hence, a w x ( a w ) ( a w ) d = a w ( a w ) d . Let z = ( a w ) 2 x . Then
a d , w w z = a d , w w ( a w ) 2 x = [ ( a w ) d ] 2 a w ( a w ) 2 x = a w x , a d , w w z 2 = ( a w x ) z = ( a w x ) ( a w ) 2 x = a w [ x ( a w ) 2 x ] = ( a w ) 2 x = z , ( a d , w w z ) * = ( a w x ) * = a w x = a d , w w z , z a d , w w a d , w = ( a w ) 2 x a d , w w a d , w = a w [ a w x ( a w ) ( a w ) d ] a d , w w a d , w = a w [ ( a w ) ( a w ) d ] a d , w w a d , w = a w [ ( a w ) ( a w ) d ] [ ( a w ) d ] 2 a w a d , w = a w ( a w ) d a d , w = a d , w .
Accordingly,
a d , w w z 2 = z , ( a d , w w z ) * = a d , w w z , z a d , w w a d , w = a d , w .
Then a d , w A w # and ( a d , w ) w # = z = ( a w ) 2 a w d , as desired.
( 2 ) ( 1 ) Set x = ( a d , w ) w # . Then we have
a d , w w x a d , w = a d , w , [ a d , w w x ] * = a d , w w x .
Hence, a d , w A ( 1 , 3 ) . According to Theorem 3.5, a A w d . Moreover, we have
a w d = a d , w w a d , w ( w x ) = a d , w w a d , w w ( a d , w ) w # = [ a d , w w ] 2 ( a d , w ) w # .
As an immediate consequence, we provide formulas of the pseudo weighted core inverse of a complex matrix.
Corollary 4.2.
Let A , W C n × n . Then
A W D = [ A D , W W ] 2 ( A D , W ) W # = ( A W ) k A [ ( A W ) k + 1 A ] ,
where k = m a x { i n d ( A W ) , i n d ( W A ) } .
Proof. 
By virtue of Theorem 4.1, A W D = [ A D , W W ] 2 ( A D , W ) W # . In view of [9, Theorem 2.10],
W , A = ( W A ) k [ A ( W A ) k + 1 ] .
According to Lemma 3.1, we get
A W D = ( A W ) D = A W [ ( A W ) D ] 2 = A [ W ( A W ) D 2 ] = A [ W , A ] = A [ ( W A ) k [ A ( W A ) k + 1 ] ] = ( A W ) k A [ ( A W ) k + 1 A ] ,
as asserted. □
Example 4.3.
Let A = 1 1 0 0 0 0 1 1 1 , W = 1 1 0 0 1 0 1 0 0 C 3 × 3 . We take the involution on C 4 × 4 as the conjugate transpose. Then
A W = 1 0 0 0 0 0 0 0 0 , W A = 1 1 0 0 0 0 1 1 0 .
Hence, m a x { i n d ( A W ) , i n d ( W A ) } = 1 . Moreover, we have
A W D = A W A [ ( A W ) 2 A ] = 1 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 = 1 1 0 0 0 0 0 0 0 1 2 0 0 1 2 0 0 0 0 0 = 1 0 0 0 0 0 0 0 0 .
Evidently, we check that
A W ( A W D ) 2 = A W D , ( A W A W D ) * = A W A W D , A W = A W A W D A W .
Let a , x A . x is called ( 1 , 4 ) -inverse of a and is denoted by a ( 1 , 4 ) provided that a x a = a and ( x a ) * = x a . We use A ( 1 , 4 ) to stand for sets of all ( 1 , 4 ) invertible elements in A .
Lemma 4.4.
Let f A be an idempotent. Then the following are equivalent:
(1)
f A ( 1 , 3 ) .
(2)
f π A ( 1 , 4 ) .
Proof. 
See [20, Lemma 3.2]. □
Theorem 4.5.
Let a , w A . Then the following are equivalent:
(1)
a A w d .
(2)
a A d , w and a w a d , w w A ( 1 , 3 ) .
(3)
a A d , w and ( a w ) π A ( 1 , 4 ) .
In this case, a w d = a d , w w ( a w a d , w w ) ( 1 , 3 ) = a d , w w [ 1 ( a π ) ( 1 , 4 ) a π ] .
Proof. 
( 1 ) ( 2 ) In view of Theorem 3.2, a A d , w . For any m N , we check that
| | a w a d , w w a w a w d a w a d , w w | | = | | a w a d , w w a w a w d a w a d , w w | | | | ( a w ) m a w a w d ( a w ) m | | | | ( ( a w ) d ) m a d , w w | | .
Since
lim m | | ( a w ) m a w a w d ( a w ) m | | 1 m = 0 ,
we have
lim m | | a w a d , w w a w a w d a w a d , w w | | 1 m = 0 .
Hence a w a w d a w a d , w w = a w a d , w w , and then
[ a w a d , w w ] [ a w a w d ] = a w [ ( a w ) d ] 2 a w a w a w d = a w a w d , ( ( a w a d , w w ) ( a w a w d ) ) * = ( a w a w d ) * = a w a w d = ( a w a d , w w ) ( a w a w d ) , ( a w a d , w w ) ( a w a w d ) ( a w a d , w w ) = a w a w d ( a w a d , w w ) = a w a w d a w a d , w w = a w a d , w w .
Accordingly, a w a d , w w A ( 1 , 3 ) , as desired.
( 2 ) ( 1 ) Let x = a d , w w ( a w a d , w w ) ( 1 , 3 ) . Then we verify that
a w x = a w a d , w w ( a w a d , w w ) ( 1 , 3 ) = a w ( a w ) d ( a w ( a w ) d ) ( 1 , 3 ) , ( a w x ) * = a w x , a w x 2 = a w ( a w ) d ( a w ( a w ) d ) ( 1 , 3 ) a d , w w ( a w a d , w w ) ( 1 , 3 ) = a w ( a w ) d ( a w ( a w ) d ) ( 1 , 3 ) a w [ ( a w ) d ] 2 ( a w a d , w w ) ( 1 , 3 ) = ( a w ) d ( a w a d , w w ) ( 1 , 3 ) = x ,
| | ( a w ) n a w x ( a w ) n | | = | | ( a w ) n a w ( a w ) d ( a w ( a w ) d ) ( 1 , 3 ) ( a w ) n | | | | ( a w ) n ( a w ) d ( a w ) n + 1 | | + | | ( a w ) ( a w ) d ( a w ) n a w ( a w ) d ( a w ( a w ) d ) ( 1 , 3 ) ( a w ) n | | | | ( a w ) n ( a w ) d ( a w ) n + 1 | | + | | ( a w ) ( a w ) d ( a w ( a w ) d ) ( 1 , 3 ) ( a w ) ( a w ) d ( a w ) n a w ( a w ) d ( a w ( a w ) d ) ( 1 , 3 ) ( a w ) n | | | | ( a w ) n ( a w ) d ( a w ) n + 1 | | + | | ( a w ) ( a w ) d ( a w ( a w ) d ) ( 1 , 3 ) | | | | ( a w ) d ( a w ) n + 1 ( a w ) n | | = | | ( a w ) n ( a w ) d ( a w ) n + 1 | | [ 1 + | | ( a w ) ( a w ) d ( a w ( a w ) d ) ( 1 , 3 ) | | ] .
Hence,
lim n | | ( a w ) n a w x ( a w ) n | | 1 n = 0 .
Therefore a A w d . In this case, a w d = a d , w w ( a w a d , w w ) ( 1 , 3 ) .
( 2 ) ( 3 ) In view of Lemma 4.4, a w ( a w ) d A ( 1 , 3 ) if and only if ( a w ) π = 1 ( a w ) ( a w ) d A ( 1 , 4 ) , as desired. □
Corollary 4.6.
Let a , w A . Then the following are equivalent:
(1)
a A d .
(2)
a A d and a a d A ( 1 , 3 ) .
(3)
a A d and a π A ( 1 , 4 ) .
In this case, a d = a d ( a a d ) ( 1 , 3 ) = a d [ 1 ( a π ) ( 1 , 4 ) a π ] .
Proof. 
This is obvious by choosing w = 1 in Theorem 4.6. □

5. Generalized w -Core Orders

This section is dedicated to exploring the generalized weighted core order for pairs of elements within a Banach *-algebra. The subsequent result will be a recurrent tool in examining the characteristics of generalized weighted core orders.
Lemma 5.1.
Let a , b A w d . Then the following are equivalent:
(1)
a w d b .
(2)
a w a d , w = b w a d , w , a * a d , w = b * a d , w .
Proof. 
( 1 ) ( 2 ) Since a w d b , we have
a w a w d = b w a w d , a w d a = a w d b .
By virtue of 4.5, a w d = a d , w w a d , w ( a d , w ) ( 1 , 3 ) . Then
a w a d , w w a d , w ( a d , w ) ( 1 , 3 ) = b w a d , w w a d , w ( a d , w ) ( 1 , 3 ) ,
and so
a w a d , w w a d , w = b w a d , w w a d , w .
Since a d , w = ( a d , w w ) 2 a , we have a w a d , w = [ a w a d , w w a d , w ] w a = [ b w a d , w w a d , w ] w a = b w a d , w .
Since a w d a = a w d b , we have
a d , w w a d , w ( a d , w ) ( 1 , 3 ) a = a d , w w a d , w ( a d , w ) ( 1 , 3 ) b .
As a d , w = a ( w a d , w ) 2 , we deduce that
a d , w ( a d , w ) ( 1 , 3 ) a = a d , w ( a d , w ) ( 1 , 3 ) b .
This implies that
a * a d , w ( a d , w ) ( 1 , 3 ) = b * a d , w ( a d , w ) ( 1 , 3 ) .
Therefore a * a d , w = b * a d , w , as required.
( 2 ) ( 1 ) Since a w a d , w = b w a d , w , by virtue of Theorem 3.5, we have
a w a w d = a w a d , w w a d , w ( a d , w ) ( 1 , 3 ) = b w a d , w w a d , w ( a d , w ) ( 1 , 3 ) = b w a w d .
Since a * a d , w = b * a d , w , we have a * a d , w ( a d , w ) ( 1 , 3 ) = b * a d , w ( a d , w ) ( 1 , 3 ) , and then a d , w ( a d , w ) ( 1 , 3 ) a = a d , w ( a d , w ) ( 1 , 3 ) b . Therefore we derive
a w d a = a d , w w a d , w ( a d , w ) ( 1 , 3 ) a = a d , w w [ a d , w ( a d , w ) ( 1 , 3 ) a ] = a d , w w [ a d , w ( a d , w ) ( 1 , 3 ) b ] = a w d b ,
thus yielding the result. □
Let a A w # , b A . Recall that a w # b if a w a w # = b w a w # and a w # a = a w # b (see [32]). We are now ready to prove:
Theorem 5.2.
Let a , b A w d . If a = a 1 + a 2 , b = b 1 + b 2 are generalized w-core decompositions of a and b. Then the following are equivalent:
(1)
a w d b .
(2)
a 1 w # b 1 .
Proof. 
( 1 ) ( 2 ) Since a w d b , we have a w a w d = b w a w d and a w d a = a w d b . For any m N , we derive
a 1 w ( a 1 ) w # = ( a 1 + a 2 ) w ( a 1 ) w # = a w a w d = b w a w d = b w a w ( a w d ) 2 = b w [ a w a w d ] a w d = b w [ b w a w d ] a w d = ( b w ) 2 ( a w d ) 2 = = ( b w ) m ( a w d ) m , b 1 w ( a 1 ) w # = b w b w d b w a w d = b w b w d b w a w ( a w d ) 2 = b w b w d ( b w ) 2 ( a w d ) 2 = = b w b w d ( b w ) m ( a w d ) m .
Thus, we have
| | a 1 w ( a 1 ) w # b 1 w ( a 1 ) w # | | = | | ( b w ) m ( a w d ) m b w b w d ( b w ) m ( a w d ) m | | | | ( b w ) m b w b w d ( b w ) m | | | | ( a w d ) m | | .
In view of Theorem 2.1,
lim m | | ( b w ) m b w b w d ( b w ) m | | 1 m = 0 .
Hence,
lim m | | a 1 w ( a 1 ) w # b 1 w ( a 1 ) w # | | 1 m = 0 .
Therefore a 1 w ( a 1 ) w # = b 1 w ( a 1 ) w # .
Since b 1 = b w b w d b , we verify that
a w a w d = a 1 w ( a 1 ) w # = b 1 w ( a 1 ) w # = b w b w d b w a w d = b w b w d a w a w d .
Thus,
[ a w a w d ] * = [ b w b w d a w a w d ] * ,
and so
a w a w d = a w a w d b w b w d .
Then we see that
( a 1 ) w # a 1 = a w d ( a w a w d a ) = a w d ( a w a w d ) a = a w d ( a w a w d ) b = a w d ( a w a w d b w b w d ) b = ( a w d a w a w d ) b w b w d ) b = a w d ( b w b w d b ) = ( a 1 ) w # b 1 .
Therefore a 1 w # b 1 .
( 2 ) ( 1 ) Obviously, we have
a w a w d = ( a 1 + a 2 ) w a 1 # = a 1 w a 1 # = b 1 w a 1 # = b w b w d b w a w d .
Then
a w d = a w ( a w d ) 2 = b w b w d b w ( a w d ) 2 .
Since lim n | | ( b w ) n b w b w d ( b w ) n | | 1 n = 0 , we deduce that
b w b w d b w a w d = b w a w d .
This implies that
a w a w d = b w a w d .
Clearly, a w d a 2 = ( a 1 ) w # a 2 = ( a 1 ) w # a 1 w ( a 1 ) w # a 2 = ( a 1 ) w # ( a 1 w ( a 1 ) w # ) * a 2 = ( a 1 ) w # [ w ( a 1 ) w # ] * ( a 1 ) * a 2 = 0 .
Moreover, we have
a w a w d = b w b w d b w a w d = ( b w b w d ) ( a w a w d ) .
Then
a w a w d = ( a w a w d ) * = ( a w a w d ) * ( b w b w d ) * = a w a w d b w b w d .
Hence, a w d = a w d a w a w d = a w d a w a w d b w b w d = a w d b w b w d . Accordingly, a w d b = a w d b w b w d b = ( a 1 ) w d b 1 = ( a 1 ) w d a 1 = a w d ( a 1 + a 2 ) = a w d a , thus yielding the result. □
Corollary 5.3.
The relation w d for generalized w-core invertible elements is a pre-order on A .
Proof. 
Step 1. a w d a . Let a = a 1 + a 2 be the generalized w-core decomposition. In view of [32, Theorem 2.3], a 1 w # a 1 . By using Theorem 5.1, a w d a .
Step 2. Assume that a w d b and b w d c . We claim that a w d c . Let a = a 1 + a 2 , b = b 1 + b 2 and c = c 1 + c 2 be the generalized w-core decompositions of a , b and c, respectively. By virtue of Lemma 5.1, we have a 1 w # b 1 and b 1 w # c 1 . In view of [32, Theorem 2.3], we have a 1 w # c 1 . By using Lemma 5.1 again, a w d c .
Therefore the relation w d for generalized w-core invertible elements is a pre-order. □
The relation w d for generalized w-core invertible elements is a pre-order, while it is not partial order as the following shows.
Example 5.4.
Let A = 1 0 0 0 1 0 0 0 1 , B = 1 0 0 0 1 0 0 0 2 , W = 1 0 0 0 1 0 0 0 0 C 3 × 3 . We take the involution on C 3 × 3 as the conjugate transpose. Then A D , W = [ ( A W ) D ] 2 A = 1 0 0 0 1 0 0 0 0 = [ ( B W ) D ] 2 B = B D , W . By using Lemma 5.1, we directly verify that A W d B and B W d A . But A B .
Theorem 5.5.
Let a , b A w d . Then the following are equivalent:
(1)
a w d b .
(2)
a and b are represented as
a = a 1 a 12 0 a 2 ( p , q ) , b = a 1 a 12 0 a 2 + ( b a ) ( p , q ) ,
where p = a w a w d and q = ( w a ) ( w a ) d .
Proof. 
( 1 ) ( 2 ) Let p = a w a w d and q = ( w a ) ( w a ) d . Then p 2 = p = p * A and q 2 = q A . We check that
( 1 p ) a q = [ 1 a w a w d ] a ( w a ) ( w a ) d = [ 1 a w a w d ] a w a ( w a ) n [ ( w a ) d ] n = [ 1 a w ( a w ) d ] ( a w ) n + 1 a [ ( w a ) d ] n = [ ( a w ) n + 1 ( a w ) a w d ( a w ) n + 1 ] a [ ( w a ) d ] n = 0 ;
then ( 1 p ) a p = 0 . Moreover, we verify that
( 1 p ) b q = [ 1 a w a w d ] b ( w a ) ( w a ) d = [ 1 a w a w d ] b w a d , w w a = [ 1 a w a w d ] a w a d , w w a = 0 .
Write b = b 1 b 12 0 b 2 p . Clearly, we have
p b q = a w a w d b ( w a ) ( w a ) d = a w a w d b w a d , w w a = a w a w d a w a d , w w a = a w a 2 d a ( w a ) ( w a ) d = p a q ,
and so a 1 = b 1 .
Also we have
p b ( 1 q ) = a w a w d b [ 1 ( w a ) ( w a ) d ] = a w ( a w d b ) [ 1 ( w a ) ( w a ) d ] = a w ( a w d a ) [ 1 ( w a ) ( w a ) d ] = p a ( 1 p ) .
Moreover, ( 1 p ) b ( 1 q ) = ( 1 p ) b = b p b = b a ( a w d b ) = b a a w d a = b p a = ( 1 p ) a + ( b a ) = a 2 + ( b a ) , as desired.
( 2 ) ( 1 ) By hypothesis, p a q = p b q and p a ( 1 q ) = p b ( 1 q ) . Then p a = p b . Hence, a w a w d a = a w a w d b . This implies that a w d a = a w d b .
Moreover, we have ( 1 p ) a q = 0 = ( 1 p ) b q . As p a q = p b q , we have a q = b q , and so a ( w a ) ( w a ) d = b ( w a ) ( w a ) d . Then a w a w d = b w a w d . In light of Lemma 5.1, a w d b , as asserted. □
The generalized core-EP inverse for a Banach algebra element was introduced in [5]. a d b if and only if a a d = b a d and a d a = a d b . As an immediate consequence of Theorem 5.5, we derive
Corollary 5.6.
Let a , b A d . Then the following are equivalent:
(1)
a d b .
(2)
a and b are represented as
a = a 1 a 12 0 a 2 ( p , q ) , b = a 1 a 12 0 a 2 + ( b a ) ( p , q ) ,
where p = a a d and q = a a d .

References

  1. O.M. Baksalary and G. Trenkler, Core inverse of matrices, Linear Multilinear Algebra, 58(2010), 681–697. [CrossRef]
  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, Theory of Clean Rings and Matrices, World Scientific, Hackensack, NJ, 2023. [CrossRef]
  4. H. Chen and M. Sheibani, Generalized weighted core inverse in Banach *-algebras, Filomat, 38(2024), 3691–3706. [CrossRef]
  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. Patricio and Y. Zhang, Characterizations and representations of core and dual core inverses, Canad. Math. Bull., 2016. [CrossRef]
  7. S. Das; J.K. Sahoo; K. Jajati and R. Behera, Further results on weighted core inverse in a ring, Linear Multilinear Algebra, 71(2023), 2915–2934. [CrossRef]
  8. Y. Gao and J. Chen, Pseudo core inverses in rings with involution, Commun. Algebra, 46(2018), 38–50. [CrossRef]
  9. Y. Gao; J. Chen and P. Patrício, Representations and properties of the W-weighted core-EP inverse, Linear Multilinear Algebra, 68(2020), 1160–1174. [CrossRef]
  10. T. Jin; H. Zhu and L. Wu, New characterizations for w-core inverses in rings with involution, Filomat, 37(2023), 2131–2139. [CrossRef]
  11. T. Li, Characterizations of weighted core inverse in rings with involution, J. Algebra Appl., 2022. [CrossRef]
  12. T. Li and M. Zhou, The absorption laws for the weighted core inverse in rings, Linear Multilinear Algebra, 71(2023), 480–495 . [CrossRef]
  13. D. Mosić, Weighted generalized Drazin inverse in rings, Georgian Math. J., 23(2016), 587–594. [CrossRef]
  14. D. Mosić, Core-EP pre-order of Hilbert space operators, Quaest. Math., 41(2018), 585–600. [CrossRef]
  15. D. Mosić, Core-EP inverse in ring with involution, Publ. Math. Debrecen, 96(2020), 427–443. [CrossRef]
  16. D. Mosić, Core-EP inverses in Banach algebras, Linear Multilinear Algebra, 69(2021), 2976–2989.
  17. D. Mosić, Weighted core-EP inverse and weighted core-EP pre-orders in a C*-algebra, J. Aust. Math. Soc., 111(2021), 76–110.
  18. D. Mosić; G. Dolinar and J. Marovt, EP-quasinilpotent decomposition and its applications, Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat.,, 115(2021), No. 4, Paper No. 188, 25 p.
  19. K.M. Prasad and K.S. Mohana, Core-EP inverse, Linear Multilinear Algebra, 62(2014), 792–802.
  20. G. Shi; J. Chen; T. Li and M. Zhou, Jacobson’s lemma and Cline’s formula for generalized inverses in a ring with involution, Commun. Algebra, 48(2020), 3948–3961.
  21. D.S Rakic; 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. H. Wang, Core-EP Decomposition and its applications, Linear Algebra Appl., 508 (2016), 289–300. [CrossRef]
  23. S. Xu; J. Chen and X. Zhang, New characterizations for core inverses in rings with involution, Front. Math. China, 2017. [CrossRef]
  24. Y. Yang and H. Zhu, The w-core inverse of a product and its applications, Filomat, 37(2023), 4587–4601. [CrossRef]
  25. Q. Zhang; C. Wang and H. Zhu, Characterizations and representations of w-core inverses in rings, Filomat, 37(2023), 3183–3190. [CrossRef]
  26. Q. Zhang; H. Zhu and H. Zou, Left and right w-core partial orders in rings, Acta Math. Hung., 169(2023), 432–446. [CrossRef]
  27. M. Zhou and J. Chen, Characterizations and maximal classes of elements related to pesudo core inverses, Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat., 114(2020). [CrossRef]
  28. H. Zhu and P. Patricio, Characterizations for pseudo core inverses in a ring with involution, Linear Multilinear Algebra, 67(2019), 1109–1120. [CrossRef]
  29. 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. [CrossRef]
  30. 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]
  31. H. Zhu; L. Wu and D. Mosić, One-sided w-core inversesin rings with an involution, Linear Multilinear Algebra, 71(2023), 528–544. [CrossRef]
  32. H. Zhu and L. Wu, A new class of partial orders, Algebra Colloq., 30(2023), 585–598. [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.
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