Proving that the product of two full-rank matrices is full-rank

  • Thread starter Thread starter leden
  • Start date Start date
  • Tags Tags
    Matrices Product
leden
Messages
7
Reaction score
0
Say I have a mxn matrix A and a nxk matrix B. How do you prove that the matrix C = AB is full-rank, as well?
 
Physics news on Phys.org
Hey leden and welcome to the forums.

For this problem, I'm wondering if you can show that the null-space for the final space is directly related to the null-spaces of the original two systems (like for example if they are additive or have some other relation).

If this is possible, then if you can show that the nullity is zero then you have shown it has full rank.
 
What do you mean with "full rank" in the first place?
 
By full-rank, I mean rank(M) = min{num_cols(M), num_rows(M)}.
 
leden said:
By full-rank, I mean rank(M) = min{num_cols(M), num_rows(M)}.

In that case, the statement in the OP is false. Try to find a counterexample.
 
just off the top of my head, it seems to follow from the multiplicative property of determinants. (assuming you state it correctly.)
 
mathwonk said:
just off the top of my head, it seems to follow from the multiplicative property of determinants. (assuming you state it correctly.)

That's true for square matrices, but the OP's matrices are not necessariily square (again, assuming it was stated correctly).
 

Similar threads

Replies
14
Views
3K
Replies
5
Views
2K
Replies
9
Views
2K
Replies
2
Views
2K
Replies
9
Views
5K
Replies
1
Views
50K
Back
Top