Sums (and Differences) of Matrices
[33/100%]Let represent an matrix, an matrix, an matrix, and an matrix. Derive (for the special case where and are nonsingular), the formula
Do so by making two applications of the formula
(in which is an matrix and an matrix and in which is assumed to be nonsingular) to the partitioned matrix -- one with set equal to , and the other with set equal to .
Let represent an matrix, an matrix, an matrix, and an matrix. Show that if is nonsingular, then
Do so by using the formula
(in which and are assumed to be nonsingular), or alternatively the formula or the formula .
Let represent an symmetric nonnegative definite matrix. Show that if is nonnegative definite and if , then .
Show that, for any symmetric nonnegative definite matrix and for any symmetric matrix such that is nonnegative definite,
with equality holding if and only if is singular or .
Let represent a symmetric nonnegative definite matrix that has been partitioned as
where is of dimensions and of dimensions (and where is of dimensions ). And, define (which is the Schur complement of ).
Using the result that the symmetry and nonnegative definiteness of imply the nonnegative definiteness of and the result of Exercise 14.33 (or otherwise), show that
with equality holding if and only if is singular or .
Suppose that and that is nonsingular. Show that
with equality holding if and only if is singular or .
Suppose that and that is positive definite. Show that
Show that, for any matrix and any symmetric positive definite matrix ,
Begin by showing that the matrices and are symmetric and nonnegative definite.
Show that, for any skew-symmetric matrix ,
with equality holding if and only if .
Generalize the result of Part (a) by showing that, for any symmetric positive definite matrix and any skew-symmetric matrix ,
with equality holding if and only if .
Let represent an nonsingular matrix, and let represent an matrix of rank one. Show that is nonsingular if and only if , in which case
To what does the result of Part (a) simplify in the special case where ?
Let represent an matrix, an matrix, an matrix, and an matrix. Suppose that is nonsingular. Show
that is nonsingular if and only if is nonsingular, in which case
and
that is nonsingular if and only if is nonsingular, in which case
Do so by using the result -- applicable when (as well as ) is nonsingular -- that is nonsingular if and only if is nonsingular, or equivalently if and only if is nonsingular, in which case
Let represent an matrix, an matrix, an matrix, and a matrix. Extend the results of Exercise 9 by showing that if and , then the matrix
and the matrix
are both generalized inverses of the matrix .
Let represent an matrix, an matrix, an matrix, and a matrix.
Take to be a generalized inverse of the partitioned matrix , and partition as (where is of dimensions ). Show that is a generalized inverse of the matrix . Do so by using the result that, for any partitioned matrix such that and and for any generalized inverse of (where is of the same dimensions as ), is a generalized inverse of the matrix .
Let , , , , , , , , and . Use the result of Part (a) of Exercise 10.10 to show that the matrix
is a generalized inverse of the matrix .
Show that if and , then the formula
for a generalized inverse of can be obtained as a special case of formula (E.2).
Let represent a sequence of matrices, and let represent another matrix.
Using the result of Exercise 6.1 (i.e., the triangle inequality), show that if , then .
Show that if , then (where the norms are the usual norms).
Let represent an matrix. Using the results of Exercise 6.1 and of Part (b) of Exercise 12, show that if , then (for )
(where the norms are the usual norms). (Note. If , then is nonsingular.)
Let and represent matrices. Suppose that is nonsingular, and define . Using the result of Exercise 13, show that if , then (for )
(where the norms are the usual norms). (Note. If , then is nonsingular.)
Let represent an symmetric nonnegative definite matrix, and let represent an matrix. Show that if is nonnegative definite (in which case is also nonnegative definite), then and .
Let represent an symmetric idempotent matrix, and let represent an symmetric nonnegative definite matrix. Show that if is nonnegative definite, then .
Show that , and then consider the implications of this equality.
Let represent symmetric matrices, and define . Suppose that is idempotent. Suppose further that are idempotent and that is nonnegative definite. Using the result of Exercise 16 (or otherwise), show that (for ), that is idempotent, and that .
Let represent symmetric matrices, and define . Suppose that is idempotent. Show that if are nonnegative definite and if , then (for ) and are idempotent.
Show that and then make use of the result that, for any two symmetric nonnegative definite matrices and (of the same order), , with equality holding if and only if .
Let represent symmetric matrices such that . Show that if , then, for any (strictly) positive scalars , the matrix is positive definite.
Let represent symmetric idempotent matrices such that for . Show that, for any (strictly) positive scalar and any nonnegative scalars , the matrix is positive definite (and hence nonsingular), and
where and (for ) .
Let represent symmetric idempotent matrices such that (for ) , and let represent an symmetric idempotent matrix such that (for ) . Show that if , then .
Let represent an matrix and an matrix. If is a generalized inverse of , then . Show that the converse is also true; that is, show that if , then is a generalized inverse of .
Let represent the () projection matrix for a subspace of along a subspace of (where ), and let represent the () projection matrix for a subspace of along a subspace of (where ).
Show that is the projection matrix for some subspace of along some subspace of (where ) if and only if , in which case and .
Show that is the projection matrix for some subspace of along some subspace of (where ) if and only if , in which case and .
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 , is idempotent if and only if is idempotent) that is the projection matrix for some subspace along some subspace if and only if is the projection matrix for some subspace along some subspace , and then make use of Part (a) and the result that the projection matrix for a subspace along a subspace (where ) equals , where is the projection matrix for along .
Let represent an symmetric matrix, and let represent an symmetric nonnegative definite matrix. Show that
Let represent matrices, let represent an symmetric nonnegative definite matrix, and define . If for all and if for all and , then and . Conversely, if , then each of the following three conditions implies the other two: (1) (for ) and (for ); (2) (for ); (3) . Indicate how, in the special case where are symmetric, the conditions and can be reexpressed by applying the results of Part (a) (of the current exercise).
Let represent an matrix, an matrix, an matrix, and a matrix.
Show that
Let , , , , , , , and . Use the result of Part (b) of Exercise 10.10 to show that
Show that, for any matrices and ,
Show that, for any symmetric nonnegative definite matrices and ,
Let and represent matrices.
Show that (1) if and only if and (2) if and only if .
Show that (1) if and are essentially disjoint, then and (2) if and are essentially disjoint, then .
Let and represent matrices. Show that each of the following five conditions is necessary and sufficient for rank additivity [i.e., for ]:
;
;
;
and ;
and .
Let and represent matrices. And, let
Show that
Show that and are rank subtractive [in the sense that ] if and only if and .
Show that if , then (1) and are generalized inverses of and , respectively, and (2) for and , .
Show that each of the following three conditions is necessary and sufficient for rank subtractivity [i.e., for ]:
-
and ;
-
, , and ;
-
.
Using the result of Exercise 29 (or otherwise), show that if and only if .
Do so by applying (with in place of ) the formula
where
Let represent matrices. Adopting the terminology of Exercise 17.6, use Part (a) of that exercise to show that if are independent and are independent, then .
Let represent an matrix, an matrix, an matrix, and an matrix, and define . Further, let , , , and .
Show that
Show that
Show that
where and .
Show that
where and .
for Part (b). Observe that (since the rank of a matrix is not affected by a permutation of rows or columns) , and make use of Part (a).
for Part (c). Use Part (b) in combination with the result that, for any matrix , matrix , and matrix ,
for Part (d). Use Part (c) in combination with Part (a).
Let represent an matrix, an matrix, an matrix, and a matrix, and define . Further, let , , , , , . Use the result of Part (d) of Exercise 32 in combination with the result of Part (a) of Exercise 25 to show that