Exercise set D#

Please, see the general comment on the tutorial exercises

Question D.1#

Consider the matrix A defined by

A=(100.51227)

Do the columns of this matrix form a basis of R3? Why or why not?

Question D.2#

Is R2 a linear subspace of R3? Why or why not?

Question D.3#

Show that if T:RKRN is a linear function then 0ker(T).

Question D.4#

Let S be any nonempty subset of RN with the following two properties:

  • x,ySx+yS

  • cR and xScxS

Is S a linear subspace of RN?

Question D.5#

If S is a linear subspace of RN then any linear combination of K elements of S is also in S. Show this for the case K=3.

Question D.6#

Let {x1,x2} be a linearly independent set in R2 and let γ be a nonzero scalar. Is it true that {γx1,γx2} is also linearly independent?

Question D.7#

Is

z=(3.9811.734.32)

in the span of X:={x1,x2,x3}, where

x1=(400),x2=(120),x3=(011)?

Question D.8#

What is the rank of the N×N identity matrix I?

What about the upper-triangular matrix which non-zero elements are 1?

Question D.9#

Show that if T:RNRN is nonsingular, i.e. linear bijection, the inverse map T1 is also linear.

Solutions

Question D.1

No, these two vectors do not form a basis of R3. If it did then R3 would be spanned by just two vectors. This is impossible. For example, it would imply by the exchange lemma that any three vectors in R3 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 R3 is a subset of R3 with certain properties. R3 is a collection of 3-tuples (x1,x2,x3) where each xi is a real number. Elements of R2 are 2-tuples (pairs), and hence not elements of R3. Therefore R2 is not a subset of R3, and in particular not a linear subspace of R3.

Question D.3

Let T be as in the question. We need to show that T0=0. Here’s one proof. We know from the definition of scalar multiplication that 0x=0 for any vector x. Hence, letting x and y be any vectors in RK and applying the definition of linearity,

T0=T(0x+0y)=0Tx+0Ty=0+0=0

Question D.4

Yes, S must be a linear subspace of RN. To see this, pick any x and y in S and any scalars α,β. To establish our claim we need to show that z:=αx+βy is in S. To see that this is so observe that by ( such that ar such that ar) we have u:=αxS and v:=βyS. By ( such that ar) we then have u+vS. In other words, zS as claimed.

Question D.5

Let xiS and αiR for i=1,2,3. We claim that

(9)#α1x1+α2x2+α3x3S

To see this let y:=α1x1+α2x2. By the definition of linear subspaces we know that yS. Using the definition of linear subspaces again we have y+α3x3S. Hence (9) is confirmed.

Question D.6

The answer is yes. Here’s one proof: Suppose to the contrary that {γx1,γx2} 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 γx1=αγx2 for some α. Since γ0 we can multiply each side by 1/γ to get x1=αx2. But now each xi is a multiple of the other. This contradicts linear independence of {x1,x2}.

Here’s another proof: Take any α1,α2R with

(10)#α1γx1+α2γx2=0

We need to show that α1=α2=0. To see this, observe that

α1γx1+α2γx2=γ(α1x1+α2x2)

Hence γ(α1x1+α2x2)=0. Since γ0, the only way this could occur is that α1x1+α2x2=0. But {x1,x2} is linearly independent, so this implies that α1=α2=0. 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 R3 will span R3. Since zR3, this will include z. So all we need to do is show that X is linearly independent. To this end, take any scalars α1,α2,α3 with

α1(400)+α2(120)+α3(011)=0:=(000)

Write as a linear system of 3 equations and show that the only solution is α1=α2=α3=0. In this case the set would be linearly independent.

Question D.8

By definition, rank(I) is equal to the dimension of the span of its columns. Its columns are the N canonical basis vectors in RN, which we know span all of RN. Hence

rank(I)=dim(RN)=N

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 N of them, they span the whole space RN, thus the expression above applies again, and the rank is N.

Question D.9

Let T:RNRN be nonsingular and let T1 be its inverse. To see that T1 is linear we need to show that for any pair x,y in RN (which is the domain of T1) and any scalars α and β, the following equality holds:

T1(αx+βy)=αT1x+βT1y.

In the proof we will exploit the fact that T is by assumption a linear bijection.

So pick any vectors x,yRN and any two scalars α,β. Since T is a bijection, we know that x and y have unique preimages under T. In particular, there exist unique vectors u and v such that

Tu=xandTv=y

Using these definitions, linearity of T and the fact that T1 is the inverse of T, we have

T1(αx+βy)=T1(αTu+βTv)=T1(T(αu+βv))=αu+βv=αT1x+βT1y.

This chain of equalities confirms

T1(αx+βy)=αT1x+βT1y.