Next Article in Journal
Some Generalizations of the Jensen-Type Inequalities with Applications
Previous Article in Journal
Tensor Product of Operators Satisfying Zariouh’s Property (gaz), and Stability under Perturbations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Note on the Reverse Order Law for g-Inverse of Operator Product

School of Mathematics and Computational Science, Wuyi University, Jiangmen 529020, China
*
Author to whom correspondence should be addressed.
Axioms 2022, 11(5), 226; https://doi.org/10.3390/axioms11050226
Submission received: 20 February 2022 / Revised: 6 April 2022 / Accepted: 7 May 2022 / Published: 12 May 2022

Abstract

:
The generalized inverse has many important applications in aspects of the theoretical research of matrices and statistics. One of the core problems of the generalized inverse is finding the necessary and sufficient conditions of the reverse order laws for the generalized inverse of the operator product. In this paper, we study the reverse order law for the g-inverse of an operator product T 1 T 2 T 3 using the technique of matrix form of bounded linear operators. In particular, some necessary and sufficient conditions for the inclusion T 3 { 1 } T 2 { 1 } T 1 { 1 } ( T 1 T 2 T 3 ) { 1 } is presented. Moreover, some finite dimensional results are extended to infinite dimensional settings.

1. Introduction

Throughout this paper ‘an operator’ means ‘a bounded linear operator over Hilbert space’. H , I , J and K denote arbitrary Hilbert spaces. L ( H , K ) denote the set of all bounded linear operators from H to K and L ( H ) = L ( H , H ) . I denotes the identity operator over Hilbert space and O is the zero operator over Hilbert space. For an operator T L ( H , K ) , T * , R ( T ) and N ( T ) denote the adjoint operator, the range and the null-space of T, respectively.
Recall that, an operator X L ( K , H ) is called the Moore–Penrose inverse of T L ( H , K ) , if X satisfies the following four operator equations [1]:
( 1 ) T X T = T , ( 2 ) X T X = X , ( 3 ) ( T X ) * = T X , ( 4 ) ( X T ) * = X T .
If such operator X exists, then it is unique and is denoted by T . It is well known that the Moore–Penrose inverse of T exists if, and only if, R ( T ) is closed, see [2,3].
For any operator T L ( H , K ) , let T { i , j , , k } denote the set of operators X L ( K , H ) which satisfy equations ( i ) , ( j ) , , ( k ) from among Equations (1)–(4) of Formula (1). An operator in T { i , j , , k } is called an { i , j , , k } -inverse of T and denoted by T ( i , j , , k ) . For example, an operator X of the set T { 1 } is called a { 1 } -inverse or a g-inverse of T and is denoted by T ( 1 ) . The well-known seven common types of generalized inverse of T introduced from ( 1.1 ) are, respectively, the { 1 } -inverse, { 1 , 2 } -inverse, { 1 , 3 } -inverse, { 1 , 4 } -inverse, { 1 , 2 , 3 } -inverse, { 1 , 2 , 4 } -inverse and { 1 , 2 , 3 , 4 } -inverse, the last being the unique Moore–Penrose inverse. In particular, when T is nonsingular, then it is easily seen that T = T 1 . We refer the reader to [2,3,4] for basic results on generalized inverses.
The concepts of the generalized inverse were shown to be very useful in various applied mathematical settings. For example, applications to singular differential or difference equations, Markov chains, cryptography, iterative method or multibody system dynamics, and so on, which can be found in [2,3,5,6,7,8]. In the above applied mathematical settings, large-scale scientific computing problems eventually translate to least square problems. Using generalized inverse to give some fast and effective iterative solution algorithms for these least square problems has attracted considerable attention, and many interesting results have been obtained, see [2,3,9,10,11].
Suppose T i , i = 1 , 2 , 3 , and β are bounded linear operators over Hilbert space, the least squares problem is finding x that minimizes the norm:
min x ( T 1 T 2 T 3 ) x β 2 ,
which is used in many practical scientific problems. Any solution x of the above LS can be expressed as x = ( T 1 T 2 T 3 ) ( 1 , 3 ) β . If ( T 1 T 2 T 3 ) x = β is consistent, the minimum norm solution x has the form x = ( T 1 T 2 T 3 ) ( 1 , 4 ) β . The unique minimal norm least square solution x of the above LS is x = ( T 1 T 2 T 3 ) β . One of the problems concerning the above LS is under what conditions the reverse order law
T 3 ( 1 , j , , k ) T 2 ( 1 , j , , k ) T 1 ( 1 , j , , k ) ( T 1 T 2 T 3 ) ( 1 , j , , k )
holds.
If Formula (3) is true, then, according to the reverse order law Formula (3) and the iterative algorithm theory, we can naturally construct some ideal iterative sequence, and then design some fast and effective iterative algorithms to solve Formula (2). If Formula (3) is not necessarily true, can we find the necessary and sufficient conditions for Formula (3)? Applying the reverse order law to design some fast and effective iterative algorithms to solve Formula (2), will avoid multiple decompositions of the correlation matrices and keep it in each iteration. The structure of the iterative sequence reduces the amount of machine storage, maintains the convergence, stability of the algorithm, and improves the operation speed, see [2,3,9,11,12,13].
The reverse order law for generalized inverses of operator (or matrix) product yields a class of interesting problems that are fundamental in the theory of generalized inverses, see [2,3], which have attracted considerable attention since the middle 1960s, and many interesting results have been obtained, see [14,15,16,17,18,19,20,21,22].
For the generalized inverses of matrix product, Greville [7] first gave a necessary and sufficient condition for ( A B ) B A . Since then, the problem of the reverse order law for generalized inverses of a matrix product was studied widely. Hartwig [8] derived the necessary and sufficient conditions for the Moore–Penrose inverse of the product of three matrices, and Y. Tian [14] obtained the reverse order law for the Moore–Penrose inverse of the products of multiple matrices. M. Wei [15] and De Pierro [16], respectively, derived necessary and sufficient conditions for the reverse order laws B { 1 } A { 1 } ( A B ) { 1 } and B { 1 , 2 } A { 1 , 2 } ( A B ) { 1 , 2 } , by applying product singular value decomposition (PSVD). M. Wei [17] then deduced necessary and sufficient conditions for reverse order laws for g-inverse of multiple matrix product. For A n { 1 , 2 , k } A n 1 { 1 , 2 , k } A 1 { 1 , 2 , k } ( A 1 A 2 A n ) { 1 , 2 , k } , k = 3 , 4 , Xiong and Zheng [18] presented the equivalent conditions using extremal ranks of the generalized Schur complement.
For the generalized inverses of operator product, Bouldin [5] and Izumino [19] extended the results of Greville [7] to the bounded linear operators on Hilbert space, using the gaps between subspaces. Let T 1 L ( H , L ) and T 2 L ( K , H ) , such that the product T 1 T 2 is meaningful, using the technique of matrix form of bounded linear operators, D.S.Djordjević [20] showed that the reverse order law T 2 T 1 = ( T 1 T 2 ) holds if, and only if, R ( T 1 * T 1 T 2 ) R ( T 2 ) and R ( T 2 T 2 * T 1 * ) R ( T 1 * ) . J.Kohila et al. [21] obtained the necessary and sufficient conditions for the reverse order law of the Moore–Penrose inverse in rings with involutions. In [22], D.S.Cvetković-IIić et al., studied this reverse order law of the Moore–Penrose inverse in C * -algebra. The reader can find more results of the reverse order law for the Moore–Penrose inverse of operator product in [23,24,25,26,27].
Recently, Xiong and Qin [28,29] studied the reverse order laws for { 1 , 3 } inverse and { 1 , 4 } inverse of operator products, using the technique of matrix form of bounded linear operators [30] and some equivalent conditions are derived for these reverse order laws. With the same threads of [28,29], in this paper, we will study the reverse order law for the g-inverse of an operator product T 1 T 2 T 3 . In particular, some necessary and sufficient conditions for the reverse order law
T 3 { 1 } T 2 { 1 } T 1 { 1 } ( T 1 T 2 T 3 ) { 1 }
is presented. Moreover, some finite dimensional results are extended to infinite dimensional settings.

2. A Set of Lemmas

As the main tools of our discussion, we first present the following lemmas.
Lemma 1
([30]). Suppose T L ( H , K ) that have a closed range. Let H 1 and H 2 be closed and mutually orthogonal subspaces of H , such that H 1 H 2 = H , and K 1 , K 2 be closed and mutually orthogonal subspaces of K , such that K = K 1 K 2 . Then the operator T has the following matrix representations with respect to the orthogonal sums of subspaces H = H 1 H 2 = R ( T * ) N ( T ) and K = K 1 K 2 = R ( T ) N ( T * ) :
(1)
T = T 11 T 12 O O : H 1 H 2 R ( T ) N ( T * ) a n d T = T 11 * E 1 O T 12 * E 1 O : R ( T ) N ( T * ) H 1 H 2 ,
w h e r e E = T 11 T 11 * + T 12 T 12 * i s i n v e r t i b l e o n R ( T ) ;
(2)
T = T 11 O T 21 O : R ( T * ) N ( T ) K 1 K 2   a n d T = F 1 T 11 * F 1 T 12 * O O : K 1 K 2 R ( T * ) N ( T ) ,
w h e r e F = T 11 * T 11 + T 21 * T 21 i s i n v e r t i b l e o n R ( T * ) ;
(3)
T = T 11 O O O : R ( T * ) N ( T ) R ( T ) N ( T * )   a n d T = T 11 1 O O O : R ( T ) N ( T * ) R ( T * ) N ( T ) ,
w h e r e T 11 i s i n v e r t i b l e o n R ( T * ) .
Lemma 2
([2,3]). Let T L ( H , K ) have a closed range and G L ( K , H ) . Then the following statements are equivalent:
(1) T G T = T G T { 1 } ;
(2) there exists some X L ( K , H ) , such that G = T + X T T X T T .
Lemma 3
([2,3]). Let T L ( H , K ) and N L ( K , H ) have closed ranges. Then
(1) T T N = N R ( N ) R ( T ) ;
(2) N T T = N R ( N * ) R ( T * ) .
Lemma 4
([24]). Let T L ( H , K ) and N L ( M , N ) have closed ranges. Then T X N = O for every X L ( N , H ) if and only if T = O or N = O .

3. Main Results

Let T 1 L ( J , K ) , T 2 L ( I , J ) and T 3 L ( H , I ) where T 1 , T 2 , T 3 and T 1 T 2 T 3 are regular operators. From Lemma 1, we know that the operators T 1 , T 2 and T 3 have the following matrix forms with respect to the orthogonal sum of subspaces:
T 1 = T 1 11 T 1 12 O O : R ( T 2 ) N ( T 2 * ) R ( T 1 ) N ( T 1 * ) ,
T 1 = ( T 1 11 ) * D 1 O ( T 1 12 ) * D 1 O : R ( T 1 ) N ( T 1 * ) R ( T 2 ) N ( T 2 * ) ,
where D = T 1 11 ( T 1 11 ) * + T 1 12 ( T 1 12 ) * is invertible on R ( T 1 ) .
T 2 = T 2 11 O O O : R ( T 2 * ) N ( T 2 ) R ( T 2 ) N ( T 2 * ) ,
T 2 = ( T 2 11 ) 1 O O O : R ( T 2 ) N ( T 2 * ) R ( T 2 * ) N ( T 2 ) ,
where T 2 11 is invertible on R ( T 2 * ) .
T 3 = T 3 11 O T 3 21 O : R ( T 3 * ) N ( T 3 ) R ( T 2 * ) N ( T 2 ) ,
T 3 = S 1 ( T 3 11 ) * S 1 ( T 3 21 ) * O O : R ( T 2 * ) N ( T 2 ) R ( T 3 * ) N ( T 3 ) ,
where S = ( T 3 11 ) * T 3 11 + ( T 3 21 ) * T 3 21 is invertible on R ( T 3 * ) .
According to the Formulas (5)–(10), we have the following theorem.
Theorem 1.
Let T 1 L ( J , K ) , T 2 L ( I , J ) and T 3 L ( H , I ) where T 1 , T 2 and T 3 are regular operators. Then
(1) N ( T 1 ) R ( T 2 ) ( T 1 12 ) * D 1 T 1 11 = O a n d ( T 1 12 ) * D 1 T 1 12 = I ;
(2) N ( T 2 ) R ( T 3 ) T 3 21 S 1 ( T 3 11 ) * = O a n d T 3 21 S 1 ( T 3 21 ) * = I ;
(3) R ( T 2 ( I T 1 T 1 ) ) R ( T 3 ) ( I T 3 11 S 1 ( T 3 11 ) * ) ( T 2 11 ) 1 ( I ( T 1 11 ) * D 1 T 1 11 ) = O and
( I T 3 11 S 1 ( T 3 11 ) * ) ( T 2 11 ) 1 ( T 1 11 ) * D 1 T 1 12 = O and T 3 21 S 1 ( T 3 11 ) * ( T 2 11 ) 1 ( I ( T 1 11 ) * D 1 T 1 11 ) = O and T 3 11 S 1 ( T 3 11 ) * ( T 2 11 ) 1 ( T 1 11 ) * D 1 T 1 12 = O .
Proof. 
By Lemma 3, we know that
N ( T 1 ) R ( T 2 ) ( I T 2 T 2 ) ( I T 1 T 1 ) = O ,
N ( T 2 ) R ( T 3 ) ( I T 3 T 3 ) ( I T 2 T 2 ) = O ,
and
R ( T 2 ( I T 1 T 1 ) ) R ( T 3 ) ( I T 3 T 3 ) T 2 ( I T 1 T 1 ) = O .
Combining the Formulas (5)–(10) with the Formulas (11)–(13), we have
N ( T 1 ) R ( T 2 ) ( I T 2 T 2 ) ( I T 1 T 1 ) = O ( T 1 12 ) * D 1 T 1 11 = O and ( T 1 12 ) * D 1 T 1 12 = I ,
N ( T 2 ) R ( T 3 ) ( I T 3 T 3 ) ( I T 2 T 2 ) = O T 3 21 S 1 ( T 3 11 ) * = O and T 3 21 S 1 ( T 3 21 ) * = I
and
R ( T 2 ( I T 1 T 1 ) ) R ( T 3 ) ( I T 3 T 3 ) T 2 ( I T 1 T 1 ) = O ( I T 3 11 S 1 ( T 3 11 ) * ) ( T 2 11 ) 1 ( I ( T 1 11 ) * D 1 T 1 11 ) = O , ( I T 3 11 S 1 ( T 3 11 ) * ) ( T 2 11 ) 1 ( T 1 11 ) * D 1 T 1 12 = O , T 3 21 S 1 ( T 3 11 ) * ( T 2 11 ) 1 ( I ( T 1 11 ) * D 1 T 1 11 ) = O , T 3 11 S 1 ( T 3 11 ) * ( T 2 11 ) 1 ( T 1 11 ) * D 1 T 1 12 = O .
From (14)–(16), we have Theorem 1.  □
From Lemma 1, we know that the operator T 1 T 2 T 3 has the following matrix forms with respect to the orthogonal sum of subspaces:
T 1 T 2 T 3 = T 1 11 T 2 11 T 3 11 O O O : R ( T 3 * ) N ( T 3 ) R ( T 1 ) N ( T 1 * )
and
( T 1 T 2 T 3 ) * = ( T 3 11 ) * ( T 2 11 ) * ( T 1 11 ) * O O O : R ( T 1 ) N ( T 1 * ) R ( T 3 * ) N ( T 3 ) .
Combining (5)–(10) with the results in Lemma 2, it follows that there exist three bounded linear operators W , H , P :
W = W 11 W 12 W 21 W 22 : R ( T 1 ) N ( T 1 * ) R ( T 2 ) N ( T 2 * ) ,
where W L ( K , J ) and W 11 , W 12 , W 21 , W 22 are arbitrary bounded linear operators on appropriate spaces.
H = H 11 H 12 H 21 H 22 : R ( T 2 ) N ( T 2 * ) R ( T 2 * ) N ( T 2 ) ,
where H L ( J , I ) and H 11 , H 12 , H 21 , H 22 are arbitrary bounded linear operators on appropriate spaces.
P = P 11 P 12 P 21 P 22 : R ( T 2 * ) N ( T 2 ) R ( T 3 * ) N ( T 3 ) ,
where P L ( I , H ) and P 11 , P 12 , P 21 , P 22 are arbitrary bounded linear operators on appropriate spaces.
Furthermore, by Lemma 2, we have
T 1 ( 1 ) = T 1 + W T 1 T 1 W T 1 T 1 = τ 11 W 12 τ 21 W 22 , w h e r e
τ 11 = ( T 1 11 ) * D 1 + W 11 ( T 1 11 ) * D 1 T 1 11 W 11 ( T 1 11 ) * D 1 T 1 12 W 21 , τ 21 = ( T 1 12 ) * D 1 + W 21 ( T 1 12 ) * D 1 T 1 12 W 21 ( T 1 12 ) * D 1 T 1 11 W 11 .
T 2 ( 1 ) = T 2 + H T 2 T 2 H T 2 T 2 = ( T 2 11 ) 1 H 12 H 21 H 22 ,
T 3 ( 1 ) = T 3 + P T 3 T 3 P T 3 T 3 = μ 11 μ 12 P 21 P 22 , w h e r e
μ 11 = S 1 ( T 3 11 ) * + P 11 P 11 T 3 11 S 1 ( T 3 11 ) * P 12 T 3 21 S 1 ( T 3 11 ) * , μ 12 = S 1 ( T 3 21 ) * + P 12 P 12 T 3 21 S 1 ( T 3 21 ) * P 11 T 3 11 S 1 ( T 3 21 ) * .
Combining the Formulas (17)–(21) with the results in Theorem 1, we obtain the main result of this paper.
Theorem 2.
Let T 1 L ( J , K ) , T 2 L ( I , J ) and T 3 L ( H , I ) , where T 1 , T 2 , T 3 and T 1 T 2 T 3 are regular operators. Then the following statements are equivalent:
(1) T 3 { 1 } T 2 { 1 } T 1 { 1 } ( T 1 T 2 T 3 ) { 1 } ;
(2) N ( T 1 ) R ( T 2 ) , N ( T 2 ) R ( T 3 ) and R ( T 2 ( I T 1 T 1 ) ) R ( T 3 ) .
Proof. 
From the Formula 1 in Lemma 1, we know that the reverse order law (4) holds, i.e., the conditions 1 in Theorem 2 holds, if, and only if,
( T 1 T 2 T 3 ) T 3 ( 1 ) T 2 ( 1 ) T 1 ( 1 ) ( T 1 T 2 T 3 ) = T 1 T 2 T 3
holds for any T i ( 1 ) T i { 1 } , i = 1 , 2 , 3 .
By (17) and (19)–(21), we have
( T 1 T 2 T 3 ) T 3 ( 1 ) T 2 ( 1 ) T 1 ( 1 ) ( T 1 T 2 T 3 ) = T 1 11 T 2 11 T 3 11 O O O × μ 11 μ 12 P 21 P 22 × ( T 2 11 ) 1 H 12 H 21 H 22 × τ 11 W 12 τ 21 W 22 × T 1 11 T 2 11 T 3 11 O O O = ν 11 ν 12 O O T 1 11 T 2 11 T 3 11 O O O = ν 11 T 1 11 T 2 11 T 3 11 O O O ,
where
ν 11 = ( T 1 11 T 2 11 T 3 11 μ 11 ( T 2 11 ) 1 ) τ 11 + ( T 1 11 T 2 11 T 3 11 μ 12 H 22 ) τ 11 + ( T 1 11 T 2 11 T 3 11 μ 11 ( T 2 11 ) 1 ) τ 21 + ( T 1 11 T 2 11 T 3 11 μ 12 H 22 ) τ 21 ,
ν 12 = ( T 1 11 T 2 11 T 3 11 μ 11 ( T 2 11 ) 1 ) W 12 + ( T 1 11 T 2 11 T 3 11 μ 12 H 21 ) W 12 + ( T 1 11 T 2 11 T 3 11 μ 11 H 12 ) W 22 + ( T 1 11 T 2 11 T 3 11 μ 12 H 22 ) W 22 .
In the rest of this section, we will prove that the conditions 1 in Theorem 2 is equal to the conditions 2 in Theorem 2, i.e., the Formula (22) is equal to the Formulas (14)–(16) in Theorem 1.
C o n d i t i o n s 2 C o n d i t i o n s 1 : Combining (23) with (14)–(16), we have
ν 11 T 1 11 T 2 11 T 3 11 = T 1 11 T 2 11 T 3 11
and
( T 1 T 2 T 3 ) T 3 ( 1 ) T 2 ( 1 ) T 1 ( 1 ) ( T 1 T 2 T 3 ) = T 1 11 T 2 11 T 3 11 O O O × μ 11 μ 12 P 21 P 22 × ( T 2 11 ) 1 H 12 H 21 H 22 × τ 11 W 12 τ 21 W 22 × T 1 11 T 2 11 T 3 11 O O O = ν 11 T 1 11 T 2 11 T 3 11 O O O = T 1 11 T 2 11 T 3 11 O O O = T 1 T 2 T 3 .
That is, from (14)–(16), we have (22), i.e., we proved that C o n d i t i o n s 2 C o n d i t i o n s 1 .
C o n d i t i o n s 1 C o n d i t i o n s 2 : If the reverse order law T 3 { 1 } T 2 { 1 } T 1 { 1 } ( T 1 T 2 T 3 ) { 1 } holds. From Lemma 2, we known that the equation ( T 1 T 2 T 3 ) T 3 ( 1 ) T 2 ( 1 ) T 1 ( 1 ) ( T 1 T 2 T 3 ) = T 1 T 2 T 3 holds for any T i ( 1 ) T i { 1 } , i = 1 , 2 , 3 .
Firstly, let
T 1 ( 1 ) = T 1 + ( I T 1 T 1 ) W = η 11 η 12 η 21 η 22 ,
where
η 11 = ( T 1 11 ) * D 1 + ( I ( T 1 11 ) * D 1 T 1 11 ) W 11 ( T 1 11 ) * D 1 T 1 12 W 21 , η 12 = ( I ( T 1 11 ) * D 1 T 1 11 ) W 12 ( T 1 11 ) * D 1 T 1 12 W 22 , η 21 = ( T 1 12 ) * D 1 + ( I ( T 1 12 ) * D 1 T 1 12 ) W 21 ( T 1 12 ) * D 1 T 1 11 W 11 , η 22 = ( I ( T 1 12 ) * D 1 T 1 12 ) W 22 ( T 1 12 ) * D 1 T 1 11 W 12 ,
T 2 ( 1 ) = T 2 = ( T 2 11 ) 1 O O O ,
T 3 ( 1 ) = T 3 + P ( I T 3 T 3 ) = ρ 11 ρ 12 ρ 21 ρ 22 ,
where
ρ 11 = S 1 ( T 3 11 ) * + P 11 ( I T 3 11 S 1 ( T 3 11 ) * ) P 12 T 3 21 S 1 ( T 3 11 ) * , ρ 12 = S 1 ( T 3 11 ) * + P 12 ( I T 3 21 S 1 ( T 3 21 ) * ) P 11 T 3 11 S 1 ( T 3 21 ) * , ρ 21 = P 21 ( I T 3 11 S 1 ( T 3 11 ) * ) P 22 T 3 21 S 1 ( T 3 11 ) * , ρ 22 = P 22 ( I T 3 21 S 1 ( T 3 21 ) * ) P 21 T 3 11 S 1 ( T 3 21 ) * .
Then, we have
( T 1 T 2 T 3 ) T 3 ( 1 ) T 2 T 1 ( 1 ) ( T 1 T 2 T 3 ) = T 1 T 2 T 3
and
( T 1 T 2 T 3 ) T 3 ( 1 ) T 2 T 1 ( 1 ) ( T 1 T 2 T 3 ) = T 1 T 2 T 3 T 1 11 T 2 11 T 3 11 O O O × ρ 11 ρ 12 ρ 21 ρ 22 × ( T 2 11 ) 1 O O O × η 11 η 12 η 21 η 22 × T 1 11 T 2 11 T 3 11 O O O = T 1 11 T 2 11 T 3 11 O O O .
Since W i j ( i , j = 1 , 2 ) are arbitrary, let W 11 = W 12 = W 21 = W 22 = O , we have
( T 1 T 2 T 3 ) T 3 ( 1 ) T 2 T 1 ( 1 ) ( T 1 T 2 T 3 ) = T 1 T 2 T 3 T 1 11 T 2 11 T 3 11 O O O × ρ 11 ρ 12 ρ 21 ρ 22 × ( T 2 11 ) 1 O O O × ( T 1 11 ) * D 1 O ( T 1 12 ) * D 1 O × T 1 11 T 2 11 T 3 11 O O O = T 1 11 T 2 11 T 3 11 O O O .
Combining (29) with (30), we have
T 1 11 T 2 11 T 3 11 O O O × ρ 11 ρ 12 ρ 21 ρ 22 × ( T 2 11 ) 1 O O O × η 11 ( T 1 11 ) * D 1 η 12 η 21 ( T 1 12 ) * D 1 η 22 × T 1 11 T 2 11 T 3 11 O O O = O O O O .
Let P 11 = P 12 = P 21 = P 22 = O , then from (31), we have
T 1 11 T 2 11 T 3 11 O O O × S 1 ( T 3 11 ) * S 1 ( T 3 21 ) * O O × ( T 2 11 ) 1 O O O × η 11 ( T 1 11 ) * D 1 η 2 η 21 ( T 1 12 ) * D 1 η 22 × T 1 11 T 2 11 T 3 11 O O O = O O O O .
From (31) and (32), we get
T 1 11 T 2 11 T 3 11 O O O × ρ 11 S 1 ( T 3 11 ) * ρ 12 S 1 ( T 3 21 ) * ρ 21 ρ 22 × ( T 2 11 ) 1 O O O × ( η 11 ( T 1 11 ) * D 1 η 2 η 21 ( T 1 12 ) * D 1 η 22 × T 1 11 T 2 11 T 3 11 O O O = O O O O .
According to the Equation (33), we have
T 1 11 T 2 11 T 3 11 P 11 ( I T 3 11 S 1 ( T 3 11 ) * ) ( T 2 11 ) 1 ( I ( T 1 11 ) * D 1 T 1 11 ) W 11 T 1 11 T 2 11 T 3 11 T 1 11 T 2 11 T 3 11 P 12 T 3 21 S 1 ( T 3 11 ) * ( T 2 11 ) 1 ( I ( T 1 11 ) * D 1 T 1 11 ) W 11 T 1 11 T 2 11 T 3 11 T 1 11 T 2 11 T 3 11 P 11 ( I T 3 11 S 1 ( T 3 11 ) * ) ( T 2 11 ) 1 ( T 1 11 ) * D 1 T 1 12 W 21 T 1 11 T 2 11 T 3 11 + T 1 11 T 2 11 T 3 11 P 12 T 3 21 S 1 ( T 3 11 ) * ( T 2 11 ) 1 ( T 1 11 ) * D 1 T 1 12 W 21 T 1 11 T 2 11 T 3 11 = O .
Since P 11 , P 12 and W 11 , W 21 are arbitrary, then from Lemma 4 and (34), we have
( I T 3 11 S 1 ( T 3 11 ) * ) ( T 2 11 ) 1 ( I ( T 1 11 ) * D 1 T 1 11 ) = O , ( I T 3 11 S 1 ( T 3 11 ) * ) ( T 2 11 ) 1 ( T 1 11 ) * D 1 T 1 12 = O , T 3 21 S 1 ( T 3 11 ) * ( T 2 11 ) 1 ( I ( T 1 11 ) * D 1 T 1 11 ) = O , T 3 11 S 1 ( T 3 11 ) * ( T 2 11 ) 1 ( T 1 11 ) * D 1 T 1 12 = O .
From (35) and (16), we get that if the reverse order law T 3 { 1 } T 2 { 1 } T 1 { 1 } ( T 1 T 2 T 3 ) { 1 } holds, then R ( T 2 ( I T 1 T 1 ) ) R ( T 3 ) .
Secondly, let
T 1 ( 1 ) = T 1 = ( T 1 11 ) * D 1 O ( T 1 12 ) * D 1 O ,
T 2 ( 1 ) = T 2 + ( I T 2 T 2 ) H = ( T 2 11 ) 1 O H 21 H 22 ,
T 3 ( 1 ) = T 3 + P ( I T 3 T 3 ) = ρ 11 ρ 12 ρ 21 ρ 22 ,
where
ρ 11 = S 1 ( T 3 11 ) * + P 11 ( I T 3 11 S 1 ( T 3 11 ) * ) P 12 T 3 21 S 1 ( T 3 11 ) * , ρ 12 = S 1 ( T 3 11 ) * + P 12 ( I T 3 21 S 1 ( T 3 21 ) * ) P 11 T 3 11 S 1 ( T 3 21 ) * , ρ 21 = P 21 ( I T 3 11 S 1 ( T 3 11 ) * ) P 22 T 3 21 S 1 ( T 3 11 ) * , ρ 22 = P 22 ( I T 3 21 S 1 ( T 3 21 ) * ) P 21 T 3 11 S 1 ( T 3 21 ) * .
Then, we have
( T 1 T 2 T 3 ) T 3 ( 1 ) T 2 ( 1 ) T 1 ( T 1 T 2 T 3 ) = T 1 T 2 T 3
and
( T 1 T 2 T 3 ) T 3 ( 1 ) T 2 ( 1 ) T 1 ( T 1 T 2 T 3 ) = T 1 T 2 T 3 T 1 11 T 2 11 T 3 11 O O O × ρ 11 ρ 12 ρ 21 ρ 22 × ( T 2 11 ) 1 O H 21 H 22 × ( T 1 11 ) * D 1 O ( T 1 12 ) * D 1 O × T 1 11 T 2 11 T 3 11 O O O = T 1 11 T 2 11 T 3 11 O O O .
Since H i j ( i , j = 1 , 2 ) are arbitrary, let H 21 = H 22 = O , we have
( T 1 T 2 T 3 ) T 3 ( 1 ) T 2 ( 1 ) T 1 ( T 1 T 2 T 3 ) = T 1 T 2 T 3 T 1 11 T 2 11 T 3 11 O O O × ρ 11 ρ 12 ρ 21 ρ 22 × ( T 2 11 ) 1 O O O × ( T 1 11 ) * D 1 O ( T 1 12 ) * D 1 O × T 1 11 T 2 11 T 3 11 O O O = T 1 11 T 2 11 T 3 11 O O O .
Combining (40) with (41), we have
T 1 11 T 2 11 T 3 11 O O O × ρ 11 ρ 12 ρ 21 ρ 22 × O O H 21 H 22 × ( T 1 11 ) * D 1 O ( T 1 12 ) * D 1 O × T 1 11 T 2 11 T 3 11 O O O = O O O O .
Let P 11 = P 12 = P 21 = P 22 = O , then from (42), we have
T 1 11 T 2 11 T 3 11 O O O × S 1 ( T 3 11 ) * S 1 ( T 3 21 ) * O O × O O H 21 H 22 × ( T 1 11 ) * D 1 O ( T 1 12 ) * D 1 O × T 1 11 T 2 11 T 3 11 O O O = O O O O .
From (42) and (43), we get
T 1 11 T 2 11 T 3 11 O O O × ρ 11 S 1 ( T 3 11 ) * ρ 12 S 1 ( T 3 21 ) * ρ 21 ρ 22 × O O H 21 H 22 × ( T 1 11 ) * D 1 O ( T 1 12 ) * D 1 O × T 1 11 T 2 11 T 3 11 O O O = O O O O .
According to the Equation (44), we have
T 1 11 T 2 11 T 3 11 P 12 ( I T 3 21 S 1 ( T 3 21 ) * ) H 21 ( T 1 11 ) * D 1 T 1 11 T 2 11 T 3 11 + T 1 11 T 2 11 T 3 11 P 12 ( I T 3 21 S 1 ( T 3 21 ) * ) H 22 ( T 1 12 ) * D 1 T 1 11 T 2 11 T 3 11 T 1 11 T 2 11 T 3 11 P 11 T 3 11 S 1 ( T 3 21 ) * H 21 ( T 1 11 ) * D 1 T 1 11 T 2 11 T 3 11 T 1 11 T 2 11 T 3 11 P 11 T 3 11 S 1 ( T 3 21 ) * H 22 ( T 1 12 ) * D 1 T 1 11 T 2 11 T 3 11 = O .
Since P 11 , P 12 and H 21 , H 2 2 are arbitrary, then from Lemma 4 and (45), we have
I T 3 21 S 1 ( T 3 21 ) * = O a d n T 3 11 S 1 ( T 3 21 ) * = O .
From (15) and (46), we get that if the reverse order law T 3 { 1 } T 2 { 1 } T 1 { 1 } ( T 1 T 2 T 3 ) { 1 } holds, then N ( T 2 ) R ( T 3 ) .
Thirdly, let
T 1 ( 1 ) = T 1 + ( I T 1 T 1 ) W = η 11 η 12 η 21 η 22 ,
where
η 11 = ( T 1 11 ) * D 1 + ( I ( T 1 11 ) * D 1 T 1 11 ) W 11 ( T 1 11 ) * D 1 T 1 12 W 21 , η 12 = ( I ( T 1 11 ) * D 1 T 1 11 ) W 12 ( T 1 11 ) * D 1 T 1 12 W 22 , η 21 = ( T 1 12 ) * D 1 + ( I ( T 1 12 ) * D 1 T 1 12 ) W 21 ( T 1 12 ) * D 1 T 1 11 W 11 , η 22 = ( I ( T 1 12 ) * D 1 T 1 12 ) W 22 ( T 1 12 ) * D 1 T 1 11 W 12 ,
T 2 ( 1 ) = T 2 + H ( I T 2 T 2 ) = ( T 2 11 ) 1 H 12 O H 22 ,
T 3 ( 1 ) = T 3 = S 1 ( T 3 11 ) * S 1 ( T 3 21 ) * O O .
Then we have
( T 1 T 2 T 3 ) T 3 T 2 ( 1 ) T 1 ( 1 ) ( T 1 T 2 T 3 ) = T 1 T 2 T 3
and
( T 1 T 2 T 3 ) T 3 T 2 ( 1 ) T 1 ( 1 ) ( T 1 T 2 T 3 ) = T 1 T 2 T 3 T 1 11 T 2 11 T 3 11 O O O × S 1 ( T 3 11 ) * S 1 ( T 3 21 ) * O O × ( T 2 11 ) 1 H 12 O H 22 × η 11 η 12 η 21 η 22 × T 1 11 T 2 11 T 3 11 O O O = T 1 11 T 2 11 T 3 11 O O O .
Since W i j ( i , j = 1 , 2 ) are arbitrary, let W 11 = W 12 = W 21 = W 22 = O , we have
( T 1 T 2 T 3 ) T 3 ( 1 ) T 2 T 1 ( 1 ) ( T 1 T 2 T 3 ) = T 1 T 2 T 3 T 1 11 T 2 11 T 3 11 O O O × S 1 ( T 3 11 ) * S 1 ( T 3 21 ) * O O × ( T 2 11 ) 1 H 12 O H 22 × ( T 1 11 ) * D 1 O ( T 1 12 ) * D 1 O × T 1 11 T 2 11 T 3 11 O O O = T 1 11 T 2 11 T 3 11 O O O .
Combining (51) with (52), we have
T 1 11 T 2 11 T 3 11 O O O × S 1 ( T 3 11 ) * S 1 ( T 3 21 ) * O O × ( T 2 11 ) 1 H 12 O H 22 × η 11 ( T 1 11 ) * D 1 η 12 η 21 ( T 1 12 ) * D 1 η 22 × T 1 11 T 2 11 T 3 11 O O O = O O O O .
Let H 12 = H 22 = O , then from (53) we have
T 1 11 T 2 11 T 3 11 O O O × S 1 ( T 3 11 ) * S 1 ( T 3 21 ) * O O × ( T 2 11 ) 1 O O O × η 11 ( T 1 11 ) * D 1 η 2 η 21 ( T 1 12 ) * D 1 η 22 × T 1 11 T 2 11 T 3 11 O O O = O O O O .
From (53) and (54), we get
T 1 11 T 2 11 T 3 11 O O O × S 1 ( T 3 11 ) * S 1 ( T 3 21 ) * O O × O H 12 O H 22 × η 11 ( T 1 11 ) * D 1 η 2 η 21 ( T 1 12 ) * D 1 η 22 × T 1 11 T 2 11 T 3 11 O O O = O O O O .
According to the Formula (55), we have
T 1 11 T 2 11 T 3 11 S 1 ( T 3 11 ) * H 12 ( I ( T 1 12 ) * D 1 T 1 12 ) W 21 T 1 11 T 2 11 T 3 11 + T 1 11 T 2 11 T 3 11 S 1 ( T 3 21 ) * H 22 ( I ( T 1 12 ) * D 1 T 1 12 ) W 21 T 1 11 T 2 11 T 3 11 T 1 11 T 2 11 T 3 11 S 1 ( T 3 11 ) * H 12 ( T 1 12 ) * D 1 T 1 11 W 11 T 1 11 T 2 11 T 3 11 T 1 11 T 2 11 T 3 11 S 1 ( T 3 21 ) * H 22 ( T 1 12 ) * D 1 T 1 11 W 11 T 1 11 T 2 11 T 3 11 = O .
Since H 12 , H 22 and W 11 , W 21 are arbitrary, then from Lemma 4 and (56), we have
I ( T 1 12 ) * D 1 T 1 12 = O a n d ( T 1 12 ) * D 1 T 1 11 = O .
From (14) and (57), we get that if the reverse order law T 3 { 1 } T 2 { 1 } T 1 { 1 } ( T 1 T 2 T 3 ) { 1 } holds, then N ( T 1 ) R ( T 2 ) .
Finally, combining (35), (46) with (57), we prove that if the reverse order law Formula (4) holds, the equalities (14)–(16) also hold. That is, C o n d i t i o n s 1 C o n d i t i o n s 2 .  □
Corollary 1.
Let T 1 L ( J , K ) and T 2 L ( I , J ) , where T 1 , T 2 and T 1 T 2 are regular operators. Then the following statements are equivalent:
(1) T 2 { 1 } T 1 { 1 } ( T 1 T 2 ) { 1 } ;
(2) N ( T 1 ) R ( T 2 ) .

4. Conclusions

Many problems in applied sciences, such as non-linear control theory, matrix analysis, statistics and numerical linear algebra are closely related to the least squares problems of the operator equation ( T 1 T 2 T n ) x = b . If the operator equation is consistent, any solution x of the above equation can be expressed as x = ( T 1 T 2 T n ) ( 1 ) b . One of the problems concerning the above least squares problems is under what conditions the reverse order law for the g-inverse of operator product holds. In this paper, by using the technique of matrix form of bounded linear operators, we study the reverse order law for the g-inverse of an operator product T 1 T 2 T 3 . In particular, some necessary and sufficient conditions for the inclusion T 3 { 1 } T 2 { 1 } T 1 { 1 } ( T 1 T 2 T 3 ) { 1 } is presented. Moreover, some finite dimensional results are extended to infinite dimensional settings. The work in this paper provides a useful tool in many algorithms for the computation of the least squares solutions of operator equations.

Author Contributions

All authors have contributed equally to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Project for Characteristic Innovation of 2018 Guangdong University (No: 2018KTSCX234), the Natural Science Foundation of Guangdong (No: 2014A030313625), the Basic Theory and Scientific Research of Science and Technology Project of Jiangmen City, China (No: 2020JC01010, 2021030102610005049) and the Joint Research and Development Fund of Wuyi University, Hong Kong and Macao (No: 2019WGALH20).

Institutional Review Board Statement

Studies not involving humans or animals.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank Varvari Radu and the anonymous referees for their very detailed comments and constructive suggestions, which greatly improved the presentation of this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Penrose, R. A Generalized Inverse for Matrix; Cambridge University Press: Cambridge, UK, 1955; Volume 51, pp. 406–413. [Google Scholar]
  2. Ben-Israel, A.; Greville, T.N.E. Generalized Inverse: Theory and Applications, 2nd ed.; Wiley-Interscience, 1974; Springer: New York, NY, USA, 2002. [Google Scholar]
  3. Wang, G.R.; Wei, Y.; Qiao, S. Generalized Inverses: Theory and Computations; Science Press: Beijing, China, 2004. [Google Scholar]
  4. Harte, R.E. Invertibility and Singularity for Bounded Linear Operators; Marcel Dekker: New York, NY, USA, 1988. [Google Scholar]
  5. Bouldin, R.H. The pseudo-inverse of a product. SIAM J. Appl. Math. 1973, 24, 489–495. [Google Scholar] [CrossRef] [Green Version]
  6. Galperin, A.M.; Waksman, Z. On pseudoinverse of operator products. Linear Algebra Appl. 1980, 33, 123–131. [Google Scholar] [CrossRef] [Green Version]
  7. Greville, T.N.E. Note on the generalized inverse of a matrix product. SIAM Rev. 1966, 8, 518–521. [Google Scholar] [CrossRef]
  8. Hartwig, R.E. The reverse order law revisited. Linear Algebra Appl. 1986, 76, 241–246. [Google Scholar] [CrossRef] [Green Version]
  9. Campbell, S.L.; Meyer, C.D. Generalized Inverse of Linear Transformations; Dover: New York, NY, USA, 1979. [Google Scholar]
  10. Cvetković-Ilić, D.S.; Wei, Y. Algebraic Properties of Generalized Inverses, Series: Developments in Mathematics; John Springer: Rochester, NY, USA, 2017; Volume 52. [Google Scholar]
  11. Rao, C.R.; Mitra, S.K. Generalized Inverses of Matrices and its Applications; Wiley: New York, NY, USA, 1971. [Google Scholar]
  12. Cvetković-IIić, D.S.; Nikolov, J. Reverse order laws for reflexive generalized inverse of operators. Linear Multilinear Algebra 2015, 63, 1167–1175. [Google Scholar]
  13. Pavlović, V.; Cvetković-Ilić, D.S. Applications of completions of operator matrices to reverse order law for {1}-inverses of operators on Hilbert spaces. Linear Algebra Appl. 2015, 484, 219–236. [Google Scholar]
  14. Tian, Y. Reverse order laws for the generalized inverse of multiple matrix products. Linear Algebra Appl. 1994, 211, 85–100. [Google Scholar] [CrossRef] [Green Version]
  15. Wei, M. Equivalent conditions for generalized inverse of products. Linear Algebra Appl. 1997, 266, 347–363. [Google Scholar] [CrossRef] [Green Version]
  16. Pierro, D.R.A.; Wei, M. Reverse order laws for reflexive generalized inverse of products of matrices. Linear Algebra Appl. 1998, 277, 299–311. [Google Scholar] [CrossRef] [Green Version]
  17. Wei, M. Reverse order laws for generalized inverse of multiple matrix products. Linear Algebra Appl. 1998, 293, 273–288. [Google Scholar] [CrossRef] [Green Version]
  18. Zheng, B.; Xiong, Z. The reverse order laws for {1,2,3}- and {1,2,4}-inverses of multiple matrix products. Linear Multilinear Algebra 2010, 58, 765–782. [Google Scholar] [CrossRef]
  19. Izumino, S. The product of operators with closed range and an extension of the reverse orderlaw. Tohoku Math. J. 1982, 34, 43–52. [Google Scholar] [CrossRef]
  20. Djordjević, D.S. Furthuer results on the reverse order law for generalized inverses. SIAM J. Matrix. Anal. Appl. 2007, 29, 1242–1246. [Google Scholar]
  21. Koliha, J.J.; Djordjević, D.S.; Cvetković-IIić, D. Moore-Penrose inverse in rings with involution. Linear Algebra Appl. 2007, 426, 371–381. [Google Scholar] [CrossRef] [Green Version]
  22. Cvetković-IIić, D.; Harte, R. Reverse order laws in C*-algebras. Linear Algebra Appl. 2001, 434, 1388–1394. [Google Scholar]
  23. Caradus, S.R. Generalized Inverses and Operator Theory; Queen’s Paper in Pure and Applied Mathematics; Queen’s University: Kingston, ON, Canada, 1978. [Google Scholar]
  24. Liu, X.; Fu, S.; Yu, Y. An invariance property of operator products related to the mix-ed-type reverse order laws. Linear Multilinear Algebra 2016, 64, 885–896. [Google Scholar] [CrossRef]
  25. Nashed, M.Z. Inner, outer and generalized inverses in Banach and Hilbert spaces. Numer. Funct. Anal. Optim. 1987, 9, 261–325. [Google Scholar] [CrossRef]
  26. Radenković, J.N. Reverse order law for generalized inverses of multiple operator product. Linear Multilinear Algebra 2016, 64, 1266–1282. [Google Scholar]
  27. Sun, W.; Wei, Y. Inverse order rule for weighted generalized inverse. SIAM J. Matrix Anal. Appl. 1998, 19, 772–775. [Google Scholar] [CrossRef] [Green Version]
  28. Xiong, Z.; Qin, Y. Mixed-type reverse order laws for the generalized inverses of operator products. Arab. J. Sci. Eng. 2011, 36, 475–486. [Google Scholar] [CrossRef]
  29. Xiong, Z.; Qin, Y. A note on the reverse order law for least square g-inverse of operator product. Linear Multilinear Algebra 2016, 64, 1404–1414. [Google Scholar] [CrossRef]
  30. Conway, J.B. A Course in Functional Analysis; Springer: Berlin/Heidelberg, Germany, 1990. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Qin, Y.; Xiong, Z. A Note on the Reverse Order Law for g-Inverse of Operator Product. Axioms 2022, 11, 226. https://doi.org/10.3390/axioms11050226

AMA Style

Qin Y, Xiong Z. A Note on the Reverse Order Law for g-Inverse of Operator Product. Axioms. 2022; 11(5):226. https://doi.org/10.3390/axioms11050226

Chicago/Turabian Style

Qin, Yingying, and Zhiping Xiong. 2022. "A Note on the Reverse Order Law for g-Inverse of Operator Product" Axioms 11, no. 5: 226. https://doi.org/10.3390/axioms11050226

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