Preprint
Article

This version is not peer-reviewed.

Weighted EP Elements in Rings

Submitted:

16 October 2026

Posted:

16 October 2026

You are already at the latest version

Abstract
We introduce the novel concept of weighted EP elements with respect to two elements in a ring to establish a unified framework that naturally generalizes classical EP elements. We then characterize the fundamental properties of weighted EP elements, demonstrating that many classical properties extend to this general setting with two weights. The relations among the weighted EP element, the weighted group inverse, the weighted core inverse, and the weighted Moore-Penrose inverse are thereby established.
Keywords: 
;  ;  ;  ;  

1. Introduction

Let R be a ring with involution *. An element a in R is an EP element if there exists some x ∈ R such that a x 2 = x , x a 2 = a , ( a x ) * = a x , a x = x a (see [15]). Let C n × n be the ring of all n × n complex matrices with conjugate transpose *. Evidently, A ∈ C n × n is an EP matrix if and only if r a n k ( A ) = r a n k ( A * ) if and only if A A * = A * A . EP elements are a specialized class of elements within ring and algebra, characterized by a specific relationship between the element and its Moore-Penrose inverse or generalized inverses in structured settings such as rings, Banach algebras and C * -algebras. EP elements in a ring and algebra are expensively studied by many authors. Their study bridges abstract algebra and operator theory, with applications in matrix analysis, functional analysis, and beyond (see [1,3,5,6,7,8,9,10,13,14,16,18,20,21]).
Zhu et al. introduced and studied w-core inverse for a ring element (see [22]). Let a , w ∈ A . An element a ∈ A has w-core inverse if there exists x ∈ A such that a w x 2 = x , ( a w x ) * = a w x , x a w a = a . If such x exists, it is unique, and denote it by a w # . Let R w # denote the set of all w-core invertible elements in R. We refer the reader to [11,19] for more results on the w-core inverse. Following Lu, an element a ∈ R is a w-EP element if there exists x ∈ R such that a w x 2 = x , x a w a a a and ( x a w ) * = x a w . Let R w E P denote the set of all w-EP elements in R. Evidently, a ∈ R E P if and only if a ∈ R w # and a w a w # = a w # a w (see [12][Theorem 2.10 and Theorem 2.12]).
Let a , v , w ∈ R . We consider the solution of a system of equations involving a , v , w , which aims to extend EP and w-EP elements to a broader class of elements with two weights. We adopt
Definition 1.1.
An element a ∈ R is a ( v , w ) -weighted EP element if there exists x ∈ R such that
x v a w a = a , a w x v x = x , ( a w x v ) * = a w x v , a w x v = x v a w .
In Section 2, we present the fundamental properties of ( v , w ) -weighted EP elements. Let R v , w E P be the set of all ( v , w ) -weighted EP elements in R. We prove that a ∈ R v , w E P if and only if there exists x ∈ R such that x v a w a = a , a w x v x = x , ( x v a w ) * = x v a w , if and only if there exists a projection p ∈ R (i..e., p 2 = p = p * ) such that
a w + p ∈ R − 1 , 1 − p ∈ R v , a w p = p a = 0 .
Here, R − 1 denotes the set of all invertible elements in R.
Definition 1.2.
An element a ∈ R has ( v , w ) -weighted group inverse if there exists x ∈ R such that
x v a w a = a , a w x v x = x , a w x v = x v a w .
The preceding x is unique if it exists, and we denote it by a v , w # .
The set of all ( v , w ) -weighted group invertible elements in R is denoted by R v , w # .
Definition 1.3.
An element a ∈ R is ( v , w ) -weighted MP invertible if there exists x ∈ R such that
a w x v a = a , x v a w x = x , ( a w x v ) * = a w x v , ( x v a w ) * = x v a w .
We use R v , w † to stand for the set of all ( v , w ) -weighted MP invertible elements in R. In Section 3, we provide characterizations of ( v , w ) -weighted EP elements in terms of related images. It is shown that a ∈ R v , w E P if and only if a ∈ R v , w # and a R = ( a w ) * R , and respectively, if and only if a ∈ R v , w † and a R = ( a w ) * R .
Finally, Section 4 further explore ( v , w ) -weighted EP elements via its weighted MP invertibility, proving that a ∈ R v , w E P if and only if a ∈ R v , w † and a v , w † v = u ( a w ) for some u ∈ R − 1 . These elements are also characterized using related weighted core inverse.

2. Weighted EP Elements

The aim of this section is to present fundamental properties of weighted EP elements in a ring. We begin with
Theorem 2.1.
Let a , v , w ∈ R . Then the following are equivalent:
(1)
a ∈ R v , w E P .
(2)
There exists x ∈ R such that
x v a w x = x , a w x v a = a , ( a w x v ) * = x v a w .
Proof. ( 1 ) ⇒ ( 2 ) By hypothesis, there exists x ∈ R such that
x v a w x = x , a w x v a = a , a w x v = x v a w , ( a w x v ) * = a w x v .
Then ( a w x v ) * = x v a w . Moreover, we have
x v a w a = a w x v a = a , a w x v x = x v a w x = x ,
as required.
( 2 ) ⇒ ( 1 ) By hypothesis, there exists x ∈ R such that
x v a w a = a , a w x v x = x , ( a w x v ) * = x v a w .
Then a x ( x v ) 2 = x v . This implies that a w x v = x v a w by [16][Lemma 2.1]. Hence x v a w x = ( a w x v ) x = a w x v x = x and a w x v a = x v a w a = a , as required. □
Corollary 2.2.
Let a , v , w ∈ R . Then a ∈ R v , w E P if and only if there exists a v , w # such that a w a v , w # v * = a w a v , w # v .
Proof. 
⟹ Set x = a ∈ R v , w E P . Then x ∈ R v , w # . Moreover, we see that ( a w x v ) * = a w x v , as required.
⟸ By hypothesis, we have x ∈ R v , w # such that ( a w x v ) * = a w x v . Furthermore, we have x v a w a = a , a w x v x = x , a w x v = x v a w . Thus we check that
x v a w x = a w x v x = x , a w x v a = x v a w a = a , ( a w x v ) * = a w x v = x v a w .
By virtue of Theorem 2.1, a ∈ R v , w E P . □
We are ready to prove:
Theorem 2.3.
Let a , v , w ∈ R . Then the following are equivalent:
(1)
a ∈ R v , w E P .
(2)
There exists x ∈ R such that
a w x v a = a , a w x v x = x , ( a w x v ) * = x v a w .
Proof. ( 1 ) ⇒ ( 2 ) By hypothesis, there exists x ∈ R such that
x v a w x = x , a w x v a = a , a w x v = x v a w , ( a w x v ) * = a w x v .
Hence, ( a w x v ) * = x v a w . Moreover, we check that a w x v x = ( a w x v ) x = ( x v a w ) x = x , as required.
( 2 ) ⇒ ( 1 ) By hypothesis, there exists x ∈ R such that
a w x v a = a , a w x v x = x , ( a w x v ) * = x v a w .
Suppose that there exists y ∈ R such that
a w y v a = a , a w y v y = y , ( a w y v ) * = y v a w .
In view of [16][Lemma 2.1], a w x v = x v a w , a w y v = y v a w . Hence,
x = a w x v x = [ a w y v a ] w x v x = y v [ a w a ] w x v x = y v [ a w x v a ] w x = y v a w x .
Likewise, we have y = x v a w y . Then
y = y v a w x = ( y v a w ) * x = ( y v a w x v a w ) * x = ( x v a w ) * x = a w x v x = x .
Therefore x = y .
We check that
a w [ x v a w x ] v a = [ a w x v a ] w x v a = a w x v a = a , a w [ x v a w x ] v [ x v a w x ] = ( a w x v a ) w x v x v a w x = ( a w x v x ) v a w x = x v a w x , a w ( x v a w x ) v = [ a w x v a ] w x v = a w x v , ( x v a w x ) v a w = x v [ a w x v a ] w = x v a w , a w ( x v a w x ) v * = ( x v a w x ) v a w .
By the uniqueness of x, we obtain
x v a w x = x , a w x v a = a , a w x v = x v a w , ( a w x v ) * = a w x v
Therefore a ∈ R v , w E P . □
Corollary 2.4.(see [18][Theorem 2.7 and Theorem 2.11]) Let a ∈ R . Then the following are equivalent:
(1)
a ∈ R E P .
(2)
There exists x ∈ R such that a 2 x = a , a x = x a , ( a x ) * = a x .
(3)
There exists x ∈ R such that a 2 x = a , x 2 a = x , ( a x ) * = a x .
Proof. 
This is obvious by choosing v = w = 1 in Theorem 2.3. □
Theorem 2.5.
Let a , v , w ∈ R . Then the following are equivalent:
(1)
a ∈ R v , w E P .
(2)
There exists x ∈ R such that x v a w a = a , ( a w x v ) * = x v a w .
(3)
There exists a v , w # such that a w a v , w # v = a v , w # v a w .
Proof. ( 1 ) ⇒ ( 3 ) Let x = a w E P . Obviously, we have x = a v , w # and a w x v = x v a w , as desired.
( 3 ) ⇒ ( 2 ) Let x = a v , w # . Then x v a w a = a , ( a w x v ) * = a w x v . By hypothesis, a w x v = x v a w , as desired.
( 2 ) ⇒ ( 1 ) By hypothesis, there exists x ∈ R such that
x v a w a = a , ( a w x v ) * = x v a w .
Then x v ( a w ) 2 = a w . In view of [16][Lemma 2.1], we have x v a w = a w x w . Hence ( a w x v ) * = x v a w = a w x v , and so a = x v a w a = ( x v a w ) a = ( a w x v ) * a = a w x v a .
Let z = x v a w x . Then
z v a w z = x v ( a w x v a ) w x v a w x = x v ( a w x v a ) w x = x v a w x = z , z v a w a = x v a w [ x v a w a ] = x v a w ( x v a w a ) = x v a w a = a , z v a w = x v ( a w x v a ) w = x v a w = ( a w x v ) * , ( z v a w ) * = a w x v = ( a w x v ) * = z v a w , a w z v z = ( a w x v a ) w x v x v a w x = ( x v ) 3 ( a w ) 3 x = ( x v ) ( a w ) x = z .
Therefore a ∈ R v , w E P by Theorem 2.1. □
Corollary 2.6.
Let a ∈ R and w ∈ R − 1 . Then the following are equivalent:
(1)
a ∈ R w , w E P .
(2)
There exists x ∈ R such that ( a w ) 2 x = a , ( a w x w ) * = x w a w .
Proof. 
This is proved by Theorem 2.5 and [16][Theorem 2.3]. □
Theorem 2.7.
Let a , v , w ∈ R . Then the following are equivalent:
(1)
a ∈ R v , w E P .
(2)
There exists x ∈ R such that a w x v x = x , x v a w a = a , ( x v a w ) * = x v a w .
Proof. ( 1 ) ⇒ ( 2 ) By hypothesis, there exists x ∈ R such that a w x v x = x , x v a w a = a , a w x v = x v a w , ( a w x v ) * = a w x v . Thus ( x v a w ) * = x v a w , as required.
( 2 ) ⇒ ( 1 ) By hypothesis, we deduce that
( x v a w ) * = ( a w x v x ) v a w * = ( a w x v ) ( x v a w ) * = ( x v a w ) * ( a w x v ) * = ( x v a w ) ( a w x v ) = ( x v a w a ) w x v = a w x v .
Hence ( a w x v ) * = x v a w . Moreover, we have
( a w x v ) * = x v a w = ( a w x v x ) v a w = ( a w x v ) ( x v a w ) = ( a w x v ) ( a w x v ) * .
Hence, ( a w x v ) * = a w x v . Therefore we complete the proof. □
Recall that an element a ∈ R has ( v , w ) -weighted core inverse if there exists x ∈ R such that x v a w a = a , a w x v x = x , ( a w x v ) * = a w x v . Let R v , w # be the set of all ( v , w ) -weighted core invertible elements in R.
Corollary 2.8.
Let a , v , w ∈ R . Then the following are equivalent:
(1)
a ∈ R v , w E P .
(2)
There exists a v , w # such that a v , w # v # = a w .
Proof. ( 1 ) ⇒ ( 2 ) Set x = a v , w # . By hypothesis, we verify that
x v ( a w ) 2 = ( a w x v a ) w = a w , ( a w ) x v x = x v a w x = x , ( x v a w ) * = ( a w x v ) * = a w x v = x v ( a w ) .
Therefore x v # = a w , as desired.
( 2 ) ⇒ ( 1 ) Set x = a v , w # . Then a w x v x = x , x v a w a = a . Since x v # = a w , we have ( x v a w ) * = x v a w . Accordingly, we obtain the result. □
As is well known, every EP element possess the polar-like property, i.e., there exists a projection p ∈ R such that a + p ∈ R − 1 , a p = p a = 0 (see [18][Theorem 3.2]). We next extend this result and establish the polar-like property of weighted EP elements.
Theorem 2.9.
Let a ∈ R . Then the following are equivalent:
(1)
a ∈ R v , w E P .
(2)
There exists a projection p ∈ R such that
a w + p ∈ R − 1 , 1 − p ∈ R v , a w p = p a = 0 .
Proof. ( 1 ) ⇒ ( 2 ) Set x = a v , w # and p = 1 − a w x v . Then p 2 = p = p * . Moreover, we check that
a w + p = a w + 1 − a w x v = ( x v + 1 − a w x v ) − 1 ∈ R − 1 , 1 − p = a w x v ∈ R v , a w p = a w ( 1 − a w x v ) = a w − a w x v a w = 0 , p a = ( 1 − a w x v ) a = 0 ,
as required.
( 2 ) ⇒ ( 1 ) By hypothesis, there exists a projection p ∈ R such that
a w + p ∈ R − 1 , 1 − p ∈ R v , a w p = p a = 0 .
Set x = ( 1 − p ) ( a w + p ) − 1 . Then x = ( a w + p ) − 1 ( 1 − p ) ∈ A v . Write x = z v with ( 1 − p ) z = z . Then
a w z v z = a w z v z = a w x z = a w ( 1 − p ) ( a w + p ) − 1 z = ( 1 − p ) ( a w + p ) ( a w + p ) − 1 z = ( 1 − p ) z = z , z v a w a = x a w a = ( 1 − p ) ( a w + p ) − 1 a w a = ( 1 − p ) ( a w + p ) − 1 ( a w + p ) a = ( 1 − p ) a = a , z v a w = x a w = ( 1 − p ) ( a w + p ) − 1 a w = ( a w + p ) − 1 a w ( 1 − p ) = ( a w + p ) − 1 ( a w + p ) ( 1 − p ) = 1 − p , a w z v = a w x = a w ( 1 − p ) ( a w + p ) − 1 = ( a w + p ) ( a w + p ) − 1 ( 1 − p ) = 1 − p .
Therefore a ∈ R v , w E P . □
Corollary 2.10.
Let a ∈ R . Then the following are equivalent:
(1)
a ∈ R v , w E P .
(2)
a ∈ R v , w # and a w p = 0 , where p = 1 − a w a v , w # v .
Proof. ( 1 ) ⇒ ( 2 ) Since a w a v , w # v = a v , w # v a w , we deduce that
a w p = a w [ 1 − a w a v , w # v ] = a w − [ a w a v , w # v a ] w = 0 ,
as required.
( 2 ) ⇒ ( 1 ) Clearly, p 2 = p = p * . Moreover, we check that
a w + p ∈ R − 1 , 1 − p ∈ R v , a w p = p a = 0 .
Therefore we obtain the result by Theorem 2.9. □

3. Image-Based Characterizations

In this section, we establish certain equivalent conditions on weighted group elements to be the weighted EP element. We now derive
Theorem 3.1.
Let a , v , w ∈ R . Then the following are equivalent:
(1)
a ∈ R v , w E P .
(2)
a ∈ R v , w # and a R = ( a w ) * R .
(3)
a ∈ R v , w # and a R ⊆ ( a w ) * R .
Proof. ( 1 ) ⇒ ( 2 ) Clearly, a ∈ R v , w # . Since a = a w x v a = ( a w x v ) a = ( a w x v ) * a = ( x v a w ) * a = ( a w ) * ( x v ) * a , we have a R ⊆ ( a w ) * R . As a w = ( a w x v a ) w = a w ( x v a w ) , we see that ( a w ) * = ( x v a w ) * ( a w ) * = ( x v a w ) ( a w ) * = ( a w ) ( x v ) ( a w ) * ∈ a R ; whence, ( a w ) * R ⊆ a R . Therefore a R = ( a w ) * R .
( 2 ) ⇒ ( 3 ) This is trivial.
( 3 ) ⇒ ( 1 ) Set x = a v , w # . Then a w x v a = a and x v a w = a w x v . Write a = ( a w ) * z for a z ∈ R . Then ( x v a w ) * = ( a w x v ) * = ( x v ) * ( a w ) * . We easily see that a w x v a w = ( a w x v a ) w = a w ; hence, ( x v a w ) * ( a w ) * = ( a w ) * . Thus ( x v a w ) * ( a w ) * z = ( a w ) * z , and so ( x v a w ) * a = a . We deduce that ( x v a w ) * a w x v = a w x v ; whence ( x v a w ) * ( x v a w ) = x v a w . Then ( x v a w ) * = ( x v a w ) * ( x v a w ) = x v a w . Clearly, a w x v x = x v a w x = x and x v a w a = a w x v a = a . Therefore a ∈ R v , w E P . □
Corollary 3.2.
Let a , v , w ∈ R . Then the following are equivalent:
(1)
a ∈ R v , w E P .
(2)
a ∈ R v , w # and a R = ( v a w ) * R .
(3)
a ∈ R v , w # and a R ⊆ ( v a w ) * R .
Proof. ( 1 ) ⇒ ( 2 ) Obviously, a ∈ R v , w # . Since a = x v a w a = ( x v a w ) * a = ( v a w ) * x * a , we have a R ⊆ ( v a w ) * R . As v a w = v ( a w x v a ) w = v a w ( x v a w ) , it follows that ( v a w ) * = ( x v a w ) * ( v a w ) * = ( x v a w ) ( v a w ) * = ( a w ) ( x v ) ( v a w ) * ∈ a R , and then ( v a w ) * R ⊆ a R . We infer that a R = ( v a w ) * R , as required.
( 2 ) ⇒ ( 3 ) This is trivial.
( 3 ) ⇒ ( 1 ) Since a R ⊆ ( v a w ) * R = ( a w ) * v * R ⊆ ( a w ) * R . This completes the proof by Theorem 3.1. □
Corollary 3.3.
Let a , w ∈ R . Then the following are equivalent:
(1)
a ∈ R w , w E P .
(2)
a ∈ R w , w # and a R = ( a w ) * R .
(3)
a ∈ R w , w # and a R ⊆ ( a w ) * R .
Proof. ( 1 ) ⇒ ( 2 ) Clearly, a ∈ R w , w # . By virtue of Theorem 3.1, a R = ( a w ) * R .
( 2 ) ⇒ ( 3 ) This is clear.
( 3 ) ⇒ ( 1 ) By hypothesis, there exists x ∈ R such that x w a w a = a , a w x w x = x , ( a w x w ) * = a w x w . Set z = ( x w ) 2 a . Then we verify that
a w z w = a w ( x w ) 2 a w = x w a w , z w a w = ( x w ) 2 ( a w ) 2 = x w a w a w z w = z w a w , z w a w a = ( x w a w ) a = a , a w z w z = ( x w a w ) ( x w ) 2 a = ( x w ) 2 a = z .
This implies that a w , w # = x . Therefore we complete the proof by Theorem 3.1. □
Theorem 3.4.
Let a , v , w ∈ R . Then the following are equivalent:
(1)
a ∈ R v , w E P .
(2)
a ∈ R v , w † and a R = ( a w ) * R .
(3)
a ∈ R v , w † and a R = ( v a w ) * R .
Proof. ( 1 ) ⇒ ( 2 ) Obviously, a ∈ R v , w † . By virtue of Corollary 3.3, a R = ( a w ) * R .
( 2 ) ⇒ ( 1 ) Set x = a v , w † . Then we have a w x v a = a , x v a w x = x , ( a w x v ) * = a w x v and ( x v a w ) * = x v a w . Since a R = ( a w ) * R , we see that R a * = R ( a w ) . As a w x v a w = a w , we have ( x v a w ) * ( a w ) * = ( a w ) * , and so x v a w a = a .
As a w x v a = a , we get a w x v ( a w ) * = ( a w ) * . Then ( a w ) ( a w x v ) = a w . This implies that ( x v a w ) ( a w x v ) = x v a w . Therefore ( x v a w ) ( a w x v ) x = ( x v a w ) x = x . Accordingly, we deduce that
a w x v x = [ x v a w a ] w x v x = ( x v a w ) ( a w x v ) x = x ,
as required.
( 3 ) ⇒ ( 2 ) Clearly, a R = ( v a w ) * R = ( a w ) * v * R ⊆ ( a w ) * R . Set x = a v , w † . Then a w = a w x v a w = ( a w x ) ( v a w ) . Hence, ( a w ) * R = ( v a w ) * ( a w x ) * R ⊆ ( v a w ) * R = a R . Thus, a R = ( a w ) * R , as asserted. □
We use [ x , y ] to stand the commutator of x and y, i.e., [ x , y ] = x y − y x . We derive
Corollary 3.5.
Let a , v , w ∈ R . Then the following are equivalent:
(1)
a ∈ R v , w E P .
(2)
There exists a v , w † such that [ a w , a v , w † v ] = 0 .
Proof. ( 1 ) ⇒ ( 2 ) This is obvious.
( 2 ) ⇒ ( 1 ) Since [ a w , a v , w † v ] = 0 , we see that a w a v , w † v = a v , w † v a w . Clearly, a = [ a w a v , w † v ] a = [ a v , w † v a w ] a = [ a v , w † v a w ] * a = ( a w ) * [ a v , w † v ] * a . On the other hand, we have
( a w ) * = ( a w a v , w † v a w ) * = ( a v , w † v a w ) * ( a w ) * = a v , w † v a w ( a w ) * = a w a v , w † v ( a w ) * .
Therefore a R = ( a w ) * R , thus yielding the result by Theorem 3.4. □
Lemma 3.6.
Let a ∈ R v , w E P . Then x v a w x = x .
Proof. 
By hypothesis, we can find x ∈ R such that a w x v x = x , x v a w a = a , ( a w x w ) * = a w x w , ( x w a w ) * = x w a w . Then x v a w x = x v a w [ a w x v x ] = [ x v a w a ] w x v x = a w x v x = x . □
We use ℓ ( x ) and r ( x ) to denote the left and right annihilator of x in R, respectively. We deduce that
Theorem 3.7.
Let a , v , w ∈ R . Then the following are equivalent:
(1)
a ∈ R v , w E P .
(2)
There exists x ∈ R such that a w x v a = a , x R = a R , R x * = R a w .
(3)
There exists x ∈ R such that x v a w x = x , x R = a R , R x * = R a w .
(4)
There exists x ∈ R such that a w x v a = a , ℓ ( x ) = ℓ ( a ) , r ( x * ) = r ( a w ) .
(5)
There exists x ∈ R such that x v a w x = x , ℓ ( x ) = ℓ ( a w ) , r ( x * ) = r ( a w ) .
Proof. ( 1 ) ⇒ ( 2 ) Let x = a v , w E P . In view of Theorem 2.1 and Theorem 2.7, a w x v a = a , a w x v x = x , x v a w a = a , ( x v a w ) * = x v a w . Hence, x = a ( w x v x ) ∈ a R and a = x v a w a ∈ x R . This implies that x R = a R . By virtue of Lemma 3.6, x = x v a w x , and so x * = x * ( x v a w ) * = x * x v a w ∈ R a w . Since a = a w x v a , we have a w = a w ( x v a w ) = a w ( x v a w ) * = a w ( v a w ) * x * ∈ R x * . Therefore R x * = R a w .
( 2 ) ⇒ ( 4 ) If r x = 0 for r ∈ R , then r a = 0 . If r a = 0 for r ∈ R , then r x = 0 . Hence ℓ ( x ) = ℓ ( a ) . Likewise, we have r ( x * ) = r ( a w ) , as desired.
( 4 ) ⇒ ( 1 ) Since a w x v a = a , we have 1 − a w x v ∈ ℓ ( a ) , and then 1 − a w x v ∈ ℓ ( x ) . Hence x = a w x v x , and so x * = x * ( a w x v ) * . This implies that 1 − ( a w x v ) * ∈ r ( x * ) ; and then 1 − ( a w x w ) * ∈ r ( a w ) . We infer that a w = ( a w x v ) * a w ; whence, a w x v = ( a w x v ) * a w x v . Therefore ( a w x w ) * = ( a w x v ) * a w x v = a w x v . As 1 − x v a w ∈ r ( a w ) , we have 1 − x v a w ∈ r ( x * ) . it follows that x * = x * x w a w . Then ( v a w ) * x * = ( v a w ) * x * x v a w , i.e., ( x v a w ) * = ( x v a w ) * x v a w . Thus ( x v a w ) * = x v a w .
Since a = a w x v a , we have a w = a w x v a w ; hence, 1 − x v a w ∈ r ( a w ) . This implies that 1 − x v a w ∈ r ( x * ) ; whence x * = x * ( x v a w ) . Then x = ( x w a w ) * x = x v a w x . We infer that 1 − x v a w ∈ ℓ ( x ) = ℓ ( a ) . It follows that a = x v a w a . Therefore a ∈ R v , w E P by Theorem 2.7.
( 1 ) ⇒ ( 3 ) By virtue of Lemma 3.6, x = x w a w x . As in the argument above, we prove that x R = a w R , R x * = R a w , as required.
( 3 ) ⇒ ( 5 ) This is obvious.
( 5 ) ⇒ ( 1 ) This is similar to the discussion in ( 3 ) ⇒ ( 1 ) . □
Corollary 3.8.
Let a , w ∈ R . Then the following are equivalent:
(1)
a ∈ R w E P .
(2)
There exists x ∈ R such that a w x a = a , x R = a R , R x * = R a w .
(3)
There exists x ∈ R such that x a w x = x , x R = a R , R x * = R a w .
(4)
There exists x ∈ R such that a w x a = a , ℓ ( x ) = ℓ ( a ) , r ( x * ) = r ( a w ) .
(5)
There exists x ∈ R such that x a w x = x , ℓ ( x ) = ℓ ( a w ) , r ( x * ) = r ( a w ) .
Proof. 
This is obvious by choosing v = 1 in Theorem 3.7. □

References

  1. Boasso, E. Factorizations of EP Banach space operators and EP Banach algebra elements. J. Math. Anal. Appl. 2011, 379, 245–255. [Google Scholar] [CrossRef]
  2. Cao, L.; Wei, J. Characterizations of EP elements via w-core inverses. Filomat 2025, 39, 8737–8745. [Google Scholar] [CrossRef]
  3. Chen, H.; Sheibani, M. New additive properties of EP elements in a ring with involution. Commun. Algebra 2025, 53, 3881–3891. [Google Scholar] [CrossRef]
  4. Chen, J.; Zhu, H.; Patricio, P.; Zhang, Y. Characterizations and representations of core and dual core inverses. Canad. Math. Bull. 2017, 60, 269–282. [Google Scholar] [CrossRef]
  5. Chen, W. On EP elements, normal elements and partial isometries in rings with involution. Electron. J. Linear Algebra 2012, 23, 553–561. [Google Scholar] [CrossRef]
  6. Djordjević, D.S. Products of EP operators on Hilbert spaces. Proc. Amer. Math. Soc. 2000, 129, 1727–1731. [Google Scholar] [CrossRef]
  7. Djordjević, D.S. Characterization of normal, hyponormal and EP operators. J. Math. Anal. Appl. 2007, 329, 1181–1190. [Google Scholar] [CrossRef]
  8. Djordjević, D.S.; Koliha, J.J. Characterizing Hermitian, normal and EP operators. Filomat 2007, 21, 39–54. [Google Scholar] [CrossRef]
  9. Djordjević, D.S.; Koliha, J.J.; Straksraba, I. Factorization of EP elements in C*-algebras. Linear Multilinear Algebra 2009, 57, 587–594. [Google Scholar] [CrossRef]
  10. Hu, T.; Li, J.; Wang, Q.; Wei, J. Some new characterizations of EP elements, partial isometries and strongly EP elements in rings with involution. Georgian Math. J. 2023, 30, 445–452. [Google Scholar] [CrossRef]
  11. Jin, T.; Zhu, H.; Wu, L. New characterizations for w-core inverses in rings with involution. Filomat 2023, 37, 2131–2139. [Google Scholar] [CrossRef]
  12. Lu, Q.; Shi, S.; Wang, L. The complete w-core inverse in semigroups. Filomat 2026, 40, 1045–1054. [Google Scholar] [CrossRef]
  13. Mary, X.; Patrício, P. When is a product of EP elements again EP? Linear Multilinear Algebra 2026, 74, 242–254. [Google Scholar] [CrossRef]
  14. Mosić, D.; S, D.; Djordjevic. Partial isometries and EP elements in rings with involution. Electron. J. Linear Algebra 2009, 18, 761–722. [Google Scholar] [CrossRef]
  15. Mosić, D.; S, D.; Djordjevic; Koliha, J.J. EP elements in rings. Linear Algebra Appl. 2009, 4319, 527–535. [Google Scholar] [CrossRef]
  16. Wang, L.; Mosic, D.; Gao, Y. New results on EP elements in rings with involution. Algebra Colloq. 2022, 29, 39–52. [Google Scholar] [CrossRef]
  17. Xu, S.; Chen, J. The Moore-Penrose inverse in rings with involution. Filomat 2019, 33, 5791–5802. [Google Scholar] [CrossRef]
  18. Xu, S.; Chen, J.; Benítez, J. EP elements in rings with involution. Bull. Malays. Math. Sci. Soc. 2019, 42, 3409–3426. [Google Scholar] [CrossRef]
  19. Zhang, Q.; Wang, C.; Zhu, H. Characterizations and representations of w-core inverses in rings. Filomat 2023, 37, 3183–3190. [Google Scholar] [CrossRef]
  20. Zhao, R.; Wei, J. Special Sylvester equations, PI and EP elements in rings with involution. J. Algebra Appl. Article ID 2450204, 12 p. 2024, 23(No. 12). [Google Scholar] [CrossRef]
  21. Zhou, H.; Li, A.; Wei, J. Characterizations of EP elements in rings with involution. Filomat 2022, 36, 5813–5820. [Google Scholar] [CrossRef]
  22. Zhu, H.; Wu, L.; Chen, J. A new class of generalized inverses in semigroups and rings with involution. Commun. Algebra 2023, 51, 2098–2113. [Google Scholar] [CrossRef]
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.