What is the relationship between invertible linear mappings and rank in proofs?

  • Thread starter Thread starter Mona1990
  • Start date Start date
  • Tags Tags
    Linear Proofs
Mona1990
Messages
13
Reaction score
0
1. Hi!
I was wondering if anyone could help me to solve the following problem!
Let L : [R][n] ->[R][m] and M :[R][m]-> [R][m] be linear mappings.
Prove that if M is invertible, then rank (M o L) = rank (L)


thanks! :)
 
Physics news on Phys.org
If M is invertible it maps Rm one-to-one onto Rm. In particular, it maps any k dimensional subset of Rm onto a k dimensional subset of Rm. Now, what does "rank" mean?
 
the dimension of the column space of M is the rank of M

and we know that dim (null M)= 0 since the null space of M is just the zero vector
and since rank = m - (dimension of the null space of M)
so rank is m?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top