← Back to Math 010

4.8 Row Space, Column Space, and Null Space: Class Notes

Definition

A homogeneous linear system A𝐱=𝟎 and an associated nonhomogeneous system A𝐱=𝐛 are corresponding linear systems.

#28

Find a general solution of the system, and use that solution to find a general solution of the associated homogeneous system and a particular solution of the given system.

[9−3566−2313−1314][x1x2x3x4]=[45−8]

Solution

Using Gauss-Jordan elimination, we find

[9−35646−23153−1314−8]⟶[1−130−1331330019−700000]

If the system were homogeneous (all constants on the right equal to 0), we would have x1=13x2+133x4 and x3=−9x4. Letting x2=s and x4=t, we get

x→=[13100]s+[1330−91]t.

With the constants from b→, we get x1=13x2+133x4+133 and x3=−9x4−7, so

x→=[13100]s+[1330−91]t+[1330−70].

The first two terms are the general solution to the homogeneous system, and the last vector is a particular solution to the nonhomogeneous system, x→p.

Answer:

General solution: x→=[13100]s+[1330−91]t+[1330−70]

Homogeneous system: x→h=[13100]s+[1330−91]t

Particular solution: x→p=[1330−70]

Definition

The solution set of a homogeneous linear system A𝐱=𝟎 is called the general solution. A constant vector 𝐱0 in the solution set of a consistent linear system A𝐱=𝐛 is a particular solution.

Theorem 4.8.2

If 𝐱0 is any solution of a consistent linear system A𝐱=𝐛, and if S={𝐯1,𝐯2,…,𝐯k} is a basis for the null space of A, then every solution of A𝐱=𝐛 can be expressed in the form 𝐱=𝐱0+c1𝐯1+c2𝐯2+…+ck𝐯k. Conversely, for all choices of scalars c1,c2,…,ck, the vector 𝐱 in this formula is a solution of A𝐱=𝐛.

Here 𝐱0 is a particular solution and c1𝐯1+…+ck𝐯k is the general solution of the homogeneous system, as in #28.

Note that the solution set of Ax→=b→ can be considered a translation of the solution space of Ax→=0→ by the particular solution vector.

The vectors in the general solution of the homogeneous system are linearly independent and so form a basis for the null space of the homogeneous system. The general solution of the homogeneous system is denoted by x→h.

Definition

For an m×n matrix

A=[a11a12⋯a1na21a22⋯a2n⋮⋮⋮am1am2⋯amn]

the vectors

𝐫1=[a11a12⋯a1n]𝐫2=[a21a22⋯a2n]⋮𝐫m=[am1am2⋯amn]

in Rn that are formed from the rows of A are called the row vectors of A, and the vectors

𝐜1=[a11a21⋮am1],𝐜2=[a12a22⋮am2],…,𝐜n=[a1na2n⋮amn]

in Rm that are formed from the columns of A are called the column vectors of A.

Definition

If A is an m×n matrix, then the subspace of Rn spanned by the row vectors of A is denoted by row(A) and is called the row space of A, and the subspace of Rm spanned by the column vectors of A is denoted by col(A) and is called the column space of A. The solution space of the homogeneous system of equations A𝐱=𝟎, which is a subspace of Rn, is denoted by null(A) and is called the null space of A.

Theorem 4.8.1

A system of linear equations A𝐱=𝐛 is consistent if and only if 𝐛 is in the column space of A.

Theorem 4.8.3


a) Row equivalent matrices have the same row space.
b) Row equivalent matrices have the same null space.

Theorem 4.8.4

If a matrix R is in row echelon form, then the row vectors with the leading 1’s (the nonzero row vectors) form a basis for the row space of R, and the column vectors with the leading 1’s of the row vectors form a basis for the column space of R.

In exercises 9 and 10, find bases for the null space and row space of A.

#9

b. A=[20−140−2000]

Solution

Subtract 2 times row 1 from row 2:

[20−1000000]

A basis for the row space is (2,0,−1) (from the reduced matrix).

A basis for the null space comes from solving the associated system. The only equation is 2x1−x3=0, so x3=2x1, and x2 is a free variable. With x1=s and x2=t:

x→=[102]s+[010]t

Answer:

Row space basis: {(2,0,−1)}

Null space basis: {[102],[010]}

#10

a. A=[14522130−1322]

Solution

R2→R2−2R1:

(2,1,3,0)+(−2,−8,−10,−4)=(0,−7,−7,−4)

R3→R3+R1:

(−1,3,2,2)+(1,4,5,2)=(0,7,7,4)

The new rows 2 and 3 are negatives of each other, so one of them becomes a zero row:

[145207740000]

The pivot rows are rows 1 and 2. To read off the null space we need rref(A) (or something close to it), so clear the 4 above the second pivot without introducing fractions: R1→7R1−4R2:

(7,28,35,14)−(0,28,28,16)=(7,0,7,−2)

[707−207740000]

Row space basis: {(7,0,7,−2),(0,7,7,4)}.

Dividing each row by 7, x1=−x3+27x4 and x2=−x3−47x4. With x3=s and x4=t:

x→=[−1−110]s+[27−4701]t

Scaling each vector (by −1 and by 7) to clear signs and fractions, a basis for the null space is

{[11−10],[2−407]}.

Answer:

Row space basis: {(7,0,7,−2),(0,7,7,4)}

Null space basis: {[11−10],[2−407]}

Theorem 4.8.5

If A and B are row equivalent matrices, then:
a) A given set of column vectors of A is linearly independent if and only if the corresponding column vectors of B are linearly independent.
b) A given set of column vectors of A forms a basis for the column space of A if and only if the corresponding column vectors of B form a basis for the column space of B.

#15

Find a basis for the subspace of R4 that is spanned by the given vectors.
(1,1,0,0), (0,0,1,1), (−2,0,2,2), (0,−3,0,3)

Solution

Put the vectors in the columns of a matrix and row reduce:

[10−20100−301200123]⟶[10−20012000−23000−3]

⟶[100−30103001−320001]⟶[1000010000100001]

Since all 4 columns have leading 1’s, the given set is the desired basis (by Theorem 4.8.5).

Answer: {(1,1,0,0),(0,0,1,1),(−2,0,2,2),(0,−3,0,3)}

#17

Find a subset of the given vectors that forms a basis for the space spanned by those vectors, and then express each vector that is not in the basis as a linear combination of the basis vectors.
𝐯1=(1,−1,5,2), 𝐯2=(−2,3,1,0), 𝐯3=(4,−5,9,4), 𝐯4=(0,4,2,−3), 𝐯5=(−7,18,2,−8)

Solution

Put the vectors in the columns of a matrix. Row echelon form gives the leading 1’s, in columns 1, 2, and 4:

[1−240−7−13−541851922204−3−8]⟶[10281501−14110001200000]

Basis: {v→1,v→2,v→4}.

Continue to reduced row echelon form, and let the columns of this matrix be denoted by w→1,w→2,w→3,w→4,w→5:

⟶[1020−101−1030001200000]

Reduced row echelon form gives the dependency relationships between the w→i. It turns out these are preserved by elementary row operations. We therefore find

w→3=2w→1−w→2andw→5=−w→1+3w→2+2w→4,

so

v→3=2v→1−v→2andv→5=−v→1+3v→2+2v→4.

Check:

2(1,−1,5,2)−(−2,3,1,0)=(4,−5,9,4)=v→3

−(1,−1,5,2)+3(−2,3,1,0)+2(0,4,2,−3)=(−7,18,2,−8)=v→5

Answer:

Basis: {v→1,v→2,v→4}

v→3=2v→1−v→2

v→5=−v→1+3v→2+2v→4

Definition

An equation that expresses a column vector of a matrix A that does not contain a pivot as a linear combination of column vectors that contain pivots is a dependency equation.

#18

Find a basis for the row space of A that consists entirely of row vectors of A.

A=[14522130−1322]

Solution

The rows of A are the columns of AT, so row reduce AT:

AT=[12−1413532202]⟶[10101−1000000]

The pivots are in columns c→1 and c→2 of AT, so the corresponding rows of A are

Answer: {[1452],[2130]}