## Linear Algebra and Its Applications, Review Exercise 2.32

Review exercise 2.32. a) Find the subspace of $\mathbb{R}^6$ such that for any vector $x$ in the subspace we have $x_1+x_2 = x_3+x_4 = x_5+x_6$.

b) Find a matrix for which this subspace is the nullspace.

c) Find a matrix for which this subspace is the column space.

Answer: a) We have three equations that must be satisfied for any vector $x$ in the subspace:

$\begin{array}{rcrcrcr} x_1&+&x_2&=&x_3&+&x_4 \\ x_3&+&x_4&=&x_5&+&x_6 \\ x_1&+&x_2&=&x_5&+&x_6 \end{array}$

These equations are equivalent to the following linear system

$\begin{array}{rcrcrcrcrcrcr} x_1&+&x_2&-&x_3&-&x_4&&&&&=&0 \\ &&&&x_3&+&x_4&-&x_5&-&x_6&=&0 \\ x_1&+&x_2&&&&&-&x_5&-&x_6&=&0 \end{array}$

which in turn is equivalent to the matrix equation

$\begin{bmatrix} 1&1&-1&-1&0&0 \\ 0&0&1&1&-1&-1 \\ 1&1&0&0&-1&-1 \end{bmatrix} \begin{bmatrix} x_1 \\ x_2 \\ x_3 \\ x_4 \\ x_5 \\ x_6 \end{bmatrix} = 0$

To solve the system we use Gaussian elimination. We first multiply row 1 by 1 and subtract the result from row 3:

$\begin{bmatrix} 1&1&-1&-1&0&0 \\ 0&0&1&1&-1&-1 \\ 1&1&0&0&-1&-1 \end{bmatrix} \Rightarrow \begin{bmatrix} 1&1&-1&-1&0&0 \\ 0&0&1&1&-1&-1 \\ 0&0&1&1&-1&-1 \end{bmatrix}$

Then we multiply row 2 by 1 and subtract the result from row 3:

$\begin{bmatrix} 1&1&-1&-1&0&0 \\ 0&0&1&1&-1&-1 \\ 0&0&1&1&-1&-1 \end{bmatrix} \Rightarrow \begin{bmatrix} 1&1&-1&-1&0&0 \\ 0&0&1&1&-1&-1 \\ 0&0&0&0&0&0 \end{bmatrix}$

The resulting echelon matrix has pivots in columns 1 and 3, so $x_1$ and $x_3$ are basic variables and $x_2$, $x_4$, $x_5$, and $x_6$ are free variables.

We first set $x_2 = 1$ and $x_4 = x_5 = x_6 = 0$. From the second row of the echelon matrix we have $x_3 + x_4 - x_5 - x_6 = x_3 + 0 - 0 - 0 = 0$ or $x_3 = 0$. From the first row we have $x_1 + x_2 - x_3 - x_4 = x_1 + 1 - 0 - 0 = 0$ or $x_1 = -1$. One solution to the system is thus $(-1, 1, 0, 0, 0, 0)$.

We next set $x_4 = 1$ and $x_2 = x_5 = x_6 = 0$. From the second row of the echelon matrix we have $x_3 + x_4 - x_5 - x_6 = x_3 + 1 - 0 - 0 = 0$ or $x_3 = -1$. From the first row we have $x_1 + x_2 - x_3 - x_4 = x_1 + 0 + 1 - 1 = 0$ or $x_1 = 0$. A second solution to the system is thus $(0, 0, -1, 1, 0, 0)$.

We next set $x_5 = 1$ and $x_2 = x_4 = x_6 = 0$. From the second row of the echelon matrix we have $x_3 + x_4 - x_5 - x_6 = x_3 + 0 - 1 - 0 = 0$ or $x_3 = 1$. From the first row we have $x_1 + x_2 - x_3 - x_4 = x_1 + 0 - 1 + 0 = 0$ or $x_1 = 1$. A third solution to the system is thus $(1, 0, 1, 0, 1, 0)$.

Finally we set $x_6 = 1$ and $x_2 = x_4 = x_5 = 0$. From the second row of the echelon matrix we have $x_3 + x_4 - x_5 - x_6 = x_3 + 0 - 0 - 1 = 0$ or $x_3 = 1$. From the first row we have $x_1 + x_2 - x_3 - x_4 = x_1 + 0 - 1 - 0 = 0$ or $x_1 = 1$. A fourth and final solution to the system is thus $(1, 0, 1, 0, 0, 1)$.

Any linear combination of the four solution vectors is also a solution to the original system, and is thus in the subspace also. The four solution vectors together constitute a basis for the subspace:

$\begin{bmatrix} -1 \\ 1 \\ 0 \\ 0 \\ 0 \\ 0 \end{bmatrix} \qquad \begin{bmatrix} 0 \\ 0 \\ -1 \\ 1 \\ 0 \\ 0 \end{bmatrix} \qquad \begin{bmatrix} 1 \\ 0 \\ 1 \\ 0 \\ 1 \\ 0 \end{bmatrix} \qquad \begin{bmatrix} 1 \\ 0 \\ 1 \\ 0 \\ 0 \\ 1 \end{bmatrix}$

b) In solving the matrix equation

$\begin{bmatrix} 1&1&-1&-1&0&0 \\ 0&0&1&1&-1&-1 \\ 1&1&0&0&-1&-1 \end{bmatrix} \begin{bmatrix} x_1 \\ x_2 \\ x_3 \\ x_4 \\ x_5 \\ x_6 \end{bmatrix} = 0$

the solutions we found are in the nullspace of the matrix

$A = \begin{bmatrix} 1&1&-1&-1&0&0 \\ 0&0&1&1&-1&-1 \\ 1&1&0&0&-1&-1 \end{bmatrix}$

Since the solutions formed a basis for the subspace, any vector in the subspace is in the nullspace of the matrix. Similarly any vector in the nullspace is in the subspace as well.

(Either a vector in the nullspace is a linear combination of the four basis vectors above or it is not. In the former case the vector is in the subspace. In the latter case the vector is linearly independent of the four basis vectors. But this is impossible since the matrix has two pivots and thus rank $r = 2$, the dimension of the nullspace is $6-2 = 4$, and there cannot be more than four linearly independent vectors in the nullspace.)

Since every vector in the subspace is in the nullspace of $A$ and every vector in the nullspace of $A$ is in the subspace, the subspace is equal to the nullspace of $A$.

Note that the subspace is also the nullspace of the echelon matrix

$B = \begin{bmatrix} 1&1&-1&-1&0&0 \\ 0&0&1&1&-1&-1 \end{bmatrix}$

This is the same as the echelon matrix found via Gaussian elimination, with the last row of zeros removed.

c) We can construct a matrix $C$ whose column space is the subspace simply by setting the columns of $C$ to be the basis vectors of the subspace:

$C = \begin{bmatrix} -1&0&1&1 \\ 1&0&0&0 \\ 0&-1&1&1 \\ 0&1&0&0 \\ 0&0&1&0 \\ 0&0&0&1 \end{bmatrix}$

NOTE: This continues a series of posts containing worked out exercises from the (out of print) book Linear Algebra and Its Applications, Third Edition by Gilbert Strang.

If you find these posts useful I encourage you to also check out the more current Linear Algebra and Its Applications, Fourth Edition, Dr Strang’s introductory textbook Introduction to Linear Algebra, Fourth Edition and the accompanying free online course, and Dr Strang’s other books.

This entry was posted in linear algebra and tagged , , . Bookmark the permalink.

### 2 Responses to Linear Algebra and Its Applications, Review Exercise 2.32

1. Kenny says:

Hi, I think this question is asking me whether these vectors are subspaces of R^3 right? if so, i think a to e are all subspace.

Which of the following subsets of R3 are actually subspaces?
(a) The plane of vectors (b1, b2, b3) with first component b1=0.
(b) The plane of vectors b with b1=1.
(c) The vectors b with b2*b3=0
(d) All combinations of two given voctors (1, 1, 0) and (2, 0, 1).
(e) The plane of vectors (b1, b2, b3) that satisfy b1-b2+3b3=0

• hecker says:

Apologies for the delay in responding. First, you can send questions like this to me via email. Second, recall that a subspace has to be a vector space, which means that 1) the sum of two vectors in the space is also a vector in the space, and 2) a scalar value times any vector in the space is also a vector in the space. As a consequence of part (2), all subspaces have to contain the zero vector, and a consequence of parts (1) and (2) taken together, if v1 and v2 are vectors in the space and c1 and c2 are scalar values, then any vector of the form c1v1 + c2v2 (a linear combination of v1 and v2) also has to be in the space.

So, given the above, here are some hints for answering these questions: (a) If you take two vectors of the form (0, b2, b3) and add them, is the result also in the plane? What if you multiply by any number, including zero?

(b) Similar tests as (a). In particular, is the zero vector (0, 0, 0) in the plane?

(c) Suppose we have vector b = (b1, b2, b3) with b2*b3 = 0 and vector d = (d1, d2, d3) with d2*d3 = 0. Consider the sum b+d = (b1+d1, b2+d2, b3+d3). Is this vector in the same set as the others? In other words, do we have (b2+d2)*(b3+d3) = 0?

(d) By combinations we mean “linear combinations”, in other words all vectors of the form c1*(1, 1, 0) + c2*(2, 0, 1). If you add two vectors of this form, is the result also a linear combination of (1, 1, 0) and (2, 0, 1)?

(e) Similar problem to (c): You take a vector b = (b1, b2, b3) with b1 – b2 + 3b3 = 0 and a vector d = (d1, d2, d3) with d1 – d2 + 3d3 = 0, and then test if the sum b+d satisfies the same condition.