Question D.1
No, these two vectors do not form a basis of . If it did then would be
spanned by just two vectors. This is impossible. For example, it would
imply by the exchange lemma that any three vectors in are linearly
dependent. We know this is false.
Question D.2
This is a bit of a trick question, but to solve it you just need to look
carefully at the definitions (as always). A linear subspace of is
a subset of with certain properties. is a collection of
3-tuples where each is a real number. Elements of
are 2-tuples (pairs), and hence not elements of .
Therefore is not a subset of , and in particular not a
linear subspace of .
Question D.3
Let be as in the question. We need to show that .
Here’s one proof. We know from the definition of scalar
multiplication that for any vector .
Hence, letting and be any vectors in and
applying the definition of linearity,
Question D.4
Yes, must be a linear subspace of . To see this, pick any
and in and any scalars .
To establish our claim we need to show that is in . To see that this is so observe that by ()
we have
and . By () we then have . In other words, as claimed.
Question D.5
Let and for . We claim that
(9)
To see this let . By the
definition of linear subspaces we know that .
Using the definition of linear subspaces again we have . Hence (9) is confirmed.
Question D.6
The answer is yes. Here’s one proof: Suppose to the contrary that
is linearly dependent. Then one
element can be written as a linear combination of the others. In our
setting with only two vectors, this translates to for some . Since we can
multiply each side by to get . But
now each is a multiple of the other. This contradicts linear
independence of .
Here’s another proof: Take any with
(10)
We need to show that . To see this, observe that
Hence .
Since , the only way this could occur is that
.
But is linearly independent, so this implies
that . The proof is done.
Question D.7
There is an easy way to do this: We know that any linearly
independent set of 3 vectors in will span . Since , this will include . So all we need to do is
show that is linearly independent. To this end, take any scalars
with
Write as a linear system of 3 equations and show that the only solution is .
In this case the set would be linearly independent.
Question D.8
By definition, is equal to the dimension of the span of
its columns. Its columns are the canonical basis vectors in ,
which we know span all of . Hence
Draft of the proof for the second question:
For the upper triangular matrix start by showing that the columns are linearly independent, and because there are of them, they span the whole space , thus the expression above applies again, and the rank is .
Question D.9
Let be nonsingular and let
be its inverse. To see that is linear we need to show that for any
pair in (which is the domain of ) and any
scalars and , the following equality holds:
In the proof we will exploit the fact that is by assumption a linear
bijection.
So pick any vectors and any two scalars . Since is a bijection, we know that and have
unique preimages under . In particular, there exist unique vectors
and such that
Using these definitions, linearity of and the fact that is the
inverse of , we have
This chain of equalities confirms