1. Introduction
Let
R be an associative ring with 1, and let
. Then
a is called group invertible if there is
such that
is a group inverse of
a and it is uniquely determined by these equations [
1]. We use
to denote the set of all group invertible elements of
R. Recent work can be referenced in [
2].
An involution ∗:
in
R is an anti-isomorphism of drgee 2, that is,
A ring
R with involution is called a ∗-ring. An element
satisfying
is called normal. In this article,
R is always a ∗-ring.
An element
is said to be Moore-Penrose invertible if the following equations:
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
(see, e.g., [
1,
4,
5,
6]). The set of all Moore-Penrose invertible elements of
R is denoted by
.
We call an element
EP if
(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
. An element
is called partial isometry if
(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
. For a ring
R,
denotes the set of all idempotent elements of
R. We call
projection if
. The set of all projections of
R will be denoted by
.
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 . Then if and only if .
Observing the equality
in Lemma 1, we can construct the following Equation (
1).
Let and set .
Theorem 1. Let . Then if and only if the Equation (1) has at least one solution in . Proof. ⇒ It is obvious by Lemma 1.
⇐ Applying the assumption, we have:
- (1)
If
is a solution, then
. We get
. By [
23] (Theorem 1.5.3), we have
.
- (2)
If is a solution, then . Multiplying the equation on the right by , we obtain . Hence by (1).
- (3)
If
is a solution, then
Thus
by [
23] (Theorem 1.5.3).
- (4)
If
is a solution, then
Multiplying the equation on the left by
, we obtain
. Noting that
. By [
23] (Theorem 1.5.3), we have
.
- (5)
If
is a solution, then
Multiplying the equation on the left by
, we obtain
. By [
23] (Theorem 1.5.3),
. It follows that
and
Hence
.
- (6)
If
is a solution, then
That is
Hence
by [
23] (Theorem 1.5.3).
- (7)
If
is a solution, then
It follows that
and
Hence
, which implies
Thus
□
Noting that for any , . Hence, if , then for any . Therefore, by Theorem 1, we naturally consider characterizing elements of SEP via projection elements.
Theorem 2. Let . Then if and only if is projection for some .
Proof. ⇒ Since , . Obviously, it is projection.
⇐ From assumption, there exists
such that
is projection, this gives
and
Multiplying the equality (2) on the left by
and noting that
, one gets
Multiplying the equality (4) on the left by
and noting that
, one gets
Multiplying the equality (5) on the left and on the right all by
and noting that
, one gets
If
or
, then (6) changes
; If
, then (6) changes
. This gives
Hence
. Thus, in any case, one yields
. Multiplying the equality (3) on the right by
, one has
Multiplying the equality (7) on the left by
, one has
Hence
. Therefore
. □
Theorem 3. Let . Then if and only if is projection for some .
Proof. ⇒ It is easy to check.
⇐ From the assumption, one gets
Multiplying the equality on the right by
and notice that
, one yields
Multiplying the last equality on the left by
and notice that
for any
, then one obtains
Since
for any
, one has
It follows that
Hence
, which implies
,
and
By Theorem 2, we have
. □
Theorem 4. Let . Then if and only if is projection for some .
Proof. ⇒ It is easy to check.
⇐ If there exists
such that
is projection, then
Multiplying the equality on the right by
, one gets
and
Notice that
, this leads to
- (1)
If , then
- (2)
If , then
It follows that
Hence, one always has
Since
, one has
- (1)
If , then and Hence .
- (2)
If , then It follows that By (1), .
Hence, in any case, one has , which implies and is projection for some
This gives
and
It follows that
and
- (1)
If , then ;
- (2)
If , then ;
- (3)
If , then , and
Thus, in any case, . □
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 and take . Then
- (1)
;
- (2)
for ;
- (3)
for .
Proof.
(1) Noting that
and
for any
, then
Hence if
, then
.
Now assume
, we have
and
. Thus
Hence if , then
(2) It is obvious that for by (1).
For
, we have
and
. Then
For
, we have
and
. Then
Thus
for
.
(3) For
, we have
If
, then
and
. Hence
According to the definition, it is easy to get
If
, then
and
. Therefore
Hence we have
□
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 . Then if and only if .
Proof. ⇒ Assume that . Then . By Lemma 2, we are done.
⇐ If
, then by Lemma 2, we have
. Multiplying the equality on the left by
x and noting that
, we get
. Thus by [
23] (Theorem 1.5.3),
.
If
, then by Lemma 2, we have
. Multiplying the equality on the left by
x and noting that
, we get
. Multiplying the equality on the left by
and the equality on the right by
a, we have
. Thus
So
by [
23] (Theorem 1.5.3). □
Theorem 6. Let . Then if and only if for .
Proof. ⇒ It is an immediate result of Lemma 2 because .
⇐ By the assumption and Lemma 2, we have
. Multiplying the equality on the left by
x and using that
and
we have
and
Multiplying the equality (8) on the right by
, we get
. Thus
.
Similarly, multiplying equality (9) by
on the right and by
on the left, we get
. Then
So, in any case,
by [
23] (Theorem 1.5.3). □
Theorem 7. Let . Then if and only if for .
Proof. ⇒ Suppose that . Then and . By Lemma 2, we are done.
⇐ Under the hypothesis and using Lemma 2, we have
Multiplying the Equation (
10) on the right by
, one gets
and
Noting that
Then we have
and
Multiplying the Equations (11) and (12) on the left by
, one gets
. Hence
Now Equation (
10) changes
This gives
If , then , this infers ;
If , then this infers
It follows that
. Hence, in any case, we have
. Thus
by [
23] (Theorem 1.5.3). □
By Lemma 2 and Theorem 1, we obtain the following conclusion:
Theorem 8. Let . Then the following conditions are equivalent:
- (1)
;
- (2)
for some ;
- (3)
for some .
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,
, 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 . Then if and only if
Proof. ⇒ It is a routine verification because and .
⇐ If
, then
. Multiplying the equality on the left by
, one gets
and
. Hence
by [
23] (Theorem 1.2.1). If
, then
Hence
by [
23] (Theorem 1.2.1).
Thus, in any case, , which infers and for any .
If , then .
If , then .
If , then .
In any case, we have
by [
23] (Theorem 1.5.3). □
Theorem 10. Let . Then if and only if
Proof. ⇒ It is obvious.
⇐ Under the assumption, one has
- (1)
If , then ;
- (2)
If , then .
Thus, in any case, we have . This gives and .
If , then
If , then
If , then and It follows that and . So Thus, in any case, and . □
Theorem 11. Let . Then if and only if
Proof. ⇒ Assume that . Then and , it follows that
As desired.
⇐ According to the assumption, one has
- (1)
If , then which infers
- (2)
If , then this induces
Hence, in any case, we have and it follows that for .
- (1)
If , then . Hence .
- (2)
If
, then
this gives
Hence
by [
23] (Theorem 1.5.3).
- (3)
If , then Hence .
□
Theorem 12. Let . Then if and only if
Proof. ⇒ Since , and As desired.
⇐ Applying the hypothesis, one obtains:
If , then . Hence ;
If
, then
and
Hence
.
Thus, in any case, we have and .
Now we have for .
If , then and Hence
If , then and Hence
If
, then
and
Hence
. □
5. Square Rootable Elements
Let R be a ring and . Then a is called a square rootable element of R if there exists such that . In this case, b is called the square root of a.
The set of all square rootable elements of R will be denoted by . Obviously, and . Let . Write . By Theorem 9, we find that square rootable elements can be utilised to characterize SEP elements.
Theorem 13. Let . Then if and only if and .
Proof. ⇒ Since
, by Lemma 1,
. Thus
⇐ Using the assumption, one gets
Then
Hence
and
Thus
. □
By Theorem 13, and [
23] (Theorem 1.5.3), we get the following corollary.
Corollary 1. Let . Then the following conditions are equivalent:
- (1)
;
- (2)
;
- (3)
;
- (4)
.
Theorem 14. Let . Then if and only if .
Proof. ⇒ It follows from Theorem 13.
⇐ Under the hypothesis, we have
Multiplying the equality (13) by
on the right, we get
Then
, which leads to (13) change
Hence
. □
Theorem 15. Let . Then if and only if .
Proof. ⇒ Since , and . By Theorem 13, we are done.
⇐ From the assumption, one gets
Then
Multiplying the equality (14) by
on the right, we get
and
by [
23] (Theorem 1.5.3). □
6. Characterization Using Reversible Elements
Let
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 . Then if and only if , where and .
Proof. ⇒ Since
, by Lemma 1,
. Take
. Then
with
Clearly,
and
.
⇐ If there exists
such that
and
, then
It follows that
Hence
. This gives
By Lemma 1,
. □
Theorem 17. Let . Then if and only if , where and .
Proof. ⇒ Assume that . Then by Lemma 1. Clearly, and .
⇐ From the assumption, one gets
This gives
Multiplying the equality by
on the right, we get
.
Hence , which implies
By Lemma 1, . □
Theorem 18. Let . Then if and only if , where and .
Proof. ⇒ Suppose that . Then, and by Lemma 1, . Set . Then with . Clearly, and .
⇐ If there exists such that and Then
Multiplying the equality by on the right, one gets .
Hence
. It follows that
By Lemma 1,
. □
Theorem 19. Let . Then if and only if , where and .
Proof. ⇒ Since , and . Let Then and Clearly, and
⇐ Under the hypothesis, one gets
and
for some
. This gives
Multiplying the equality by
on the right, one yields
.
Hence
and
Thus, by Lemma 1,
. □
7. The Involutional Projection Elements
Let
R be a
-ring and
. Then
u is called an involutional projection element if
and
. Denote the set of all involutional projection elements of
R by
. Let
. Then, clearly,
. 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 . Then if and only if , where and .
Proof. ⇒ Assume that . Then and by Lemma 1. Take . Then . It can be readily verified that and .
⇐ Under the assumption, one gets
and
Multiplying equality by
on the left, one gets
Hence
This induces
One has
. □
In fact, both the above theorem and the following theorem are inspired by Equation (
1).
Theorem 21. Let . Then if and only if , where and .
Proof. ⇒ Assume that . Then and by Lemma 1. Take , then . By a simple verification, one has and .
⇐ Applying the hypothesis, one gets
It follows that
and
So
. Hence
, this implies
Thus
by Lemma 1. □
Theorem 22. Let . Then if and only if , where and .
Proof. ⇒ Since and Lemma 1, we have and . Set Clearly, with and
⇐ Using the assumption, one gets
By the proof of Theorem 21,
Noting that
Then one obtains
Hence
by Lemma 1. □