Preprint
Article

This version is not peer-reviewed.

Weighted w-EP Element and Its Associated Decomposition

Submitted:

27 July 2025

Posted:

30 July 2025

You are already at the latest version

Abstract
We introduce a new class of weighted generalized inverses, which represent a natural extension of the EP inverse and the weighted group inverse. Fundamental properties of this new generalized inverse are established. Furthermore, we investigate the decomposition associated with the weighted EP element, extending many properties of EP elements to a broader context.
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 A has a group inverse if there exists an x A such that
x a 2 = a , a x 2 = x , a x = x a .
Such an x is unique, if it exists, and is denoted by a # , termed the group inverse of a (see [21]).
An element a 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 # (see [7,24,26]). Dually, an element a A has dual core inverse if and only if there exist x A such that
a 2 x = a , x 2 a = x , ( x a ) * = x a .
If such x exists, it is unique, and denote it by a # .
Rakí introduced the EP element in rings and algebras, integrating concepts from both core and dual-core elements (see [21]). An element a A is an EP element if a A # A # and a # = a # . Evidently, a A is an EP element if and only if there exists x A such that
a 2 x = a , x 2 a = x , ( a x ) * = x a
(see [25]). The EP element has been applied to many fields such as control theory and image processing (see [1,10]). It has been extensively studied by numerous authors from various perspectives, e.g., [2,9,12,13,16,17,18,22,23,27].
Recently, many authors studied various weighted generalized inverses, e.g., [11,14,15,20]. An element a A has w-group inverse if there exists 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 generalized w-group invertible elements in A is denoted by A w # . In [6], Chen and Sheibani introduced a new weighted generalized inverse as a natural generalization of core inverse and w-group inverse.
Definition 1. 
An element a A has weighted w-core inverse if there exists x A such that
x ( w a ) 2 = a , a ( w x ) 2 = x , ( a w x w ) * = a w x w .
If such an x exists, we denote it by a w , # . Let A w , # denote the set of all weighted w-core invertible elements in A . We use A w ( 1 , 3 ) to stand for sets of all weighted w- ( 1 , 3 ) -invertible elements in A . Here we list some characterizations of weighted w-core inverse.
Theorem 1.  (see [6]) Let A be a Banach *-algebra, and 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 .
(3)
a A w # A w ( 1 , 3 ) .
(4)
w A | | a and a A w ( 1 , 3 ) .
(5)
a w * A ( a w a ) * a A ( a w a ) .
(6)
There exists a projection p A such that
p a = 0 , 1 p A w a n d a w + p A 1 .
Dually, we have
Definition 2. 
An element a A has dual weighted w-core inverse if there exist x A such that
( a w ) 2 x = a , ( x w ) 2 a = x , ( w x w a ) * = w x w a .
If such an x exists, we denote it by a w , # . Let A w , # denote the set of all dual weighted w-core invertible elements in A . Evidently, a has dual weighted w-core inverse if and only if a * has weighted w * -core inverse. However, the (dual) weighted w-core inverse may not be unique. This motivates us to consider a subclass that contains the set of all elements whose weighted w-core inverse is uniquely determined. Consequently, we extend the concept of an EP element to a bordered context and study the weighted w-EP property.
Definition 3. 
An element a A is a weighted w-EP element if a A w , # A w , # and a w , # = a w , # .
In Section 2, we establish fundamental properties of the weighted w-EP element. We prove that a A w , e if and only if there exists some x A such that ( a w ) 2 x = a , a w x = x w a , ( a w x w ) * = a w x w , ( w x w a ) * = w x w a .
In Section 3, we investigate algebraic properties of the weighted w-EP element. Additive and multiplicative results for this new generalized inverse are proved, and the weighted inverse of an anti-triangular matrix is thereby obtained.
Let A q n i l = { x A lim n x n 1 n = 0 } and A w q n i l = { x A w x A q n i l } . In Section 4, we consider a decomposition associated with the weighted w-EP element.
Definition 4. 
An element a A is a generalized weighted w-EP element if there exist z , y A such that
a = z + y , z * y = y w z = 0 , z A w , e , y A w q n i l .
We prove that a A is a generalized weighted w-EP element if and only if there exists x A such that
x = a ( w x ) 2 , a w x = x w a , ( a w x w ) * = a w x w , ( w x w a ) * = w x w a , lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 .
If such x exists, it is unique, and we denote it by a w , e . We use A w , e to stand for the set of all generalized weighted w-EP elements in A . Finally, we characterize the generalized weighted w-EP element using its associated weight generalized Drazin inverse.

2. Weighted w-EP Inverse

In this section, we delineate the foundational properties of the weighted w-EP inverse. We begin our examination with
Lemma 1. 
Let a , w A and n N . Then the following are equivalent:
(1)
a A w , e .
(2)
There exists x A such that
x ( w a ) 2 = ( a w ) 2 x = a , a ( w x ) 2 = ( x w ) 2 a = x , ( a w x w ) * = a w x w , ( w x w a ) * = w x w a .
Proof. 
Straightforward. □
If such an x exists, we denote it by a w , e . Let A w , e denote the set of all weighted w-EP invertible elements in A . The weighted w-EP inverse a w , e of a is unique as the following shows.
Theorem 2. 
Let a , w A . Then the following are equivalent:
(1)
a A w , e .
(2)
a w A # , w a A # and
( a w ) π a = 0 , ( a w ) # a = a ( w a ) # , ( a w ) # ( a w ) = ( a w ) ( a w ) # , w a ( w a ) # = ( w a ) # w a .
In this case,
a w , e = [ ( a w ) # ] 2 a = a [ ( w a ) # ] 2 = ( a w ) # a ( w a ) # .
Proof. ( 1 ) ( 2 ) By virtue of Lemma 2.1, there exists some x A such that
x ( w a ) 2 = ( a w ) 2 x = a , a ( w x ) 2 = ( x w ) 2 a = x , ( a w x w ) * = a w x w , ( w x w a ) * = w x w a .
Then
a w ( x w ) 2 = x w , x w ( a w ) 2 = a w , ( a w x w ) * = a w x w , ( w x ) 2 w a = w x , ( w a ) 2 w x = w a , ( w x w a ) * = w x w a .
Therefore
a w A # , w a A #
and ( a w ) # = x w , ( w a ) # = w x . We verify that
( a w ) # a = x w a = [ a ( w x ) 2 ] w a = a w [ ( x w ) 2 a ] = a w x = a ( w a ) # , ( a w ) # ( a w ) = a w [ ( x w ) 2 a ] w = ( a w x ) w = ( a w ) ( a w ) # , ( w a ) # w a = w x w a = w ( x w ) a = w ( a w ) # a = w a w [ ( a w ) # ] 2 a = w a w ( x w ) 2 a = w a w x = w a ( w a ) # .
Then ( a w ) # = ( a w ) # and ( w a ) # = ( w a ) # . Since a w ( a w ) # a = a w ( x w ) a = a ( w x ) ( w a ) = a ( w a # ) ( w a ) = a ( w a ) ( w a # ) = ( a w ) 2 x = a , we deduce that [ 1 a w ( a w ) # ] a = 0 . Thus [ 1 a w ( a w ) # ] a = 0 . That is, ( a w ) π a = 0 . Moreover, we derive that
x = a ( w x ) 2 = a [ ( w a ) # ] 2 = ( x w ) 2 a = [ ( a w ) # ] 2 a = ( x w ) a ( w x ) = ( a w ) # a ( w a ) # .
( 2 ) ( 1 ) Set x = ( a w ) # a ( w a ) # . Since ( a w ) # a = a ( w a ) # , we check that x = [ ( a w ) # ] 2 a = a [ ( w a ) # ] 2 . Moreover, we have
a w x w = a w [ ( a w ) # ] 2 a w = ( a w ) # a w = a w ( a w ) # , a ( w x ) 2 = ( a w x w ) x = ( a w ) # a w [ ( a w ) # ] 2 a = x , x ( w a ) 2 = a [ ( w a ) # ] 2 ( w a ) 2 = a ( w a ) # w a = ( a w ) # a w a = a , ( a w x w ) * = a w x w .
Moreover, we verify that
w x w a = w a [ ( w a ) # ] 2 w a = w a ( w a ) # = ( w a ) # w a , ( x w ) 2 a = x w x w a = [ ( a w ) # ] 2 a w [ ( a w ) # ] 2 a w a = [ ( a w ) # ] 3 a w a = a w [ ( a w ) # ] 3 a = [ ( a w ) # ] 2 a = x , ( a w ) 2 x = a ( w a w x ) = a w a ( w a ) # = a w ( a w ) # a = a , ( w x w a ) * = w x w a .
Therefore a A w , e by Lemma 2.1. □
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 [8]). We now derive
Corollary 1. 
Let a A w , e . Then
a w , e = ( w a w ) ( a w ) # , ( w a ) # .
Proof. 
In view of Theorem 2.2, a w A # , w a A # . Let x = a w , e . Then we verify that
x ( w a w ) ( a w ) # = = [ ( a w ) # ] 2 a ( w a w ) ( a w ) # = ( a w ) # , ( w a ) # ( w a w ) x = ( w a ) # ( w a w ) a [ ( w a ) # ] 2 = ( w a ) # , x = x w a w x = ( a w ) # a ( w a ) # ( a w ) # A x x A ( w a ) # .
Therefore, w a w has ( a w ) # , ( w a ) # -inverse x, as asserted. □
Theorem 3. 
Let a , w A . Then the following are equivalent:
(1)
a A w , e .
(2)
There exists some x A such that
a ( w x ) 2 = x , x ( w a ) 2 = a , ( w x w a ) * = w x w a , ( x w a w ) * = x w a w .
In this case, a w , e = ( x w ) 2 a .
(3)
There exists some x A such that
( x w ) 2 a = x , ( a w ) 2 x = a , ( w a w x ) * = w a w x , ( a w x w ) * = a w x w .
In this case, a w , e = a ( w x ) 2 .
Proof. ( 1 ) ( 2 ) We verify that
x w a w = ( a w ) # a w = a w ( a w ) # = a w x w .
Then ( x w a w ) * = x w a w , as required.
( 2 ) ( 1 ) By hypothesis, there exists some x A such that
a ( w x ) 2 = x , x ( w a ) 2 = a , ( x w a w ) * = x w a w .
Set z = ( x w ) 2 a . Then we verify that
a w z = a w ( x w ) 2 a = [ a ( w x ) 2 ] w a = x w a , z w a = ( x w ) 2 a w a = x w [ x ( w a ) 2 ] = x w a .
Thus, a w z = z w a . Accordingly, we have
a w z w = a w ( x w ) 2 a w = [ a ( w x ) 2 ] w a w = x w a w , ( a w z w ) * = a w z w , z ( w a ) 2 = ( x w ) 2 a ( w a ) 2 = x w [ x ( w a ) 2 ] w a = x ( w a ) 2 = a , a ( w z ) 2 = ( a w z w ) z = ( x w a w ) z = x w ( a w z ) = x w a w ( x w ) 2 a = x w [ a ( w x ) 2 ] w a = x w x w a = ( x w ) 2 a = z .
In light of Theorem 1.2, we have a w z w a = a and z w a w z = z . Then we verify that
w z w a = w ( x w ) 2 a w a = w x w [ x ( w a ) 2 ] = w x w a , ( a w ) 2 z = a w ( a w z ) = a w ( z w a ) = a w z w a = a , ( z w ) 2 a = z w ( z w a ) = z w ( a w z ) = z w a w z = z , ( w z w a ) * = ( w x w a ) * = w x w a = w z w a .
This implies that a A w , e . Accordingly, a w , e = z = ( x w ) 2 a , as required.
( 1 ) ( 3 ) Obviously, a A w , e if and only if a * A w * , e . By applying the preceding equivalence to a * and w * , we obtain the result. □
We use a 0 and 0 a to denote the right and left annihilator of a in A , respectively. We now derive
Corollary 2. 
Let a A . Then the following are equivalent:
(1)
a A w , e .
(2)
There exists some x A such that a = a w x w a , x = x w a w x , a A = x A = ( x w ) * A , a * A = ( w x ) A .
(3)
There exists some x A such that a = a w x w a , x = x w a w x , 0 a = 0 x = 0 ( x w ) * , 0 ( a * ) = 0 w x .
In this case, a w , e = x .
Proof. ( 1 ) ( 2 ) Set x = a w , e . Then there exists some 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 , ( a w ) 2 x = a , ( x w ) 2 a = x , ( w x w a ) * = w x w a , a w x w a = a , x w a w x = x .
Then a = x ( w a ) 2 x A , and so a A x A . As x = a ( w x ) 2 a A , we have x A a A . Hence, a A = x A .
Since a = a w x w a = ( a w x w ) * a = ( x w ) * ( a w ) * a ( x w ) * A ; hence, a A ( x w ) * A . As x w = x w a w x w , we have ( x w ) * = ( a w x w ) * ( x w ) * = a w x w ( x w ) * a A ; hence, ( x w ) * A a A . Thus, a A = ( x w ) * A .
Clearly, a = a w x w a , and so a * = ( w x w a ) * a * = x w a w ( a w ) * = w x w a a * w x A . This implies that a * A w x A . On the other hand, w x = w x w a w x = ( w x w a ) * w x = a * ( w x w ) * w x a * A ; hence, w x A a * A . Therefore a * A = ( w x ) A , as required.
( 2 ) ( 3 ) This is obvious.
( 3 ) ( 1 ) Since x w a w x = x , we see that 1 x w a w 0 x , and so 1 x w a w 0 a . Hence, a = x ( w a ) 2 . On the other hand, a w x w a = a ; whence, 1 a w x w 0 a 0 x . Thus, x = ( a w x w ) x = a ( w x ) 2 . Since a = a w x w a , we have a * = ( w x w a ) * a * , and so 1 ( w x w a ) * 0 ( a * ) 0 ( w x ) , and so w x = ( w x w a ) * w x . Then w x w a = ( w x w a ) * w x w a . This implies that ( w x w a ) * = ( w x w a ) * w x w a = w x w a . Since 0 a = 0 ( x w ) * , we see that ( a * ) 0 = ( x w ) 0 . Since a = a w x w a , we have a * = ( a w x w a ) * = a * ( a w x w ) * ; hence, ( 1 a w x w ) * ( a * ) 0 ( x w ) 0 . This shows that x w = x w ( a w x w ) * . This implies that a w x w = a w x w ( a w x w ) * . Therefore ( a w x w ) * = a w x w ( a w x w ) * = a w x w . This completes the proof by Theorem 2.4. □
Theorem 4. 
Let a , w A . Then the following are equivalent:
(1)
a A w , e .
(2)
There exists some x A such that
( a w ) 2 x = a , a w x = x w a , ( a w x w ) * = a w x w , ( w x w a ) * = w x w a .
In this case, a w , e = a ( w x ) 2 .
Proof. ( 1 ) ( 2 ) Let x = a w , e . Then ( a w ) 2 x = a , ( a w x w ) * = a w x w and ( w x w a ) * = w x w a . In view of Theorem 2.2, we derive
a w x = a w a w , e = a w ( ( a w ) # ) 2 a = [ ( a w ) # ] 2 ( a w ) a = a w , e w a = x w a ,
as required.
( 2 ) ( 1 ) Set z = a ( w x ) 2 . Since a w x = x w a , we see that
( z w ) 2 a = [ a ( w x ) 2 w ] 2 a = a w x w x w [ ( a w ) 2 x ] w x = [ ( a w ) 2 x ] w x w x = a ( w x ) 2 = z , ( a w ) 2 z = a w a w a ( w x ) 2 = a w [ ( a w ) 2 x ] w x = ( a w ) 2 x = a , a w z w = a w a ( w x ) 2 w = [ ( a w ) 2 x ] w x w = a w x w , ( a w z w ) * = a w z w , w z w a = w a ( w x ) 2 w a = w a w x w ( x w a ) = w a w x w ( a w x ) = w a w ( x w a ) w x = w a w ( a w x ) w x = w [ ( a w ) 2 x ] w x = w ( a w x ) = w ( x w a ) = w x w a , ( w z w a ) * = w z w a .
In light of Theorem 2.4, a A w , e . In this case, a w , e = a ( w x ) 2 .
Corollary 3. 
Let a , w A . Then the following are equivalent:
(1)
a A w , e .
(2)
There exists some x A such that
a = ( a w ) 2 x = x ( w a ) 2 , ( a w x w ) * = x w a w , ( w x w a ) * = w a w x .
In this case, a w , e = a ( w x ) 2 .
Proof. ( 1 ) ( 2 ) In view of Theorem 2.6, there exists some x A such that
( a w ) 2 x = a , a w x = x w a , ( a w x w ) * = a w x w , ( w x w a ) * = w x w a .
Hence,
x ( w a ) 2 = ( x w a ) w a = ( a w x ) w a = a w ( x w a ) = a w ( a w x ) = ( a w ) 2 x = a .
and
( a w x w ) * = ( a w x ) w = ( x w a ) w = x w a w , ( w x w a ) * = w ( x w a ) = w ( a w x ) = w a w x ,
as desired.
( 2 ) ( 1 ) By hypothesis, there exists some x A such that
a = ( a w ) 2 x = x ( w a ) 2 , ( a w x w ) * = x w a w , ( w x w a ) * = w a w x .
Thus, we have a = x ( w a ) 2 = ( x w a w ) a = ( a w x w ) * a , and then a w x w = ( a w x w ) * a w x w . This implies that x w a w = ( a w x w ) * = ( a w x w ) * a w x w = a w x w . Thus, we have
a w x = [ ( a w ) 2 x ] w x = a w [ a w x w ] x = a w [ x w a w ] x = [ a w x w ] a w x = x w ( a w ) 2 x = x w a .
Moreover, ( a w x w ) * = x w a w = a w x w and ( w x w a ) * = ( w a w x ) * = w x w a . Therefore we complete the proof by Lemma 2.6. □
As is well known, a is EP if and only if a A # and ( a a # ) * = a a # (see [25]). We now extend this result to the broader context of the weighted w-EP inverse.
Corollary 4. 
Let a A . Then the following are equivalent:
(1)
a A w , e .
(2)
a A # , w , ( a w a # , w w ) * = a w a # , w w and ( w a w a # , w ) * = w a w a # , w .
In this case, a w , e = a # , w .
Proof. ( 1 ) ( 2 ) Set x = a w , e . Then we have
( a w ) 2 x = a , ( x w ) 2 a = x , a w x = x w a , ( a w x w ) * = a w x w , ( w x w a ) * = w x w a .
Hence, a w x w a = a w ( a w x ) = ( a w ) 2 x = a , x w a w x = x w ( x w a ) = ( x w ) 2 a = x , a w x = x w a . Therefore a A # , w and a # , w = x = a w , e , as required.
( 2 ) ( 1 ) By hypothesis, ( a w a # , w w ) * = a w a # , w w = a # , w w a w and ( w a w a # , w ) * = w a w a # , w = w a # , w w a . Obviously, we have a = ( a w ) 2 a # , w = a # , w ( w a ) 2 . In light of Corollary 2.7, a A w , e and a w , e = a # , w , as asserted. □

3. Algebraic Properties

In this section we establish the multiplicative and additive properties of generalized weighted core inverse in a Banach algebra with involution.
Lemma 2. 
Let a A w , e , x A . If x a = a x and x w = w x , then x a w , e = a w , e x .
Proof. 
Since x a = a x and x w = w x ,, we have x a # , w = a # , w x . In view of Corollary 2.8, a w , e = a # , w . This completes the proof. □
We are now ready to prove:
Theorem 5. 
Let a , b A w , e . If a b = b a , a w = w a and b w = w b , then a w b A w , e . In this case,
( a w b ) w , e = a w , e w b w , e .
Proof. 
Since a b = b a , a w = w a , by virtue of Lemma 3.1, a b w , e = b w , e a . Likewise, w b w , e = b w , e w . By using Lemma 3.1 again, we derive a w , e b w , e = b w , e a w , e , w a w , e = a w , e w and w b w , e = b w , e w .
Set x = a w , e w b w , e . Then we check that
a w b ( w x ) 2 = a w b [ w a w , e w b w , e ] 2 = [ a ( w a w , e ) 2 ] w [ b ( w b w , e ) 2 ] = a w , e w b w , e = x , x ( w a w b ) 2 = a w , e w b w , e ( w a w b ) 2 = [ a w , e ( w a ) 2 ] w [ b w , e ( w b ) 2 ] = a w b , w x w ( a w b ) = w a w , e w b w , e w a w b = [ w a w , e w a ] [ w b w , e w b ] , w x w ( a w b ) * = [ w b w , e w b ] [ w a w , e w a ] = [ w a w , e w a ] [ w b w , e w b ] = w [ a w , e w b w , e ] w a w b = w x w ( a w b ) , x w ( a w b ) w = a w , e w b w , e w ( a w b ) w = [ a w , e w a w ] [ b w , e w b w ] , x w ( a w b ) w * = [ b w , e w b w ] [ a w , e w a w ] = [ a w , e w a w ] [ b w , e w b w ] = x w ( a w b ) w .
By virtue of Theorem 2.4, a w b A w , e and
( a w b ) w , e = ( a w b ) # , w = a # , w w b # , w = a w , e w b w , e ,
as asserted. □
It is convenient at this stage to include the following additive result for the generalized weighted core inverse.
Theorem 6. 
Let a , b A w , e . If a w b = b w a = 0 , then a + b A w , e . In this case,
( a + b ) w , e = a w , e + b w , e .
Proof. 
Set x = a w , e + b w , e . Then we check that
( a + b ) ( w x ) 2 = [ a w a w , e + b w b w , e ] w x = [ a w a w , e + b w b w , e ] w [ a w , e + b w , e ] = a w a w , e w a w , e + b w b w , e w b w , e = a ( w a w , e ) 2 + b ( w b w , e ) 2 = a w , e + b w , e = x , x [ w ( a + b ) ] 2 = [ a w , e w + b w , e w ] ( a w a + b w b ) = [ a w , e w + b w , e w ] ( a w a + b w b ) = a w , e w a w a + b w , e w b w b + a w , e w b w b + b w , e w a w a = a w , e ( w a ) 2 + b w , e ( w b ) 2 = a + b , w x w ( a + b ) = w ( a w , e + b w , e ) ( w a + w b ) = w a w , e w a + w b w , e w b , w x w ( a + b ) * = w x w ( a + b ) , x w ( a + b ) w = ( a w , e + b w , e ) w ( a w + b w ) = a w , e w a w + b w , e w b w , x w ( a + b ) w * = x w ( a + b ) w .
Therefore a + b A w , e . In this case,
( a + b ) w , e = ( a + b ) # , w = [ ( ( a + b ) w ) # ] 2 ( a + b ) = [ ( ( a w ) # ) 2 + ( ( b w ) # ) 2 ] ( a + b ) = a # , w + b # , w = a w , e + b w , e ,
This completes the proof. □
Theorem 7. 
Let a A w , e . Then a w , e A w , e . In this case, ( a w , e ) w , e = a .
Proof. 
We easily check that
a w , e ( w a ) 2 = a , a ( w a w , e ) 2 = a w , e , ( a w a w , e w ) * = a w a w , e w , ( w a w a w , e ) * = w a w a w , e .
In view of Theorem 3.4, a w , e A w , e . In this case, ( a w , e ) w , e = a , thus yielding the result. □
Corollary 5. 
Let a A w , e . Then [ ( a w , e ) w , e ] w , e = a w , e .
Proof. 
Straightforward by Theorem 3.4. □
Lemma 3. 
Let a A # and b A . Then the following are equivalent:
(1)
a π b = 0 .
(2)
( 1 a # a ) b = 0 .
Proof. ( 1 ) ( 2 ) Since a π b = 0 , we have that b = a # a b . Then a # a b = [ a # a a ( 1 , 3 ) ] a b = a # a b . Hence ( 1 a # a ) b = 0 , as required.
( 2 ) ( 1 ) Since ( 1 a # a ) b = 0 , we have b = a # a b . Thus, b = a # a a ( 1 , 3 ) a b = a # a b . This implies that a π b = 0 , as desired. □
Theorem 8. 
Let α = a c 0 b with a , b A w , e . If ( a w ) π c = 0 and c ( w b ) π = 0 , then α M 2 ( A ) e , w I 2 and
α e , w I 2 = a w , e a w , e w c w b w , e 0 b w , e .
Proof. 
In view of Theorem 2.2, a w , b w A # . Since ( a w ) π c w = 0 , by virtue of Lemma 3.6, we have [ 1 ( a w ) ( a w ) # ] c w = 0 . By using [24], we have
( α w I 2 ) # = ( a w ) # s 0 ( b w ) # ,
where
s = ( a w ) # c w ( b w ) # .
On the other hand, ( w a ) π w c = [ 1 w a ( w a ) # ] w c = [ 1 w a w ( ( a w ) # ) 2 a ] w c = w ( a w ) π c = 0 . Dually, we have
( w I 2 α ) # = ( w a ) # t 0 ( w b ) # ,
where t = ( w a ) # w c ( w b ) # .
Set β = ( a w ) # s 0 ( b w ) # a c 0 b ( w a ) # t 0 ( w b ) # . Then
β = a w , e z 0 b w , e ,
where
z = ( a w ) # a t + s b ( w b ) # + ( a w ) # c ( w b ) # = a w , e w c ( w b ) # ( a w ) # c w b w , e + ( a w ) # c ( w b ) # = a w , e w c ( w b ) # ( a w ) # c ( w b ) # + ( a w ) # c ( w b ) # = a w , e w c ( w b ) # = a w , e w c w b w , e .
Since z a A and a w a w , e w a = a , we have a w a w , e w z = z . Moreover, we have
a w z w b w , e + c ( ( w b ) # ) 2 = a w a w , e w c ( w b ) # w b [ ( w b ) # ] 2 + c ( ( w b ) # ) 2 = a w a ( ( w a ) # ) 2 w c ( ( w b ) # ) 2 + c ( ( w b ) # ) 2 = [ 1 a ( w a ) # w ] c ( ( w b ) # ) 2 = [ 1 a w ( ( a w ) # ) 2 a w ] c ( ( w b ) # ) 2 = [ 1 ( a w ) # a w ] c ( ( w b ) # ) 2 = 0 .
Then we easily verify that
a [ w a w , e w z + w z w b w , e ] + c ( ( w b ) # ) 2 = a w a w , e w z + a w z w b w , e + c ( ( w b ) # ) 2 = z ,
Thus we have
α ( w I 2 β ) 2 = a c 0 b w a w , e w z 0 w b w , e 2 = a [ w a w , e ] 2 a [ w a w , e w z + w z w b w , e ] + c ( ( w b ) # ) 2 0 b [ w b w , e ] 2 = β .
It is easy to verify that
a w , e ( w a ) 2 = a w , e w a w a = [ a w , e w a w a w , e ] a w , e w a = [ a w , e ] 2 w a = a .
Likewise, b w , e ( w b ) 2 = b . Furthermore, we check that
a w , e [ ( w a ) ( w c ) + ( w c ) ( w b ) ] a w , e w c w b w , e ( w b ) 2 = [ ( a w ) # ] 2 ( a w ) 2 c + a w , e ( w c ) ( w b ) a w , e w c w b [ ( w b ) # ] 2 ( w b ) 2 = ( a w ) # ( a w ) c + a w , e ( w c ) ( w b ) a w , e w c [ w b ( w b ) # w b ] = c .
Therefore
β ( w I 2 α ) 2 = a w , e a w , e w c w b w , e 0 b w , e w a w c 0 w b 2 = a w , e ( w a ) 2 a w , e [ ( w a ) ( w c ) + ( w c ) ( w b ) ] a w , e w c w b w , e ( w b ) 2 0 b w , e ( w b ) 2 = α .
Clearly, we have
a w a w , e w c w b w , e w c w b w , e w = a w a # , w w c w b w , e w c w b w , e w = a w [ ( a w ) # ] 2 a w c w b w , e w c w b w , e w = [ ( a w ) # a w 1 ] c w b w , e w = [ ( a w ) π c ] w b w , e w = 0 .
Thus, we derive that
α ( w I 2 ) β ( w I 2 ) = a w c w 0 b w a w , e w a w , e w c w b w , e w 0 b w , e w = a w a w , e w 0 0 b w b w , e w .
Therefore
( α ( w I 2 ) β ( w I 2 ) ) * = α ( w I 2 ) β ( w I 2 ) .
Analogously,
( ( w I 2 ) β ( w I 2 ) α ) * = ( w I 2 ) β ( w I 2 ) α .
In this case,
α w , e = [ β ( w I 2 ) ] 2 α = a w , e w a w , e w c w b w , e w 0 b w , e w 2 a c 0 b = a w , e w a w , e w c w b w , e w 0 b w , e w a w , e w a a w , e w c a w , e w c w b w , e w b 0 b w , e w b = a w , e ( a w , e w ) 2 c [ 1 ( w b ) # w b ] a w , e w c w b w , e 0 b w , e = a w , e a w , e w c w b w , e 0 b w , e ,
as asserted. □
Corollary 6. 
Let α = a c 0 b M 2 ( A ) , and let a , b A be EP. If a π c = 0 and c b π = 0 , then α M 2 ( A ) is EP.
Proof. 
Straightforward by choosing w = 1 in Theorem 3.7. □

4. The Associated Decomposition

Recall that a A w , d if and only if 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 .
The preceding x is denoted by a w , d (see [6]). Dually, a A w , d if and only if a * A w * , d . We use a w , d to stand for [ ( a * ) w * , d ] * . We now derive
Theorem 9. 
Let a , w A . Then the following are equivalent:
(1)
a A w , e .
(2)
There exists x A such that
x = a ( w x ) 2 , a w x = x w a , ( a w x w ) * = a w x w , ( w x w a ) * = w x w a , lim n | | ( a w ) n x w ( a w ) n + 1 | | 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 , e , y A w q n i l .
Set x = z w , e . Then x = z w , e = z w , # = z # , w . As in the proof of [6], we check that
x = a ( w x ) 2 , ( a w x w ) * = a w x w , lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 .
Moreover, we verify that
a w x = ( z + y ) w z w , # = z w z w , # = z w z # , w , x w a = z w , # w ( z + y ) = z w , # w ( z + y ) = z w , # w z w z w , # w ( z + y ) = z w , # w ( z w z w , # w ) * ( z + y ) = z w , # w ( w z w , # w ) * z * ( z + y ) = z w , # w ( w z w , # w ) * z * z = z w , # w ( z w z w , # w ) * z = z # w z .
Then a w x = x w a . Hence, we have lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 . Since w x w a = w ( x w a ) = w z w , # w , we see that ( w x w a ) * = w x w a , as required.
( 2 ) ( 1 ) By hypotheses, there exists x A such that
x = a ( w x ) 2 , a w x = x w a , ( a w x w ) * = a w x w , ( w x w a ) * = w x w a , lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 .
Then x w ( a w ) 2 x = a w ( x w a ) w x = a w ( a w x ) ( w x ) = a w [ a ( w x ) 2 ] = a w x . Moreover, we have lim n | | ( a w ) n ( a w ) ( x w ) ( a w ) n | | 1 n = 0 . This implies that a A w , d . Set z = a w x w a and y = a a w x w a . As in the proof of [6], we have
a = z + y , z * y = 0 , y w z = 0 , z A w , # , y A w q n i l .
Explicitly, z w , # = x . This implies that ( a w ) 2 x = a , ( a w x w ) * = a w x w . Moreover, we verify that w x w z = w x w ( a w x w a ) = w x w a w x w a = w x w a ; hence, ( w x w z ) * = w x w z . Since a w x = x w a , it is easy to check that
z w x = ( a w x w a ) w x = ( a w x w ) ( a w x ) = ( a w x w ) ( x w a ) = [ a ( w x ) 2 ] w a = x w a = a w x = a w a ( w x ) 2 = a w ( a w x ) w x = a w ( x w a ) w x = ( a w x ) w ( a w x ) = x w ( a w x w a ) = x w z .
Therefore z A w , e by Theorem 2.6. This completes the proof. □
We denote x in Theorem 4.1 by a w , e , and call it a generalized weighted w-EP inverse of a.
Corollary 7. 
Let a A w , e . Then
a w , e = a w , e w a w a w , e .
Proof. 
By virtue of Theorem 4.1, we have a w , e w a = a w a w , e w a . Hence, a w , e w a w a w , e = a ( w a w , e ) 2 = a w , e , as asserted. □
Corollary 8. 
Let a , w A . Then the following are equivalent:
(1)
a A w , e .
(2)
There exists some x A such that
( x w ) 2 a = x = a ( w x ) 2 , ( a w x w ) * = a w x w , ( w x w a ) * = w x w a , lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 .
In this case, a w , e = x .
Proof. ( 1 ) ( 2 ) This is obvious by Theorem 4.1.
( 2 ) ( 1 ) By hypothesis, there exists some x A such that
( x w ) 2 a = x = a ( w x ) 2 , ( a w x w ) * = a w x w , ( w x w a ) * = w x w a , lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 .
Then we verify that
a w x = a w [ ( x w ) 2 a ] = [ a ( w x ) 2 ] w a = x w a .
By virtue of Theorem 4.1, a A w , e and a w , e = x by Theorem 4.1. □
Theorem 10. 
Let a , w A . Then the following are equivalent:
(1)
a A w , e .
(2)
a A w , d A w , d and a w , d = a w , d .
Proof. ( 1 ) ( 2 ) Let x = a w , e . In view of Theorem 4.1, there exists x A such that
x = a ( w x ) 2 , a w x = x w a , ( a w x w ) * = a w x w , ( w x w a ) * = w x w a , lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 .
According, we verify that the equalities
x = a ( w x ) 2 , ( a w x w ) * = a w x w , x w ( a w ) 2 x = a w x , lim n | | ( a w ) n a w x w ( a w ) n | | 1 n = 0 ; x = ( x w ) 2 a , ( w x w a ) * = w x w a , x ( w a ) 2 w x = x w a , lim n | | ( w a ) n ( w a ) n w x w a | | 1 n = 0 .
Therefore a A w , d A w , d and a w , d = a w , d .
( 2 ) ( 1 ) By hypothesis, there exists x A such that the preceding equalities hold. Then we verify that
a w x = a w [ ( x w ) 2 a ] = [ a ( w x ) 2 ] w a = x w a .
Therefore a w , e = x , as desired. □
Corollary 9. 
Let a A w , e . Then a w A d , w a A d and
a w , e = [ ( a w ) d ] 2 a = a [ ( w a ) d ] 2 = ( a w ) d a ( w a ) d .
Proof. 
By virtue of Theorem 4.4, a A w , d A w , d . It follows by [6] that a w A d . Dually, we have w a A d . Set x = a w , e . Then we derive that
x = a ( w x ) 2 = a [ ( w a ) d ] 2 = ( x w ) 2 a = [ ( a w ) d ] 2 a = ( x w ) a ( w x ) = ( a w ) d a ( w a ) d .
We are ready to prove:
Theorem 11. 
Let a , w A . Then the following are equivalent:
(1)
a A w , e .
(2)
a w A d , w a A d and
( a w ) d a = a ( w a ) d , ( a w ) d ( a w ) = ( a w ) ( a w ) d , w a ( w a ) d = ( w a ) d w a .
Proof. ( 1 ) ( 2 ) Set x = a w , e . In view of Corollary 4.5, a w A d , w a A d . Moreover, we have a ( w x ) 2 = x = ( x w ) 2 a . Hence
a w ( x w ) 2 = x w , ( w x ) 2 w a = w x .
Thus
( a w ) d = x w , ( w a ) d = w x .
We verify that
( a w ) d a = x w a = [ a ( w x ) 2 ] w a = a w [ ( x w ) 2 a ] = a w x = a ( w a ) d , ( a w ) d ( a w ) = a w [ ( x w ) 2 a ] w = ( a w x ) w = ( a w ) ( a w ) d , ( w a ) d w a = w ( x w ) a = w ( x w a ) = w ( a w x ) = w a ( w x ) w a ( w a ) d ,
as desired.
( 2 ) ( 1 ) Set x = ( a w ) d a ( w a ) d . Since ( a w ) d a = a ( w a ) d , we check that x = [ ( a w ) d ] 2 a = a [ ( w a ) d ] 2 . Moreover, we have
a w x w = a w [ ( a w ) d ] 2 a w = ( a w ) d a w = a w ( a w ) d , a ( w x ) 2 = ( a w x w ) x = ( a w ) d a w [ ( a w ) d ] 2 a = x , ( a w x w ) * = a w x w .
lim n | | ( a w ) n a w x w ( a w ) n | | 1 n = 0 .
Furthermore, we verify that
x w a w = w a [ ( w a ) d ] 2 w a = w a ( w a ) d = ( w a ) d w a , ( x w ) 2 a = x w x w a = [ ( a w ) d ] 2 a w [ ( a w ) d ] 2 a w a = [ ( a w ) d ] 3 a w a = a w [ ( a w ) d ] 3 a = [ ( a w ) d ] 2 a = x , ( x w a w ) * = x w a w .
lim n | | ( w a ) n ( w a ) n w x w a | | 1 n = 0 .
Thus, a A w , d A w , d and a w , d = x = a w , d . Therefore we complete the proof by Theorem 4.4. □
Corollary 10. 
Let a A w , e . Then
a w , d = ( w a w ) ( a w ) d , ( w a ) d .
Proof. 
In view of Theorem 4.6, a w A d , w a A d . Let x = a w , d . Then we verify that
x ( w a w ) ( a w ) d = = [ ( a w ) d ] 2 a ( w a w ) ( a w ) d = ( a w ) d , ( w a ) d ( w a w ) x = ( w a ) d ( w a w ) a [ ( w a ) d ] 2 = ( w a ) d , x = x w a w x = ( a w ) d a ( w a ) d ( a w ) d A x x A ( w a ) d .
Therefore, w a w has ( a w ) d , ( w a ) d -inverse x, as asserted. □
An element a A has generalized w-Drazin inverse x if x satisfies the equations
a w x = x w a , x w a w x = x a n d a a w x w a A q n i l .
We denote such x by a d , w (see [14]).
Theorem 12. 
Let a A . Then the following are equivalent:
(1)
a A w , e .
(2)
a A d , w and a d , w A w , e .
(3)
a A d , w , ( a w a d , w w ) * = a w a d , w w and ( w a d , w w a ) * = w a d , w w a .
In this case, a w , e = a d , w .
Proof. ( 1 ) ( 2 ) By virtue of Theorem 4.6, a w A d . Hence a A d , w and a d , w = ( a w ) d a ( w a ) d = [ ( a w ) d ] 2 a = a [ ( w a ) d ] 2 .
Let x = a w , e . Then we have
x = a ( w x ) 2 , a w x = x w a , ( a w x w ) * = a w x w , ( w x w a ) * = w x w a , lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 .
We verify that
| | a w ( a w ) d a w x w ( a w ) ( a w ) d | | = | | ( a w ) n [ ( a w ) d ] n a w x w ( 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 = lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 , we deduce that
lim n | | a w ( a w ) d a w x ( 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 = a d , w w ( a w ) 2 x = [ ( a w ) d ] 2 a w ( a w ) 2 x = ( a w ) d ( a w ) 2 x = a w x , a d , w ( w z ) 2 = ( a d , w w z ) w z = ( a w x ) w ( a w ) 2 x = x w ( a w ) 3 x = ( a w ) 2 x = z , z ( w a d , w ) 2 = ( a w ) 2 x w a d , w w a d , w = [ ( a w ) 2 x w ( a w ) 2 ] [ ( a w ) d ] 2 a d , w w a d , w = [ ( a w ) 2 ( a w ) ] [ ( a w ) d ] 2 a d , w w a d , w = [ ( a w ) 2 ( a w ) d ] a d , w w a d , w = a d , w , ( a d , w w z w ) * = ( a w x w ) * = a w x w = a d , w w z w , w z w a d , w = w ( a w ) 2 x w a d , w = w x w ( a w ) 2 [ ( a w ) d ] 2 a = w x w a , ( w z w a d , w ) * = w z w a d , w .
Accordingly,
a d , w ( w z ) 2 = z , z ( w a d , w ) 2 = a d , w , ( a d , w w z w ) * = a d , w w z w , ( w z w a d , w ) * = w z w a d , w .
Then a d , w A w , e and ( a d , w ) w , e = z = ( a w ) 2 a w , e , as desired.
( 2 ) ( 1 ) Let z = ( a d , w ) w , e . Then
( a d , w w ) 2 z = a d , w , a d , w w z = z w a d , w , ( a d , w w z w ) * = a d , w w z w , ( w a d , w w z ) * = w a d , w w z .
Moreover, we verify that
a w a d , w = a w [ ( a d , w w ) 2 z ] = a w [ ( a d , w w ) ( a d , w w z ) = a w [ ( a d , w w ) ( z w a d , w ) ] = a w [ ( a w ) d ] 2 a w z w a d , w = z w a d , w = z w a d , w ( w a d , w ) w a ) = a d , w w z ( w a d , w ) w a ) = a d , w w ( z w a d , w ) w a = a d , w w ( a d , w w z ) w a = ( a d , w w ) 2 z w a = a d , w w a .
By hypothesis, we have
a d , w w z w = a ( w a d , w ) 2 w z w = a w [ ( a d , w w ) 2 z ] w = a w a d , w w .
Likewise, we have w a w a d , w = w a d , w w z ; hence, w a d , w w a = w a d , w w z . Accordingly, we have
a ( w a d , w ) 2 = a d , w , ( a w a d , w w ) * = a w a d , w w , ( w a d , w w a ) * = w a d , w w a .
Obviously, we have
lim n | | ( a w ) n a d , w w ( a w ) n + 1 | | 1 n = lim n | | ( a w ) n ( a w ) d ( a w ) n + 1 | | 1 n = 0 .
Therefore a w , e = a d , w , as required.
( 1 ) ( 3 ) Set x = a w , e . By virtue of Theorem 4.1, we have
x = a ( w x ) 2 , a w x = x w a , lim n | | ( a w ) n x w ( a w ) n + 1 | | 1 n = 0 .
Therefore a A d , w and a d , w = x = a w , e , as required.
( 3 ) ( 1 ) By hypothesis, ( a w a d , w w ) * = a w a d , w w and ( w a d , w w a ) * = w a d , w w a . Obviously, we have
a d , w = a ( w a d , w ) 2 , a w a d , w = a d , w w a lim n | | ( a w ) n a d , w w ( a w ) n + 1 | | 1 n = 0 .
In light of Theorem 4.1, a A w , e and a w , e = a d , w , as asserted. □

References

  1. J.K. Baksalary and G. Trenkler, A note on EP matrices, Linear Algebra Appl., 76(1986), 251–253.
  2. E. Boasso, Factorizations of EP Banach space operators and EP Banach algebra elements, J. Math. Anal. Appl., 379(2011), 245–255.
  3. 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.
  4. E. Boasso, On the Moore-Penrose inverse, EP Banach space operators, and EP Banach algebra elements, J. Math. Anal. Appl., 339(2008), 1003–1014.
  5. H. Chen and M. Sheibani, Properties of generalized weighted core inverses in Banach *-algebras, J. Algebra Appl., 2025, 2550358 (20 pages).
  6. H. Chen and M. Sheibani, The weighted w-core inverse and its associated decomposition, Preprints, 2025. https://doi.org10.20944/preprints202507.1889.
  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. M.P. Drazin, A class of outer generalized inverses, Linear Multilinear Algebra, 436 (2012), 1909–1923.
  9. D. Drivaliaris and S. Karanasios and D. Pappas, Factorizations of EP operators, Linear Algebra Appl., 429(2008), 1555–1567.
  10. A.K. EI-Sakkary, On the structure of linear systems, Internat. J. Control, 35(1982), 629–636.
  11. Y. Gao; J. Chen and P. Ptricio, Representations and properties of the W-weighted core-EP inverse, Linear Multilinear Algebra, 68(2020), 1160–1174.
  12. Y. Jia; X. Wang and J. Wei, SEP elements in a ring with involution, Filomat, 39(2025), 1119–1133.
  13. S. Karanasios, EP elements in rings and in semigroups with involution and in C*-algebras, Serdica Math. J., 41(2015), 83–116.
  14. D. Mosić, Weighted generalized Drazin inverse in rings, Georgian Math. J., 23(2016), 587–594.
  15. D. Mosić, Weighted core-EP inverse and weighted core-EP pre-orders in a C*-algebra, J. Aust. Math. Soc., 111(2021), 76–110.
  16. D. Mosić; D.S, Djordjević and J.J. Koliha, EP elements in rings, Linear Algebra Appl., 4319(2009), 527–535.
  17. D. Mosić and D.S, Djordjević, New characterizations of EP, generalized normal and generalized Hermitian elements in rings, Appl. Math. Comput., 218(2012), 6702–6710.
  18. D. Mosić and D.S, Djordjević, Further results on partial isometries and EP elements in rings with involution, Math. Comput. Model., 54(2011), 460–465.
  19. 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.
  20. D. Mosić and J. Marovt, Weighted generalized core-EP inverse, Linear Multilinear Algebra, 2024, 1–22. [CrossRef]
  21. 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.
  22. L. Wang; D. Mosic and Y. Gao, New results on EP elements in rings with involution, Algebra Colloq., 29(2022), 39–52.
  23. L. Wang; P. Zhai; T. Li and H. Zou, The one-sided EP invertibility and the related generalized inverses, Commun. Algebra, 53(2025), 3046–3061.
  24. S. Xu, Core invertibility of triangular matrices over a ring, Indian J. Pure Appl. Math., 50(2019), 837–47.
  25. S. Xu; J. Chen and J. Benítez, EP elements in rings with involution, Bull. Malays. Math. Sci. Soc., 42(2019), 3409–3426.
  26. S. Xu; J. Chen and X. Zhang, New characterizations for core inverses in rings with involution, Front. Math. 2017. [CrossRef]
  27. H. Zhou; A. Li and J. Wei, Characterizations of EP elements in rings with involution, Filomat, 36(2022), 5813–5820.
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