Preprint
Article

This version is not peer-reviewed.

The Weighted ω-Core Inverse and Its Associated Decomposition

Submitted:

23 July 2025

Posted:

23 July 2025

You are already at the latest version

Abstract
We introduce the weighted w-core inverse in a Banach algebra and establish its fundamental properties. We examine its connections to the ω-core inverse and explore element associated with the decomposition of the weighted ω-core inverse. This foundation allows for the investigation of a novel generalized inverse formed by integrating the core and w-group inverse.
Keywords: 
;  ;  ;  

1. Introduction

A Banach algebra A is called a Banach *-algebra if there exists an involution * : x x * satisfying ( x + y ) * = x * + y * , ( λ x ) * = λ ¯ x * , ( x y ) * = y * x * , ( x * ) * = x . An element a in a Banach *-algebra A has group inverse if and only if there exist x A such that
x a 2 = a , a x 2 = x , a x = x a .
If such x exists, it is unique, and denote it by a # .
An element a in a Banach *-algebra A has core inverse if and only if there exist x A such that
x a 2 = a , a x 2 = x , ( a x ) * = a x .
If such x exists, it is unique, and denote it by a # . Group and core inverses are extensively studied by many authors from different views, e.g. [1,7,10,16,19].
An element a A has w-group inverse if there exist x A such that
x ( w a ) 2 = a , a ( w x ) 2 = x , a w x = x w a .
We denote the preceding x by a w # . The set of all w-group invertible elements in A is denoted by A w # .
In [24], Zhu et al. introduced and studied a weighted generalized inverse as a generalization of core inverse. Let a , w A . An element a A is w-core invertible if there exists some x A such that
a w x 2 = x , x a w a = a , ( a w x ) * = a w x .
Such an x is called a w-core inverse of a.
Many properties of w-core inverse are presented by many authors, e.g. [8,20,22,24]. However, a w-core invertible element in a Banach algebra is not necessarily w-group invertible. This observation motivates the introduction and study of a new weighted generalized inverse that combines core and w-group inverses.
Definition 1. 
An element a A is weighted w-core invertible if there exist x A such that
x ( w a ) 2 = a , a ( w x ) 2 = x , ( a w x w ) * = a w x w .
Such x is called the weighted w-core inverse of a and denoted by a w , # . Let A w , # denote the set of all weighted w-core invertible elements in A .
In Section 2, we characterize the weighted core inverse by the solution of equation systems. We establish the polar-like property of this new generalized inverse. We prove that a A w , # if and only if there exists a projection p A such that
p a = 0 , 1 p A w a n d a w + p A 1 .
In Section 3, we examine the connections between the weighted w-core inverse and related generalized inverses. If a , x and w satisfy the equations a = a w x w a and ( a w x w ) * = a w x w , then x is called weighted w- ( 1 , 3 ) -inverse of a and is denoted by a w ( 1 , 3 ) . We use A w ( 1 , 3 ) to stand for sets of all weighted w- ( 1 , 3 ) -invertible elements in A . We prove that a A w , # if and only if a A w # A w ( 1 , 3 ) . Consequently, many equivalent properties of the weighted w-core inverse are presented.
Finally, in Section 4, we focus on the decomposition associated with the weighted w-core inverse.
Definition 2. 
An element a A has generalized weighted w-core decomposition if there exist z , y A such that
a = z + y , z * y = y w z = 0 , z A w , # , y A q n i l .
Let A w , d be the set of all elements having generalized weighted w-core decomposition in A . We prove that a A w , d if and only if there exists z A such that
a ( w x ) 2 = x , x w ( a w ) 2 x = a w x , ( a w x w ) * = a w x w , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
The preceding x is called the generalized weighted w-core inverse of a, and denoted by a w , d . We then characterize this generalized inverse of the preceding decomposition from multiple perspectives. An element a A has generalized w-Drazin inverse x if there exists unique x A such that
a ( w x ) 2 = x , a w x = x w a , a n d a w ( a w ) ( x w ) ( a w ) A q n i l .
We denote x by a d , w (see [11]). We finally establish the identity a w , d = [ a d , w w ] 2 ( a d , w ) w , # .

2. Weighted w-Core Inverse

The aim of this section is to first introduce the weighted w-core inverse and present several of its fundamental properties.
Theorem 1. 
Let a A . Then the following are equivalent:
(1)
a A w , # .
(2)
There exists x A such that
x ( w a ) 2 = a , a ( w x ) 2 = x , a w x w a = a , x w a w x = x , ( a w x w ) * = a w x w .
Proof. ( 1 ) ( 2 ) By hypothesis, there exists x A such that x ( w a ) 2 = a , a ( w x ) 2 = x , ( a w x w ) * = a w x w . One directly verify that
a w x w a = a w x w x ( w a ) 2 = a ( w x ) 2 ( w a ) 2 = x ( w a ) 2 = a , x w a w x = x w a w a ( w x ) 2 = [ x ( w a ) 2 ] ( w x ) 2 = a ( w x ) 2 = x ,
as required.
( 2 ) ( 1 ) This is trivial. □
Corollary 1. 
Let a A w , # . Then a A w # and a w # = [ a w , # w ] 2 a .
Proof. 
Let x = a w , # . By virtue of Theorem 2.1,
x ( w a ) 2 = a , a ( w x ) 2 = x , ( a w x w ) * = a w x w , a w x w a = a , x w a w x = x .
Let y = ( x w ) 2 a . Then we verify that
a w y w a = a w ( x w ) 2 a w a = a ( w x ) 2 w a w a = x ( w a ) 2 = a , y w a w y = ( x w ) 2 a w a w ( x w ) 2 a = ( x w ) 2 a w a ( w x ) 2 w a = x w x w ( a w x w a ) = ( x w ) 2 a = y , a w y = a w ( x w ) 2 a = a ( w x ) 2 w a = x w a = x w x ( w a ) 2 = ( x w ) 2 a w a = y w a .
This implies that a w # = y , as desired. □
If a , x and w satisfy the equations a = a w x w a and ( a w x w ) * = a w x w , then x is called weighted w- ( 1 , 3 ) -inverse of a and is denoted by a w ( 1 , 3 ) . We use A w ( 1 , 3 ) to stand for sets of all weighted w- ( 1 , 3 ) -invertible elements in A .
Theorem 2. 
Let a A . Then the following are equivalent:
(1)
a A w , # .
(2)
a A w # A w ( 1 , 3 ) .
In this case, a w , # = a w # w a w a w ( 1 , 3 ) .
Proof. ( 1 ) ( 2 ) By virtue of Corollary 2.2, a A w # . Let x = a w , # . In view of Theorem 2.1, there exists x A such that x ( w a ) 2 = a , a ( w x ) 2 = x , a w x w a = a , x w a w x = x , ( a w x w ) * = a w x w . Hence, a A w ( 1 , 3 ) , as desired.
( 2 ) ( 1 ) Let x = a w # w a w a w ( 1 , 3 ) . Then we check that
a w x w = a w a w # w a w a w ( 1 , 3 ) w = a w a w ( 1 , 3 ) w , w a w x = w a w a w # w a w a w ( 1 , 3 ) , ( a w x w ) * = a w x w , a ( w x ) 2 = ( a w x w ) x = a w a w ( 1 , 3 ) w ( a w # w a ) w a w ( 1 , 3 ) = a w a w ( 1 , 3 ) w ( a w a w # ) w a w ( 1 , 3 ) = ( a w a w # ) w a w ( 1 , 3 ) = ( a w # w a ) w a w ( 1 , 3 ) = x , x ( w a ) 2 = a w # w a w a w ( 1 , 3 ) w a w a = a w a w # w a w a w ( 1 , 3 ) w a = a w a w ( 1 , 3 ) w a = a .
Therefore a w , # = x , as asserted. □
Corollary 2. 
Let a A . Then the following are equivalent:
(1)
a A w , # .
(2)
a A w # and there exists x A such that x ( w a ) 2 = a , ( a w x w ) * = a w x w .
(3)
a A w # and there exists x A such that x ( w a ) = a w # w a , ( a w x w ) * = a w x w .
Proof. ( 1 ) ( 2 ) This is obvious by Theorem 2.1.
( 2 ) ( 3 ) By hypothesis, there exists x A such that x ( w a ) 2 = a , ( a w x w ) * = a w x w . Hence, x ( w a ) = x w ( a w a w # w a ) = x w ( a w ) 2 a w # = x ( w a ) 2 w a w # = a w a w # = a w # w a , as required.
( 3 ) ( 1 ) By assumption, a A w # and there exists x A such that x ( w a ) = a w # w a , ( a w x w ) * = a w x w . Then a w x w a = a w a w # w a = a , and so a A w ( 1 , 3 ) . Therefore we complete the proof by Theorem 2.3. □
Lemma 1. 
Let a A . Then the following are equivalent:
(1)
a A # .
(2)
a a 2 A A a 2 .
(3)
a A d and A a = A a 2 .
(4)
a A d and a A = a 2 A .
Proof. ( 1 ) ( 3 ) This direction is obvious.
( 3 ) ( 2 ) Write a = x a 2 for some x A . Then we have
a a 2 a d = x n a n + 1 a 2 a d = x n a ( a n a n + 1 a d ) + x n a n + 2 a d a 2 a d = x n a ( a n a n + 1 a d ) + ( x n a n + 1 ) a a d a 2 a d = x n a ( a n a n + 1 a d ) .
Hence,
a a 2 a d 1 n x a 1 n a n a n + 1 a d 1 n .
This implies that lim n a a 2 a d 1 n = 0 , and so a = a 2 a d . Thus a a 2 A A a 2 , as required.
( 2 ) ( 1 ) Write a = a 2 r = s a 2 for some r , s A . We directly verify that a # = r + s r a s , as required.
( 1 ) ( 4 ) This is obvious by the symmetry. □
Lemma 2. 
Let a A . Then a A w # if and only if a w , w a A # and ( a w ) # a w a = a . In this case,
a w # = ( a w ) # a ( w a ) # , ( a w ) 2 a w # = a a n d a [ w a w # ] 2 = a w # .
Proof. 
⟹ Let x = a w # . Then
a w x w a = a , x w a w x = x , a w x = x w a .
Hence, ( a w ) 2 x = a w ( a w x ) = ( a w ) x ( w a ) = a , and so ( a w ) 2 x w = a w . Likewise, x w ( a w ) 2 = a w . This implies that a w A # . Moreover, we have a [ w a w # ] 2 = a ( w x ) 2 = ( a w x ) w x = ( x w a ) w x = x , as desired.
⟸ Set x = ( a w ) # a ( w a ) # . Then we verify that
a w x = a w ( a w ) # a ( w a ) # = ( a w ) # a ( w a ) # w a = x w a , x ( w a ) 2 = ( x w a ) w a = ( a w ) # a ( w a ) # ( w a ) 2 = ( a w ) # a w a = a , a ( w x ) 2 = ( a w ) # a ( w a ) # w ( a w x ) = ( a w ) # a ( w a ) w [ ( a w ) # ] 2 a ( w a ) # = ( a w ) # a ( w a ) # = x .
Therefore a w # = x , as asserted. □
Lemma 3. 
Let a A . If a A = ( a w ) 2 A , then the following are equivalent:
(1)
a A w , # .
(2)
There exists x A such that
x ( w a ) 2 = a , x w a w x = x , ( a w x w ) * = a w x w .
Proof. ( 1 ) ( 2 ) This is clear by Theorem 2.1.
( 2 ) ( 1 ) Since x ( w a ) 2 = a , we have A a = A ( w a ) 2 = A ( w a ) . Obviously, ( w a ) 2 A ( w a ) A . Write a = ( a w ) 2 z for a z A . Then w a = w ( a w ) 2 z = ( w a ) 2 w z ( w a ) 2 A . This implies that ( w a ) A = ( w a ) 2 A . Hence, w a A # . By hypothesis, we have ( a w ) A = ( a w ) 2 A . Obviously, A ( a w ) 2 A ( a w ) . As a = x ( w a ) 2 , we deuce that a w = x w ( a w ) 2 A ( a w ) 2 ; hence, A ( a w ) A ( a w ) 2 . Thus A ( a w ) = A ( a w ) 2 ; hence, a w A # by Lemma 2.5. Since x w ( a w ) 2 = a w , we have x w ( a w ) = a w ( a w ) # . Then ( a w ) # a w a = x w a w a = x ( w a ) 2 = a . In light of Lemma 2.6, a A w # and a w # = ( a w ) # a ( w a ) # .
Since x ( w a ) 2 = a , we have w x ( w a ) 2 = w a ; and so w x ( w a ) = w a ( w a ) # . This implies that w x ( w a ) 2 = w a ( w a ) # w a = w a . Thus, we derive that a = a ( w a ) w z = a [ w x ( w a ) 2 ] w z = a w x w [ ( a w ) 2 z ] = a w x w a . Thus, a A w ( 1 , 3 ) . Therefore a A w , # by Theorem 2.3. □
Lemma 4. 
Let a A . If A a = A ( w a ) 2 , then the following are equivalent:
(1)
a A w , # .
(2)
There exists x A such that
a ( w x ) 2 = x , a w x w a = a , ( a w x w ) * = a w x w .
Proof. ( 1 ) ( 2 ) This is obvious by Theorem 2.1.
( 2 ) ( 1 ) By hypothesis, A ( w a ) = A a = A ( w a ) 2 . Clearly, ( w a ) 2 A w a A . On the other hand, w a = w ( a w x w a ) = w a w [ a ( a x ) 2 ] w a ( w a ) 2 A ; hence, w a A ( a w ) 2 A . This implies that ( w a ) A = ( w a ) 2 A . Hence, w a A # by Lemma 2.5. Set z = a ( w a ) # w x . Since A a = A ( w a ) 2 , we have a ( w a ) # w a = a . Then we verify that
a w z = a w a ( w a ) # w x = a w a ( w a ) # w a ( w x ) 2 = a w a ( w x ) 2 = a w x , ( a w z w ) * = ( a w x w ) * = a w x w = a w z w , a ( w z ) 2 = ( a w z ) w z = a w x w a ( w a ) # w x = a ( w a ) # w x = z , z ( w a ) 2 = a ( w a ) # w x ( w a ) 2 = a [ ( w a ) # ] 2 w [ a w x w a ] w a = a [ ( w a ) # ] 2 ( w a ) 2 = a ( w a ) # w a = a .
Therefore a A w , # , as asserted. □
We are ready to prove:
Theorem 3. 
Let a A w # . Then the following are equivalent:
(1)
a A w , # .
(2)
There exists x A such that
a ( w x ) 2 = x , a w x w a = a , ( a w x w ) * = a w x w .
(3)
There exists x A such that
x ( w a ) 2 = a , x w a w x = x , ( a w x w ) * = a w x w .
Proof. 
Since a A w # , we see that a ( a w ) 2 A A ( w a ) 2 . Therefore we complete the proof by Lemma 2.7 and Lemma 2.8. □
We come now to present a polar-like property for weighted w-core inverse in a Banach *-algebra.
Theorem 4. 
Let a , w A . Then the following are equivalent:
(1)
a A w , # .
(2)
There exists a projection p A such that
p a = 0 , 1 p A w a n d ( 1 p ) a w ( 1 p ) ( 1 p ) A ( 1 p ) 1 .
(3)
There exists a projection p A such that
p a = 0 , 1 p A w a n d a w + p A 1 .
Proof. ( 1 ) ( 2 ) Since a A w , # , there exists x A such that
x ( w a ) 2 = a , a ( w x ) 2 = x , ( a w x w ) * = a w x w , a w x w a = a , x w a w x = x .
Let p = 1 a w x w . Then p 2 = p = p * and 1 p A w . Obviously, p a = ( 1 a w x w ) a = 0 . Moreover, we check that
( 1 p ) a w ( 1 p ) = a w ( 1 p ) = a w a w x w , ( 1 p ) a w ( 1 p ) x w = a w a ( w x ) 2 w = a w x w , x w ( 1 p ) a w ( 1 p ) = x ( w a ) 2 w x w = a w x w .
Then ( 1 p ) a w ( 1 p ) 1 = x w ( 1 p ) A ( 1 p ) .
( 2 ) ( 3 ) By hypothesis, there exists a projection p A such that p a = 0 , 1 p A w and ( 1 p ) a w ( 1 p ) ( 1 p ) A ( 1 p ) 1 . Let x = ( 1 p ) a w ( 1 p ) 1 ( 1 p ) A ( 1 p ) . Then a w ( 1 p ) + p 1 = ( 1 p ) a w ( 1 p ) 1 + p = x + p . Hence, 1 + ( a w 1 ) ( 1 p ) A 1 . By using Jacobson’s Lemma, 1 + ( 1 p ) ( a w 1 ) A 1 . Therefore a w + p A 1 , as desired.
( 3 ) ( 1 ) By hypothesis, there exists a projection p A such that p a = 0 , 1 p A w and a w + p A 1 . Then 1 + ( 1 p ) a w ( 1 p ) = 1 + ( 1 p ) ( a w 1 ) A 1 . By Jacobson’s Lemma, we prove that a w ( 1 p ) + p = 1 + ( a w 1 ) ( 1 p ) A 1 . Then ( 1 p ) a w ( 1 p ) ( 1 p ) A ( 1 p ) 1 . As ( 1 p ) a w ( 1 p ) 1 A ( 1 p ) A w . Write ( 1 p ) a w ( 1 p ) 1 = x w for some x ( 1 p ) A . Then ( 1 p ) a w ( 1 p ) x w = ( 1 p ) a w ( 1 p ) ( 1 p ) a w ( 1 p ) 1 = 1 p . Since p a = 0 and ( 1 p ) x = x , we have a w x w = ( 1 p ) a w ( 1 p ) x w = 1 p . Then ( a w x w ) * = ( 1 p ) * = 1 p = a w x w . Moreover, we check that
x ( w a ) 2 = x w a w a = ( 1 p ) a w ( 1 p ) 1 a w a = ( 1 p ) a w ( 1 p ) 1 ( 1 p ) a w ( 1 p ) a = ( 1 p ) a = a , a ( w x ) 2 = ( a w ) ( x w ) x = ( a w ) ( 1 p ) a w ( 1 p ) 1 x = ( 1 p ) ( a w ) ( 1 p ) ( 1 p ) a w ( 1 p ) 1 x = ( 1 p ) x = x .
Therefore a w , # = x , as required. □
Corollary 3. 
Let a , w A . Then the following are equivalent:
(1)
a A w , # .
(2)
There exists a unique projection p A such that
p a = 0 , 1 p A w a n d a w + p A 1 .
Proof. ( 1 ) ( 2 ) As in the proof of Theorem 2.10, p = 1 a w a w , # w . Obviously, a w , # w = ( a w ) # . Obviously, ( a w ) # is unique (see [16]). Thus p is unique, as desired.
( 2 ) ( 1 ) This is proved by Theorem 2.8. □

3. Connections to Related Generalized Inverses

In [9], Mary presented the existence criterion for the inverse along an element by the intersection of ideals, i.e, a is invertible along w if and only if w w a w A A w a w .
Lemma 5. 
Let a A . Then the following are equivalent:
(1)
a A w , # .
(2)
w A | | a and a A w ( 1 , 3 ) .
Proof. ( 1 ) ( 2 ) Let x = a w , # . In view of Theorem 2.1, we have
x ( w a ) 2 = a , a ( w x ) 2 = x , a w x w a = a , x w a w x = x , ( a w x w ) * = a w x w .
Then a = a w x w a = a w a ( w x ) 2 w a = ( a w a ) w x w x w a a w a A . On the other hand, we have a = a w x w a = a w x w x ( w a ) 2 = a w ( x w ) 2 ( a w a ) A a w a . Thus, a a w a A A a w a . By virtue of [9], w A | | a . In light of Theorem 2.3, a A w ( 1 , 3 ) , as required.
( 2 ) ( 1 ) Since a A w ( 1 , 3 ) , we can find x A such that a = a w x w a and ( a w x w ) * = a w x w .
As w A | | a , it follows by [9] that w w a w A A w a w . Then a w ( a w ) 2 A and w a A ( w a ) 2 .
Since a w = ( a w x w a ) w = a w x ( w a ) w A ( w a w a ) w A ( a w ) 2 . Hence, a w ( a w ) 2 A A ( a w ) 2 . In view of Lemma 2.5, a w A # . Then a w A d . By using Cline’s formula, w a A d . By using Lemma 2.5 again, w a A # .
Set z = ( a w ) # a ( w a ) # . By using Cline’s formula, we check that
a w z = a w ( a w ) # a ( w a ) # = a ( w a ) # = a w [ ( a w ) d ] 2 a = ( a w ) d a = ( a w ) # a = ( a w ) # a ( w a ) # w a = z w a , a w z w a = a ( w a ) # w a = a , z w a w z = ( a w ) # a w z = z .
Therefore a A w # . According to Theorem 2.3, a A w , # , as asserted. □
Theorem 5. 
Let a A . Then the following are equivalent:
(1)
a A w , # .
(2)
a A w # A w ( 1 , 3 ) .
Proof. ( 1 ) ( 2 ) In view of Lemma 3.1, w A | | a and a A w ( 1 , 3 ) . Then we can find x A such that a = a w x w a and ( a w x w ) * = a w x w . This implies that a A ( 1 , 3 ) . By virtue of [24], a A w # .
( 2 ) ( 1 ) In view of [24], w A | | a . This completes the proof by Theorem 2.3. □
Corollary 4. 
Let a A and w A 1 . Then the following are equivalent:
(1)
a A w , # .
(2)
a A w # .
Proof. 
Since w A 1 , we prove that a A w ( 1 , 3 ) if and only if a w A ( 1 , 3 ) . Therefore we obtain the result by Theorem 3.2. □
Corollary 5. 
Let a A and n 2 . Then the following are equivalent:
(1)
a A w , # .
(2)
a A w ( 1 , 3 ) and a ( a w ) n a A A a ( w a ) n .
Proof. ( 1 ) ( 2 ) In view of Theorem 3.2, a A w # A w ( 1 , 3 ) . By virtue of [8], a ( a w ) n a A A a ( w a ) n .
( 2 ) ( 1 ) In light of [8], a A w # . This completes the proof by Theorem 3.2. □
Corollary 6. 
Let a A and n 2 . Then the following are equivalent:
(1)
a A w , # .
(2)
a A # , w ( a w ) n 1 .
Proof. ( 1 ) ( 2 ) By virtue of Theorem 3.2, a A w # A w ( 1 , 3 ) . It follows by [8] that a A w ( a w ) n 1 # . Set x = a w , # . Then ( a w ) n ( x w ) n = ( a w ) ( x w ) and ( w x ) n ( w a ) n = ( w x ) ( w a ) . Hence,
a = a w x w a = ( a w ) n ( x w ) n a = ( a w ) n ( x w ) n 2 x ( w x ) ( w a ) = ( a w ) n ( x w ) n 2 x ( w x ) n ( w a ) n = a w ( a w ) n 1 ( x w ) n 2 ( x w ) n x w ( a w ) n 1 a = a w ( a w ) n 1 [ ( x w ) n 2 ( x w ) n x ] w ( a w ) n 1 a = a w ( a w ) n 1 z w ( a w ) n 1 a ,
where z = ( x w ) n 2 ( x w ) n x . Moreover, we have
a w ( a w ) n 1 z w ( a w ) n 1 = ( a w ) n [ ( x w ) n 2 ( x w ) n x ] w ( a w ) n 1 = ( a w ) n ( x w ) n ( x w ) n 1 ( a w ) n 1 = ( a w ) ( x w ) ( x w ) ( a w ) = a w x w ,
and so ( a w ( a w ) n 1 z w ( a w ) n 1 ) * = a w ( a w ) n 1 z w ( a w ) n 1 . This implies that a A w ( a w ) n 1 ( 1 , 3 ) . According to Theorem 3.2, a A # , w ( a w ) n 1 .
( 2 ) ( 1 ) In view of Theorem 3.2, a A w ( a w ) n 1 # A w ( a w ) n 1 ( 1 , 3 ) . By using [8], a A w # . Set x = a w ( a w ) n 1 ( 1 , 3 ) . Then a w ( a w ) n 1 x w ( a w ) n 1 a = a , ( a w ( a w ) n 1 x w ( a w ) n 1 ) * = a w ( a w ) n 1 x w ( a w ) n 1 . Let y = ( a w ) n 1 x ( w a ) n 1 . then a w y w a = a and ( a w y w ) * = a w y w . This implies that a A w ( 1 , 3 ) . By using Theorem 3.2 again, a A w , # , as asserted. □
Lemma 6. 
Let a A . Then the following are equivalent:
(1)
a A w ( 1 , 3 ) .
(2)
a w A ) w * a * a .
Proof. ( 1 ) ( 2 ) Since a A w ( 1 , 3 ) , we can find some x A such that a = a w x w a and ( a w x w ) * = a w x w . Hence a = ( a w x w ) a = ( a w x w ) * a = ( w x w ) * a * a w A ) w * a * a , as desired.
( 2 ) ( 1 ) Write a = ( w x w ) * a * a for some x A . Then a = ( a w x w ) * a , and so a w x w = ( a w x w ) * a w x w . This implies that ( a w x w ) * = a w x w . Therefore a = ( a w x w ) * a = a w x w a , as required. □
Lemma 7. 
Let a A . Then the following are equivalent:
(1)
a A w , # .
(2)
a w * A ( a w a ) * a A ( a w a ) .
Proof. ( 1 ) ( 2 ) In view of Lemma 3.1, w A | | a and a A w ( 1 , 3 ) . By virtue of [9], a a w a A A a w a . According to Lemma 3.6, we have a w A w * a * a . Write a = a w a s = ( w t w ) * a * a for some s , t A . Then a = ( w t w ) * ( a w a s ) * a = w * ( w t ) * s * ( a w a ) * a w * A ( a w a ) * a , as desired.
( 2 ) ( 1 ) Since a w * A ( a w a ) * a A ( a w a ) , we have a w * A a * w * a * a ; hence, a ( w A w ) * a * a . In view of Lemma 3.6, a A w ( 1 , 3 ) .
Write a = w * r ( a w a ) * a for some r A . Then a * = a * ( a w a ) r * ; hence, a * a = a * a ( w a r * a ) . Accordingly, a = [ w * r ( w a ) * ] ( a * a ) = [ w * r ( w a ) * ] ( a * a ) ( w a r * a ) = ( a w a ) r * a a w a A . In light of [9], w A | | a . According to Lemma 3.1, a A w , # . □
We are ready to prove:
Theorem 6. 
Let a A and n 2 . Then the following are equivalent:
(1)
a A w , # .
(2)
a w * A ( a w ) n * a A ( a w ) n 1 a .
Proof. ( 1 ) ( 2 ) In view of Theorem 3.2, a A w # . By using [8], a A ( a w ) n * a A ( a w ) n 1 a . It follows by Lemma 3.7 that a w * A ( a w a ) * a A ( a w a ) . Hence, a w * A a w * A ( a w ) n * a . Therefore a w * A ( a w ) n * a A ( a w ) n 1 a .
( 2 ) ( 1 ) By hypothesis, we have a A ( a w ) n * a A ( a w ) n 1 a . In light of [8], a A w # . Moreover, we have a w * A ( a w ) n * a ( w A w ) * ( a * a ) . According to Lemma 3.6, a A w ( 1 , 3 ) . Therefore a A w , # by Theorem 3.2. □
Corollary 7. 
Let a , w A and n N . Then the following are equivalent:
(1)
a A w , # .
(2)
There exists a projection p A such that p a = 0 , 1 p A w a n d ( a w ) n + p A 1 .
Proof. ( 1 ) ( 2 ) Let p = 1 a w a w , # w . Then p 2 = p = p * A , p a = 0 and 1 p A w . Set x = a w , # . Then we verify that
( ( a w ) n a w x w ) ( ( x w ) n x w a w ) = ( a w ) n ( x w ) n + ( a w ) n 1 [ a w a w x w a w ] [ x w a w ( x w ) 2 ] ( x w ) n 1 + ( 1 a w x w ) ( 1 x w a w ) = a w x w + ( 1 a w x w ) ( 1 a w x w ) x w a w = 1 , ( ( x w ) n x w a w ) ( ( a w ) n a w x w ) = ( x w ) n ( a w ) n + ( x w ) n 1 [ x w x w a w x w ] + [ a w x w ( a w ) 2 ] ( a w ) n 1 + ( 1 x w a w ) ( 1 a w x w ) = x w a w + ( 1 x w a w ) [ a w x w ( a w ) 2 ] x w = 1 .
Therefore ( a w ) n + p = ( a w ) n + 1 a w x w A 1 , as desired.
( 2 ) ( 1 ) Case 1. n = 1 . This is proved by Theorem 2.10.
Case 2. n 2 . By hypothesis, there exists a projection p A such that
p a = 0 , 1 p A w a n d u : = ( a w ) n + p A 1 .
Then ( a w ) n a = u a , and then a = u 1 ( a w ) n a m a t h c a l A ( a w ) n 1 a . Moreover, we have ( ( a w ) n ) * + p = u * ; hence, ( ( a w ) n ) * a = u * a . This implies that a = ( u * ) 1 ( ( a w ) n ) * a . Since p a = 0 , we deduce that a = ( 1 p ) a ( 1 p ) * ( u * ) 1 ( ( a w ) n ) * a w * A ( ( a w ) n ) * a . Thus, a w * A ( a w ) n * a A ( a w ) n 1 a . Therefore we complete the proof by Theorem 3.8. □

4. The Associated Decomposition

In this section, we focus on the decomposition associated with the weighted w-core inverse. We now characterize generalized weighted w-core invertibility through a system of equations.
Theorem 7. 
Let a A . Then the following are equivalent:
(1)
a A w , d .
(2)
There exists x A such that
a ( w x ) 2 = x , x w ( a w ) 2 x = a w x , ( a w x w ) * = a w x w , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
Proof. ( 1 ) ( 2 ) By hypothesis, there exist z , y A such that
a = z + y , z * y = y w z = 0 , z A w , # , y A w q n i l .
Set x = z w , # . Then
a w x w = ( z + y ) w z w , # w = z w z w , # w , ( a w x w ) * = a w x w , a ( w x ) 2 = ( z + y ) ( w z w , # ) 2 = z ( w z w , # ) 2 = x .
Moreover, we see that
x w ( a w ) 2 x = z w , # w ( z + y ) w ( z + y ) w z w , # = z w , # w ( z + y ) w z w z w , # = z w , # ( w z ) 2 w z w , # = z w z w , # = ( z + y ) w z w , # = a w x .
It is easy to verify that
( 1 a w x w ) a w = ( 1 z w z w , # w ) ( z + y ) w = ( 1 z w z w , # w ) z w + ( 1 z w z w , # w ) y w = y w ( z w z w , # w ) * y w = y w ( w z w , # w ) * ( z * y ) = y w .
Furthermore, we have
| | ( a w ) n ( a w ) x w ( a w ) n | | = | | ( 1 a w x w ) ( a w ) n | | = | | y w ( a w ) n 1 | | = | | y w ( z + y ) w ( a w ) n 2 | | = | | ( y w ) 2 ( a w ) n 2 | | = = | | ( y w ) n | | .
Since y A w q n i l , we see that lim n | | ( y w ) n | | 1 n = 0 . Therefore lim n | | ( a w ) n ( a w ) x w ( a w ) n | | 1 n = 0 , as required.
( 2 ) ( 1 ) By hypotheses, there exists x A such that
x = a ( w x ) 2 , x w ( a w ) 2 x = a w x , ( a w x w ) * = a w x w , lim n | | ( a w ) n a w x w ( a w ) n | | 1 n = 0 .
Then we check that
a w x w ( a w ) 2 x = ( a w ) 2 x .
Set z = a w x w a and y = a a w x w a . We verify that
y w z = ( a a w x w a ) w ( a w x w a ) = a w a w x w a a w x w ( a w ) 2 x w a = ( a w ) 2 x w a ( a w ) 2 x w a = 0 , z * y = ( a w x w a ) * y = a * ( a w x w ) y = a * ( a w x w ) ( a a w x w a ) = a * [ a w x w a ( a w x w a w x ) w a ] = a * [ a w x w a ( a w x ) w a ] = 0 .
We claim that z A w , # and z w , # = x .
Claim 1. x = z ( w x ) 2 . We verify that z ( w x ) 2 = a w x w a ( w x ) 2 = a w x w x = x .
Claim 2. ( z w x w ) * = z w x w . Clearly, we have z w x w = ( a w x w a w ) x w = a w x w , and then ( z w x w ) * = ( a w x w ) * = a w x w = z w x w .
Claim 3. z = x ( w z ) 2 . One checks that x ( w z ) 2 = x ( w a w x w a ) ( w a w x w a ) = [ x w ( a w ) 2 x w ] a = a w x w a = z .
Therefore z A w , # . Moreover, we see that
| | ( a w ) n a w x w ( a w ) n | | = | | ( a a w x w a ) w ( a w ) n 1 | | = | | y w ( a w ) n 1 | | = | | y w a w ( a w ) n 2 | | = | | y w ( z + y ) w ( a w ) n 2 | | = | | ( y w ) 2 ( a w ) n 2 | | = = | | ( y w ) n | | .
Therefore
lim n | | ( y w ) n | | 1 n = 0 ,
and then y A w q n i l . This completes the proof. □
We denote x in Theorem 4.1 by a w , d , and call it a generalized weighted w-core inverse of a.
Corollary 8. 
Let a A w , d . Then a w A d and ( a w ) d = a w , d w .
Proof. 
In view of Theorem 4.1, there exists x A such that
a ( w x ) 2 = x , x w ( a w ) 2 x = a w x , ( a w x w ) * = a w x w , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
Then a w ( x w ) 2 = x w . By hypothesis, there exist z , y A such that
a = z + y , z * y = y w z = 0 , z A w , # , y A w q n i l .
Hence a w = z w + y w , z w A # , y w A q n i l and ( y w ) ( z w ) = 0 . In view of [4], a w A d . Therefore a w A d by [5]. In this case, ( a w ) d = ( z w ) # = ( a w x w a w ) # = x w = a w , d w . □
Corollary 9. 
Let a , w A . Then a A w , # if and only if a A w # A w , d .
Proof. 
This is obvious by Theorem 4.1 and Corollary 2.4. □
We come now to present the polar-like property of elements associated the weighted w-core inverse.
Theorem 8. 
Let a , w A . Then the following are equivalent:
(1)
a A w , d .
(2)
There exists a projection p A such that
1 p A w , p a w = p a w p A q n i l , a n d a w + p A 1 .
Proof. ( 1 ) ( 2 ) Since a A w , # , there exists x A such that
a ( w x ) 2 = x , x w ( a w ) 2 x = a w x , ( a w x w ) * = a w x w , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
In view of Corollary 4.2, a w A d and ( a w ) d = x w . In light of [6], there exists a projection p A such that
p a w = p a w p A q n i l , a n d a w + p A 1 .
Exactly, we have p = 1 a w ( a w ) d . Then 1 p = a w ( a w ) d = a w x w A w , as desired.
( 2 ) ( 1 ) By hypothesis, there exists a projection p A such that
u : = a w + p A 1 , 1 p A w , p a w = p a w p A q n i l .
Set z = ( 1 p ) a and y = p a . Then
z * y = [ ( 1 p ) a ] * ( p a ) = [ a * ( 1 p ) * ] p a = a * ( 1 p ) p a = 0 , y w z = p a w ( 1 p ) a = 0 , y w = p a w A q n i l .
Claim 1. z A w , # . Write 1 p = s w and ( 1 p ) s = s . Set x = u 1 s . Then we verify that
Since ( 1 p ) a w = ( 1 p ) u , we have ( 1 p ) a w u 1 ( 1 p ) = 1 p . Then z w x w = 1 p . Then ( z w x w ) * = 1 p = z w x w .
Since p a w ( 1 p ) = 0 and p a w A d , it follows by [21] that a w ( 1 p ) A d , and so a w ( 1 p ) d = ( a w ) d ( 1 p ) . By virtue of Cline’s formula, ( 1 p ) a w A d . Then ( 1 p ) u A d . By Cline’s formula again, u ( 1 p ) A d . Since p u ( 1 p ) = p a w ( 1 p ) = 0 , it follows by [21] that [ u ( 1 p ) ] d = u 1 ( 1 p ) . Thus, p x = p u 1 s = [ p u 1 ( 1 p ) ] s = p u ( 1 p ) [ u ( 1 p ) d ] 2 s = 0 , and then ( 1 p ) x = x . Therefore we verify that
x ( w z ) 2 = u 1 ( s w ) z w z = u 1 [ ( 1 p ) z ] w z = u 1 z w z = u 1 ( z + y ) w z = u 1 a w ( 1 p ) z = u 1 ( a w + p ) ( 1 p ) z = ( 1 p ) z = z , z ( w x ) 2 = z w x w x = [ ( 1 p ) a w u 1 ] s w x = [ ( 1 p ) s ] w x = s w x = ( 1 p ) x = x .
Therefore z A w , # and x = z w , # .
Claim 2. a A w , d . We verify that
a ( w x ) 2 = ( z + y ) ( w x ) 2 = z ( w x ) 2 = x , a w x w = ( z + y ) w x w = z w x w , ( a w x w ) * = ( z w x w ) * = z w x w = a w x w , x ( a w ) 2 x = x ( z + y ) w ( z + y ) w x = x ( z w ) 2 x = z w x = a w x ,
Moreover, we see that
| | ( a w ) n a w x w ( a w ) n | | = | | ( a w a w x w a w ) ( a w ) n 1 | | = | | [ a w ( z + y ) w x w a w ] ( a w ) n 1 | | = | | [ a w ( z w x w ) ( z + y ) w ] ( a w ) n 1 | | = | | [ a w ( w x w ) * z * ( z + y ) w ] ( a w ) n 1 | | = | | [ a w ( w x w ) * z * z w ] ( a w ) n 1 | | = | | [ a w ( z w x w ) * z w ] ( a w ) n 1 | | = | | [ a w ( z w x w z ) w ] ( a w ) n 1 | | = | | ( a w z w ) ( a w ) n 1 | | = | | y w ( a w ) n 1 | | = | | y w ( z + y ) w ( a w ) n 2 | | = | | ( y w ) 2 ( a w ) n 2 | | = = | | ( y w ) n | | .
Since y w A q n i l , we have lim n | | ( y w ) n | | 1 n = 0 . Then lim n | | ( a w ) n a w x w ( a w ) n | | 1 n = 0 . Therefore a A w , d , as asserted. □
Corollary 10. 
Let a A . Then the following are equivalent:
(1)
a A d .
(2)
There exists a projection p A such that p a = p a p A q n i l , a n d a + p A 1 .
Proof. 
This is obvious by choosing w = 1 in Theorem 4.4. □
Lemma 8. 
Let a A . Then a A w , d if and only if
(1)
a A d , w ;
(2)
There exists x A such that
x w a w x = x , x A = a d , w A , A x w = A ( a d , w ) * .
In this case, a w , d = x .
Proof. 
⟹ Set x = a w , d . By virtue of Corollary 4.2, a w A d and x w = ( a w ) d . In view of [5], a w A d and
x w ( a w ) x w = x w , x w A = ( a w ) d A , A x w = A ( ( a w ) d ) * .
Since a d , w = [ ( a w ) d ] 2 a = a [ ( w a ) d ] 2 = ( a w ) d a ( w a ) d , we easily check that ( a w ) d = [ ( a w ) d ] 2 a w = a d , w a , and then ( a w ) d A = a d , w A . On the other hand, we have ( a d , w ) * = [ ( a w ) d a w ] * [ ( a w ) d ] * and [ ( a w ) d ] * = [ ( ( a w ) d ) 2 a w ] * = w * ( a d , w ) * . Thus, A [ ( a w ) d ] * = A ( a d , w ) * . Therefore x A = x w A = a d , w A , A x w = A ( a d , w ) * .
⟸ By hypothesis, There exists x A such that
x w a w x = x , x A = a d , w A , A x w = A ( a d , w ) * .
As the argument above, we have
( a w ) d A = a d , w A , A [ ( a w ) d ] * = A ( a d , w ) * .
Therefore we get
x w a w x = x , x w A = x A = ( a w ) d A , A x w = A ( ( a w ) d ) * .
By virtue of [5], a w A d and ( a w ) d = x w . Therefore we have
x w = a w ( x w ) 2 = x w a w x w , ( a w x w ) * = a w x w , lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 .
Since x w = a w ( x w ) 2 and x x w A , we have x = a w x w x = a ( w x ) 2 . This implies that x = a w x w x = ( a w ) 2 x ( w x ) 2 = ( a w ) n 1 x ( w x ) n 1 for any n N . Hence a w x = ( a w ) n x ( w x ) n 1 . This implies that
| | a w x x w ( a w ) 2 x | | 1 n = | | ( a w ) n x ( w x ) n 1 [ x w ( a w ) n + 1 ] x ( w x ) n 1 | | 1 n | | ( a w ) n x w ( a w ) n + 1 | | 1 n | | x ( w x ) n 1 | | 1 n ;
whence lim n | | a w x x w ( a w ) 2 x | | 1 n = 0 . Thus a w x = x w ( a w ) 2 x . Therefore a w , d = x , as required. □
We are now prepared to prove:
Theorem 9. 
Let a A . Then the following are equivalent:
(1)
a A w , d .
(2)
a A d , w and a d , w A w , # .
In this case, a w , d = [ a d , w w ] 2 ( a d , w ) w , # .
Proof. ( 1 ) ( 2 ) As in the proof of Corollary 4.2, a w A d . By using Cline’s formula, w a A d . Hence, a A d , w . Let x = a w , d . Then we have
a ( w x ) 2 = x , x w ( a w ) 2 x = a w x , ( a w x w ) * = a w x w , lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 .
Obviously, x = ( a w ) n x ( w x ) n for any n N . Then
| | x a w ( a w ) d x | | = | | ( a w ) n x ( w x ) n ( a w ) ( a w ) d ( a w ) n x ( w x ) n | | | | ( a w ) n ( a w ) d ( a w ) n + 1 | | | | x ( w x ) n | | .
Since lim n | | ( a w ) n ( a w ) d ( a w ) n + 1 | | 1 n = 0 , we get lim n | | x a w ( a w ) d x | | 1 n = 0 . Hence ( a w ) ( a w ) d x = x . Furthermore, we have
| | a w ( a w ) d a w x w ( a w ) ( a w ) d | | = | | ( a w ) n [ ( a w ) d ] n a w x ( a w ) n [ ( a w ) d ] n | | | | ( a w ) n a w x w ( a w ) n | | | | ( a w ) d ] 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 ) d a w x w ( a w ) ( a w ) d | | 1 n = 0 .
Hence a w x w ( a w ) ( a w ) d = a w ( a w ) d . Let z = ( a w ) 2 x . Then
a d , w w z w = a d , w w ( a w ) 2 x w = [ ( a w ) d ] 2 a w ( a w ) 2 x w = a w x w , a d , w ( w z ) 2 = ( a w x w ) z = ( a w x w ) ( a w ) 2 x = a w [ x w ( a w ) 2 x ] = ( a w ) 2 x = z , ( a d , w w z w ) * = ( a w x w ) * = a w x w = a d , w w z w , z ( w a d , w ) 2 = ( a w ) 2 x w a d , w w a d , w = a w [ a w x w ( a w ) ( a w ) d ] a d , w w a d , w = a w [ ( a w ) ( a w ) d ] a d , w w a d , w = a w [ ( a w ) ( a w ) d ] [ ( a w ) d ] 2 a w a d , w = a w ( a w ) d a d , w = a d , w .
Accordingly, a d , w A w , # and ( a d , w ) w , # = z = ( a w ) 2 a w , d , as required.
( 2 ) ( 1 ) Set z = ( a d , w ) w , # . Then we have a d , w w z w a d , w = a d , w , [ a d , w w z w ] * = a d , w w z w . Let x = ( a d , w w ) 2 z . Then we verify that
x w a w x = [ a d , w w a d , w w z ] w a w [ a d , w w a d , w w z ] = a d , w w [ a d , w w z w a d , w ] w a w a d , w w z ] = a d , w w a d , w w a w a d , w w z ] = a d , w w ( a w ) d a w a d , w w z ] = a d , w w a d , w w z = x .
Clearly, x A a d , w A . Also we see that
a d , w = ( a d , w w ) 2 a = a d , w w [ a d , w w z w a d , w ] w a = [ ( a d , w w ) 2 z ] w a d , w w a ;
whence, a d , w A x A . Then x A = a d , w A .
We easily verify that
x w = a d , w w a d , w w z w = a d , w w [ a d , w w z w ] = a d , w w [ a d , w w z w ] * = a d , w w ( w z w ) * ( a d , w ) * ;
and then, A x w A ( a d , w ) * . On the other hand, we have
( a d , w ) * = [ a d , w w z w a d , w ] * = [ ( a d , w w z w ) * a d , w ] * = ( a d , w ) * a d , w w z w = ( a d , w ) * [ a d , w w a w a d , w ] w z w = ( a d , w ) * [ a d , w w a ] w a d , w w z w = ( a d , w ) * [ a w a d , w ] w a d , w w z w = ( a d , w ) * a w [ a d , w w a d , w w z ] w = ( a d , w ) * a w ( x w ) ,
and so A ( a d , w ) * A x w . Hence A x w = A ( a d , w ) * . Therefore a A w , d by Lemma 4.6. In this case, a w , d = x = [ a d , w w ] 2 ( a d , w ) w , # .

References

  1. O.M. Baksalary and G. Trenkler, Core inverse of matrices, Linear Multilinear Algebra, 58(2010), 681–697.
  2. R. Behera; G. Maharana and J.K. Sahoo, Further results on weighted core-EP inverse of matrices, Result. Math., 75(2020), Paper No. 174, 20 p.
  3. J. Bentez and E. Boasso, The inverse along an element in rings, Electron. J. Linear Algebra, 31(2016), 572–592.
  4. H. Chen and M. Sheibani, Theory of Clean Rings and Matrices, World Scientific, Hackensack, NJ, 2023. [CrossRef]
  5. H. Chen and M. Sheibani, Generalized weighted core inverse in Banach *-algebras, Filomat, 38(2024), 3691–3706.
  6. H. Chen and M. Sheibani, Properties of generalized weighted core inverses in Banach *-algebras, J. Algebra Appl., (2025) 2550358 (20 pages).
  7. J. Chen; H. Zhu; P. Patricio and Y. Zhang, Characterizations and representations of core and dual core inverses, Canad. Math. Bull. 2016. [CrossRef]
  8. T. Jin; H. Zhu and L. Wu, New characterizations for w-core inverses in rings with involution, Filomat, 37(2023), 2131–2139.
  9. X. Mary and P. Patrício, Generalized inverses modulo H in semigroups and rings, Linear Multilinear Algebra, 61(2013), 886–891.
  10. N. Mihajlovic, Group inverse and core inverse in Banach and C*-algebras, Comm. Algebra, 48(2020), 1803–1818.
  11. D. Mosić, Weighted generalized Drazin inverse in rings, Georgian Math. J., 23(2016), 587–594.
  12. D. Mosić, Core-EP inverses in Banach algebras, Linear Multilinear Algebra, 69(2021), 2976–2989.
  13. D. Mosić, Weighted core-EP inverse and weighted core-EP pre-orders in a C*-algebra, J. Aust. Math. Soc., 111(2021), 76–110.
  14. D. Mosić; G. Dolinar and J. Marovt, EP-quasinilpotent decomposition and its applications, Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat., 115(2021), No. 4, Paper No. 188, 25 p.
  15. K.M. Prasad and K.S. Mohana, Core-EP inverse, Linear Multilinear Algebra, 62(2014), 792–802.
  16. D.S Rakic; N.C. Dincic and D.S. Djordjevic, Group, Moore-Penrose, core and dual core inverse in rings with involution, Linear Algebra Appl., 463(2014), 115–133.
  17. H. Wang, Core-EP Decomposition and its applications, Linear Algebra Appl., 508 (2016), 289–300.
  18. L. Wu and H. Zhu, Weighted w-core inverses in rings, Czechoslovak Math. J., 73(2023), 581–602.
  19. S. Xu; J. Chen and X. Zhang, New characterizations for core inverses in rings with involution, Front. Math. 2017. [CrossRef]
  20. Y. Yang and H. Zhu, The w-core inverse of a product and its applications, Filomat, 37(2023), 4587–4601.
  21. D. Zhang and D. Mosić, Explicit formulae for the generalized Drazin inverse of block matrices over a Banach algebra, Filomat, 32(2018), 5907–5917.
  22. Q. Zhang; C. Wang and H. Zhu, Characterizations and representations of w-core inverses in rings, Filomat, 37(2023), 3183–3190.
  23. H. Zhu and Q. Wang, Weighted Moore-Penrose inverses and weighted core inverses in rings with involution, Chin. Ann. Math., Ser. B, 42(2021), 613–624.
  24. H. Zhu; L. Wu and J. Chen, A new class of generalized inverses in semigroups and rings with involution, Comm. Algebra, 51(2023), 2098–2113.
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