- #1
talolard
- 125
- 0
Hey Guys, Another matrice question
Prove: Rk(A+B)[tex]\leq[/tex] Rk(A) +Rk(B)
Rk(A+B) = Dim[R(A) + R(B)]
Where R(A) is the row space of A
we know that Dim[R(A)+R(B)] = Dim[R(A)] + Dim[R(B)] - Dim[R(A)[tex]\cap[/tex]R(B)]
Which means that Dim[R(A)+R(B)] [tex]\leq[/tex] Dim[R(A)] + Dim[R(B)] iff Rk(A+B)[tex]\leq[/tex] Rk(A) +Rk(B)
I heard a rumor that this can also be done with linear transformations, can anyone elighten me on that path?
Is this correct?
Thanks
Tal
Homework Statement
Prove: Rk(A+B)[tex]\leq[/tex] Rk(A) +Rk(B)
The Attempt at a Solution
Rk(A+B) = Dim[R(A) + R(B)]
Where R(A) is the row space of A
we know that Dim[R(A)+R(B)] = Dim[R(A)] + Dim[R(B)] - Dim[R(A)[tex]\cap[/tex]R(B)]
Which means that Dim[R(A)+R(B)] [tex]\leq[/tex] Dim[R(A)] + Dim[R(B)] iff Rk(A+B)[tex]\leq[/tex] Rk(A) +Rk(B)
I heard a rumor that this can also be done with linear transformations, can anyone elighten me on that path?
Is this correct?
Thanks
Tal