Chapter 18

Sums (and Differences) of Matrices

[33/100%]
Show
LaTeX
Problem 18.1

Let R\mathbf{R} represent an n×nn \times n matrix, S\mathbf{S} an n×mn \times m matrix, T\mathbf{T} an m×mm \times m matrix, and U\mathbf{U} an m×nm \times n matrix. Derive (for the special case where R\mathbf{R} and T\mathbf{T} are nonsingular), the formula

∣R+STU∣=∣R∣∣T+TUR−1ST∣/∣T∣. \left|\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U}\right| = \left|\mathbf{R}\right| \left|\mathbf{T} + \mathbf{T}\mathbf{U}\mathbf{R}^{-1}\mathbf{S}\mathbf{T}\right|/\left|\mathbf{T}\right|.
?
Remark.
?

Do so by making two applications of the formula

∣TUVW∣=∣WVUT∣=∣T∣∣W−VT−1U∣.(*) \begin{vmatrix} \mathbf{T} & \mathbf{U} \\ \mathbf{V} & \mathbf{W} \end{vmatrix} = \begin{vmatrix} \mathbf{W} & \mathbf{V} \\ \mathbf{U} & \mathbf{T} \end{vmatrix} = \left|\mathbf{T}\right| \left|\mathbf{W} - \mathbf{V}\mathbf{T}^{-1}\mathbf{U}\right|. \tag {*}

(in which V\mathbf{V} is an n×mn \times m matrix and W\mathbf{W} an n×nn \times n matrix and in which T\mathbf{T} is assumed to be nonsingular) to the partitioned matrix ∣R−STTUT∣\begin{vmatrix} \mathbf{R} & -\mathbf{S}\mathbf{T} \\ \mathbf{T}\mathbf{U} & \mathbf{T} \end{vmatrix} -- one with W\mathbf{W} set equal to R\mathbf{R}, and the other with T\mathbf{T} set equal to R\mathbf{R}.

Problem 18.2

Let R\mathbf{R} represent an n×nn \times n matrix, S\mathbf{S} an n×mn \times m matrix, T\mathbf{T} an m×mm \times m matrix, and U\mathbf{U} an m×nm \times n matrix. Show that if R\mathbf{R} is nonsingular, then

∣R+STU∣=∣R∣∣Im+UR−1ST∣=∣R∣∣Im+TUR−1S∣. \left|\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U}\right| = \left|\mathbf{R}\right| \left|\mathbf{I}_{m} + \mathbf{U}\mathbf{R}^{-1}\mathbf{S}\mathbf{T}\right| = \left|\mathbf{R}\right| \left|\mathbf{I}_{m} + \mathbf{T}\mathbf{U}\mathbf{R}^{-1}\mathbf{S}\right|.
?
Remark.
?

Do so by using the formula

∣R+STU∣=∣R∣∣T∣∣T−1+UR−1S∣,(*) \left|\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U}\right| = \left|\mathbf{R}\right| \left|\mathbf{T}\right| \left|\mathbf{T}^{-1} + \mathbf{U}\mathbf{R}^{-1}\mathbf{S}\right|, \tag {*}

(in which R\mathbf{R} and T\mathbf{T} are assumed to be nonsingular), or alternatively the formula ∣In+SU∣=∣Im+US∣\left|\mathbf{I}_{n} + \mathbf{S}\mathbf{U}\right| = \left|\mathbf{I}_{m} + \mathbf{U}\mathbf{S}\right| or the formula ∣R+STU∣=∣R∣∣T+TUR−1ST∣/∣T∣\left|\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U}\right| = \left|\mathbf{R}\right| \left|\mathbf{T} + \mathbf{T}\mathbf{U}\mathbf{R}^{-1}\mathbf{S}\mathbf{T}\right|/\left|\mathbf{T}\right|.

Problem 18.3

Let A\mathbf{A} represent an n×nn \times n symmetric nonnegative definite matrix. Show that if I−A\mathbf{I} - \mathbf{A} is nonnegative definite and if ∣A∣=1\left|\mathbf{A}\right| = 1, then A=I\mathbf{A} = \mathbf{I}.

?
Problem 18.4

Show that, for any n×nn \times n symmetric nonnegative definite matrix B\mathbf{B} and for any n×nn \times n symmetric matrix C\mathbf{C} such that C−B\mathbf{C} - \mathbf{B} is nonnegative definite,

∣C∣≥∣C−B∣, \left|\mathbf{C}\right| \geq \left|\mathbf{C} - \mathbf{B}\right|,

with equality holding if and only if C\mathbf{C} is singular or B=0\mathbf{B} = \mathbf{0}.

?
Problem 18.5

Let A\mathbf{A} represent a symmetric nonnegative definite matrix that has been partitioned as

A=(TUU′W), \mathbf{A} = \begin{pmatrix} \mathbf{T} & \mathbf{U} \\ \mathbf{U}' & \mathbf{W} \end{pmatrix},

where T\mathbf{T} is of dimensions m×mm \times m and W\mathbf{W} of dimensions n×nn \times n (and where U\mathbf{U} is of dimensions m×nm \times n). And, define Q=W−U′T−U\mathbf{Q} = \mathbf{W} - \mathbf{U}'\mathbf{T}^{-}\mathbf{U} (which is the Schur complement of T\mathbf{T}).

?
(a)

Using the result that the symmetry and nonnegative definiteness of A\mathbf{A} imply the nonnegative definiteness of Q\mathbf{Q} and the result of Exercise 14.33 (or otherwise), show that

∣W∣≥∣U′T−U∣, \left|\mathbf{W}\right| \geq \left|\mathbf{U}'\mathbf{T}^{-}\mathbf{U}\right|,

with equality holding if and only if W\mathbf{W} is singular or Q=0\mathbf{Q} = \mathbf{0}.

(b)

Suppose that n=mn = m and that T\mathbf{T} is nonsingular. Show that

∣W∣∣T∣≥∣U∣2, \left|\mathbf{W}\right| \left|\mathbf{T}\right| \geq \left|\mathbf{U}\right|^{2},

with equality holding if and only if W\mathbf{W} is singular or rank⁡(A)=m\operatorname {rank}(\mathbf{A}) = m.

(c)

Suppose that n=mn = m and that A\mathbf{A} is positive definite. Show that

∣W∣∣T∣>∣U∣2. \left|\mathbf{W}\right| \left|\mathbf{T}\right| > \left|\mathbf{U}\right|^{2}.
Problem 18.6

Show that, for any n×pn \times p matrix X\mathbf{X} and any symmetric positive definite matrix W\mathbf{W},

∣X′WX∣ ∣X′W−1X∣≥∣X′X∣2.(E.1) \left|\mathbf{X}'\mathbf{W}\mathbf{X}\right| \, \left|\mathbf{X}'\mathbf{W}^{-1}\mathbf{X}\right| \geq \left|\mathbf{X}'\mathbf{X}\right|^{2}. \tag {E.1}
?
Remark.
?

Begin by showing that the matrices X′X(X′WX)−X′X\mathbf{X}'\mathbf{X}(\mathbf{X}'\mathbf{W}\mathbf{X})^{-}\mathbf{X}'\mathbf{X} and X′W−1X−X′X(X′WX)−X′X\mathbf{X}'\mathbf{W}^{-1}\mathbf{X} - \mathbf{X}'\mathbf{X}(\mathbf{X}'\mathbf{W}\mathbf{X})^{-}\mathbf{X}'\mathbf{X} are symmetric and nonnegative definite.

Problem 18.7
?
(a)

Show that, for any n×nn \times n skew-symmetric matrix C\mathbf{C},

∣In+C∣≥1, \left|\mathbf{I}_{n} + \mathbf{C}\right| \geq 1,

with equality holding if and only if C=0\mathbf{C} = \mathbf{0}.

(b)

Generalize the result of Part (a) by showing that, for any n×nn \times n symmetric positive definite matrix A\mathbf{A} and any n×nn \times n skew-symmetric matrix B\mathbf{B},

∣A+B∣≥∣A∣, \left|\mathbf{A} + \mathbf{B}\right| \geq \left|\mathbf{A}\right|,

with equality holding if and only if B=0\mathbf{B} = \mathbf{0}.

Problem 18.8
?
(a)

Let R\mathbf{R} represent an n×nn \times n nonsingular matrix, and let B\mathbf{B} represent an n×nn \times n matrix of rank one. Show that R+B\mathbf{R} + \mathbf{B} is nonsingular if and only if tr⁡(R−1B)≠−1\operatorname {tr}(\mathbf{R}^{-1}\mathbf{B}) \neq -1, in which case

(R+B)−1=R−1−[1+tr⁡(R−1B)]−1R−1BR−1. (\mathbf{R} + \mathbf{B})^{-1} = \mathbf{R}^{-1} - [1 + \operatorname {tr}(\mathbf{R}^{-1}\mathbf{B})]^{-1}\mathbf{R}^{-1}\mathbf{B}\mathbf{R}^{-1}.
(b)

To what does the result of Part (a) simplify in the special case where R=In\mathbf{R} = \mathbf{I}_{n}?

Problem 18.9

Let R\mathbf{R} represent an n×nn \times n matrix, S\mathbf{S} an n×mn \times m matrix, T\mathbf{T} an m×mm \times m matrix, and U\mathbf{U} an m×nm \times n matrix. Suppose that R\mathbf{R} is nonsingular. Show

?
(a)

that R+STU\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U} is nonsingular if and only if Im+UR−1ST\mathbf{I}_{m} + \mathbf{U}\mathbf{R}^{-1}\mathbf{S}\mathbf{T} is nonsingular, in which case

(R+STU)−1=R−1−R−1ST(Im+UR−1ST)−1UR−1, (\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U})^{-1} = \mathbf{R}^{-1} - \mathbf{R}^{-1}\mathbf{S}\mathbf{T}(\mathbf{I}_{m} + \mathbf{U}\mathbf{R}^{-1}\mathbf{S}\mathbf{T})^{-1}\mathbf{U}\mathbf{R}^{-1},

and

(b)

that R+STU\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U} is nonsingular if and only if Im+TUR−1S\mathbf{I}_{m} + \mathbf{T}\mathbf{U}\mathbf{R}^{-1}\mathbf{S} is nonsingular, in which case

(R+STU)−1=R−1−R−1S(Im+TUR−1S)−1TUR−1. (\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U})^{-1} = \mathbf{R}^{-1} - \mathbf{R}^{-1}\mathbf{S}(\mathbf{I}_{m} + \mathbf{T}\mathbf{U}\mathbf{R}^{-1}\mathbf{S})^{-1}\mathbf{T}\mathbf{U}\mathbf{R}^{-1}.
Remark.
?

Do so by using the result -- applicable when T\mathbf{T} (as well as R\mathbf{R}) is nonsingular -- that R+STU\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U} is nonsingular if and only if T−1+UR−1S\mathbf{T}^{-1} + \mathbf{U}\mathbf{R}^{-1}\mathbf{S} is nonsingular, or equivalently if and only if T+TUR−1ST\mathbf{T} + \mathbf{T}\mathbf{U}\mathbf{R}^{-1}\mathbf{S}\mathbf{T} is nonsingular, in which case

(R+STU)−1=R−1−R−1S(T−1+UR−1S)−1UR−1=R−1−R−1ST(T+TUR−1ST)−1TUR−1. \begin{aligned} (\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U})^{-1} & = \mathbf{R}^{-1} - \mathbf{R}^{-1}\mathbf{S}(\mathbf{T}^{-1} + \mathbf{U}\mathbf{R}^{-1}\mathbf{S})^{-1}\mathbf{U}\mathbf{R}^{-1} \\ & = \mathbf{R}^{-1} - \mathbf{R}^{-1}\mathbf{S}\mathbf{T}(\mathbf{T} + \mathbf{T}\mathbf{U}\mathbf{R}^{-1}\mathbf{S}\mathbf{T})^{-1}\mathbf{T}\mathbf{U}\mathbf{R}^{-1}. \end{aligned}
Problem 18.10

Let R\mathbf{R} represent an n×qn \times q matrix, S\mathbf{S} an n×mn \times m matrix, T\mathbf{T} an m×pm \times p matrix, and U\mathbf{U} a p×qp \times q matrix. Extend the results of Exercise 9 by showing that if R(STU)⊂R(R)\mathcal{R}(\mathbf{S}\mathbf{T}\mathbf{U}) \subset \mathcal{R}(\mathbf{R}) and C(STU)⊂C(R)C(\mathbf{S}\mathbf{T}\mathbf{U}) \subset C(\mathbf{R}), then the matrix

R−−R−ST(Ip+UR−ST)−UR− \mathbf{R}^{-} - \mathbf{R}^{-}\mathbf{S}\mathbf{T}(\mathbf{I}_{p} + \mathbf{U}\mathbf{R}^{-}\mathbf{S}\mathbf{T})^{-}\mathbf{U}\mathbf{R}^{-}

and the matrix

R−−R−S(Im+TUR−S)−TUR− \mathbf{R}^{-} - \mathbf{R}^{-}\mathbf{S}(\mathbf{I}_{m} + \mathbf{T}\mathbf{U}\mathbf{R}^{-}\mathbf{S})^{-}\mathbf{T}\mathbf{U}\mathbf{R}^{-}

are both generalized inverses of the matrix R+STU\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U}.

?
Problem 18.11

Let R\mathbf{R} represent an n×qn \times q matrix, S\mathbf{S} an n×mn \times m matrix, T\mathbf{T} an m×pm \times p matrix, and U\mathbf{U} a p×qp \times q matrix.

?
(a)

Take G\mathbf{G} to be a generalized inverse of the partitioned matrix (R−STTUT)\begin{pmatrix} \mathbf{R} & -\mathbf{S}\mathbf{T} \\ \mathbf{T}\mathbf{U} & \mathbf{T} \end{pmatrix}, and partition G\mathbf{G} as G=(G11G12G21G22)\mathbf{G} = \begin{pmatrix} \mathbf{G}_{11} & \mathbf{G}_{12} \\ \mathbf{G}_{21} & \mathbf{G}_{22} \end{pmatrix} (where G11\mathbf{G}_{11} is of dimensions q×nq \times n). Show that G11\mathbf{G}_{11} is a generalized inverse of the matrix R+STU\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U}. Do so by using the result that, for any partitioned matrix A=(A11A12A21A22)\mathbf{A} = \begin{pmatrix} \mathbf{A}_{11} & \mathbf{A}_{12} \\ \mathbf{A}_{21} & \mathbf{A}_{22} \end{pmatrix} such that C(A21)⊂C(A22)C(\mathbf{A}_{21}) \subset C(\mathbf{A}_{22}) and R(A12)⊂R(A22)\mathcal{R}(\mathbf{A}_{12}) \subset \mathcal{R}(\mathbf{A}_{22}) and for any generalized inverse (C11C12C21C22)\begin{pmatrix} \mathbf{C}_{11} & \mathbf{C}_{12} \\ \mathbf{C}_{21} & \mathbf{C}_{22} \end{pmatrix} of A\mathbf{A} (where C11\mathbf{C}_{11} is of the same dimensions as A11′\mathbf{A}_{11}'), C11\mathbf{C}_{11} is a generalized inverse of the matrix A11−A12A22−A21\mathbf{A}_{11} - \mathbf{A}_{12}\mathbf{A}_{22}^{-}\mathbf{A}_{21}.

(b)

Let ER=I−RR−\mathbf{E}_{\mathbf{R}} = \mathbf{I} - \mathbf{R}\mathbf{R}^{-}, FR=I−R−R\mathbf{F}_{\mathbf{R}} = \mathbf{I} - \mathbf{R}^{-}\mathbf{R}, X=ERST\mathbf{X} = \mathbf{E}_{\mathbf{R}}\mathbf{S}\mathbf{T}, Y=TUFR\mathbf{Y} = \mathbf{T}\mathbf{U}\mathbf{F}_{\mathbf{R}}, EY=I−YY−\mathbf{E}_{\mathbf{Y}} = \mathbf{I} - \mathbf{Y}\mathbf{Y}^{-}, FX=I−X−X\mathbf{F}_{\mathbf{X}} = \mathbf{I} - \mathbf{X}^{-}\mathbf{X}, Q=T+TUR−ST\mathbf{Q} = \mathbf{T} + \mathbf{T}\mathbf{U}\mathbf{R}^{-}\mathbf{S}\mathbf{T}, Z=EYQFX\mathbf{Z} = \mathbf{E}_{\mathbf{Y}}\mathbf{Q}\mathbf{F}_{\mathbf{X}}, and Q∗=FXZ−EY\mathbf{Q}^{*} = \mathbf{F}_{\mathbf{X}}\mathbf{Z}^{-}\mathbf{E}_{\mathbf{Y}}. Use the result of Part (a) of Exercise 10.10 to show that the matrix

R−−R−STQ∗TUR−−R−ST(I−Q∗Q)X−ER−FRY−(I−QQ∗)TUR−+FRY−(I−QQ∗)QX−ER(E.2) \begin{aligned} & \mathbf{R}^{-} - \mathbf{R}^{-}\mathbf{S}\mathbf{T}\mathbf{Q}^{*}\mathbf{T}\mathbf{U}\mathbf{R}^{-} - \mathbf{R}^{-}\mathbf{S}\mathbf{T}(\mathbf{I} - \mathbf{Q}^{*}\mathbf{Q})\mathbf{X}^{-}\mathbf{E}_{\mathbf{R}} \\ & \qquad - \mathbf{F}_{\mathbf{R}}\mathbf{Y}^{-}(\mathbf{I} - \mathbf{Q}\mathbf{Q}^{*})\mathbf{T}\mathbf{U}\mathbf{R}^{-} + \mathbf{F}_{\mathbf{R}}\mathbf{Y}^{-}(\mathbf{I} - \mathbf{Q}\mathbf{Q}^{*})\mathbf{Q}\mathbf{X}^{-}\mathbf{E}_{\mathbf{R}} \end{aligned} \tag {E.2}

is a generalized inverse of the matrix R+STU\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U}.

(c)

Show that if R(TU)⊂R(R)\mathcal{R}(\mathbf{T}\mathbf{U}) \subset \mathcal{R}(\mathbf{R}) and C(ST)⊂C(R)C(\mathbf{S}\mathbf{T}) \subset C(\mathbf{R}), then the formula

R−−R−STQ−TUR−(*) \mathbf{R}^{-} - \mathbf{R}^{-}\mathbf{S}\mathbf{T}\mathbf{Q}^{-}\mathbf{T}\mathbf{U}\mathbf{R}^{-} \tag {*}

for a generalized inverse of R+STU\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U} can be obtained as a special case of formula (E.2).

Problem 18.12

Let A1,A2,…\mathbf{A}_{1}, \mathbf{A}_{2}, \ldots represent a sequence of m×nm \times n matrices, and let A\mathbf{A} represent another m×nm \times n matrix.

?
(a)

Using the result of Exercise 6.1 (i.e., the triangle inequality), show that if ∥Ak−A∥→0\left\| \mathbf{A}_{k} - \mathbf{A}\right\| \to 0, then ∥Ak∥→∥A∥\left\| \mathbf{A}_{k}\right\| \to \left\| \mathbf{A}\right\|.

(b)

Show that if Ak→A\mathbf{A}_{k} \to \mathbf{A}, then ∥Ak∥→∥A∥\left\| \mathbf{A}_{k}\right\| \to \left\| \mathbf{A}\right\| (where the norms are the usual norms).

Problem 18.13

Let A\mathbf{A} represent an n×nn \times n matrix. Using the results of Exercise 6.1 and of Part (b) of Exercise 12, show that if ∥A∥<1\left\| \mathbf{A}\right\| < 1, then (for k=0,1,2,…k = 0, 1, 2, \ldots)

∥(I−A)−1−(I+A+A2+⋯+Ak)∥≤∥A∥k+1/(1−∥A∥) \left\| (\mathbf{I} - \mathbf{A})^{-1} - (\mathbf{I} + \mathbf{A} + \mathbf{A}^{2} + \cdots + \mathbf{A}^{k})\right\| \leq \left\| \mathbf{A}\right\| ^{k+1}/(1 - \left\| \mathbf{A}\right\| )

(where the norms are the usual norms). (Note. If ∥A∥<1\left\| \mathbf{A}\right\| < 1, then I−A\mathbf{I} - \mathbf{A} is nonsingular.)

?
Problem 18.14

Let A\mathbf{A} and B\mathbf{B} represent n×nn \times n matrices. Suppose that B\mathbf{B} is nonsingular, and define F=B−1A\mathbf{F} = \mathbf{B}^{-1}\mathbf{A}. Using the result of Exercise 13, show that if ∥F∥<1\left\| \mathbf{F}\right\| < 1, then (for k=0,1,2,…k = 0, 1, 2, \ldots)

∥(B−A)−1−(B−1+FB−1+F2B−1+⋯+FkB−1)∥≤∥B−1∥∥F∥k+1/(1−∥F∥) \left\| (\mathbf{B} - \mathbf{A})^{-1} - (\mathbf{B}^{-1} + \mathbf{F}\mathbf{B}^{-1} + \mathbf{F}^{2}\mathbf{B}^{-1} + \cdots + \mathbf{F}^{k}\mathbf{B}^{-1})\right\| \leq \left\| \mathbf{B}^{-1}\right\| \left\| \mathbf{F}\right\| ^{k+1}/(1 - \left\| \mathbf{F}\right\| )

(where the norms are the usual norms). (Note. If ∥F∥<1\left\| \mathbf{F}\right\| < 1, then B−A\mathbf{B} - \mathbf{A} is nonsingular.)

?
Problem 18.15

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. Show that if B−A\mathbf{B} - \mathbf{A} is nonnegative definite (in which case B\mathbf{B} is also nonnegative definite), then R(A)⊂R(B)\mathcal{R}(\mathbf{A}) \subset \mathcal{R}(\mathbf{B}) and C(A)⊂C(B)C(\mathbf{A}) \subset C(\mathbf{B}).

?
Problem 18.16

Let A\mathbf{A} represent an n×nn \times n symmetric idempotent matrix, and let B\mathbf{B} represent an n×nn \times n symmetric nonnegative definite matrix. Show that if I−A−B\mathbf{I} - \mathbf{A} - \mathbf{B} is nonnegative definite, then BA=AB=0\mathbf{B}\mathbf{A} = \mathbf{A}\mathbf{B} = \mathbf{0}.

?
Remark.
?

Show that A′(I−A−B)A=−A′BA\mathbf{A}'(\mathbf{I} - \mathbf{A} - \mathbf{B})\mathbf{A} = -\mathbf{A}'\mathbf{B}\mathbf{A}, and then consider the implications of this equality.

Problem 18.17

Let A1,…,Ak\mathbf{A}_{1}, \ldots , \mathbf{A}_{k} represent n×nn \times n symmetric matrices, and define A=A1+⋯+Ak\mathbf{A} = \mathbf{A}_{1} + \cdots + \mathbf{A}_{k}. Suppose that A\mathbf{A} is idempotent. Suppose further that A1,…,Ak−1\mathbf{A}_{1}, \ldots , \mathbf{A}_{k-1} are idempotent and that Ak\mathbf{A}_{k} is nonnegative definite. Using the result of Exercise 16 (or otherwise), show that AiAj=0\mathbf{A}_{i}\mathbf{A}_{j} = \mathbf{0} (for j≠i=1,…,kj \neq i = 1, \ldots , k), that Ak\mathbf{A}_{k} is idempotent, and that rank⁡(Ak)=rank⁡(A)−∑i=1k−1rank⁡(Ai)\operatorname {rank}(\mathbf{A}_{k}) = \operatorname {rank}(\mathbf{A}) - \sum_{i=1}^{k-1} \operatorname {rank}(\mathbf{A}_{i}).

?
Problem 18.18

Let A1,…,Ak\mathbf{A}_{1}, \ldots , \mathbf{A}_{k} represent n×nn \times n symmetric matrices, and define A=A1+⋯+Ak\mathbf{A} = \mathbf{A}_{1} + \cdots + \mathbf{A}_{k}. Suppose that A\mathbf{A} is idempotent. Show that if A1,…,Ak\mathbf{A}_{1}, \ldots , \mathbf{A}_{k} are nonnegative definite and if tr⁡(A)≤∑i=1ktr⁡(Ai)\operatorname {tr}(\mathbf{A}) \leq \sum_{i=1}^{k} \operatorname {tr}(\mathbf{A}_{i}), then AiAj=0\mathbf{A}_{i}\mathbf{A}_{j} = \mathbf{0} (for j≠i=1,…,kj \neq i = 1, \ldots , k) and A1,…,Ak\mathbf{A}_{1}, \ldots , \mathbf{A}_{k} are idempotent.

?
Remark.
?

Show that ∑i,j≠itr⁡(AiAj)≤0\sum_{i, j \neq i} \operatorname {tr}(\mathbf{A}_{i}\mathbf{A}_{j}) \leq 0 and then make use of the result that, for any two symmetric nonnegative definite matrices B\mathbf{B} and C\mathbf{C} (of the same order), tr⁡(BC)≥0\operatorname {tr}(\mathbf{B}\mathbf{C}) \geq 0, with equality holding if and only if BC=0\mathbf{B}\mathbf{C} = \mathbf{0}.

Problem 18.19

Let A1,…,Ak\mathbf{A}_{1}, \ldots , \mathbf{A}_{k} represent n×nn \times n symmetric matrices such that A1+⋯+Ak=I\mathbf{A}_{1} + \cdots + \mathbf{A}_{k} = \mathbf{I}. Show that if rank⁡(A1)+⋯+rank⁡(Ak)=n\operatorname {rank}(\mathbf{A}_{1}) + \cdots + \operatorname {rank}(\mathbf{A}_{k}) = n, then, for any (strictly) positive scalars c1,…,ckc_{1}, \ldots , c_{k}, the matrix c1A1+⋯+ckAkc_{1}\mathbf{A}_{1} + \cdots + c_{k}\mathbf{A}_{k} is positive definite.

?
Problem 18.20

Let A1,…,Ak\mathbf{A}_{1}, \ldots , \mathbf{A}_{k} represent n×nn \times n symmetric idempotent matrices such that AiAj=0\mathbf{A}_{i}\mathbf{A}_{j} = \mathbf{0} for j≠i=1,…,kj \neq i = 1, \ldots , k. Show that, for any (strictly) positive scalar c0c_{0} and any nonnegative scalars c1,…,ckc_{1}, \ldots , c_{k}, the matrix c0I+∑i=1kciAic_{0}\mathbf{I} + \sum_{i=1}^{k} c_{i}\mathbf{A}_{i} is positive definite (and hence nonsingular), and

(c0I+∑i=1kciAi)−1=d0I+∑i=1kdiAi, \left(c_{0}\mathbf{I} + \sum _{i=1}^{k} c_{i}\mathbf{A}_{i}\right)^{-1} = d_{0}\mathbf{I} + \sum _{i=1}^{k} d_{i}\mathbf{A}_{i},

where d0=1/c0d_{0} = 1/c_{0} and (for i=1,…,ki = 1, \ldots , k) di=−ci/[c0(c0+ci)]d_{i} = -c_{i}/[c_{0}(c_{0}+c_{i})].

?
Problem 18.21

Let A1,…,Ak\mathbf{A}_{1}, \ldots , \mathbf{A}_{k} represent n×nn \times n symmetric idempotent matrices such that (for j≠i=1,…,kj \neq i = 1, \ldots , k) AiAj=0\mathbf{A}_{i}\mathbf{A}_{j} = \mathbf{0}, and let A\mathbf{A} represent an n×nn \times n symmetric idempotent matrix such that (for i=1,…,ki = 1, \ldots , k) C(Ai)⊂C(A)C(\mathbf{A}_{i}) \subset C(\mathbf{A}). Show that if rank⁡(A1)+⋯+rank⁡(Ak)=rank⁡(A)\operatorname {rank}(\mathbf{A}_{1}) + \cdots + \operatorname {rank}(\mathbf{A}_{k}) = \operatorname {rank}(\mathbf{A}), then A1+⋯+Ak=A\mathbf{A}_{1} + \cdots + \mathbf{A}_{k} = \mathbf{A}.

?
Problem 18.22

Let A\mathbf{A} represent an m×nm \times n matrix and B\mathbf{B} an n×mn \times m matrix. If B\mathbf{B} is a generalized inverse of A\mathbf{A}, then rank⁡(I−BA)=n−rank⁡(A)\operatorname {rank}(\mathbf{I} - \mathbf{B}\mathbf{A}) = n - \operatorname {rank}(\mathbf{A}). Show that the converse is also true; that is, show that if rank⁡(I−BA)=n−rank⁡(A)\operatorname {rank}(\mathbf{I} - \mathbf{B}\mathbf{A}) = n - \operatorname {rank}(\mathbf{A}), then B\mathbf{B} is a generalized inverse of A\mathbf{A}.

?
Problem 18.23

Let A\mathbf{A} represent the (n×nn \times n) projection matrix for a subspace U\mathcal{U} of Rn×1\mathbb {R}^{n \times 1} along a subspace V\mathcal{V} of Rn×1\mathbb {R}^{n \times 1} (where U⊕V=Rn×1\mathcal{U} \oplus \mathcal{V} = \mathbb {R}^{n \times 1}), and let B\mathbf{B} represent the (n×nn \times n) projection matrix for a subspace W\mathcal{W} of Rn×1\mathbb {R}^{n \times 1} along a subspace X\mathcal{X} of Rn×1\mathbb {R}^{n \times 1} (where W⊕X=Rn×1\mathcal{W} \oplus \mathcal{X} = \mathbb {R}^{n \times 1}).

?
(a)

Show that A+B\mathbf{A} + \mathbf{B} is the projection matrix for some subspace C\mathcal{C} of Rn×1\mathbb {R}^{n \times 1} along some subspace M\mathcal{M} of Rn×1\mathbb {R}^{n \times 1} (where C⊕M=Rn×1\mathcal{C} \oplus \mathcal{M} = \mathbb {R}^{n \times 1}) if and only if BA=AB=0\mathbf{B}\mathbf{A} = \mathbf{A}\mathbf{B} = \mathbf{0}, in which case C=U⊕W\mathcal{C} = \mathcal{U} \oplus \mathcal{W} and M=V∩X\mathcal{M} = \mathcal{V} \cap \mathcal{X}.

(b)

Show that A−B\mathbf{A} - \mathbf{B} is the projection matrix for some subspace C\mathcal{C} of Rn×1\mathbb {R}^{n \times 1} along some subspace M\mathcal{M} of Rn×1\mathbb {R}^{n \times 1} (where C⊕M=Rn×1\mathcal{C} \oplus \mathcal{M} = \mathbb {R}^{n \times 1}) if and only if BA=AB=B\mathbf{B}\mathbf{A} = \mathbf{A}\mathbf{B} = \mathbf{B}, in which case C=U∩X\mathcal{C} = \mathcal{U} \cap \mathcal{X} and M=V⊕W\mathcal{M} = \mathcal{V} \oplus \mathcal{W}.

Remark.
?

for Part (b). Observe (in light of the result that a matrix is a projection matrix for one subspace along another if and only if it is idempotent and the result that a matrix, say K\mathbf{K}, is idempotent if and only if I−K\mathbf{I} - \mathbf{K} is idempotent) that A−B\mathbf{A} - \mathbf{B} is the projection matrix for some subspace C\mathcal{C} along some subspace M\mathcal{M} if and only if I−(A−B)=(I−A)+B\mathbf{I} - (\mathbf{A} - \mathbf{B}) = (\mathbf{I} - \mathbf{A}) + \mathbf{B} is the projection matrix for some subspace C∗\mathcal{C}^{*} along some subspace M∗\mathcal{M}^{*}, and then make use of Part (a) and the result that the projection matrix for a subspace M∗\mathcal{M}^{*} along a subspace C∗\mathcal{C}^{*} (where M∗⊕C∗=Rn×1\mathcal{M}^{*} \oplus \mathcal{C}^{*} = \mathbb {R}^{n \times 1}) equals I−H\mathbf{I} - \mathbf{H}, where H\mathbf{H} is the projection matrix for C∗\mathcal{C}^{*} along M∗\mathcal{M}^{*}.

Problem 18.24
?
(a)

Let B\mathbf{B} represent an n×nn \times n symmetric matrix, and let W\mathbf{W} represent an n×nn \times n symmetric nonnegative definite matrix. Show that

WBWBW=WBW⇔(BW)3=(BW)2⇔tr⁡[(BW)2]=tr⁡[(BW)3]=tr⁡[(BW)4]. \mathbf{W}\mathbf{B}\mathbf{W}\mathbf{B}\mathbf{W} = \mathbf{W}\mathbf{B}\mathbf{W} \Leftrightarrow (\mathbf{B}\mathbf{W})^{3} = (\mathbf{B}\mathbf{W})^{2} \Leftrightarrow \operatorname {tr}[(\mathbf{B}\mathbf{W})^{2}] = \operatorname {tr}[(\mathbf{B}\mathbf{W})^{3}] = \operatorname {tr}[(\mathbf{B}\mathbf{W})^{4}].
(b)

Let A1,…,Ak\mathbf{A}_{1}, \ldots , \mathbf{A}_{k} represent n×nn \times n matrices, let V\mathbf{V} represent an n×nn \times n symmetric nonnegative definite matrix, and define A=A1+⋯+Ak\mathbf{A} = \mathbf{A}_{1} + \cdots + \mathbf{A}_{k}. If VAiVAiV=VAiV\mathbf{V}\mathbf{A}_{i}\mathbf{V}\mathbf{A}_{i}\mathbf{V} = \mathbf{V}\mathbf{A}_{i}\mathbf{V} for all ii and if VAiVAjV=0\mathbf{V}\mathbf{A}_{i}\mathbf{V}\mathbf{A}_{j}\mathbf{V} = \mathbf{0} for all ii and j≠ij \neq i, then VAVAV=VAV\mathbf{V}\mathbf{A}\mathbf{V}\mathbf{A}\mathbf{V} = \mathbf{V}\mathbf{A}\mathbf{V} and rank⁡(VA1V)+⋯+rank⁡(VAkV)=rank⁡(VAV)\operatorname {rank}(\mathbf{V}\mathbf{A}_{1}\mathbf{V}) + \cdots + \operatorname {rank}(\mathbf{V}\mathbf{A}_{k}\mathbf{V}) = \operatorname {rank}(\mathbf{V}\mathbf{A}\mathbf{V}). Conversely, if VAVAV=VAV\mathbf{V}\mathbf{A}\mathbf{V}\mathbf{A}\mathbf{V} = \mathbf{V}\mathbf{A}\mathbf{V}, then each of the following three conditions implies the other two: (1) VAiVAjV=0\mathbf{V}\mathbf{A}_{i}\mathbf{V}\mathbf{A}_{j}\mathbf{V} = \mathbf{0} (for j≠i=1,…,kj \neq i = 1, \ldots , k) and rank⁡(VAiVAiV)=rank⁡(VAiV)\operatorname {rank}(\mathbf{V}\mathbf{A}_{i}\mathbf{V}\mathbf{A}_{i}\mathbf{V}) = \operatorname {rank}(\mathbf{V}\mathbf{A}_{i}\mathbf{V}) (for i=1,…,ki = 1, \ldots , k); (2) VAiVAiV=VAiV\mathbf{V}\mathbf{A}_{i}\mathbf{V}\mathbf{A}_{i}\mathbf{V} = \mathbf{V}\mathbf{A}_{i}\mathbf{V} (for i=1,…,ki = 1, \ldots , k); (3) rank⁡(VA1V)+⋯+rank⁡(VAkV)=rank⁡(VAV)\operatorname {rank}(\mathbf{V}\mathbf{A}_{1}\mathbf{V}) + \cdots + \operatorname {rank}(\mathbf{V}\mathbf{A}_{k}\mathbf{V}) = \operatorname {rank}(\mathbf{V}\mathbf{A}\mathbf{V}). Indicate how, in the special case where A1,…,Ak\mathbf{A}_{1}, \ldots , \mathbf{A}_{k} are symmetric, the conditions VAVAV=VAV\mathbf{V}\mathbf{A}\mathbf{V}\mathbf{A}\mathbf{V} = \mathbf{V}\mathbf{A}\mathbf{V} and VAiVAiV=VAiV\mathbf{V}\mathbf{A}_{i}\mathbf{V}\mathbf{A}_{i}\mathbf{V} = \mathbf{V}\mathbf{A}_{i}\mathbf{V} can be reexpressed by applying the results of Part (a) (of the current exercise).

Problem 18.25

Let R\mathbf{R} represent an n×qn \times q matrix, S\mathbf{S} an n×mn \times m matrix, T\mathbf{T} an m×pm \times p matrix, and U\mathbf{U} a p×qp \times q matrix.

?
(a)

Show that

rank⁡(R+STU)=rank⁡(R−STTUT)−rank⁡(T).(E.3) \operatorname {rank}(\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U}) = \operatorname {rank}\begin{pmatrix} \mathbf{R} & -\mathbf{S}\mathbf{T} \\ \mathbf{T}\mathbf{U} & \mathbf{T} \end{pmatrix} - \operatorname {rank}(\mathbf{T}). \tag {E.3}
(b)

Let ER=I−RR−\mathbf{E}_{\mathbf{R}} = \mathbf{I} - \mathbf{R}\mathbf{R}^{-}, FR=I−R−R\mathbf{F}_{\mathbf{R}} = \mathbf{I} - \mathbf{R}^{-}\mathbf{R}, X=ERST\mathbf{X} = \mathbf{E}_{\mathbf{R}}\mathbf{S}\mathbf{T}, Y=TUFR\mathbf{Y} = \mathbf{T}\mathbf{U}\mathbf{F}_{\mathbf{R}}, EY=I−YY−\mathbf{E}_{\mathbf{Y}} = \mathbf{I} - \mathbf{Y}\mathbf{Y}^{-}, FX=I−X−X\mathbf{F}_{\mathbf{X}} = \mathbf{I} - \mathbf{X}^{-}\mathbf{X}, Q=T+TUR−ST\mathbf{Q} = \mathbf{T} + \mathbf{T}\mathbf{U}\mathbf{R}^{-}\mathbf{S}\mathbf{T}, and Z=EYQFX\mathbf{Z} = \mathbf{E}_{\mathbf{Y}}\mathbf{Q}\mathbf{F}_{\mathbf{X}}. Use the result of Part (b) of Exercise 10.10 to show that

rank⁡(R+STU)=rank⁡(R)+rank⁡(X)+rank⁡(Y)+rank⁡(Z)−rank⁡(T). \operatorname {rank}(\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U}) = \operatorname {rank}(\mathbf{R}) + \operatorname {rank}(\mathbf{X}) + \operatorname {rank}(\mathbf{Y}) + \operatorname {rank}(\mathbf{Z}) - \operatorname {rank}(\mathbf{T}).
Problem 18.26

Show that, for any m×nm \times n matrices A\mathbf{A} and B\mathbf{B},

rank⁡(A+B)≥∣rank⁡(A)−rank⁡(B)∣. \operatorname {rank}(\mathbf{A} + \mathbf{B}) \geq \left|\operatorname {rank}(\mathbf{A}) - \operatorname {rank}(\mathbf{B})\right|.
?
Problem 18.27

Show that, for any n×nn \times n symmetric nonnegative definite matrices A\mathbf{A} and B\mathbf{B},

C(A+B)=C(A,B),R(A+B)=R(AB), C(\mathbf{A} + \mathbf{B}) = C(\mathbf{A}, \mathbf{B}), \qquad \mathcal{R}(\mathbf{A} + \mathbf{B}) = \mathcal{R}\begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix}, rank⁡(A+B)=rank⁡(A,B)=rank⁡(AB). \operatorname {rank}(\mathbf{A} + \mathbf{B}) = \operatorname {rank}(\mathbf{A}, \mathbf{B}) = \operatorname {rank}\begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix}.
?
Problem 18.28

Let A\mathbf{A} and B\mathbf{B} represent m×nm \times n matrices.

?
(a)

Show that (1) C(A)⊂C(A+B)C(\mathbf{A}) \subset C(\mathbf{A} + \mathbf{B}) if and only if rank⁡(A,B)=rank⁡(A+B)\operatorname {rank}(\mathbf{A}, \mathbf{B}) = \operatorname {rank}(\mathbf{A} + \mathbf{B}) and (2) R(A)⊂R(A+B)\mathcal{R}(\mathbf{A}) \subset \mathcal{R}(\mathbf{A} + \mathbf{B}) if and only if rank⁡(AB)=rank⁡(A+B)\operatorname {rank}\begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix} = \operatorname {rank}(\mathbf{A} + \mathbf{B}).

(b)

Show that (1) if R(A)\mathcal{R}(\mathbf{A}) and R(B)\mathcal{R}(\mathbf{B}) are essentially disjoint, then C(A)⊂C(A+B)C(\mathbf{A}) \subset C(\mathbf{A} + \mathbf{B}) and (2) if C(A)C(\mathbf{A}) and C(B)C(\mathbf{B}) are essentially disjoint, then R(A)⊂R(A+B)\mathcal{R}(\mathbf{A}) \subset \mathcal{R}(\mathbf{A} + \mathbf{B}).

Problem 18.29

Let A\mathbf{A} and B\mathbf{B} represent m×nm \times n matrices. Show that each of the following five conditions is necessary and sufficient for rank additivity [i.e., for rank⁡(A+B)=rank⁡(A)+rank⁡(B)\operatorname {rank}(\mathbf{A} + \mathbf{B}) = \operatorname {rank}(\mathbf{A}) + \operatorname {rank}(\mathbf{B})]:

?
(a)

rank⁡(A,B)=rank⁡(AB)=rank⁡(A)+rank⁡(B)\operatorname {rank}(\mathbf{A}, \mathbf{B}) = \operatorname {rank}\begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix} = \operatorname {rank}(\mathbf{A}) + \operatorname {rank}(\mathbf{B});

(b)

rank⁡(A)=rank⁡[A(I−B−B)]=rank⁡[(I−BB−)A]\operatorname {rank}(\mathbf{A}) = \operatorname {rank}[\mathbf{A}(\mathbf{I} - \mathbf{B}^{-}\mathbf{B})] = \operatorname {rank}[(\mathbf{I} - \mathbf{B}\mathbf{B}^{-})\mathbf{A}];

(c)

rank⁡(B)=rank⁡[B(I−A−A)]=rank⁡[(I−AA−)B]\operatorname {rank}(\mathbf{B}) = \operatorname {rank}[\mathbf{B}(\mathbf{I} - \mathbf{A}^{-}\mathbf{A})] = \operatorname {rank}[(\mathbf{I} - \mathbf{A}\mathbf{A}^{-})\mathbf{B}];

(d)

rank⁡(A)=rank⁡[A(I−B−B)]\operatorname {rank}(\mathbf{A}) = \operatorname {rank}[\mathbf{A}(\mathbf{I} - \mathbf{B}^{-}\mathbf{B})] and rank⁡(B)=rank⁡[(I−AA−)B]\operatorname {rank}(\mathbf{B}) = \operatorname {rank}[(\mathbf{I} - \mathbf{A}\mathbf{A}^{-})\mathbf{B}];

(e)

rank⁡(A)=rank⁡[(I−BB−)A]\operatorname {rank}(\mathbf{A}) = \operatorname {rank}[(\mathbf{I} - \mathbf{B}\mathbf{B}^{-})\mathbf{A}] and rank⁡(B)=rank⁡[B(I−A−A)]\operatorname {rank}(\mathbf{B}) = \operatorname {rank}[\mathbf{B}(\mathbf{I} - \mathbf{A}^{-}\mathbf{A})].

Problem 18.30

Let A\mathbf{A} and B\mathbf{B} represent m×nm \times n matrices. And, let

H=[I−(AB)(AB)−](A00−B)[I−(A,B)−(A,B)]. \mathbf{H} = \left[\mathbf{I} - \begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix}\begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix}^{-}\right] \begin{pmatrix} \mathbf{A} & \mathbf{0} \\ \mathbf{0} & -\mathbf{B} \end{pmatrix} [\mathbf{I} - (\mathbf{A}, \mathbf{B})^{-}(\mathbf{A}, \mathbf{B})].
?
(a)

Show that

rank⁡(A−B)=rank⁡(A)−rank⁡(B)+[rank⁡(A,B)−rank⁡(A)]+[rank⁡(AB)−rank⁡(A)]+rank⁡(H). \begin{aligned} \operatorname {rank}(\mathbf{A} - \mathbf{B}) & = \operatorname {rank}(\mathbf{A}) - \operatorname {rank}(\mathbf{B}) + [\operatorname {rank}(\mathbf{A}, \mathbf{B}) - \operatorname {rank}(\mathbf{A})] \\ & \qquad + \left[\operatorname {rank}\begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix} - \operatorname {rank}(\mathbf{A})\right] + \operatorname {rank}(\mathbf{H}). \end{aligned}
(b)

Show that A\mathbf{A} and B\mathbf{B} are rank subtractive [in the sense that rank⁡(A−B)=rank⁡(A)−rank⁡(B)\operatorname {rank}(\mathbf{A} - \mathbf{B}) = \operatorname {rank}(\mathbf{A}) - \operatorname {rank}(\mathbf{B})] if and only if rank⁡(A,B)=rank⁡(AB)=rank⁡(A)\operatorname {rank}(\mathbf{A}, \mathbf{B}) = \operatorname {rank}\begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix} = \operatorname {rank}(\mathbf{A}) and H=0\mathbf{H} = \mathbf{0}.

(c)

Show that if rank⁡(A,B)=rank⁡(AB)=rank⁡(A)\operatorname {rank}(\mathbf{A}, \mathbf{B}) = \operatorname {rank}\begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix} = \operatorname {rank}(\mathbf{A}), then (1) (A−,0)(\mathbf{A}^{-}, \mathbf{0}) and (A−0)\begin{pmatrix} \mathbf{A}^{-} \\ \mathbf{0} \end{pmatrix} are generalized inverses of (AB)\begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix} and (A,B)(\mathbf{A}, \mathbf{B}), respectively, and (2) for (AB)−=(A−,0)\begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix}^{-} = (\mathbf{A}^{-}, \mathbf{0}) and (A,B)−=(A−0)(\mathbf{A}, \mathbf{B})^{-} = \begin{pmatrix} \mathbf{A}^{-} \\ \mathbf{0} \end{pmatrix}, H=(000BA−B−B)\mathbf{H} = \begin{pmatrix} \mathbf{0} & \mathbf{0} \\ \mathbf{0} & \mathbf{B}\mathbf{A}^{-}\mathbf{B} - \mathbf{B} \end{pmatrix}.

(d)

Show that each of the following three conditions is necessary and sufficient for rank subtractivity [i.e., for rank⁡(A−B)=rank⁡(A)−rank⁡(B)\operatorname {rank}(\mathbf{A} - \mathbf{B}) = \operatorname {rank}(\mathbf{A}) - \operatorname {rank}(\mathbf{B})]:

  1. rank⁡(A,B)=rank⁡(AB)=rank⁡(A)\operatorname {rank}(\mathbf{A}, \mathbf{B}) = \operatorname {rank}\begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix} = \operatorname {rank}(\mathbf{A}) and BA−B=B\mathbf{B}\mathbf{A}^{-}\mathbf{B} = \mathbf{B};

  2. C(B)⊂C(A)C(\mathbf{B}) \subset C(\mathbf{A}), R(B)⊂R(A)\mathcal{R}(\mathbf{B}) \subset \mathcal{R}(\mathbf{A}), and BA−B=B\mathbf{B}\mathbf{A}^{-}\mathbf{B} = \mathbf{B};

  3. AA−B=BA−A=BA−B=B\mathbf{A}\mathbf{A}^{-}\mathbf{B} = \mathbf{B}\mathbf{A}^{-}\mathbf{A} = \mathbf{B}\mathbf{A}^{-}\mathbf{B} = \mathbf{B}.

(e)

Using the result of Exercise 29 (or otherwise), show that rank⁡(A−B)=rank⁡(A)−rank⁡(B)\operatorname {rank}(\mathbf{A} - \mathbf{B}) = \operatorname {rank}(\mathbf{A}) - \operatorname {rank}(\mathbf{B}) if and only if rank⁡(A−B)=rank⁡[A(I−B−B)]=rank⁡[(I−BB−)A]\operatorname {rank}(\mathbf{A} - \mathbf{B}) = \operatorname {rank}[\mathbf{A}(\mathbf{I} - \mathbf{B}^{-}\mathbf{B})] = \operatorname {rank}[(\mathbf{I} - \mathbf{B}\mathbf{B}^{-})\mathbf{A}].

Remark.
?

Do so by applying (with −B-\mathbf{B} in place of B\mathbf{B}) the formula

rank⁡(A+B)=rank⁡(A,B)+rank⁡(AB)−rank⁡(A)−rank⁡(B)+rank⁡(K),(*) \operatorname {rank}(\mathbf{A} + \mathbf{B}) = \operatorname {rank}(\mathbf{A}, \mathbf{B}) + \operatorname {rank}\begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix} - \operatorname {rank}(\mathbf{A}) - \operatorname {rank}(\mathbf{B}) + \operatorname {rank}(\mathbf{K}), \tag {*}

where

K=[I−(AB)(AB)−](A00B)[I−(A,B)−(A,B)]. \mathbf{K} = \left[\mathbf{I} - \begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix}\begin{pmatrix} \mathbf{A} \\ \mathbf{B} \end{pmatrix}^{-}\right] \begin{pmatrix} \mathbf{A} & \mathbf{0} \\ \mathbf{0} & \mathbf{B} \end{pmatrix} [\mathbf{I} - (\mathbf{A}, \mathbf{B})^{-}(\mathbf{A}, \mathbf{B})].
Problem 18.31

Let A1,…,Ak\mathbf{A}_{1}, \ldots , \mathbf{A}_{k} represent m×nm \times n matrices. Adopting the terminology of Exercise 17.6, use Part (a) of that exercise to show that if R(A1),…,R(Ak)\mathcal{R}(\mathbf{A}_{1}), \ldots , \mathcal{R}(\mathbf{A}_{k}) are independent and C(A1),…,C(Ak)C(\mathbf{A}_{1}), \ldots , C(\mathbf{A}_{k}) are independent, then rank⁡(A1+⋯+Ak)=rank⁡(A1)+⋯+rank⁡(Ak)\operatorname {rank}(\mathbf{A}_{1} + \cdots + \mathbf{A}_{k}) = \operatorname {rank}(\mathbf{A}_{1}) + \cdots + \operatorname {rank}(\mathbf{A}_{k}).

?
Problem 18.32

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}. Further, let ET=I−TT−\mathbf{E}_{\mathbf{T}} = \mathbf{I} - \mathbf{T}\mathbf{T}^{-}, FT=I−T−T\mathbf{F}_{\mathbf{T}} = \mathbf{I} - \mathbf{T}^{-}\mathbf{T}, X=ETU\mathbf{X} = \mathbf{E}_{\mathbf{T}}\mathbf{U}, and Y=VFT\mathbf{Y} = \mathbf{V}\mathbf{F}_{\mathbf{T}}.

?
(a)

Show that

rank⁡(TUVW)=rank⁡(T)+rank⁡(0XYQ).(E.4) \operatorname {rank}\begin{pmatrix} \mathbf{T} & \mathbf{U} \\ \mathbf{V} & \mathbf{W} \end{pmatrix} = \operatorname {rank}(\mathbf{T}) + \operatorname {rank}\begin{pmatrix} \mathbf{0} & \mathbf{X} \\ \mathbf{Y} & \mathbf{Q} \end{pmatrix}. \tag {E.4}
(b)

Show that

rank⁡(0VUT)=rank⁡(T)+rank⁡(−VT−UYX0). \operatorname {rank}\begin{pmatrix} \mathbf{0} & \mathbf{V} \\ \mathbf{U} & \mathbf{T} \end{pmatrix} = \operatorname {rank}(\mathbf{T}) + \operatorname {rank}\begin{pmatrix} -\mathbf{V}\mathbf{T}^{-}\mathbf{U} & \mathbf{Y} \\ \mathbf{X} & \mathbf{0} \end{pmatrix}.
(c)

Show that

rank⁡(0VUT)=rank⁡(T)+rank⁡(X)+rank⁡(Y)+rank⁡(EYVT−UFX), \operatorname {rank}\begin{pmatrix} \mathbf{0} & \mathbf{V} \\ \mathbf{U} & \mathbf{T} \end{pmatrix} = \operatorname {rank}(\mathbf{T}) + \operatorname {rank}(\mathbf{X}) + \operatorname {rank}(\mathbf{Y}) + \operatorname {rank}(\mathbf{E}_{\mathbf{Y}}\mathbf{V}\mathbf{T}^{-}\mathbf{U}\mathbf{F}_{\mathbf{X}}),

where EY=I−YY−\mathbf{E}_{\mathbf{Y}} = \mathbf{I} - \mathbf{Y}\mathbf{Y}^{-} and FX=I−X−X\mathbf{F}_{\mathbf{X}} = \mathbf{I} - \mathbf{X}^{-}\mathbf{X}.

(d)

Show that

rank⁡(TUVW)=rank⁡(T)+rank⁡(Q)+rank⁡(A)+rank⁡(B)+rank⁡[(I−AA−)XQ−Y(I−B−B)], \begin{aligned} \operatorname {rank}\begin{pmatrix} \mathbf{T} & \mathbf{U} \\ \mathbf{V} & \mathbf{W} \end{pmatrix} & = \operatorname {rank}(\mathbf{T}) + \operatorname {rank}(\mathbf{Q}) + \operatorname {rank}(\mathbf{A}) + \operatorname {rank}(\mathbf{B}) \\ & \qquad + \operatorname {rank}[(\mathbf{I} - \mathbf{A}\mathbf{A}^{-})\mathbf{X}\mathbf{Q}^{-}\mathbf{Y}(\mathbf{I} - \mathbf{B}^{-}\mathbf{B})], \end{aligned}

where A=X(I−Q−Q)\mathbf{A} = \mathbf{X}(\mathbf{I} - \mathbf{Q}^{-}\mathbf{Q}) and B=(I−QQ−)Y\mathbf{B} = (\mathbf{I} - \mathbf{Q}\mathbf{Q}^{-})\mathbf{Y}.

Remark.
?

for Part (b). Observe that (since the rank of a matrix is not affected by a permutation of rows or columns) rank⁡(0VUT)=rank⁡(TUV0)\operatorname {rank}\begin{pmatrix} \mathbf{0} & \mathbf{V} \\ \mathbf{U} & \mathbf{T} \end{pmatrix} = \operatorname {rank}\begin{pmatrix} \mathbf{T} & \mathbf{U} \\ \mathbf{V} & \mathbf{0} \end{pmatrix}, and make use of Part (a).

for Part (c). Use Part (b) in combination with the result that, for any r×sr \times s matrix A\mathbf{A}, r×vr \times v matrix B\mathbf{B}, and u×su \times s matrix C\mathbf{C},

rank⁡(ABC0)=rank⁡(B)+rank⁡(C)+rank⁡[(I−BB−)A(I−C−C)].(*) \operatorname {rank}\begin{pmatrix} \mathbf{A} & \mathbf{B} \\ \mathbf{C} & \mathbf{0} \end{pmatrix} = \operatorname {rank}(\mathbf{B}) + \operatorname {rank}(\mathbf{C}) + \operatorname {rank}[(\mathbf{I} - \mathbf{B}\mathbf{B}^{-})\mathbf{A}(\mathbf{I} - \mathbf{C}^{-}\mathbf{C})]. \tag {*}

for Part (d). Use Part (c) in combination with Part (a).

Problem 18.33

Let R\mathbf{R} represent an n×qn \times q matrix, S\mathbf{S} an n×mn \times m matrix, T\mathbf{T} an m×pm \times p matrix, and U\mathbf{U} a p×qp \times q matrix, and define Q=T+TUR−ST\mathbf{Q} = \mathbf{T} + \mathbf{T}\mathbf{U}\mathbf{R}^{-}\mathbf{S}\mathbf{T}. Further, let ER=I−RR−\mathbf{E}_{\mathbf{R}} = \mathbf{I} - \mathbf{R}\mathbf{R}^{-}, FR=I−R−R\mathbf{F}_{\mathbf{R}} = \mathbf{I} - \mathbf{R}^{-}\mathbf{R}, X=ERST\mathbf{X} = \mathbf{E}_{\mathbf{R}}\mathbf{S}\mathbf{T}, Y=TUFR\mathbf{Y} = \mathbf{T}\mathbf{U}\mathbf{F}_{\mathbf{R}}, A=X(I−Q−Q)\mathbf{A} = \mathbf{X}(\mathbf{I} - \mathbf{Q}^{-}\mathbf{Q}), B=(I−QQ−)Y\mathbf{B} = (\mathbf{I} - \mathbf{Q}\mathbf{Q}^{-})\mathbf{Y}. Use the result of Part (d) of Exercise 32 in combination with the result of Part (a) of Exercise 25 to show that

rank⁡(R+STU)=rank⁡(R)+rank⁡(Q)−rank⁡(T)+rank⁡(A)+rank⁡(B)+rank⁡[(I−AA−)XQ−Y(I−B−B)]. \begin{aligned} \operatorname {rank}(\mathbf{R} + \mathbf{S}\mathbf{T}\mathbf{U}) & = \operatorname {rank}(\mathbf{R}) + \operatorname {rank}(\mathbf{Q}) \\ & \qquad - \operatorname {rank}(\mathbf{T}) + \operatorname {rank}(\mathbf{A}) + \operatorname {rank}(\mathbf{B}) \\ & \qquad + \operatorname {rank}[(\mathbf{I} - \mathbf{A}\mathbf{A}^{-})\mathbf{X}\mathbf{Q}^{-}\mathbf{Y}(\mathbf{I} - \mathbf{B}^{-}\mathbf{B})]. \end{aligned}
?