Type a command or search the notes. Tab cycles completions. Up and down recall history when blank. Escape dismisses, then leaves the prompt.
MATH
[1251]

Theorems from Rank-nullity

All theorems from Rank-nullity.

Back to Rank-nullity

Rank-nullity theorem

For a matrix AA over a scalar field F\mathbb F with nn columns,

rank⁡(A)+nullity⁡(A)=n.\operatorname{rank}(A)+\operatorname{nullity}(A)=n.

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 AA.

Classes of solutions of Ax=bAx=b

Let AA be a matrix over an infinite scalar field F\mathbb F (such as R\mathbb R or C\mathbb C), let bb be a vector of the appropriate dimension and let [A∣b][A\mid b] be the augmented matrix formed by appending bb to AA. The equation Ax=bAx=b has:

  1. no solution if rank⁡(A)≠rank⁡([A∣b]);\operatorname{rank}(A)\ne\operatorname{rank}([A\mid b]);
  2. a unique solution if rank⁡(A)=rank⁡([A∣b])andnullity⁡(A)=0;\operatorname{rank}(A)=\operatorname{rank}([A\mid b]) \quad\text{and}\quad \operatorname{nullity}(A)=0;
  3. infinitely many solutions if rank⁡(A)=rank⁡([A∣b])andnullity⁡(A)>0.\operatorname{rank}(A)=\operatorname{rank}([A\mid b]) \quad\text{and}\quad \operatorname{nullity}(A)>0.

In the last case, if nullity⁡(A)=k\operatorname{nullity}(A)=k, then every solution has the form

x=xp+ω1u1+⋯+ωkuk,x=x_p+\omega_1u_1+\cdots+\omega_ku_k,

where xpx_p is any particular solution of Ax=bAx=b, {u1,…,uk}\{u_1,\ldots,u_k\} is a basis for ker⁡(A)\ker(A) and ω1,…,ωk∈F\omega_1,\ldots,\omega_k\in\mathbb F.

Appending bb increases the rank exactly when bb is not in the column space of AA, that is, when Ax=bAx=b 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 xp+ker⁡(A)x_p+\ker(A) 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 T:V→WT:V\to W is a linear map over a scalar field F\mathbb F and VV is finite-dimensional, then

rank⁡(T)+nullity⁡(T)=dim⁡(V).\operatorname{rank}(T)+\operatorname{nullity}(T)=\dim(V).

The codomain need not be finite-dimensional: the image of a map from the finite-dimensional space VV is automatically finite-dimensional.

On this page