logo

Conditions for a Matrix Being Invertible 📂Matrix Algebra

Conditions for a Matrix Being Invertible

Theorem1

Let AA be a square matrix of size n×nn\times n. Then the following propositions are all equivalent.

(a) AA is an invertible matrix.

(b) The homogeneous linear system Ax=0A\mathbf{x}=\mathbf{0} has only the trivial solution.

(c) The reduced row echelon form of AA is InI_{n}.

(d) AA can be expressed as a product of elementary matrices.

(e) Ax=bA\mathbf{x}=\mathbf{b} has a solution for all n×1n\times 1 matrices b\mathbf{b}.

(f) Ax=bA\mathbf{x}=\mathbf{b} has exactly one solution for all n×1n\times 1 matrices b\mathbf{b}. That is, x=A1b\mathbf{x}=A^{-1}\mathbf{b} is satisfied.

(g) det(A)0\det (A) \ne 0

(h) The column vectors of AA are linearly independent.

(i) The row vectors of AA are linearly independent.

(j) The column vectors of AA generate Rn\mathbb{R}^{n}.

(k) The row vectors of AA generate Rn\mathbb{R}^{n}.

(l) The column vectors of AA are a basis for Rn\mathbb{R}^{n}.

(m) The row vectors of AA are a basis for Rn\mathbb{R}^{n}.

(n) The rank of AA is nn.

(o) The nullity of AA is 00.

(p) The orthogonal complement of the null space of AA is Rn\mathbb{R}^{n}.

(q) The orthogonal complement of the row space of AA is {0}\left\{ \mathbf{0} \right\}.

(r) None of the eigenvalues of AA is 00.

(s) ATAA^{T}A is invertible.

(t) The kernel of TAT_{A} is {0}\left\{ \mathbf{0} \right\}.

(u) The image of TAT_{A} is Rn\mathbb{R}^{n}.

(v) TAT_{A} is a one-to-one function.

Proof

(a)     \iff (b)     \iff (c)     \iff (d)

(a)     \iff (e)     \iff (f)


  1. Howard Anton, Elementary Linear Algebra: Aplications Version (12th Edition, 2019), p463 ↩︎