Professional Documents
Culture Documents
Linear Algebra Exercise Sheet 7
Linear Algebra Exercise Sheet 7
Linear Algebra Exercise Sheet 7
Exercise sheet 7
0 0 −1 −t
Substituting this vector in the cartesian equation for U , we see that the equation is satisfied if and
only if 3r + 6s + 4t = 0. So the vectors w2 − 32 w3 , w1 − 34 w3 ∈ W form a basis of the intersection.
Second method: A cartesian equation for W , is given by computing the following determinant.
1 2 2 x
−1 −1 −2 y
det
=x+y+z+w
0 −1 1 z
0 0 −1 w
Then we just have to solve the system formed by these equation and the one for U .
Third method : (In this case it is longer than the other two). Find a basis for U , e.g.u1 =
(0, 1, −1, 0)t , u2 = (0, 0, 1, 1)t , u3 = (1, 0, 0, −2)t and consider the system arising from equating generic
linear combinations of the vectors of the two bases: x1 w1 + x2 w2 + x3 w3 = y1 u1 + y2 u2 + y3 u3 if and
only if
x1 + 2x2 + 2x3 = y3
− x − x − 2x = y
1 2 3 1
x3 − x2 = y2 − y1
− x3 = y2 − 2y3
Any solution (x0 , y 0 ) is a vector of R6 , which we wrote as two vectors of R3 since it represents
the coordinates of a vector of the intersection with respect to the basis of W (the vector x) and the
coordinates of the same vector with respect to the basis of U (y). We can use the vectors of the
intersection found with the first method to get two linearly independent solutions to the above system:
3 1 3 1 1 1
((0, 1, − ), (2, − , −1)), ((1, 0, − ), ( , − , − )).
2 2 4 2 4 3
These give a basis of U ∩ W given by the vectors v 1 = w2 − 23 w3 = 2u1 − 21 u2 − u3 and
v 2 = w1 − 34 w3 = 12 u1 − 14 u2 − 12 u3 .
b) If possible, write the vector (1, 3, −2, 2)t as a sum of a vector in U and a vector in W in two
different ways.
Solution: Since the dimension of the intersection is 2, the dimension of the sum U + W is 4, so
U + W = R4 and the union of a basis of each subspace spans R4 hence the system
is always compatible and each solution gives a way of writing (3, 2, 1, 0)t as sum of a vector in each
of the two subspaces putting the parenthesis as above. This system admits a space of solutions of
dimension two so we might pick any two of these. Another way to do the exercise is to use the fact
that the intersection is not empty. Like in the proof of Grassmann’ formula, we first find a bases of U
and W by extending a basis of the intersection e.g. v 1 , v 2 , u = (0, 1, 0, 1)t and v 1 , v 2 , w = (1, −1, 0, 0)t .
Now the vectors v 1 , v 2 , u.w form a basis of R4 and we can compute the coordinates of (3, 2, 1, 0)t over
this basis. We have
where the summands in brackets sum to a vector in U the summands out of the brackets give a vector
in W .
2 1
−1 −1
3. Given the subspaces E = Sol(2x − y − z − w = 0), F = L[
−1 , 0 ].
0 0
(a) Write cartesian equations for F .
(b) Find a basis of E ∩ F
2 1 x
−1 −1 y
Solution: a) Consider the matrix
−1
, Equate to zero the two minors containing the minor
0 z
0 0 w
(
−x−y−z =0
µ12,12 we find
−w =0
b) We now have equations for F hence we can just find the solutions to
−x−y−z =0
−w =0
2x − y − z − w = 0
0
1
So E ∩ F = L[
−1].
0
1 2
1 2
1 , 2].
4. Consider the subspace U = L[
1 3
1 1
(a) Find a system S such that U = Sol(S).
(b) Find a subspace W such that R5 = U ⊕ W .
− 2x1 + x4 + x5 = 0
Solution: a) − 2x2 + x4 + x5 = 0
− 2x3 + x4 + x5 = 0
b) We just need to find three vectors that toghether with the vectos of the basis of U form a basis of the
whole of R5 , then W will be the space spanned by these three vectors. A possible choice is given by the
vectors e1 , e2 , e3 of the canonical basis of R5 , then W = L[e1 , e2 , e3 ].
1 0 −1 0 −1
Find a basis of E ∩ F .
x − z − 2t =
2x + y − 3z − 4t = 0
S:
−y−t=0
x+z =0
s 1
−s 1
The general solution is {
−s , s ∈ R}, so E ∩ F = Sol(S) = L[1].
s 1
1 −1 1 1 3
Solution: Denote by v 1 , v 2 , v 3 the generators of U . The matrix Mat(v 1 , v 2 , v 3 ) has rank 2 hence we can
take as a basis v 1 , v 2 . The two generators of V , w1 , w2 di V are linearly independent hence a basis. In
order to find the intersection we can solve the system xv 1 + yv 2 = zw1 + tw2 . Howver if we take as a basis
of V the vectors w1 , w02 = 12 (w2 − w1 ) it is easy to see that w1 + v 1 = 2w02 , so v 1 = 2w02 − w1 ∈ U ∩ V . The
matrix Mat(w1 , w02 , v 2 ) has rank 3 3, so the dimension of U + V is 3, the intersection has dimension one
and it is generated by v 1 .
7. Given the following subspaces of R5
x + y + z + t + u = 0
U = Sol y + z + t + u = 0 V = L[(1, 1, 1, 1, 1)t , (2, 2, 2, 5, −1)t ]
z+t+u=0
Solution: Computing the determinant of the matrix formed by the four vectors, we find that for k 6= 2, −2
the rank is 4 so the vectors are linearly independent and the intersection is the trivial subspace. For k = ±2
the intersection is spanned by (0, 2, k, 1).
9. Let E, F be subspaces of R5 of dimension 3, 4 respectively. What are the possible values for the
dimension of E ∩ F ?
Solution: From Grassmann formula the dimension must be at least 2. If E ⊆ F then the dimension of
the sum is 3. This are the only possible values
10. Let v 1 , v 2 , w1 , w2 , w3 be vectors of a space V . Assume that the sets {v 1 , v 2 } {w1 , w2 , w3 } and
{v 1 , v 2 , w1 , w2 } are linearly independent. Also assume w3 + 2v 1 = v 2 . Find bases for L[v 1 , v 2 ] ∩
L[w1 , w2 , w3 ] and L[v 1 , v 2 ] + L[w1 , w2 , w3 ]
Solution: w3 = v 2 − 2v 1 spans the intersection since the other four vectors are linearly independent and
hence are a basis of the sum of the subspaces.
12. Define the minor rank of a matrix A, mrank(A) to be k if A has minor of order k with nonzero
determinant and all the minors of A of order k + 1 have zero determinant. Prove that the minor
rank is the same as the rank as defined in the course proving
(a) The minor rank of a row echelon matrix is equal to the number of pivots.
(b) Row equivalent matrices have the same minor rank.
Solution: In a row echelon matrix take the minor formed by the rows and columns in which the pivots fall.
This minor has order equal to the number of pivots and nonzero determinant since it is upper triangular
with nonzero elements (the pivots themselves) on the diagonal. Minors of higher order will have at least a
row of zeros so null determinant.
For the second part it is enough to prove the statement when the two matrices A and B differ only by a
single elementary operation. Let k = mrank(A) and let µ be a minor of A with nonzero determinant of
order k. If B is obtained from A is multiplying by a nonzero λ ∈ R a row, if the row doesn’t appear in µ,
then µ is also a minor of B and the minor rank does not change, if that row appears in µ then the minor
ν of B obtained from the same rows and columns as those of A has determinant λdet µ 6= 0, so the minor
rank does not change. Since any elementary operation is invertible, if B had a minor of order k + 1 with
nonzero determinant by the same argument also A would have one.
If B is obtained by swapping rows i and j and row i if both rows appear in µ or don’t appear in µ, again
the minor in B obtained from the same rows and columns will have nonzero determinant. If ony one of the
rows appears in µ, say row i the minor ν of B obtained from the same columns and the same rows, except
for the i-th one which is replaced by the j-th will have nonzero determinant. As before B can not have a
minor of order k + 1 with nonzero determinant since by the same argument also A would have one.
Finally, let B be obtained from A by adding to a row a multiple of another one. Since we have shown that
swapping rows does not chane the minor rank, we can assume without loss of generality that the operation
is R1 7→ R1 + λR2 . If R1 does not appear in µ µ is also a minor of B and there is nothing to prove, as
there is nothing to prove in the case both R1 , R2 appear in µ. If R1 appears in µ but R2 does not, either
the determinant of the minor of B with same rows and columns as µ is nonzero in which case we have
finished, or if it is zero it means that the row vector v = R1 + λR2 depends linearly on the other rows of
the minor µ. Denote these rows by u1 , . . . , uk1 then R1 + λR2 = the minor of B with rows R2 and all the
other rows of µ except R1