A comment on some recent results concerning the reverse order law for {1, 3, 4}-inverses

https://doi.org/10.1016/j.amc.2010.05.013Get rights and content

Abstract

This paper has been motivated by the one of Liu and Yang [D. Liu, H. Yang, The reverse order law for {1, 3, 4}-inverse of the product of two matrices, Appl. Math. Comp. 215 (12) (2010) 4293–4303] in which the authors consider separately the cases when (AB){1,3,4}B{1,3,4}·A{1,3,4} and (AB){1,3,4}=B{1,3,4}·A{1,3,4}, where ACn×m and BCm×n. Here we prove that (AB){1,3,4}B{1,3,4}·A{1,3,4} is actually equivalent to (AB){1,3,4}=B{1,3,4}·A{1,3,4}. We show that (AB){1,3,4}B{1,3,4}·A{1,3,4} can only be possible if nm and in this case, we present purely algebraic necessary and sufficient conditions for this inclusion to hold. Also we give some new characterizations of B{1,3,4}·A{1,3,4}(AB){1,3,4}.

Introduction

Let ACn×n. By R(A),N(A) and rank(A), we denote the range, the null space and the rank of the matrix A, respectively. The Moore–Penrose inverse of ACm×n, is the unique matrix ACn×m satisfying the four Penrose equations [11]:(1)AAA=A,(2)AAA=A,(3)(AA)=AA,(4)(AA)=AA.

It is well-known that each matrix A has its Moore–Penrose inverse.

If K{1,2,3,4} is arbitrary we shall say that BCn×m is a K-inverse of ACm×n if B satisfies the Penrose equation (j) for each jK. We shall write AK for the collection of all K inverses of A, and AK for an unspecified element XAK. For an arbitrary matrix A, we will denote EA=I-AA and FA=I-AA. Remark that EA is the projection on N(A), while FA is the projection on N(A).

The reverse order law for the Moore–Penrose inverse seems first to have been studied by Greville [5], in the 60’s, giving a necessary and sufficient condition for the reverse order law(AB)=BA,for matrices A and B. This was followed (see [4]) by further equivalent conditions for the same thing. Sun and Wei [8] extended the reverse order law conditions to the weighted Moore–Penrose inverse, and Hartwig [6] and Tian [9], [10] to the product of three and more matrices, respectively.

The next step was to consider the reverse order law for K-inverses, where K{1,2,3,4}.

The motivation for this paper has been the paper of Liu and Yang [7], in which they give necessary and sufficient conditions forB{1,3,4}·A{1,3,4}(AB){1,3,4},(AB){1,3,4}B{1,3,4}·A{1,3,4},(AB){1,3,4}=B{1,3,4}·A{1,3,4}.

What they did not realize was that (AB){1,3,4}B{1,3,4}·A{1,3,4} is actually equivalent to (AB){1,3,4}=B{1,3,4}·A{1,3,4}. So, in Theorem 3 (2) [7], they have two extra conditions.

Here, we will give a very short proof that (AB){1,3,4}B{1,3,4}·A{1,3,4} is equivalent to (AB){1,3,4}=B{1,3,4}·A{1,3,4}. We show that (AB){1,3,4}B{1,3,4}·A{1,3,4} can only be possible if nm and in this case, we present purely algebraic necessary and sufficient conditions for this inclusion to hold. Also we give some new characterizations of B{1,3,4}·A{1,3,4}(AB){1,3,4}.

We begin by recalling some well-known results.

Lemma 1.1 [2]

Let ACn×m and BCm×n. Then the following statements are equivalent:

  • (1)

    ABA=A and (AB)=AB,

  • (2)

    AAB=A,

  • (3)

    There exists YCm×n such that B=A+I-AAY.

Hence, Lemma 1.1 characterizes the set A{1,3}. Analogously, we have the following result which characterizes A{1,4}:

Lemma 1.2 [2]

Let ACn×m and BCm×n. Then the following statements are equivalent:

  • (1)

    ABA=A and (BA)=BA,

  • (2)

    BAA=A,

  • (3)

    There exists YCm×n such that B=A+Y1-AA.

We can prove the analogous result for A{1, 3, 4}:

Lemma 1.3

Let ACn×m and BCm×n. Then the following statements are equivalent:

  • (1)

    BA{1,3,4},

  • (2)

    AAB=A and BAA=A,

  • (3)

    There exists YCm×n such that B=A+I-AAYI-AA.

Proof

  • (1)  (2)

    If BA{1,3,4}, thenAAB=A(AB)=(ABA)=AandBAA=(ABA)=A.

  • (2)  (1)

    If AAB=A and BAA=A, thenABA=AAABA=AAABA=AAA=A,AB=BAAB=(AB)(AB),BA=BAAB=(BA)(BA),so, BA{1,3,4}.

  • (1)  (3)

    If BA{1,3,4}, then BA{1,3}, so by Lemma 1.1, B=A+I-AAT, for some TCm×n. Also, BA=AA, so I-AATA=0. Set Z=I-AAT. We have by Lemma 1.2 that Z is a solution of equation ZA=0, so Z=Y1-AA, for some YCm×n. Now, B=A+I-AAYI-AA.

  • (3)  (1)

    This is evident.  

Hence,A{1,3,4}=A+I-AAYI-AA:YCm×n.

The following lemma is an auxiliary result which can easily be checked:

Lemma 1.4

Let ACn×m,PCn×n and QCm×m. If P and Q are idempotents, then(PAQ)=Q(PAQ)P.

The following result is proved in [3] for bounded linear operators on Hilbert spaces, so it is also valid in the matrix case.

Lemma 1.5

Let ACn×m and BCm×n. The following statements are equivalent:

  • (1)

    (AB)=BA,

  • (2)

    (AB)(AB)A=ABB and B(AB)AB=AAB.

Section snippets

Results

First, we will present necessary and sufficient conditions for B{1,3,4}·A{1,3,4}(AB){1,3,4}:

Theorem 2.1

Let ACn×m and BCm×n. Then the following conditions are equivalent:

  • (i)

    B{1,3,4}·A{1,3,4}(AB){1,3,4},

  • (ii)

    BBAAB=AAB and ABBAA=ABB,

  • (iii)

    BA=(AB).

Proof

  • (i)  (ii):

    If (i) holds, then BA(AB){1,3}, so by Theorem 2.2 [3], BBAAB=AAB. Similarly, by Theorem 2.3 [3], we get that ABBAA=ABB.

  • (ii)  (i):

    From BBAAB=AAB (Theorem 2.2, [3]), we get that B{1,3}·A{1,3}(AB){1,3}. Hence, B{1,3,4}·A{1,3,4}(AB){1,3}. Similarly, from ABBAA=ABB

Acknowledgements

This work was supported by Grant No. 144003 of the Ministry of Science, Technology and Development, Republic of Serbia.

The authors thank the anonymous reviewers for very valuable comments and suggestions concerning an earlier version of this paper. Their remarks on Lemma 2.1 were exactly what lead the authors to establish the result stated in Theorem 2.4.

References (11)

There are more references available in the full text version of this article.

Cited by (17)

  • Algebraic proof methods for identities of matrices and operators: Improvements of Hartwig's triple reverse order law

    2021, Applied Mathematics and Computation
    Citation Excerpt :

    For details on how our framework and software are used to find and prove these results, see Section 2.1. For more information on this subject please see [15–33]. In the following, we discuss different aspects and use cases of the proof framework outlined in Section 1.1.

  • Reverse order laws for the Drazin inverses

    2016, Journal of Mathematical Analysis and Applications
  • Reverse order law for the group inverses

    2011, Journal of Mathematical Analysis and Applications
  • Improvements on the reverse order laws

    2023, Mathematische Nachrichten
View all citing articles on Scopus
View full text