4 Linear algebra

4.11 Fundamental solutions are linearly independent

In this section we are going to do an extended example on solutions to a homogeneous matrix equation A𝐱=𝟎, where A is some fixed m×n matrix with entries from a field 𝔽. We will prove that the fundamental solutions constructed in 3.11.1 are a basis of the nullspace N(A).

Here is a recap of how the fundamental solutions to A𝐱=𝟎 are obtained. First do row operations to A until we reach a matrix R in row reduced echelon form, and recall that the solutions to A𝐱=𝟎 are exactly the same as the solutions to R𝐱=𝟎, that is, N(A)=N(R). 11 1 It is not true that the column space C(A) equals C(R). Row operations don’t change the nullspace but they can change the column space. Let r be the number of nonzero rows in R, which is the number of columns containing a leading entry, and let k be the number of columns with no leading entry, so that r+k=n. Let the numbers of the columns with a leading entry be c1<c2<<cr and the columns with no leading entry be d1<d2<<dk. Returning to the example

R=(012030001400000)

we have m=3,n=5,r=2,c1=2,c2=4,d1=1,d2=3,d3=5. In general, there are k fundamental solutions 𝐬1,,𝐬k defined by

𝐬j=𝐞dji=1rri,dj𝐞ci

where 𝐞l is the column vector with a 1 at position l and zeros elsewhere and R=(rij). In other words, the row dj entry of 𝐬j is 1, the entry in row ci is ri,dj for 1ir, and all other entries are 0. In the example,

𝐬1=(10000),𝐬2=(02100),𝐬3=(03041).

It’s useful to record a general lemma.

Lemma 4.11.1.

(The easy linear independence criterion). Suppose some column vectors 𝐯1,,𝐯k have the property that for each i, 𝐯i has a nonzero entry in a row where all the other 𝐯js have zero. Then 𝐯1,,𝐯k is linearly independent.

For example, if

𝐯1=(1003),𝐯2=(4500),𝐯3=(7080)

then 𝐯1 has a nonzero entry in row 4 while the other two vectors are zero in row 4, 𝐯2 has a nonzero entry in row 2 while the other two vectors are zero in row 2, and 𝐯3 has a nonzero entry in row 3 while the other two vectors are zero in row 3, so these three vectors meet the easy linear independence criterion.

Proof.

Suppose that

i=1kλi𝐯i=𝟎. (4.6)

There is a row, say row j, where 𝐯1 has a nonzero entry v1j and all of 𝐯2,,𝐯k are zero. Comparing the entries of row j in (4.6) gives λ1v1j=0 and so λ1=0. A similar argument shows all the other λi are zero, so the vectors are linearly independent. ∎

To illustrate the proof, return to the example above. Suppose

a𝐯1+b𝐯2+c𝐯3=𝟎.

Rather than write out the resulting vector, just think about what appears in row 4 on the left hand side. Vectors 𝐯2 and 𝐯3 are zero there, so we just get 3a=0 and so a=0. Considering row 2 shows b=0 and considering row 3 shows c=0, therefore they are linearly independent.

Lemma 4.11.2.

The fundamental solutions to A𝐱=𝟎 are linearly independent.

Proof.

Apply the easy linear independence lemma above, using row di for 𝐬i. The criterion applies because no di is equal to any cj or any other dj. ∎

It is also true that the fundamental solutions span the null space N(A), so that they are a basis. We could do a direct proof of this now, but it would be messy. Instead we will return to it later when we have the technology to make it easy.