Let A be a square n×n matrix. Then the following statements are equivalent. That is, for a given A, the statements are either all true or all false.
A is an invertible matrix.
A is row equivalent to the n×n identity matrix.
A has n pivot positions.
The equation Ax=0 has only the trivial solution.
The columns of A form a linearly independent set.
The linear transformation x↦Ax is one-to-one.
The equation Ax=b has at least one solution for each b in Rn.
The columns of A span Rn.
The linear transformation x↦Ax maps Rn onto Rn.
There is an n×n matrix C such that CA=I.
There is an n×n matrix D such that AD=I.
AT is an invertible matrix.
Theorem
Let T:Rn→Rn be a linear transformation and let A be the standard matrix for T. Then T is invertible if and only if A is an invertible matrix. In that case, the linear transformation S given by S(x)=A−1x is the unique function satisfying (1) and (2).
S(T(x))=xfor allx∈Rn(1)T(S(x))=xfor allx∈Rn(2)