Preprint
Article

This version is not peer-reviewed.

m-Generalized RightWeighted Group Inverse in Banach Algebras

Submitted:

12 July 2025

Posted:

15 July 2025

You are already at the latest version

Abstract
In this paper, we introduce the concept of the m-generalized right w-group inverse. This new inverse naturally extends both the m-weak group inverse and the weak w-group inverse to a more general one-sided setting. We characterize this generalized inverse using the generalized right w-group inverse. We also provide alternative characterizations based on the m-generalized right w-group decomposition and the polar-like property, and investigate the related m-weak right w-group inverse.
Keywords: 
;  ;  ;  ;  ;  

1. Introduction

An involution on a Banach algebra A is an anti-automorphism squaring to the identity map 1. A Banach algebra A with an involution * is a Banach *-algebra. The involution * is proper when x * x = 0 x = 0 for all x A ; for instance, this is always true in C * -algebras. In this paper, all Banach algebras are assumed to be complex and equipped with a proper involution *.
An element a R has weak group inverse if there exist x R and n N such that
a x 2 = x , ( a * a 2 x ) * = a * a 2 x , x a n + 1 = a n .
The weak group inverse was extensively studied by many authors from different point of views (see [13,20,22,23,24]).
Recently, the weak group inverse was extended to the m-weak group inverse. An element a R has m-weak group inverse if there exist x R and n N such that
a x 2 = x , ( a * a m + 1 x ) * = a * a m + 1 x , x a n + 1 = a n .
Such an x is unique if it exists, and is denoted by a W m . Various expressions and applications of the m-weak group inverse are known in the literature, e.g., [9,10,14,15,17,25].
Recall that a A d (i.e., generalized right Drazin inverse) if there exists x A such that
a x 2 = x , a x = x a , a a x a A q n i l .
Here,
A q n i l = { x A lim n x n 1 n = 0 } .
In [2], the authors introduced a new generalized as a natural extension of the m-weak group inverse. An element a A has m-generalized group inverse if and only if a A d and there exists x A such that
x = a x 2 , ( a * a m + 1 x ) * = a * a m + 1 x , lim n | | a n x a n + 1 | | 1 n = 0 .
Such an x is unique if it exists, and is denoted by a g m . Many properties of m-weak group inverse are extended to the wider case such as linear operator on an infinitely dimensional Hilbert space (see [16]).
The one-sided generalized Drazin inverse was recently introduced. Consequently, many properties of the generalized Drazin inverse have been extended to this broader setting. An element a A possesses a generalized right Drazin inverse if there exists x A such that
a x 2 = x , a 2 x = a x a , a a x a A q n i l .
The set of all generalized right Drazin invertible elements in A is denoted by A d . Characterizations of this generalized inverse are thoroughly explored in [18,21].
The motivation of this paper is to introduce a new generalized inverse as a natural one-sided version of the (weak) generalized group inverses mentioned above.
Definition 1.1.
An element a A has generalized right w-group inverse if a w A r d and there exist x A such that
x = a ( w x ) 2 , ( a w ) r d * ( a w ) 2 x = ( a w ) r d * a , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
The preceding x is denoted by a r w , g . The set of all generalized right w-group invertible elements in A is denoted by A r w , g .
In Section 2, we investigate the generalized right w-group inverse that are essential for our investigation. In Section 3, we introduce a new generalized inverse based on the generalized right w-group inverse.
Definition 1.2.
An element a A has m-generalized right w-group inverse if a w A r d and there exists x A such that
x = a ( w x ) 2 , [ ( a w ) ( a w ) r d ] * ( a w ) m + 1 x = [ ( a w ) ( a w ) r d ] * ( a w ) m 1 a , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
The preceding x is called an m-generalized right w-group inverse of a. We denote it by a r w , g m .
We prove that a A r w , g if and only if ( a w ) m 1 a A r g . The representations of the generalized right w-group inverse are also presented.
To characterize the m-generalized right w-group inverse, we introduce the one-sided w-group inverse, which can be regarded as the one-sided version of the weighted group inverse in [3,8,15].
Definition 1.3.
An element a A has right w-group inverse if there exist x A such that
a ( w x ) 2 = x , ( a w ) 2 x = a w x w a = a .
We denote the preceding x by a r w , # . The set of all right w-group invertible elements in A is denoted by A r w , # .
In Section 4, we establish the fundamental properties of the m-generalized right w-group inverse. We prove that a A r w , # if and only if a has m-generalized right w-group decomposition, i.e., there exist x , y A such that
a = x + y , x * y = 0 , y w x = 0 , x A r w , # , y A w q n i l .
Here,
A w q n i l = { x A x w A q n i l } .
The polar like property of the m-generalized right w-group inverse is thereby investigated.
Finally, in Section 5, we explore a special case of the m-generalized right w-group inverse.
Definition 1.4.
An element a A has m-weak right w-group inverse provide that there exist x R and n N such that
x = a ( w x ) 2 , ( a w ) n * ( a w ) m + 1 x = ( a w ) n * a m 1 a , ( a w ) n = ( a w ) x w ( a w ) n .
The preceding x is denoted by a w w , w m .
We prove that an element a belongs to A r w , W m if and only if a w A r D and there exists an x A such that
x = a ( w x ) 2 , [ ( a w ) n ] * ( a w ) m + 1 x = [ ( a w ) n ] * ( a w ) m 1 a , ( a w ) n = ( a w ) ( x w ) ( a w ) n
for some n N . This result extends the main characterization of the m-weak group inverse to the one-side case.

2. Generalized Right w-Group Inverse

The purpose of this section is to introduce a new generalized inverse which is a natural generalization of (weak) group inverse in a *-Banach algebra. We begin by
Lemma 2.1.
Let a A r w , # . Then a w , w a A r # . In this case,
a r w , # = a [ ( w a ) r # ] 2 .
Proof
Let x = a r w , # . Then
a ( w x ) 2 = x , ( a w ) 2 x = a w x w a = a .
Then
a ( w x ) 2 = x , ( a w ) 2 x = a w x w a = a .
Hence,
a w ( ( x w ) 2 = x w , ( a w ) 2 x w = a w x w a w = a w .
Hence, a w A r # and ( a w ) r # = x w . Also we check that
w a ( w x ) 2 = w x , ( w a ) 2 w x = w a w x w a = w a .
Thus w a A r # and ( w a ) r # = w x . Therefore x = a ( w x ) 2 = a [ ( w a ) r # ] 2 , as required. □
Theorem 2.2.
Let a A . Then the following are equivalent:
(1)
a A has generalized right w-group decomposition.
(2)
a w A r d and there exists x A such that
x = a ( w x ) 2 , ( a w ) ( a w ) r d * ( a w ) 2 x = ( a w ) ( a w ) r d * a , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
Proof. ( 1 ) ( 2 ) By hypothesis, a has the generalized right w-group decomposition a = a 1 + a 2 . Let x = ( a 1 ) r w , # . By virtue of Lemma 2.1, we have
a w x = ( a 1 w + a 2 w ) ( a 1 ) r w , # = a 1 w ( a 1 ) r w , # + [ a 2 w a 1 ] [ ( w a 1 ) r # ] 2 = a 1 w ( a 1 ) r w , # , a ( w x ) 2 = a 1 [ w ( a 1 ) r w , # ] 2 = ( a 1 ) r w , # = x ,
Since a 2 w a 1 = 0 , we have
a w ( a w ) ( x w ) ( a w ) = ( a 1 w + a 2 w ) [ a 1 w ( a 1 ) r w , # w ] ( a 1 + a 2 ) w = [ 1 a 1 w ( a 1 ) r w , # w ] a 2 w ,
and then
| | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = | | [ a w ( a w ) ( x w ) ( a w ) ] ( a w ) n 1 | | 1 n = | | [ 1 a 1 w ( a 1 ) r w , # ] a 2 w ( a w ) n 1 | | 1 n = | | [ 1 a 1 w ( a 1 ) r w , # w ] ( a 2 w ) n | | 1 n | | 1 a 1 w ( a 1 ) r w , # w | | 1 n | | ( a 2 w ) n | | 1 n .
Since a 2 A w q n i l , we have lim n | | ( a 2 w ) n | | 1 n = 0 . Therefore lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
Obviously, a w = a 1 w + a 2 w with ( a 2 w ) ( a 1 w ) = 0 and a 2 w A q n i l . Since a 1 A r # , w , by virtue of Lemma Lemma 2.1, a 1 w A r # . Then we have a w A r d and
( a w ) r d = ( a 1 w ) r # + n = 1 ( a 1 w ) r # n + 1 ( a 2 w ) n .
Hence, ( a w ) ( a w ) r d = ( a 1 w ) ( a 1 w ) r # + n = 1 ( a 1 w ) r # n ( a 2 w ) n .
As a 1 * a 2 = 0 , we deduce that
( a w ) ( a w ) r d * a 2 = ( a 1 w ) ( a 1 w ) r # * a 2 + n = 1 ( ( a 1 w ) r # ) n ( a 2 w ) n * a 2 = ( a 1 w ) r # * ( ( a 1 w ) * a 2 ) + n = 1 ( ( a 1 w ) r # ) n + 1 ( a 2 w ) n * ( a 1 w ) * a 2 = 0 ;
hence, ( a w ) ( a w ) r d * a 1 = ( a w ) ( a w ) r d * a . Therefore we have
( a w ) ( a w ) r d * ( a w ) 2 x = ( a w ) ( a w ) r d * ( a 1 w + a 2 w ) ( a 1 w + a 2 w ) ( a 1 ) r w , # = ( a w ) ( a w ) r d * ( a 1 w ) 2 ( a 1 ) r w , # = ( a w ) ( a w ) r d * a 1 = ( a w ) ( a w ) r d * a .
( 2 ) ( 1 ) By hypothesis, there exists x A such that
x = a ( w x ) 2 , ( a w ) ( a w ) r d * ( a w ) 2 x = ( a w ) ( a w ) r d * a , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
Then
x = ( a w ) x ( w x ) = ( a w ) [ ( a w ) x ( w x ) ] ( w x ) = ( a w ) 2 x ( w x ) 2 = = ( a w ) n 1 x ( w x ) n 1 .
Let a 1 = ( a w ) 2 x and a 2 = a ( a w ) 2 x . Then we check that
| | a 2 w a 1 | | = | | [ a ( a w ) 2 x ] w ( a w ) 2 x | | = | | [ ( a w ) 2 ( a w ) 2 x w ( a w ) ] ( a w ) x | | = | | ( a w ) 2 [ 1 x w ( a w ) ] ( a w ) x | | = | | ( a w ) 2 [ 1 x w ( a w ) ] ( a w ) n x ( w x ) n 1 | | | | a w | | | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | | | ( a w ) x ( w x ) n 1 | | .
This implies that
| | a 2 w a 1 | | 1 n | | a w | | 1 n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n | | ( a w ) x ( w x ) n 1 | | 1 n .
By hypothesis, we have lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 , and then
lim n | | a 2 w a 1 | | 1 n = 0 .
Accordingly, a 2 w a 1 = 0 .
Since a w ( a w ) ( a w ) r d ( a w ) A q n i l , we see that 1 λ * [ a w ( a w ) ( a w ) r d ( a w ) ] A 1 ; hence, 1 λ [ a w ( a w ) ( a w ) r d ( a w ) ] * A 1 . Then [ a w ( a w ) ( a w ) r d ( a w ) ] * A q n i l . This implies that
lim n | | [ a w ( a w ) ( a w ) r d ( a w ) ] * n | | 1 n = 0 .
It is easy to verify that ( a a a r d a ) a a r d a = a 2 a r d a a a r d a 2 a r d a = a 2 a r d a a 3 ( a r d ) 2 a = 0 , and then
( a a a r d a ) n = ( a a a r d a ) n 1 ( a a a r d a ) = ( a a a r d a ) n 1 a = ( a a a r d a ) n 2 a 2 = = ( a a a r d a ) a n 1 = a n a a r d a n .
Thus we have
lim n | | ( ( a w ) n ( a w ) ( a w ) r d ( a w ) n ) * | | 1 n = lim n | | [ a w ( a w ) ( a w ) r d ( a w ) ] * n | | 1 n = 0 .
Observing that
( a w ) 2 x = ( a w ) 2 [ ( a w ) n 1 x ( w x ) n 1 ] = ( a w ) n + 1 x ( w x ) n 1 = [ ( a w ) n + 1 ( a w ) ( a w ) r d ( a w ) n + 1 ] x ( w x ) n 1 + ( a w ) ( a w ) r d ( a w ) n + 1 ] x ( w x ) n 1 ,
we verify that
| | a 1 * a 2 | | = | | ( ( a w ) 2 x ) * ( a ( a w ) 2 x ) | | | | ( ( a w ) n + 1 ( a w ) ( a w ) r d ( a w ) n + 1 ) * | | | | ( x ( w x ) n 1 ) * | | | | a ( a w ) 2 x | | + | | ( ( a w ) n + 1 ] x ( w x ) n 1 ) * | | | | ( ( a w ) ( a w ) r d ) * ( a ( a w ) 2 x ) | | = | | ( ( a w ) n ( a w ) ( a w ) r d ( a w ) n ) * | | | | ( a w ) * | | | | ( x ( w x ) n 1 ) * | | | | a ( a w ) 2 x | | .
Then
| | a 1 * a 2 | | 1 n | | ( a w ) n ( a w ) ( a w ) r d ( a w ) n * | | 1 n | | ( a w ) * | | 1 n | | ( x ( w x ) n 1 ) * | | 1 n | | a ( a w ) 2 x | | 1 n .
Therefore lim n | | a 1 * a 2 | | 1 n = 0 , and so a 1 * a 2 = 0 . Let m N . Since x = ( a w ) n 1 x ( w x ) n 1 , we see that
| | ( a w ) m x a w x w ( a w ) m x | | = | | [ ( a w ( a w ) x w ( a w ) ] ( a w ) m 1 ) x | | = | | [ a w ( a w ) x w ( a w ) ] ( a w ) m 1 ) ( a w ) n 1 x ( w x ) n 1 | | = | | [ ( a w ) n ( a w ) x w ( a w ) n ] ( a w ) m 1 ) x ( w x ) n 1 | | | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | | | ( a w ) m 1 ) x ( w x ) n 1 | | .
Hence, lim n | | ( a w ) m x a w x w ( a w ) m x | | 1 n = 0 . Thus a w x w ( a w ) m x = ( a w ) m x . Accordingly, we deduce that
a 1 w x = ( a w ) 2 x w x = a w [ a ( w x ) 2 ] = a w x , a 1 ( w x ) 2 = [ a 1 w x ] w x = a ( w x ) 2 = x , ( a 1 w ) 2 x = ( a 1 w ) [ a 1 w x ] = [ ( a w ) 2 x ] w a w x = a w [ a w x w a w ] x = ( a w ) 2 x = a 1 , a 1 w x w a 1 = [ a 1 w x ] [ w ( a w ) 2 x ] = a w x w ( a w ) 2 x = ( a w ) 2 x = a 1 .
Thus, a 1 A r w , # .
We verify that [ a w ( a w ) 2 x w ] ( a w ) 2 x w = a w [ ( a w ) 2 x ( a w ) ( x w ) ( a w ) 2 x ] w = 0 . Then
a w ( a w ) 2 x w n = a w ( a w ) 2 x w n 1 a w ( a w ) 2 x w = a w ( a w ) 2 x w n 1 ( a w ) = a w ( a w ) 2 x w n 2 a w ( a w ) 2 x w ( a w ) = a w ( a w ) 2 x w n 1 ( a w ) 2 = = a w ( a w ) 2 x w ( a w ) n 1 = ( a w ) n ( a w ) 2 x w ( a w ) n 1 = a w [ ( a w ) n 1 ( a w ) ( x w ) ( a w ) n 1 ] .
Hence
| | a w ( a w ) 2 x w n | | 1 n | | a w | | 1 n | | ( a w ) n 1 ( a w ) ( x w ) ( a w ) n 1 | | 1 n 1 1 1 n .
Accordingly,
lim n | | a w ( a w ) 2 x w n | | 1 n = 0 .
This implies that a 2 w = a w ( a w ) 2 x w A q n i l , i.e., a 2 A w q n i l . Therefore we have a generalized right w-group inverse a = a 1 + a 2 , as asserted. □
We denote x in Theorem 2.2 by a r w , g , and call it a generalized right w-group inverse of a. A r w , g denotes the sets of all generalized w-group invertible elements in A .
Corollary 2.3.
Let a A r w , g . Then
[ ( a w ) * ( a w ) 2 a r w , g w ] * = ( a w ) * ( a w ) 2 a r w , g w .
Proof. 
By hypothesis, a has generalized right w-group decomposition a = a 1 + a 2 . Let x = ( a 1 ) r w , # . By virtue of Theorem 2.2, we have a w A r d and
x = a ( w x ) 2 , ( a w ) ( a w ) r d * ( a w ) 2 x = ( a w ) ( a w ) r d * a , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
Then we verify that
( a w ) 2 ( x w ) = ( a 1 w + a 2 w ) 2 ( a 1 ) r w , # w = ( a 1 w ) 2 ( a 1 ) r w , # w = a 1 w , ( a w ) * ( a w ) 2 ( x w ) = ( a 1 w + a 2 w ) * a 1 w = ( a 1 w ) * a 1 w .
Accordingly, [ ( a w ) * ( a w ) 2 ( x w ) ] * = [ ( a 1 w ) * a 1 w ] * = ( a 1 w ) * a 1 w = ( a w ) * ( a w ) 2 ( x w ) , as required. □
Corollary 2.4.
Let a A and w A 1 . Then the following are equivalent:
(1)
a A r w , g .
(2)
a w A r g .
(3)
There exists x A such that
x = a ( w x ) 2 , [ ( a w ) * ( a w ) 2 x w ] * = ( a w ) * ( a w ) 2 x w , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
In this case,
a r w , g = ( a w ) r g w 1 .
Proof. ( 1 ) ( 2 ) Since w A 1 , we directly check that ( a w ) r g = a r w , g w .
( 2 ) ( 1 ) We easily verify that a r w , g = ( a w ) r g w 1 .
( 1 ) ( 3 ) This is obvious by Corollary 2.3.
( 3 ) ( 1 ) By hypothesis, there exists x A such that
x = a ( w x ) 2 , [ ( a w ) * ( a w ) 2 x w ] * = ( a w ) * ( a w ) 2 x w , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
Let a 1 = ( a w ) 2 x and a 2 = a ( a w ) 2 x . As is the proof of Theorem 2.2, we verify that a 2 w a 1 = 0 , ( a 1 ) r w , # = x and x = ( a w ) n 1 x ( w x ) n 1 . It is easy to check that
| | x ( x w ) ( a w x ) | | = | | [ ( a w ) n 1 x w a w ( a w ) n 1 ] x ( w x ) n 1 | | = | | ( a w ) n 1 x w ( a w ) n | | | | x ( w x ) n 1 | | .
By hypothesis, we have
lim n | | ( a w ) n 1 x w ( a w ) n | | 1 n 1 = 0 .
Hence,
lim n | | x ( x w ) ( a w x ) | | 1 n 1 = 0 .
This implies that a w x = ( a w ) ( x w ) ( a w ) x . We derive that
w * a 1 * a 2 w = w * [ ( a w ) 2 x ] * [ a ( a w ) 2 x ] w = [ ( a w ) 2 x w ] * a w [ 1 ( a w ) x w ] = [ ( a w ) * ( a w ) 2 x w ] * [ 1 ( a w ) x w ] = [ ( a w ) * ( a w ) 2 x w ] [ 1 ( a w ) x w ] = ( a w ) * ( a w ) 2 x w ( a w ) * ( a w ) 2 x w ( a w ) x w = ( a w ) * ( a w ) 2 x w ( a w ) * ( a w ) ( a w x w a w x ) w = ( a w ) * ( a w ) 2 x w ( a w ) * ( a w ) 2 x w = 0 .
As w A 1 , we get w * A 1 ; whence, a 1 * a 2 = 0 .
By hypothesis, there exists x A such that
x w = ( a w ) ( x w ) 2 , [ ( a w ) * ( a w ) 2 x w ] * = ( a w ) * ( a w ) 2 x w , lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0 .
Then x w = ( a w ) r g , and so we have a w ( a w ) 2 ( x w ) A q n i l . Hence a 2 = a ( a w ) 2 x A w q n i l . Accordingly, a has generalized right w-group decomposition a = a 1 + a 2 , thus yielding the result. □
Example 2.5.
The space 2 ( N ) is a Hilbert space consisting of all square-summable infinite sequences of complex numbers. Let H = 2 ( N ) 2 ( N ) be the Hilbert space of the sum of 2 ( N ) and itself. Let σ be defined on 2 ( N ) by:
σ ( x 1 , x 2 , x 3 , ) = ( 0 , 0 , 1 1 1 x 1 , 2 1 2 x 2 , 3 1 3 x 3 , ) ;
τ is defined on 2 ( N ) by:
τ ( x 1 , x 2 , x 3 , ) = ( 3 1 3 x 3 , 4 1 4 x 4 , 5 1 5 x 5 , )
and u is defined on 2 ( N ) by:
u ( x 1 , x 2 , x 3 , ) = ( x 1 / 1 1 1 , x 2 / 2 1 2 , x 3 / 3 1 3 , x 4 / 4 1 4 , ) .
We easily check that
lim n | | ( x n ) 2 | | / | | ( x n / n n ) 2 | | = lim n ( n n ) 2 = 1 , lim n | | ( x n ) 2 | | / | | ( n n x n ) 2 | | = lim n ( 1 n n ) 2 = 1 .
Then n = 1 n n x n 2 and n = 1 x n / n n 2 converge. Hence, σ , τ and u are well defined.
Let δ be defined on 2 ( N ) by:
δ ( x 1 , x 2 , x 3 , ) = ( 1 3 x 2 , 1 4 x 3 , 1 5 x 4 , ) .
Let e n = ( 0 , 0 , , 0 , 1 , n 0 , 0 , ) . Then δ ( e n ) = 1 n + 2 e n + 1 . One directly checks that
δ k ( e n ) = j = 0 k 1 1 n + j + 2 e n + k = ( n + 1 ) ! ( n + k + 1 ) ! e n + k .
Then we derive that
| | δ k | | = 1 ( k + 1 ) ! .
By virtue of Stirling’s formula, we have ( k + 1 ) ! 2 π ( k + 1 ) k + 1 e k + 1 , and then
lim k | | δ k | | 1 k = lim k e 1 + 1 k ( 2 π ) 1 k [ ( k + 1 ) 1 k + 1 ] 1 + 1 k ( k + 1 ) 1 + 1 k = 0 .
Thus δ is quasinilpotent, and then so is δ 2 .
Let T = τ δ 2 be the direct sum of τ and δ 2 , W = u I be the direct sum of u and the identical operator I, S = σ 0 be the direct sum of σ and 0. Then T , W and S are operators on H. We see that T = α + β , where α = τ 0 and β = 0 γ 2 .
Claim 1. α has right W-group inverse. We directly check that τ u σ u = u τ u σ = I . Then α W S W = W α W S = I 0 . Hence,
α ( W S ) 2 = [ α W S W ] S = S , α W S W α = [ α W S W ] α = α , ( α W ) 2 S = α [ W α W S ] = α .
Then S = α r W , # .
Claim 2. W β is quasinilpotent. Since W β = 0 δ 2 , we see that W β is quasinilpotent.
Claim 3. α * β = β W α = 0 . This is obvious.
Therefore T has a generalized right W-group inverse by Theorem 2.2.

3. m-Generalized Right w-Group Inverse

This section introduces a new generalized inverse, which serves as a natural generalization of the (weak) group inverse within the context of *-Banach algebras. Here, we explore the fundamental properties of the m-generalized right w-group inverse for elements in a Banach *-algebra.
Lemma 3.1.
Let a A and n N . Then a n A r d and ( a n ) r d = ( a r d ) n .
Proof. 
Set x = ( a r d ) n . Then we verify that
a n x 2 = a n ( a r d ) n ( a r d ) n = a a r d ( a r d ) n = a ( a r d ) n + 1 = x , ( a n ) 2 x = ( a n ) 2 ( a r d ) n = a n [ a n ( a r d ) n ] = a n + 1 a r d = a a r d a n = a n ( a r d ) n a n = a n x a n , a n a n x a n = a n a n ( a r d ) n a n = a n a a r d a n = [ a a a r d a ] a n 1 .
Since [ a a a r d a ] a n 1 = a n a a r d a n = a n a n a r d a = a n 1 [ a a a r d a ] and a a a r d a A q n i l , it follows by [26] that [ a a a r d a ] a n 1 A q n i l . Hence, a n a n x a n A q n i l . Therefore ( a n ) r d = ( a r d ) n . □
Theorem 3.2.
Let a A . Then a A r w , g m if and only if a w A r d and ( a w ) m 1 a A r w , g . In this case,
a r w , g m = ( a w ) m 1 ( ( a w ) m 1 a ) r w , g .
Proof. 
⟹ Since a A r w , g m , then a w A r d and there exists x A such that
x = a ( w x ) 2 , [ ( a w ) ( a w ) r d ] * ( a w ) m + 1 x = [ ( a w ) ( a w ) r d ] * ( a w ) m 1 a , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
In view of Lemma 3.1, [ ( a w ) m 1 a ] w = ( a w ) m A r d . Let y = ( x w ) m 1 x . Then we verify that
( a w ) m 1 a ( w y ) 2 = ( a w ) m 1 a ( w x ) 2 m = ( a w ) m 1 [ a ( w x ) 2 ] ( w x ) 2 m 2 = ( a w ) m 1 x ( w x ) 2 m 2 = ( a w ) m 2 [ a ( w x ) 2 ] ( w x ) 2 m 3 = ( a w ) m 2 x ( w x ) 2 m 3 = = ( a w ) m m x ( w x ) 2 m ( m + 1 ) = x ( w x ) m 1 = ( x w ) m 1 x = y , ( ( a w ) m 1 a w ) r d * ( ( a w ) m 1 a w ) 2 y = ( ( a w ) m ) r d * ( a w ) 2 m ( x w ) m 1 x = ( ( a w ) m ) r d * ( a w ) 2 m ( x w ) m 1 x = ( ( a w ) m ) r d * ( a w ) 2 m 1 [ a ( w x ) 2 ] w ( x w ) m 3 x = ( ( a w ) m ) r d * ( a w ) 2 m 1 ( x w ) m 2 x = = ( ( a w ) m ) r d * ( a w ) 2 m ( m 1 ) ( x w ) m m x = ( ( a w ) m ) r d * [ ( a w ) r d ] * ( a w ) m + 1 x = ( ( a w ) m 1 ) r d * [ ( a w ) r d ] * ( a w ) m 1 a = ( ( a w ) m ) r d * ( a w ) m 1 a ,
Moreover, we have
( ( a w ) m 1 a w ) n ( ( a w ) m 1 a w ) ( y w ) ( ( a w ) m 1 a w ) n = ( ( a w ) m ) n ( a w ) m ( x w ) m 1 x w ( ( a w ) m ) n = ( ( a w ) m ) n a w ) m ( x w ) m ( ( a w ) m ) n = ( ( a w ) m ) n ( a w ) ( x w ) ( ( a w ) m ) n = [ ( a w ) n ( a w ) ( x w ) ( a w ) n ] [ ( a w ) n ] m 1 .
Hence, we have
| | ( ( a w ) m 1 a w ) n ( ( a w ) m 1 a w ) ( y w ) ( ( a w ) m 1 a w ) n | | 1 n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n | | a w | | m 1 .
Therefore
lim n | | ( ( a w ) m 1 a w ) n ( ( a w ) m 1 a w ) ( y w ) ( ( a w ) m 1 a w ) n | | 1 n = 0 .
By virtue of Theorem 2.2, ( a w ) m 1 a A r w , g . Therefore ( ( a w ) m 1 a ) r w , g = y = ( x w ) m 1 x , as required.
⟸ By hypothesis, a w A r d . In view of Lemma 3.1, we may assume that ( a m ) r d = ( a r d ) m . Hance, we have ( a w ) m ( ( a w ) m ) r d = ( a w ) m [ ( a w ) r d ] m = ( a w ) ( a w ) r d . Moreover, we can find a y A such that
y = ( a w ) m 1 a ( w y ) 2 , ( a w ) m ( ( a w ) m ) r d * ( a w ) 2 m y = ( a w ) m ( ( a w ) m ) r d * ( a w ) m 1 a , lim n | | ( a w ) m n ( a w ) m ( y w ) ( a w ) m n | | 1 n = 0 .
Then we verify that
y = ( a w ) m y ( w y ) = ( a w ) m [ ( a w ) m y ( w y ) ] ( w y ) = ( a w ) 2 m y ( w y ) 2 = = ( a w ) ( n 1 ) m y ( w y ) n 1 = ( a w ) m n y ( w y ) n .
Take x = ( a w ) m 1 y . Then
| | [ 1 ( a w ) ( a w ) r d ] y | | 1 m n = | | [ 1 ( a w ) ( a w ) r d ] ( a w ) m n y ( w y ) n | | 1 m n | | ( a w ) m n ( a w ) ( a w ) r d ( a w ) m n | | 1 m n | | y ( w y ) n | | 1 m n .
Hence, | | [ 1 ( a w ) ( a w ) r d ] y | | 1 m n = 0 . This implies that [ 1 ( a w ) ( a w ) r d ] y = 0 ; and so y = ( a w ) ( a w ) r d y . Then we verify that
a ( w x ) 2 = a [ w ( a w ) m 1 y ] [ w ( a w ) m 1 y ] = ( a w ) m y w [ ( a w ) m 1 y ] = ( a w ) m y w ( a w ) m 1 [ ( a w ) ( a w ) r d y ] = ( a w ) m [ y w ( a w ) m ] ( a w ) r d y = ( a w ) m [ ( y w ) ( ( a w ) m 1 a w ) ] ( a w ) r d y = ( a w ) m ( a w ) r d y = ( a w ) m 1 y = x , ( a w ) ( a w ) r d * ( a w ) m + 1 x = ( a w ) ( a w ) r d * ( a w ) m + 1 ( a w ) m 1 y = ( a w ) m ( ( a w ) m ) r d * ( a w ) 2 m y = ( a w ) m ( ( a w ) m ) r d * ( a w ) m 1 a = ( a w ) ( a w ) r d * ( a w ) m 1 a .
Obviously, we have
( a w ) m ( n + 1 ) ( a w ) ( x w ) ( a w ) m ( n + 1 ) = ( a w ) m n + m ( a w ) x w ( a w ) m ( n + 1 ) = ( a w ) m ( a w ) m n ( ( a w ) m y w ) ( a w ) m ( n + 1 ) = [ ( ( a w ) m ) n ( a w ) m ( y w ) ( a w ) m ) n ] ( a w ) m .
Hence,
| | ( a w ) m ( n + 1 ) ( a w ) ( x w ) ( a w ) m ( n + 1 ) | | 1 m ( n + 1 ) | | ( ( a w ) m ) n ( a w ) ( y w ) ( ( a w ) m ) n | | 1 m ( n + 1 ) | | ( a w ) m | | 1 m ( n + 1 ) = | | ( a w ) m | | 1 m ( n + 1 ) | | ( ( a w ) m ) n ( a w ) ( y w ) ( ( a w ) m ) n | | 1 n .
Thus, we derive
lim n | | ( a w ) m ( n + 1 ) ( a w ) ( x w ) ( a w ) m ( n + 1 ) | | 1 m ( n + 1 ) = 0 .
Therefore a r g m , w = x = a m 1 y = ( a w ) m 1 ( ( a w ) m 1 a ) r w , g , as asserted. □
Corollary .3.
Let a A r w , g m . Then ( ( a w ) m 1 a ) r w , g = ( a r w , g m w ) m 1 a r w , g m .
Proof. 
This is obvious by the proof of Theorem 3.2. □
An element a A has ( m , w ) -generalized group inverse if a A d , w and there exists x A such that
x = a ( w x ) 2 , [ ( a w ) d ] * ( a w ) m + 1 x = [ ( a w ) d ] * ( a w ) m 1 a , lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 .
The preceding x is unique, and is called the ( m , w ) -generalized group inverse of a. We denote it by a w g m . Many elementary properties of the ( m , w ) -generalized group inverse are established in [5]. We are ready to prove:
Theorem 3.4.
An element a A has ( m , w ) -generalized group inverse if and only if a w A d and a A has an m-generalized right w-group inverse.
Proof. 
⟹ This is obvious.
⟸ Set x = a r w , g m . Then we have a w A r d and there exists x A such that
x = a ( w x ) 2 , ( a w ) ( a w ) r d * ( a w ) m + 1 x = ( a w ) ( a w ) r d * a m 1 , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
Set y = ( a w ) r d . Then
( a w ) y 2 = y , ( a w ) 2 y = ( a w ) y ( a w ) , a w ( a w ) y ( a w ) A q n i l .
Set z = ( a w ) d . Then
( a w ) z 2 = z = z ( a w ) z , ( a w ) z = z ( a w ) , a w ( a w ) z ( a w ) A q n i l .
Hence, ( a w ) n z ( a w ) n + 1 = [ a w z ( a w ) 2 z ] n . Therefore lim n | | ( a w ) n z ( a w ) n + 1 | | 1 n = 0 .
Hence, y = ( a w ) y 2 = ( a w ) n y n + 1 . On the other hand, we have z = ( a w ) z 2 = ( a w ) n z n + 1 . Clearly, ( a w ) y ( a w ) 2 y = ( a w ) y [ ( a w ) y ( a w ) ] = [ ( a w ) y ( a w ) ] y ( a w ) = ( a w ) 2 y 2 ( a w ) = ( a w ) y ( a w ) ; hence,
( a w ) 2 y [ a w ( a w ) 2 y ] = ( a w ) 2 y ( a w ) ( a w ) 2 y ( a w ) 2 y = 0 .
Thus,
[ a w ( a w ) 2 y ] 2 = [ a w ( a w ) 2 y ] [ a w ( a w ) 2 y ] = ( a w ) [ a w ( a w ) 2 y ] .
By induction, we have [ a w ( a w ) 2 y ] n = ( a w ) n [ a w ( a w ) 2 y ] . Since a w ( a w ) y ( a w ) A q n i l , by using Cline’s formula (see [11]), a w ( a w ) 2 y A q n i l . Hence
lim n | | ( a w ) n ( a w ) n + 1 y | | 1 n = lim n | | [ a w ( a w ) 2 y ] n | | 1 n = 0 .
For any n N , we have
z n + 1 ( a w ) n + 1 y = z n + 1 ( a w ) n + 1 [ ( a w ) n y n + 1 ] = z n + 1 ( a w ) 2 n + 1 y n + 1 = [ z ( a w ) n + 1 ] y n + 1 = ( a w ) n y n + 1 = y , z n + 1 ( a w ) n = ( a w ) z 2 = z .
Then
| | y z | | 1 n | | y z | | 1 + 1 n | | ( a w ) n ( a w ) n + 1 y | | 1 n .
This implies that
lim n | | y z | | 1 n = 0 ;
whence, | | y z | | = 0 . Thus y = z .
Since ( a w ) ( a w ) r d * ( a w ) m + 1 x = ( a w ) ( a w ) r d * a m 1 , we have
( a w ) d * ( a w ) m 1 x = ( a w ) ( a w ) d * [ ( a w ) ( a w ) d * ( a w ) m 1 x ] = ( a w ) ( a w ) d * [ ( a w ) d * a m 1 ] = ( a w ) d * a m 1 .
Let t = a w ( a w ) d x . One directly verifies that
| | a w x a w t | | = | | [ a w ( a w ) 2 ( a w ) d ] x | | = | | [ a w ( a w ) 2 ( a w ) d ] ( a w ) n 1 x ( a w ) n 1 | | = | | [ a w ( a w ) 2 ( a w ) d ] n x ( a w ) n 1 | | | | [ a w ( a w ) 2 ( a w ) d ] n | | | | x ( a w ) n 1 | | ,
Since lim n | | [ a w ( a w ) 2 ( a w ) d ] n | | 1 n = 0 , we deduce that
lim n | | a w x a w t | | 1 n = 0 .
This implies that a w x = a w t .
By hypothesis, x = a ( w x ) 2 = ( a w ) n x ( w x ) n . Hence,
| | x a w ( a w ) d x | | 1 n = | | ( a w ) n x ( w x ) n ( a w ) d ( a w ) n + 1 x ( w x ) n | | 1 n | | ( a w ) n ( a w ) d ( a w ) n + 1 | | 1 n | | x | | 1 n | | w x | | 1 n ,
This implies that lim n | | x a w ( a w ) d x | | 1 n = 0 , and then a w ( a w ) d x = x . Therefore
t = a w ( a w ) d x = a w ( a w ) d a ( w x ) 2 = ( a w ) 2 ( a w ) d x w x = ( a w ) 2 ( a w ) d x w [ a w ( a w ) d x ] = a w t w t = a ( w t ) 2 ( a w ) d * ( a w ) m + 1 t = ( a w ) d * ( a w ) m + 1 x = ( a w ) d * a m 1 .
Moreover, we derive that
| | ( a w ) n t w ( a w ) n + 1 | | 1 n = | | [ ( a w ) n ( a w ) n + 1 ( a w ) d ] + [ ( a w ) d ( a w ) n a w ( a w ) d ( a w ) ( x w ) ( a w ) n a w ] | | 1 n | | ( a w ) n ( a w ) n + 1 ( a w ) d | | 1 n + | | ( a w ) d | | 1 n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n | | a w | | 1 n ,
we have
lim n | | ( a w ) n t w ( a w ) n + 1 | | 1 n = 0 .
Therefore a A has ( m , w ) -generalized group inverse. □
Corollary 3.5.
An element a A has a generalized w-group inverse if and only if a A d and a A has a generalized right w-group inverse.
Proof. 
This is obvious by choosing m = 1 in Theorem 3.4. □
Example 3.6.
Let H = 2 ( N ) 2 ( N ) . Construct T , W , τ and δ as in Example 2.5. Let η be defined on 2 ( N ) by:
η ( x 1 , x 2 , x 3 , ) = ( 2 1 2 x 2 , 3 1 3 x 3 , 4 1 4 x 4 , )
and u is defined on 2 ( N ) by:
u ( x 1 , x 2 , x 3 , ) = ( x 1 / 1 1 1 , x 2 / 2 1 2 , x 3 / 3 1 3 , x 4 / 4 1 4 , ) .
Let θ be the right shift operator defined on 2 ( N ) by:
θ ( x 1 , x 2 , x 3 , ) = ( 1 3 × 4 x 3 , 1 4 × 5 x 4 , 1 5 × 6 x 5 , ) .
As the proof in Example 2.5, we easily see that θ is well defined.
We easily see that τ = η u η and θ = δ 2 . Let A = η θ and W = u I . Then A W A = T . In view of Example 2.5, T has generalized right W-group inverse. Therefore A has 2-generalized right W-group inverse by Theorem 3.2.
Clearly, A W = η u θ , where η u ( x 1 , x 2 , x 3 , ) = ( x 1 , x 2 , x 3 , ) for any ( x 1 , x 2 , x 3 , ) 2 ( N ) . Then η u B ( 2 ( N ) ) has no generalized Deazrin inverse. Hence, A W B ( H ) has no generalized Drazin inverse. Therefore A has not 2-generalized W-group inverse by Theorem 3.4.

4. Algebraic Properties

The aim of this section is to investigate the algebraic properties of the m-generalized right w-group inverse. Next, we establish the relationship between the m-generalized right w-group inverse and the corresponding element decomposition.
Theorem 4.1.
Let a A . Then the following are equivalent:
(1)
a A r w , g m .
(2)
a has m-generalized right w-group decomposition, i.e., there exist x , y A such that
a = x + y , x * ( a w ) m 1 y = y w x = 0 , x A r w , # , y A w q n i l .
Proof. ( 1 ) ( 2 ) By hypothesis, there exists x A such that
x = a ( w x ) 2 , [ ( a w ) ( a w ) r d ] * ( a w ) m + 1 x = [ ( a w ) ( a w ) r d ] * ( a w ) m 1 a , lim n | | ( a w ) n a w x w ( a w ) n | | 1 n = 0 .
Let a 1 = ( a w ) 2 x and a 2 = a ( a w ) 2 x . Then we check that
| | a 2 w a 1 | | = | | [ a ( a w ) 2 x ] w ( a w ) 2 x | | = | | ( a w ) 3 x ( a w ) 2 x [ ( w a ) 2 ( w x ) ] | | = | | ( a w ) 3 x ( a w ) 2 x [ ( w a ) k + 1 ( w x ) k | | = | | a ( w a ) 2 ( w x ) a ( w a ) ( w x ) [ ( w a ) k + 1 ( w x ) k | | | | a w | | | | ( a w ) k ( a w ) x w ( a w ) k ] | | | | [ a ( w x ) k ] | | .
Since lim k | | ( a w ) k ( a w ) x w ( a w ) k | | 1 k = 0 , we deduce that lim k | | a 2 w a 1 | | 1 k = 0 , and then a 2 w a 1 = 0 .
Moreover, we have
| | a 1 * ( a w ) m 1 a 2 | | = | | ( a w ) 2 x * ( a w ) m 1 a ( a w ) 2 x | | = | | ( a w ) 2 x * ( a w ) m 1 a ( a w ) 2 x * ( a w ) m + 1 x | | = | | ( a w ) 2 x * ( a w ) m 1 a ( a w ) k ( x w ) k 2 x * ( a w ) m + 1 x | | = | | ( a w ) 2 x * ( a w ) m 1 a [ ( a w ) k ( a w ) ( a w ) r d ( a w ) k ] ( x w ) k 2 x * ( a w ) m + 1 x ( a w ) ( a w ) r d ( a w ) k ( x w ) k 2 x * ( a w ) m + 1 x | | | | ( ( a w ) k ( a w ) ( a w ) r d ( a w ) k ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | ( a w ) 2 x * ( a w ) m 1 a [ ( a w ) ( a w ) r d ( a w ) k ( x w ) k 2 x ] * ( a w ) m + 1 x | | | | ( ( a w ) k ( a w ) ( a w ) r d ( a w ) k ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | ( a w ) 2 x * ( a w ) m 1 a [ ( a w ) k ( x w ) k 2 x ] * [ ( a w ) ( a w ) r d ] * ( a w ) m + 1 x | | | | ( ( a w ) k ( a w ) ( a w ) r d ( a w ) k ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | ( a w ) 2 x * ( a w ) m 1 a [ ( a w ) k ( x w ) k 2 x ] * [ ( a w ) ( a w ) r d ] * a | |
| | ( ( a w ) k ( a w ) ( a w ) r d ( a w ) k ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | ( a w ) 2 x * ( a w ) m 1 a [ ( a w ) ( a w ) r d ( a w ) k ( x w ) k 2 x ] * a | | | | ( ( a w ) k ( a w ) ( a w ) r d ( a w ) k ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | ( a w ) k ( x w ) k 2 x * a [ ( a w ) ( a w ) r d ( a w ) k ( x w ) k 2 x ] * a | | | | ( ( a w ) k ( a w ) ( a w ) r d ( a w ) k ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | [ ( a w ) k ( a w ) ( a w ) r d ( a w ) k ] ( x w ) k 2 x * a | | | | ( ( a w ) k ( a w ) ( a w ) r d ( a w ) k ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | ( a w ) k ( a w ) ( a w ) r d ( a w ) k * | | | | ( x w ) k 2 x * | | | | a | | .
Then
| | a 1 * ( a w ) m 1 a 2 | | 1 k | | ( ( a w ) k ( a w ) ( a w ) r d ( a w ) k ) * | | 1 k | | ( ( x w ) k 2 x ) * | | 1 k | | ( a w ) m + 1 x | | 1 k + | | ( ( a w ) k ( a w ) ( a w ) r d ( a w ) k ) * | | 1 k | | ( x w ) k 2 x * | | 1 k | | a | | 1 k .
As in the proof of Theorem 2.2, we have lim k | | ( ( a w ) k ( a w ) ( a w ) r d ( a w ) k ) * | | 1 k = 0 . Then lim k | | a 1 * ( a w ) m 1 a 2 | | 1 k = 0 , and then a 1 * ( a w ) m 1 a 2 = 0 . We further verify that
[ a w ( a w ) ( x w ) ( a w ) ] a w x = [ a w ( a w ) ( x w ) ( a w ) ] ( a w ) 2 x ( w x ) = [ a w ( a w ) ( x w ) ( a w ) ] ( a w ) 3 x ( w x ) 2 = [ ( a w ) n ( a w ) ( x w ) ( a w ) n ] x ( w x ) n 2 .
Therefore
| | [ a w ( a w ) ( x w ) ( a w ) ] a w x | | 1 n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n | | x ( w x ) n 2 | | 1 n .
Since lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 , we deduce that
lim n | | [ a w ( a w ) ( x w ) ( a w ) ] a w x | | 1 n = 0 .
This implies that [ a w ( a w ) ( x w ) ( a w ) ] ( a w ) x = 0 , i.e., ( a w ) 2 x = ( a w ) ( x w ) ( a w ) 2 x . Likewise, ( a w ) 2 x w ( a w ) x = ( a w ) 2 x . Then we check that
| | [ a w ( a w ) ( x w ) ( a w ) ] n + 1 | | 1 n + 1 = | | [ a w ( a w ) ( x w ) ( a w ) ] n 1 [ a w ( a w ) ( x w ) ( a w ) ] ( a w ) | | 1 n + 1 = | | [ a w ( a w ) ( x w ) ( a w ) ] n 1 ( a w ) 2 | | 1 n + 1 = | | [ a w ( a w ) ( x w ) ( a w ) ] ( a w ) n | | 1 n + 1 | | ( a w ) n + 1 ( a w ) ( x w ) ( a w ) n + 1 | | 1 n n n + 1 | | ( a w ) n | | 1 n + 1 .
Accordingly,
lim n | | [ a w ( a w ) ( x w ) ( a w ) ] n + 1 | | 1 n + 1 = 0 ;
hence, a w ( a w ) ( x w ) ( a w ) A q n i l . By using Cline’s formula (see [11]), y = a ( a w ) 2 x A w q n i l . Moreover, we check that
a 1 ( w x ) 2 = [ ( a w ) 2 x ] ( w x ) 2 = a w [ a ( w x ) 2 ] w x = a ( w x ) 2 = x , ( a 1 w ) 2 x = ( a w ) 2 x w a w [ a ( w x ) 2 ] = a 1 , a 1 w x w a 1 = ( a w ) 2 x w x w ( a w ) 2 x = a w [ a ( w x ) 2 ] w ( a w ) 2 x = ( a w ) ( x w ) ( a w ) 2 x = ( a w ) 2 x = a 1 .
Hence ( a 1 ) r w , # = x . Hence, we have a m-generalized right w-group decomposition a = a 1 + a 2 , as required.
( 2 ) ( 1 ) By hypothesis, a has m-generalized right w-group decomposition a = a 1 + a 2 . Then ( a 1 ) * ( a w ) m 1 a 2 = 0 and a 2 w a 1 = 0 . Let x = ( a 1 ) r w , # . Then we verify that a ( w x ) 2 = ( a 1 + a 2 ) w ( a 1 ) r w , # 2 = a 1 w ( a 1 ) r w , # 2 = ( a 1 ) r w , # = x .
Since a 2 w a 1 = 0 , we have
( a w ) 2 ( a w ) ( x w ) ( a w ) 2 = ( a w ) [ ( a 1 + a 2 ) w ( a 1 ) r w , # w a 1 + ( a 1 ) r w , # w a 2 w ( a 1 + a 2 ) w ] = ( a w ) [ a 1 w + a 2 w ( a 1 ) r w , # w a 1 w ( a 1 + a 2 ) w ( a 1 ) r w , # w a 2 w ( a 1 + a 2 ) w ] = ( a w ) [ a 1 w + a 2 w ( a 1 ) r w , # w ( a 1 w ) 2 ( a 1 ) r w , # w a 1 w a 2 w ( a 1 ) r w , # w ( a 2 w ) 2 ] = ( a w ) [ 1 ( a 1 ) r w , # w a 1 w ( a 1 ) r w , # w a 2 w ] ( a 2 w ) ,
and so
| | ( a w ) n + 1 ( a w ) ( x w ) ( a w ) n + 1 | | 1 n + 1 = | | [ ( a w ) 2 ( a w ) ( x w ) ( a w ) 2 ) ( a w ) n 1 | | 1 n + 1 = | | ( a w ) [ 1 ( a 1 ) r w , # w a 1 w ( a 1 ) r w , # w a 2 w ] ( a 2 w ) ( a 1 w + a 2 w ) n 1 | | 1 n | | a w | | 1 n + 1 | | 1 ( a 1 ) r w , # w a 1 w ( a 1 ) r w , # w a 2 w | | 1 n + 1 | | ( a 2 w ) n | | 1 n + 1 .
Since a 2 A w q n i l , we have lim n | | ( a 2 w ) n | | 1 n + 1 = lim n [ | | ( a 2 w ) n | | 1 n ] n n + 1 = 0 , and then
lim n | | ( a w ) n + 1 ( a w ) ( x w ) ( a w ) n + 1 | | 1 n + 1 = 0 .
Since ( a 2 w ) ( a 1 w ) = 0 , a 1 w A r # and a 2 w A # , it follows that a w A r d and ( a w ) r d = ( a 1 w ) r # + n = 1 ( ( a 1 w ) r # ) n + 1 ( a 2 w ) n . Then
( ( a w ) r d ) * ( a w ) m 1 a 2 = ( ( a w ) # ) * ( a w ) m 1 a 2 + n = 1 ( a 1 w ) r # ) n + 1 ( a 2 w ) n * ( a w ) m 1 a 2 = ( ( a 1 w ) r # ) 2 * w * ( a 1 ) * ( a w ) m 1 a 2 + n = 1 ( ( a 1 w ) r # ) n + 2 ( a 2 w ) n * w * ( a 1 ) * a 2 = 0 ;
hence, ( a w ) r d * ( a w ) m 1 a 1 = ( a w ) r d * ( a w ) m 1 a . Accordingly, we have
( a w ) r d * ( a w ) m + 1 x = ( a w ) r d * ( a w ) m ( a w ) ( a 1 ) r w , # = ( a w ) r d * ( a w ) m ( a 1 + a 2 ) w ( a 1 ) r w , # = ( a w ) r d * ( a w ) m + 1 ( a 1 ) r w , # = ( a w ) r d * ( a 1 w ) m + 1 ( a 1 ) r w , # = ( a w ) r d * ( a 1 w ) m 1 a 1 = ( a w ) r d * ( a w ) m 1 a 1 = ( a w ) r d * ( a w ) m 1 a ,
as required. □
Corollary 4.2.
Let a A r w , g . Then a w a r w , g = ( a w ) n 1 a ( w a r w , g ) n for any n N .
Proof. 
These are obvious by the proof of Theorem 4.1. □
Corollary 4.3.
Let a A r w , g m and b A w q n i l . If a * ( a w ) m 1 b = 0 and b w a = 0 , then a + b A r w , g m . In this case,
( a + b ) r w , g m = a r w , g m .
Proof. 
Since a A r w , g m , by virtue of Theorem 4.1, there exist x A r w , # and y A w q n i l such that a = x + y , x * ( a w ) m 1 y = 0 , y w x = 0 . As in the proof of Theorem 4.1, x = ( a w ) 2 a r w , g m and y = a ( a w ) 2 a r w , g m . Then a = x + ( y + b ) . Since b w y = b w [ a ( a w ) 2 a r g m ] = 0 , it follows by [1] that y + b A w q n i l . Obviously, x * ( a w ) m 1 ( y + b ) = x * ( a w ) m 1 y + [ ( a w ) 2 a r w , g m ] * ( a w ) m 1 b = 0 . In light of Theorem 4.1, a + b A r w , g m . In this case,
( a + b ) r w , g m = x r w , # = a r w , g ,
as required. □
Corollary 4.4.
Let M = a b 0 d with a , d A r w , g m . If a * ( a w ) m 1 b = 0 , b w d = 0 , then M M 2 ( A ) r w , g m .
Proof. 
Write M = P + Q , where P = a 0 0 d , Q = 0 b 0 0 . Then P M 2 ( A ) r w , g m and P r w , g m = a r w , g m 0 0 d r w , g m . Obviously, Q 2 = 0 . BY hypothesis, we verify that
Q ( w I 2 ) P = 0 , P * ( M w I 2 ) m 1 Q = 0 .
Therefore M M 2 ( A ) r w , g m by Corollary 4.3. □
We come now to present the polar-like property for the m-generalized right w-group inverse.
Theorem 4.5.
Let a A r w , g m . Then there exists an idempotent p A such that
a w + p A r 1 , p a w = p a w p A q n i l , ( ( a w ) m ) * ( a w ) m p * = ( a w ) m ) * ( a w ) m p .
Proof. 
By virtue of Theorem 4.1, there exist z , y A such that
a = z + y , z * ( a w ) m 1 y = y w z = 0 , z A r w , # , y A w q n i l .
Set x = z r w , # . The we check that
a w x = ( z + y ) w z r w , # = z w z r w , # , a ( w x ) 2 = ( a w x ) w x = z ( w z r w , # ) 2 = z r w , # = x .
Since y w z = 0 , we see that ( a w ) k z = ( a w ) k 1 ( y + z ) w z = ( a w ) k 1 ( z w ) z = ( a w ) k 2 ( y + z ) w z w z = ( a w ) k 2 ( z w ) 2 z = ( z w ) k z . Since z * ( a w ) m 1 y = 0 , we derive that
( ( a w ) m ) * ( z w ) m = w * a * ( ( a w ) m 1 ) * ( z w ) m = w * [ z * ( a w ) m 1 ( y + z ) ] * ( w z ) m 1 w = w * [ z * ( a w ) m 1 z ] * ( w z ) m 1 w = w * [ z * ( z w ) m 1 z ] * ( w z ) m 1 w = [ z * ( z w ) m 1 z w ] * ( w z ) m 1 w = [ ( z w ) m ] * z ( w z ) m 1 w = [ ( z w ) m ] * ( z w ) m .
Hence, we have
( ( a w ) m ) * ( a w ) m + 1 x w = ( ( a w ) m ) * ( a w ) m ( a w x w ) = ( ( a w ) m ) * ( a w ) m ( z w z r w , # w ) = ( ( a w ) m ) * ( ( a w ) m z w ) z r w , # w = ( ( a w ) m ) * ( ( z w ) m z w ) z r w , # w = [ ( a w ) m ) * ( z w ) m ] z w z r w , # w = [ ( z w ) m ] * ( z w ) m + 1 z r w , # w = [ ( z w ) m ] * ( z w ) m 1 [ ( z w ) 2 z r w , # ] w = [ ( z w ) m ] * ( z w ) m 1 z w = ( ( z w ) m ) * ( z w ) m .
Therefore
[ ( ( a w ) m ) * ( a w ) m + 1 x w ] * = [ ( ( z w ) m ) * ( z w ) m ] * = ( ( z w ) m ) * ( z w ) m = ( ( a w ) m ) * ( a w ) m + 1 x w .
Let p = 1 z w z r w , # w . Then p = 1 a w x w = p 2 A . Since a w a w z w z # w = a w ( 1 z w z r w , # w ) = ( z + y ) w ( 1 z w z r w , # w ) = y w A q n i l , we have a w p = a w ( 1 z w z r w , # w ) A q n i l . Accordingly, we have
[ ( ( a w ) m ) * ( a w ) m p ] * = ( ( ( a w ) m ) * ( a w ) m [ ( ( a w ) m ) * ( a w ) m + 1 x w ] * = ( ( a w ) m ) * ( a w ) m ( ( a w ) m ) * ( a w ) m + 1 x w = ( a w ) m ) * ( a w ) m p .
Since p a w ( 1 p ) = ( 1 z w z r w , # w ) ( z + y ) w z w z r w , # w = ( 1 z w z r w , # w ) ( z w ) 2 z r w , # w = 0 , we see that p a w = p a w p . Obviously, we have
[ z w + 1 z w z r w , # w ] [ z r w , # w + 1 z w z r w , # w ] = z w z r w , # w + z w ( 1 z w z r w , # w ) + ( 1 z w z r w , # w ) z r w , # w + 1 z w z r w , # w = 1 .
Since y w ( z r w , # w + 1 z w z r w , # w ) = y w A q n i l , it follows by Cline’s formula that ( z r w , # w + 1 z w z r w , # w ) y w A q n i l . Hence 1 + ( z # w + 1 z w z # w ) y w A 1 . This implies that
a w + p = z w + y w + 1 z w z r w , # w = ( z w + 1 z w z r w , # w ) [ 1 + ( z w + 1 z w z r w , # w ) 1 y w ] A r 1 ,
as desired. □
Corollary 4.6.
Let a A r w , g . Then there exists an idempotent p A such that
a w + p A r 1 , p a w = p a w p A q n i l , ( a w ) * ( a w ) p * = ( a w ) * ( a w ) p .
Proof. 
This is obvious by choosing m = 1 in Theorem 4.5. □

5. m-Weak Right w-Group Inverse

We now proceed to examine the interrelation between the m-weak right w-group inverse and the m-generalized right w-group inverse.
Theorem 5.1.
Let a , w A . Then a A r w , w m if and only if a w A r D and a A r w , g m . In this case, a r w , w m = a r w , g m .
Proof. 
One direction is obvious. Conversely, assume that a w A r D and a A r w , g m . Let x = a r w , g m . Then there exists x A such that
x = a ( w x ) 2 , [ ( a w ) r d ] * ( a w ) m + 1 x = [ ( a w ) r d ] * a m 1 a , lim n | | ( a w ) n a w x w ( a w ) n | | 1 n = 0 .
Since a A D , w , we can find some y A such that
y w ( a w ) k + 1 = ( a w ) k , y w a w y = y , a w y = y w a
for some k N . Set z = ( a w ) k y ( w x ) k . Then we verify that
a w z = ( ( a w ) k + 1 y w ( x w ) k 1 x = [ ( y w ) ( a w ) k + 1 ] ( x w ) k 1 x = ( a w ) k ( x w ) k 1 x w = ( a w ) k ( x w ) k 1 x = ( a w ) 2 x w x .
Claim 1. z = a ( w z ) 2 .
a ( w z ) 2 = ( a w z ) w z = [ ( a w ) 2 x w x ] w ( a w ) k y ( w x ) k = [ ( a w ) 2 ( x w ) 2 ] ( a w ) k y ( w x ) k = [ ( a w ) ( x w ) ( a w ) k ] y ( w x ) k = [ ( a w ) ( a w ) k 1 ] y ( w x ) k = ( a w ) k y ( w x ) k = z .
Claim 2. [ ( a w ) r d ] * ( a w ) m + 1 z = [ ( a w ) r d ] * ( a w ) m 1 a .
[ ( a w ) r d ] * ( a w ) m + 1 z = [ ( a w ) r d ] * [ ( a w ) k + m + 1 y ] ( w x ) k = [ ( a w ) r d ] * [ y ( w a ) k + m + 1 ] ( w x ) k = [ ( a w ) r d ] * [ ( y w ) a ( w a ) k + m + 1 w ] x ( w x ) k 1 = [ ( a w ) r d ] * [ ( y w ) ( a w ) k + m + 1 ] a w x ( w x ) k 1 = [ ( a w ) r d ] * ( a w ) k + m + 1 x ( w x ) k 1 = [ ( a w ) r d ] * a ( w a ) k + m 1 ( w x ) k = [ ( a w ) r d ] * a ( w a ) m ( w x ) = [ ( a w ) r d ] * ( a w ) m + 1 x = [ ( a w ) r d ] * ( a w ) m 1 a .
Claim 3. ( a w ) k = ( z w ) ( a w ) k + 1 .
Since ( a w ) ( y w ) = ( y w ) ( a w ) , we see that
( a w ) k ( z w ) ( a w ) k + 1 = ( a w ) k ( a w ) k y w ( x w ) k ( a w ) k + 1 = ( a w ) k ( y w ) ( a w ) k ( x w ) k ( a w ) k + 1 = ( a w ) k ( y w ) ( a w ) ( x w ) ( a w ) k + 1 = ( a w ) k ( y w ) [ ( a w ) k + 1 ( x w ) k + 1 ] ( a w ) k + 1 = ( a w ) k [ ( y w ) ( a w ) k + 1 ] ( x w ) k + 1 ( a w ) k + 1 = ( a w ) k ( a w ) k ( x w ) k + 1 ( a w ) k + 1 = ( a w ) k ( a w ) ( x w ) 2 ( a w ) k + 1 = ( a w ) k [ a ( w x ) 2 ] w ( a w ) k + 1 = ( a w ) k x w ( a w ) k + 1 = ( a w ) k + n ( y w ) n x w ( a w ) k + n + 1 ( y w ) n .
Then
| | ( a w ) k ( z w ) ( a w ) k + 1 | | | | ( a w ) k + n x w ( a w ) k + n + 1 | | | | y w | | n .
Since lim n | | ( a w ) k + n x w ( a w ) k + n + 1 | | 1 n = 0 , we see that
lim n | | ( a w ) k ( z w ) ( a w ) k + 1 | | 1 n = 0 .
Hence, ( a w ) k = ( z w ) ( a w ) k + 1 . Therefore a A w w m . □
Corollary 5.2.
Let a , w A . Then a A r w m if and only if a w A r D R r g m . In this case, a r w m = a r g m .
Proof. 
This is obvious by Theorem 5.1. □
The following example illustrates that m-weak right w-group inverse is different from the ( m , w ) -weak group inverse.
Example 5.3.
Let V be a countably generated infinite-dimensional vector space over the complex field C, and let { x 1 , x 2 , x 3 , } be a basis of V. Let σ : V V be a shift operator given by σ ( x 1 ) = 0 and σ ( x i + 1 ) = x i for all i N . Then σ has ( m , 1 ) -generalized group inverse, while it has no any ( m , 1 ) -weak group inverse for any m N .
Proof. 
Define the matrix A given by
σ ( x 1 , x 2 , x 3 , ) = ( 0 , x 1 , x 2 , x 3 , ) = ( x 1 , x 2 , x 3 , ) A .
The linear shift operator σ can be regarded as an element in a Banach *-algebra of complex matrix, with conjugate transpose * as the involution. Then σ is quasinilpotent as all its eigenvalues are zero. Hence, it has ( m , 1 ) -generalized group inverse and σ 1 g m = 0 . For any k N , σ k ( x 1 , x 2 , x 3 , ) = ( 0 , 0 , , 0 , x 1 , x 2 , ) ; whence, σ is not nilpotent. If σ has ( m , 1 ) -weak group inverse; it has Drazin inverse by [5]. Then there exists some n N such that σ n = σ n + 1 η and σ η = η σ for a linear operator η . Hence σ n ( 1 σ η ) = 0 . As σ is quasinilpotent and σ η = η σ , we have 1 σ η is invertible, and the σ n = 0 . This gives a contradiction. Therefore σ has no ( m , 1 ) -weak group inverse, as asserted. □
Theorem 5.4.
Let a A . Then the following are equivalent:
(1)
a r w , w m .
(2)
a w A r D and ( a w ) m 1 a A r w , W .
(3)
There exist x , y A such that
a = x + y , x * ( a w ) m 1 y = y w x = 0 , x A r w , # , y A w n i l .
Proof. ( 1 ) ( 2 ) This is proved by Theorem 3.2 and Theorem 5.1.
( 1 ) ( 3 ) In view of Theorem 4.1, we have x , y A such that
a = x + y , x * ( a w ) m 1 y = y w x = 0 , x A r w , # , y A w n i l .
. Here, y = a ( a w ) 2 a r w , w m . Clearly, ( a w ) n = ( a w ) ( a r w , w m w ) ( a w ) n for some n N . Since a r w , w m w = ( a w ) n ( a r w , w m w ) n , we verify that
[ a w ( a w ) ( a r w , w m ) w ( a w ) ] ( a w ) ( a r w , w m w ) ( a w ) = [ a w ( a w ) ( a r w , w m ) w ( a w ) ] ( a w ) n ( a r w , w m w ) n ( a w ) = 0 ;
hence,
[ a w ( a w ) ( a r w , w m w ) ( a w ) ] n = [ a w ( a w ) ( a r w , w m w ) ] ( a w ) n = 0 .
Therefore y w = a w [ 1 ( a w ) ( a r w , w m w ) ] A n i l , as desired
( 3 ) ( 1 ) By hypothesis, there exist x , y A such that
a = x + y , x * ( a w ) m 1 y = y w x = 0 , x A r w , # , y A w n i l .
By virtue of Theorem 4.1, a A r w , g m . Moreover, a w = x w + y w with x w A r D and y w A n i l . Since ( y w ) ( x w ) = 0 , we have a w A r D . Therefore a r w , w m by Theorem 5.1. □
Lemma 5.5.
Let a A . Then a A r w , W m if and only if
(1)
a w A r D ;
(2)
There exists x A such that
x = a ( w x ) 2 , [ ( a w ) n ] * ( a w ) m + 1 x = [ ( a w ) n ] * ( a w ) m 1 a , ( a w ) n = ( a w ) ( x w ) ( a w ) n
for some n N .
Proof. 
⟹ Set x = a r w , W m . Then x = a ( w x ) 2 , [ ( a w ) ( a w ) r D ] * ( a w ) m + 1 x = [ ( a w ) ( a w ) r D ] * ( a w ) m 1 a , ( a w ) k = ( a w ) ( x w ) ( a w ) k for some k N . Assume that ( a w ) ( a w ) r D ( a w ) l = ( a w ) l . Let n = max { k , l } . Then [ ( a w ) n ] * ( a w ) m + 1 x = [ ( a w ) n ] * ( a w ) m 1 a , as required.
⟸ By hypothesis, there exists x A such that
x = a ( w x ) 2 , [ ( a w ) n ] * ( a w ) m + 1 x = [ ( a w ) n ] ( a w ) m 1 a , ( a w ) n = ( a w ) ( x w ) ( a w ) n
for some n N . Since a w A r D , we have ( a w ) n [ ( a w ) r D ] n = ( a w ) ( a w ) r D . Hence [ ( a w ) ( a w ) r D ] * ( a w ) m + 1 x = [ ( a w ) ( a w ) r D ] * ( a w ) m 1 a . Therefore a A r w , W m , as asserted. □
Theorem 5.6.
Let a A and w A 1 . Then a A r w , W m if and only if
(1)
a w A r D ;
(2)
There exists x A such that x = a ( w x ) 2 , [ ( ( a w ) m ) * ( a w ) m + 1 x w ] * = ( ( a w ) m ) * ( a w ) m + 1 x w , ( a w ) n = ( a w ) ( x w ) ( a w ) n for some n N .
Proof. 
⟹ Set x = a r w , W m . By virtue of Lemma 5.5, there exists x A such that
x = a ( w x ) 2 , [ ( a w ) n ] * ( a w ) m + 1 x = [ ( a w ) n ] ( a w ) m 1 a , ( a w ) n = ( a w ) ( x w ) ( a w ) n
for some n N . Therefore we have
[ ( a w ) m ] * ( a w ) m + 1 x w = [ ( a w ) m ] * ( a w ) m + 1 [ ( a w ) n ( x w ) n + 1 ] = [ ( a w ) m ] * [ ( a w ) m + n ( x w ) n + 1 ] = [ ( a w ) m + n ( x w ) n + 1 ] * ( a w ) m * = [ ( a w ) m ( x w ) n + 1 ] * [ ( a w ) n ] * ( a w ) m 1 a w * = [ ( a w ) m ( x w ) n + 1 ] * [ ( a w ) n ] * ( a w ) m + 1 x w * = [ ( a w ) m + n ( x w ) n + 1 ] * ( a w ) m + 1 x w * = [ ( a w ) m + 1 x w ] * ( a w ) m + 1 x w * = [ ( a w ) m + 1 x w ] * ( a w ) m + 1 x w .
Therefore [ ( ( a w ) m ) * ( a w ) m + 1 x w ] * = ( ( a w ) m ) * ( a w ) m + 1 x w , as desired.
⟸ By hypothesis, there exists some z A such that such that x = a ( w x ) 2 , [ ( ( a w ) m ) * ( a w ) m + 1 x w ] * = ( ( a w ) m ) * ( a w ) m + 1 x w , ( a w ) n = ( a w ) ( x w ) ( a w ) n for some n N . Then we verify that
[ ( a w ) n ] * ( a w ) m + 1 x = [ ( a w ) ( x w ) ( a w ) n ] * ( a w ) m + 1 x = [ ( a w ) m ( x w ) m ( a w ) n ] * ( a w ) m + 1 x = [ ( x w ) m ( a w ) n ] * [ ( a w ) m ] * ( a w ) m + 1 x w w 1 = [ ( x w ) m ( a w ) n ] * [ ( a w ) m ] * ( a w ) m + 1 x w * w 1 = [ ( a w ) m ] * ( a w ) m + 1 x w ( x w ) m ( a w ) n * w 1 = ( a w ) m + 1 ( x w ) m + 1 ( a w ) n * ( a w ) m w 1 = ( a w ) ( x w ) ( a w ) n * ( a w ) m w 1 = [ ( a w ) n ] ( a w ) m 1 a .
By virtue of Lemma 5.5, a A r w , W m . □
Corollary 5.7.
Let a A . Then a A r W m if and only if
(1)
a A r D ;
(2)
There exists x A such that
x = a x 2 , [ ( a m ) * a m + 1 x ] * = ( a m ) * a m + 1 x , a n = a x a n
for some n N .
Proof. 
This is completed by choosing w = 1 in Theorem 5.6. □
Remark 5.8.
The m-generalized left weighted group inverse can be defined by a similar way. The ( m , w ) -group inverse can be characterized by combining m-generalized left and right weighted group inverses.

References

  1. N. Castro-Gonzalez and J.J. Koliha, New additive results for the g-Drazin inverse, Proc. R. Soc. Edinb.Secr. A, 134(2004), 1085–1097.
  2. H. Chen, On m-generalized group inverse in Banach *-algebras, Mediterr. J. Math. 2025. [CrossRef]
  3. H. Chen and M. Sheibani, Weighted generalized group inverse in Banach *-algebras, Filomat, 39(2025), 483–500.
  4. H. Chen and M. m, arXiv:submit/6599114 [math.RA] 6 Jul 2025.
  5. H. Chen and M. Sheibani, On (m,w)-generalized group inverse in Banach *-algebras, preprint, 2025.
  6. Y. Chen; L. Yuan and X. Zhang, New and representations of the weak group inverse, Filomat, 38(2024), 6703–6713.
  7. D.E. Ferreyra; V. Orquera and N. Thome, A weak group inverse for rectangular matrices, Rev. R. Acad. Cienc. Exactas Fis.Nat., Ser. A Mat., 113(2019), 3727–3740.
  8. D.E. Ferreyra; V. Orquera and N. Thome, Representations of weighted WG inverse and a rank equation’s solution, Linear Multilinear Algebra, 71(2023), 226–241.
  9. J. Gao; K. Zu and Q. m, arXiv:2312.10704v1 [math.R.A] 17 Dec 2023.
  10. W. Jiang and K. Zuo, Further characterizations of the m-weak group inverse of a complex matrix, AIMS Math., 7(2020), 17369–17392.
  11. Y. Liao; J. Chen and J. Cui, Cline’s formula for the generalized Drazin inverse, Bull. Malays. Math. Sci. Soc., 37(2014), 37–42.
  12. D. Mosić, Weighted generalized Drazin inverse in rings, Georgian Math. J., 23(2016), 587–594.
  13. D. Mosić; P.S. Staninirović, Representations for the weak group inverse, Appl. Math. Comput., 397(2021), Article ID 125957, 19 p.
  14. D. Mosić; P.S. Staninirović and L.A. Kazakovtsev, Application of m-weak group inverse in solving optimization problems, Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat., 118(2024), No. 1, Paper No. 13, 21 p.
  15. D. Mosić; P.S. Stanimirović and L.A. Kazakovtsev, Minimization problem solvable by weighted m-weak group inverse, J. Applied Math. Computing, 70(2024), 6259–6281.
  16. D. Mosić and D. Zhang, Weighted weak group inverse for Hilbert space operators, Front. Math. China, 15(2020), 709–726.
  17. D. Mosić and D. Zhang, New representations and properties of the m-weak group inverse, Result. Math., 78(2023). [CrossRef]
  18. Y. Ren and L. Jiang, Left and right-Drazin inverses in rings and operator algebras, J. Algebra Appl., 23(2024), No. 4, Article ID 2450064, 16 p.
  19. H. Wang, Core-EP decomposition and its applications, Linear Algebra Appl., 508 (2016), 289–300.
  20. H. Wang and J. Chen, Weak group inverse, Open Math., 16(2018), 1218–1232.
  21. K. arXiv:2312.107042402.13574v1 [math.RA] 21 Feb 2024.
  22. M. Zhou; J. Chen and Y. Zhou, Weak group inverses in proper *-rings, J. Algebra Appl., 19(2020), Article ID 2050238, 14 p.
  23. M. Zhou; J. Chen; Y. Zhou and N. Thome, Weak group inverses and partial isometries in proper *-rings, Linear Multilinear Algebra, 70(2021), 1–16.
  24. M. Zhou; J. Chen and N. Thome, New characterizations of weak group matrices, Filomat, 37(2023), 457–466.
  25. Y. Zhou; J. Chen and M. Zhou, m-Weak group inverses in a ring with involution, Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat., 115(2021), Paper No. 2, 12 p.
  26. H. Zou; D. Mosić and J. Chen, Generalized Drazin invertibility of the product and sum of two elements in a Banach algebra and its applications, Turk. J. Math., 41(2017), 548–563.
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