Skip to content

Fundamental Theorem of Linear Maps

Theorem

Let VV be a finite-dimensional vector space and let A∈L(V,W)\boldsymbol{A} \in \mathcal{L}(V,W) be a linear map. Then

dim⁡(ker⁡A)+dim⁡(range⁡A)=dim⁡V.\dim(\ker \boldsymbol{A}) + \dim(\operatorname{range} \boldsymbol{A}) = \dim V.

Interpretation

A linear map splits the dimension of its domain into directions lost to the kernel and directions that survive in the range. The kernel collects the input vectors sent to 0\boldsymbol{0}; the dimension of the range counts the independent output directions that can actually be reached. The theorem says that these two counts always add up to dim⁡V\dim V.

Three coordinate axes with a shaded plane, the range of A of dimension 2, and a vertical line, the kernel of dimension 1; a vector v drops onto its image Av in the plane.

The map in the figure projects R3\mathbb{R}^3 vertically onto the shaded plane, as v\boldsymbol{v} drops onto Av\boldsymbol{A}\boldsymbol{v}. The whole vertical line is sent to 0\boldsymbol{0}, so dim⁡(ker⁡A)=1\dim(\ker \boldsymbol{A})=1, and the outputs fill the plane, so dim⁡(range⁡A)=2\dim(\operatorname{range}\boldsymbol{A})=2: 1+2=3=dim⁡R31+2=3=\dim\mathbb{R}^3.

However you set A\boldsymbol{A}, dim⁡(ker⁡A)+dim⁡(range⁡A)=2\dim(\ker \boldsymbol{A})+\dim(\operatorname{range}\boldsymbol{A})=2: what the kernel takes away, the range loses.

For an m×nm\times n matrix, read as a map Rn→Rm\mathbb{R}^n\to\mathbb{R}^m, dim⁡V=n\dim V=n is the number of columns, dim⁡(range⁡A)\dim(\operatorname{range}\boldsymbol{A}) is the rank, the number of pivots, and dim⁡(ker⁡A)\dim(\ker \boldsymbol{A}) is the number of free variables of the homogeneous system Ax=0\boldsymbol{A}\boldsymbol{x}=\boldsymbol{0}. The theorem is then the count "pivot columns plus free columns equals all columns".

If dim⁡V=dim⁡W\dim V=\dim W, a linear map is injective if and only if it is surjective: a kernel of dimension 00 leaves a range of full dimension. If dim⁡V>dim⁡W\dim V>\dim W, the range has dimension at most dim⁡W\dim W, so the kernel is nonzero; for example, a homogeneous system with more unknowns than equations always has a nonzero solution.

A common misreading is to picture kernel and range as two pieces of VV. The kernel lies in VV, but the range lies in WW; only their dimensions add up.


Key Results

  • The theorem is also called the rank-nullity theorem: the rank of A\boldsymbol{A} is dim⁡(range⁡A)\dim(\operatorname{range}\boldsymbol{A}) and its nullity is dim⁡(ker⁡A)\dim(\ker \boldsymbol{A}).
  • It connects injectivity, surjectivity, and dimension for finite-dimensional vector spaces.

Examples

  • If A ⁣:R3→R2\boldsymbol{A}\colon\mathbb{R}^3\to\mathbb{R}^2 has a one-dimensional kernel, then its range has dimension 22.
  • If VV is finite-dimensional, A∈L(V)\boldsymbol{A}\in\mathcal{L}(V) and ker⁡A={0}\ker \boldsymbol{A}=\{\boldsymbol{0}\}, then dim⁡(range⁡A)=dim⁡V\dim(\operatorname{range}\boldsymbol{A})=\dim V, so range⁡A=V\operatorname{range}\boldsymbol{A}=V and A\boldsymbol{A} is bijective.

Prerequisites

Sources

Aliases: rank-nullity theorem, dimension theorem Symbols: element of, real numbers

Last updated: 20 October 2026 03:02