Preprint
Article

This version is not peer-reviewed.

The Weighted Generalized Moore-Penrose Inverse in Banach *-Algebras

Submitted:

09 July 2026

Posted:

10 July 2026

You are already at the latest version

Abstract
In this paper, we introduce the weighted generalized Moore-Penrose inverse within the framework of a Banach *-algebra. We characterize this new generalized inverse by employing the weighted MP-inverse and the generalized core-EP inverse. The connections with specific outer inverses are elucidated. Consequently, the attributes of the associated generalized inverses for complex matrices and bounded linear operators on Hilbert spaces are extended to the broader context of Banach algebras.
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 A has Moore-Penrose inverse if there exist x A such that
a x a = a , x a x = x , ( a x ) = a x , ( x a ) = x a .
The preceding x is unique if it exists, and we denote it by a . The set of all Moore-Penrose invertible elements in A is denoted by A . Moore-Penrose inverse is extensively studied in matrix and operator theory (see [9,11,12,13,15,16,23]).
Recently, Stojanović and Mosić introduced generalized Moore-Penrose inverse for Hilbert operators (see [18]). Afterwards, Mosić further studied generalized Moore-Penrose inverse with weights for an Hilbert operator (see [12]). Many properties of weighted generalized Moore-Penrose inverse for an Hilbert operator were presented by using the Hilbert operator technique. The generalized Moore-Penrose inverse for complex matrices has been investigated in [6,21,24].
The motivation of this paper is to introduce the weighted generalized Moore-Penrose inverse within the framework of a Banach *-algebra. Recall that an element a A has w-weighted core inverse if there exists an x A such that
a ( w x ) 2 = x , ( w a w x ) = w a w x , x w ( a w ) 2 = a w .
If such x is unique if it exits, and we denote it by a # , w . Many elementary properties of the w-weighted core inverse are studied in [4]. In Section 2, we introduce and study a new generalized inverse based on the w-weighted core inverse. Some equivalent characterizations of such new generalized inverse are presented. In Section 3, we introduce the generalized weighted Moore-Penrose inverse by combing the w-weighted MP-inverse and quasinilpotents. This avoid to use the Hilbert operator technique and extend such kind of generalized inverse from Hilbert operator to the general Banach element. We characterize this new generalized inverse by employing the weighted MP-inverse and the generalized core-EP inverse. Finally, in Section 4, the connections with specific outer inverses are elucidated. Consequently, the attributes of the associated generalized inverses for complex matrices and bounded linear operators on Hilbert spaces are extended to the broader context of Banach algebras.
Throughout the paper, all Banach *-algebras are complex with an identity. Let A # , w denote the set of all w-weighted core invertible elements in A . Let a A . Set i m ( a ) = { a x | x A } and k e r ( a ) = { x A | a x = 0 } . We use p i m ( a ) to denote the projection p such that i m ( p ) = i m ( a ) .

2. Weighted MP-Core Inverse

The purpose of this section is to introduce a new generalized inverse with weights which is a natural generalization of Moore-Penrose inverse for a complex matrix. Our starting points is the following.
Definition 1.
An element a A has w-weighted MP-core inverse provided that a A # , w and a # , w w a w A . We denote the w-weighted MP-core inverse of a by
a , w = [ a # , w w a w ] a # , w .
Let A , w denote the set of all w-weighted MP invertible elements in A . We now derive
Theorem 1.
Let a , x A . Then the following are equivalent:
(1)
a A , w .
(2)
There exists x A such that x w a w x = x , ( w a w x ) = w a w x , x w a w A , x A = ( a w ) A , x A = ( w a w ) A .
Proof. ( 1 ) ( 2 ) It is easy to verify that
x w a w x = x w a w a ( w x ) 2 = x w ( a w ) 2 ( x w x ) = a w x w x = a ( w x ) 2 = x .
Moreover, x = a ( w x ) 2 = ( a w ) x w x ( a w ) A . a w = x w ( a w ) 2 x A . Hence, x A = ( a w ) A . On the other hand, x = [ x ( w a w x ) ] = w a w x x = w a w a ( w x ) 2 ( w a w ) A . Then x A ( w a w ) A . Moreover, we have
w a w = w ( a w ) = w x w ( a w ) 2 = w a ( w x ) 2 w ( a w ) 2 = ( w a w x ) [ w x w ( a w ) 2 ] = ( w a w x ) [ w x w ( a w ) 2 ] x A .
Therefore x A = ( w a w ) A .
( 2 ) ( 1 ) Since 1 x w a w 0 ( x ) , we see that 1 x w a w 0 ( a w ) . Thus, a w = x w ( a w ) 2 . Moreover, we have ( x w a w x ) = x , and so 1 w x w a 0 ( x ) ; hence, 1 w a w x 0 ( w a w ) . This implies that ( w w a w x ) a w = 0 , and then w w a w x 0 ( a w ) = 0 ( x ) . It follows that w x = w a ( w x ) 2 . Therefore we deduce that
x = x w a w x = ( x w a ) [ w a ( w x ) 2 ] = x ( w a ) 2 ( w x ) 2 = [ x w ( a w ) 2 ] x w x = a ( w x ) 2 ,
as required. □
Corollary 1.
Let a , x A . Then the following are equivalent:
(1)
a A , w .
(2)
a ( w x ) 2 = x = x w a w x , ( w a w x ) = w a w x , ( w a w ) x ( w a w ) = w a w , x w ( a w ) 2 = a w , x w a w A .
Proof. ( 1 ) ( 2 ) In view of Theorem 2.2, we have x = x w a w x . Then we derive that
( w a w ) x ( w a w ) = w a w x w ( a w ) = w a w ( x w ) 2 ( a w ) 2 = w [ a ( w x ) 2 ] w ( a w ) 2 = w ( x w ) ( a w ) 2 = w a w ,
as required
( 2 ) ( 1 ) This is trivial. □
An element a A has group inverse if there exist x A such that
a x a = a , x a x = x , a x = x a .
The preceding x is unique if it exists, and we denote it by a # . The set of all group invertible elements in A is denoted by A # .
Theorem 2.
Let a A . Then the following are equivalent:
(1)
a A , w .
(2)
a w A # and there exists x A such that ( w a w x ) = w a w x , x w a w = a w ( a w ) # A .
Proof. ( 1 ) ( 2 ) Let x = a , w . Then
a ( w x ) 2 = x , ( w a w x ) = w a w x , x w ( a w ) 2 = a w , x w a w A .
In view of [8] (Theorem 2.3), w a A d . By using Cline’s formula, a w A d . Since A a w = A ( a w ) 2 , we can find some z A such that a w = z ( a w ) 2 . For any n N , we check that
| | a w ( a w ) 2 ( a w ) d | | 1 n = | | z n 1 ( a w ) n z n 1 ( a w ) n + 1 ( a w ) d | | 1 n | | z | | 1 1 n | | [ a w ( a w ) 2 ( a w ) d ] n | | 1 n .
This implies that lim n | | a w ( a w ) 2 ( a w ) d | | 1 n = 0 , and then a w = ( a w ) 2 ( a w ) d ( a w ) 2 A A ( a w ) 2 . Thus a w A # . Since x w ( a w ) 2 = a w , we deduce that x w ( a w ) 2 ( a w ) # = a w ( a w ) # . Therefore x w a w = a w ( a w ) # A , as required.
( 2 ) ( 1 ) By hypothesis, there exists x A such that ( w a w x ) = w a w x , x w a w = a w ( a w ) # A . Hence, x w ( a w ) 2 = ( a w ) ( a w ) # ( a w ) , as required. □
Set a = a , 1 and A = A , 1 . We now derive
Corollary 2.
Let a A . Then the following are equivalent:
(1)
a A .
(2)
a A # and there exists x A such that ( a x ) = a x , x a = a a # A
Proof. 
This is obvious by Theorem 2.4. □
Theorem 3.
Let a , w A . If there exists x A such that
( a w ) 2 x = a , a w x = x w a , ( w a w x ) = w a w x , ( a w x w ) = a w x w
then a A , w .
Proof. 
Let z = a ( w x ) 2 . Since a w x = x w a , we check that
a w z w a = a w a ( w x ) 2 w a = [ ( a w ) 2 x ] w x w a = a w x w a = ( a w ) 2 x = a , z w a w z = a ( w x ) 2 w a w a ( w x ) 2 = a ( w x ) 2 w x w [ ( a w ) 2 x ] = a ( w x ) 2 w x w a = [ ( a w ) 2 x ] w x w x = a ( w x ) 2 = z , a w z = a w a ( w x ) 2 = [ ( a w ) 2 x ] w x = a w x = [ ( a w ) 2 x ] w x = a ( w x ) 2 w a = z w a .
Hence a w A # and ( a w ) # = z w . Hence, a w ( a w ) # = a w z w = a w a ( w x ) 2 w = a w a w x w x w = [ ( a w ) 2 x ] w x w = a w x w = x w a w . Since ( x w a w ) 2 = x w [ ( a w ) 2 x ] w = x w a w and ( a w x w ) = a w x w , we see that ( a w x w ) = a w x w . Hence, x w a w = a w ( a w ) # A . Therefore we complete the proof by Theorem 2–4. □
Recall that an element a in A is an EP element if there exists an x A such that a x 2 = x , ( a x ) = a x = x a (see [19]).
Corollary 3.
Let a A be an EP element. Then a A . In this case, a = a # .
Proof. 
This is an immediate consequence of Theorem 2.6. □

3. Weighted Generalized Moore-Penrose Inverse

The aim of this section is to introduce the notion of the generalized weighted core inverse in a Banach *-algebra. We begin with
Definition 2.
An element a A has generalized w-weighted Moore-Penrose decomposition if there exist x , y A such that
a = x + y , y w x = 0 , x A , w , y A q n i l .
Here,
A q n i l = { x A lim n x n 1 n = 0 } .
It is well established that x A q n i l if and only if 1 + λ x A is invertible for any λ C . Let A , w denote the set of all generalized w-weighted Moore-Penrose invertible elements in A .
Recall that an element a A has w-weighted generalized core-EP if there exist x A such that
a ( w x ) 2 = x , ( w a w x ) = w a w x , lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0
(see [4]). The preceding x is unique if exists, and we denote it by a , w . Let A , w denote the set of all w-weighted generalized core-EP invertible elements in A . We are ready to prove:
Theorem 4.
Let a , w A . Then the following are equivalent:
(1)
a A , w .
(2)
a A , w and a , w w a w A .
In this case,
a , w = [ a , w w a w ] a , w .
Proof. ( 1 ) ( 2 ) Since a A , w , there exist x , y A such that
a = x + y , y w x = 0 , x A , w , y A q n i l .
Then x A # , w . In light of [4] (Theorem 3.1), a A , w and a , w = x # , w .
Additionally, x # , w w x w A . It is easy to verify that
a , w w a w = x # , w w ( x + y ) w = x # , w ( w x w x # , w ) w ( x + y ) w = x # , w ( w x # , w ) ( w x ) w ( x + y ) w = x # , w w x w A .
Moreover, we check that
a , w = [ x # , w w x w ] x # , w = [ a , w w a w ] a , w ,
as required.
( 2 ) ( 1 ) Since a A , w , by virtue of [4] (Theorem 3.1), there exist x , y A such that
a = x + y , ( w x ) ( w y ) = 0 , y w x = 0 , x A # , w , y A q n i l .
In this case, a , w = x # , w . Moreover, we have
x # , w w x w = x # , w w ( x + y ) w = a , w w a w A .
Therefore x A , w . Accordingly, a A , w . □
Corollary 4.
Let a , w A . Then the following are equivalent:
(1)
a A , w .
(2)
The system of conditions
a ( w x ) 2 = x , ( w a w x ) = w a w x , x w a w A , lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0
is consistent and it has the unique solution.
In this case, a , w = ( x w a w ) x .
Proof. ( 1 ) ( 2 ) Set x = a , w . In view of Theorem 3.2, we have x w a w A . By virtue of [4], a ( w x ) 2 = x , ( w a w x ) = w a w x , lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0 , as required.
( 2 ) ( 1 ) In light of [4], a , w = x . Moreover, we have x w a w = a , w w a w A , as desired. □
Let A denote the generalized Moore-Penrose inverse of a bounded linear operator A over an Hilbert space H (see [18]). We deduce that
Corollary 5.
Let A B ( H ) d and X B ( H ) . Then the following are equivalent:
(1)
A = X .
(2)
There exist Y , Z B ( H ) such that A = Z + Y , where Y Z = 0 , Z B ( H ) and Y B ( H ) q n i l .
In this case, X = Z .
Proof. 
This is obvious by Theorem 3.2 and [18]. □
Consider the system given by
x w a w x = x , x w a = [ a , w w a w ] a , w w a , a w x = a w [ a , w w a w ] a , w ( 2.1 )
Theorem 5.
If the system ( 2.1 ) of equations has a solution then it is unique.
Proof. 
Assume that x 1 , x 2 satisfy ( 2.1 ) . Then
x i w a w x i = x i , x i w a = [ a , w w a w ] a , w w a , a w x i = a w [ a , w w a w ] a , w
for i = 1 , 2 . Therefore
x 1 = ( x 1 w a ) w x 1 = [ a , w w a w ] a , w w a ( w x 1 ) = ( x 2 w a ) ( w x 1 ) = x 2 w ( a w x 1 ) = x 2 w a w [ a , w w a w ] a , w = ( x 2 w ) a w x 2 = x 2 ,
as required. □
Corollary 6.
Let a , w A . Then the following are equivalent:
(1)
a , w = x .
(2)
The system of equations
x w a w x = x , x w a = [ a , w w a w ] a , w w a , a w x = a w [ a , w w a w ] a , w
is consistent and it has the unique solution x.
In this case, a , w = x .
Proof. ( 1 ) ( 2 ) Taking x = [ a , w w a w ] a , w . Then
x w a w x = [ a , w w a w ] a , w w a w [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w = [ a , w w a w ] a , w = x , x w a = [ a , w w a w ] a , w w a , a w x = a w [ a , w w a w ] a , w .
By virtue of Theorem 3.5, x is the unique solution of the preceding equations, as required.
( 2 ) ( 1 ) By the argument above, we have x = [ a , w w a w ] a , w . Therefore a , w = x , as asserted. □
We come now to consider the following equation in A :
a , w w a w x = a , w b ( 2.2 )
where a , w , b A .
Theorem 6.
Let a A , w . Then the equation ( 2.2 ) is consistent and its general solution is
x = a , w b + [ 1 a , w w a w ] y ,
where y A is arbitrary.
Proof. 
Let x = a , w b + [ 1 a , w w a w ] y , where y A . Then
a , w w a w a , w = a , w w a w [ a , w w a w ] d a g a , w = a , w w a w [ a , w w a w ] d a g [ a , w w a w ] a , w = a , w
Thus we verify that
a , w w a w x = a , w w a w [ a , w b + [ 1 a , w w a w ] y ] = a , w b + [ a , w w a w a , w w a w a , w w a w ] y = a , w b .
Let x be the solution of the Eq. (2.2). Then
a , w w a w x = a , w b .
Hence,
a , w w a w x = [ a , w w a w ] a , w w a w x = [ a , w w a w ] a , w b = a , w b .
Accordingly,
x = a , w b + [ 1 a , w w a w ] x ,
as required. □
Corollary 7.
Let a A , w . If x is the solution of the Eq. (2.2) and i m ( x ) i m a , w w a w , then
x = a , w b .
Proof. 
In view of Theorem 3.7, x = a , w b is the solution of the Eq. (2.2). Let x 1 , x 2 be the solution of the Eq. (2.2) and i m ( x 1 ) , i m ( x 2 ) i m a , w w a w . Then we have
z : = x 1 x 2 k e r [ a , w w a w ] i m a , w w a w .
Write z = ( a , w w a w ) t for some t A . Then
a , w w a w z = a , w w a w ( a , w w a w ) t = 0 ,
and so
[ a , w w a w ] a , w w a w ( a , w w a w ) t = 0 .
Hence, we have
( [ a , w w a w ] a , w w a w ) ( a , w w a w ) t = 0 .
This implies that ( a , w w a w ) t = 0 . Therefore x 1 = x 2 . That is a , w b is the unique solution of ( 2.2 ) in i m a , w w a w , as desired. □
Consider the following matrix equation:
A , W W A W X = A , W B ( 2.3 )
where A C q × n , W C n × q , B C n × p and m N .
Corollary 8. ( 1 ) The general solution of the Eq. (2.3) is
X = A , w B + [ I A , w W A W ] Y ,
where Y C q × p is arbitrary.
Proof. 
This is obvious by Theorem 3.7. □

4. Connections Between Weighted Generalized Core-EP Inverses

An element a A has weighted generalized 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 [14]). In this section, we establish the relations between weighted generalized core-EP inverse and weighted generalized Drazin inverse for an element in a Banach *-algebra.
Theorem 7.
Let a A . Then the following are equivalent:
(1)
a A , w .
(2)
a A d , w and there exists x A such that
x w a w x = x , x w a w A , i m ( x w ) = i m ( a w ) d a n d i m ( w x ) = i m ( w a ) d .
In this case, a , w = [ x w a w ] a ( w x ) 2 .
Proof. ( 1 ) ( 2 ) Set x = a , w . Then x = a [ ( w a ) ] 2 by [3]. Hence, w x = w a [ ( w a ) ] 2 = ( w a ) . In view of [1] (Theorem 1.2), we have
w x w a w x = w x , i m ( w x ) = i m ( w a ) d a n d i m ( w x ) = i m ( w a ) d .
By virtue of [1] (Theorem 1.2), we have
x w a w x = a [ ( w a ) ] 2 ( w a ) 2 [ ( w a ) ] 2 = a [ ( w a ) ] 2 ( w a ) ( w a ) = a [ ( w a ) ] 2 = x .
By using [1] (Theorem 1.2), we can find a q A such that
x w = a [ ( w a ) ] 2 w = [ a ( w a ) ] [ ( w a ) w ] = a ( w a ) d q = a w [ ( a w ) d ] 2 a q ,
and so i m ( x w ) i m ( a w ) d . In view of [1], ( w a ) d A ( 1 , 3 ) and ( w a ) = [ ( w a ) d ] 2 [ ( w a ) d ] ( 1 , 3 ) . Then we check that
( a w ) d = a [ ( w a ) d ] 2 w = a ( w a ) d ( w a ) d [ ( w a ) d ] ( 1 , 3 ) ( w a ) d w = a [ ( w a ) d ] 2 [ ( w a ) d ] ( 1 , 3 ) ( w a ) d w = a [ ( w a ) d ] 2 [ ( w a ) d ] ( 1 , 3 ) [ ( w a ) d ] 2 ( w a ) w = a [ ( w a ) d ] 2 [ ( w a ) d ] ( 1 , 3 ) [ w a ) d ( w a ) d ( ( w a ) d ) ( 1 , 3 ) ( w a ) d w a w = a [ ( w a ) d ] 2 [ ( w a ) d ] ( 1 , 3 ) [ ( w a ) d ] 2 [ ( w a ) d ] ( 1 , 3 ) ( w a ) d w a w = a [ ( w a ) ] 2 ( w a ) d w a w = x w a ( w a ) d w .
Hence, i m ( a w ) d i m ( x w ) . Therefore i m ( x w ) = i m ( a w ) d , as desired.
By hypothesis, x w a w = a , w w a w A , as required.
( 2 ) ( 1 ) By hypothesis, there exists x A such that
x w a w x = x , x w a w A , i m ( x w ) = i m ( a w ) d a n d i m ( w x ) = i m ( w a ) d .
Then x w = ( a w ) d y for some y A . Hence w x = w x w a w x = w ( ( a w ) d y ) a w x = w ( x w ) a w x = w a [ ( w a ) d ] 2 w y a w x . This implies that w x A ( w a ) d A . On the other hand, we can find some z A such that ( w a ) d = w [ ( a w ) d ] 2 a w x w A ( a w ) d a , and then ( w a ) d A ( w x ) A . Therefore i m ( w x ) = i m ( w a ) d . Obviously, w x ( w a ) w x = w x . According to [1], w a A and w x = ( w a ) . In light of[3], a A , w . Moreover, a , w = a [ ( w a ) ] 2 = a ( w x ) 2 , as desired.
a , w w a w = ( a w x w ) x ( w a w ) = ( a w x w ) ( x w a w x ) ( w a w ) = ( a w x w ) x w ( a w x w a w ) = ( a w x w ) ( a w ) 2 [ ( a w ) d ] 3 y ( a w x w a w ) = ( a w ) d y ( a w x w a w ) = ( x w a w x ) w a w = x w a w A ,
and therefore a , w w a w A . Therefore a A , w . In this case,
a , w = [ a , w w a w ] a , w , = [ x w a w ] a ( w x ) 2 ,
as asserted. □
Let p and q are projections in A . We note that p = q if and only if i m ( p ) = i m ( q ) . We now derive
Corollary 9.
Let a A , w and x A . Then the following are equivalent:
(1)
a A , w .
(2)
The system of conditions
w a w x = p i m ( w a ) d , x w a w A , i m ( x ) i m ( a w ) d
is consistent and it has the unique solution x.
Proof. 
Let x = a , w . Then x = a [ ( w a ) ] 2 . Then w a w x = w a w a [ ( w a ) ] 2 = w a ( w a ) . Set p = ( w a ) ( w x ) . Then p 2 = p = p , i.e., p A is a projection. Clearly, i m ( p ) = i m ( w a ) d ; whence, w a w x = p i m ( w a ) d . In light Theorem 4.1, we have i m ( x ) i m ( a w ) d . As in the proof in Theorem 4.1, we check that x w a w A , as required.
( 1 ) ( 2 ) Assume that there exists y A such that
w a w y = p i m ( w a ) d , i m ( y ) i m ( a w ) d .
Then we check that
w a w ( x y ) = 0 ,
and so i m ( x y ) k e r ( w a w ) k e r ( a w ) d . Since i m ( x ) , i m ( y ) i m ( a w ) d , we have i m ( x y ) i m ( a w ) d . Therefore i m ( x y ) k e r ( a w ) d i m ( a w ) d = 0 , and so x = y . The uniqueness is proved.
( 2 ) ( 1 ) By the preceding discussion, the system of conditions
w a w x = p i m ( w a ) d , i m ( x ) i m ( a w ) d
has the solution a , w . Thus, a , w = x by the uniqueness. Therefore the result follows by Theorem 4.1. □
We are ready to prove:
Theorem 8.
Let a A , w . Then the following are equivalent:
(1)
a , w = x .
(2)
[ a , w w a w ] a , w ( w a w x ) = x , w a w x = w a w [ a , w w a w ] a , w .
(3)
( x w a w ) [ a , w w a w ] a , w = x , x w a w = [ a , w w a w ] a , w w a w .
(4)
[ a , w w a w ] a , w ( w a w x ) = x , a , w ( w a w x ) = a , w .
(5)
( x w a w ) [ a , w w a w ] a , w = x , ( x w a w ) [ a , w w a w ] = [ a , w w a w ] .
Proof. ( 1 ) ( 2 ) Since a , w = x , we see that [ a , w w a w ] a , w = x . Moreover, we have x w a w x = x , and then [ a , w w a w ] a , w ( w a w x ) = x .
In view of Corollary 4.2, a w x = a w [ a , w w a w ] a , w . Hence, w a w x = w a w [ a , w w a w ] a , w .
( 2 ) ( 4 ) By hypothesis, w a w x = w a w [ a , w w a w ] a , w . Then
a , w ( w a w x ) = a , w w a w [ a , w w a w ] a , w = a , w w a w [ a , w w a w ] [ a , w w a w a , w ] = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w = [ a , w w a w ] a , w = a , w .
as required.
( 4 ) ( 1 ) By hypothesis, we have
x = [ a , w w a w ] a , w ( w a w x ) = [ a , w w a w ] [ a , w ( w a w x ) ] = [ a , w w a w ] a , w = a , w ,
as required. □
Corollary 10.
Let a A . Then the following are equivalent:
(1)
a = x .
(2)
[ a a ] a a = x , a x = a [ a , w a ] a .
(3)
x a [ a a ] a = x , x a = [ a a ] a a .
(4)
[ a a ] a a x = x , a ( a x ) = a .
(5)
x a [ a a ] a = x , ( x a ) [ a a ] = [ a a ] .
Proof. 
This is obtained by choosing w = 1 in Theorem 4.3. □
Theorem 9.
Let a A , w . Then the following are equivalent:
(1)
a , w = x .
(2)
x w a w x = x , w a w x = w a w [ a , w w a w ] a , w , x w a w = [ a , w w a w ] a , w w a w .
(3)
( a , w w a w ) a , w w a w x = ( a , w w a w ) a , w , [ a d , w w a w ] a , w w a w x = x .
(4)
x w a w a , w = x , x w a w = [ a , w w a w ] a , w w a w .
Proof. ( 1 ) ( 2 ) Since a , w = x , it follows by Theorem 4.1 that x = x w a w x . By Theorem 4.3, w a w x = w a w [ a , w w a w ] a , w , x w a w = [ a , w w a w ] a , w w a w .
( 2 ) ( 1 ) By hypothesis, we derive that
x = x w a w x = x ( w a w x ) = x [ w a w [ a , w w a w ] a , w ] = [ x w a w ] [ a , w w a w ] a , w = [ a , w w a w ] a , w w a w [ a , w w a w ] a , w = [ a , w w a w ] a , w .
Therefore a , w = x , as desired.
( 1 ) ( 3 ) By virtue of Theorem 4.3, we have [ a d , w w a w ] a , w w a w x = x . Moreover, we check that
( a , w w a w ) a , w w a w x = ( a , w w a w ) a , w w a w [ a , w w a w ] a , w = ( a , w w a w ) a , w w a w [ a , w w a w ] a , w = a , w w a w [ a , w w a w ] a , w w a w a , w = ( a , w w a w ) a , w ,
as required.
( 3 ) ( 1 ) By hypothesis, ( a , w w a w ) a , w w a w x = ( a , w w a w ) a , w . Then [ a , w w a w ] ( a , w w a w ) a , w w a w x = [ a , w w a w ] ( a , w w a w ) a , w . This implies that
a , w w a w x = a , w .
By using Theorem 4.3, a , w = x .
( 1 ) ( 4 ) By the preceding argument, we have x w a w = [ a , w w a w ] a , w w a w . In view of Theorem 4.3, we verify that
x w a w a , w = [ a , w w a w ] [ a , w w a w a , w ] = [ a , w w a w ] a , w = x ,
as required.
( 4 ) ( 1 ) By hypothesis, we check that
( x w a w ) [ a , w w a w ] a , w = [ a , w w a w ] a , w w a w [ a , w w a w ] a , w = [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w a , w ] = [ a , w w a w ] a , w w a w a , w = ( x w a w ) a , w = x .
Therefore we complete the result by Theorem 4.3. □
Set a = a , 1 and A = A , 1 . We deduce that
Corollary 11.
Let a A . Then the following are equivalent:
(1)
a = x .
(2)
x a x = x , a x = a [ a a ] a , x a = [ a a ] a a .
(3)
( a a ) a a x = ( a a ) a , [ a a ] a a x = x .
(4)
x a a = x , x a = [ a a ] a a .
Proof. 
This is obvious by choosing w = 1 in Theorem 4.5. □
Theorem 10.
Let a A , w . Then the following are equivalent:
(1)
a , w = x .
(2)
i m ( x ) = i m ( a , w w a w ) , w a w x = w a w [ a , w w a w ] a , w .
(3)
i m ( x ) = i m ( a , w w a w ) , a , w ( w a w x ) = a , w .
(4)
k e r ( x ) = k e r ( a , w ) , x w a w = [ a , w w a w ] a , w w a w .
(5)
k e r ( x ) = k e r ( a , w ) , ( x w a w ) [ a , w w a w ] = [ a , w w a w ] .
Proof. ( 1 ) ( 2 ) Since a , w = x , it follows by Theorem ??? that
x = [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w i m ( a , w w a w ) ; a , w w a w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] ; ( a , w w a w ) = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] = [ a , w w a w ] a , w ( w a w ) [ a , w w a w ] i m ( x ) .
Therefore i m ( x ) = i m ( a , w w a w ) . By virtue of Theorem 4.3, w a w x = w a w [ a , w w a w ] a , w , as desired.
( 2 ) ( 3 ) By hypothesis, w a w x = w a w [ a , w w a w ] a , w . As in the proof of Theorem 4.3, we prove that a , w ( w a w x ) = a , w , as required.
( 3 ) ( 1 ) Write x = ( a , w w a w ) z for some z A . Then it is easy to verify that
[ a , w w a w ] a , w ( w a w x ) = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] z = [ a , w w a w ] [ a , w w a w ] [ a , w ] w a w ] z = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] z = [ a , w ] w a w ] z = x .
By virtue of Theorem 4.7, a , w = x , as asserted. □
Corollary 12.
Let a A , w . Then the following are equivalent:
(1)
a , w = x .
(2)
i m ( x ) i m ( a , w w a w ) , w a w x = w a w [ a , w w a w ] a , w .
(3)
i m ( x ) i m ( a , w w a w ) , a , w ( w a w x ) = a , w .
(4)
k e r ( a , w ) k e r ( x ) , x w a w = [ a , w w a w ] a , w w a w .
(5)
k e r ( a , w ) k e r ( x ) , ( x w a w ) [ a , w w a w ] = [ a , w w a w ] .
Proof. ( 1 ) ( 2 ) This is trivial by Theorem 4.7.
( 2 ) ( 3 ) Since w a w x = w a w [ a , w w a w ] a , w , analogously to Theorem 4.7, we verify that a , w ( w a w x ) = a , w .
( 3 ) ( 1 ) This is proved as in Theorem 4.7.
( 1 ) ( 4 ) ( 5 ) ( 1 ) These are similar to the preceding discussion. □

5. Relations Involving Certain Outer Inverses

Our main concern in this section is to find relations between weighted generalized core-EP inverse with various outer inverses.
Theorem 11.
Let a A , w . Then
a , w = ( w a w a , w w a w ) = ( p i m ( w a ) d w a w ) = p i m ( a , w w a w ) a , w .
Proof. 
Set x = a , w . Then x = ( a , w w a w ) a , w . By using [?, Theorem 3.1], we check that
[ w a w a , w w a w ] x = w a w a , w ( w a w x ) = w a w a , w , x [ w a w a , w w a w ] = ( a , w w a w ) [ a , w w a w a , w ] w a w = ( a , w w a w ) a , w w a w , w a w a , w w a w x w a w a , w w a w = w a w a , w w a w a , w w a w = w a w a , w w a w a , w w a w = w a w a , w w a w , x [ w a w a , w w a w ] x = [ ( a , w w a w ) a , w w a w ] [ ( a , w w a w ) a , w ] = [ ( a , w w a w ) a , w w a w ( a , w w a w ) ] a , w = ( a , w w a w ) a , w = x .
Hence, we verify that
[ w a w a , w w a w ] x = [ w a w a , w w a w ] x , x [ w a w a , w w a w ] = x [ w a w a , w w a w ] .
Therefore ( w a w a , w w a w ) = x .
Case 1. Let p = w a w a , w . In view of [3] (Theorem 2.1 and Theorem 3.1), p 2 = p = p A . Since p = w a w a [ ( w a ) d ] 2 = ( w a ) ( w a ) d , we see that i m ( p ) = i m ( w a ) d . Hence, p = p i m ( w a ) d . Hence, a , w = ( p i m ( w a ) d w a w ) .
Case 2. Let p = ( a , w w a w ) ( a , w w a w ) . Then we have
a , w = w a w a , w w a w = w a w ( a , w w a w ) ( a , w w a w ) ( a , w w a w ) = w a w p .
Clearly, p 2 = p = p A . Moreover, we have
i m ( p ) = i m ( a , w w a w ) ( a , w w a w ) = i m [ ( a , w w a w ) ( a , w w a w ) ] = i m ( a , w w a w ) .
Therefore a , w = p i m ( a , w w a w ) a , w . □
Corollary 13.
Let a A , w . Then a , w A and ( a , w ) = w a w a , w w a w .
Proof. 
By virtue of Theorem 5.1, a , w = ( w a w a , w w a w ) . Accordingly,
( a , w ) = [ ( w a w a , w w a w ) ] = w a w a , w w a w .
Let a , d A . We say that x A is the Mary inverse of a relatively to d provided that
x a d = d = d a x , x d A A d .
We denote x by a | | d (see [10]). We now derive
Theorem 12.
Let a A , w . Then
a , w = ( w a w ) | | a , w w a w a , w .
Proof. 
Obviously, we have a A , w . Let x = a , w . In view of [3] (Theorem 2.1 and Theorem 3.1), we derive
x = [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] ( [ a , w w a w ] [ a , w w a w ] a , w = [ a , w w a w ] a , w w a w [ a , w w a w ] ( [ a , w w a w ] [ a , w w a w ] a , w
Thus,
x a , w w a w a , w A A a , w w a w a , w .
Moreover, we check that
x ( w a w ) a , w w a w a , w = [ a , w w a w ] [ a , w w a w ] a , w w a w a , w = [ a , w w a w ] [ a , w w a w ] a , w w a w a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w = a , w w a w a , w , a , w w a w a , w w a w x = a , w w a w [ a , w w a w ] [ a , w w a w ] a , w = a , w w a w [ a , w w a w ] [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w = a , w w a w a , w .
Therefore
x = ( w a w ) | | a , w w a w a , w .
Corollary 14.
Let a A . Then
a = a | | a a a .
Proof. 
This is obvious by choosing w = 1 in Theorem 5.3. □
Let a , b , c A . An element a has ( b , c ) -inverse provide that there exists x A such that
x a b = b , c a x = c a n d x b A x x A c .
If such x exists, it is unique and denote it by a ( b , c ) . Evidently, a is the ( a , a ) inverse of a (see [7]). By virtue of Theorem 5.1, we claim that
a , w = ( w a w a , w w a w ) ( w a w ) w a w a , w , ( w a w ) w a w a , w .
Alternatively, we derive
Theorem 13.
Let a A , w . Then
a , w = ( w a w ) ( a , w w a w ) , w a w a , w .
Proof. 
In view of Theorem 4.1, a A , w . Let x = a , w . We verify that
x = [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w [ a , w w a w ] A x , x = [ a , w w a w ] [ a , w w a w a , w ] = [ a , w w a w ] a , w [ w a w a , w ] x A [ w a w a , w ] , x ( w a w ) ( a , w w a w ) = [ a , w w a w ] [ a , w w a w ] ( a , w w a w ) = [ a , w w a w ] [ a , w w a w ] ( a , w w a w ) = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] ) = a , w w a w , w a w a , w ( w a w ) x = w a w a , w ( w a w ) [ a , w w a w ] a , w = w a w [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w = w a w [ a , w w a w a , w ] = w a w a , w .
Therefore
a , w = ( w a w ) ( a , w w a w ) , w a w a , w ,
as asserted. □
As an immediate consequence, we now give a new presentation of the generalized Moore-Penrose inverse for a bounded linear operator over Hilbert spaces.
Corollary 15.
Let A B ( H ) d . Then A = A ( A A ) , A A .
Proof. 
This is obvious by choosing w = 1 in Theorem 5.5. □
Let a A . We say that a has { 2 } -inverse x provided that x = x a x . We denote a T , S ( 2 ) = { x A | x a x = x , i m ( a ) = T , k e r ( a ) = S } . We now derive
Theorem 14.
Let a A , w . Then
a , w = ( w a w ) i m a , w w a w , k e r a , w ( 2 ) .
Proof. 
Let x = a , w . In view of Theorem 4.1, we have x = x ( w a w ) x .
Step 1. i m ( x ) = i m a , w w a w . By virtue of [3] (Theorem 2.1 and Theorem 3.1), we have
x = [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w .
Hence, i m ( x ) i m a , w w a w . One easily checks that
a , w w a w = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] .
Hence,
[ a , w w a w ] [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] .
This implies that [ a , w w a w ] i m ( x ) , as required.
Step 2. k e r ( x ) = k e r a , w . If r k e r ( x ) , then x r = 0 for a r A . Hence,
a , w r = [ a , w w a w ] a , w r = [ a , w w a w ] [ a , w w a w ] [ a , w w a w ] a , w r = [ a , w w a w ] x r = 0 .
This implies that r k e r a , w . If r k e r a , w , then a , w r = 0 . This implies that x r = [ a , w w a w ] a , w r = 0 ; and so r k e r ( x ) . Thus k e r ( x ) = k e r a , w .
Therefore we complete the proof. □
Corollary 16.
Let a A . Then
a = a i m a a , k e r a ( 2 ) .
We now present a new property of the weighted gMP inverse of a bounded operator on a Hilbert space.
Corollary 17.
Let A , W B ( H ) . If A B ( H ) d , W , then
A , W = ( W A W ) R A , W W A W , N A , W ( 2 ) .
Proof. 
This is an immediate consequence of Theorem 5.7. □
Remark 1.
For a complex A, Stanimirovic et al. introduced and studied the ( M , N ) -weighted ( B , C ) -inverse in [17]. By using Theorem 5.7, we prove that A , W = A ( A , W W A W ) , A , W ( 2 , W , W ) .

References

  1. Chen, H.; Sheibani, M. Generalized core-EP inverse in a Banach *-algebra. preprint 2023. [Google Scholar] [CrossRef]
  2. Chen, H.; Sheibani, M. Generalized weighted core inverse in Banach *-algebras. Filomat 2024, 38, 3691–3706. [Google Scholar] [CrossRef]
  3. Chen, H.; Sheibani, M. Weighted generalized core-EP inverse in Banach algebras. Filomat 2025, 39, 10575–10593. [Google Scholar] [CrossRef]
  4. Chen, H.; Sheibani, M. On weighted generalized core-EP inverses. Linear Multilinear Algebra 2026, 74, 121–143. [Google Scholar] [CrossRef]
  5. Chen, J.; Zhu, H.; Patricio, P.; Zhang, Y. Characterizations and representations of core and dual core inverses. Canad. Math. Bull. 2016. [Google Scholar] [CrossRef]
  6. Chen, Y.; Zuo, K.Z.; Fu, Z.M. New characterizations of the generalized Moore-Penrose inverse of mtrices. AIMS Math. 2022, 7, 4359–4375. [Google Scholar] [CrossRef]
  7. Drazin, M.P. A class of outer generalized inverses. Linear Algebra Appl. 2012, 436, 1909–1923. [Google Scholar] [CrossRef]
  8. Gao, Y.; Chen, J. Pseudo core inverses in rings with involution. Commun. Algebra 2018, 46, 38–50. [Google Scholar]
  9. Koliha, J.; Djordjević, D.; Cvetković, D. Moore-Penrose inverse in rings with involution. Linear Algebra Appl. 2007, 426, 371–381. [Google Scholar] [CrossRef]
  10. Mary, X. On generalized inverses and Green’s relations. Linear Algebra Appl. 2011, 434, 1836–1844. [Google Scholar] [CrossRef]
  11. Mosić, D. Weighted GDMP inverse of operators between Hilbert spaces. Bull. Korean Math. Soc. 2018, 55, 1263–1271. [Google Scholar]
  12. Mosić, D. Weighted generalized Moore-Penrose inverse. Georgian Math. J. 2023, 30, 919–932. [Google Scholar] [CrossRef]
  13. Mosić, D.; Baksalary, O.M. Solvability of certain systems of matrix equations related to the Penrose equations. Linear Multilinear Algebra 2025, 73, 2428–2449. [Google Scholar] [CrossRef]
  14. Mosić, D.; Djordjević, D.S. Weighted generalized Drazin inverse in rings. Georgian Math. J. 2016, 23, 587–594. [Google Scholar] [CrossRef]
  15. Mosić, D.; Djordjevic, D.S. The gDMP inverse of Hilbert space operators. J. Spectr. Theory 2018, 8, 555–573. [Google Scholar] [CrossRef]
  16. Rakic, D.S.; Dincic, N.C.; Djordjevic, D.S. Group, Moore-Penrose, core and dual core inverse in rings with involution. Linear Algebra Appl. 2014, 463, 115–133. [Google Scholar]
  17. Stanimirovic, P.S.; Mosić, D.; Ma, H. New classes of more generall weighted outer inverses. Linear Multilinear Algebra 2022, 70, 122–147. [Google Scholar]
  18. Stojanović, K.S.; Mosić, D. Generalization of the Moore-Penrose inverse. Rev. R. Acad. Cienc. Exactas Fis. Nat. Ser. A Mat. 2020, 114(No. 4, Paper No. 196), 16 p. [Google Scholar] [CrossRef]
  19. Xu, S.; Chen, J.; Benítez, J. EP elements in rings with involution. Bull. Malays. Math. Sci. Soc. 2019, 42, 3409–3426. [Google Scholar] [CrossRef]
  20. Xu, S.; Chen, J.; Zhang, X. New characterizations for core inverses in rings with involution. Front. Math. China 2017. [Google Scholar] [CrossRef]
  21. Xu, S.; Zou, H.; Zuo, K. Existence criteria and related relations of the gMP inverse of matrices. Mathematics 2024, 12. [Google Scholar] [CrossRef]
  22. Zhu, H.; Wang, Q. Weighted pseudo core inverses in rings. Linear Multilinear Algebra 2020, 68, 2434–2447. [Google Scholar]
  23. Zhu, H.; Wang, Q. Weighted Moore-Penrose inverses and weighted core inverses in rings with involution. Chin. Ann. Math. Ser. B 2021, 42, 613–624. [Google Scholar] [CrossRef]
  24. Zuo, K.Z.; Chen, Y.; Yuan, L. Further representations and computations of the generalized Moore-Penrose inverse. AIMS Math. 2023, 8, 23442–23458. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
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

© 2026 MDPI (Basel, Switzerland) unless otherwise stated

Accessibility

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings