Prove Null(AB) ≥ Null(B): Invertible Cases

  • Thread starter Thread starter danago
  • Start date Start date
  • Tags Tags
    Nullspace Proof
danago
Gold Member
Messages
1,118
Reaction score
4
Hey. I am doing some last minute exam study and came across this question:

let A and B be nxn matrices. Prove that Null(AB) \geq Null(B)

Now i think i did it correctly, but i wasn't sure if i perhaps overlooked something and there is a flaw in my proof.

I began by stating that if any vector is in the nullspace of B, then it MUST also be in the nullspace of AB. Let x be in the nullspace of B, then:

Bx = 0

Then:

ABx = A(Bx) = A(0) = 0

Hence any vector in the nullspace of B is also in the nullspace of AB i.e. the nullspace of B is a subset of the nullspace of AB, hence the dimension (nullility) of the nullspace of AB will be greater (or equal).

That look ok?

The second part of the question was:

When is the Null(AB) = Null(B)?

I said when A is invertible, since:

ABx = 0 imples that Bx = 0 if the inverse of A exists. Hence, any vector in the nullspace of AB will also be in the nullspace of B. Since every element of the nullspace of AB is also in nullspace of B, and every element of the nullspace of B is also in the nullspace of AB (from the first part of the question), the two subspaces are equal and hence have the same dimension.


Do they look alright?

Thanks in advance,
Dan.

PS. I am so sick of typing the word nullspace
 
Physics news on Phys.org
It looks fine to me. Why don't you make up a notation like 'N(A) means nullspace of A'? That way you won't have to type the word over and over.
 
Dick said:
It looks fine to me. Why don't you make up a notation like 'N(A) means nullspace of A'? That way you won't have to type the word over and over.

Thanks, and glad to hear that its ok :smile:

And haha yea i did think about doing that, but only after i had posted. I am in a bit of a crazy pre-exam mood at the moment because i have an accounting exam tomorrow and pretty much hate the unit with a passion and not so confident about it :P
 
I don't think A needs to be invertible. What you need is im(B) \cap ker(A) = {0}
 
danago said:
Thanks, and glad to hear that its ok :smile:

And haha yea i did think about doing that, but only after i had posted. I am in a bit of a crazy pre-exam mood at the moment because i have an accounting exam tomorrow and pretty much hate the unit with a passion and not so confident about it :P

Actually, there is maybe an oversight. It's certainly true that if A is invertible N(AB)=N(B). But there is a weaker possibility. Can you show that if N(A) is contained in N(B) then it's also true that N(AB)=N(B)?
 
Dick said:
Actually, there is maybe an oversight. It's certainly true that if A is invertible N(AB)=N(B). But there is a weaker possibility. Can you show that if N(A) is contained in N(B) then it's also true that N(AB)=N(B)?

Hmm I am not quite sure. I don't know if I am completely missing something, but i can't see how to show that. From the first part I've shown that Bx=0 ==> ABx=0, so i guess i need to use the fact that N(A) is in N(B) to show that ABx=0 ==> Bx=0 and that will conclude the proof?

Any hints? :smile:Also, Office_Shredder, is the kernal of a matrix the same as its nullspace? And what does im(B) mean?
 
kernel of the matrix is its nullspace, the image of the matrix (im(B)) is the set of points that the matrix maps to... so for example, the matrix

[1 0]
[0 0]

maps the vector (a,b) to (a,0) so the image of this matrix is just the set of all points (a,0).
 
danago said:
Hmm I am not quite sure. I don't know if I am completely missing something, but i can't see how to show that. From the first part I've shown that Bx=0 ==> ABx=0, so i guess i need to use the fact that N(A) is in N(B) to show that ABx=0 ==> Bx=0 and that will conclude the proof?

Any hints? :smile:


Also, Office_Shredder, is the kernal of a matrix the same as its nullspace? And what does im(B) mean?

Office_Shredder said it much more accurately than I did. The kernel is the same as the nullspace. im(B) is the set of all set of all y such that y=B(x) for some x. So the statement if really just saying if B(x) is not zero then A(B(x)) is not zero. Which is exactly what you need.
 
Back
Top