Assignment 9 Solutions

Section 5.2

Since 0 = (0, 0, ,0) has first component 0, the zero vector is also in S.
Therefore, S is a subspace of Rm.
6. S is the set of all vectors of the form (x, y, -x y) (since z = -x y).
Thus, we can write an arbitrary vector in S as x (1, 0, -1) + y (0, 1, -1).
Therefore, S = Span {(1, 0, -1), (0, 1, -1)}. By the theorem that states
that all spans are subspaces, we have shown that S is a subspace of R3.

Or, we can check the subspace properties directly, as follows:

First note that the zero vector is in S, since 0 + 0 + 0 = 0.

14. The set spans R3 iff the matrix A formed by the vectors has rank 3.
Since A is 3 3, we can check this using the determinant. Det A = -3,
which is nonzero. Therefore, rank A = 3, so the set does span R3.
16. The set spans R3 iff the matrix A formed by the vectors has rank 3.
Performing elementary row operations to transform the 3 4 matrix A
into REF leaves us with 3 leading entries. Hence, rank A = 3, so the set
does span R3.

Alternately, after finding the solution space, we can check whether or

not the set spans S by checking that the matrix with columns (1, 1, 0)
and (-2, 0, 1) augmented with column (s-2t, s, t) is consistent for all
values of s and t.

Section 5.3

Alternately, we could row reduce to REF and check for linear

independence by showing that there is a leading entry in every column.
4. The set is linearly independent, so we must check whether it spans S.
This will be true iff the matrix with columns (1, 1, 0) and (1, 1, 1),
augmented with (x, x + z, z) is consistent for all x and z (since y = x +
z). Performing row operations, we find that this system can be
inconsistent; hence the set does not span S.

Alternately, we may observe that (1, 1, 1) is not in S. Hence, it cannot

be a basis for S, since a basis for S must contain vectors in S.
6. The set contains a zero vector. Thus, it is linearly dependent and so
cannot be a basis for any space. In particular, it is not a basis for S.
Alternately, you can also show that the set does not span S by showing
that the associated augmented matrix can be inconsistent.

Note that you may check spanning by checking consistency of the associate
augmented matrix.