Intersections and Sums of Subspaces
[21/100%]Let and represent subspaces of .
Show that .
Show that is the smallest subspace (of ) that contains , or, equivalently [in light of Part (a)], show that, for any subspace such that , .
Let and . Find
a basis for ,
a basis for , and
a vector in that is not in .
Let , , and represent subspaces of a linear space of matrices, and let represent an arbitrary matrix in .
Show (1) that if and , then , and (2) that if and , then .
Show (1) that and (2) that .
Let , , and represent subspaces of a linear space of matrices.
Show that .
Show (via an example) that and does not necessarily imply that .
Show that if , then (1) and (2) .
Let represent subspaces of . Show that if, for , is spanned by a (finite nonempty) set of () matrices , then
Let represent subspaces of . The subspaces are said to be independent if, for matrices , the only solution to the matrix equation
is .
Show that are independent if and only if, for , and are essentially disjoint.
Show that are independent if and only if, for , and are essentially disjoint.
Use the results of Exercise 3 [along with Part (a) or (b)] to show that if are (pairwise) orthogonal, then they are independent.
Assuming that are of dimension one or more and letting represent any linearly independent set of matrices in (), show that if are independent, then the combined set is linearly independent.
Assuming that are of dimension one or more, show that are independent if and only if, for every nonnull matrix in , every nonnull matrix in , , and every nonnull matrix in , are linearly independent.
For , let , and let represent a basis for (). Define to be the set of matrices obtained by combining all of the matrices in into a single set. Use the result of Exercise 5 [along with Part (d)] to show that (1) if are independent, then is a basis for ; and (2) if are not independent, then contains a proper subset that is a basis for .
Show that (1) if are independent, then
and (2) if are not independent, then
Let represent matrices having the same number of rows, and let represent matrices having the same number of columns. Adopting the terminology of Exercise 6, use Part (g) of that exercise to show
that if are independent, then
and if are not independent, then
and
that if are independent, then
and if are not independent, then
Letting represent an matrix and an matrix, show, by for instance using the result of Part (c)-(2) of Exercise 4 in combination with the result
that
and
.
Let and , where is an matrix, an matrix, and an matrix, and suppose that is of full row rank. Show that and are essentially disjoint [even if and are not essentially disjoint].
To what extent does the formula
[where is an matrix, an matrix, and an matrix] simplify in
the special case where and are essentially disjoint [but and are not necessarily essentially disjoint] and
the special case where and are essentially disjoint.
Let represent an matrix, an matrix, and an matrix. Further, define , , , and . Show
that the partitioned matrix is a generalized inverse of the partitioned matrix and
that the partitioned matrix is a generalized inverse of the partitioned matrix .
Do so by applying formula (E.1) from Part (a) of Exercise 10.10 to the partitioned matrices and and by making use of the result that for any generalized inverse of the partitioned matrix and any generalized inverse of the partitioned matrix (where is an matrix, an matrix, and a matrix and where has rows and columns), (1) is a generalized inverse of and a generalized inverse of if and only if and are essentially disjoint, and, similarly, (2) is a generalized inverse of and a generalized inverse of if and only if and are essentially disjoint.
Let represent an matrix, an matrix, and an matrix. And, let (where is of dimensions ) represent a generalized inverse of the partitioned matrix . Show that
if is a generalized inverse of and a generalized inverse of , then and are essentially disjoint, and
if is a generalized inverse of and a generalized inverse of , then and are essentially disjoint.
Generalize the result that, for any two subspaces and of ,
Do so by showing that, for any subspaces ,
Generalize the result that, for any matrix , matrix , and matrix ,
Do so by showing that, for any matrices having the same number of rows,
and, for any matrices having the same number of columns,
Show that, for any matrix , matrix , and matrix ,
Apply the equality
to the product , and make use of the equality
Show that if an matrix is the projection matrix for a subspace of along a subspace of (where ), then is the projection matrix for along [where and are the orthogonal complements (with respect to the usual inner product and relative to ) of and , respectively].
Show that, for any matrix , is the projection matrix for along .
Let represent a matrix in a linear space of matrices, and let represent subspaces of . Adopting the terminology and using the results of Exercise 6, show that if are independent and if , then
there exist unique matrices in , respectively, such that and
for , equals the projection of on along .
Let and represent essentially disjoint subspaces (of ) whose sum is , and let represent any matrix such that and any matrix such that .
Show that the partitioned matrix has a right inverse.
Taking to be an arbitrary right inverse of and partitioning as (where has rows), show that the projection matrix for along equals and that the projection matrix for along equals .
Let represent the () projection matrix for a subspace of along a subspace of (where ), let represent the () projection matrix for a subspace of along a subspace of (where ), and suppose that and commute (i.e., that ).
Show that is the projection matrix for along .
Show that is the projection matrix for along .
for Part (b). Observe that , and make use of Part (a).
Let represent a linear space of -dimensional column vectors, and let and represent essentially disjoint subspaces whose sum is . Then, an matrix is said to be a projection matrix for along if is the projection of on along for every -- this represents an extension of the definition of a projection matrix for along in the special case where . Further, let represent an matrix such that , and let represent an matrix such that .
Show that an matrix is a projection matrix for along if and only if and or, equivalently, if and only if is a solution to the linear system (in an matrix ).
Establish the existence of a projection matrix for along .
Show that if is a projection matrix for along , then is a projection matrix for along .
Let represent any matrix whose columns span or, equivalently, . Show that an matrix is a projection matrix for along if and only if for some solution to the linear system (in a matrix ).
Let represent independent subspaces of such that (where the independence of subspaces is as defined in Exercise 6). Further, letting (and supposing that ), take to be any matrix such that (). And, define , partition as (where, for , has rows), and let or (more generally) let represent any matrix of the form
where are symmetric positive definite matrices.
Using the result of Part (g)-(1) of Exercise 6 (or otherwise), verify that the partitioned matrix is nonsingular (i.e., is square and of rank ).
Show that is positive definite.
Show that (for ) and are orthogonal with respect to .
Using the result of Part (a)-(2) of Exercise 3 (or otherwise), show that, for , (1) equals the orthogonal complement of (where the orthogonality in the orthogonal complement is with respect to the bilinear form ) and (2) the projection of any vector on along equals the orthogonal projection of on with respect to .
Show that if, for , and are orthogonal with respect to some symmetric positive definite matrix , then is expressible in the form (E.3).