01
Unique coefficients on independent vectors
Suppose the vectors are independent. Show that the coefficients on these vectors are unique, in any linear combination. This means, for example, that if we know
then in fact we have for all . In other words, there is at most one way to write a vector as a linear combination of some independent vectors.
02
Neutralizing a matrix row
Suppose that the row vectors of a matrix are dependent. Explain precisely how (in terms of a given dependency relation) you can transform into a matrix having a row of all zeros by performing some combination of row-scale and row-add operations to the rows of .
03
Column dependence and multiple solutions
Suppose that the columns of a matrix are dependent. Consider equations of the form for a variable vector, and a given constant vector. Show that if there is a solution to this equation, then there must be more than one solution . (Because of the dependency of the columns of .)
(Hint: because the columns of are dependent, (explain how) you can find a specific vector with the property that . Combine with a given solution to the equation to produce a second solution. Can you always get an infinite set of solutions?)
04
Checking independence
Is the following set of vectors linearly independent?
If it’s dependent, find a dependency relation.
(You are encouraged to do this problem without Steinitz Exchange and dimensional reasoning: simply solve a system of equations instead.)
05
Vector operations according to components in another basis
Show that the list of components of a vector in some basis are added and scaled componentwise.
This means: given two vectors, if you express them in the basis , and add the components in this basis, you will get the same result as if you first added the two vectors (according to the definition of adding components within ) and then expressed the result in the basis . And similarly for scaling.