Invertible Matrix Theorem — Definition, Formula & Examples

The Invertible Matrix Theorem is a collection of equivalent statements that are all true or all false for a given

n \times n

matrix

A

. If any one condition holds (such as

\det(A) \neq 0

A

has

n

pivot positions), then every other condition on the list also holds, confirming that

A

is invertible.

Let $A$ be an $n \times n$ matrix. The following statements are equivalent: (a) $A$ is invertible, (b) $A$ is row equivalent to the $n \times n$ identity matrix $I_n$ , (c) $A$ has $n$ pivot positions, (d) the equation $A\mathbf{x} = \mathbf{0}$ has only the trivial solution, (e) the columns of $A$ are linearly independent, (f) the linear transformation $\mathbf{x} \mapsto A\mathbf{x}$ is one-to-one, (g) $A\mathbf{x} = \mathbf{b}$ has a unique solution for every $\mathbf{b} \in \mathbb{R}^n$ , (h) the columns of $A$ span $\mathbb{R}^n$ , (i) $\det(A) \neq 0$ , (j) $0$ is not an eigenvalue of $A$ , (k) $A^T$ is invertible.

How It Works

To apply the theorem, you only need to verify one condition from the list. For instance, if you row-reduce

A

and find

n

pivots, you can immediately conclude every other statement is true:

A

is invertible, its columns are linearly independent,

A\mathbf{x} = \mathbf{b}

has a unique solution for every

\mathbf{b}

, and so on. Conversely, if any single condition fails — say

\det(A) = 0

— then every condition fails, meaning

A

is singular. This makes the theorem a powerful diagnostic tool: one check answers many questions at once.

Worked Example

Problem: Determine whether the matrix

A = \begin{bmatrix} 2 & 1 \\ 4 & 3 \end{bmatrix}

is invertible using the Invertible Matrix Theorem.

Choose a condition: Compute the determinant of

A

\det(A) = (2)(3) - (1)(4) = 6 - 4 = 2

Apply the theorem: Since

\det(A) = 2 \neq 0

, the theorem guarantees that every equivalent condition holds:

A

is invertible, its columns are linearly independent,

A\mathbf{x} = \mathbf{b}

has a unique solution for every

\mathbf{b}

, and so on.

Answer:

A

is invertible because

\det(A) = 2 \neq 0

. By the Invertible Matrix Theorem, all equivalent conditions hold simultaneously.

Why It Matters

In a first linear algebra course, the Invertible Matrix Theorem ties together nearly every major concept from the first half of the semester — determinants, pivots, linear independence, span, and uniqueness of solutions — into one unified result. Engineers and scientists rely on it when checking whether a system of equations can be solved uniquely, which arises in circuit analysis, structural mechanics, and data fitting.

Common Mistakes

Mistake: Trying to apply the theorem to non-square matrices.

Correction: The Invertible Matrix Theorem applies only to

n \times n

(square) matrices. A non-square matrix cannot be invertible in the standard sense.