Next Article in Journal
Compactness of the Complex Green Operator on C1 Pseudoconvex Boundaries in Stein Manifolds
Previous Article in Journal
Long-Term Behavior of Lotka–Volterra Model with Lévy Jump in Countable State-Dependent Environments
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Characterizations of SEP Elements in a Ring with Involution

School of Mathematical Science, Yangzhou University, Yangzhou 225002, China
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(21), 3565; https://doi.org/10.3390/math13213565
Submission received: 19 September 2025 / Revised: 31 October 2025 / Accepted: 4 November 2025 / Published: 6 November 2025
(This article belongs to the Special Issue Recent Advances in Generalized Inverses and Matrix Theory)

Abstract

The characterization of SEP elements is a classical problem in generalized inverse theory. Most existing characterizations are formulated in terms of specific algebraic identities. This paper proposes a new approach based on polynomial equations with parameters to characterize SEP elements. This framework provides an alternative characterization and, more importantly, naturally clarifies the structural relationships between SEP elements and three other types of elements: square rootable elements, invertible elements, and involutional projection elements.
MSC:
16A30; 16A50; 16E50; 16D30; 16B99; 16W10

1. Introduction

Let R be an associative ring with 1, and let a R . Then a is called group invertible if there is a # R such that
a a # a = a , a # a a # = a # , a a # = a # a ;
a # is a group inverse of a and it is uniquely determined by these equations [1]. We use R # to denote the set of all group invertible elements of R. Recent work can be referenced in [2].
An involution ∗: a a * in R is an anti-isomorphism of drgee 2, that is,
( a * ) * = a , ( a b ) * = b * a * , ( a + b ) * = a * + b * .
A ring R with involution is called a ∗-ring. An element a R satisfying a a * = a * a is called normal. In this article, R is always a ∗-ring.
An element a R is said to be Moore-Penrose invertible if the following equations:
a x a = a , x a x = x , ( a x ) * = a x , ( x a ) * = x a
have a common solution. Such solution is unique if it exists [3]. We call it the Moore-Penrose inverse of a and denote it by a (see, e.g., [1,4,5,6]). The set of all Moore-Penrose invertible elements of R is denoted by R .
We call an element a R # R EP if a # = a (see [3]). The equivalent conditions under which the elements of R is EP can be found in [7,8,9,10,11,12,13,14,15]. The set of all EP elements of R is denoted by R E P . An element a R is called partial isometry if a = a * (see [12,16,17]). Mosić and Djordjević provide numerous equivalence characterizations of EP elements that are partial isometry in [17,18]. The second author and Zhao [19] termed these elements strongly EP elements (abbreviated as SEP), characterizing them using equations. Guan and Wei [20] characterized the SEP elements via the existence of solutions to equations within a given set. Cao et al. [21] constructed additional equations characterizing SEP elements and further characterized them using w-core inverses. Li et al. [22] presented numerous new properties and equivalent characterizations of SEP elements. For further related results, see [23,24]. The set of SEP elements of R will be denoted by R S E P . For a ring R, E ( R ) denotes the set of all idempotent elements of R. We call e E ( R ) projection if e * = e . The set of all projections of R will be denoted by P E ( R ) .
The study of SEP elements has traditionally relied on definitions that explicitly involve various types of inverses. This paper establishes a new perspective by showing that a simple linear equation provides a complete characterization of these elements. Moving beyond a mere reformulation, this equation-based approach proves to be a powerful tool. As a direct application of this perspective, we demonstrate that the analysis of the equation’s structure naturally leads to the introduction of three key types of elements: involutional projection elements, square-rootable elements, and invertible elements. We then show that these concepts yield a novel characterization of SEP elements, revealing their fundamental properties through these equivalences. Furthermore, we extend this approach to multivariate and nonlinear settings, obtaining a unified framework for understanding SEP elements through systems of equations.

2. The Construction of Projection Elements

The following lemma can be found in [25].
Lemma 1.
Let a R # R . Then a R S E P if and only if ( a # ) 2 a = a * a a # .
Observing the equality ( a # ) 2 a = a * a a # in Lemma 1, we can construct the following Equation (1).
( a # ) 2 x = a * x a # .
Let a R # R and set ς a = { a , a # , a , ( a ) * , ( a # ) * , a a 3 a , ( a a # ) * a ( a a # ) * } .
Theorem 1.
Let a R # R . Then a R S E P if and only if the Equation (1) has at least one solution in ς a .
Proof. 
⇒ It is obvious by Lemma 1.
⇐ Applying the assumption, we have:
(1)
If x = a is a solution, then a # = a * a a # . We get a # a = a * a . By [23] (Theorem 1.5.3), we have a R S E P .
(2)
If x = a # is a solution, then ( a # ) 3 = a * ( a # ) 2 . Multiplying the equation on the right by a 2 , we obtain a # = a * a a # . Hence a R S E P by (1).
(3)
If x = a is a solution, then ( a # ) 2 a = a * a a # . Thus a R S E P by [23] (Theorem 1.5.3).
(4)
If x = ( a ) * is a solution, then ( a # ) 2 ( a ) * = a a a # . Multiplying the equation on the left by a 2 , we obtain a * = a . Noting that a * a = a a = a a a # a = ( a # ) 2 ( a ) * a = ( a # ) 2 a 2 = a # a . By [23] (Theorem 1.5.3), we have a R S E P .
(5)
If x = ( a # ) * is a solution, then ( a # ) 2 ( a # ) * = a * ( a # ) * a # . Multiplying the equation on the left by a 2 a , we obtain a # ( a # ) * = a a # . By [23] (Theorem 1.5.3), a R E P . It follows that a # = a * ( a # ) * a # = ( a # ) 2 ( a # ) * and a # a * = ( a # ) 2 ( a # ) * a * = ( a # ) 2 . Hence a R S E P .
(6)
If x = a a 3 a is a solution, then ( a # ) 2 a a 3 a = a * a a 3 a a # . That is a # a a = a * a a . Hence a R S E P by [23] (Theorem 1.5.3).
(7)
If x = ( a a # ) * a ( a a # ) * is a solution, then
( a # ) 2 ( a a # ) * a ( a a # ) * = a * ( a a # ) * a ( a a # ) * a # = a * a ( a a # ) * a # .
It follows that
( a # ) 2 ( a a # ) * a = ( a # ) 2 ( a a # ) * a a a = ( a # ) 2 ( a a # ) * a ( a a # ) * a a = a * a ( a a # ) * a # a a = a * a ( a a # ) * a # = ( a # ) 2 ( a a # ) * a ( a a # ) *
and
a a = a a a 3 ( a # ) 2 ( a a # ) * a = a a a 3 ( a # ) 2 ( a a # ) * a ( a a # ) * = ( a a # ) * .
Hence a R E P , which implies
a # = a # a # a = ( a # ) 2 ( a a # ) * a ( a a # ) * = a * a ( a a # ) * a # = a * a a # = a * .
Thus a R S E P .
Noting that for any x χ a = { a , a # , a , ( a # ) * , ( a ) * , ( a ) # } , ( a * x a # ) = a a 3 a x # ( a ) * . Hence, if a R E P , then ( a * x a # ) = a x + ( a + ) * for any x τ a = { a , a # , ( a + ) # } . Therefore, by Theorem 1, we naturally consider characterizing elements of SEP via projection elements.
Theorem 2.
Let a R # R . Then a R S E P if and only if ( a # ) 2 x a x ( a ) * is projection for some x τ a .
Proof. 
⇒ Since a # = a = a * , ( a # ) 2 a 2 a ( a ) * = a # a a a = a a . Obviously, it is projection.
⇐ From assumption, there exists x τ a such that ( a # ) 2 x a x ( a ) * is projection, this gives
( a # ) 2 x a x ( a ) * = ( a # ) 2 x a x ( a ) * ( a # ) 2 x a x ( a ) * ,
and
( a # ) 2 x a x ( a ) * = ( ( a # ) 2 x a x ( a ) * ) * .
Multiplying the equality (2) on the left by x a 2 and noting that x a a # x = a a , one gets
a a 2 x ( a ) * = a a 2 x ( a ) * ( a # ) 2 x a x ( a ) * .
Multiplying the equality (4) on the left by x a # and noting that x a a # x = a a , one gets
( a ) * = ( a ) * ( a # ) 2 x a x ( a ) * .
Multiplying the equality (5) on the left and on the right all by a * and noting that x a a = x , one gets
a * = a a # x a x .
If x = a or x = a # , then (6) changes a * = a ; If x = ( a ) * , then (6) changes a * = a a # ( a ) * a a * . This gives
a 2 = a 2 a a = a 2 a * ( a ) * = a 2 a + a # ( a ) * a a * ( a ) * = ( a ) * a .
Hence a = a 2 a # = ( a ) * a a # = ( a ) * . Thus, in any case, one yields a * = a . Multiplying the equality (3) on the right by a a , one has
( a # ) 2 x a x ( a ) * = ( ( a # ) 2 x a x ( a ) * ) a a .
Multiplying the equality (7) on the left by x a # x a 2 , one has
( a ) * = ( a ) * a a .
Hence a R E P . Therefore a R S E P . □
Theorem 3.
Let a R # R . Then a R S E P if and only if ( a # ) 2 x a x ( a # ) * a a is projection for some x ω a = { a + , ( a # ) * , a + a 3 a + } .
Proof. 
⇒ It is easy to check.
⇐ From the assumption, one gets
( a # ) 2 x a x ( a # ) * a a = ( ( a # ) 2 x a x ( a # ) * a a ) * = a a a # ( x ) * a * x * ( a # ) * ( a # ) * for some x ω a .
Multiplying the equality on the right by a a and notice that ( a # ) * a a = ( a # ) * , one yields
( a # ) 2 x a x ( a # ) * a a = ( a # ) 2 x a x ( a # ) * a a 2 a .
Multiplying the last equality on the left by x a 2 and notice that x a a # x = a a for any x ω a , then one obtains
a x a # x = a x ( a # ) * a a 2 a .
Since x a # a x = a a for any x ω a , one has
( a # ) * a a = a a ( a # ) * a a = x a # a x ( a # ) * a a = x a # a x ( a # ) * a a 2 a = ( a # ) * a a 2 a .
It follows that
a a = a * a ( a # ) * a a = a * ( a # ) * a a 2 a = a a 2 a .
Hence a R E P , which implies ( a # ) * a a = ( a ) * a a = ( a ) * , τ a = ω a and ( a # ) 2 x a x ( a # ) * a a = ( a # ) 2 x a x ( a ) * . By Theorem 2, we have a R S E P . □
Theorem 4.
Let a R # R . Then a R S E P if and only if a * x a # x a 3 a is projection for some x τ a ω a .
Proof. 
⇒ It is easy to check.
⇐ If there exists x τ a ω a , such that a * x a # x a 3 a is projection, then
a * x a # x a 3 a = ( a * x a # x a 3 a ) = a a ( a * ) 2 ( x ) * ( a # ) * x * a .
Multiplying the equality on the right by a a , one gets
a * x a # x a 3 a = a * x a # x a 3 a a a
and
x # a a x a # x a 3 a = x # ( a ) * a * x a # x a 3 a = x # ( a ) * a * x a # x a 3 a a a = x # a a ( a # ) * x a # x a 3 a a a .
Notice that x # a a x = a a # , x τ a ( a a # ) * , x ω a , this leads to
(1)
If x τ a , then a # x a 3 a = a # x a 3 a a a .
(2)
If x ω a , then ( a a # ) * a # x a 3 a = ( a a # ) * a # x a 3 a a a .
It follows that
a # x a 3 a = a a a # x a 3 a = a a ( a a # ) * a # x a 3 a = a a ( a a # ) * a # x a 3 a a a = a # x a 3 a a a .
Hence, one always has
a # x a 3 a = a # x a 3 a a a for some x τ a ω a .
Since x a a # x = a a , x τ a a a , x ω a , one has
(1)
If x τ a , then a 3 a = a a a 3 a = x a a # x a 3 a a a = x a a # x a 3 a a a = a 3 a a a and a = a a # a # a 3 a = a a # a # a 3 a a a = a a a . Hence a R E P .
(2)
If x ω a , then a a 4 a = x a a # x a 3 a = x a a # x a 3 a a a = a a 4 a a a . It follows that a 3 a = a # a a a 4 a = a # a a a 4 a a a . By (1), a R E P .
Hence, in any case, one has a R E P , which implies τ a = ω a and a * x a # x a 2 = a * x a # x a 3 a is projection for some x τ a .
This gives
a * x a # x a 2 = a * x a # x a 2 a * x a # x a 2
and
a # x a 2 = a # a a # x a 2 = ( x # a a x ) a # x a 2 = x # ( a ) * ( a * x a # x a 2 ) = x # ( a ) * ( a * x a # x a 2 a * x a # x a 2 ) = a # x a 2 a * x a # x a 2 .
It follows that
a 2 = a a a 2 = x a a # x a 2 = x a a # x a 2 = a 2 a * x a # x a 2
and
a # = ( a # ) 2 a 2 a # = ( a # ) 2 a 2 a * x a # x a 2 a # = a * x a # x a 2 a # .
(1)
If x = a , then a # = a * a a # a a = a * ;
(2)
If x = a # , then a # = a * a # a # a 2 = a * ;
(3)
If x = ( a ) * , then a # = a * ( a ) * a # a * a = a # a * a , and a # = a a # a # = a a # a * a a # = a * .
Thus, in any case, a R S E P . □

3. The Group-Inverse and MP-Inverse of Variable Equations

According to Equation (1), a natural question arises as to the form of the MP inverse and group inverse in this general expression. Readers may find such questions addressed in the literature [19,22,24]. In this section, we shall focus primarily on presenting the generalized inverse form of Equation (1).
Lemma 2.
Let a R # R and take ψ a = { a + , a * , ( a # ) * , a + a 3 a + } . Then
(1) 
( ( a # ) 2 x ) # = x # a a 3 , x τ a x a 3 a , x ψ a ;
(2) 
( ( a # ) 2 x ) = x a 3 a for x τ a ψ a ;
(3) 
( a * x a # ) # = ( a * x a # ) = a a 3 a x # ( a ) * for x τ a ψ a .
Proof. 
(1) Noting that x x # = a a # and x # a a = x # for any x τ a , then
( ( a # ) 2 x ) ( x # a a 3 ) ( ( a # ) 2 x ) = ( a # ) 2 a a # a a x = ( a # ) 2 x ,
( x # a a 3 ) ( ( a # ) 2 x ) ( x # a a 3 ) = x # a a x x # a a 3 = x # a a a a # a a 3 = x # a a 3 ,
( ( a # ) 2 x ) ( x # a a 3 ) = ( a # ) 2 a a # a a 3 = a # a # a a 3 = a # a ,
( x # a a 3 ) ( ( a # ) 2 x ) = x # a + a x = x # x = a a # .
Hence if x τ a , then ( ( a # ) 2 x ) # = x # a a 3 .
Now assume x ψ a , we have x x = a a and x a a # x = a a . Thus
( ( a # ) 2 x ) ( x a 3 a ) = ( a # ) 2 a a a 3 a = ( a # ) 2 a a 4 a = a a ; ( x a 3 a ) ( ( a # ) 2 x ) = x a a # x = a a ; ( ( a # ) 2 x ) ( x a 3 a ) ( ( a # ) 2 x ) = a a ( a # ) 2 x = ( a # ) 2 x ; ( x a 3 a ) ( ( a # ) 2 x ) ( x a 3 a ) = a a x a 3 a = x a 3 a .
Hence if x ψ a , then ( ( a # ) 2 x ) # = x a 3 a .
(2) It is obvious that ( ( a # ) 2 x ) = x a 3 a for x ψ a by (1).
For x τ a , we have x x = a a and a a x = x . Then
( ( a # ) 2 x ) ( x a 3 a ) = a # a a 3 a = a a = ( ( ( a # ) 2 x ) ( x a 3 a ) ) * ;
For x τ a , we have x x = a a and x a a # x = a a . Then
( x a 3 a ) ( ( a # ) 2 x ) = x a a # x = a a = ( ( x a 3 a ) ( ( a # ) 2 x ) ) * ;
( ( a # ) 2 x ) ( x a 3 a ) ( ( a # ) 2 x ) = a a ( a # ) 2 x = ( a # ) 2 x ;
( x a 3 a ) ( ( a # ) 2 x ) ( x a 3 a ) = a a x a 3 a = x a 3 a .
Thus ( ( a # ) 2 x ) = x a 3 a for x τ a .
(3) For x τ a ψ a , we have
( a * x a # ) ( a a 3 a x # ( a ) * ) = a * x a a x # ( a ) * ,
( a a 3 a x # ( a ) * ) ( a * x a # ) = a a 3 a x # a a x a # .
If x τ a , then x x = a a and x x # = a a # . Hence
a * x a a x # ( a ) * = a * x x x x # ( a ) * = a * x x # ( a ) * = a * a a # ( a ) * = a a ,
a a 3 a x # a a x a # = a a 3 a x # x x x a # = a a 3 a a ( a # ) 2 = a a .
According to the definition, it is easy to get
( a * x a # ) # = ( a * x a # ) = a a 3 a x # ( a ) * , f o r x τ a .
If x ψ a , then a a = x x and x x # = a * ( a # ) * . Therefore
a * x a a x # ( a ) * = a * x x # ( a ) * = ( a * ) 2 ( a # ) * ( a ) * = a a ,
a a 3 a x # a a x a # = a a 3 a x # x x 2 a # = a a 3 a a * ( a # ) * a # = a a .
Hence we have
( a * x a # ) # = ( a * x a # ) = a a 3 a x # ( a ) * f o r x ψ a .
Based on the expanded form of the generalized inverse given in Lemma 2, we provide the following equivalent characterization of SEP elements:
Theorem 5.
Let a R # R . Then a R S E P if and only if ( ( a # ) 2 x ) # = x # a a 2 ( a # ) * , x τ a x a 2 ( a ) * a # , x ψ a .
Proof. 
⇒ Assume that a R S E P . Then ( a + ) * = a = ( a # ) * . By Lemma 2, we are done.
⇐ If x τ a , then by Lemma 2, we have x # a a 3 = x # a a 2 ( a # ) * . Multiplying the equality on the left by x and noting that x x # = a a # , we get a 2 = a ( a # ) * . Thus by [23] (Theorem 1.5.3), a R S E P .
If x ψ a , then by Lemma 2, we have x a 3 a = x a 2 ( a ) * a # . Multiplying the equality on the left by x and noting that x x = a a , we get a a 4 a = a a 3 ( a ) * a # . Multiplying the equality on the left by ( a # ) 2 and the equality on the right by a, we have a * = a . Thus a a # = ( a # ) 2 a a 4 a # = ( a # ) 2 a a 3 ( a ) * a # = ( a # ) 2 a a 4 a = a a = a a * . So a R S E P by [23] (Theorem 1.5.3). □
Theorem 6.
Let a R # R . Then a R S E P if and only if ( ( a # ) 2 x ) = x ( a ) * a for x τ a ψ a .
Proof. 
⇒ It is an immediate result of Lemma 2 because a 3 a + = ( a + ) * a 2 a # = ( a + ) * a .
⇐ By the assumption and Lemma 2, we have x a 3 a = x ( a ) * a . Multiplying the equality on the left by x and using that
x x = a a , x τ a
and
x x = a a , x ψ a .
we have
a 3 a = ( a ) * a for x τ a ,
and
a a 4 a = a a ( a ) * a for x ψ a ,
Multiplying the equality (8) on the right by a # , we get a * = a . Thus a # a = ( a # ) 2 a 2 = ( a # ) 2 ( a ) * a = ( a # ) 2 a 3 a = a a = a a * .
Similarly, multiplying equality (9) by a # on the right and by a a # on the left, we get a * = a . Then a # a = ( a # ) 2 a a 3 = ( a # ) 2 a a ( a ) * a = ( a # ) 2 a a 4 a = a a = a a * . So, in any case, a R S E P by [23] (Theorem 1.5.3). □
Theorem 7.
Let a R # R . Then a R S E P if and only if ( a * x a # ) # = a * a 3 a x # ( a # ) * for x τ a ψ a .
Proof. 
⇒ Suppose that a R S E P . Then a = a * and ( a ) * = ( a # ) * . By Lemma 2, we are done.
⇐ Under the hypothesis and using Lemma 2, we have
a a 3 a x # ( a ) * = a * a 3 a x # ( a # ) * for x τ a ψ a
Multiplying the Equation (10) on the right by a a , one gets
a a 3 a x # ( a ) * = a a 3 a x # ( a ) * a a
and
a a x # ( a ) * = a # a a 3 a x # ( a ) * = a # a a 3 a x # ( a ) * a a = a a 3 a x # ( a ) * a a .
Noting that x a a x # = a a # , x τ a ( a a # ) * , x ψ a , . Then we have
( a ) * = ( a ) * a a for x τ a ,
and
( a # ) * a a = ( a # ) * a a 2 a for x ψ a .
Multiplying the Equations (11) and (12) on the left by a * , one gets a a = a a 2 a . Hence a R E P .
Now Equation (10) changes
a x # ( a ) * = a * a 2 x # ( a ) * for x τ a ψ a .
This gives a x # a a x = a x # ( a ) * a * x = a * a 2 x # ( a ) * a * x = a * a 2 x # a a x .
If x τ a , then x # a a x = a a # , this infers a = a * a 2 ;
If x ψ a , then x # a a x = ( a a # ) * , this infers a ( a a # ) * = a * a 2 ( a a # ) * .
It follows that a = a a a = a ( a a # ) * a a = a * a 2 ( a a # ) * a a = a * a 2 . Hence, in any case, we have a = a * a 2 . Thus a R S E P by [23] (Theorem 1.5.3). □
By Lemma 2 and Theorem 1, we obtain the following conclusion:
Theorem 8.
Let a R # R . Then the following conditions are equivalent:
(1) 
a R S E P ;
(2) 
x # a a 3 = a a 3 a x # ( a ) * for some x τ a ;
(3) 
x a 3 a = a a 3 a x # ( a ) * for some x τ a ψ a .

4. Compatibility of Equations Involving Parametric Variables

In the preceding sections, we established that the SEP property can be characterized by a specific linear equation, ( a # ) 2 x = a * x a # , which provides a remarkably simple description. This equation, however, is univariate and fixed. A natural question arises: what happens when we introduce parameters into such equations? This section investigates the compatibility of equations involving parametric, variables that is, we ask under what conditions do there exist solutions to families of related equations. This shift in perspective, from solving a single equation to understanding a system of equations parameterized by elements in the ring, is not merely a technical generalization. Instead, it serves as the crucial conceptual bridge that guides us from the linear characterization of SEP elements to the discovery of the novel constructs of square-rootable and involutional projection elements, which will be introduced in Section 5 and Section 7.
Theorem 9.
Let a R # R . Then a R S E P if and only if a * x a # x = a # a , x τ a ( a # ) 2 , x η a = { a , ( a # ) * , a a 3 a , ( a a # ) * a ( a a # ) * } .
Proof. 
⇒ It is a routine verification because a # = a = a * and τ a = { a , ( a # ) * , a a 3 a , ( a a # ) * a ( a a # ) * } .
⇐ If x τ a , then a * x a # x = a # a . Multiplying the equality on the left by a a , one gets a # a = a a a # a and a # = a # a a = a a a # a a = a a a # . Hence a R E P by [23] (Theorem 1.2.1). If x η a , then
( a # ) 2 = a * x a # x = a a a * x a # x = a a ( a # ) 2 = a a # .
Hence a R E P by [23] (Theorem 1.2.1).
Thus, in any case, a R E P , which infers τ a = η a and a * x a # x = a # a = ( a # ) 2 for any x τ a .
If x = a , then a # a # = a * a a # a = a * a # .
If x = a # , then a # a # = a * a # a # ( a # ) = a * a # a # ( a ) = a * a # .
If x = ( a ) * , then a # a # = a * ( a ) * a # ( ( a ) * ) = a a a # a * = a # a * .
In any case, we have a R S E P by [23] (Theorem 1.5.3). □
Theorem 10.
Let a R # R . Then a R S E P if and only if ( a # ) 2 x a x = a * , x τ a a * a a , x η a .
Proof. 
⇒ It is obvious.
⇐ Under the assumption, one has
(1)
If x τ a , then a * = ( a # ) 2 x a x = a a ( a # ) * x a x = a a a * ;
(2)
If x η a , then a * a a = ( a # ) 2 x a x = a a ( a # ) * x a x = a a a * a a .
It follows that
a * = a * a a ( a a # ) * = a a a * a a ( a a # ) * = a a a * .
Thus, in any case, we have a R E P . This gives τ a = η a and a * = ( a # ) 2 x a x .
If x = a , then a * = ( a # ) 2 a 2 a = ( a # ) 2 a 2 a # = a # .
If x = a # , then a * = ( a # ) 2 a # a ( a # ) = ( a # ) 3 a 2 = a # .
If x = ( a ) * , then a * = ( a # ) 2 ( a ) * a a * and a # a = a a = a * ( a ) * = ( a # ) 2 ( a ) * a a * ( a ) * = ( a # ) 2 ( a ) * a . It follows that a # = a # a a # = ( a # ) 2 ( a ) * a a # = ( a # ) 2 ( a ) * and a = a 2 a # = a 2 ( a # ) 2 ( a ) * = ( a ) * . So a * = a = a # . Thus, in any case, a # = a * and a R S E P . □
Theorem 11.
Let a R # R . Then a R S E P if and only if x a 2 a * x a # = a a , x τ a a a , x η a .
Proof. 
⇒ Assume that a R S E P . Then η a = τ a and a = a # = a * , it follows that
x a 2 a * x a # = x a x a # = a a a a # = a a = a a , x = a ( a # ) a a # a # = ( a ) a # = a a # = a a = a a , x = a # ( ( a ) * ) a ( a ) * a # = a a 2 a # = a a , x = ( a ) * . As desired.
⇐ According to the assumption, one has
(1)
If x τ a , then a a = x a 2 a * x a # = ( x a 2 a * x a # ) a a = a a a a , which infers a R E P .
(2)
If x η a , then a a = x a 2 a * x a # = ( a a x ) a 2 a * x a # = a a a a , this induces a R E P .
Hence, in any case, we have a R E P and τ a = η a , it follows that x a 2 a * x a # = a a for x τ a = η a .
(1)
If x = a , then a a = a a 2 a * a a # = a a * . Hence a R S E P .
(2)
If x = a # , then a a = ( a # ) a 2 a * a # a # = a 3 a * a # a # , this gives a = a # a 2 = a # a a a 2 = a # ( a 3 a * a # a # ) a 2 = a 2 a * . Hence a R S E P by [23] (Theorem 1.5.3).
(3)
If x = ( a ) * , then a a = ( ( a ) * ) a 2 a * ( a ) * a # = a * a 2 a a a # = a * a . Hence a R S E P .
Theorem 12.
Let a R # R . Then a R S E P if and only if x # ( a ) * ( a # ) 2 x = a , x τ a ( a a # ) * a # , x η a .
Proof. 
⇒ Since a R S E P , η a = τ a and x # ( a ) * ( a # ) 2 x = x # a ( a # ) 2 x = x # a # x = a # a # a , x = a ( a # ) # a # a # , x = a # ( ( a ) * ) # a # ( a ) * a # = a * a # ( a ) * , x = ( a ) * = a # = a = ( a # a ) * a # . As desired.
⇐ Applying the hypothesis, one obtains:
If x τ a , then a = x # ( a ) * ( a # ) 2 x = ( a a x # ) ( a ) * ( a # ) 2 x = a a a . Hence a R E P ;
If x η a , then
( a a # ) * a # = x # ( a ) * ( a # ) 2 x = x # ( a ) * ( a # ) 2 ( x a a ) = ( a a # ) * a # a a
and
a # = a a a # = a a ( a a # ) * a # = a a ( a a # ) * a # a a = a # a a .
Hence a R E P .
Thus, in any case, we have a R E P and τ a = η a .
Now we have x # ( a ) * ( a # ) 2 x = a # for x τ a .
If x = a , then a # = a # ( a ) * ( a # ) 2 a = a # ( a ) * a # and a = a a # a = a a # ( a ) * a # a = ( a ) * . Hence a R S E P .
If x = a # , then a # = ( a # ) # ( a ) * ( a # ) 3 = a ( a ) * ( a # ) 3 and a = a # a # a 3 = a # ( a ( a ) * ( a # ) 3 ) a 3 = ( a ) * . Hence a R S E P .
If x = ( a ) * = ( a # ) * , then
a # = ( ( a # ) * ) # ( a ) * ( a # ) 2 ( a ) * = a * ( a ) * ( a # ) 2 ( a ) * = ( a # ) 2 ( a ) *
and
a = a 2 a # = a 2 ( a # ) 2 ( a ) * = ( a ) * .
Hence a R S E P . □

5. Square Rootable Elements

Let R be a ring and a R . Then a is called a square rootable element of R if there exists b R such that a = b 2 . In this case, b is called the square root of a.
The set of all square rootable elements of R will be denoted by R . Obviously, 0 , 1 R and E ( R ) R . Let a R . Write a = { b R | b 2 = a } . By Theorem 9, we find that square rootable elements can be utilised to characterize SEP elements.
Theorem 13.
Let a R # R . Then a R S E P if and only if a * a a # a R and a # a * a a # a .
Proof. 
⇒ Since a R S E P , by Lemma 1, a * a a # = a # a # a . Thus
( a # ) 2 = ( a # ) 2 a a = a * a a # a .
⇐ Using the assumption, one gets
a * a a # a = ( a # ) 2 .
Then
a a # = a a ( a # ) 2 = a a a * a a # a = a * a a # a = ( a # ) 2 .
Hence a R E P and
( a # ) 2 = a * a a # a = a * a # .
Thus a R S E P . □
By Theorem 13, and [23] (Theorem 1.5.3), we get the following corollary.
Corollary 1.
Let a R # R . Then the following conditions are equivalent:
(1) 
a R S E P ;
(2) 
a a * a a # a ;
(3) 
a a * a # ;
(4) 
a # a * a .
Theorem 14.
Let a R # R . Then a R S E P if and only if a # + 1 a a a * a a # a + 1 a a .
Proof. 
⇒ It follows from Theorem 13.
⇐ Under the hypothesis, we have
( a # ) 2 + a # a a + 1 a a a # = ( a # + 1 a a ) 2 = a * a a # a + 1 a a .
( a # ) 2 + a # a a + a a a a a # = a * a a # a .
Multiplying the equality (13) by a a on the right, we get
a a = a a a a .
Then a R E P , which leads to (13) change ( a # ) 2 = a * a # . Hence a R S E P . □
Theorem 15.
Let a R # R . Then a R S E P if and only if a * a ( a # ) * a # a a ( a # ) * .
Proof. 
⇒ Since a R S E P , a * a + ( a # ) * = a # a # a = a # and a # a + a + ( a # ) * = a * a + a # a . By Theorem 13, we are done.
⇐ From the assumption, one gets
( a * a ( a # ) * ) 2 = a # a a ( a # ) * .
Then
a * ( a ) 2 ( a # ) * = a # ( a ) 2 ( a # ) * .
Multiplying the equality (14) by a * a a * ( a # ) * on the right, we get a * a = a # a and a R S E P by [23] (Theorem 1.5.3). □

6. Characterization Using Reversible Elements

Let U ( R ) denote the set of invertible elements in R. Based on the study of SEP elements in Section 3, we find that certain special invertible elements in ring R can be used to characterize SEP elements. Furthermore, it is evident from our proof that the inverses of these invertible elements can be explicitly written out.
Theorem 16.
Let a R # R . Then a R S E P if and only if a * a a # = u a # a , where u U ( R ) and a a u = a a a # .
Proof. 
⇒ Since a R S E P , by Lemma 1, a * a a # = ( a # ) 2 a . Take u = a # + 1 a a # . Then u U ( R ) with
u 1 = a + 1 a a # .
Clearly, a a u = a a a # and u a # a = a * a a # .
⇐ If there exists u U ( R ) such that a * a a # = u a # a and a a u = a a a # , then
a a # a = a a u a # a = a a a * a a # = a * a a # = a * a a # a a = a a # a a a .
It follows that a a = a 3 a a # a = a 3 a a # a a a = a a a a . Hence a R E P . This gives
( a # ) 2 a = a a # a = a * a a # .
By Lemma 1, a R S E P . □
Theorem 17.
Let a R # R . Then a R S E P if and only if a * a a # = a # u a , where u U ( R ) and u a * = a a * .
Proof. 
⇒ Assume that a R S E P . Then a * a a # = ( a # ) 2 a by Lemma 1. Clearly, a # u a = a # a a = ( a # ) 2 a = a * a a # and u a * = a a * .
⇐ From the assumption, one gets
a * a a # = a # u a and u a * = a a * for some u U ( R ) .
This gives
a * a a # = a # u a * ( a # ) * a = a # a a * ( a # ) * a = a # a a = ( a a a # ) a a = a a a * a a # .
Multiplying the equality by a 2 ( a a # ) * on the right, we get a * = a a a * .
Hence a R E P , which implies a * a a # = a # a a = ( a # ) 2 a .
By Lemma 1, a R S E P . □
Theorem 18.
Let a R # R . Then a R S E P if and only if a * a a # = a # a u , where u U ( R ) and u ( a ) * = a ( a ) * .
Proof. 
⇒ Suppose that a R S E P . Then, a # = a and by Lemma 1, a * a a # = ( a # ) 2 a . Set u = a + 1 a a . Then u U ( R ) with u 1 = a + 1 a a . Clearly, a # a u = a # a a = ( a # ) 2 a = a * a a # and u ( a ) * = a ( a ) * .
⇐ If there exists u U ( R ) such that a * a a # = a # a u and u ( a ) * = a ( a ) * . Then a * a a # ( a ) * = a # a u ( a ) * = a # a a ( a ) * = a a a # a a ( a ) * = a a a * a a # ( a ) * .
Multiplying the equality by a * a 2 ( a a # ) * on the right, one gets a * = a a a * .
Hence a R E P . It follows that
a * a a # = a * a a = a * a a ( a # ) * a * = a * a a # ( a # ) * a * = a # a a ( a ) * a * = ( a # ) 2 a .
By Lemma 1, a R S E P . □
Theorem 19.
Let a R # R . Then a R S E P if and only if a * a a # = a # u , where u U ( R ) and a * u = a * a # a .
Proof. 
⇒ Since a R S E P , a # = a and a * a a # = ( a # ) 2 a . Let u = a # a + 1 a a # . Then u U ( R ) and u 1 = a 2 + 1 a a # . Clearly, a # u = a # a # a = a * a a # and a * u = a * a # a + a * a * a a # = a * a # a .
⇐ Under the hypothesis, one gets a * a a # = a # u and a * u = a * a # a for some u U ( R ) . This gives
a * a a # = a # u = a a a # u = a a ( a * a a # ) .
Multiplying the equality by a 2 ( a a # ) * on the right, one yields a * = a a a * .
Hence a R E P and
a * a a # = a # u = a u = a ( a # ) * a * u = a ( a # ) * a * a # a = a a # a = ( a # ) 2 a .
Thus, by Lemma 1, a R S E P . □

7. The Involutional Projection Elements

Let R be a -ring and u R . Then u is called an involutional projection element if u 2 = 1 and u * = u . Denote the set of all involutional projection elements of R by I P ( R ) . Let p P E ( R ) . Then, clearly, 2 p 1 I P ( R ) . Indeed, from the conclusions drawn in Section 4 and the structural characterization of SEP elements presented in Section 6, it follows naturally that involutional projection elements should be employed to characterize SEP elements.
Theorem 20.
Let a R # R . Then a R S E P if and only if u a * a a # = ( a # ) 2 a , where u I P ( R ) and a u = a .
Proof. 
⇒ Assume that a R S E P . Then a + = a # and a * a a # = ( a # ) 2 a by Lemma 1. Take u = 2 a a 1 . Then u I P ( R ) . It can be readily verified that u a * a a # = ( a # ) 2 a and a u = a .
⇐ Under the assumption, one gets
a ( a # ) 2 a = a u a * a a # = a a * a a # ,
and
a ( a # ) 2 a = a a * a a # = ( a a * a a # ) a a # = a ( a # ) 2 a a a # = a ( a # ) 3 .
Multiplying equality by a 2 on the left, one gets
a # a = ( a # ) 2 .
Hence a R E P . This induces
a # a = ( a # ) 2 = ( a # ) 5 a 3 = a ( a # ) 2 a a 3 a = a a * a a # a 3 a = a a * .
One has a R S E P . □
In fact, both the above theorem and the following theorem are inspired by Equation (1).
Theorem 21.
Let a R # R . Then a R S E P if and only if a * a a # = ( a # ) 2 a u , where u I P ( R ) and a # a u = 2 a a a a # .
Proof. 
⇒ Assume that a R S E P . Then a R E P and a * a a # = ( a # ) 2 a by Lemma 1. Take u = 2 a a 1 , then u I P ( R ) . By a simple verification, one has a * a a # = ( a # ) 2 a u and a # a u = 2 a a a a # .
⇐ Applying the hypothesis, one gets
u ( a a # ) * = u * ( a a # ) * = ( a a # u ) * = ( 2 a a a a # ) * = 2 a a ( a a # ) * .
It follows that
a * a a # ( a a # ) * = ( a # ) 2 a u ( a a # ) * = ( a # ) 2 a ( 2 a a a a # ) * ) = ( a # ) 2 a
and
( a # ) 2 a = a * a a # ( a a # ) * = a a a * a a # ( a a # ) * = a a ( a # ) 2 a = a a # a .
So a # a = ( a # ) 2 a a 3 = a a # a a 3 = a a . Hence a R E P , this implies
( a # ) 2 a = a * a a # ( a a # ) * = a * a a # a a # = a * a a # .
Thus a R S E P by Lemma 1. □
Theorem 22.
Let a R # R . Then a R S E P if and only if a * a u a # = ( a # ) 2 a , where u P E ( R ) and u ( a # ) * = ( a ) * .
Proof. 
⇒ Since a R S E P and Lemma 1, we have a # = a and a * a a # = ( a # ) 2 a . Set u = 2 ( a a # ) * 1 . Clearly, u I P ( R ) with a * a u a # = a * a a # = ( a # ) 2 a and u ( a # ) * = ( a # ) * = ( a ) * .
⇐ Using the assumption, one gets
( a # ) 2 a = a * a u a # = a a a * a u a # = a a ( a # ) 2 a = a a # a .
By the proof of Theorem 21, a R E P . Noting that a u = a # u * = ( u ( a # ) * ) * = ( ( a ) * ) * = a . Then one obtains ( a # ) 2 a = a * a u a # = a * a a # . Hence a R S E P by Lemma 1. □

8. Representation of the General Solution to a Bivariate Equation

From the perspective of self-contained research, characterizing the generalized inverse using multivariable equations constitutes a natural extension of characterizing the generalized inverse using univariable equations. We now analyze the general solution to the bivariate Equation (15), which naturally arises from (1). The parametric representation of its solution set will be instrumental in the derivations that follow.
( a # ) 2 x = a * y a # .
Theorem 23.
Let a R # R . Then the general solution to Equation (15) is given by the following expression:
x = a 2 a p a # + u a a u , y = ( a ) * a p + v a a v a a . p , u , v R and a p = a a a p .
Proof. 
First, it is easy to check (16) is the solution of Equation (15). Next, let x = x 0 y = y 0 be any solution of the Equation (15). Then
( a # ) 2 x 0 = a * y 0 a # .
Take
p = a a * y 0 a a , u = x 0 a 2 a p a # , v = y 0 .
We have
a a a p = a a a * y 0 a a = a a ( a # ) 2 x 0 a 2 a = ( a # ) 2 x 0 a 2 a = a * y 0 a a = a p , a a u = a a x 0 a a 3 a p a # = a a 3 ( a # ) 2 x 0 a a 3 a a a * y 0 a a a # = a a 3 a * y 0 a # a a 3 a * y 0 a a a # = 0 .
Thus
x = a 2 a p a # + u a a u .
Similarly a a v a a = 0 and
y = ( a ) * a p + v a a v a a .
Theorem 24.
Let a R # R . Then a R S E P if and only if the general solution to Equation (15) is given by the following expression:
x = a 2 a p a # + u a a u , y = a a p + v a a v a a . p , u , v R .
Proof. 
⇒ Suppose a R S E P , then a p = a a a p and a = ( a + ) * . From Theorem 23, (17) is the general solution of Equation (15).
⇐ Assume that (17) is the general solution of Equation (15), one gets
( a # ) 2 ( a 2 a p a # + u a a u ) = a * ( a a p + v a a v a a ) a # .
That is a # a a p a # = a * p a # . Take p = a , we have a # = a * a a # . By Theorem 1, a R S E P . □
Observing Theorem 23, we can construct the following equation:
a * a # x = a * y a # .
Theorem 25.
Let a R # R . Then the general solution to Equation (18) is given by (17).
Proof. 
The proof is similar to Theorem 23. □
From Theorem 23 and Theorem 25, we have the following result.
Theorem 26.
Let a R # R . Then a R S E P if and only if Equations (15) and (18) have the same solution.

9. Representation of the General Solution to a Bivariate Nonlinear Equation

The characterization of SEP elements using linear equations in Section 8 is complemented by the natural characterization of nonlinear elements in this section. Moreover, this indeed represents a novel formulation distinct from Mosić’s characterization of SEP elements in Reference [23].
Equation (15) prompts us to consider the following nonlinear equation:
a * a # x a * y a # = a .
Theorem 27.
Let a R # R . The general solution to Equation (19) is given by the following expression:
x = a 2 a p a # + u a a u + a ( a ) * a + ( 1 a a ) w , y = a a p + v a a v a a . p , u , v , w R .
Proof. 
First, it is easy to check (20) is the solution of Equation (19).
Next let x = x 0 y = y 0 be any solution of Equation (19). Then
a * a # x 0 a * y 0 a # = a .
Take
p = y 0 , u = x 0 a 2 a p a # a ( a ) * a , w = a , v = y 0 a a p .
We have
( 1 a a ) w = ( 1 a a ) a = 0 , a a u = a a ( x 0 a 2 a p a # a ( a ) * a ) = a a x 0 a a 3 a y 0 a # a a 2 ( a ) * a = a a x 0 a a 2 ( a ) * a * y 0 a # a a 2 ( a ) * a = a a x 0 a a 2 ( a ) * ( a * a # x 0 a ) a a 2 ( a ) * a = 0 , a 2 a p a # + u + a ( a ) * a = a 2 a p a # + x 0 a 2 a p a # a ( a ) * a + a ( a ) * a = x 0 .
Thus
x 0 = a 2 a p a # + u a a u + a ( a ) * a + ( 1 a a ) w .
Similarly y 0 = a a p + v a a v a a . □
Theorem 28.
Let a R # R . Then a R S E P if and only if the general solution to Equation (19) is given by the following expression:
x = a 2 a p a # + u a a u + a + ( 1 a a ) w , y = a a p + v a a v a a . p , u , v , w R .
Proof. 
⇒ Suppose a R S E P . Then
x = a 2 a p a # + u a a u + a + ( 1 a a ) w = a 2 a p a # + u a a u + a ( a ) * a + ( 1 a a ) w .
From Theorem 27, we know that (21) is the general solution of Equation (19).
⇐ Assume that (21) is the general solution of Equation (19), one has
a * a # ( a 2 a p a # + u a a u + a + ( 1 a a ) w ) a * ( a a p + v a a v a a ) a # = a .
That is a * a # a = a . Hence a R S E P by [23] (Theorem 1.5.3). □
Theorem 29.
Let a R # R . Then a R S E P if and only if the general solution to Equation (19) is given by the following expression:
x = a 2 a * p a # + u a a u + a ( a ) * a # + ( 1 a a ) w , y = a a p + v a a v a a . p , u , v , w R .
Proof. 
The proof is similar to Theorem 28. □
From Theorems 27 and 29, we have the following result.
Theorem 30.
Let a R # R . Then a R S E P if and only if the general solution to Equation (19) is given by the following expression:
x = a 2 a p a + u a a u + a 2 a + ( 1 a a ) w , y = a a p + v a a v a a . p , u , v , w R .

Author Contributions

Conceptualization, J.W. and X.L.; methodology, J.W.; writing—original draft preparation, X.L.; writing—review and editing, J.W. All authors have read and agreed to the published version of the manuscript.

Funding

The research was supported by the National Natural Science Foundation of China (Grant No. 12371041).

Data Availability Statement

No new data were created or analyzed in this study.

Acknowledgments

The authors thank the referees for their helpful comments and suggestions.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Drazin, M.P. Pseudo-inverses in associative rings and semigroups. Am. Math. Mon. 1958, 65, 506–514. [Google Scholar] [CrossRef]
  2. Zhou, Y.K.; Chen, J.L. Generalized inverses and units in a unitary ring. Acta Math. Sin. (Engl. Ser.) 2024, 40, 1000–1014. [Google Scholar] [CrossRef]
  3. Hartwig, R.E. Block generalized inverses. Arch. Ration. Mech. Anal. 1976, 61, 197–251. [Google Scholar] [CrossRef]
  4. Harte, R.; Mbekhta, M. On generalized inverses in C*-algebras. Studia Math. 1992, 103, 71–77. [Google Scholar] [CrossRef]
  5. Koliha, J.J. The Drazin and Moore-Penrose inverse in C*-algebras. Math. Proc. R. Ir. Acad. 1999, 99A, 17–27. [Google Scholar]
  6. Koliha, J.J.; Djordjević, D.; Cvetković, D. Moore-Penrose inverse in rings with involution. Linear Algebra Appl. 2007, 426, 371–381. [Google Scholar] [CrossRef]
  7. Drivaliaris, D.; Karanasios, S.; Pappas, D. Factorizations of EP operators. Linear Algebra Appl. 2008, 429, 1555–1567. [Google Scholar] [CrossRef]
  8. Hartwig, R.E. Generalized inverses, EP elements and associates. Rev. Roum. Math. Pures Appl. 1978, 23, 57–60. [Google Scholar]
  9. Hartwig, R.E.; Katz, I.J. Products of EP elements in reflexive semigroups. Linear Algebra Appl. 1976, 14, 11–19. [Google Scholar] [CrossRef]
  10. Karanasios, S. EP elements in rings and in semigroups with involution and in C*-algebras. Serdica Math. J. 2015, 41, 83–116. [Google Scholar]
  11. Koliha, J.J.; Patricio, P. Elements of rings with equal spectral idempotents. J. Aust. Math. Soc. 2002, 72, 137–152. [Google Scholar] [CrossRef]
  12. Mosić, D.; Djordjević, D.S. New characterizations of EP, generalized normal and generalized Hermitian elements in rings. Appl. Math. Comput. 2012, 218, 6702–6710. [Google Scholar] [CrossRef]
  13. Mosić, D.; Djordjević, D.S.; Koliha, J.J. EP elements in rings. Linear Algebra Appl. 2009, 431, 527–535. [Google Scholar] [CrossRef]
  14. Patrício, P.; Puystjens, R. Drazin-Moore-Penrose invertibility in rings. Linear Algebra Appl. 2004, 389, 159–173. [Google Scholar] [CrossRef]
  15. Tian, Y.; Wang, H. Characterizations of EP matrices and weighted-EP matrices. Linear Algebra Appl. 2011, 434, 1295–1318. [Google Scholar] [CrossRef]
  16. 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]
  17. Mosić, D.; Djordjević, D.S. Partial isometries and EP elements in rings with involution. Electron. J. Linear Algebra 2009, 18, 761–772. [Google Scholar] [CrossRef]
  18. Mosić, D.; Djordjević, D.S. Further results on partial isometries and EP elements in rings with involution. Math. Comput. Model. 2011, 54, 460–465. [Google Scholar] [CrossRef]
  19. Zhao, R.J.; Yao, H.; Wei, J.C. Characterizations of partial isometries and two special kinds of EP elements. Czechoslov. Math. J. 2020, 70, 539–551. [Google Scholar] [CrossRef]
  20. Guan, M.; Wei, J. Generalized inverse equations and SEP elements in a ring with involution. Georgian Math. J. 2024, 31, 25–33. [Google Scholar] [CrossRef]
  21. Cao, L.; Guan, M.; Wei, J. Some new characterizations of normal and SEP elements. Filomat 2024, 38, 8481–8493. [Google Scholar] [CrossRef]
  22. Li, A.; Guan, M.; Wei, J. SEP elements and solutions of related equations in a ring with involution. Filomat 2023, 37, 8213–8228. [Google Scholar] [CrossRef]
  23. Mosić, D. Generalized Inverses; Faculty of Sciences and Mathematics, University of Niš: Niš, Serbia, 2018. [Google Scholar]
  24. Zhao, D.; Wei, J. Strongly EP elements in rings with involution. J. Algebra Appl. 2022, 21, 2250088. [Google Scholar] [CrossRef]
  25. Ji, Y.; Wang, X.R.; Wei, J.C. SEP elements in a ring with involution. Filomat 2025, 39, 1119–1133. [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.

Share and Cite

MDPI and ACS Style

Li, X.; Wei, J. New Characterizations of SEP Elements in a Ring with Involution. Mathematics 2025, 13, 3565. https://doi.org/10.3390/math13213565

AMA Style

Li X, Wei J. New Characterizations of SEP Elements in a Ring with Involution. Mathematics. 2025; 13(21):3565. https://doi.org/10.3390/math13213565

Chicago/Turabian Style

Li, Xiaoming, and Junchao Wei. 2025. "New Characterizations of SEP Elements in a Ring with Involution" Mathematics 13, no. 21: 3565. https://doi.org/10.3390/math13213565

APA Style

Li, X., & Wei, J. (2025). New Characterizations of SEP Elements in a Ring with Involution. Mathematics, 13(21), 3565. https://doi.org/10.3390/math13213565

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop