Theorem. Let A be a p×q matrix and B be a q×p matrix, while p and q are positive integers satisfying p > q. Then the product matrix AB is not invertible.
Proof. Note that an m×n matrix can be regarded as a linear transform from Rn to Rm. Note further that the following statements are equivalent:
- AB is invertible.
- AB is a one-to-one linear transform from Rp onto itself.
- ker(AB) = {0}.
- dim(AB(Rp)) = p. (i.e. the dimension of range of AB is p.)
These are a fundamental theorem of Linear Algebra.
Thus we now only have to show that dim(AB(Rp)) ≠ p.
The dimension of row space of B is q, which equals the dimension of column space of B, thus the dimension of range of B cannot be larger than q, i.e. dim(B(Rp)) ≤ q. Besides, for the dimension of range of a linear transform cannot be larger than the dimension of domain, we have dim(A(B(Rp))) ≤ q. Since AB(Rp) = A(B(Rp)), we finally have dim(AB(Rp)) ≤ q < p. Proved by Sooji Shin.
Is there anyone who knows another proof?
Geschrieben von Sooji Shin