Chapter 3B Problems

2

  1. First notice that if we take , and label them as where and . Then, the element that goes through comes out in which means it is also an element in , meaning after going through 2 it will be 0, and stay 0 thought the rest of the function as a linear map moves 0 to 0.

    In other words, for any element , we are moving the element with the following map: Taking a closer look at , meaning that the input is always in . Meaning that and will stay 0 as any linear map moves identity to identity.

6.

Notice that the fundamental theorem of linear maps states: As , we have it so , however, this is impossible in .

check

7.

As is not injective, we know the null space of has to be greater than . Now, notice that this means the null space has to be exactly 1, as if it was 2 or greater then the null space would be V itself. office-hours

11

Proof:

  1. supose be a basis of . Extend to a basis of : . Define .
  2. then , hence .
  3. for all , write with , . then , so .
  4. then notice . thus and .

14

Any element in this null space would look like for each .

We know that the dim and dim . Thus the max dimension of the range would have to be at most . For the sake of contradiction assume such a map did exist, Then, by the fundamental theorem of linear maps

then we know that the dimension of the null-space is at least 3. However, this null space is spanned by the vectors and for which is a basis; proving no such null space exists as this has a null space of dimension 2 which is a contradiction.

15

Call the transformation T. From the fundamental theorem of linear maps we know . By this we know that is finite dimensional, as . #check The book specifies finite dimensional V

18

Proof:

    1. Assume with .
    1. Assume . Let .
    2. Choose basis of ; extend to basis of : add
    3. Pick linearly independent .
    4. Define for for ; extend linearly.
    5. Then

Chapter 3C Problems

1

This is true because at least columns are linearly independent thus at least those columns are non-zero.

5

suppose .

  1. Choose so that for each where is a basis for
  2. We can extend this to a basis of by appending .
  3. Do the same thing in by setting each and extending the basis
  4. The matrix of this representation has all zeros accept for 1s in the diagonal rows and columns

6

  1. If then the first column of are all zero.
  2. If then let and extend it to a basis of . This is only possible when you have a linear combination such that and everything else is