1. Introduction
The set of all matrices over the complex field will be denoted by . Let , , and denote the conjugate transpose, column space, null space and rank of , respectively.
For
, if
satisfies
,
,
and
, then
X is called a
Moore-Penrose inverse of
A [
1,
2]. This matrix
X always exists, is unique and will be denoted by
.
Let
. It can be easily proved that exists a non-negative integer
k for which
holds. The
Drazin index of
A is the smallest non-negative
k such that
, and denoted by
. A matrix
such that
,
and
hold, where
, is called a
Drazin inverse of
A. It can be proved, (see, e.g., [
3] Chapter 4), that the Drazin inverse of any square matrix
A exists, is unique, and will be denoted by
. If
, then the Drazin inverse of
A is called the
group inverse and denoted by
The core inverse of a complex matrix was introduced by Baksalary and Trenkler in [
4]. Let
, a matrix
is called a
core inverse of
A, if it satisfies
and
, where
denotes the orthogonal projector onto
. If such a matrix
X exists, then it is unique and denoted by
. In [
4] it was proved that a square matrix
A is core invertible if and only if
.
In [
5], Mary introduced a new type of generalized inverse, namely, the inverse along an element. Let
. We say that
A is
invertible along D if there exists
such that
If such Y exists, then it is unique and denoted by . The inverse along an element extends some known generalized inverses, for example, the group inverse, the Drazin inverse and the Moore-Penrose inverse.
In ([
6] Definition 4.1), Benítez et al. gave the following definition extending simultaneously the notion of the
-inverse from elements in rings [
7] to rectangular matrices and the invertibility along an element. Let
and
, the matrix
A is said to be
-invertible, if there exists a matrix
such that
If such a matrix
Y exists, then it is unique and denoted by
. Many existence criteria and properties of the
-inverse can be found in, for example, [
6,
8,
9,
10,
11,
12,
13,
14]. From the definition of the
-inverse, it is evident that
and
. The
-inverse of
A is a generalization of some well-known generalized inverses. By ([
7] p. 1910), the Moore-Penrose inverse of
A coincides with the
-inverse of
A.
is the
-inverse of
A,
is the
-inverse of
A, where
and
is the
-inverse of
A. By ([
15] Theorem 4.4), we have that the
-inverse is the core inverse of
A.
Let
be a matrix of rank
r, let
T be a subspace of
of dimension
and let
S be a subspace of
of dimension
. The matrix
A has a
-inverse
X such that
and
if and only if
(see, e.g., [
3] Section 2.6). In this case,
X is unique and is denoted by
. Many properties of
can be found in, for example, [
3,
16,
17,
18,
19].
The theory of the generalized inverses has many applications, as one can see in [
3]. Another important application is the study of singular systems of differential equations (see, e.g., [
20,
21]).
The main purpose of the manuscript is twofold: to research the rank of the difference
and to apply this study to characterize when
. These results are contained in
Section 3 and
Section 4. The paper finishes by particularizing the previous results to some standard generalized inverses.
2. Preliminaries
The following lemmas about the partitioned matrices and will be useful in the sequel.
Lemma 1. Let and .
- (1)
([
22] Theorem 5)
For any and , we have- (2)
if and only if .
Proof. Since (1) was proved in ([
22] Theorem 5), we only give the proof of (2). Observe that
, which leads to
. ☐
Lemma 2. Let and .
- (1)
([
22] Theorem 5)
For any and , we have- (2)
if and only if .
Proof. Again, only the the proof of (2) will be given. Since
, by employing item (2) of Lemma 1 we get
The proof finishes by recalling the equality valid for any matrix X, where the superscript denotes the orthogonal complement. ☐
Lemma 3. ([
22], Theorem 5)
Let and .- (1)
If there is a matrix such that , then - (2)
If there is a matrix such that , then
Proof. We only prove (1) since (2) is analogous. Observe that and are equivalent. Now, (1) is evident from the expression valid for any pair of matrices X and Y with the same number of rows. ☐
Lemma 4. ([
22], Theorem 5)
Let and .- (1)
If there is a matrix such that , then - (2)
If there is a matrix such that , then
Proof. The proof is similar than the proof of Lemma 2, item (2). ☐
From Lemma 3 and Lemma 4, we have the following two lemmas.
Lemma 5. Let and . If there are matrices and such that and , then Lemma 6. Let and . If there are matrices and such that and , then Lemma 7. ([
23] Theorem 2.1)
Let be any two idempotent matrices. The difference satisfies the following rank equality: The following lemma gives the calculation and the characterization of the existence of the -inverse of a matrix A.
Lemma 8 ([
6] Theorem 4.4)
. Let and . The following statements are equivalent:- (1)
the -inverse of A exists;
- (2)
.
In this case, .
Lemma 9 ([
6] Corollary 7.2)
. Let and . The following statements are equivalent:- (1)
the matrix A is invertible along G;
- (2)
the outer inverse exists.
4. Applications
In this section, as an application of the preceding section, we will characterize when holds. Also, several rank equalities for the Moore-Penrose inverse, the Drazin inverse, the group inverse, the core inverse and the inverse along an element will be presented in view of the rank equalities for the -inverse presented in Theorem 1.
Theorem 2. Let , . If A is invertible and D is invertible, then the following statements are equivalent:
- (1)
;
- (2)
and ;
- (3)
and ;
- (4)
and ;
- (5)
and .
Proof. By
, we have
, that is
. Similarly, we have
. By Lemma 2, we have
By Lemma 1, we have
where
is any inner inverse of
.
Assume that (1) holds. By Theorem 1 we have
By employing
and Lemma 8, the equality in (
17) can be written as
Having in mind (
18), (
15), and (
16), we have that
and
. That is
and
, we have just obtained (2).
By using
, Lemma 8 and (
17) we get
The proof of (1) ⇒ (3) finishes as the proof of (1) ⇒ (2).
(2) ⇒ (1). The hypotheses are clearly equivalent to
and
, which in view of (
15), (
16), and Theorem 1 lead to (1).
(3) ⇒ (1). The proof is similar than the proof of (2) ⇒ (1).
(1) ⇔ (4). From the proof of Theorem 1 and
, we have
By
, we have
. Thus, by Lemma 2, the expression (
19) can be written as
By Lemma 1 and Lemma 2, we have
and
By (6) and
, we have
Thus by (
20) and (
21), we have that
if and only if both
and
hold. It is easy to see that
is equivalent to
and
is equivalent to
.
The proof of is similar to the proof of . ☐
Since the inverse of a matrix A along D coincides with the -inverse of A, Theorem 1 and Theorem 2 lead to the following corollaries.
Corollary 1. Let . If A is invertible along and B is invertible along , then Corollary 2. Let . If A is invertible along and B is invertible along , then the following statements are equivalent:
- (1)
;
- (2)
and ;
- (3)
and ;
- (4)
and ;
- (5)
and .
Let
. By ([
7] p. 1910), we have that the Moore-Penrose inverse of
A coincides with the
-inverse of
A, the Drazin inverse of
A coincides with the
-inverse of
A for some integer
k and
A is group invertible if and only if
A is
-invertible. By ([
15] Theorem 4.4), we have that the
-inverse coincides with the core inverse of
A. We have that the
-inverse coincides with the dual core inverse of
A. Thus, by Theorem 1 and Theorem 2, more results of the inverse along an element, the Moore-Penrose inverse, Drazin inverse, core inverse and dual core inverse can be obtained. We give some characterizations of these results as follows, and leaving the remaining parts to the reader to research. Also, some rank characterizations of the EP elements can be got by the following Corollary 3.
Corollary 3. Let . Then
- (1)
Let and be the Moore-Penrose inverse of A and B, respectively. We have - (2)
Let , and , be the Drazin inverse of A and B, respectively. We have - (3)
Let and , be the group inverse of A and B, respectively. We have - (4)
Let and , be the core inverse of A and B, respectively. We have
Proof. (1). Since
coincides with the
-inverse of
A and
coincides with the
-inverse of
B, by Theorem 1, we have
That is
by the following obvious facts
,
,
.
, , are obvious. ☐
Some particular cases can be obtained from the previous corollary by setting the matrix
B to some concrete generalized inverses. For example, when
we have
, which can be used to get a characterization of the EP matrices (
) or the co-EP matrices (
is nonsingular, see [
24]).