4.15 The rank-nullity theorem

4.15.1 Definition of rank and nullity

Definition 4.15.1.

Let T:V→W be a linear map.

  • •

    The nullity of T, written null⁡T, is dimker⁡T.

  • •

    The rank of T, written rank⁡T is dimim⁡T.

Example 4.15.1.

Returning to the differentiation example from the start of section 4.13.3, D:ℝ⩽n⁢[x]→ℝ⩽n⁢[x] has nullity 1 (since its kernel was one-dimensional, spanned by the constant polynomial 1) and rank n, since its image had a basis 1,x,…,xn−1 of size n. Notice that rank⁡(D)+null⁡(D)=dimℝ⩽n⁢[x], this isn’t a coincidence.

4.15.2 Statement of the rank-nullity theorem

Theorem 4.15.1.

Let T:V→W be a linear map. Then

rank⁡T+null⁡T=dimV.

This is called the rank-nullity theorem.

Proof.

We’ll assume V and W are finite-dimensional, not that it matters. Here is an outline of how the proof is going to work.

  1. 1.

    Choose a basis 𝒦=𝐤1,…,𝐤m of ker⁡T

  2. 2.

    Extend it to a basis ℬ=𝐤1,…,𝐤m,𝐯1,…,𝐯n of V using Proposition 4.11.2. When we’ve done this, dimV=m+n and we need only show dimim⁡T=n)

  3. 3.

    Show that T⁢(𝐯1),…,T⁢(𝐯n) is a basis of im⁡T.

The only part needing elaboration is the last part. First, let’s show that the sequence T⁢(𝐯1),…,T⁢(𝐯n) spans im⁡T. Any element of the image is equal to T⁢(𝐯) for some 𝐯∈V. We have to show that any such T⁢(𝐯) lies in the span of the T⁢(𝐯i)s.

Since ℬ is a basis of V we may write 𝐯 as ∑i=1mλi⁢𝐤i+∑i=1nμi⁢𝐯i for some scalars λi,μi. Then

T⁢(𝐯) =T⁢(∑i=1mλi⁢𝐤i+∑i=1nμi⁢𝐯i)
=∑i=1mλi⁢T⁢(𝐤i)+∑i=1nμi⁢T⁢(𝐯i) by linearity
=∑i=1nμi⁢T⁢(𝐯i) as ⁢𝐤i∈ker⁡T
∈span⁡(T⁢(𝐯1),…,T⁢(𝐯n))

as required.

Now let’s show T⁢(𝐯1),…,T⁢(𝐯n) is linearly independent. Suppose

∑i=1nμi⁢T⁢(𝐯i)=0,

so that we need to show the μi are all 0. Using linearity,

T⁢(∑i=1nμi⁢𝐯i)=0

which means ∑i=1nμi⁢𝐯i∈ker⁡T. As 𝒦 is a basis for ker⁡T, we can write

∑i=1nμi⁢𝐯i=∑i=1mλi⁢𝐤i

for some scalars λi. But ℬ, being a basis, is linearly independent and so all the scalars are 0. In particular all the μi are 0, which completes the proof. ∎

We can use the