e-ISSN: 2278-5728, p-ISSN: 2319-765X. Volume 11, Issue 1 Ver. VI (Jan - Feb. 2015), PP 19-34
www.iosrjournals.org
Abstract: The characterization of g-inverses, minimum norm g-inverses and least square g-inverses of
bimatrices are derived as a generalization of the generalized inverses of matrices.
Keywords: g-inverse, minimum norm g-inverse, least square g-inverse.
AMS Classification: 15A09, 15A15, 15A57.
I. Introduction
A1 and A2 are matrices of same (or) different orders [7,8] and a bimatrix is called unitary if
AB AB* AB* AB I B [8]. For A1 , A2 Cnn , AB A1 A2 and let AB* , r AB and AB denote
the
conjugate transpose, rank and generalized inverse of the bimatrix AB where A is the solution of the equation
(ii) r (H B ) r (FB ) r ( AB )
(iv) r A A A r A .
(iii) r AB r AB
Proof of (i)
2
Now H B H B .H B
AB AB AB AB
A A A A A A A A
A A A
1
A2
A A A
1
A1 A1 A2 A2 A1 A1 A2 A2
A2
A1 A1 A1 A1 A2 A2 A2 A2
A1 A1 A1 A2 A2 A2 A1 A2
DOI: 10.9790/5728-11161934
www.iosrjournals.org
19 | Page
A1 A2 A1 A2 A1 A2 A1 A2
A1 A2 A1 A2
AB AB AB AB
A1 A2 A1 A2
AB AB
HB.
Hence , H B H B .
2
Now FB FB .FB
2
AB AB AB AB
A2 A1 A2
A2 A1 A2
A1 A1 A2 A2 A1 A1 A2 A2
A1 A1 A1 A1 A2 A2 A2 A2
A1 A2 A1 A2 A1 A2 A1 A2
AB AB AB AB
AB AB
= FB .
Hence, FB FB .
Proof of (ii)
2
Now r AB r AB AB
r AB r H B
Also
(1)
r AB r AB AB AB
A A A A A A
r A A A A A A
r A A A A A A
r A A A A A A
r A A A
r
1 1
1 1
r H B AB
r AB r H B
(2)
r AB r H B
Now r AB r AB AB
(3)
r AB r FB
(4)
r A A A
Also r AB r AB AB AB
DOI: 10.9790/5728-11161934
A2 A1 A2
www.iosrjournals.org
20 | Page
r A A A A A A
r A A A A A A
r A A A
r A1 A1 A1 A2 A2 A2
1
r AB FB
r AB r FB
(5)
r AB r FB
r AB r H B r FB
Proof of (iii)
(6)
(7)
r A A A A A A
rA A A A A A
rA A A A
rA A
rA
Hence, r A r A .
Now r AB r AB AB AB
1 1
1 1
Proof of (iv)
Also we have r A A A r A A A A
r A A A A A A A A
r A A A A A A A A
r A A A A A A A A
r A A A A A A A A
r A A A A
rA A
Now r AB AB AB r AB AB
1 1 1
1 1
r HB
r AB
( by (7) )
Hence, r AB AB AB r AB .
Theorem: 2.2
Let AB be a bimatrix, then the following relations hold for a generalized inverse AB of AB .
(i)
A A
B
DOI: 10.9790/5728-11161934
www.iosrjournals.org
21 | Page
(ii) AB AB AB
(iii) AB AB AB
AB AB AB
A A A A
*
AB*
*
B
*
B
Proof of (i)
Let AB AB AB AB
AB AB AB AB
A1 A2
A A A
1
A2 A1 A2
A1* A2* A1 A1 A1 A2 A2 A2
A1 A1 A1 A2 A2 A2
*
A A
*
1
*
2
Thus
A A
*
B
*
B
(8)
A
A A
A A
A
*
*
B
AB AB* and so
*
B
Proof of (ii)
Let GB AB I B AB AB
*
B
*
B
*
B
AB AB
(9)
AB AB AB AB AB AB
A1 A2 A1 A2 A1 A2 A1 A2
GB
GB
A A A A
A A A A A A A A A A A A
A A A A A A A A A A A A
1 1
1 1
DOI: 10.9790/5728-11161934
1 1
1 1
1 1
1 1
A2 A1 A2
www.iosrjournals.org
A A A A A A A A A A A A
A A A A A A A A A A A A
A A A A A A A A A A A A
A1 A2 A1 A2 A1 A2 A1 A2
22 | Page
A1 A1 A1 A1 A1 A1 A2 A2 A2 A2 A2 A2
A1 A1 A1 A1 A1 A1 A2 A2 A2 A2 A2 A2
A1 A2 A1 A2 A1 A2 A1 A2 A1 A2
A A
A A A A
I I A A A A A A A A A A
GB A1 A2 A1 A2 A1 A2 A1 A2
GB GB
A A A A A A A A A A A A
2
1
2
1
2
1
2
1
2
1
2
1
GB GB I1 I 2 A1 A2 A1 A2 A1 A2 A1 A2
A A
2 A1 A2 A1 A2 A1 A2 A1 A2
1
A A A A A A A A
A A A A A A A A A A A A
GB GB I B AB AB AB AB
GB GB
A A A A A A
Let BB A AB .
GB GB I B BB BB BB BB BB BB
I B BB BB BB BB
0
Hence, GB 0
That is, AB I B AB AB
AB AB 0
AB AB AB AB AB AB 0
Hence, AB AB AB
AB AB AB .
Proof of (iii)
SB
GB GB
Let H B AB S B AB AB AB AB
AB
H B A1 A2 S1 S2 A1 A2 A1 A2 A1 A2 A1 A2 A1 A2
H B A1 A2 S1 S2 A1 A2 A1 A2 A1 A2
A1 A2
A1 A2
H A1 A2 S1 S2 A1 A2 A1 A2 A1 A2 A1 A2
DOI: 10.9790/5728-11161934
www.iosrjournals.org
A A
23 | Page
A S A A A A A A S A A A A A
A S A A A A A A S A A A A A
A S A A A A A A S A A A A A
A S A A A A A A S A A A A A
AS A A S A A A A A A A A A
A1S1 A1 A2 S2 A2 A1 A1 A1 A1 A2 A2 A2 A2
1 1 1
1 1 1
1 1
1 1 1
1 1 1
1 1
*
1
1 1
*
2
*
2
*
1
1 1
1 1
1 1 1
*
*
A1 A2 S1 S2 A1 A2 A1 A2 A1 A2 A1 A2 A1 A2
H B A1 A2 S1 S2 A1 A2 A1 A2 A1 A2 A1* A2*
A A
H B H B A1 A2 S1 S2 A1 A2 A1 A2 A1* A2* A1 A2
A A S S A A A A A A A* A*
2
2
1
2 1
2
1
2 1
2 1
1
A A
A1 A2 S1 S2 A1 A2 A1 A2 A1* A2*
A A A A S S A A A A A A A A A* A*
2
2
1
2
1
2 1
2 1
2
1
2 1
2 1
1
A A
A S A S A A S
Let S B AB AB
*
H B* H B
*
B
H B* H B 0 .
Hence , H B 0 .
That is , AB S B AB AB AB AB
*
AB* 0 .
A A A A A A A A 0
A A A A A A A A
B
*
B
*
B
DOI: 10.9790/5728-11161934
*
B
*
B
*
B
*
B
*
B
*
B
www.iosrjournals.org
24 | Page
In this section some of the characteristics of minimum norm g-inverses of matrices found in [2,3] are
extended to minimum norm g-inverses of bimatrices.
Definition: 3.1
A A
AB AB is called a
Theorem: 3.2
Let AB be a bimatrix, then the following three conditions are equivalent:
(i)
AB m AB
AB m AB and AB AB m AB AB
(ii) AB m AB AB AB
(iii) AB m AB AB AB AB
AB
From (i), AB AB AB m AB
AB* AB AB m AB
A1 A2 A1 A2 m A1 A2
A1 A2 A1 m A2 m
A A
1
A1 A1 m A1 A2 A2 m A2
A1 A1 m A1 A2 A2 m A2
A A A A A
A A A A ( A A )
A A A
A A A
*
A1*
1 m
*
1
*
1
*
2
*
B m
B m
2 m
*
1 m
*
2
*
B
*
2
*
2 m
*
1
*
2
*
B
*
B
AB m AB AB*
Hence,
Proof of (ii) (iii)
AB m AB AB* AB* .
From (ii), AB AB m AB AB
Postmultiply by AB AB
AB on both sides
A A A A A A A A A A A A
A A A A A A A A A A A A
1 m
1 m
DOI: 10.9790/5728-11161934
2 m
*
1 1
2 m
*
1
*
2
*
1 1
*
2
www.iosrjournals.org
*
1
*
2
*
2
25 | Page
A A A A A A A A A A A A
A A A A A A A A A A A A
A A A A A A A A A A A A
A A A A A A A A A A A A
A A A A A A A A A A A A
1 m
*
1 1
2 m
*
2
*
1 1
1 m
*
1 1
2 m
*
2
*
1
1 m
2 m
*
1
*
2
*
1
1 m
2 m
*
1
1 m
*
1
*
2
A2 m A1 A2 AB AB
1 m
2 m
AB m AB AB AB AB AB
*
2
*
2
*
2
*
2
*
A A A A
AB m AB AB AB
( by definition 3.1)
( AB )m AB
( by definition 3.1)
*
B
Hence, AB m AB AB AB A
AB .
AB* AB
Replace AB by AB we get
AB* AB*
AB* AB*
A A
*
B
*
B
A1 A2 A1* A2*
A1 A2 A1 A2 A1* A2*
A A A A A A
A A A A A A A A A A
A A A A A A A A A A
A A A A A A A A A A
*
1
*
1
*
1 1
*
1
*
1
*
2
*
2
*
2
*
1 1
*
2
*
1
*
2
*
2
*
2
*
1
*
2
*
1
*
1
*
2
*
2
AB* AB m AB AB*
( by (iii))
A A A
A A A A A A A
A A A A A A
*
B
B m
*
B
1 m
2 m
1 m
DOI: 10.9790/5728-11161934
*
1 1
*
1
2 m
*
2
*
2
www.iosrjournals.org
26 | Page
A A A A A A
A A A A A A
A A A A A A
A A A A
1 m
*
1 m
*
1 1
Premultiply by AB AB AB
*
2
*
2 m
*
2
1 m
*
2
2 m
*
B m
*
B
on both sides
2 m
*
1
*
1 1
*
B m
AB m AB AB m AB A*B AB m
A
A A
Hence, A A
*
B m
AB*
( by(ii))
B m
B m
AB m AB .
*
B
*
B
Replace AB by A
we get
A A A
AB*
* *
B
( by (iii))
A A A
A A A A A
* *
B
*
B
AB* AB AB*
AB m
*
B
* *
B
*
B
*
B
* *
B
A1 A2
A1 A2
A A A A A A A A
A A A A A A A A
A A A A A A A A
A A A A A A A A
A A A A A A A A
A1* A2* A1 A1* A2 A2*
*
1
*
1
*
1
*
1
*
1
*
1
*
1
*
1
*
2
*
1
DOI: 10.9790/5728-11161934
*
2
*
2
*
*
1
*
1
*
2
*
2
*
2
*
2
*
2
*
2
A1 A2
*
2
*
*
2
www.iosrjournals.org
27 | Page
A1* A2* A1 A2
*
A A A A
AB* AB AB AB
*
AB AB AB AB
*
AB AB AB AB
( by definition 3.1)
AB m AB AB AB
( by definition 3.1)
AB AB m AB AB AB AB
AB AB m AB AB
( by definition 3.1)
Hence, AB AB m AB AB .
Theorem: 3.3
Let AB be a bimatrix, then the following relations hold for a minimum norm generalized inverse
AB m
of AB :
is
AB m AB m .
*
(iv) AB AB
AB AB* AB AB m
Proof of (i)
Now AB AB A1 A2 A1 A2
*
A1 A1* A2 A2*
A A A A A A
A A A A
A A A A
A A A A
B
*
B m
*
1 1
*
1 1 m
*
1 m
*
2 m
*
2 m
1 m
*
1 m
*
2 m
*
2 m
2 m
1 m
2 m
*
*
A1 m A2 m A1 A2 m
A A A
A A .
Hence, A A A A
*
2 m
1 m
B m
DOI: 10.9790/5728-11161934
*
B m
B m
B m
B m
B m.
www.iosrjournals.org
28 | Page
AB m A1 A2 m
A1 A2 m
A1 m A2 m
1 A1 m 1 A2 m
1 A1 m A2 m
1 AB m
AB m 1 AB m .
Hence ,
Proof of (iii)
U B ABVB m U1 U 2 A1 A2 V1 V2 m
U1 AV
1 1 U 2 A2V2 m
U1 AV
1 1 m U 2 A2V2 m
V1 m A1 m U1 m V2 m A2 m U 2 m
*
V1* VV
1 1
A1 m U1* U1U1*
V V V A U U U
A A A A
*
2 2
*
2
B m
since
V1* I1
A1 m U1* I1
*
2
2 m
I 2 A2 m U 2* I 2
*
2
*
2
*
B
*
B
VB* AB m U B* .
Hence, U B ABVB m VB AB m U B .
Proof of (iv)
A A
B
*
B m
AB AB*
A A A A
1
*
1
A1 A1* A2 A2*
*
2
A1 A2 A1* A2*
A A A A
A A A A A A A A
A A A A A A A A
*
1 1 m
*
1 m
1 m
*
1 1
*
2 m
*
1 1
*
2 m
*
1 1
*
2
*
2
2 m
*
2
A1 m A1 m A1 A1* A2 m A2 m A2 A2*
*
*
A1 m A2 m A1 m A1 A1* A2 m A2 A2*
DOI: 10.9790/5728-11161934
www.iosrjournals.org
29 | Page
A A
A A
A A
A A
*
*
A1 m A2 m A1 m A2 m
*
B m
B m
*
B m
A A A A
1
*
1
*
2
*
B
*
B
*
B m
Hence, AB AB
AB AB* AB AB m .
Theorem: 4.2
Let AB be a bimatrix, then the following three conditions are equivalent:
(i) AB AB l AB AB and AB AB l
(ii) AB AB AB l AB
(iii) AB AB l AB AB AB
AB AB l
AB*
From (i), AB AB AB l AB
AB* AB AB l AB
AB*
A1 A2 A1 l A2 l A1 A2
A1 A1 l A1 A2 A2 l A2
A1 A1 A1 A2 A2 A2
A A A A A
A A A A A A
A A A
A A A
A1*
*
1 l
*
1
B l
*
2
*
1 l
*
2
*
B
*
B
*
1
*
2 l
*
2
*
2 l
*
1
*
2
*
B
*
B l
AB* AB AB l
DOI: 10.9790/5728-11161934
www.iosrjournals.org
30 | Page
Premultiply by AB AB AB
on both sides
A1 A2 A1* A2* A1 A2
A A A A A
*
1
*
2
1 l
A2 l
A A A A A A A A
A A A A A A A A A A A A
A A A A A A A A A A A A
( by (i) theorem 2.2)
A A A A A A A A A A A A
A A A A A A A A A A A A
A A A A A A
A A A A A A
A A A A A A
( by definition 4.1)
A A A A
( by definition 4.1)
A1 A2 A1 A2
1
*
1
1 1
1 l
*
1
*
2
*
2
*
2
*
1
*
2
*
1
*
2
*
B
*
1
1 l
*
1 1
*
2
*
1
*
1 1
*
1
1 1
*
2
*
2
*
2
1 l
2 l
1 l
2 l
2 l
*
1
*
2
1 l
2 l
B l
B l
B l
B l
AB AB l
( by definition 4.1)
Hence, AB AB l AB AB AB
AB AB l
AB* .
A1 A2 A1* A2* A1 A2
A1 A2 A1 A2
A1* A2*
A1* A2*
A1* A2*
A1 A2 A1 A2 A1* A2*
A A A A A A A A
1 1
DOI: 10.9790/5728-11161934
*
1
*
1
*
2
A A
*
1
( by (iii))
*
2
*
2
www.iosrjournals.org
31 | Page
A1
A1
A A
A1* A2
*
*
A1 A1* A2
*
*
1
*
1
A A
A2*
*
*
A2 A2*
*
*
2
*
2
A
A A A A A A A A
A A A A A A A A
*
1
*
1
1 1
*
1
*
2
*
2
*
2
*
1
*
2
*
1
*
2
AB AB AB AB*
AB AB AB AB
AB AB AB AB
( by definition 4.1)
AB AB l AB AB
( by definition 4.1)
AB AB l AB AB AB AB
AB AB l AB AB
( by definition 4.1)
Hence , AB AB l AB AB .
AB AB AB* AB AB* AB
A1 A2 A1* A2* A1 A2
A1 A2 A1 A2
A A A1 A2
*
1
A A A A A A
*
2
*
1
*
1
A1 A2 A1 A2 A1* A2*
*
2
*
2
A A A A
*
1
*
2
*
*
A A A A A A
A A A A A A A A A A
A A A A A A A A A A
A A A A A A A A A A
A1* A1 A1*
*
1
*
1
1 1 1
*
1
*
1
*
1 1
*
1 1
*
1 1
*
1
*
2
*
2
*
1
*
1
*
2
*
2
*
2
*
*
2
*
2
*
2
*
2
A2*
*
2
*
2
*
2
A A
*
1
*
2
DOI: 10.9790/5728-11161934
www.iosrjournals.org
32 | Page
AB* AB* AB AB l
( by (iii))
A A A A
A A A A A A A A
* *
B
* *
2
*
1
*
B
*
B l
*
1
*
2
*
2 l
A1 A2 A1* A2* A1 A2 A1 l A2 l
A A A A A A
A A A A A A
A A A A A A
A A A A
AB A1* A1 A1 l A2* A2 A2 l
*
1 l
*
1 1
*
1 l
*
2
1 l
*
B
Postmultiply by AB AB
*
2
*
1
2 l
*
B l
*
2 l
*
2 l
*
1 1
*
2
A A A A A
A A A A A A
A A
A A
Hence, A A = A A .
*
B l
*
B
*
B l
B l
AB AB* AB AB*
*
B
*
B
AB*
B l
*
B
B l
( by (iii) )
( by (ii) )
B l
B l
B l
Theorem: 4.3
Let AB be a bimatrix, then the following relations hold for a least square generalized inverse AB l
of
AB :
*
*
(ii) One choice of U B ABVB l VB AB l U B where U B and VB are unitary bimatrices.
(i)
Proof of (i)
Now
AB l
A1 A2 l
A1 A2 l
A1 l A2 l
1 A1 l 1 A2 l
1 l
A2 l
1 AB l
Hence,
AB l 1 AB l .
DOI: 10.9790/5728-11161934
www.iosrjournals.org
33 | Page
U B ABVB l U1 U 2 A1 A2 V1 V2 l
U1 AV
1 1 U 2 A2V2 l
U1 AV
1 1 l U 2 A2V2 l
V1 l A1 l U1 l V2 l A2 l U 2 l
since A
B l
I V
*
1
A1 l I1
AB* AB AB*
U1* I 2 V2* A2 l I 2 U 2*
V1* V2* A1 l A2 l
*
1
U 2*
VB* AB l U B*
Hence, U B ABVB l VB AB l U B .
References
[1].
[2].
[3].
[4].
[5].
[6].
[7].
[8].
Ben Isreal.A and Greville.T.N.E, Generalized Inverse: Theory and Applications, Wiley-Interscience, New York, 1994.
Campbell.S.L and Meyer.C.D, Generalized Inverses of Linear Transformations,Society for Industrial and Applied
Mathematics,Philadelphia, 2009.
Haruo Yanai, Kei Takeuchi, Yashio Takane, Projection Matrices, Geneneralized Inverse Matrices, and Singular Value
Decomposition, Springer, New York, 2011.
Penrose.R, A generalized Inverse for Matrices, Proc. Cambridge Phil. Soc., Vol.51, 1955, (PP 406-413).
Radhakrishna Rao.C, Calculus of Generalized Inverses of Matrices Part-I: General Theory, Sankhya, Series A, Vol.29, No. 3,
September 1967, (PP 317-342).
Radhakrishna Rao.C and Sujit Kumar Mitra, Generalised Inverse of a matrix and its Applications, Wiley, New York, 1971.
Ramesh.G. and Maduranthaki.P, On Unitary Bimatrices, International Journal of Current Research, Vol.6, Issue 09, September
2014, (PP 8395-8407).
Ramesh.G. and Maduranthaki.P, On Some properties of Unitary and Normal Bimatrices, International Journal of Recent Scientific
Research, Vol.5, Issue10 , October 2014, ( PP 1936-1940).
DOI: 10.9790/5728-11161934
www.iosrjournals.org
34 | Page