Theorems from Rank-nullity
All theorems from Rank-nullity.
Rank-nullity theorem
For a matrix over a scalar field with columns,
In a row-echelon form, rank counts the pivot columns and nullity counts the free variables, or non-pivot columns. Their sum is therefore the number of columns of .
Classes of solutions of
Let be a matrix over an infinite scalar field (such as or ), let be a vector of the appropriate dimension and let be the augmented matrix formed by appending to . The equation has:
- no solution if
- a unique solution if
- infinitely many solutions if
In the last case, if , then every solution has the form
where is any particular solution of , is a basis for and .
Appending increases the rank exactly when is not in the column space of , that is, when is inconsistent. The infinite-field assumption ensures that a free parameter can take infinitely many values.
When a particular solution exists, subtracting it from any other solution gives a vector in the kernel. So the solution set is the affine translate of the kernel. The same pattern holds for any linear map: two inputs have the same output precisely when their difference lies in the kernel, so each non-empty fibre is a translate of the kernel.
Rank-nullity theorem for vector spaces
If is a linear map over a scalar field and is finite-dimensional, then
The codomain need not be finite-dimensional: the image of a map from the finite-dimensional space is automatically finite-dimensional.