Suppose is a vector space and is a finite spanning set for (i.e. ). In the previous chapter, we saw that if is linearly dependent, then (at least) one vector can be removed from , and the resulting smaller set will still be a spanning set. You can imagine repeating this process until finally you are left with a spanning set that is linearly independent.
This leads to the following definition.
basis for a vector space
a linearly independent spanning set for the space
Discovery18.1.
In each of the following, determine whether is a basis for . If it is not a basis, make sure you know which property violates, independence or spanning.
(a)
,.
(b)
,.
(c)
,.
(d)
the space of upper triangular matrices,
.
(e)
the space of lower triangular matrices,
.
(f)
, the space of all polynomials of degree or less, .
(g)
,.
As discussed in the introduction to this discovery guide above, a spanning set that is not linearly independent contains redundant information in the form of vectors that are not actually needed to form a spanning set. This redundancy manifests itself in other ways, as the next discovery activity will demonstrate.
Discovery18.2.
Consider the set of vectors in . This set spans but is not linearly independent.
(a)
Since spans , it is possible to express vector as a linear combination of the vectors in .
Demonstrate a way to do this:
.
(b)
Here is the redundant part. Demonstrate a different way to express as a linear combination of the vectors in :
.
(c)
How many different ways do you think there are to do this?
The next discovery activity will demonstrate that the redundancies of Discovery 18.2 cannot happen for a basis.
Discovery18.3.
Suppose is a vector space, is a basis for , and is a vector in .
Since is a spanning set, there is a way to express as linear combinations of the vectors in :
.
Suppose there were a different such expression:
.
Use the vector identity
and the two different expressions for above to show that having these two different expressions violates the linear independence of .
Discovery 18.3 shows that when we have a basis for a vector space , each vector in has one unique expression as a linear combination of the vectors in . For , the coefficients are called the coordinates of relative to . Since these coordinates consist of coefficients, we sometimes relate to a vector in by collecting its coordinates into an -tuple:
.
This is called the coordinate vector of relative to .
Discovery18.4.
In each of the following, determine the coordinate vector of relative to the provided basis for .
(a)
,,.
(b)
,,.
(c)
,,.
(d)
,,.
(e)
,,.
Discovery18.5.
In each of the following, determine which vector in has the given coordinate vector .
(a)
,,.
(b)
,,.
(c)
,,.
(d)
,,.
(e)
,,.
Discovery18.6.
Coordinate vectors let us transfer vector algebra in a space to the familiar space .
In Task 18.5.b you have already determined the vector in that has coordinate vector . Now do the same to determine the vector in that has coordinate vector .
(b)
Do some algebra in :
Using your vectors from Task a, and from Task 18.5.b compute the linear combination .
Note: Vectors and “live” in the space , so your computation in this task should involve matrices, and should also result in a matrix.
(c)
Do the same algebra in :
Compute , using the coordinate vectors and provided to you in Task 18.6.a.
Note: These coordinate vectors “live” in the space , so your computation in this task should involve four-dimensional vectors, and should also result in a four-dimensional vector.
(d)
Compare your results:
Consider your four-dimensional result vector from Task c as a coordinate vector for some vector in relative to . Similarly to your computations in Task 18.5.b and Task a, determine the matrix in that has coordinate vector equal to your result vector from Task c. Then compare with your result matrix from Task 18.6.b. Surprised?