$A$ is a square matrix. Prove

  1. there exists $m$ such that $\operatorname{rank}(A^m)=\operatorname{rank}(A^{m+1})$
  2. there exists a square matrix $B$ such that $A^m=A^{m+1}B$

I already knew the first one , since $A^{m+1}=A^m\cdot A$ , then $\operatorname{rank}(A^m)\ge \operatorname{rank}(A^{m+1}) $. If there is no $m$ to satisfy $\operatorname{rank}(A^m)=\operatorname{rank}(A^{m+1})$ , then $\operatorname{rank}(A^m)\gt \operatorname{rank}(A^{m+1}) $. And there will be $\operatorname{rank}(A^k)=0$, it follows $\operatorname{rank}(A^{k+1})=0$. Now I really don't know how to deal with the second one. Is there any connection?



  • Show that $A^m$ and $A^{m+1}$ have the same column space, using one inclusion and equality of dimensions.

  • Use multiplication on the right by elementary matrices (which amounts to invertible column operations).


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.