Preprint
Article

This version is not peer-reviewed.

Generalized Weighted Moore-Penrose Invertibility in Rings

Submitted:

29 June 2026

Posted:

30 June 2026

You are already at the latest version

Abstract
In this paper, we introduce the notion of the generalized weighted Moore-Penrose inverse within the framework of ring. We provide a novel characterization for when a ring element can be decomposed into the sum of a weighted Moore-Penrose invertible element and a quasinilpotent. Furthermore, we reveal the intrinsic relations between the generalized Moore-Penrose inverse and generalized Drazin invertibility, presenting new characterizations that extend existing theories. The study is further deepened with a dedicated analysis of the generalized weighted Moore-Penrose inverse involving square-root weights.
Keywords: 
;  ;  ;  ;  ;  

1. Introduction

An involution of a ring R is an anti-automorphism whose square-root is the identity map 1. A ring R with involution * is called a *-ring. An element a in a *-ring R has group inverse provided that there exists x R such that
x a 2 = a , a x 2 = x , a x = x a .
Such x is unique if exists, denoted by a # , and called the group inverse of a (see [1]). It is well known that a complex matrix A has group inverse if and only if r a n k ( A ) = r a n k ( A 2 ) . Let e R be an invertible Heimitian element (i.e., e is a unit and e * = e ). We say that a R has e-core inverse if there exists some x R such that
x a 2 = a , a x 2 = x , ( e a x ) * = e a x .
If such x exists, it is unique, and denote it by a e # (see [2]). Many properties of e-core inverse were investigated in [3,4,5].
Let a R . Set c o m m ( a ) = { x R a x = x a } and c o m m 2 ( a ) = { x R x y = y x , y c o m m ( a ) } . Recall that a R has generalized Drazin inverse if there exists x R such that
a x 2 = x , a x = x a , a a 2 x R q n i l .
Such x is unique, if exists, and denote it by a d . Here, R q n i l = { x R 1 + x y R 1 f o r a n y y c o m m 2 ( x ) } . Let e , f R be invertible Hermitian elements.
Definition 1.1.  
An element a R has ( e , f ) -MP inverse if there exist x R such that
a x a = a , x a x = x , ( e a x ) * = e a x , ( f x a ) * = f x a .
The preceding x is unique if it exists, and we denote it by a ( e , f ) . The set of all ( e , f ) -MP invertible elements in R is denoted by R ( e , f ) .
Recently, weighted Moore-Penrose inverses are extensively studied by many authors from very different point-views (see [3,4,6]). The motivation of this paper is to investigate when a ring element can be written as the sum of a weighted Moore-Penrose invertible element and a quasinilpotent. In Section 2, we present new characterization of the weighted Moore-Penrose inverse. It is proved that a R ( e , f ) if and only if a f 1 a * e e # and a R = a f 1 a * R . In [7] (Theorem 5), Koliha et al. expressed the weighted MP-inverse respect to a pairs of positive elements of a regular C * -element in terms of the ordinary MP-inverse. We shall generalize this framework to encompass the wider context of ring elements.
We use R ( e , f ) q n i l to stand for the set { y R y f 1 y * e R q n i l } . For further use, we adopt:
Definition 1.2.  
An element a R has generalized ( e , f ) -MP inverse if there exist x , y R such that
a = x + y , x * e y = y f 1 x * = 0 , x R ( e , f ) , y R ( e , f ) q n i l .
We denote x ( e , f ) by a ( e , f ) and call it a generalized ( e , f ) -MP inverse of a.
In Section 3, we establish the connection between weighted Moore-Penrose inverse and generalized Drazin inverse. It is shown that a R ( e , f ) if and only if a f 1 a * e R d .
Finally, in Section 4, we further explore the generalized weighted Moore-Penrose inverse involving square-root weights. Let A be a *-ring and let e , f be square-root elements of R. We prove that a R e , f if and only if f 1 2 a e 1 2 R . This bridges the known formula in [7] (Theorem 5) to the broader realm of ring elements.
Throughout the paper, all *-rings are associative with an involution *. We use R 1 , R # , R d , R e # and R e to denote the sets of all invertible, group invertible, generalized Drazin invertible and generalized e-core invertible in R, respectively. We use ( a ) to stand for the left annihilator of a.

2. Weighted Moore-Penrose Inverse

The purpose of this section is to present new characterize the weighted Moore-Penrose inverse by using the weighted core invertibility. We begin with
Lemma 2.1.  
Let a R . Then the following are equivalent:
(1)
a R ( e , f ) .
(2)
a a f 1 a * R R a * e a .
Proof. 
See [8] (Theorem 2.1). □
An element a R is e-EP if it has e-core inverse and a a e # = a e # a . We now derive
Theorem 2.2.  
Let a R . Then the following are equivalent:
(1)
a R ( e , f ) .
(2)
a f 1 a * e # exists and a R = a f 1 a * R .
(3)
a f 1 a * e e # exists and a R = a f 1 a * R .
(4)
a f 1 a * e is e-EP and a R = a f 1 a * R .
In this case,
a f 1 a * e e # = e 1 ( a ( e , f ) ) * f a ( e , f ) , a ( e , f ) = f 1 a * e a f 1 a * e e # .
Proof. ( 1 ) ( 4 ) We directly check that
a f 1 a * e e 1 ( a ( e , f ) ) * f a ( e , f ) = a a ( e , f ) , e 1 ( a ( e , f ) ) * f a ( e , f ) a f 1 a * e = a a ( e , f ) .
Then e ( a f 1 a * e ) ( e 1 ( a ( e , f ) ) * f a ( e , f ) ) * = e ( a f 1 a * e ) ( e 1 ( a ( e , f ) ) * f a ( e , f ) ) . Moreover, we have
a f 1 a * e e 1 ( a ( e , f ) ) * f a ( e , f ) a f 1 a * e = a a ( e , f ) a f 1 a * e = a f 1 a * e , e 1 ( a ( e , f ) ) * f a ( e , f ) a f 1 a * e e 1 ( a ( e , f ) ) * f a ( e , f ) = a a ( e , f ) e 1 ( a ( e , f ) ) * f a ( e , f ) = e 1 ( a ( e , f ) ) * f a ( e , f ) .
Therefore a f 1 a * e R is an e-EP element and a f 1 a * e e # = e 1 ( a ( e , f ) ) * f a ( e , f ) .
In view of Lemma 2.1, we have a R a f 1 a * R a R . Hence a R = a f 1 a * R , as desired.
( 4 ) ( 3 ) This is obvious.
( 3 ) ( 2 ) By using [9] (Lemma 2.4), a f 1 a * e # exists, as desired.
( 2 ) ( 1 ) This is proved in [8] (Theorem 4.4). □
Corollary 2.3.  
Let a R . Then the following are equivalent:
(1)
a R ( e , f ) .
(2)
a f 1 a * e # exists and 0 ( a ) = 0 a f 1 a * .
(3)
a f 1 a * e e # and ( a ) 0 = a * e a 0 .
(4)
a f 1 a * e is e-EP and ( a ) 0 = a * e a 0 .
Proof. ( 1 ) ( 4 ) In view of Theorem 2.2, a f 1 a * e is e-EP and a R = a f 1 a * e R . This implies that 0 ( a ) = 0 a f 1 a * e R , as required.
( 4 ) ( 3 ) ( 2 ) These are obvious.
( 2 ) ( 1 ) Set z = a f 1 a * e and x = f 1 a * e z # . Then we see that a x z = a [ f 1 a * e z # ] a f 1 a * e = [ a f 1 a * e ] z # [ a f 1 a * e ] = z , and then ( 1 a x ) z = 0 . Hence ( 1 a x ) a f 1 a * = 0 . This implies that ( 1 a x ) a = 0 ; hence, a = a x a = ( a f 1 a * ) e z # a . Therefore a R ( a f 1 a * ) R , thus yielding the result by Theorem 2.2. □
Corollary 2.4.  
Let a R . Then a R ( e , f ) if and only if
(1)
a R = a f 1 a * R ;
(2)
there exists an idempotent p such that ( e p ) * = e p , p a f 1 a * = 0 , a f 1 a * e + p R 1 .
In this case, a ( e , f ) = f 1 a * e ( a f 1 a * e + p 1 ( 1 p ) .
Proof. 
By virtue of Theorem 2.2, a R ( e , f ) if and only if a f 1 a * e has e-core inverse and a R = a f 1 a * R . Moreover, we have
a ( e , f ) = f 1 a * e ( a f 1 a * e ) # .
According to [] (Theorem 2.2), a f 1 a * e has e-core inverse if and only if there exists an idempotent p such that ( e p ) * = e p , p a f 1 a * = 0 , a f 1 a * e + p R 1 . Furthermore, we have
( a f 1 a * e ) e # = ( a f 1 a * e + p 1 ( 1 p ) ,
thus yielding the result. □
An element a in a ring R has f-dual-core inverse if there exists some x R such that x a 2 = a , a x 2 = x , ( f x a ) * = f x a (see [4]) Dually, we obtain the following theorem, which can be proved similarly.
Theorem 2.5.  
Let a R . Then the following are equivalent:
(1)
a R ( e , f ) .
(2)
f 1 a * e a # exists and R a = R a * e a .
(3)
f 1 a * e a has f-dual-core inverse and R a = R a * e a .
(4)
f 1 a * e a is f-EP and R a = R a * e a .
Corollary 2.6.  
Let a R . Then the following are equivalent:
(1)
a R ( e , f ) .
(2)
f 1 a * e a # exists and ( a ) 0 = a * e a 0 .
(3)
f 1 a * e a has f-dual-core inverse and ( a ) 0 = a * e a 0 .
(4)
f 1 a * e a is f-EP and ( a ) 0 = a * e a 0 .
We have now generalized [7] (Theorem 5) to a broader context of ring elements.
Theorem 2.7.  
Let R be a *-ring and let e , f be square-root elements of R. Then the following are equivalent:
(1)
a R e , f .
(2)
e 1 2 a f 1 2 R .
In this case,
a e , f = f 1 2 e 1 2 a f 1 2 e 1 2 .
Proof. ( 1 ) ( 2 ) Set x = a e , f . Then a = a x a , x = x a x , ( e a x ) * = e a x , ( f x a ) * = f x a . Then we verify that
e 1 2 a f 1 2 f 1 2 x e 1 2 = e 1 2 a x e 1 2 = e 1 2 ( e a x ) e 1 2 , f 1 2 x e 1 2 e 1 2 a f 1 2 = f 1 2 x a f 1 2 = f 1 2 ( f x a ) f 1 2 .
Then we have
( e 1 2 a f 1 2 ) ( f 1 2 x e 1 2 ) * = e 1 2 a f 1 2 f 1 2 x e 1 2 , ( f 1 2 x e 1 2 ) ( e 1 2 a f 1 2 ) * = f 1 2 x e 1 2 e 1 2 a f 1 2 .
Moreover, we verify that
e 1 2 a f 1 2 f 1 2 x e 1 2 e 1 2 a f 1 2 = e 1 2 e ( a x a ) f 1 2 ] = e 1 2 a f 1 2 , f 1 2 x e 1 2 e 1 2 a f 1 2 f 1 2 x e 1 2 = f 1 2 ( x a x ) e 1 2 = f 1 2 x e 1 2 .
Therefore e 1 2 a f 1 2 R and e 1 2 a f 1 2 = f 1 2 x e 1 2 .
( 1 ) ( 2 ) Set x = e 1 2 a f 1 2 . Then we have
e 1 2 a f 1 2 x e 1 2 a f 1 2 = e 1 2 a f 1 2 , x e 1 2 a f 1 2 x = x , ( e 1 2 a f 1 2 x ) * = e 1 2 a f 1 2 x , ( x e 1 2 a f 1 2 ) * = x e 1 2 a f 1 2 .
We directly verify that
a f 1 2 x e 1 2 = e 1 2 ( e 1 2 a f 1 2 ) x e 1 2 , f 1 2 x e 1 2 a = f 1 2 x ( e 1 2 a f 1 2 ) f 1 2 .
Therefore
e a f 1 2 x e 1 2 * = e 1 2 ( e 1 2 a f 1 2 ) x e 1 2 = e a f 1 2 x e 1 2 , f f 1 2 x e 1 2 a * = f 1 2 x ( e 1 2 a f 1 2 ) f 1 2 = f f 1 2 x e 1 2 a .
Moreover, we have
a f 1 2 x e 1 2 a = e 1 2 ( e 1 2 a f 1 2 ) x ( e 1 2 a f 1 2 ) f 1 2 = e 1 2 e 1 2 a f 1 2 f 1 2 = a , f 1 2 x e 1 2 a f 1 2 x e 1 2 = f 1 2 x ( e 1 2 a ( f 1 2 ) x e 1 2 = f 1 2 x e 1 2 .
Therefore a e , f = f 1 2 x e 1 2 , as required. □
Corollary 2.8.(see [7] (Theorem 5)) Let A be a C * -algebra and let e , f be positive. If a A be regular, then a A e , f and
a e , f = f 1 2 e 1 2 a f 1 2 e 1 2 .
Proof. 
Obviously, every positive elements in A is square-root. Since a A is regular, then e 1 2 a f 1 2 A is regular. By virtue of [7] (Proposition 2), e 1 2 a f 1 2 A . Therefore we complete the proof by Theorem 2.7. □

3. Generalized Weighted MP Inverse

The purpose of this section is to introduce a new generalized inverse which is a natural generalization of group group inverse in a *-Banach algebra. Our starting points is the following.
Theorem 3.1.  
Let a R . Then the following are equivalent:
(1)
a R ( e , f ) .
(2)
There exist x R ( e , f ) , y R ( e , f ) q n i l such that
a = x + y , x ( e , f ) y = y x ( e , f ) = 0 .
(3)
There exists x R such that
x = x a x , ( e a x ) * = e a x , ( f x a ) * = f x a , a a x a R ( e , f ) q n i l .
Proof. ( 1 ) ( 2 ) By hypothesis, there exist x R ( e , f ) , y R ( e , f ) q n i l such that
a = x + y , x * e y = y f 1 x * = 0 .
Then
x ( e , f ) y = x ( e , f ) e 1 ( e x x ( e , f ) ) * y = x ( e , f ) e 1 ( x ( e , f ) ) * ( x * e y ) = 0 , y x ( e , f ) = y f 1 ( f x ( e , f ) x ) * x ( e , f ) = ( y f 1 x * ) ( f x ( e , f ) ) * x ( e , f ) = 0 ,
as required.
( 2 ) ( 1 ) By assumption, there exist x , y R such that
a = x + y , x ( e , f ) y = y x ( e , f ) = 0 , x R ( e , f ) , y R ( e , f ) q n i l .
Thus, we verify that
x * e y = ( e x x ( e , f ) x ) * y = x * e x ( x ( e , f ) y ) = 0 , y f 1 x * = y f 1 ( x x ( e , f ) x ) * = y f 1 ( x f 1 ) ( f x ( e , f ) x ) * = [ y f 1 ( f x ( e , f ) x ) ] x f 1 * = 0 .
as desired.
( 1 ) ( 3 ) By hypothesis, there exist z , y R such that
a = z + y , z * e y = y f 1 z * = 0 , z R ( e , f ) , y R ( e , f ) q n i l .
Set x = z ( e , f ) . One easily checks that
x y = z ( e , f ) e 1 ( e z z ( e , f ) ) y = z ( e , f ) e 1 ( e z z ( e , f ) ) * y = z ( e , f ) e 1 ( z ( e , f ) ) * ( z * e y ) = 0 , x a = z ( e , f ) z + z ( e , f ) y = z ( e , f ) z , x a x = z ( e , f ) z z ( e , f ) = z ( e , f ) = x ,
Moreover, we check that
y z ( e , f ) = y z ( e , f ) z z ( e , f ) = y f 1 [ f z ( e , f ) z ] z ( e , f ) = ( y f 1 z * ) [ f z ( e , f ) ) * z ( e , f ) = 0 ,
and then
a x = ( z + y ) z ( e , f ) = z z ( e , f ) + y z ( e , f ) = z z ( e , f ) .
Then
( e a x ) * = ( e z z ( e , f ) ) * = e z z ( e , f ) = e a x , ( f x a ) * = ( f z ( e , f ) z ) * = f z ( e , f ) z = f x a .
Since y z ( e , f ) = 0 , we see that
a a x a = a ( 1 x a ) = ( y + z ) ( 1 z ( e , f ) z ) = y ( 1 z ( e , f ) z ) = y R ( e , f ) q n i l ,
as required.
( 2 ) ( 1 ) By hypotheses, there exists z R such that
z = z a z , ( e a z ) * = e a z , ( f z a ) * = f z a , a a z a R ( e , f ) q n i l .
Set x = a z a and y = a a z a . Then a = x + y . We claim that x R ( e , f ) . Evidently, we verify that
x z x = ( a z a ) z ( a z a ) = a ( z a z ) a z a = a ( z a z ) a = a z a = x , z x z = z ( a z a ) z = z a ( z a z ) = z a z = z , e x z = e a z a z = e a z , f z x = f z a z a = f z a , ( e x z ) * = ( e a z ) * = e a z = e x z , ( f z x ) * = ( f z a ) * = f z a = f z x .
Therefore x R ( e , f ) and z = x ( e , f ) . Accordingly, x R ( e , f ) .
Moreover, we see that
x * e y = ( a z a ) * e ( 1 a z ) a = a * ( a z ) * e * ( 1 a z ) a = a * ( e a z ) * ( 1 a z ) a = 0 , = a * ( e a z ) ( 1 a z ) a = 0 .
Since ( f z a ) * = f z a , we have f 1 ( z a ) * f * = z a , and so f 1 ( z a ) * = z a f 1 . This implies that ( z a f 1 ) * = z a f 1 . Therefore
y f 1 x * = ( a a z a ) f 1 ( a z a ) * = a ( 1 z a ) f 1 ( a z a ) * = a [ ( 1 z a ) f 1 ] * ( a z a ) * = a [ ( a z a ) ( 1 z a ) f 1 ] * = 0 .
Since a a z a R ( e , f ) q n i l , we see that y R ( e , f ) q n i l . Therefore we have a ( e , f ) -MP decomposition a = x + y , as asserted. □
We denote x in Theorem 3.1 by a ( e , f ) , and call it the generalized ( e , f ) -MP inverse of a.
Corollary 3.2.  
Let a R . Then the following are equivalent:
(1)
a R .
(2)
There exists a x R such that x = x a x , ( a x ) * = a x , ( x a ) * = x a , ( a a x a ) ( a a x a ) * R q n i l .
Proof. 
This is obvious by choosing e = f = 1 in Theorem 3.1. □
Recall that a has generalized e-core invertible if there exist x , y A such that a = x + y , x * e y = y x = 0 , x A e # , y A q n i l . We use R e , to denote the set of all generalized e-core invertible elements in A . Furthermore, if x A is e-EP, we say that a is generalized e-EP. For more properties of the generalized e-core inverse, we refer the reader to [10,11]. We are ready to prove:
Theorem 3.3.  
Let a R . Then the following are equivalent:
(1)
a R ( e , f ) .
(2)
a f 1 a * e R d .
(3)
a f 1 a * e R e , .
(4)
a f 1 a * e is generalized e-EP.
Proof. ( 1 ) ( 4 ) By hypothesis, there exist x , y R such that
a = x + y , x * e y = y f 1 x * = 0 , x R ( e , f ) , y R ( e , f ) q n i l .
Set z = x ( e , f ) . By virtue of Theorem 2.2, x f 1 x * e is e-EP and x R = x f 1 x * e R . Then we verify that
a f 1 a * e = ( x + y ) f 1 ( x * + y * ) e = ( x + y ) f 1 ( x * e + y * e ) = x f 1 ( x * e + y * e ) + y f 1 ( x * e + y * e ) = x f 1 x * e + y f 1 y * e .
Obviously, we have
[ x f 1 x * e ] * e [ y f 1 y * e ] = [ f 1 x * e ] * [ x * e y ] f 1 y * e = 0 .
[ y f 1 y * e ] [ x f 1 x * e ] = y f 1 [ y * e x ] f 1 x * e = 0 .
Since x f 1 x * e R is e-EP and y f 1 y * e R q n i l . Thus a f 1 a * e R is generalized e-EP, as required.
( 4 ) ( 3 ) This is obvious.
( 3 ) ( 2 ) This is obvious by [10] (Theorem 2.5).
( 2 ) ( 1 ) Let s = a f 1 a * e . Then s * = e a f 1 a * . Hence, ( s d ) * = ( s * ) d = [ e a f 1 a * ] d = e [ a f 1 a * e ] d 2 a f 1 a * = e ( s d ) 2 a f 1 a * .
( 1 s s d ) * = 1 e ( s d ) 2 [ a f 1 a * e ] a f 1 a * = 1 e s d a f 1 a *
e 1 ( 1 s s d ) * e = e 1 [ 1 e s d a f 1 a * ] e = 1 s d a f 1 a * e = 1 s s d
Let x = s s d a and y = ( 1 s s d ) a . Then a = x + y . Then x * = a * s * ( s d ) * = a * e [ a f 1 a * e ] ( s d ) 2 a f 1 a * = a * e s d a f 1 a * .
x * e y = a * e s d a f 1 a * e ( 1 s s d ) a = a * e s d [ a f 1 a * e ] ( 1 s s d ) a = a * e s d s ( 1 s s d ) a = 0 , y f 1 x * = ( 1 s s d ) a f 1 a * e s d a f 1 a * = ( 1 s s d ) s s d a f 1 a * = 0 .
y f 1 y * e = ( 1 s s d ) a f 1 a * ( 1 s s d ) * = ( 1 s s d ) [ a f 1 a * e ] e 1 ( 1 s s d ) * e = ( s s 2 s d ) [ e 1 ( 1 s s d ) * e ] = ( s s 2 s d ) ( 1 s s d ) = s s 2 s d .
Therefore we have y f 1 y * e R q n i l . That is, y R ( e , f ) q n i l .
We will suffice to prove that x = s s d a R ( e , f ) .
One directly verify that
x f 1 x * e = s s d a f 1 a * ( s s d ) * e = s s d [ a f 1 a * e ] e 1 ( s s d ) * e = s s d s [ e 1 ( s s d ) * e ] = s s d s ( s s d ) = s 2 s d .
Hence, x f 1 x * e R # and ( x f 1 x * e ) # = s d .
On the other hand, we have
x R = s s d a R = ( s 2 s d ) ( s d a ) R s 2 s d R = x f 1 x * e R x R .
Thus, x R = x f 1 x * e R . By virtue of Theorem 2.2, x = s s d a R ( e , f ) , as required. □
Corollary 3.4.  
Let a , b R ( e , f ) . If a * e b = b f 1 a * = 0 , then a + b R ( e , f ) .
Proof. 
By virtue of Theorem 3.3, a f 1 a * e , b f 1 b * e R d . Since a * e b = b f 1 a * = 0 , we easily check that ( a + b ) f 1 ( a + b ) * e = a f 1 a * e + b f 1 b * e . Obviously, [ a f 1 a * e ] [ b f 1 b * e ] = 0 . According to [12](Lemma 15.2.2.], ( a + b ) f 1 ( a + b ) * e R d . Applying Theorem 3.3 again, a + b R ( e , f ) . □
Corollary 3.5.  
Let a R . Then the following are equivalent:
(1)
a R .
(2)
There exist x R , y R such that
a = x + y , x y = y x = 0 , y y * R q n i l .
(3)
a a * R d .
(4)
a a * R .
(5)
a a * R .
(6)
There exists an idempotent p c o m m 2 ( a a * ) such that
a a * + p R 1 , a a * p R q n i l .
Proof. 
This is proved by choosing e = f = 1 in Theorem 3.3. □
The involution * is proper, that is, x * x = 0 x = 0 , e.g., in a Rickart *-ring, the involution is always proper. Let C n × n be the Banach algebra of all n × n complex matrices, with conjugate transpose * as the involution. Then the involution * is proper. In [13], Zou et al. extend the notion of weak group inverse to elements in a ring with proper involution. We refer the reader for weak group inverse in [14,15,16].
Corollary 3.6.  
Let R be a ring with proper involution and a R . Then the following are equivalent:
(1)
a R .
(2)
a a * R .
Proof. ( 1 ) ( 2 ) By hypothesis, there exist x , y R such that
a = x + y , x * y = y x * = 0 , x R , y R q n i l .
Set z = x . By virtue of Theorem 2.2, x x * # exists and x R = x x * R . Then we have a a * = x x * + y y * , [ x x * ] * [ y y * ] = x [ x * y ] y * = 0 and [ y y * ] [ x x * ] = y [ y * x ] x * = 0 . Since x x * R # and y y * R q n i l . By virtue of [17](Theorem 1.1), a a * R .
( 2 ) ( 1 ) By virtue of [17] (Theorem 1.1), a a * R d . The proof is completed by Corollary 3.5. □
An element a in a ring R has a generalized f-dual-core inverse if there exist x , y A such that a = x + y , x * f y = y x = 0 , x A has f-dual-core inverse, y A q n i l . Dually, applying a similar argument, we deduce that
Theorem 3.7.  
Let a R . Then the following are equivalent:
(1)
a R ( e , f ) .
(2)
f 1 a * e a R d .
(3)
f 1 a * e a R is generalized f-dual-core inverse.
(4)
f 1 a * e a is generalized e-EP.
The following example illustrates that the existence of a generalized MP invertibility is not preserved under the generalized Drazin invertibility, even in a C * -algebraic setting.
Example 3.8.
Let H = B 2 ( N ) . Define the operator α H as follows:
α e n = { 1 n e n + 1 , n i s o d d , 0 , n i s e v e n .
Here, { e n } is a basis of 2 ( N ) . Then the adjoint operator α * is given by
α * e n = { 1 n 1 e n 1 , n i s e v e n , 0 , n i s o d d .
Thus the product α α * is given by
α α * e n = { 1 n 2 e n , n i s e v e n , 0 , n i s o d d .
Obviously, α has a generalized Drazin inverse, as α 2 is the zero operator. We claim that the element α α * does not possess a generalized Drazin inverse. The spectrum of α α * is σ ( α α * ) = { 0 } { 1 n 2 : n N } . Since lim n 1 n 2 = 0 , the point 0 is a limit point (or accumulation point) of the spectrum. Then 0 is not an isolated point of σ ( α α * ) . This implies that α α * has no generalized Drazin inverse, because a necessary condition for an element to be generalized Drazin invertible is that 0 must be an isolated point of its spectrum. By virtue of Corollary 3.5, α has no generalized MP inverse.

4. Generalized MP Inverses Associated with Square-Root Weights

In this section, we are concerned with the generalized weighted Moore-Penrose inverse involving square-root weights. We shall characterize the generalized weighted Moore-Penrose inverse by using the ordinary Moore-Penrose inverse.
Lemma 4.1.  
Let a R ( e , f ) , b R ( e , f ) . If a * e b = b f 1 a * = 0 , then
( a + b ) ( e , f ) = a ( e , f ) + b ( e , f ) .
Proof. 
Step 1. a , b R ( e , f ) . By hypothesis, we have a b ( e , f ) = b ( e , f ) a = b a ( e , f ) = a ( e , f ) b = 0 . Then we directly check that a + b R ( e , f ) and
( a + b ) ( e , f ) = ( a + b ) ( e , f ) = a ( e , f ) + b ( e , f ) .
Step 2. a R ( e , f ) , b R ( e , f ) . Then we can find x R ( e , f ) and y R ( e , f ) q n i l such that
a = x + y , x * e y = y f 1 x * = 0 .
As in the proof of Theorem 3.1, x = a a ( e , f ) a and y = a a a ( e , f ) a . Then a + b = ( x + b ) + y . Moreover, we see that
x * e b = ( a ( e , f ) a ) * ( a * e b ) = 0 , b f 1 x * = ( b f 1 a * ) ( a a ( e , f ) ) * = 0 .
By using Step 1, we prove that x + b R ( e , f ) . It is easy to verify that
( x + b ) * e y = x * e y + b * e a ( 1 a ( e , f ) a ) = 0 , y f 1 ( x + b ) * = y f 1 x * + ( 1 a a ( e , f ) ) ( a f 1 b * ) = 0 .
Therefore
( a + b ) ( e , f ) = ( x + b ) ( e , f ) = x ( e , f ) + b ( e , f ) = a ( e , f ) + b ( e , f ) .
We are ready to prove:
Theorem 4.2.  
Let p R be a projection and x R . Let α = e 1 2 p x p f 1 2 and β = e 1 2 p x p f 1 2 + e 1 2 ( 1 p ) f 1 2 . Then α R ( e , f ) if and only if
(1)
β R ( e , f ) ;
(2)
[ p f 1 2 ] β ( e , f ) [ e 1 2 ( 1 p ) ] = [ 1 β β ( e , f ) ] [ e 1 2 ( 1 p ) ] = 0 .
In this case,
β ( e , f ) = α ( e , f ) + f 1 2 ( 1 p ) e 1 2 , α ( e , f ) = f 1 2 p f 1 2 β ( e , f ) e 1 2 p e 1 2 .
Proof. 
⟹ Let γ = e 1 2 ( 1 p ) f 1 2 . By virtue of Theorem 2.7, γ R ( e , f ) and γ ( e , f ) = f 1 2 ( 1 p ) e 1 2 .
It is easy to verify that
α * e γ = 0 , γ f 1 α = 0 .
By hypothesis, α R ( e , f ) . In light of Lemma 4.1, β R ( e , f ) and
β ( e , f ) = α ( e , f ) + γ ( e , f ) = α ( e , f ) + f 1 2 ( 1 p ) e 1 2 .
We easily check that
[ p f 1 2 ] β ( e , f ) [ e 1 2 ( 1 p ) ] = [ p f 1 2 ] [ α ( e , f ) + f 1 2 ( 1 p ) e 1 2 ] [ e 1 2 ( 1 p ) ] = [ p f 1 2 ] α ( e , f ) [ e 1 2 ( 1 p ) ] = [ p f 1 2 ] α ( e , f ) e 1 [ e α α ( e , f ) ] [ e 1 2 ( 1 p ) ] = [ p f 1 2 ] α ( e , f ) e 1 [ e α α ( e , f ) ] * [ e 1 2 ( 1 p ) ] = [ p f 1 2 ] α ( e , f ) e 1 [ α ( e , f ) ] * α * [ e e 1 2 ( 1 p ) ] = [ p f 1 2 ] α ( e , f ) e 1 [ α ( e , f ) ] * [ e 1 2 p x p f 1 2 ] * [ e 1 2 ( 1 p ) ] = [ p f 1 2 ] α ( e , f ) e 1 [ α ( e , f ) ] * [ x p f 1 2 ] * p e 1 2 [ e 1 2 ( 1 p ) ] = 0 .
Moreover, we have β β ( e , f ) e 1 2 ( 1 p ) f 1 2 = e 1 2 ( 1 p ) f 1 2 , and then
( 1 β β ( e , f ) ) e 1 2 ( 1 p ) f 1 2 = 0 ,
as required.
⟸ Let z = f 1 2 p f 1 2 β ( e , f ) e 1 2 p e 1 2 . Then we check that
α z = e 1 2 p x p f 1 2 [ f 1 2 p f 1 2 β ( e , f ) e 1 2 p e 1 2 ] = e 1 2 p x p f 1 2 β ( e , f ) e 1 2 p e 1 2 ,
and so
z α z = [ f 1 2 p f 1 2 β ( e , f ) e 1 2 p e 1 2 ] [ e 1 2 p x p f 1 2 β ( e , f ) e 1 2 p e 1 2 ] = f 1 2 p f 1 2 β ( e , f ) e 1 2 p x p f 1 2 β ( e , f ) e 1 2 p e 1 2 = f 1 2 p f 1 2 β ( e , f ) [ e 1 2 p x p f 1 2 + e 1 2 ( 1 p ) f 1 2 ] β ( e , f ) e 1 2 p e 1 2 = f 1 2 p f 1 2 [ β ( e , f ) β β ( e , f ) ] e 1 2 p e 1 2 = f 1 2 p f 1 2 β ( e , f ) e 1 2 p e 1 2 = z .
α z α α = e 1 2 p x p f 1 2 β ( e , f ) e 1 2 p x p f 1 2 e 1 2 p x p f 1 2 = [ e 1 2 p x p f 1 2 + e 1 2 ( 1 p ) f 1 2 ] β ( e , f ) [ e 1 2 p x p f 1 2 ] e 1 2 p x p f 1 2 = β β ( e , f ) [ e 1 2 p x p f 1 2 ] e 1 2 p x p f 1 2 = β β ( e , f ) [ e 1 2 p x p f 1 2 + e 1 2 ( 1 p ) f 1 2 ] [ e 1 2 ( 1 p ) f 1 2 + e 1 2 p x p f 1 2 ] = β β ( e , f ) β β .
Hence,
α z α α = β β ( e , f ) β β R ( e , f ) q n i l .
Since [ e β β ( e , f ) ] * = e β β ( e , f ) , we have
[ e ( e 1 2 p x p f 1 2 + e 1 2 ( 1 p ) f 1 2 ) β ( e , f ) ] * = e ( e 1 2 p x p f 1 2 + e 1 2 ( 1 p ) f 1 2 ) β ( e , f ) .
Then
[ e 1 2 ( p x p + 1 p ) f 1 2 β ( e , f ) ] * = e 1 2 ( p x p + 1 p ) f 1 2 β ( e , f ) .
This implies that
[ ( p x p + 1 p ) f 1 2 β ( e , f ) e 1 2 ] * = ( p x p + 1 p ) f 1 2 β ( e , f ) e 1 2 .
Hence,
[ ( p x p ) f 1 2 β ( e , f ) e 1 2 p ] * = ( p x p ) f 1 2 β ( e , f ) e 1 2 p .
Therefore
[ e ( e 1 2 ( p x p ) f 1 2 ) ( f 1 2 p f 1 2 β ( e , f ) e 1 2 p e 1 2 ) ] * = e ( e 1 2 ( p x p ) f 1 2 ) ( f 1 2 p f 1 2 β ( e , f ) ) e 1 2 p e 1 2 .
That is, ( e α z ) * = e α z . Likewise, we verify that ( f z α ) * = f z α . Accordingly, α R ( e , f ) . In this case, we have
α ( e , f ) = z = f 1 2 p f 1 2 β ( e , f ) e 1 2 p e 1 2 ,
as asserted. □
Corollary 4.3.  
Let p R be a projection and x R . Let α = p x p and β = p x p + 1 p . Then α R if and only if
(1)
β R ;
(2)
p β ( 1 p ) = ( 1 β β ) ( 1 p ) = 0 .
In this case,
β = α + 1 p , α = f 1 2 p f 1 2 β p .
Proof. 
This is obvious by choosing e = f = 1 in Theorem 4.2. □
Theorem 4.4.  
Let a R ( e , f ) , p : = a a ( e , f ) be a projection and x R . Let γ = f 1 2 ( a ( e , f ) x a ) e 1 2 and δ = f 1 2 ( a ( e , f ) x a ) e 1 2 + f 1 2 ( 1 a ( e , f ) a ) e 1 2 . Then γ R ( e , f ) if and only if
(1)
δ R ( e , f ) ;
(2)
e 1 2 δ ( e , f ) ( f 1 2 ( 1 a ( e , f ) a ) ) = 1 a ( e , f ) a , ( ( 1 a ( e , f ) a ) e 1 2 ) δ ( e , f ) ( f 1 2 a ( e , f ) ) = 0 .
In this case,
δ ( e , f ) = α ( e , f ) + e 1 2 ( 1 a a ( e , f ) ) f 1 2 , γ ( e , f ) = e 1 2 a ( e , f ) a e 1 2 δ ( e , f ) f 1 2 a ( e , f ) a f 1 2 .
Proof. 
⟹ Let η = f 1 2 ( 1 a ( e , f ) a ) e 1 2 . By virtue of Theorem 2.7, η R ( e , f ) and η ( e , f ) = e 1 2 ( 1 a ( e , f ) a ) f 1 2 .
It is easy to verify that
γ * f η = [ a ( e , f ) x a e 1 2 ] * f 1 2 f [ f 1 2 ( 1 a ( e , f ) a ) e 1 2 ] = [ a ( e , f ) x a e 1 2 ] * ( 1 a ( e , f ) a ) e 1 2 = 0 , η e 1 γ * = f 1 2 ( 1 a ( e , f ) a ) e 1 2 e 1 [ f 1 2 ( a ( e , f ) x a ) e 1 2 ] * = 0 .
By hypothesis, γ R ( f , e ) . By virtue of Lemma 4.1, δ R ( e , f ) and
δ ( e , f ) = γ ( e , f ) + η ( e , f ) = γ ( e , f ) + e 1 2 ( 1 a ( e , f ) a ) f 1 2 .
We easily check that
e 1 2 δ ( e , f ) ( f 1 2 ( 1 a ( e , f ) a ) ) = 1 a ( e , f ) a , ( ( 1 a ( e , f ) a ) e 1 2 ] ) δ ( e , f ) ( f 1 2 a ( e , f ) ) = 0 .
⟸ Let z = e 1 2 a ( e , f ) a e 1 2 δ ( e , f ) f 1 2 a ( e , f ) a f 1 2 . Then we check that
γ z = [ f 1 2 ( a ( e , f ) x a ) e 1 2 ] [ e 1 2 a ( e , f ) a e 1 2 δ ( e , f ) f 1 2 a ( e , f ) a f 1 2 ] = f 1 2 ( a ( e , f ) x a e 1 2 δ ( e , f ) f 1 2 a ( e , f ) a f 1 2 ,
and then
z γ z = [ e 1 2 a ( e , f ) a e 1 2 δ ( e , f ) f 1 2 a ( e , f ) a f 1 2 ] [ f 1 2 ( a ( e , f ) x a e 1 2 δ ( e , f ) f 1 2 a ( e , f ) a f 1 2 ] = e 1 2 a ( e , f ) a e 1 2 δ ( e , f ) f 1 2 a ( e , f ) x a e 1 2 δ ( e , f ) f 1 2 a ( e , f ) a f 1 2 = e 1 2 a ( e , f ) a e 1 2 δ ( e , f ) [ f 1 2 a ( e , f ) x a e 1 2 + f 1 2 ( 1 a ( e , f ) a ) e 1 2 ] δ ( e , f ) f 1 2 a ( e , f ) a f 1 2 = e 1 2 a ( e , f ) a e 1 2 δ ( e , f ) δ δ ( e , f ) f 1 2 a ( e , f ) a f 1 2 = e 1 2 a ( e , f ) a e 1 2 δ ( e , f ) f 1 2 a ( e , f ) a f 1 2 = z .
By hypothesis, we have
[ a e 1 2 ] δ ( e , f ) [ f 1 2 ( 1 a ( e , f ) a ) ] = [ ( 1 a ( e , f ) a ) e 1 2 ] δ ( e , f ) [ f 1 2 a ( e , f ) ] = 0 .
Then
δ δ ( e , f ) f 1 2 ( 1 a ( e , f ) a ) e 1 2 = f 1 2 [ ( 1 a ( e , f ) a ) e 1 2 δ ( e , f ) ] f 1 2 ( 1 a ( e , f ) a ) e 1 2 = f 1 2 e 1 2 δ ( e , f ) f 1 2 ( 1 a ( e , f ) a ) e 1 2 = f 1 2 ( 1 a ( e , f ) a ) e 1 2 .
Thus, we have
γ z γ γ = [ f 1 2 ( a ( e , f ) x a e 1 2 δ ( e , f ) f 1 2 a ( e , f ) a f 1 2 ] [ f 1 2 ( a ( e , f ) x a ) e 1 2 ] f 1 2 ( a ( e , f ) x a ) e 1 2 = ( f 1 2 a ( e , f ) x a e 1 2 ) δ ( e , f ) ( f 1 2 a ( e , f ) x a e 1 2 ) f 1 2 ( a ( e , f ) x a ) e 1 2 = ( f 1 2 a ( e , f ) x a e 1 2 ) δ ( e , f ) ( f 1 2 a ( e , f ) x a e 1 2 ) f 1 2 ( a ( e , f ) x a ) e 1 2 = [ f 1 2 a ( e , f ) x a e 1 2 + f 1 2 ( 1 a ( e , f ) a ) e 1 2 ] δ ( e , f ) ( f 1 2 a ( e , f ) x a e 1 2 ) f 1 2 ( a ( e , f ) x a ) e 1 2 = δ δ ( e , f ) ( f 1 2 a ( e , f ) x a e 1 2 ) f 1 2 ( a ( e , f ) x a ) e 1 2 = δ δ ( e , f ) [ f 1 2 a ( e , f ) x a e 1 2 + f 1 2 ( 1 a ( e , f ) a ) e 1 2 ] δ δ ( e , f ) f 1 2 ( 1 a ( e , f ) a ) e 1 2 f 1 2 ( a ( e , f ) x a ) e 1 2 = δ δ ( e , f ) δ δ + f 1 2 ( 1 a ( e , f ) a ) e 1 2 δ δ ( e , f ) f 1 2 ( 1 a ( e , f ) a ) e 1 2 = δ δ ( e , f ) δ δ .
Hence,
e 1 2 p e 1 2 [ α z α α ] = e 1 2 p e 1 2 β β ( e , f ) β β ,
and then
α z α α = β β ( e , f ) β β R ( e , f ) q n i l .
Since [ e β β ( e , f ) ] * = e β β ( e , f ) , we have
[ e ( e 1 2 p x p f 1 2 + e 1 2 ( 1 p ) f 1 2 ) β ( e , f ) ] * = e ( e 1 2 p x p f 1 2 + e 1 2 ( 1 p ) f 1 2 ) β ( e , f ) .
Then
[ e 1 2 ( p x p + 1 p ) f 1 2 β ( e , f ) ] * = e 1 2 ( p x p + 1 p ) f 1 2 β ( e , f ) .
This implies that
[ ( p x p + 1 p ) f 1 2 β ( e , f ) e 1 2 ] * = ( p x p + 1 p ) f 1 2 β ( e , f ) e 1 2 .
Hence,
[ ( p x p ) f 1 2 β ( e , f ) e 1 2 p ] * = ( p x p ) f 1 2 β ( e , f ) e 1 2 p .
Therefore
[ e ( e 1 2 ( p x p ) f 1 2 ) ( f 1 2 p f 1 2 β ( e , f ) e 1 2 p e 1 2 ) ] * = e ( e 1 2 ( p x p ) f 1 2 ) ( f 1 2 p f 1 2 β ( e , f ) ) e 1 2 p e 1 2 .
That is, ( e α z ) * = e α z .
Then ( f z α ) * = f z α . Accordingly, α R ( e , f ) . In this case, we have
α ( e , f ) = z = f 1 2 p f 1 2 β ( e , f ) e 1 2 p e 1 2 ,
as asserted. □
Corollary 4.5.  
Let a R and x R . Let γ = a a x a and δ = a a x a + 1 a a . Then γ R if and only if
(1)
δ R ;
(2)
δ ( 1 a a ) ) = 1 a a , ( ( 1 a a ) δ a ) = 0 .
In this case,
δ = α + 1 a a , γ = a a δ a a .
Proof. 
This is obvious by choosing e = f = 1 in Theorem 4.4. □
We now present the generalized weighted Moore-Penrose inverse in terms of the ordinary generalized Moore-Penrose inverse.
Theorem 4.6.  
Let R be a *-ring and let e , f be square-root elements of R. The the following are equivalent:
(1)
a R e , f .
(2)
f 1 2 a e 1 2 R
In this case,
a e , f = f 1 2 e 1 2 a f 1 2 e 1 2 .
Proof. ( 1 ) ( 2 ) Since a R e , f , there exist x , y R such that
a = x + y , x * e y = y f 1 x * = 0 , x R ( e , f ) , y R ( e , f ) q n i l .
By virtue of Theorem 2.7, e 1 2 x f 1 2 R and
x f , e = f 1 2 e 1 2 x f 1 2 e 1 2 .
Obviously, we have
e 1 2 a f 1 2 = e 1 2 x f 1 2 + e 1 2 y f 1 2 .
We directly verify that
[ e 1 2 y f 1 2 ] [ e 1 2 y f 1 2 ] * = e 1 2 y f 1 y * e 1 2 = e 1 2 ( y f 1 y * e ) ) e 1 2 R q n i l .
Furthermore, we check that
e 1 2 x f 1 2 * e 1 2 y f 1 2 = f 1 2 [ x * e f ] f 1 2 ] = 0 , e 1 2 y f 1 2 e 1 2 x f 1 2 * = e 1 2 [ y f 1 x * ] e 1 2 = 0 .
By virtue of Corollary ???, we have e 1 2 a f 1 2 R , as required.
( 2 ) ( 1 ) Set x = e 1 2 a f 1 2 . We claim that a e , f = f 1 2 x e 1 2 . Then there exist x , y R such that
e 1 2 a f 1 2 = x + y , x * y = y x * = 0 , x R , y y * R q n i l .
Then we have
a = e 1 2 x f 1 2 + e 1 2 y f 1 2 .
Claim 1. e 1 2 x f 1 2 R e , f . Since e , f R are square-root elements, so are e 1 and f 1 . Applying Theorem 2.7 to e 1 and f 1 , we see that e 1 2 x f 1 2 R e , f .
Claim 2. e 1 2 y f 1 2 R e , f q n i l . We verify that
e 1 2 y f 1 2 f 1 e 1 2 y f 1 2 * e = e 1 2 y y * e 1 2 R q n i l .
Obviously, we verify that ( e 1 2 x f 1 2 ) * e ( e 1 2 y f 1 2 ) = ( f 1 2 ) * ( x * y ) f 1 2 = 0 and ( e 1 2 y f 1 2 ) f 1 ( e 1 2 x f 1 2 ) * = e 1 2 ( y x * ) ( e 1 2 ) * = 0 . This completes the proof. □
Corollary 4.7.  
Let A be a unital C * -algebra and let e , f be positive invertible elements of A . The the following are equivalent:
(1)
a A e , f .
(2)
f 1 2 a e 1 2 A
In this case,
a e , f = f 1 2 e 1 2 a f 1 2 e 1 2 .
Proof. 
Since e and f are positive, they are square-root elements in A . This completes the proof by Theorem 4.6. □
Corollary 4.8.  
Let A be a ring and let e , f , h be square-root elements of A . Then the following are equivalent:
(1)
( a b ) e , h = b e , f a f , h .
(2)
( a 1 b 1 ) = b 1 a 1 ,
where a 1 = h 1 2 a f 1 2 and b 1 = f 1 2 b e 1 2 .
Proof. 
Let a 1 = h 1 2 a f 1 2 and b 1 = f 1 2 b e 1 2 . Then a 1 b 1 = h 1 2 ( a b ) e 1 2 . In view of Theorem 4.6, we see that a A f , h , b A e , f , a b A e , h if and only if a 1 , b 1 , a 1 b 1 A . Suppose the preceding weighted MP inverses exist. In view of Theorem 4.6, we have
a f , h = f 1 2 a 1 h 1 2 , b e , f = e 1 2 b 1 f 1 2 , ( a b ) e , h = e 1 2 h 1 2 ( a b ) e 1 2 h 1 2 .
Therefore ( a b ) e , h = b e , f a f , h if and only if
e 1 2 ( a 1 b 1 ) h 1 2 = e 1 2 b 1 a 1 h 1 2
if and only if ( a 1 b 1 ) = b 1 a 1 , as asserted. □

References

  1. 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]
  2. Mosic, D.; Deng, C.; Ma, H. On a weighted core inverse in a ring with involution. Commun. Algebra 2018, 46, 2332–2345. [Google Scholar]
  3. Li, T. Characterizations of weighted core inverses in rings with involution. J. Algebra Appl. 2023, 22, 2350216. [Google Scholar]
  4. 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]
  5. Zhu, H.; Wang, Q. Weighted pseudo core inverses in rings. Linear Multilinear Algebra 2020, 68, 2434–2447. [Google Scholar]
  6. Sheng, X.; Chen, G. The generalized weighted Moore-Penrose inverse. J. Appl. Math. Comput. 2007, 25, 407–413. [Google Scholar] [CrossRef]
  7. Koliha, J.; Djordjevic, D.; Cvetkovic, D. Moore-Penrose inverse in rings with involution. Linear Algebra Appl. 2007, 426, 371–381. [Google Scholar]
  8. Chen, Y.; Chen, J. Some progress on weighted Moore-Penrose inverses. Numer. Math. J. Chin. Univ. 2021, 43, 220–231. [Google Scholar]
  9. Xu, S.; Chen, J.; Zhang, X. New characterizations for core inverses in rings with involution. In Front. Math. China; 2017. [Google Scholar] [CrossRef]
  10. Chen, H.; Sheibani, M. Generalized weighted core inverse in Banach *-algebras. Filomat 2024, 38, 3691–3706. [Google Scholar] [CrossRef]
  11. Chen, H.; Sheibani, M. Properties of generalized weighted core inverses in Banach *-algebras. J. Algebra Appl. 2026, 25, 2550358. [Google Scholar]
  12. Chen, H.; Sheibani, M. Theory of Clean Rings and Matrices; World Scientific: Singapore, 2023. [Google Scholar]
  13. Zhou, M.; Chen, J.; Zhou, Y. Weak group inverses in proper *-rings. J. Algebra Appl. 2020, 19. [Google Scholar] [CrossRef]
  14. Mosic, D.; Stanimirovic, P.S. Representations for the weak group inverse. Article ID 125957; Appl. Math. Comput. 2021; 397, p. 19 p. [Google Scholar]
  15. Wang, H.; Chen, J. Weak group inverse. Open Math. 2018, 16, 1218–1232. [Google Scholar] [CrossRef]
  16. Zhou, M.; Chen, J.; Zhou, Y.; Thome, N. Weak group inverses and partial isometries in proper *-rings. Linear Multilinear Algebra 2021, 70, 1–16. [Google Scholar] [CrossRef]
  17. Chen, H.; Sheibani, M. Weighted generalized group inverse in Banach *-algebras. Filomat 2025, 39, 483–500. [Google Scholar] [CrossRef]
  18. Guo, X.; Cen, J. On existence of weighted generalized Moore-Penrose inverse of matrix over ring. J. Ningbo Univ. (Sci. Technol. Ed.) 2009, 22, 383–386. [Google Scholar]
  19. Hartwig, R.E. The weighted *-core-nilpotent decomposition. Linear Algebra Appl. 1994, 211, 101–111. [Google Scholar]
  20. Mosic, D.; Djordjevic, D.S. Weighted-EP elements in C*-algebras. Electron. J. Linear Algebra 2011, 22, 912–930. [Google Scholar]
  21. Prasad, K.M.; Bapat, R.B. The generalized Moore-Penrose inverse. Linear Algebra Appl. 1992, 165, 59–69. [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