Preprint
Article

Weighted Generalized Group Inverse in Banach *-Algebras

Altmetrics

Downloads

105

Views

26

Comments

0

This version is not peer-reviewed

Submitted:

03 October 2023

Posted:

04 October 2023

You are already at the latest version

Alerts
Abstract
In this paper, we introduce the notion of weighted generalized group inverse in a Banach algebra with proper involution. This is a natural generalization of weighted weak group inverse for a complex matrix and Hilbert space operator. We present several characterizations and representations of this generalized inverse. In addition, a new partial order on elements in a Banach *-algebra is investigated by using the weighted generalized group inverse and some known results are thus generalized.
Keywords: 
Subject: Computer Science and Mathematics  -   Algebra and Number Theory

1. Introduction

Let A C n × n be a complex matrix. The group inverse of A is defined as the matrix X C n × n satisfies the equations:
X A 2 = A , A X 2 = X , A X = X A .
Such X is unique if exists, denoted by A # . As is well known, a square complex matrix A has group inverse if and only if r a n k ( A ) = r a n k ( A 2 ) .
In [18], Wang and Chen introduced and studied a weak group inverse for square complex matrices. A square complex matrix A has weak group inverse X if it satisfies the equations:
Preprints 86873 i002
Here, Preprints 86873 i001 is the core-EP inverse of A (see [11,13,14]). Weak group inverse was also generalized to a rectangular matrix and Hilbert space operator (see [5,15]). We refer the reader to [16,19,20] for more results on weak group inverse.
Let B ( X , Y ) be the set of all bounded linear operators from X to Y, where X and Y are infinite-dimensional complex Hilbert spaces. Very recently, Mosić and D. Zheng introduced and studied weighted weak group inverse for Hilbert space operators. Let A B ( X , Y ) and W B ( Y , X ) { 0 } . The W-weighted weak group inverse of A is defined as
A , W = ( A , W W ) 2 A .
Here, A , W is the weighted core-EP inverse of A (see [10,12,15]).
A Banach algebra is called a Banach *-algebra if there exists an involution : x x * satisfying ( x + y ) * = x * + y * , ( λ x ) * = λ ¯ x * , ( x y ) * = y * x * , ( x * ) * = x . The involution ∗ is proper if x * x = 0 x = 0 for any x A . The algebra C n × n of all n × n complex matrices is a Banach algebra with conjugate transpose ∗ as its proper involution. If X is a Hilbert space then the algebra B ( X ) of all bounded linear operators from on X, with the usual operations and norm, is a Banach algebra with the adjoint operation as its proper involution. The goal of this paper is to generalize (weighted) weak group inverse for complex matrices and Hilbert space operators to elements in a Banach algebra with proper involution. Some known results are thus generalized wider cases.
Let A be a Banach algebra with proper involution ∗. An element a A has g-Drazin inverse (i.e., generalized Drazin inverse) if there exists x A such that a x 2 = x , a x = x a , a a 2 x A q n i l . Such x is unique, if exists, and denote it by a d . Here, A q n i l = { a A 1 + λ a A 1 } . Evidently, a A q n i l lim n a n 1 n = 0 . As a generalization of weak group inverse mentioned above, the author introduced and studied generalized group inverse (see [2]). 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, and denote it by a . Here, we list several characterizations of generalized group inverse.
Theorem 1.
(see [2] Theorem 2.2, Theorem 4.1 and Theorem 5.1) Let A be a Banach *-algebra, and let a A . Then the following are equivalent:
(1)
a A .
(2)
There exist x , y A such that
a = x + y , x * y = y x = 0 , x A # , y A q n i l .
(3)
a A d and there exists x A such that
x = a x 2 , ( a d ) * a 2 x = ( a d ) * a , lim n | | a n x a n + 1 | | 1 n = 0 .
(4)
There exists an idempotent p A such that
a + p A 1 , ( a * a p ) * = a * a p a n d p a = p a p A q n i l .
(5)
a A d and
a d A = q A a n d a * a q = q * a * a
for an idempotent q A .
In Section 2, we extend the definition of weighted weak group inverse for a Hilbert space operator to an elements in a Banach algebra. We obtain some characterizations of weighted generalized group inverse, in particular, the representations of weighted generalized group inverse in terms of generalized group inverses. Recall that an element a A has generalized w-core-EP inverse if there exist x A such that
a ( w x ) 2 = x , ( w a w x ) * = w a w x , lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0 .
The preceding x is unique if exists, and we denote it by a , w (see [3]). An element a A has generalized core-EP inverse if the w mentioned above is 1, and denote its weighted generalized core-EP inverse by a (see [1]). In Section 3, we establish the representations of weighted generalized group inverse as a subclass of weighted generalized core-EP inverses. In Section 4, we characterize the weighted generalized group inverse in terms of involved images and kernels. A new property of weighted group inverse is presented by using three systems of equations. Finally, in the last Section, we investigate constrained binary relations and some properties of weighted generalized group orders are derived by using weighted generalized group inverses.
Throughout the paper, all Banach algebras are complex with a proper involution ∗. We use A 1 , A # , A d , A , A and A to denote the sets of all invertible, group invertible, g-Drazin invertible, weak group invertible, generalized core-EP invertible and generalized group invertible elements in A , respectively. An element a A has ( 1 , 3 ) -inverse x if it satisfies the equations a x a = a and ( a x ) * = a x and denote x by a ( 1 , 3 ) .

2. Weighted Generalized GROUP Inverse

The purpose of this section is to introduce a new generalized inverse which is a natural generalization of group inverse in a *-Banach algebra. Our starting points is the following.
Theorem 2.
Let a , w A . Then the following are equivalent:
(1)
There exists x A such that
x = a ( w x ) 2 , [ ( w a ) * ( w a ) 2 w x ] * = ( w a ) * ( w a ) 2 w x , lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0 .
(2)
w a A .
In this case, x = a [ ( w a ) ] 2 .
Proof. 
( 1 ) ( 2 ) By hypothesis, we can find x A such that
a ( w x ) 2 = x , ( w a w x ) * = w a w x , lim n | | ( a w ) n 1 ( x w ) ( a w ) n | | 1 n 1 = 0 .
Then
( w a ) ( w x ) 2 = w x , [ ( w a ) * ( w a ) 2 w x ] * = ( w a ) * ( w a ) 2 w x .
Furthermore, we have
| | ( w a ) n ( w x ) ( w a ) n + 1 | | 1 n = | | w ( a w ) n 1 a w x w ( a w ) n a | | 1 n = | | w [ ( a w ) n 1 x w ( a w ) n ] a | | 1 n | | w | | 1 n [ | | ( a w ) n 1 x w ( a w ) n | | 1 n 1 ] n n | | a | | 1 n .
Therefore
lim n | | ( w a ) n ( w x ) ( w a ) n + 1 | | 1 n = 0 .
Hence,
w a A a n d ( w a ) = w x .
Accordingly,
x = a ( w x ) 2 = a [ ( w a ) ] 2 ,
as desired.
( 2 ) ( 1 ) Let x = a [ ( w a ) ] 2 . Then we verify that
a ( w x ) 2 = a w a [ ( w a ) ] 2 w a [ ( w a ) ] 2 = a [ ( w a ) ] 2 = x , ( w a ) * ( w a ) 2 w x = ( w a ) * ( w a ) 2 w a [ ( w a ) ] 2 = ( w a ) * ( w a ) 2 ( w a ) , ( ( w a ) * ( w a ) 2 w x ) * = [ ( w a ) * ( w a ) 2 ( w a ) ] * = ( w a ) * ( w a ) 2 ( w a ) = ( w a ) * ( w a ) 2 w x .
We easily check that
( x w ) ( a w ) n + 1 = a [ ( w a ) ] 2 w ( a w ) n + 1 = ( a w ) n a [ ( w a ) n 1 ( w a ) ( w a ) n ] w a ( w a ) [ ( w a ) n ( w a ) ( w a ) n + 1 ] w
Hence, we have
| | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n | | a | | 1 n | | ( w a ) n 1 ( w a ) ( w a ) n | | 1 n | | w | | 1 n + | | a ( w a ) | | 1 n | | ( w a ) n ( w a ) ( w a ) n + 1 | | 1 n | | w | | 1 n .
Therefore
lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0 ,
the result follows. □
Corollary 1.
Let a , w A . Then the following are equivalent:
(1)
The system of conditions
x = a ( w x ) 2 , [ ( w a ) * ( w a ) 2 w x ] * = ( w a ) * ( w a ) 2 w x , lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0 .
is consistent and it has the unique solution given by x = a [ ( w a ) ] 2 .
(2)
w a A .
Proof. ( 1 ) ( 2 ) This is obvious by Theorem 2.1.
( 2 ) ( 1 ) Since w a A , by the argument above, a [ ( w a ) ] 2 satisfies the preceding equations. If x satisfies the system of conditions mentioned above, then w x = ( w a ) . Therefore x = a ( w x ) 2 = a [ ( w a ) ] 2 , as asserted. □
The preceding unique solution x is called the generalized w-group inverse of a, and denote it by a , w . That is, a , w = a [ ( w a ) ] 2 . We use , w to denote the set of all generalized w-group invertible elements in A . By the argument above, we now derive
Corollary 2.
Let a , w A . Then
(1)
a , w = x .
(2)
w a A and ( w a ) = w x .
An element a A has generalized w-Drazin 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 A q n i l .
Such x is unique, if exists, and denote it by a d , w . Evidently, a d , w = ( a w ) d a ( w a ) d (see [4]). Let A d , w be the set of all generalized w-Drazin invertible elements in A .
Theorem 3.
Let a A . Then a A , w if and only if
(1)
a A d , w ;
(2)
there exists x A such that
x = a ( w x ) 2 , [ ( w a ) d ] * ( w a ) 2 w x = [ ( w a ) d ] * w a , lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0 .
Proof. 
⟹ In view of Theorem 2.1, w a A . By virtue of ([2] Theorem 2.2), w a A d . Hence a A d , w . Set x = ( w a ) . Then
x = a ( w x ) 2 , lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0 .
Since ( w a ) = w x , it follows by ([2] Theorem 2.2) that [ ( w a ) d ] * ( w a ) 2 w x = [ ( w a ) d ] * w a , as required.
⟸ Since a A d , w , w a A d . By hypothesis, there exists x A such that
x = a ( w x ) 2 , [ ( w a ) d ] * ( w a ) 2 w x = [ ( w a ) d ] * w a , lim n | | ( a w ) n 1 ( x w ) ( a w ) n | | 1 n 1 = 0 .
Then x w = w a ( w x ) 2 . Moreover, we see that
| | ( w a ) n ( w x ) ( w a ) n + 1 | | 1 n | | w | | 1 n | | ( a x ) n 1 ( x w ) ( a w ) n | | 1 n 1 1 1 n | | a | | 1 n .
Thus, we have
lim n | | ( w a ) n w x ( w a ) n + 1 | | 1 n = 0 .
In light of ([2] Theorem 2.2), w a A . Therefore we complete the proof by Theorem 2.1. □
Corollary 3.
Let a A and k N . Then a A , w if and only if
(1)
a A d , w ;
(2)
there exists x A such that
x = a ( w x ) 2 , [ ( w a ) k ] * ( w a ) 2 w x = [ ( w a ) k ] * w a , lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0 .
Proof. 
⟹ Let x = a , w . In view of Theorem 2.1, we have
x = a ( w x ) 2 , ( w a ) * ( w a ) 2 w x = ( w a ) * w a , lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0 .
We have shown that [ ( w a ) k 1 ] * ( w a ) * ( w a ) 2 w x = [ ( w a ) k 1 ] * ( w a ) * w a . That is, [ ( w a ) k ] * ( w a ) 2 w x = [ ( w a ) k ] * w a , as desired.
⟸ By hypothesis, there exists x A such that
x = a ( w x ) 2 , [ ( w a ) k ] * ( w a ) 2 w x = [ ( w a ) k ] * w a , lim n | | ( a w ) n ( x w ) ( a w ) n + 1 | | 1 n = 0 .
Then [ ( ( w a ) d ) k + 1 ] * [ ( w a ) k ] * ( w a ) 2 w x = [ ( ( w a ) d ) k + 1 ] * [ ( w a ) k ] * w a . Therefore [ ( w a ) d ] * ( w a ) 2 w x = [ ( w a ) d ] * w a , This completes the proof by Theorem 2.4. □
Corollary 4.
Let a A and k N . Then a A if and only if
(1)
a A d ;
(2)
there exists x A such that
x = a x 2 , ( a k ) * a 2 x = ( a k ) * , lim n | | a n x a n + 1 | | 1 n = 0 .
Proof. 
This is obvious by choosing w = 1 in Corollary 2.5. □

3. Representations by Weighted Generalized Core-EP Inverses

Every square complex has core-EP inverse, and so has weighted generalized core-EP inverse (see [17]). Every weighted g-Drazin invertible bounded linear Hilbert operator has weighted generalized core-EP inverse (see [15]). In view of ([2] Theorem 6.1), A , w A , w . Thus, weighted generalized core-EP invertible elements form a rich subclass of weighted generalized group inverse. Let a A , w . The aim of this section is to present the representations of weighted generalized group inverse a , w as a subclass of weighted generalized core-EP inverse.
Theorem 4.
Let a A , w . Then
a , w = a ( ( w a ) ) 3 w a = ( a , w w ) 2 a .
Proof. 
In view of ([3] Corollary 2.2), we have a , w = a [ ( w a ) ] 2 . By virtue of Corollary 2.2, a , w = a [ ( w a ) ] 2 . Applying ([2] Theorem 6.1), we see that ( w a ) = [ ( w a ) ] 2 w a . Thus,
a , w = a [ ( w a ) ] 2 w a [ ( w a ) ] 2 w a = a [ ( w a ) ] 2 ( w a ) w a = a [ ( w a ) ] 3 w a .
On the other hand, we verify that
( a , w w ) 2 a = [ a ( ( w a ) ) 2 w ] 2 a = [ a ( ( w a ) ) 2 w ] [ a ( ( w a ) ) 2 w ] a = a ( ( w a ) ) 3 w a .
Therefore a , w = ( a , w w ) 2 a , as asserted. □
In [15], Mosić and Zhang introduced and studied the weighted weak group inverse for Hilbert space operators. Evidently, weighted weak group inverse and weighted generalized group inverse coincide with each other for a Hilbert space operator as the following shows.
Corollary 5.
Let X be a Hilbert space, W B ( X ) { 0 } and A B ( X ) d , W . Then
A , W = ( A , W W ) 2 A .
Proof. 
This is obvious by Theorem 3.1. □
We are ready to prove:
Theorem 5.
Let a A , w . Then a , w = x if and only if
a ( w x ) 2 = x , a w x = a , w w a .
Proof. 
⟹ In view of Theorem 3.1, x = a ( ( w a ) ) 3 w a . Since w a ( ( w a ) ) 2 = ( w a ) and a , w = a ( ( w a ) ) 2 , we check that
a ( w x ) 2 = a w a ( ( w a ) ) 3 w a w a ( ( w a ) ) 3 w a = a ( ( w a ) ) 2 ( w a ) w a = a ( ( w a ) ) 3 w a = x , a w x = a w a ( ( w a ) ) 3 w a = a ( ( w a ) ) 2 w a = a , w w a ,
as desired.
⟸ By hypothesis, we have
a w x w x = x , a w x = a , w w a .
Then we see that
x = a ( w x ) 2 = ( a w x ) w x = ( a , w w a ) w x = a , w w ( a w x ) = a , w w [ a , w w a ] = ( a , w w ) 2 a
In light of Theorem 3.1, x = a , w , as asserted. □
Corollary 6.
Let a A . Then a = x if and only if
a x 2 = x , a x = a a .
Proof. 
This is obvious by choosing w = 1 in Theorem 3.3. □
In [18], Wang and Chen introduced and studied the weighted weak group inverse for complex matrices. As an immediate consequence of Corollary 3.4, the weak group inverse and generalized group inverse coincide with each other for a square complex matrix.
Corollary 7.
Let A C n × n . Then X = A if and only if X satisfies the system of equations
Preprints 86873 i003
We are ready to prove:
Theorem 6.
Let a A , w . Then the following are equivalent:
(1)
a , w = x .
(2)
a , w w a w x = x , a w x = a , w w a .
(3)
x w a w x = x , a w x = a , w w a , x w a , w = a , w w a , w .
Proof. 
( 1 ) ( 3 ) In view of Theorem 3.3,
a ( w x ) 2 = x , a w x = a , w w a .
By virtue of ([2] Theorem 3.1), a , w w a w a , w = a , w . Applying Theorem 3.1, we have
x w a , w = [ ( a , w w ) 2 a ] w a , w = a , w w [ a , w w a w a , w ] = a , w w a , w .
Then
x w a w x = x w ( a w x ) = ( x w a , w ) w a = ( a , w w a , w ) w a = [ a , w w ] 2 a .
In light of Theorem 3.1, we have x w a w x = x , as desired.
( 3 ) ( 2 ) By hypothesis, we have
a , w w a w x = a , w w ( a w x ) = a , w w ( a , w w a ) = ( a , w w a , w ) w a = ( x w a , w ) w a = x w ( a , w w a ) = x w ( a w x ) = x ,
as required.
( 2 ) ( 1 ) By hypothesis, a , w w a w x = x , a w x = a , w w a . Then a ( w x ) 2 = ( a w x ) w x = ( a , w w a ) w x = x . In view of Theorem 3.3, a , w = x ; hence the result. □
Corollary 8.
Let a A . Then the following are equivalent:
(1)
a = x .
(2)
a a x = x , a x = a a .
(3)
x a x = x , a x = a d a , x a = a w a .
Proof. 
This is obvious by choosing w = 1 in Theorem 3.6. □

4. Characterizations Involving Images and Kernels

Let i m ( a ) = { a r | r A } and k e r ( b ) = { r A | b r = 0 } . The notation p i m ( a ) , k e r ( b ) denotes the idempotent p A such that i m ( p ) = i m ( a ) and k e r ( p ) = k e r ( b ) . We easily check that the preceding idempotent p is uniquely determined by a , b A . The goal of this section is to characterize the weighted generalized group inverse by using involved images and kernels.
Theorem 7.
Let a A , w . Then the following are equivalent:
(1)
a , w = x .
(2)
w a w x = p i m ( w a d , w ) , k e r ( a , w w a ) , i m ( x ) i m ( a d , w ) .
Proof. 
( 1 ) ( 2 ) In view of Theorem 3.1, a , w = a ( ( w a ) ) 3 w a . Then
w a w x = w a w [ a ( ( w a ) ) 3 w a ] = ( w a ) w a .
Let p = w a w x . Then p 2 = ( w a ) w a ( w a ) w a = ( w a ) w a = p . Since a d , w = ( a w ) d a ( w a ) d , we have
p = ( w a ) w a = w [ ( a w ) d ] 2 a w a = w ( a w ) d a = w ( a w ) d a w [ ( a w ) d ] 2 a w a = w ( a w ) d a ( w a ) d w a ;
hence, i m ( p ) i m ( w a d , w ) . On the other hand, we have
w a d , w = w ( a w ) d a ( w a ) d = w a [ ( w a ) d ] 2 w a ( w a ) d = ( w a ) d w a ( w a ) d = p ( w a ) d ,
whence, i m ( w a d , w ) i m ( p ) . Thus i m ( p ) = i m ( w a d , w ) . Likewise, k e r ( p ) = k e r ( a , w w a ) . Moreover, we verify that
x = a ( ( w a ) ) 3 w a = a [ ( w a ) ( w a ( w a ) ) ( 1 , 3 ) ] 3 w a = a [ ( w a ) d ] 3 [ w a ( w a ) ] ( 1 , 3 ) = a w [ ( a w ) d ] 2 a [ ( w a ) d ] 2 [ w a ( w a ) ] ( 1 , 3 ) = [ ( a w ) d a ( w a ) d ] ( w a ) [ w a ( w a ) ] ( 1 , 3 ) = a d , w ( w a ) [ w a ( w a ) ] ( 1 , 3 ) .
This implies that i m ( x ) i m ( a d , w ) , as required.
( 2 ) ( 1 ) By the preceding discussion, x = a , w satisfies
w a w x = p i m ( w a d , w ) , k e r ( a , w w a ) , i m ( x ) i m ( a d , w ) .
Assume that w a w y = p i m ( w a d , w ) , k e r ( a , w w a ) , i m ( y ) i m ( a d , w ) . Then w a w ( x y ) = 0 , and so x y k e r ( w a w ) k e r ( a d , w w a w ) . On the other hand, x y i m ( a d , w ) i m ( a d , w w a w ) . Therefore x y i m ( a d , w w a w ) k e r ( a d , w w a w ) = 0 , and so y = x , thus yielding the result. □
Corollary 9.
Let a A . Then the following are equivalent:
(1)
a = x .
(2)
a x = p i m ( a d ) , k e r ( a a ) , i m ( x ) i m ( a d ) .
Proof. 
We easily obtain the result by choosing w = 1 in Theorem 4.1. □
Theorem 8.
Let a A , w . Then
(1)
a , w = a , w p i m ( w a d , w , k e r ( a , w w a ) .
(2)
a , w = a d , w p i m ( w a d , w , k e r ( a , w w a ) .
(3)
( a w ) 3 ( a w ) d is group invertible and
a , w = [ ( a w ) 3 ( a w ) d ] # a w a , w w a .
Proof. 
( 1 ) In view of Theorem 3.6, we have a , w = a , w w a w a , w . Set q = w a w a , w . By using Theorem 4.1, q = p i m ( w a d , w , k e r ( a , w w a ) , as required.
( 2 ) By virtue of Theorem 3.1, we have
a , w = ( a , w w ) 2 a = a d , w w a w ( a , w w ) 2 a = a d , w [ w a , w w a ] .
In light of Theorem 3.6, a w x = a , w w a ; whence, w a w x = w a , w w a . It follows by Theorem 4.1 that w a w x = p i m ( w a d , w ) . Therefore a , w = a d , w p i m ( w a d , w ) , k e r ( a , w ) w a .
( 3 ) Clearly, [ ( a w ) 3 ( a w ) d ] # = [ ( a w ) d ] 2 . By virtue of Theorem 3.3., we derive
[ ( a w ) 3 ( a w ) d ] # a w a , w w a = [ ( a w ) d ] 2 a w a , w w a = ( a w ) d [ a , w w a ] = ( a w ) d ( a w ) a , w = a , w ,
and so the result is proved. □
As an immediate consequence, we derive
Corollary 10.
Let a A . Then. Then
(1)
a , w = a p i m ( w a d , k e r ( a a ) .
(2)
a , w = a p i m ( a d , k e r ( a a ) .
(2)
a 3 a d is group invertible and
a , w = [ a 3 a d ] # a a d a .
Let A , B M 2 ( A ) . We say that A is simply equivalent to B if A is equivalent to B by a column and a row transformations, i.e.,
1 0 * 1 A 1 * 0 1 = B .
We denote it by A ˙ B .
Theorem 9.
Let a A , w . Then
(1)
there exists a unique x A such that
k e r ( x ) = i m ( w a ) d , x 2 = x , [ ( w a ) d ] * w a x = 0 ;
(2)
there exists a unique y A such that
k e r ( y ) = i m ( a w ) d , y 2 = y , [ ( w a ) d ] * ( w a ) 2 w y = 0 ;
(3)
there exists a unique z A such that
w a w 1 x 1 y z ˙ w a w 0 0 0 .
In this case, a , w = z .
Proof. 
Let x = 1 w a w a , w , y = 1 a , w w a w and z = a , w . One directly checks that equalities in ( 1 ) and ( 2 ) hold. In view of Theorem 3.6, z = z a z = a , w w a w a , w . Then we verify that
1 0 a , w 1 w a w 1 x 1 y z 1 a , w 0 1 = w a w 0 0 0 .
Therefore
w a w 1 x 1 y z ˙ w a w 0 0 0 .
Claim 1. Assume that there exists x A such that k e r ( x ) = i m ( w a ) d , ( x ) 2 = x , [ ( w a ) d ] * w a x = 0 . Then i m ( 1 x ) = k e r ( x ) = i m ( w a ) d . By using ([2] Theorem 3.4), we have i m ( w a ) d = i m ( w a ) . Then i m ( w a ) d = i m ( w a , w ) by Corollary 2.3. Since w a , w = w a , w w a w a , w , we have i m ( w a , w ) = i m ( w a , w w a ) . Thus,
i m ( w a ) d = i m ( w a , w ) = i m ( w a , w w a ) .
Since 1 x and w a , w w a are idempotents, we have
1 x = w a , w w a ( 1 x ) .
In view of Theorem 2.1 and [2, Theorem 6.1], a , w = a [ ( w a ) ] 2 = a [ ( ( w a ) ) 2 ( w a ) ] 2 , and so
w a , w w a = ( w a ) [ ( ( w a ) ) 2 ( w a ) ] 2 = ( w a ) ( w a ) [ ( w a ) ] 2 ( w a ) = [ ( w a ) ] 2 ( w a ) = ( w a ) [ ( w a ) d ] 2 ( ( w a ) d ) ( 1 , 3 ) ( w a ) = ( w a ) ( w a ) d [ ( w a ) d ( ( w a ) d ) ( 1 , 3 ) ] ( w a ) = ( w a ) ( w a ) d [ ( w a ) d ( ( w a ) d ) ( 1 , 3 ) ] * ( w a ) = ( w a ) ( w a ) d [ ( ( w a ) d ) ( 1 , 3 ) ] * [ ( w a ) d ] * ( w a ) .
Hence,
w a , w w a x = ( w a ) ( w a ) d [ ( ( w a ) d ) ( 1 , 3 ) ] * [ ( w a ) d ] * ( w a ) x = 0 .
Therefore 1 x = w a , w w a = 1 x , and so x = x . The uniqueness of x is proved.
Claim 2. Assume that there exists y A such that k e r ( y ) = i m ( a w ) d , ( y ) 2 = y , [ ( w a ) d ] * ( w a ) 2 w y = 0 . Then i m ( 1 y ) = k e r ( y ) = i m ( a w ) d . Since a , w w = a , w w a w a , w w , we see that i m ( a , w w ) = i m ( a , w w a w ) . In view of ([2] Theorem 3.4), we have i m ( a , w w ) i m ( a w ) d . By using Theorem 3.1 and ([1] Theorem 1.2), we directly check that
a , w w a ( w a ) d w = [ a ( ( w a ) ) 3 w a ] w a ( w a ) d w = a [ ( ( w a ) d ) 2 ( ( w a ) d ) ( 1 , 3 ) ] 3 ( w a ) d ( w a ) 2 w = a [ ( w a ) d ] 2 w = ( a w ) d .
and so i m ( a w ) d i m ( a , w w ) . Therefore
i m ( a w ) d = i m ( a , w w ) = i m ( a , w w a w ) .
Since 1 y and a , w w a w are idempotents, we get
1 y = a , w w a w ( 1 y ) .
As in the argument above, we see that
a , w w a w = a [ ( ( w a ) ) 2 ( w a ) ] 2 w a w = a [ ( w a ) ] 2 ( w a ) ( w a ) 2 w = a [ ( w a ) ] 2 [ ( w a ) d ] 2 ( w a ) d ) ( 1 , 3 ) ( w a ) 2 w = a [ ( w a ) ] 2 ( w a ) d [ ( w a ) d ( ( w a ) d ) ( 1 , 3 ) ] ( w a ) 2 w = a [ ( w a ) ] 2 ( w a ) d [ ( w a ) d ( ( w a ) d ) ( 1 , 3 ) ] * ( w a ) 2 w = a [ ( w a ) ] 2 ( w a ) d [ ( ( w a ) d ) ( 1 , 3 ) ] * [ ( w a ) d ] * ( w a ) 2 w .
This implies that
a , w w a w y = a [ ( w a ) ] 2 ( w a ) d [ ( ( w a ) d ) ( 1 , 3 ) ] * [ ( w a ) d ] * ( w a ) 2 w y = 0 .
Accordingly, 1 y = a , w w a w = 1 y ; hence, y = y . The uniqueness of y is proved.
Claim 3. Assume that there exists z A such that
w a w 1 x 1 y z ˙ w a w 0 0 0 .
Then
1 0 * 1 w a w 1 x 1 y z 1 * 0 1 = w a w 0 0 0 .
By the argument above, x = 1 w a w a , w and y = 1 a , w w a w . Then
1 0 * 1 w a w w a w a , w a , w w a w z 1 * 0 1 = w a w 0 0 0 .
Obviously, we have
w a w w a w a , w a , w w a w z = 1 0 a , w 1 w a w 0 0 z a , w w a w a , w 1 a , w 0 1 .
Then
1 0 * 1 w a w 0 0 z a , w w a w a , w 1 * 0 1 = w a w 0 0 0 .
Since 1 * 0 1 1 = 1 * 0 1 , we see that
1 0 * 1 w a w 0 0 z a , w w a w a , w = w a w 0 0 0 1 * 0 1 .
Accordingly, z a , w w a w a , w = 0 , and then z = a , w , thus yielding the result. □
Corollary 11.
Let a A . Then
(1)
there exists a unique x A such that
k e r ( x ) = i m ( a d ) , x 2 = x , ( a d ) * a x = 0 ;
(2)
there exists a unique y A such that
k e r ( y ) = i m ( a d ) , y 2 = y , ( a d ) * a 2 y = 0 ;
(3)
there exists a unique z A such that
a 1 x 1 y z ˙ a 0 0 0 .
In this case, a = z .
Proof. 
This is an immediate consequence of Theorem 4.5. □
Let N ( X ) and R ( X ) represent the null space and range space of a complex matrix X, respectively. As an immediate consequence, we improve ([6] Theorem 4.2) and ([7] Theorem 2.1) as follows.
Corollary 12.
Let A C m × n and W C n × m . Then
(1)
there exists a unique matrix X such that
N ( X ) = R ( W A ) D , X 2 = X , [ ( W A ) D ] * W A X = 0 ;
(2)
there exists a unique matrix Y such that
N ( Y ) = R ( A W ) D , Y 2 = Y , [ ( W A ) D ] * ( W A ) 2 W Y = 0 ;
(3)
there exists a unique matrix Z such that
W A W I X I Y Z ˙ W A W 0 0 0 .
In this case, A , W = Z .
Proof. 
Since very rectangular matrix can be regarded as a subblock of a square matrix by adding some zero entries, the result is true by Theorem 4.5. □

5. weighted Generalized Group Orders

Our main concern in this section is to describe the relations between two elements in a Banach *-algebra by means of weighted generalized group inverses. Let a , b , w A and a A , w . Our starting point is the following:
Definition 1. 
( 1 ) a r , w b if ( a w ) a , w = ( b w ) a , w .
( 2 ) a l , w b if a , w ( w a ) = a , w ( w b ) .
( 3 ) a , w b if a r , w b and a l , w b .
Lemma 1. 
Let a , b , w A and a A , w . Then
(1)
a r , w b if and only if a ( w a ) d = b ( w a ) d .
(2)
a l , w b if and only if ( w a ) ( w a ) 2 = ( w a ) ( w a ) ( w b ) .
Proof. 
( 1 ) ⟹ Since a r , w b , we have ( a w ) a , w = ( b w ) a , w . In view of Theorem 2.1,
a , w = a [ ( w a ) ] 2 .
Then we derive
( a w ) a [ ( w a ) ] 2 = ( b w ) a [ ( w a ) ] 2 .
Since w a [ ( w a ) ] 2 = ( w a ) , we obtain
a ( w a ) = b ( w a ) .
In light of ([2] Theorem 6.1), ( w a ) = [ ( w a ) ] 2 w a . Then we have
a [ ( w a ) ] 2 = a [ ( w a ) ] 2 w a ( w a ) = b [ ( w a ) ] 2 w a ( w a ) = b [ ( w a ) ] 2 .
By virtue of ([15] Theorem 1.2), ( w a ) = [ ( w a ) d ] 2 ( ( w a ) d ) ( 1 , 3 ) , and then [ ( w a ) ] 2 w a = [ ( w a ) d ] 3 . Therefore
a ( w a ) d = a [ ( w a ) d ] 3 ( w a ) 2 = b [ ( w a ) d ] 3 ( w a ) 2 = b ( w a ) d .
⟸ Since a ( w a ) d = b ( w a ) d , we have a ( w a ) d = b ( w a ) d . As ( w a ) = [ ( w a ) d ] 2 ( ( w a ) d ) ( 1 , 3 ) , we get a ( w a ) = b ( w a ) . This implies that
a w a , w = a w a [ ( w a ) ] 2 = a w a [ ( w a ) ] 2 w a ( w a ) = a ( w a ) w a ( w a ) = b ( w a ) w a ( w a ) = b w a [ ( w a ) ] 2 w a ( w a ) = b w a [ ( w a ) ] 2 = b w a , w .
Therefore a r , w b .
( 2 ) Analogously to the preceding discussion, the result follows. □
Lemma 2. 
Let a , b A and a A . Then
(1)
a a = b a if and only if a a d = b a d .
(2)
a a = a b if and only if a a 2 = a a b .
Proof. 
( 1 ) Assume that a a = b a . As in the proof of Lemma 5.2, we have a a d = b a d . Conversely, assume that a a d = b a d . In view of ([15] Theorem 1.2), we have a = [ a ] 2 a = ( a d ) 2 ( a d ) ( 1 , 3 ) a a . Therefore a a = ( a a d ) [ a d ( a d ) ( 1 , 3 ) a a ] = ( b a d ) [ a d ( a d ) ( 1 , 3 ) a a ] = b a , as required.
( 2 ) This is proved in the similar way to the above. □
We are ready to prove:
Theorem 10. 
Let a , b , w A and a A , w . Then
(1)
a , w b .
(2)
a ( w a ) d = b ( w a ) d and ( w a ) ( w a ) 2 = ( w a ) ( w a ) ( w b ) .
(3)
a ( w a ) = b ( w a ) and ( w a ) ( w a ) = ( w a ) ( w b ) .
Proof. 
( 1 ) ( 2 ) This is obvious by combing ( 1 ) and ( 2 ) in Lemma 5.2.
( 2 ) ( 3 ) Since a ( w a ) d = b ( w a ) d , we have w a ( w a ) d = w b ( w a ) d . The implication is obtained by Lemma 5.3.
( 3 ) ( 1 ) Since a ( w a ) = b ( w a ) , by virtue of Lemma 5.3, a ( w a ) d = b ( w a ) d . According to Lemma 5.2, a r , w b . On the other hand, ( w a ) ( w a ) = ( w a ) ( w b ) . Since a , w = a [ ( w a ) ] 2 , we have a , w ( w a ) = a , w ( w b ) . Then a l , w b . So the theorem is true. □
The relation , w is a pre-order as the following shows.
Corollary 13.
If a , w b and b , w c , then a , w c .
Proof. 
In view of Theorem 5.4, we have
a ( w a ) = b ( w a ) , ( w a ) ( w a ) = ( w a ) ( w b ) ; b ( w b ) = c ( w b ) , ( w b ) ( w b ) = ( w b ) ( w c ) .
Then
a ( w a ) = b ( w a ) = b [ w a ( w a ) ] ( w a ) = b ( w b ) [ ( w a ) ] 2 = b w [ b ( w a ) ] ( w a ) = b w [ a ( w a ) ] ( w a ) = b w [ b ( w b ) [ ( w a ) ] 2 ( w a ) = b ( w b ) 2 [ ( w a ) ] 3 = = b ( w b ) n [ ( w a ) ] n + 1 = b [ ( w b ) n ( w b ) d ( w b ) n + 1 ] [ ( w a ) ] n + 1 + b ( w b ) d ( w b ) n + 1 [ ( w a ) ] n + 1 ; c ( w a ) = c [ w a ( w a ) ] ( w a ) = c [ w b ( w a ) ] ( w a ) = c w b [ ( w a ) ] 2 = = c ( w b ) n [ ( w a ) ] n + 1 = c [ ( w b ) n ( w b ) d ( w b ) n + 1 ] [ ( w a ) ] n + 1 + c ( w b ) d ( w b ) n + 1 [ ( w a ) ] n + 1 .
Since b c ( w b ) d = c ( w b ) d and
lim n | | ( w b ) n ( w b ) d ( w b ) n + 1 | | 1 n = lim n | | ( w b ( w b ) d ( w b ) 2 ) n | | 1 n = 0 ,
we see that
lim n | | a ( w a ) c ( w a ) | | 1 n = 0 .
Therefore a ( w a ) = c ( w a ) . By a similar route, we check that ( w a ) ( w a ) = ( w a ) ( w c ) . Therefore a , w c , the corollary is true. □
Let a w , w a A d . Then a A , w and a , w = ( a w ) a ( w a ) . We are now ready to prove the main result of this section.
Theorem 11. 
Let a w , w a A . Then the following statements are equivalent:
(1)
a r , w b if and only if w a w b .
(2)
a l , w b if and only if a w b w .
(3)
a , w b if and only if w a w b and a w b w .
Proof. 
( 1 ) ( 2 ) Since a , w b , we have
( a w ) a , w = ( b w ) a , w , a , w ( w a ) = a , w ( w b ) .
In view of Theorem 2.1, a , w = a [ ( w a ) ] 2 . Hence
( w a ) ( w a ) = w ( a w ) a [ ( w a ) ] 2 = w ( a w ) a , w = w ( b w ) a , w = w ( b w ) a [ ( w a ) ] 2 = ( w b ) ( w a ) .
Furthermore, we check that
( w a ) ( w a ) = w a [ ( w a ) ] 2 ( w a ) = w [ a ( ( w a ) ) 2 ] ( w a ) = w [ a , w ( w b ) ] = w [ a [ ( w a ) ] 2 ( w b ) ] = [ w a ( ( w a ) ) 2 ] ( w b ) = ( w a ) ( w a ) .
Therefore w a w b . Analogously, we show that a w b w , as required.
( 2 ) ( 1 ) Since w a w b and a w b w , we have
( w a ) ( w a ) = ( w b ) ( w a ) , ( w a ) ( w a ) = ( w a ) ( w b ) ; ( a w ) ( a w ) = ( b w ) ( a w ) , ( a w ) ( a w ) = ( a w ) ( b w ) .
In view of ([2] Theorem 2.1),
( a w ) ( a w ) d [ ( a w ) ( a w ) d ] ( 1 , 3 ) = ( a w ) ( a w ) = ( b w ) ( a w ) = ( b w ) ( a w ) d [ ( a w ) ( a w ) d ] ( 1 , 3 ) ,
and so
( a w ) [ ( a w ) d ] 2 ( a w ) ( a w ) d [ ( a w ) ( a w ) d ] ( 1 , 3 ) ( a w ) ( a w ) d = ( b w ) [ ( a w ) d ] 2 ( a w ) ( a w ) d [ ( a w ) ( a w ) d ] ( 1 , 3 ) ( a w ) ( a w ) d .
We infer that a w [ ( a w ) d ] 2 ( a w ) ( a w ) d = b w [ ( a w ) d ] 2 ( a w ) ( a w ) d , hence a w ( a w ) d = b w ( a w ) d . By using Cline’s formula and ([2] Theorem 2.1), we derive
a ( w a ) = a ( w a ) d [ ( w a ) ( w a ) d ] ( 1 , 3 ) = a w [ ( a w ) d ] 2 a [ ( w a ) ( w a ) d ] ( 1 , 3 ) = [ a w ( a w ) d ] ( a w ) d a [ ( w a ) ( w a ) d ] ( 1 , 3 ) = [ b w ( a w ) d ] ( a w ) d a [ ( w a ) ( w a ) d ] ( 1 , 3 ) = b w [ ( a w ) d ] 2 a [ ( w a ) ( w a ) d ] ( 1 , 3 ) = b ( w a ) d [ ( w a ) ( w a ) d ] ( 1 , 3 ) = b ( w a ) .
Since a , w = a [ ( w a ) ] 2 , we verify that
( a w ) a , w = ( a w ) a [ ( w a ) ] 2 = a [ w a ( ( w a ) ) 2 ] = a ( w a ) = b ( w a ) = ( b w ) a [ ( w a ) ] 2 = ( b w ) a , w .
Likewise, we prove that a , w ( w a ) = a , w ( w b ) . Therefore a , w b , as asserted. □
Let p , q A be projections and x A . Then x = p x q + p x ( 1 q ) + ( 1 p ) x q + ( 1 p ) x ( 1 q ) . We write x as in the matrix form:
x = p x q p x ( 1 q ) ( 1 p ) x q ( 1 p ) x ( 1 q ) p × q .
Theorem 12. 
Let a w , w a A . Then the following statements are equivalent:
(1)
a r , w b .
(2)
a , w and b are represented as
a = a 1 a 2 0 a 3 p × q , w = w 1 w 2 0 w 3 q × p , b = a 1 b 2 0 b 3 p × q ,
where
p = ( a w ) ( a w ) , q = ( w a ) ( w a ) , a 1 ( p A q ) 1 , w 1 ( q A p ) 1 , a 3 w 3 ( ( 1 p ) A ( 1 p ) ) q n i l , w 3 a 3 ( ( 1 q ) A ( 1 q ) ) q n i l , ( a 2 b 2 ) w 3 + ( a 1 w 1 ) 1 ( a 1 w 2 + a 2 w 3 ) ( a 3 b 3 ) w 3 = 0 .
Proof. 
Let p = ( a w ) ( a w ) and q = ( w a ) ( w a ) . Then we have
[ 1 ( a w ) ( a w ) ] ( a w ) d = 0 , [ 1 ( w a ) ( w a ) ] ( w a ) d = 0 .
Moreover, we verify that
( 1 p ) a q = [ 1 ( a w ) ( a w ) ] a ( w a ) ( w a ) = [ 1 ( a w ) ( a w ) ] ( a w ) a ( w a ) ( w a ) d ( w a ) = [ 1 ( a w ) ( a w ) ] ( a w ) 3 [ ( a w ) d ] 2 a ( w a ) = [ 1 ( a w ) ( a w ) ] ( a w ) d ( a w ) 2 a ( w a ) = 0 ; ( 1 q ) w p = [ 1 ( w a ) ( w a ) ] w ( a w ) ( a w ) = [ 1 ( w a ) ( w a ) ] ( w a ) d ( w a ) 2 a ( a w ) = 0 ;
a 1 w 1 = ( a w ) ( a w ) a ( w a ) ( w a ) w ( a w ) ( a w ) = ( a w ) ( a w ) a ( w a ) ( w a ) w ( a w ) ( a w ) ( p A p ) 1 ; w 1 a 1 = ( w a ) ( w a ) w ( a w ) ( a w ) ( q A q ) 1 ; a 2 w 2 = [ 1 ( a w ) ( a w ) ] a [ 1 ( w a ) ( w a ) ] w [ 1 ( a w ) ( a w ) ] [ ( 1 p ) A ( 1 p ) ] q n i l ; w 2 a 2 = [ 1 ( w a ) ( w a ) ] w [ 1 ( a w ) ( a w ) ] a [ 1 ( w a ) ( w a ) ] [ ( 1 q ) A ( 1 q ) ] q n i l .
Write b = b 1 b 2 b 4 b 3 p × q . Then we have
a w = a 1 w 1 a 1 w 2 + a 2 w 3 0 a 3 w 3 p × p .
Thus,
( a w ) = ( a 1 w 1 ) 1 ( a 1 w 1 ) 2 ( a 1 w 2 + a 2 w 3 ) 0 0 p × p ,
and so
a w ( a w ) g = 1 ( a 1 w 1 ) 1 ( a 1 w 2 + a 2 w 3 ) 0 0 p × p .
Furthermore, we have
b w = b 1 w 1 b 1 w 2 + b 2 w 3 b 4 w 1 b 4 w 2 + b 3 w 3 p × p .
Then
b w ( a w ) = b 1 w 1 ( a 1 w 1 ) 1 b 1 w 1 ( a 1 w 1 ) 2 ( a 1 w 2 + a 2 w 3 ) b 4 w 1 ( a 1 w 1 ) 1 b 4 w 1 ( a 1 w 1 ) 2 ( a 1 w 2 + a 2 w 3 ) p × p .
Moreover, we have
( a w ) a w = 1 ( a 1 w 1 ) 1 ( a 1 w 2 + a 2 w 3 ) + ( a 1 w 1 ) 2 ( a 1 w 2 + a 2 w 3 ) a 3 w 3 0 0 p × p , ( a w ) b w = 1 ( a 1 w 1 ) 1 ( b 1 w 2 + b 2 w 3 ) + ( a 1 w 1 ) 2 ( a 1 w 2 + a 2 w 3 ) ( b 4 w 2 + b 3 w 3 ) 0 0 p × p .
( 1 ) ( 2 ) By Lemma 5.2 and Lemma 5.3, we have a w ( a w ) = b w ( a w ) , hence, b 1 w 1 ( a 1 w 1 ) 1 = 1 , and so b 1 w 1 = a 1 w 1 . Since w 1 is invertible, we obtain a 1 = b 1 . Since b 4 w 1 ( a 1 w 1 ) 1 = 0 , we see that b + 4 w 1 = 0 , and so b 4 = 0 . On the other hand, we have ( a w ) a w = ( a w ) b w . This implies that
( a 1 w 1 ) 1 ( a 1 w 2 + a 2 w 3 ) + ( a 1 w 1 ) 2 ( a 1 w 2 + a 2 w 3 ) a 3 w 3 = ( a 1 w 1 ) 1 ( b 1 w 2 + b 2 w 3 ) + ( a 1 w 1 ) 2 ( a 1 w 2 + a 2 w 3 ) b 3 w 3 .
Hence,
( a 1 w 2 + a 2 w 3 ) + ( a 1 w 1 ) 1 ( a 1 w 2 + a 2 w 3 ) a 3 w 3 = ( a 1 w 2 + b 2 w 3 ) + ( a 1 w 1 ) 1 ( a 1 w 2 + a 2 w 3 ) b 3 w 3 .
Accordingly, ( a 2 b 2 ) w 3 + ( a 1 w 1 ) 1 ( a 1 w 2 + a 2 w 3 ) ( a 3 b 3 ) w 3 = 0 .
( 2 ) ( 1 ) By direct computations, we have
( a w ) ( a w ) = 1 ( a 1 w 1 ) 1 ( a 1 w 2 + a 2 w 3 ) 0 0 p × p = ( b w ) ( a w ) .
Likewise, we check that ( a w ) ( a w ) = ( b w ) ( a w ) . Therefore a , w b , as asserted. □
Corollary 14.
Let A , B C n × n . Then the following are equivalent:
(1)
A r , W B .
(2)
A , W and B are represented as
A = A 1 A 2 0 A 3 P × Q , W = W 1 W 2 0 W 3 Q × P , B = A 1 B 2 0 B 3 P × Q ,
where
Preprints 86873 i004
Proof. 
This is obvious by Theorem 5.7. □
Analogously, we now derive
Theorem 13. 
Let a w , w a A . Then the following statements are equivalent:
(1)
a l , w b .
(2)
a , w and b are represented as
a = a 1 a 2 0 a 3 p × q , w = w 1 w 2 0 w 3 q × p , b = a 1 w 1 1 w 2 b 4 b 2 b 4 b 3 p × q ,
where
p = ( a w ) ( a w ) , q = ( w a ) ( w a ) , a 1 ( p A q ) 1 , w 1 ( q A p ) 1 , a 3 w 3 ( ( 1 p ) A ( 1 p ) ) q n i l , w 3 a 3 ( ( 1 q ) A ( 1 q ) ) q n i l , w 3 b 4 = 0 , b 2 = a 2 + w 1 1 w 2 ( a 3 b 3 ) + ( w 1 a 1 w 1 ) 1 ( w 1 a 2 + w 2 a 3 ) w 3 ( a 3 b 3 ) .

References

  1. H. Chen and M. Sheibani, On generalized core-EP invertibility in a Banach algebraa, arXiv:2309.09862 [math.FA]. arXiv:2309.09862 [math.FA]. [CrossRef]
  2. H. Chen and M. Sheibani, Generalized group inverse in a Banach *-algebra, preprint, 2023. [CrossRef]
  3. H. Chen and M. Sheibani, Weighted generalized core-EP inverse in Banach *-algebras, preprint, 2023. [CrossRef]
  4. A. Dajić and J.J. Koliha, The weighted g-Drazin inverse for operators, J. Australian Math. Soc., 82(2007), 163–181.
  5. D.E. Ferreyra; V. Orquera and N. Thome, A weak group inverse for rectangular matrices, RACSAM. 2019. [CrossRef]
  6. D.E. Ferreyra; V. Orquera and N. Thome, Representation s of weighted WG inverse and a rank equation’s solution, Linear and Multilinear Algebra, 71(2023), 226–241.
  7. J. Marovt and Mosic, On some orders in *-rings based on the core-EP decompositions, J. Algebra Appl. 2022. [CrossRef]
  8. D. Mosić, Weighted binary relations for operators on Banach spaces, Aequat. Math., 90(2016), 787–798.
  9. D. Mosić, Core-EP pre-order of Hilbert space operators, Quaest. Math., 41(2018), 585–600.
  10. D. Mosić, Weighted core-EP inverse of an operator between Hilbert spaces, Linear Multilinear Algebra, 67(2019), 278–298.
  11. D. Mosić, Core-EP inverse in ring with involution, Publ. Math. Debrecen, 96(2020), 427–443.
  12. D. Mosić, Weighted core-EP inverse and weighted core-EP pre-orders in a C*-algebra, J. Aust. Math. Soc., 111(2021), 76–110.
  13. D. Mosic, Core-EP inverses in Banach algebras, Linear Multilinear Algebra, 69(2021), 2976–2989.
  14. D. Mosic and D.S. Djordjevic, The gDMP inverse of Hilbert space operators, J. Spectral Theory, 8(2018), 555–573.
  15. D. Mosic and Z. Daochang, Weighted weak group inverse for Hilbert space operators, Front. Math. China, 15(2020), 709–726.
  16. D. Mosic; P.S. Stanimirovic, Representations for the weak group inverse, Appl. Math. Comput., 397(2021), Article ID 125957, 19 p.
  17. H. Wang, Core-EP decomposition and its applications, Linear Algebra Appl., 508(2016), 289–300.
  18. H. Wang; J. Chen, Weak group inverse, Open Math., 16(2018), 1218–1232.
  19. M. Zhou; J. Chen and Y. Zhou, Weak group inverses in proper *-rings, J. Algebra Appl. 2020; 19. [CrossRef]
  20. M. Zhou; J. Chen; Y. Zhou and N. Thome, Weak group inverses and partial isometries in proper *-rings, Linear and Multilinear Algebra, 70(2021), 1–16.
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

© 2024 MDPI (Basel, Switzerland) unless otherwise stated