Chapter 20

The Moore-Penrose Inverse

[13/100%]
Show
LaTeX
Problem 20.1

Show that, for any m×nm \times n matrix B\mathbf{B} of full column rank and for any n×pn \times p matrix C\mathbf{C} of full row rank,

(BC)+=C+B+. (\mathbf{B}\mathbf{C})^{+} = \mathbf{C}^{+}\mathbf{B}^{+}.
?
Problem 20.2

Show that, for any m×nm \times n matrix A\mathbf{A}, A+=A′\mathbf{A}^{+} = \mathbf{A}' if and only if A′A\mathbf{A}'\mathbf{A} is idempotent.

?
Problem 20.3

Let T\mathbf{T} represent an m×pm \times p matrix, U\mathbf{U} an m×qm \times q matrix, V\mathbf{V} an n×pn \times p matrix, and W\mathbf{W} an n×qn \times q matrix, and define Q=W−VT−U\mathbf{Q} = \mathbf{W} - \mathbf{V}\mathbf{T}^{-}\mathbf{U}. If C(U)⊂C(T)C(\mathbf{U}) \subset C(\mathbf{T}) and R(V)⊂R(T)R(\mathbf{V}) \subset R(\mathbf{T}), then

(T−+T−UQ−VT−−T−UQ−−Q−VT−Q−)(∗) \begin{pmatrix} \mathbf{T}^{-} + \mathbf{T}^{-}\mathbf{U}\mathbf{Q}^{-}\mathbf{V}\mathbf{T}^{-} & -\mathbf{T}^{-}\mathbf{U}\mathbf{Q}^{-} \\ -\mathbf{Q}^{-}\mathbf{V}\mathbf{T}^{-} & \mathbf{Q}^{-} \end{pmatrix} \tag {$*$}

is a generalized inverse of the partitioned matrix (TUVW)\begin{pmatrix} \mathbf{T} & \mathbf{U} \\ \mathbf{V} & \mathbf{W} \end{pmatrix}, and

(Q−−Q−VT−−T−UQ−T−+T−UQ−VT−)(∗∗) \begin{pmatrix} \mathbf{Q}^{-} & -\mathbf{Q}^{-}\mathbf{V}\mathbf{T}^{-} \\ -\mathbf{T}^{-}\mathbf{U}\mathbf{Q}^{-} & \mathbf{T}^{-} + \mathbf{T}^{-}\mathbf{U}\mathbf{Q}^{-}\mathbf{V}\mathbf{T}^{-} \end{pmatrix} \tag {$**$}

a generalized inverse of (WVUT)\begin{pmatrix} \mathbf{W} & \mathbf{V} \\ \mathbf{U} & \mathbf{T} \end{pmatrix}. Show that if the generalized inverses T−\mathbf{T}^{-} and Q−\mathbf{Q}^{-} (of T\mathbf{T} and Q\mathbf{Q}, respectively) are both reflexive [and if C(U)⊂C(T)C(\mathbf{U}) \subset C(\mathbf{T}) and R(V)⊂R(T)R(\mathbf{V}) \subset R(\mathbf{T})], then generalized inverses (∗)(*) and (∗∗)(**) are also reflexive.

?
Problem 20.4

Determine which of Penrose Conditions (1)--(4) [also known as Moore-Penrose Conditions (1)--(4)] are necessarily satisfied by a left inverse of an m×nm \times n matrix A\mathbf{A} (when a left inverse exists). Which of the Penrose conditions are necessarily satisfied by a right inverse of an m×nm \times n matrix A\mathbf{A} (when a right inverse exists)?

?
Problem 20.5

Let A\mathbf{A} represent an m×nm \times n matrix and G\mathbf{G} an n×mn \times m matrix.

?
(a)

Show that G\mathbf{G} is the Moore-Penrose inverse of A\mathbf{A} if and only if G\mathbf{G} is a minimum norm generalized inverse of A\mathbf{A} and A\mathbf{A} is a minimum norm generalized inverse of G\mathbf{G}.

(b)

Show that G\mathbf{G} is the Moore-Penrose inverse of A\mathbf{A} if and only if GAA′=A′\mathbf{G}\mathbf{A}\mathbf{A}' = \mathbf{A}' and AGG′=G′\mathbf{A}\mathbf{G}\mathbf{G}' = \mathbf{G}'.

(c)

Show that G\mathbf{G} is the Moore-Penrose inverse of A\mathbf{A} if and only if GA=PA′\mathbf{G}\mathbf{A} = \mathbf{P}_{\mathbf{A}'} and AG=PG′\mathbf{A}\mathbf{G} = \mathbf{P}_{\mathbf{G}'}.

Problem 20.6
?
(a)

Show that, for any m×nm \times n matrices A\mathbf{A} and B\mathbf{B} such that A′B=0\mathbf{A}'\mathbf{B} = \mathbf{0} and BA′=0\mathbf{B}\mathbf{A}' = \mathbf{0}, (A+B)+=A++B+(\mathbf{A} + \mathbf{B})^{+} = \mathbf{A}^{+} + \mathbf{B}^{+}.

(b)

Let A1,A2,…,Ak\mathbf{A}_{1}, \mathbf{A}_{2}, \ldots , \mathbf{A}_{k} represent m×nm \times n matrices such that, for j>i=1,…,k−1j > i = 1, \ldots , k-1, Ai′Aj=0\mathbf{A}_{i}'\mathbf{A}_{j} = \mathbf{0} and AjAi′=0\mathbf{A}_{j}\mathbf{A}_{i}' = \mathbf{0}. Generalize the result of Part (a) by showing that (A1+A2+⋯+Ak)+=A1++A2++⋯+Ak+(\mathbf{A}_{1} + \mathbf{A}_{2} + \cdots + \mathbf{A}_{k})^{+} = \mathbf{A}_{1}^{+} + \mathbf{A}_{2}^{+} + \cdots + \mathbf{A}_{k}^{+}.

Problem 20.7

Show that, for any m×nm \times n matrix A\mathbf{A}, (A+A)+=A+A(\mathbf{A}^{+}\mathbf{A})^{+} = \mathbf{A}^{+}\mathbf{A}, and (AA+)+=AA+(\mathbf{A}\mathbf{A}^{+})^{+} = \mathbf{A}\mathbf{A}^{+}.

?
Problem 20.8

Show that, for any n×nn \times n symmetric matrix A\mathbf{A}, AA+=A+A\mathbf{A}\mathbf{A}^{+} = \mathbf{A}^{+}\mathbf{A}.

?
Problem 20.9

Let V\mathbf{V} represent an n×nn \times n symmetric nonnegative definite matrix, X\mathbf{X} an n×pn \times p matrix, and d\mathbf{d} a p×1p \times 1 vector. Using the results of Exercises 8 and 19.11 (or otherwise), show that, for the vector X(X′X)−d\mathbf{X}(\mathbf{X}'\mathbf{X})^{-}\mathbf{d} to be a solution, for every d∈C(X′)\mathbf{d} \in C(\mathbf{X}'), to the problem of minimizing the quadratic form a′Va\mathbf{a}'\mathbf{V}\mathbf{a} (in a\mathbf{a}) subject to X′a=d\mathbf{X}'\mathbf{a} = \mathbf{d}, it is necessary and sufficient that C(V+X)⊂C(X)C(\mathbf{V}^{+}\mathbf{X}) \subset C(\mathbf{X}).

?
Problem 20.10

Let A\mathbf{A} represent an n×nn \times n matrix. Show that if A\mathbf{A} is symmetric and positive semidefinite, then A+\mathbf{A}^{+} is symmetric and positive semidefinite and that if A\mathbf{A} is symmetric and positive definite, then A+\mathbf{A}^{+} is symmetric and positive definite. Do so by taking advantage of the result that if A\mathbf{A} is symmetric and nonnegative definite (and nonnull), then A+=T+(T+)′\mathbf{A}^{+} = \mathbf{T}^{+}(\mathbf{T}^{+})' for any matrix T\mathbf{T} of full row rank (and with nn columns) such that A=T′T\mathbf{A} = \mathbf{T}'\mathbf{T}.

?
Problem 20.11

Let C\mathbf{C} represent an m×nm \times n matrix. Show that, for any m×mm \times m idempotent matrix A\mathbf{A}, (AC)+A′=(AC)+(\mathbf{A}\mathbf{C})^{+}\mathbf{A}' = (\mathbf{A}\mathbf{C})^{+} and that, for any n×nn \times n idempotent matrix B\mathbf{B}, B′(CB)+=(CB)+\mathbf{B}'(\mathbf{C}\mathbf{B})^{+} = (\mathbf{C}\mathbf{B})^{+}.

?
Problem 20.12

Let a\mathbf{a} represent an n×1n \times 1 vector of variables, and impose on a\mathbf{a} the constraint X′a=d\mathbf{X}'\mathbf{a} = \mathbf{d}, where X\mathbf{X} is an n×pn \times p matrix and d\mathbf{d} a p×1p \times 1 vector such that d∈C(X′)\mathbf{d} \in C(\mathbf{X}'). And, define f(a)=a′Va−2b′af(\mathbf{a}) = \mathbf{a}'\mathbf{V}\mathbf{a} - 2\mathbf{b}'\mathbf{a}, where V\mathbf{V} is an n×nn \times n symmetric nonnegative definite matrix and b\mathbf{b} is an n×1n \times 1 vector such that b∈C(V,X)\mathbf{b} \in C(\mathbf{V}, \mathbf{X}). Further, let R\mathbf{R} represent any matrix such that V=R′R\mathbf{V} = \mathbf{R}'\mathbf{R}, let a0\mathbf{a}_{0} represent any n×1n \times 1 vector such that X′a0=d\mathbf{X}'\mathbf{a}_{0} = \mathbf{d}, and take s\mathbf{s} to be any n×1n \times 1 vector such that b=Vs+Xt\mathbf{b} = \mathbf{V}\mathbf{s} + \mathbf{X}\mathbf{t} for some p×1p \times 1 vector t\mathbf{t}. Show that f(a)f(\mathbf{a}) attains its minimum value (under the constraint X′a=d\mathbf{X}'\mathbf{a} = \mathbf{d}) at a point a∗\mathbf{a}_{*} if and only if

a∗=a0+[R(I−PX)]+R(s−a0)+{I−[R(I−PX)]+R}(I−PX)w \mathbf{a}_{*} = \mathbf{a}_{0} + [\mathbf{R}(\mathbf{I} - \mathbf{P}_{\mathbf{X}})]^{+}\mathbf{R}(\mathbf{s} - \mathbf{a}_{0}) + \{ \mathbf{I} - [\mathbf{R}(\mathbf{I} - \mathbf{P}_{\mathbf{X}})]^{+}\mathbf{R}\} (\mathbf{I} - \mathbf{P}_{\mathbf{X}})\mathbf{w}

for some n×1n \times 1 vector w\mathbf{w}. Do so by, for instance, using the results of Exercise 11 in combination with the result that, for any n×kn \times k matrix Z\mathbf{Z} whose columns span N(X′)N(\mathbf{X}'), f(a)f(\mathbf{a}) attains its minimum value (subject to the constraint X′a=d\mathbf{X}'\mathbf{a} = \mathbf{d}) at a point a∗\mathbf{a}_{*} if and only if

a∗=a0+Z(Z′VZ)−Z′(b−Va0)+Z[I−(Z′VZ)−Z′VZ]w \mathbf{a}_{*} = \mathbf{a}_{0} + \mathbf{Z}(\mathbf{Z}'\mathbf{V}\mathbf{Z})^{-}\mathbf{Z}'(\mathbf{b} - \mathbf{V}\mathbf{a}_{0}) + \mathbf{Z}[\mathbf{I} - (\mathbf{Z}'\mathbf{V}\mathbf{Z})^{-}\mathbf{Z}'\mathbf{V}\mathbf{Z}]\mathbf{w}

for some k×1k \times 1 vector w\mathbf{w}.

?
Problem 20.13

Let A\mathbf{A} represent an n×nn \times n symmetric nonnegative definite matrix, and let B\mathbf{B} represent an n×nn \times n matrix. Suppose that B−A\mathbf{B} - \mathbf{A} is symmetric and nonnegative definite (in which case B\mathbf{B} is symmetric and nonnegative definite). Show that A+−B+\mathbf{A}^{+} - \mathbf{B}^{+} is nonnegative definite if and only if rk⁡(A)=rk⁡(B)\operatorname {rk}\left(\mathbf{A}\right) = \operatorname {rk}\left(\mathbf{B}\right). Do so by, for instance, using the results of Exercises 1 and 18.15, the result that W−1−V−1\mathbf{W}^{-1} - \mathbf{V}^{-1} is nonnegative definite for any m×mm \times m symmetric positive definite matrices W\mathbf{W} and V\mathbf{V} such that V−W\mathbf{V} - \mathbf{W} is nonnegative definite, and the result that the Moore-Penrose inverse H+\mathbf{H}^{+} of a k×kk \times k symmetric nonnegative definite matrix H\mathbf{H} equals T+(T+)′\mathbf{T}^{+}(\mathbf{T}^{+})', where T\mathbf{T} is any matrix of full row rank (and with kk columns) such that H=T′T\mathbf{H} = \mathbf{T}'\mathbf{T}.

?