The Invertible Matrix Theorem

Theorem. Let AA be an nn-by-nn matrix. Then the following statements are equivalent. That is, for a given AA, the statements are either all true or all false.

  1. AA is an invertible matrix.

  2. AA is row equivalent to the nn-by-nn identity matrix.

  3. AA has nn pivot positions.

  4. The equation A𝐱=𝟎A\mathbf{x}=\mathbf{0} has only the trivial solution.

  5. The columns of AA form a linearly independent set.

  6. The linear transformation 𝐱A𝐱\mathbf{x} \mapsto A\mathbf{x} is one-to-one.

  7. The equation A𝐱=𝐛A\mathbf{x} = \mathbf{b} has at least one solution for each 𝐛n\mathbf{b} \in \mathbb{R}^n.

  8. The columns of AA span n\mathbb{R}^n.

  9. The linear transformation AA𝐱A \mapsto A\mathbf{x} is onto.

  10. There is an nn-by-nn matrix CC such that CA=ICA = I.

  11. There is an nn-by-nn matrix DD such that AD=IAD = I.

  12. ATA^T is an invertible matrix.

  13. The columns of AA form a basis of n\mathbb{R}^n.

  14. ColA=n\mathrm{Col}\, A = \mathbb{R}^n.

  15. dimColA=n\mathrm{dim}\, \mathrm{Col}\, A = n.

  16. rankA=n\mathrm{rank}\, A = n.

  17. NulA={𝟎}\mathrm{Nul}\, A = \{\mathbf{0}\}.

  18. dimNulA=0\mathrm{dim}\, \mathrm{Nul}\, A = 0.