Rank and nullity of linear maps

[Jennifer1990]

Homework Statement

By considering the dimensions of the range or null space, determine the rank and the nullity of the following linear maps:
a) D:Pn --> Pn-1, where D(x^k)=Kx^k-1
b) L:M(2,3) --> M(2,3) where L([a b c; d e f])=[d e f; 0 0 0]
c) Tr:M(3,3) --> R, where Tr(A)=a11+a22+a33 (the trace of A)

Homework Equations

None

The Attempt at a Solution

a)If we rewrite Pn-1 as a column vector and row-reduce, we are left with just 1 in the first row and all the other entries are zeroes. Therefore the nullity is 1 since we have one parameter in the solution space. The rank is 1 - nullity = 0

b)Solving for the nullspace we see that there are 2 parameters in the solution space therefore the nullity is 2 and the rank is 1

c)We have one equation in 3 unknown numbers .The kernel consists of all a11, a22, a33 such that a11+a22+a33 = 0. We can solve that for one of the variables in terms of the other 2. Therefore the nullity is 2 and the rank is 1.
Can you give me a matrix which represents the linear mapping Tr? :S

I am not sure if I did these correctly. I would appreciate any feedback possible. thank you!

 

[jbunniii]

Homework Statement

By considering the dimensions of the range or null space, determine the rank and the nullity of the following linear maps:
a) D:Pn --> Pn-1, where D(x^k)=Kx^k-1
b) L:M(2,3) --> M(2,3) where L([a b c; d e f])=[d e f; 0 0 0]
c) Tr:M(3,3) --> R, where Tr(A)=a11+a22+a33 (the trace of A)

Homework Equations

None

The Attempt at a Solution

a)If we rewrite Pn-1 as a column vector and row-reduce, we are left with just 1 in the first row and all the other entries are zeroes. Therefore the nullity is 1 since we have one parameter in the solution space. The rank is 1 - nullity = 0

b)Solving for the nullspace we see that there are 2 parameters in the solution space therefore the nullity is 2 and the rank is 1

c)We have one equation in 3 unknown numbers .The kernel consists of all a11, a22, a33 such that a11+a22+a33 = 0. We can solve that for one of the variables in terms of the other 2. Therefore the nullity is 2 and the rank is 1.
Can you give me a matrix which represents the linear mapping Tr? :S

I am not sure if I did these correctly. I would appreciate any feedback possible. thank you!

With regard to (a), I assume Pn denotes the space of polynomials of degree \leq n and whose coefficients are elements of some ring or field. Therefore D is the derivative operator. Which subspace of polynomials have derivative equal to zero, and what is the dimension of this subspace? Then, in general, what can you say about

dim(range(A)) + dim(null(A))

where A is any linear map between finite-dimensional vector spaces?

With regard to (b), tell us what you have determined the null space of L to be. That is, if you apply L to a general matrix M = [a b c; d e f], what are the necessary and sufficient conditions on a, b, c, d, e, and f for M to be in the null space of L?

With regard to (c), since T maps a 3x3 matrix to a real number, you should be writing "the null space of T consists of those 3x3 matrices for which..." It does NOT consist of specific "a11, a22, a33" which are real numbers, not matrices.

 

[Jennifer1990]

a) The subspace of polynomials that have derivative equal to zero are those with x^0. So then this means that the rank is 1 and the nullity is 0 by the rank-nullity theorem?

b) Applying L to a general matrix M = [a b c; d e f] gives [d e f; 0 0 0]. For M to be the nullspace of L, then d e and f must also equal 0. Solving for the nullspace, we get x3 = 0, x2 = 0. These are free variables which are always equal to 0 therefore for kd + e + f = 0, k is a real number, d must equal 0. Therefore, the nullity is 2 and the rank is 1

c)"the null space of T consists of those 3x3 matrices for which a11+a22+a33 = 0"
I think this is what you are asking for. And I still think the answer is nullity = 2 and rank =1...

Could you let me know if the answers I gave are right? thank you~

 

[jbunniii]

a) The subspace of polynomials that have derivative equal to zero are those with x^0. So then this means that the rank is 1 and the nullity is 0 by the rank-nullity theorem?

I guess you mean to say, the subspace of polynomials that have derivative equal to zero are those with degree 0, i.e., the ones that don't have any powers of x higher than x^0. OK, that's correct.

Now, what does "nullity" mean? It means the dimension of the null space. You just described what the null space is: it is the space of polynomials of degree 0. What is the dimension of this space? Hint: it's not zero. It's the answer to the following question. Given an arbitrary element of Pn, which looks like,

a_n x^n + a_{n-1} x^{n-1} + \ldots + a_1 x^1 + a_0 x^0[\tex],<br /> <br /> how many of the coefficients are constrained by the definition of the null space of D?<br /> <br /> Your answer for the rank is also incorrect, but we&#039;ll get to that after you work out the nullity.<br /> <br /> <blockquote data-attributes="" data-quote="" data-source="" class="bbCodeBlock bbCodeBlock--expandable bbCodeBlock--quote js-expandWatch"> <div class="bbCodeBlock-content"> <div class="bbCodeBlock-expandContent js-expandContent "> b) Applying L to a general matrix M = [a b c; d e f] gives [d e f; 0 0 0]. For M to be the nullspace of L, then d e and f must also equal 0. </div> </div> </blockquote><br /> OK, good.<br /> <br /> <blockquote data-attributes="" data-quote="" data-source="" class="bbCodeBlock bbCodeBlock--expandable bbCodeBlock--quote js-expandWatch"> <div class="bbCodeBlock-content"> <div class="bbCodeBlock-expandContent js-expandContent "> Solving for the nullspace, we get x3 = 0, x2 = 0. These are free variables which are always equal to 0 therefore for kd + e + f = 0, k is a real number, d must equal 0. Therefore, the nullity is 2 and the rank is 1 </div> </div> </blockquote><br /> No, this isn&#039;t right. I don&#039;t think you&#039;re understanding exactly what &quot;nullspace&quot; means. The null space of L is precisely the set of 2x3 matrices [a b c; d e f] for which d = e = f = 0. The dimension of this null space is once again the answer to this question: How many of the parameters a, b, c, d, e, f are constrained by the definition of the null space of L?<br /> <br /> The rank is also incorrect, but let&#039;s get to that after you work out the dimension of the null space.<br /> <br /> <blockquote data-attributes="" data-quote="" data-source="" class="bbCodeBlock bbCodeBlock--expandable bbCodeBlock--quote js-expandWatch"> <div class="bbCodeBlock-content"> <div class="bbCodeBlock-expandContent js-expandContent "> c)&quot;the null space of T consists of those 3x3 matrices for which a11+a22+a33 = 0&quot; <br /> I think this is what you are asking for. </div> </div> </blockquote><br /> OK, that&#039;s correct.<br /> <br /> <blockquote data-attributes="" data-quote="" data-source="" class="bbCodeBlock bbCodeBlock--expandable bbCodeBlock--quote js-expandWatch"> <div class="bbCodeBlock-content"> <div class="bbCodeBlock-expandContent js-expandContent "> And I still think the answer is nullity = 2 and rank =1... </div> </div> </blockquote><br /> Your answer for the nullity is correct, but I&#039;m not 100% sure that your reasoning is correct. An arbitrary 3x3 matrix has NINE coefficients. How many of these are constrained by the condition a11+a22+a33 = 0? Also, rank = 1 is incorrect.<br /> <br /> Can you tell me the definition of the rank of a linear map, say from a vector space V to another vector space W? (Hint: it&#039;s the dimension of a certain subspace associated with the map. Which subspace, and what space is it a subspace of: V or W?) Can you tell me what this subspace is in each of the three examples above?<br /> <br /> Also, can you tell me what you know about dim(null(A)) + rank(A) for a given linear map between two finite-dimensional vector spaces?

 

[Jennifer1990]

a)Given an arbitrary element of Pn, which looks like,
a_n x^n + a_{n-1} x^{n-1} + \ldots + a_1 x^1 + a_0 x^0[\tex],<br /> how many of the coefficients are constrained by the definition of the null space of D?<br /> <br /> One of the coefficients is constrained by the definition of the nullspace of D. It is the coefficient of x^0.<br /> Therefore, the nullity is 1<br /> <br /> In Pn-1, there are n different polynomials, polynomials of degree 0, 1, 2,...n-1<br /> Therefore, the rank = n-1...i think...<br /> <br /> <br /> b)<i>How many of the parameters a, b, c, d, e, f are constrained by the definition of the null space of L?</i><br /> <br /> 3 of the parameters are constrained by the definition of the null space<br /> Therefore, the nullity is 3<br /> Can I see how you would solve for the nullspace? <br /> <br /> By rank-nullity theorem, rank = 0<br /> <br /> <br /> c)<i>Can you tell me the definition of the rank of a linear map, say from a vector space V to another vector space W? </i><br /> The rank of a linear map, from vector space V to vector space W is the dimension of the range space of V, which is a subspace of W<br /> <br /> <i>dim(null(A)) + rank(A) for a given linear map between two finite-dimensional vector spaces</i><br /> dim(null(A)) + rank(A) = number of columns in matrix A (rank-nullity theorem)

 

[jbunniii]

a)Given an arbitrary element of Pn, which looks like,
a_n x^n + a_{n-1} x^{n-1} + \ldots + a_1 x^1 + a_0 x^0,
how many of the coefficients are constrained by the definition of the null space of D?

One of the coefficients is constrained by the definition of the nullspace of D. It is the coefficient of x^0.
Therefore, the nullity is 1

No, if that were true then I would be free to pick the coefficients of x^1 through x^n anyway I like, yet the polynomial would be in the null space of D? i.e., its derivative would equal zero?

Let me rephrase the question: if the polynomial

a_n x^n + a_{n-1}x^{n-1} + \ldots + a_1 x^1 + a_0

has derivative equal to zero, then what does that say about the coefficients? Which coefficients are forced to be zero, and which can you choose any way you like?

b)How many of the parameters a, b, c, d, e, f are constrained by the definition of the null space of L?

3 of the parameters are constrained by the definition of the null space
Therefore, the nullity is 3
Can I see how you would solve for the nullspace?

L maps [a b c; d e f] to [d e f; 0 0 0]. The definition of the null space is the set of those matrices [a b c; d e f] that L maps to zero. That is, it is the set of all matrices [a b c; d e f] with d = e = f = 0. Therefore if asked "what is the null space?" you could say: "it is the set of all matrices of the form [a b c; 0 0 0]" where a, b, c are chosen freely from whichever field the coefficients come from (real or complex numbers, typically).

By rank-nullity theorem, rank = 0

L maps from V to V, where V is the space of 2x3 matrices. What is the dimension of V? Hint: it is not 2, and it is not 3. How many degrees of freedom do you have when you choose a 2x3 matrix? That is the dimension of V.

Then, the rank-nullity theorem tells us that

dim(null L) + rank(L) = dim(V)

If you know dim(null L) is 3 and you know dim(V) by answering the question above, then rank(L) is dim(V) - dim(null L).

 

[Jennifer1990]

a)All coefficients other than the coefficient of x^0 must be equal to 0 in order for the polynomial to have a derivative of 0. Therefore, n coefficients are constrained by the definition of the null space and we can choose one coefficient any way we like (i.e. the coefficient of x^0)
Therefore, the nullspace is n
Can you give me a hint on how to find the rank?


b)You said that the dimension of V is not 3. How can this be?
Doesn't the range space of L have matrices of 2 rows? So, the nullity of L which is 3 plus the dimension of V must equal 2?

 

[jbunniii]

a)All coefficients other than the coefficient of x^0 must be equal to 0 in order for the polynomial to have a derivative of 0. Therefore, n coefficients are constrained by the definition of the null space and we can choose one coefficient any way we like (i.e. the coefficient of x^0)
Therefore, the nullspace is n

Everything you said is correct except for your conclusion. We have one degree of freedom in choosing coefficients to make the derivative zero. Therefore the dimension of the null space is 1.

Can you give me a hint on how to find the rank?

dim(null(D)) + rank(D) = dim(P^{n-1})

First, understand why this is true. In particular, why is the right-hand side dim(P^{n-1}) and not dim(P^n)? Then, what is dim(P^{n-1})? Then, just solve for rank(D).

b)You said that the dimension of V is not 3. How can this be?
Doesn't the range space of L have matrices of 2 rows? So, the nullity of L which is 3 plus the dimension of V must equal 2?

How many degrees of freedom do I have to choose a 2x3 matrix? There are six elements in such a matrix, and I can choose them any way I like, right? Therefore the dimension of V is six. Does this make sense?

 

[Jennifer1990]

a)Don't you mean to say dim(null(D)) + rank(D) = dim(P^{n})
Because P^{n-1} refers to the range space of D...
The rank nullity-theorem states dim(null(D)) + rank(D) = dim(D) and in this case the dimension of D is Pn

b) I think I see what you are tying to say. For the matrix A=[d e f; 0 0 0] to be in the nullspace, d=e=f=0. You have 6 elements and can choose in any way you like. Therefore, the nullity is 6-3(i.e. the number of elements which are not constrained by the nullspace). The rank is also 3

 

[jbunniii]

a)Don't you mean to say dim(null(D)) + rank(D) = dim(P^{n})
Because P^{n-1} refers to the range space of D...
The rank nullity-theorem states dim(null(D)) + rank(D) = dim(D) and in this case the dimension of D is Pn

Yes, I meant Pn. But it's not correct to say that the dimension of D is Pn. The dimension of D is a number. Pn is a space. You meant to say that the dimension of D is the dimension of Pn. So what is the dimension of Pn? (This means: how many degrees of freedom do you have when choosing an element of Pn?)

b) I think I see what you are tying to say. For the matrix A=[d e f; 0 0 0] to be in the nullspace, d=e=f=0. You have 6 elements and can choose in any way you like. Therefore, the nullity is 6-3(i.e. the number of elements which are not constrained by the nullspace). The rank is also 3

Correct.

 

[Jennifer1990]

a) we have n elements which we can choose in any way we like

b)I am wondering how the rank of the matrix can possibly be 3 because in a 2x3 matrix, the highest rank it can have is 2...right?

 

[jbunniii]

a) we have n elements which we can choose in any way we like

An element of P^n looks like

a_n x^n + a_{n-1}x^{n-1} + \ldots + a_1 x + a_0

How many a's are there? (You're off by one!)

b)I am wondering how the rank of the matrix can possibly be 3 because in a 2x3 matrix, the highest rank it can have is 2...right?

You're confusing the matrices mapped by L with the matrix of the linear map L.

L maps one 2x3 matrix into another 2x3 matrix. We haven't actually expressed L itself as a matrix, but if we did, it would have to be 6x6! (And you would have to take the elements of the 2x3 input and output matrices and stretch them out into 6x1 vectors.)

 

[Jennifer1990]

a)There are n+1 a's?

 

[jbunniii]

a)There are n+1 a's?

Yes, so that's the dimension of Pn.