Problem 1
Decide if each is a basis for
.
- Answer
By Theorem 1.12, each is a basis if and only if each vector in the space can be given in a unique way as a linear combination of the given vectors.
- Yes this is a basis. The relation
,
, and
.
- This is not a basis. Setting it up as in the prior item
,
, and
satisfy
. For instance, we can find the coefficients
and
that work when
,
, and
. However, there are no
's that work for
,
, and
. Thus this is not a basis; it does not span the space.
- Yes, this is a basis. Setting up the relationship leads to this reduction
,
, and
.
- No, this is not a basis. The reduction
,
, and
. Instead, the span of the given set includes only those three-tall vectors where
.
- Problem 2
Represent the vector with respect to the basis.
,
,
,
- Answer
- We solve
and so
. Thus, the representation is this.
- The relationship
is easily solved by eye to give that
,
,
, and
.
- Problem 3
Find a basis for
, the space of all quadratic polynomials. Must any such basis contain a polynomial of each degree:~degree zero, degree one, and degree two?
- Answer
One basis is
. There are bases for
that do not contain any polynomials of degree one or degree zero. One is
. (Every basis has at least one polynomial of degree two, though.)
- Problem 4
Find a basis for the solution set of this system.
- Answer
The reduction
gives that the only condition is that
. The solution set is
and so the obvious candidate for the basis is this.
We've shown that this spans the space, and showing it is also linearly independent is routine.
- Problem 5
Find a basis for
, the space of
matrices.
- Answer
There are many bases. This is an easy one.
- Problem 6
Find a basis for each.
- The subspace
of
- The space of three-wide row vectors whose first and second components add to zero
- This subspace of the
matrices
- Answer
For each item, many answers are possible.
- One way to proceed is to parametrize by expressing the
as a combination of the other two
. Then
is
and
. This only shows that it spans, but checking that it is linearly independent is routine.
- Parametrize
to get
, which suggests using the sequence
. We've shown that it spans, and checking that it is linearly independent is easy.
- Rewriting
- Problem 7
Check Example 1.6.
- Answer
We will show that the second is a basis; the first is similar. We will show this straight from the definition of a basis, because this example appears before Theorem 1.12.
To see that it is linearly independent, we set up
. Taking
and
gives this system
which shows that
and
.
The calculation for span is also easy; for any
, we have that
gives that
and that
, and so the span is the entire space.
- Problem 8
Find the span of each set and then find a basis for that span.
in
in
- Answer
- Asking which
can be expressed as
gives rise to three linear equations, describing the coefficients of
,
, and the constants.
, that
and
. Thus, with
, we can compute appropriate
and
for any
and
. So the span is the entire set of linear polynomials
. Parametrizing that set
suggests a basis
(we've shown that it spans; checking linear independence is easy).
- With
with associated
's are the ones such that
. Hence the span is
. Parametrizing gives
, which suggests
(checking that it is linearly independent is routine).
- Problem 9
Find a basis for each of these subspaces of the space
of cubic polynomials.
- The subspace of cubic polynomials
such that
- The subspace of polynomials
such that
and
- The subspace of polynomials
such that
,
, and~
- The space of polynomials
such that
,
,
, and~
- Answer
- The subspace is
. Rewriting
gives
, which, on breaking out the parameters, suggests
for the basis (it is easily verified).
- The given subspace is the collection of cubics
such that
and
. Gauss' method
and that
. Rewriting
as
suggests this for a basis
. The above shows that it spans the space. Checking it is linearly independent is routine. (Comment. A worthwhile check is to verify that both polynomials in the basis have both seven and five as roots.)
- Here there are three conditions on the cubics, that
, that
,and that
. Gauss' method
, with
,
, and
. The parametrization is this.
. It spans the space by the work above. It is clearly linearly independent because it is a one-element set (with that single element not the zero object of the space). Thus, any cubic through the three points
,
, and
is a multiple of this one. (Comment. As in the prior question, a worthwhile check is to verify that plugging seven, five, and three into this polynomial yields zero each time.)
- This is the trivial subspace of
. Thus, the basis is empty
.
Remark. The polynomial in the third item could alternatively have been derived by multiplying out
.
- Problem 10
We've seen that it is possible for a basis to remain a basis when it is reordered. Must it remain a basis?
- Answer
Yes. Linear independence and span are unchanged by reordering.
- Problem 11
Can a basis contain a zero vector?
- Answer
No linearly independent set contains a zero vector.
- Problem 12
Let
be a basis for a vector space.
- Show that
is a basis when
. What happens when at least one
is
?
- Prove that
is a basis where
.
- Answer
- To show that it is linearly independent, note that
gives that
, which in turn implies that each
is zero. But with
that means that each
is zero. Showing that it spans the space is much the same; because
is a basis, and so spans the space, we can for any
write
, and then
. If any of the scalars are zero then the result is not a basis, because it is not linearly independent.
- Showing that
is linearly independent is easy. To show that it spans the space, assume that
. Then, we can represent the same
with respect to
in this way
.
- Problem 13
Find one vector
that will make each into a basis for the space.
in
in
in
- Answer
Each forms a linearly independent set if
is ommitted. To preserve linear independence, we must expand the span of each. That is, we must determine the span of each (leaving
out), and then pick a
lying outside of that span. Then to finish, we must check that the result spans the entire given space. Those checks are routine.
- Any vector that is not a multiple of the given one, that is, any vector that is not on the line
will do here. One is
.
- By inspection, we notice that the vector
is not in the span of the set of the two given vectors. The check that the resulting set is a basis for
is routine.
- For any member of the span
, the coefficient of
equals the constant term. So we expand the span if we add a quadratic without this property, say,
. The check that the result is a basis for
is easy.
- Problem 14
Where
is a basis, show that in this equation
each of the
's is zero. Generalize.
- Answer
To show that each scalar is zero, simply subtract
. The obvious generalization is that in any equation involving only the
's, and in which each
appears only once, each scalar is zero. For instance, an equation with a combination of the even-indexed basis vectors (i.e.,
,
, etc.) on the right and the odd-indexed basis vectors on the left also gives the conclusion that all of the coefficients are zero.
- Problem 15
A basis contains some of the vectors from a vector space; can it contain them all?
- Answer
No; no linearly independent set contains the zero vector.