Preprint
Article

This version is not peer-reviewed.

On (m, w)-Generalized Group Inverse in a Banach Algebra

Submitted:

09 July 2025

Posted:

11 July 2025

You are already at the latest version

Abstract
By combining the sum of a weighted group inverse and a quasinilpotent element, we introduce an extension of the m-weak and generalized group inverses in a Banach *-algebra. We develop various properties and representations of this weighted generalized inverse. Furthermore, we apply this new generalized inverse to complex matrices and solve a minimization problem.
Keywords: 
;  ;  ;  ;  ;  ;  

1. Introduction

An involution of a Banach algebra A is an anti-automorphism whose square is the identity map 1. A Banach algebra A with involution * is called a Banach *-algebra. The involution * is proper if x * x = 0 x = 0 for any x A , e.g., in a Rickart *-algebra, 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. Throughout the paper, all Banach algebras are complex with a proper involution *.
An element a A has group inverse provided that there exists x A 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. Evidently, a square complex matrix A has group inverse if and only if r a n k ( A ) = r a n k ( A 2 ) .
Following Wang and Chen (see [28]), 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 .
If such x exists, it is unique, and denote it by a W . In 2014, Prasad and Mohana extended core inverse and introduced core-EP inverse for a complex matrix (see [26]). A matrix A C n × n has core-EP inverse X if and only if
X A X = X , R ( X ) = R ( X * ) = R ( A k ) ,
where k = i n d ( A ) is the Drazin index of A and R ( X ) is the range space of X. Such X is unique, and we denote it by A . Evidently, a square complex matrix A has weak group inverse X if it satisfies the equations
A X 2 = X , A X = A A .
(see [28]).
Following Chen and Sheibani, an element a A has generalized group inverse if there exists x A such that
x = a x 2 , ( a * a 2 x ) * = a * a 2 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 (see [5]). Following Chen and Sheibani, an element a A has generalized group inverse if there exists x A such that
x = a x 2 , ( a * a 2 x ) * = a * a 2 x , lim n | | a n x a n + 1 | | 1 n = 0 .
Such x is unique if exists, denoted by a g (see [5]). Many properties of weak group inverse are extended to the wider case such as linear operator on an infinitely dimensional Hilbert space.
In [33], Zhou et al. introduced and studied the m-weak group inverse. Recently, m-weak group inverse was extensively studied by many authors (see [13,15,16,22,23,25]). Recently, the authors extended m-weak group inverse and introduced m-generalized group inverse (see [2]).
On the other hand, many authors studied various weighted generalized inverses. Let a , w A . An element a A has generalized w-Drazin inverse x if there exists unique x A such that
a w x = x w a , x w a w x = x a n d a w x w ( a w ) 2 A q n i l .
We denote x by a d , w (see [19]). If we replace A q n i l by the set A n i l of all nilpotents in A , a d , w is called the w-Drazin inverse of a, and denote it by a D , w . Evidently, a D , w = x if and only if
a w x = x w a , x w a w x = x a n d ( a w ) n = x w ( a w ) n + 1
for some n N . If the weight w = 1 , we call a d , w ( a D , w ) the g-Drazin (Drazin) inverse of a, and denote it by a d ( a D ) .
 Definition 1. 
(see [12]) An element a A has w-group inverse if there exist x A such that
a w x = x w a , x w a w x = x , a = a w x w a .
The preceding x is unique if it exists, and we denote it by a w # . The set of all w-group invertible elements in A is denoted by A w # .
Evidently, a A w # if and only if a w , w a A # . In [3], the author introduced and studied generalized w-group inverse in Banach algebras. Many properties of weak group inverse was thereby extended to the generalized inverse with weights.
 Definition 2. 
(see [3]) An element a A has generalized w-group inverse if a A d , w and there exist x A such that
x = a ( w x ) 2 , ( a w ) d * ( a w ) 2 x = ( a w ) d * a , lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 .
The preceding x is unique if it exists, and we denote it by a w g . The set of all generalized w-group invertible elements in A is denoted by A w g .
The objective of this paper is to introduce the ( m , w ) -generalized group inverse, defined as the sum of a weighted group inverse and weighted quasi-nilpotent elements. Consequently, many properties of weighted and m-generalized group inverses are extended to a broader context.
 Definition 3. 
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 .
In Section 2, we establish the fundamental properties of this new generalized inverse, which in turn reveal several new characteristics of the generalized inverses mentioned above. We prove that a A w g m if and only if ( a w ) m 1 a A w g . The representations of the ( m , w ) -generalized group inverse are presented.
 Definition 4. 
An element a A has ( m , w ) -generalized group decomposition if there exist x , y A such that
a = x + y , x * a m 1 y = y x = 0 , x A w # , y A w q n i l .
In Section 3, we prove that a A has ( m , w ) -generalized group inverse if and only if a has ( m , w ) -generalized group decomposition.
As is well known, a R has generalized Drazin inverse if and only if it has quasi-polar property (see [6]). The polar-like property for ( m , w ) -generalized group inverse is established. Let a A w g m . We prove that there exists an idempotent p A such that
a w + p A 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 .
We introduce the weighted weak group inverse as an extension of the m-weak group inverse for a complex matrix.
 Definition 5. 
An element a A has ( m , w ) -weak 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 = x w ( a w ) n + 1 .
If x exists, it is unique, and we denote it by a w w m .
Finally, in Section 4, we apply our results to complex matrices and characterize the ( m , w ) -weak group inverse. We present the formula of weighted weak group inverse by using the related Moore-Penrose inverse, i.e.,
A W w m = ( A W ) ( A W ) D [ ( A W ) 2 m + 1 ( A W ) D ] ( A W ) m 1 A .
Applying the weighted weak group inverse, we prove solvability of the following minimization problem with respect to X C n × n in the Frobenius norm:
min | | ( A W ) 2 m X ( A W ) m 1 A B ] | | F
subject to R ( X ) R ( A W ) D is X = A W w m B .

2. ( m , w ) -Generalized Group Inverse

In this section, we explore the fundamental properties of the ( m , w ) -generalized group inverse of elements in a Banach *-algebra. We start with
 Theorem 1. 
Let a A . Then a A w g m if and only if ( a w ) m 1 a A w g . In this case,
a w g m = ( a w ) m 1 ( ( a w ) m 1 a ) w g .
Proof. 
⟹ Since a A w g m , then 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 .
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 ) d * ( ( a w ) m 1 a w ) 2 y = ( ( a w ) m ) d * ( a w ) 2 m ( x w ) m 1 x = ( ( a w ) m ) d * ( a w ) 2 m ( x w ) m 1 x = ( ( a w ) m ) d * ( a w ) 2 m 1 [ a ( w x ) 2 ] w ( x w ) m 3 x = ( ( a w ) m ) d * ( a w ) 2 m 1 ( x w ) m 2 x = = ( ( a w ) m ) d * ( a w ) 2 m ( m 1 ) ( x w ) m m x = ( ( a w ) m ) d * [ ( a w ) d ] * ( a w ) m + 1 x = ( ( a w ) m 1 ) d * [ ( a w ) d ] * ( a w ) m 1 a = ( ( a w ) m ) d * ( a w ) m 1 a ,
Moreover, we have
( ( a w ) m 1 a w ) n y w ( ( a w ) m 1 a w ) n + 1 = ( ( a w ) m 1 a w ) n ( x w ) m 1 x w ( ( a w ) m 1 a w ) n + 1 = ( ( a w ) m ) n ( x w ) m ( ( a w ) m ) n + 1 = ( ( a w ) m ) n ( x w ) m 1 ( ( a w ) m 1 ) n + 1 ( ( a w ) n ) + ( x w ) m 1 ( ( a w ) n ( x w ) ( a w ) n + 1 ) ( ( a w ) m 1 ) n + 1 = ( ( a w ) m ) n ( x w ) m 2 ( ( x w ) ( a w ) n + 1 ) ( ( a w ) m 2 ) n + 1 ( ( a w ) n ) + ( x w ) m 1 ( ( a w ) n ( x w ) ( a w ) n + 1 ) ( ( a w ) m 1 ) n + 1 = ( ( a w ) m ) n ( x w ) m 2 ( ( a w ) m 2 ) n + 1 ( ( a w ) n ) 2 + ( x w ) m 2 ( ( a w ) n ( x w ) ( a w ) n + 1 ) ( ( a w ) m 2 ) n + 1 ( ( a w ) n ) + ( x w ) m 1 ( ( a w ) n ( x w ) ( a w ) n + 1 ) ( ( a w ) m 1 ) n + 1 = ( ( a w ) m ) n ( x w ) m 3 ( ( a w ) m 3 ) n + 1 ( ( a w ) n ) 3 + ( x w ) m 3 ( ( a w ) n ( x w ) ( a w ) n + 1 ) ( ( a w ) m 3 ) n + 1 ( ( a w ) n ) 2 + ( x w ) m 2 ( ( a w ) n ( x w ) ( a w ) n + 1 ) ( ( a w ) m 2 ) n + 1 ( ( a w ) n ) + ( x w ) m 1 ( ( a w ) n ( x w ) ( a w ) n + 1 ) ( ( a w ) m 1 ) n + 1 = x ( ( a w ) n ( x w ) ( a w ) n + 1 ) ( a w ) n + 1 ( ( a w ) n ) m 1 + + ( x w ) m 3 ( ( a w ) n ( x w ) ( a w ) n + 1 ) ( ( a w ) m 3 ) n + 1 ( ( a w ) n ) 2 + ( x w ) m 2 ( ( a w ) n ( x w ) ( a w ) n + 1 ) ( ( a w ) m 2 ) n + 1 ( ( a w ) n ) + ( x w ) m 1 ( ( a w ) n x w ( a w ) n + 1 ) ( ( a w ) m 1 ) n + 1 .
Hence, we have
| | ( ( a w ) m ) n y w ( ( a w ) m ) n + 1 | | 1 n i = 1 m 1 | | ( x w ) i | | 1 n | | ( a w ) n x w ( a w ) n + 1 | | 1 n | | ( ( ( a w ) i ) n + 1 ) n + 1 ( ( a w ) n ) m i 1 | | 1 n .
Therefore
lim n | | ( ( a w ) m 1 a ) n y w ( ( a w ) m 1 a ) n + 1 | | 1 n = 0 .
By virtue of [3, Theorem 2.2], ( a w ) m 1 a A w g . Then ( ( a w ) m 1 a ) w g = y = ( x w ) m 1 x , as required.
⟸ Let y = ( ( a w ) m 1 a ) w g . Then ( a w ) m 1 a A d , w , and so ( a w ) m A d . In view of [6], a A d , w . Moreover, we derive
[ ( a w ) m 1 a ] ( w y ) 2 = y , ( ( ( a w ) m 1 a w ) d ) * ( ( a w ) m 1 a w ) 2 y = ( ( ( a w ) m 1 a w ) d ) * ( ( a w ) m 1 a w ) , lim n | | ( ( ( a w ) m 1 a w ) n y w ( ( ( a w ) m 1 a w ) n + 1 | | 1 n = 0 .
Hence,
[ ( a w ) m 1 a ] ( w y ) 2 = y , ( ( ( a w ) m ) d ) * ( a w ) 2 m y = ( ( ( a w ) m ) d ) * ( a w ) m , lim n | | ( a w ) m n y w ( a w ) m ( n + 1 ) | | 1 n = 0 .
Take x = ( a w ) m 1 y . In view of [3], we can find z A such that y = ( a w ) ( a w ) d z . 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 ) d z ] = ( a w ) m [ y w ( a w ) m ] ( a w ) d z = ( a w ) m [ ( y w ) ( ( a w ) m 1 a w ) ] ( a w ) d z = ( a w ) m ( a w ) d z = ( a w ) m 1 y = x , ( a w ) d * ( a w ) m + 1 x = ( a w ) d * ( a w ) m + 1 ( a w ) m 1 y = ( a w ) d * ( a w ) 2 m [ ( ( a w ) m 1 a ) w g ] = ( a w ) m ( a w ) d * ( ( a w ) m ) d * ( ( a w ) m 1 a w ) 2 [ ( ( a w ) m 1 a ) w g ] = ( a w ) m ( a w ) d * ( ( a w ) m ) d * ( a w ) m 1 a = ( a w ) d * ( a w ) m 1 a .
Obviously, we have
( a w ) m ( n + 1 ) 1 x w ( a w ) m ( n + 1 ) = ( a w ) m n + ( m 1 ) x w ( a w ) m ( n + 1 ) = ( a w ) m 1 ( a w ) m n ( ( a w ) m 1 y w ) ( a w ) m ( n + 1 ) = ( a w ) m 1 [ ( ( a w ) m ) n y w ( ( a w ) m ) n + 1 ] .
Hence,
| | ( a w ) m ( n + 1 ) 1 x w ( a w ) m ( n + 1 ) | | 1 m ( n + 1 ) 1 | | ( a w ) m 1 | | 1 m ( n + 1 ) 1 | | ( ( a w ) m ) n y w ( ( a w ) m ) n + 1 | | 1 m ( n + 1 ) 1 = | | ( a w ) m 1 | | 1 m ( n + 1 ) 1 | | ( ( a w ) m ) n y w ( ( a w ) m ) n + 1 | | 1 n n m n + m 1 | | a w | | m 1 m n + m 1 | | ( ( a w ) m ) n y w ( ( a w ) m ) n + 1 | | 1 n 1 m + m 1 n = | | a w | | m 1 m n + m 1 | | ( ( a w ) m 1 a w ) n y w ( ( a w ) m 1 a w ) n + 1 | | 1 n 1 m + m 1 n .
Thus, we derive
lim n | | ( a w ) m ( n + 1 ) 1 x w ( a w ) m ( n + 1 ) | | 1 m ( n + 1 ) 1 = 0 .
Therefore a w g m = x = a m 1 y = ( a w ) m 1 ( ( a w ) m 1 a ) w g , as asserted. □
Corollary 1. 
Let a A w g m . Then ( ( a w ) m 1 a ) w g = ( a w g m w ) m 1 a w g m .
Proof. 
This is obvious by the proof of Theorem 2.1. □
Set i m ( x ) = { x r r A } . We are ready to prove:
 Theorem 2. 
Let a , w A . Then the following are equivalent:
(1)
a w g m = x .
(2)
a w x = ( a w ) m [ ( a w ) m 1 a ] w g , a ( w x ) 2 = x .
(3)
a w x = ( a w ) m [ ( a w ) m 1 a ] w g , i m ( x ) i m ( a w ) d .
Proof. ( 1 ) ( 2 ) Obviously, we have x = a ( w x ) 2 . By virtue of Theorem 2.1, x = ( a w ) m 1 [ ( a w ) m 1 a ] w g , and then a w x = ( a w ) m [ ( a w ) m 1 a ] w g , as required.
( 2 ) ( 3 ) By hypothesis, we check that
x = a ( w x ) 2 = ( a w ) x ( w x ) = ( a w ) x ( w x ) = ( a w ) 2 x ( w x ) 2 = = ( a w ) n x ( w x ) n = [ ( a w ) n ( a w ) d ( a w ) n + 1 ] x ( w x ) n + ( a w ) d ( a w ) n + 1 x ( w x ) n = [ ( a w ) n ( a w ) d ( a w ) n + 1 ] x ( w x ) n + ( a w ) ( a w ) d ( a w ) n x ( w x ) n .
Hence,
| | x ( a w ) ( a w ) d x | | 1 n | | ( a w ) n ( a w ) d ( a w ) n + 1 | | 1 n | | x | | 1 n | | w x | | .
Since lim n | | ( a w ) n ( a w ) d ( a w ) n + 1 | | 1 n = 0 , we have lim n | | x ( a w ) ( a w ) d x | | 1 n = 0 . Therefore x = ( a w ) ( a w ) d x ; hence, i m ( x ) i m ( a w ) d .
( 3 ) ( 1 ) Since i m ( x ) i m ( a w ) d , we see that x = a w ( a w ) d x . Hence,
x = a ( w x ) 2 = ( a w x ) w x = ( a w ) m ( ( a w ) m 1 a ) w g w x = ( a w ) m 1 a ) w g w ( a w ) d [ a w x ] = ( a w ) m ( ( a w ) m 1 a ) w g w ( a w ) d ( a w ) m [ ( a w ) m 1 a ] w g = ( a w ) m ( ( a w ) m 1 a ) w g w ( ( a w ) m 1 a w ) ( a w ) d ( ( a w ) m 1 a ) w g = ( a w ) m ( a w ) d ( ( a w ) m 1 a ) w g = ( a w ) m 1 ( ( a w ) m 1 a ) w g .
Therefore we complete the proof by Theorem 2.1. □
Corollary 2. 
Let a A w g m . Then a w g m w a w a w g m = a w g m .
Proof. 
By virtue of Theorem 2.3, we verify that
a w g m w a w a w g m = a w g m w [ a w a w g m ] = a w g m w ( a w ) m [ ( a w ) m 1 a ] w g = ( a w ) m 1 [ ( a w ) m 1 a ] w g = a w g m ,
as asserted. □
We are ready to prove:
 Theorem 3. 
Let a A . Then a A w g m if and only if
(1)
a A d , w ;
(2)
There exists x A such that
( a d , w ) * a d , w x = ( a d , w ) * ( a w ) m 1 a .
In this case, a w g m = ( ( a w ) d ) m + 3 a x .
Proof. 
⟹ Obviously, a A d , w . By virtue of Theorem 2.1, ( a w ) m 1 a A w g . Set z = ( a w ) m 1 a w g . In light of [3],
( ( a w ) m ) d * ( ( a w ) m ) 2 z = ( ( a w ) m ) d * ( a w ) m 1 a .
Write z = ( ( a w ) d ) 2 m ( a w ) 2 y for some y A . Then
a d , w * ( ( a w ) m ) 2 ( ( a w ) d ) 2 m ( a w ) 2 y = a d , w * ( a w ) m 1 a .
Hence,
a d , w * [ ( a w ) 2 a ] [ w ( ( a w ) d ) 2 a ] w y = a d , w * ( a w ) m 1 a .
Then
a d , w * a d , w [ w ( ( a w ) d ) 2 a ] w y = a d , w * ( a w ) m 1 a .
Set x = [ w ( ( a w ) d ) 2 a ] w y . Then ( a d , w ) * a d , w x = ( a d , w ) * ( a w ) m 1 a , as required.
⟸ By hypothesis,
( a d , w ) * a d , w x = ( a d , w ) * ( a w ) m 1 a .
for some x A . Then
( ( ( a w ) d ) 2 a ) * ( ( a w ) d ) 2 a x = ( ( ( a w ) d ) 2 a ) * ( a w ) m 1 a .
Hence,
( ( ( a w ) d ) 2 a ) * ( ( a w ) d ) m + 1 ( a w ) m + 1 ( ( a w ) d ) 2 a x = ( ( ( a w ) d ) 2 a ) * ( a w ) m 1 a .
This implies that
( ( ( a w ) d ) 2 a ) * ( ( a w ) d ) m + 1 ( a w ) m 1 a x = ( ( ( a w ) d ) 2 a ) * ( a w ) m 1 a .
Set z = ( w a ) m 1 x . As ( ( a w ) m 1 a ) d , w = ( ( a w ) d ) m + 1 a , we see that
( ( ( a w ) m 1 a ) d , w ) * ( ( a w ) m 1 a ) d , w z = ( ( ( a w ) m 1 a ) d , w ) * ( a w ) m 1 a .
In view of [3], we have
( ( a w ) m 1 a ) w g = [ ( ( a w ) m ) d ] 4 ( a w ) m 1 a z .
According to Theorem 2.1, we have
a w g m = ( a w ) m 1 ( ( a w ) m 1 a ) w g = ( a w ) m 1 [ ( ( a w ) m ) d ] 4 ( a w ) m 1 a z = ( a w ) m 1 [ ( ( a w ) m ) d ] 4 ( a w ) m 1 a ( w a ) m 1 x = ( ( a w ) d ) m + 3 a x
Therefore we complete the proof. □
Corollary 3. 
Let a A w g m . Then a A w g m + 1 . In this case,
a w g m + 1 = [ a w g m w ] 2 a .
Proof. 
By virtue of Theorem 2.5, a A d , w and there exists x A such that ( a d , w ) * a d , w x = ( a d , w ) * ( a w ) m 1 a . Then ( a d , w ) * a d , w ( x w a ) = ( a d , w ) * ( a w ) m 1 a ( w a ) = ( a d , w ) * ( a w ) m a . By using Theorem 2.5 again, a A w g m + 1 . Moreover, we derive that
a w g m + 1 = ( ( a w ) d ) m + 4 a ( x w a ) = ( a w ) d [ ( ( a w ) d ) m + 3 a x ] w a = ( a w ) d a w g m w a = ( a w ) d a [ w a w g m ] 2 w a = [ a w g m w ] 2 a .
This completes the proof. □
As a consequence, we give an interesting relationship between two projectors formed by the weighted generalized group inverse as follows.
Corollary 4. 
Let a A w g m . Then ( a w g m w ) ( a w ) = ( a w ) ( a w g m + 1 w ) .
Proof. 
In view of Corollary 2.6, a w g m + 1 = [ a w g m w ] 2 a . Hence,
a w a w g m + 1 = a w [ a w g m w ] 2 a = a w g m w a ;
and so a w a w g m + 1 w = a w g m w a w , as asserted. □
Recall that a A has w-Drazin inverse if there exists x A such that a ( w x ) 2 = x , a w x = x w a , ( a w ) n = x w ( a w ) n + 1 for some n N . Such x is unique, if it exists, and we denote it by a D , w . We derive
Corollary 5. 
Let a A . Then a A W m if and only if
(1)
a A D , w ;
(2)
There exists x A such that
( a D , w ) * a D , w x = ( a D , w ) * ( a w ) m 1 a .
In this case, a w W m = ( ( a w ) D ) m + 3 a x .
Proof. 
We easily prove that a A W m if and only if a A w g m A D , w . Therefore we complete the proof by Theorem 2.5. □

3. Algebraic Properties

In this section we investigate algebraic properties of ( m , w ) -generalized group inverse. We now establish the relation between ( m , w ) -generalized group inverse and ( m , w ) -generalized group decomposition.
 Theorem 4. 
Let a A . Then the following are equivalent:
(1)
a A w g m .
(2)
a has ( m , w ) -generalized 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 w # , y A w q n i l .
Proof. ( 1 ) ( 2 ) By hypothesis, a has the ( m , w ) -generalized 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 ) w # . Then we verify that a ( w x ) 2 = ( a 1 + a 2 ) w ( a 1 ) w # 2 = a 1 w ( a 1 ) w # 2 = ( a 1 ) w # = x . Since a 2 w a 1 = 0 , we have
a w x w ( a w ) 2 = ( a 1 + a 2 ) w ( a 1 ) w # w a 1 + ( a 1 ) w # w a 2 w ( a 1 + a 2 ) w = a 1 w + a 2 w ( a 1 ) w # w a 1 w ( a 1 + a 2 ) w ( a 1 ) w # w a 2 w ( a 1 + a 2 ) w = a 1 w + a 2 w ( a 1 ) w # w ( a 1 w ) 2 ( a 1 ) w # w a 1 w a 2 w ( a 1 ) w # w ( a 2 w ) 2 = [ 1 ( a 1 ) w # w a 1 ( a 1 ) w # w a 2 ] ( w a 2 w ) ,
and so
| | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = | | a w x w ( a w ) 2 ( a w ) n 1 | | 1 n = | | [ 1 ( a 1 ) w # w a 1 ( a 1 ) w # w a 2 ] ( w a 2 w ) ( a 1 w + a 2 w ) n 1 | | 1 n | | [ 1 ( a 1 ) w # w a 1 ( a 1 ) w # w a 2 ] 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 , and then
lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0 .
Since a 2 w a 1 = 0 , ( a 1 w ) ( a 1 w ) π = 0 and ( a 2 w ) d = 0 , it follows by [1] Corollary 3.4] that a w A d and ( a w ) d = ( a 1 w ) # + n = 1 ( ( a 1 w ) # ) n + 1 ( a 2 w ) n . Then
( ( a w ) d ) * ( a w ) m 1 a 2 = ( ( a w ) # ) * a 2 + n = 1 ( a 1 w ) # ) n + 1 ( a 2 w ) n * ( a w ) m 1 a 2 = ( ( a 1 w ) # ) 2 * w * ( a 1 ) * ( a w ) m 1 a 2 + n = 1 ( ( a 1 w ) # ) n + 2 ( a 2 w ) n * w * ( a 1 ) * a 2 = 0 ;
hence, ( a w ) d * ( a 1 w ) m 1 a 1 = ( a w ) d * ( a w ) m 1 a . Accordingly, we have
( a w ) d * ( a w ) m + 1 x = ( a w ) d * ( a w ) m ( a w ) ( a 1 ) w # = ( a w ) d * ( a 1 w ) m ( a 1 + a 2 ) w ( a 1 ) w # = ( a w ) d * ( a 1 w ) m + 1 ( a 1 ) w # = ( a w ) d * ( a 1 w ) m 1 a 1 = ( a w ) d * ( a w ) m 1 a .
( 2 ) ( 1 ) By hypothesis, 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 .
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 ) k + 1 ( w x ) k ( a w ) 2 [ x w ( a w ) k ] [ a ( w x ) k ] | | = | | a ( w a ) k + 1 ( w x ) k ( a w ) k + 1 [ a ( w x ) k ] | | .
Then 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 ) d ( a w ) k + 1 ] ( x w ) k 2 x * ( a w ) m + 1 x ( a w ) d ( a w ) k + 1 ( x w ) k 2 x * ( a w ) m + 1 x | | | | ( ( a w ) k ( a w ) d ( a w ) k + 1 ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | ( a w ) 2 x * ( a w ) m 1 a [ ( a w ) d ( a w ) k + 1 ( x w ) k 2 x ] * ( a w ) m + 1 x | | | | ( ( a w ) k ( a w ) d ( a w ) k + 1 ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | ( a w ) 2 x * ( a w ) m 1 a [ ( a w ) k + 1 ( x w ) k 2 x ] * [ ( a w ) d ] * ( a w ) m + 1 x | | | | ( ( a w ) k ( a w ) d ( a w ) k + 1 ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | ( a w ) 2 x * ( a w ) m 1 a [ ( a w ) k + 1 ( x w ) k 2 x ] * [ ( a w ) d ] * a | |
| | ( ( a w ) k ( a w ) d ( a w ) k + 1 ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | ( a w ) 2 x * ( a w ) m 1 a [ ( a w ) d ( a w ) k + 1 ( x w ) k 2 x ] * a | | | | ( ( a w ) k ( a w ) d ( a w ) k + 1 ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | ( a w ) k ( x w ) k 2 x * a [ ( a w ) d ( a w ) k + 1 ( x w ) k 2 x ] * a | | | | ( ( a w ) k ( a w ) d ( a w ) k + 1 ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | [ ( a w ) k ( a w ) d ( a w ) k + 1 ] ( x w ) k 2 x * a | | | | ( ( a w ) k ( a w ) d ( a w ) k + 1 ) * | | ( ( x w ) k 2 x ) * | | | | ( a w ) m + 1 x | | + | | ( a w ) k ( a w ) d ( a w ) k + 1 | | | | ( x w ) k 2 x * | | | | a | | .
Then
| | a 1 * ( a w ) m 1 a 2 | | 1 k | | ( ( a w ) k ( a w ) d ( a w ) k + 1 ) * | | 1 k | | ( ( x w ) k 2 x ) * | | 1 k | | ( a w ) m + 1 x | | 1 k + | | ( ( a w ) k ( a w ) d ( a w ) k + 1 ) * | | 1 k | | ( x w ) k 2 x * | | 1 k | | a | | 1 k .
By using [5, Lemma 2.1], we have lim k | | ( ( a w ) k ( a w ) d ( a w ) k + 1 ) * | | 1 k = 0 . Therefore lim k | | a 1 * ( a w ) m 1 a 2 | | 1 k = 0 , and then a 1 * ( a w ) m 1 a 2 = 0 . Moreover, we check that
a 1 w x = ( a w ) 2 x w x = a w [ a ( w x ) 2 ] = a w x = x w ( a w ) 2 x = x w a 1 , a 1 w x w a 1 = a w x w ( a w ) 2 x = ( a w ) 2 x = a 1 , x w a 1 w x = a ( w x ) 2 = x .
Hence ( a 1 ) w # = x .
We further verify that
[ a w z w ( a w ) 2 ] z = [ a w z w ( a w ) 2 ] a ( w z ) 2 = [ ( a w ) 2 z w ( a w ) 3 ] z ( w z ) = [ ( a w ) 2 z w ( a w ) 3 ] [ a ( w z ) 2 ] ( w z ) = [ ( a w ) 3 z w ( a w ) 4 ] z ( w z ) 2 = [ ( a w ) n z w ( a w ) n + 1 ] z ( w z ) n 1 .
Therefore
| | ( a w z w ( a w ) 2 ) z | | 1 n | | ( a w ) n z w ( a w ) n + 1 | 1 n | | | z ( w z ) n 1 | | 1 n .
Since lim n | | a n z a n + 1 | | 1 n = 0 , we have lim n | | [ a w z w ( a w ) 2 ] z | | 1 n = 0 . This implies that z w ( a w ) 2 z = a w z .
We check that
| | ( a w z w ( a w ) 2 ) n + 1 | | 1 n + 1 = | | [ a w z w ( a w ) 2 ] n 1 [ a w z w ( a w ) 2 ] ( a w ) | | 1 n + 1 = | | [ a w z w ( a w ) 2 ] n 1 ( a w ) 2 | | 1 n + 1 = | | ( a w z w ( a w ) 2 ) ( a w ) n | | 1 n + 1 | | ( a w ) n z w ( a w ) n + 1 | | 1 n n n + 1 | | ( a w ) n | | 1 n + 1 .
Accordingly, lim n | | ( a w z w ( a w ) 2 ) n + 1 | | 1 n + 1 = 0 . This implies that a w z w ( a w ) 2 A q n i l . By using Cline’s formula (see [17]), y = a ( a w ) 2 z A w q n i l . □
Corollary 6. 
Let a A w g m . Then a w a w g m = ( a w ) n 1 a ( w a w g m ) n for any n N .
Proof. 
These are obvious by the proof of Theorem 3.1. □
We come now to characterize ( m , w ) -generalized group inverse by the polar-like property.
 Theorem 5. 
Let a A w g m . Then there exists an idempotent p A such that
a w + p A 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 3.1, there exist z , y A such that
a = z + y , z * ( a w ) m 1 y = y w z = 0 , z A w # , y A w q n i l .
Set x = z w # . The we check that
a w x = ( z + y ) w z w # = z w z w # , a ( w x ) 2 = ( a w x ) w x = z ( w z w # ) 2 = z 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 . As z * a 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 w # w ) = ( ( a w ) m ) * ( ( a w ) m z w ) z w # w = ( ( a w ) m ) * ( ( z w ) m z w ) z w # w = [ ( a w ) m ) * ( z w ) m ] z w z w # w = [ ( z w ) m ] * ( z w ) m + 1 z w # w = [ ( z w ) m ] * ( z w ) m 1 [ ( z w ) 2 z 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 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 w # w ) = ( z + y ) w ( 1 z w z w # w ) = y w A q n i l , we have a w p = a w ( 1 z w z w # w ) A q n i l . Therefore 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 w # w ) ( z + y ) w z w z w # w = ( 1 z w z w # w ) ( z w ) 2 z w # w = 0 , we see that p a w = p a w p . Obviously, z w + 1 z w z w # w = ( z w # w + 1 z w z w # w ) 1 A 1 . Since y w ( z w # w + 1 z w z w # w ) = y w A q n i l , it follows by Cline’s formula that ( z w # w + 1 z w z 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 w # w = ( z w + 1 z w z w # w ) [ 1 + ( z w + 1 z w z w # w ) 1 y w ] A 1 ,
as desired. □
Corollary 7. 
Let a A and w A 1 . Then the following are equivalent:
(1)
a A w g m .
(2)
a A d , w and there exists an idempotent p A such that
a w + p A 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. ( 1 ) ( 2 ) This is obvious by Theorem 3.3.
( 2 ) ( 1 ) By hypothesis, there exists an idempotent p A such that
a w + p A 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 .
Set x = a w ( 1 p ) w 1 and y = a w p w 1 . Then x + y = a w ( 1 p ) w 1 + a w p w 1 = a . Since p a w A q n i l , by using Cline’s formula, we have y w = a w p A q n i l . Hence, y A w q n i l . Since p a w ( 1 p ) = 0 , we have y w x = [ a w p w 1 ] w [ a w ( 1 p ) w 1 ] = a w [ p a w ( 1 p ) ] w 1 = 0 .
Set u = a w + p . Let z = ( 1 p ) u 1 w 1 . Then we check that
z ( w x ) 2 = ( 1 p ) u 1 ( x w ) x = ( 1 p ) u 1 a w ( 1 p ) x = ( 1 p ) u 1 [ a w + p ] ( 1 p ) x = ( 1 p ) x = x .
Since a A d , w , a w p A d and p w a ( 1 p ) = 0 , it follows by [29] that x = a w ( 1 p ) w 1 A d , w . Hence x w , w x A d . We verify that
x w = z w ( x w ) 2 = ( z w ) n ( x w ) n + 1 = ( z w ) n ( ( x w ) n ( x w ) d ( x w ) n + 1 ) x w + ( z w ) n ( x w ) d ( x w ) n + 2 , ( x w ) 2 ( x w ) d = ( z w ( x w ) 2 ) ( x w ) ( x w ) d = ( z w ) n ( x w ) n + 2 ( x w ) d .
Then
| | ( x w ) ( x w ) 2 ( x w ) d | | 1 n = | | ( z w ) n ( ( x w ) n ( x w ) d x n + 1 ) ( x w ) | | 1 n | | ( z w ) n | | 1 n | | ( x w ) n ( x w ) d ( x w ) n + 1 | | 1 n | | ( x w ) | | 1 n .
Accordingly,
lim n | | x w ( x w ) 2 x w ) d | | 1 n = 0 .
Therefore we have x w = ( x w ) 2 ( x w ) d , and so x w A # . Likewise, w x A # . Therefore x A w # .
Obviously, p x w = p a w ( 1 p ) = 0 , and then
w * x * ( a w ) m 1 y = ( x w ) * ( a w ) m 1 y = ( x w ) m ( ( x w ) # ) m 1 * ( a w ) m 1 y = ( a w ) m ( ( x w ) # ) m 1 * ( a w ) m 1 y = ( ( x w ) # ) m 1 * ( a w ) m * ( a w ) m 1 [ a w p w 1 ] = ( ( x w ) # ) m 1 * [ ( a w ) m ) * ( a w ) m p ] w 1 ] = ( ( x w ) # ) m 1 * ( a w ) m * ( a w ) m p ) * w 1 ] = p ( ( x w ) # ) m 1 * ( a w ) m * ( a w ) m ) * w 1 ] = 0 .
Hence, x * ( a w ) m 1 y = 0 . Therefore a = x + y is the ( m , w ) -generalized group decomposition of a. By virtue of Theorem 3.1, a A w g m . □
Corollary 8. 
Let a A w g m and w A 1 . Then a is the sum of three invertible elements in A .
Proof. 
In view of Theorem 3.3, there exists an idempotent p A such that
u : = a w + p A 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 .
Hence,
a w = 1 2 + 1 2 p 2 + u .
Obviously, [ 1 2 p 2 ] 2 = 1 4 and then [ 1 2 p 2 ] 1 = 2 ( 1 2 p ) . Therefore
a = w 1 2 + ( 1 2 p ) w 1 2 + u w 1 ,
as desired. □
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 ) (see [10]). We now establish the relationship among ( m , w ) -generalized group inverse, m-generalized group inverse and generalized w-group inverse by using the ( b , c ) -inverse.
 Theorem 6. 
Let a A w g m . Then
a w g m = ( w a w ) ( a w ) g m , ( ( a w ) m 1 a ) w g .
Proof. 
Let x = a w g m . Then 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 .
Hence,
x w = ( a w ) ( x w ) 2 , [ ( a w ) d ] * ( a w ) m + 1 ( x w ) = [ ( a w ) d ] * ( a w ) m 1 ( a w ) , lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 .
By virtue of [2], x w = ( a w ) g m . Thus
x = ( x w ) ( a w ) x = ( a w ) g m ( a w ) x ( a w ) g m A x .
In view of Theorem 2.1, x = ( a w ) m 1 ( ( a w ) m 1 a ) w g . Then
x = x ( w a w ) x = x ( w a w ) ( a w ) m 1 ( ( a w ) m 1 a ) w g x A ( ( a w ) m 1 a ) w g .
Hence, we verify that
x ( w a w ) [ ( a w ) g m ] = ( a w ) m 1 ( ( a w ) m 1 a ) w g ( w a w ) [ ( a w ) g m ] = ( a w ) m 1 ( ( a w ) m 1 a ) w g w ( a w ) m [ ( a w ) g m ] m = ( a w ) m 1 [ ( ( a w ) m 1 a ) w g w ] [ ( ( a w ) m 1 a ) w ] [ ( a w ) g m ] m = ( a w ) m 1 [ ( a w ) g m ] m = ( a w ) g m , ( ( a w ) m 1 a ) w g ( w a w ) x = ( ( a w ) m 1 a ) w g ( w a w ) ( a w ) m 1 ( ( a w ) m 1 a ) w g = ( ( a w ) m 1 a ) w g w [ ( a w ) m 1 a ] w ( ( a w ) m 1 a ) w g = ( ( a w ) m 1 a ) w g .
Therefore
a w g m = ( w a w ) ( a w ) g m , ( ( a w ) m 1 a ) w g ,
as asserted. □
Let a A and T , S A . We say that a has { 2 } -inverse x provided that x a x = x , i m ( a ) = T , k e r ( a ) = S . We denote x by a T , S ( 2 ) . We next consider the relation between the weighted generalized group inverse and { 2 } -inverse in a Banach algebra.
 Theorem 7. 
Let a A w g m . Then
a w g m = ( w a w ) i m ( a w ) d , k e r ( a w ) d * ( a w ) m 1 a ( 2 ) .
Proof. 
Let x = a w g m . In view of Corollary 2.4, x = x ( w a w ) x .
Step 1. i m ( x ) = i m ( a w ) d . In view of Theorem 2.5, we have i m ( x ) i m ( a w ) d .
We claim that x a w ( a w ) d = ( a w ) d . One directly checks that
| | ( a w ) d a w g m ( a w ) ( a w ) d | | = | | ( a w ) n ( ( a w ) d ) n + 1 a w g m ( a w ) n + 1 ( ( a w ) d ) n + 1 | | = | | ( ( a w ) n a w g m ( a w ) n + 1 ) ( ( a w ) d ) n + 1 | | | | ( a w ) n a w g m ( a w ) n + 1 | | | | ( ( a w ) d ) n + 1 | |
Then
| | ( a w ) d a w g m ( a w ) ( a w ) d | | 1 n | | ( a w ) n a w g m ( a w ) n + 1 | | 1 n | | ( a w ) d | | 1 + 1 n .
Thus,
lim n | | ( a w ) d a w g m ( a w ) ( a w ) d | | 1 n = 0 .
This implies that a w g m ( a w ) ( a w ) d = ( a w ) d . Accordingly, i m ( a w ) d i m ( x ) . Therefore i m ( x ) = i m a a a * .
Step 2. k e r ( x ) = k e r ( a w ) d * ( a w ) m 1 a . If ( ( a w ) d ) * ( a w ) m 1 a r = 0 for some r R , then ( ( a w ) d ) * ( a w ) m + 1 x r = 0 . Write x = ( a w ) d z for some z A . Then ( ( a w ) d ) * ( a w ) d ( a w ) m + 1 z r = ( ( a w ) d ) * ( a w ) m + 1 ( a w ) d z r = 0 . Since the involution * is proper, we easily get ( a w ) d ( a w ) m + 1 z r = 0 ; and then x r = ( a w ) d z r = [ ( a w ) d ] m + 1 [ ( a w ) d ( a w ) m + 1 z r ] = 0 . Hence, r k e r ( x ) .
If x ( r ) = 0 , then ( a w ) d * ( a w ) m 1 a r = ( a w ) d * ( a w ) m + 1 ( x r ) = 0 . Hence, r k e r ( a w ) d * ( a w ) m 1 a , as required.
Therefore the proof is completed. □
Corollary 9. 
Let a A g m . Then
a g m = a i m ( a d ) , k e r a d * a m ( 2 ) .
Proof. 
This is obvious by choosing w = 1 in Theorem 3.7. □

4. Applications to Complex Matrices

We now proceed to examine certain applications of the weighted weak group inverse in the context of complex matrices. For further use, we establish the interrelation between the m-generalized group inverse and the ( m , w ) -weak group inverse.
 Theorem 8. 
Let a , w A . Then a A w w m if and only if a A D , w R w g m . In this case, a w w m = a w g m .
Proof. 
⟹ Clearly, a w A D ; hence, a A D , w . Then a A w g m . According to Theorem 2.1 and [3, Theorem 2.4], we see that a w w m = a w g m .
⟸ Let x = a w g m . Then there exists x A such that
x = a ( w x ) 2 , [ ( a w ) d ] * ( a w ) m + 1 x = [ ( a w ) d ] * a m 1 a , lim n | | ( a w ) n x w ( a w ) n + 1 | | 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 ) d ] * ( a w ) m + 1 z = [ ( a w ) d ] * ( a w ) m 1 a .
[ ( a w ) d ] * ( a w ) m + 1 z = [ ( a w ) d ] * [ ( a w ) k + m + 1 y ] ( w x ) k = [ ( a w ) d ] * [ y ( w a ) k + m + 1 ] ( w x ) k = [ ( a w ) d ] * [ ( y w ) a ( w a ) k + m + 1 w ] x ( w x ) k 1 = [ ( a w ) d ] * [ ( y w ) ( a w ) k + m + 1 ] a w x ( w x ) k 1 = [ ( a w ) d ] * ( a w ) k + m + 1 x ( w x ) k 1 = [ ( a w ) d ] * a ( w a ) k + m 1 ( w x ) k = [ ( a w ) d ] * a ( w a ) m ( w x ) = [ ( a w ) d ] * ( a w ) m + 1 x = [ ( a w ) 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 . □
The following example illustrates that ( m , w ) -generalized group inverse is different from the ( m , w ) -weak group inverse.
Example 1. 
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 Theorem 4.1. 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 9. 
Let A , W , X C n × n , with conjugate transpose * as the involution. Then the following are equivalent:
(1)
A W w m = X .
(2)
There exist Y , Z C n × n such that
A = Y + Z , Y * Z = Z W m 1 Y = 0 ,
Y C n × n has W-group inverse X , Z C n × n is nilpotent.
(3)
There exist n N such that
X = A ( W X ) 2 , ( A W ) n = X W ( A W ) n + 1 , ( A W ) D * ( A W ) m + 1 X = ( A W ) D * ( A W ) m 1 A .
(4)
There exist n N such that
( A W ) n = X W ( A W ) n + 1 , I m ( X ) = I m ( A D , W ) , ( A W ) D * ( A W ) m + 1 X = A W ) D * ( A W ) m 1 A .
(5)
There exists S A such that ( A D , W ) * A D , W S = ( A D , W ) * ( A W ) m 1 A and X = ( ( A W ) D ) m + 3 A S .
Proof. 
Evidently, A C n × n has W-Drazin inverse.
( 1 ) ( 2 ) For a complex matrix, the quasi-nilpotent and nilpotent properties coincide with each other. This equivalence is proved by Theorem 3.1 and Theorem 4.1.
( 1 ) ( 3 ) In view of Theorem 4.1, we have
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 .
This implies that ( A W ) n = X W ( A W ) n + 1 for some n N .
( 3 ) ( 1 ) This is obvious by Theorem 4.1.
( 1 ) ( 4 ) This is proved by Theorem 2.1, Theorem 4.1 and [3].
( 1 ) ( 5 ) This is similar by using Theorem 2.5 and Theorem 4.1. □
As an immediate consequence of Theorem 4.3, we derive
Corollary 10. 
Let A , X C n × n , with conjugate transpose * as the involution. Then the following are equivalent:
(1)
A , W = X .
(2)
There exist Y , Z C n × n such that
A = Y + Z , Y * Z = Z Y = 0 ,
Y C n × n has W-group inverse X , Z C n × n is nilpotent.
(3)
There exist n N such that
X = A ( W X ) 2 , ( A W ) n = X W ( A W ) n + 1 , ( A W ) D * ( A W ) 2 X = ( A W ) D * A .
(4)
There exist n N such that
( A W ) n = X W ( A W ) n + 1 , I m ( X ) = I m ( A D , W ) , ( A W ) D * ( A W ) 2 X = A W ) D * A .
(5)
There exists S A such that ( A D , W ) * A D , W S = ( A D , W ) * A and X = ( ( A W ) D ) 4 A S .
We are ready to prove:
 Theorem 10. 
Let A , W C n × n . Then
A W w m = ( A W ) 4 ( m 1 ) A , W W A , W ( W A ) m .
Proof. 
In view of Theorem 2.1 and Theorem 4.1, we have
A W w m = ( A W ) m 1 ( ( A W ) m 1 A ) , W .
By virtue of [7, Theorem 3.1], we see that
( A W ) m 1 A = X + Y , X * Y = 0 , Y W X = 0 , X C n × n h a s W w e i g h t e d c o r e i n v e r s e , Y C n × n i s n i l p o t e n t .
Then
[ ( A W ) m 1 A ] , W = X # , W .
In light of [7], we have
X # , W = ( X W ) # X W ( W X W ) .
Then
( ( X W ) # ) 2 X # , W ( W X ) 2 = ( ( X W ) # ) 3 X ( W X W ) ( W X W ) ( W X W ) X = [ ( X W ) # ] 3 X ( W X W ) X = [ ( X W ) # ] 2 X = X W # .
Thus, we have
X W # = ( ( X W ) # ) 2 X # , W ( W X ) 2 = ( ( X W ) # ) 2 X W X # , W W X # , W ( W X ) 2 = ( ( X W ) # ) 2 X W [ X W X # , W W X # , W ] W X # , W ( W X ) 2 = ( X W ) # X W X # , W W X # , W W X # , W W X W X = [ X # , W W ] 3 X W X .
Therefore
X W # = [ X # , W W ] 3 X W X .
By using [7], we have
X = ( A W ) m 1 A W X # , W W ( A W ) m 1 A = ( A W ) m X # , W ( W A ) m .
Accordingly, we have
A W w m = ( A W ) m 1 X W # = ( A W ) m 1 [ X # , W W ] 3 X W X = ( A W ) m 1 [ X # , W W ] 3 ( A W ) m X # , W ( W A ) m W ( A W ) m X # , W ( W A ) m = ( A W ) m 1 [ X # , W W ] 3 ( A W ) m X # , W ( W A ) 2 m W X # , W ( W A ) m = ( A W ) m 1 [ A , W W ] 3 ( A W ) m A , W ( W A ) 2 m W A , W ( W A ) m .
as asserted. □
Let A , W C n × n and k = m a x { i n d ( A W ) , i n d ( W A ) } . The weighted core-EP inverse of A is the unique solution to the system:
W A W X = ( W A ) k [ ( W A ) k ] , R ( X ) R ( ( A W ) k ) ,
and we denote such X by A , W .
Corollary 11. 
Let A , W C n × n . Then
A , W = ( A , W W ) 2 A .
Proof. 
This is obvious by choosing m = 1 in Theorem 4.5. □
Lemma 1. 
Let A , W C n × n . Then the W-weak group inverse of A can be expressed as
A , W = ( A W ) ( A W ) D [ ( A W ) 3 ( A W ) D ] A .
Proof. 
Set X = ( A W ) ( A W ) D [ ( A W ) 3 ( A W ) D ] A and n = i n d ( A W ) . Then we verify that
A ( W X ) 2 = ( A W ) 2 ( A W ) D [ ( A W ) 3 ( A W ) D ] ( A W ) 2 ( A W ) D [ ( A W ) 3 ( A W ) D ] A = ( A W ) D [ ( A W ) 3 ( A W ) D ] ( A W ) D [ ( A W ) 3 ( A W ) D ] A = ( A W ) ( A W ) D [ ( A W ) 3 ( A W ) D ] A = X ; ( A W ) D * ( A W ) 2 X = ( A W ) D * ( A W ) 3 ( A W ) D [ ( A W ) 3 ( A W ) D ] A = ( A W ) D * ( A W ) 3 ( A W ) D [ ( A W ) 3 ( A W ) D ] * A = ( A W ) 3 ( A W ) D [ ( A W ) 3 ( A W ) D ] ( A W ) D * A = [ ( A W ) 3 ( A W ) D ] [ ( A W ) 3 ( A W ) D ] [ ( A W ) 3 ( A W ) D ] ( ( A W ) D ) 3 * A = [ ( A W ) 3 ( A W ) D ] ( ( A W ) D ) 3 * A = ( A W ) D * A ; X W ( A W ) n + 1 = ( A W ) ( A W ) D [ ( A W ) 3 ( A W ) D ] A W ( A W ) n + 1 = ( A W ) D 2 [ ( A W ) 3 ( A W ) D ] [ ( A W ) 3 ( A W ) D ] [ ( A W ) 3 ( A W ) D ] ( A W ) n = ( A W ) D 2 [ ( A W ) 3 ( A W ) D ] ( A W ) n = ( A W ) D ( A W ) n + 1 = ( A W ) n .
Therefore A , W = X , as asserted. □
We now develop a formula for the weighted weak group inverse of a complex matrix.
 Theorem 11. 
Let A , W C n × n . Then the ( m , W ) -weak group inverse of A can be expressed as
A W w m = ( A W ) ( A W ) D [ ( A W ) 2 m + 1 ( A W ) D ] ( A W ) m 1 A .
Proof. 
In view of Theorem 2.1 and Theorem 4.1,
A W w m = ( A W ) m 1 [ ( A W ) m 1 A ] , W .
By virtue of Lemma 4.7, we have
[ ( A W ) m 1 A ] , W = ( A W ) m ( ( A W ) m ) D [ ( A W ) 3 m ( ( A W ) m ) D ] ( A W ) m 1 A = ( A W ) ( A W ) D [ ( A W ) 2 m + 1 ( A W ) D ] ( A W ) m 1 A .
Therefore we conclude that
A W w m = ( A W ) m ( A W ) D [ ( A W ) 2 m + 1 ( A W ) D ] ( A W ) m 1 A ,
as asserted. □
Corollary 12. 
Let A C n × n . Then the weak group inverse of A can be expressed as
A = A A D [ A 3 A D ] A .
Proof. 
Straightforward by Theorem 4.8. □
Applying the weighted weak group inverse, we prove solvability of the following minimization problem with respect to X C n × n in the Frobenius norm:
 Theorem 12. 
Let A C n × n . The minimization problem with respect to X C n × n :
min | | ( A W ) 2 m X ( A W ) m 1 A B ] | | F
subject to R ( X ) R ( A W ) D is
X = A W w m B .
Proof. 
Since R ( X ) R ( A W ) D , we may write X = ( A W ) ( A W ) D Y for some Y C n × n . Then X is the solution of the preceding minimization problem if and only if Y is the solution of the following minimization problem:
min | | ( A W ) 2 m + 1 ( A W ) D Y ( A W ) m 1 A B | | F .
By the relation between the minimization problem and the Moore-Penrose inverse, we claim that
Y = ( A W ) 2 m + 1 ( A W ) D ( A W ) m 1 A B .
Therefore
X = ( A W ) ( A W ) D [ ( A W ) 3 ( A W ) D ] ( A W ) m 1 A B = A W w m B ,
as asserted. □
Corollary 13. 
Let A C n × n . The minimization problem with respect to X C n × n :
min | | A 2 m X A m B ] | | F
subject to R ( X ) R ( A D ) is
X = A w m B .
Proof. 
This is immediate by choosing W = I n in Theorem 4.10. □
Corollary 14. 
Let A , W C n × n . The minimization problem with respect to X C n × n :
min | | ( A W ) 2 X A B ] | | F
subject to R ( X ) R ( A W ) D is
X = A , W B .
Proof. 
This is obvious by choosing m = 1 in Theorem 4.10. □

Data Availability Statement

No/Not applicable (this manuscript does not report data generation or analysis).

Conflicts of Interest

The authors declare there is no conflicts of interest.

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., 22(2025). [CrossRef]
  3. H. Chen, Generalized weighted group inverse in Banach algebras with proper involution, preprint, 2024. https://www.preprints.org/manuscript/202406.1867/v1.
  4. H. Chen and M.S. Abdolyousefi, Weighted generalized group inverse in Banach *-algebras, Filomat, 39(2025), 483–500.
  5. H. Chen and M. Sheibani, Generalized group inverse in a Banach *-algebra, preprint, 2023. [CrossRef]
  6. H. Chen and M. Sheibani, Theory of Clean Rings and Matrices, World Scientific, Hackensack, NJ, 2023. [CrossRef]
  7. H. Chen and M. Sheibani, New properties of weighted generalized core-EP inverse in Banach algebras, preprint, 2025.
  8. H. Chen and M. Xiang, Weighted m-generalized group inverse in *-Banach algebras, preprint, 2024. https://vixra.org/abs/2406.0137.
  9. Y. Chen; L. Yuan and X. Zhang, New characterizations and representations of the weak group inverse, Filomat, 38(2024), 6703–6713.
  10. M.P. Drazin, Weighted (b,c)-inverses in categories and semigroups, Comm. Algebra, 48(2020), 1423–1438.
  11. 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.
  12. 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. [CrossRef]
  13. J. Gao; K. Zu and Q. Wang, A m-weak group inverse for rectangular matrices, arXiv: 2312.10704v1 [math.R.A] 17 Dec 2023.
  14. Y. Gao and J. Chen, Pseudo core inverses in rings with involution, Comm. Algebra, 46(2018), 38–50.
  15. W. Jiang and K. Zuo, Further characterizations of the m-weak group inverse of a complex matrix, AIMS Math., 7(2020), 17369–17392.
  16. W. Li; J. Chen and Y. Zhou, Characterizations and representations of weak core inverses and m-weak group inverses, Turk. J. Math., 47(2023), 1453–1468. [CrossRef]
  17. Y. Liao; J. Chen and J. Cui, Cline’s formula for the generalized Drazin inverse, Bull. Malays. Math. Sci. Soc., 37(2014), 37–42.
  18. N. Mihajlovic, Group inverse and core inverse in Banach and C*-algebras, Comm. Algebra, 48(2020), 1803–1818.
  19. D. Mosić, Weighted generalized Drazin inverse in rings, Georgian Math. J., 23(2016), 587–594.
  20. D. Mosić, Core-EP inverses in Banach algebras, Linear Multilinear Algebra, 69(2021), 2976–2989. [CrossRef]
  21. D. Mosić; P.S. Staninirović, Representations for the weak group inverse, Appl. Math. Comput., 397(2021), Article ID 125957, 19 p.
  22. 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.
  23. 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.
  24. D. Mosić and D. Zhang, Weighted weak group inverse for Hilbert space operators, Front. Math. China, 15(2020), 709–726.
  25. D. Mosić and D. Zhang, New representations and properties of the m-weak group inverse, Result. Math., 78(2023). [CrossRef]
  26. K.M. Prasad and K.S. Mohana, Core-EP inverse, Linear Multilinear Algebra, 62(2014), 792–802.
  27. H. Wang, Core-EP decomposition and its applications, Linear Algebra Appl., 508 (2016), 289–300. [CrossRef]
  28. H. Wang and J. Chen, Weak group inverse, Open Math., 16(2018), 1218–1232.
  29. D. Zhang and D. Mosić, Explicit formulae for the generalized Drazin inverse of block matrices over a Banach algebra, Filomat, 32(2018), 5907–5917.
  30. M. Zhou; J. Chen and Y. Zhou, Weak group inverses in proper *-rings, J. Algebra Appl., 19(2020), Article ID 2050238, 14 p.
  31. 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. [CrossRef]
  32. M. Zhou; J. Chen and N. Thome, New characterizations of weak group matrices, Filomat, 37(2023), 457–466.
  33. 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.
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