From A First Course in Linear Algebra
Version 2.11
© 2004.
Licensed under the GNU Free Documentation License.
http://linear.ups.edu/
A subspace is a vector space that is contained within another vector space. So
every subspace is a vector space in its own right, but it is also defined relative to
some other (larger) vector space. We will discover shortly that we are already
familiar with a wide variety of subspaces from previous sections. Here’s the
definition.
Definition S
Subspace
Suppose that V
and W are two
vector spaces that have identical definitions of vector addition and scalar multiplication,
and that W is
a subset of V ,
W ⊆ V . Then
W is a
subspace of V .
△
Lets look at an example of a vector space inside another vector space.
Example SC3
A subspace of {ℂ}^{3}
We know that {ℂ}^{3}
is a vector space (Example VSCV). Consider the subset,
W = \left \{\left [\array{
{x}_{1}
\cr
{x}_{2}
\cr
{x}_{3} } \right ]\mathrel{∣}2{x}_{1} − 5{x}_{2} + 7{x}_{3} = 0\right \}

It is clear that W ⊆ {ℂ}^{3}, since the objects in W are column vectors of size 3. But is W a vector space? Does it satisfy the ten properties of Definition VS when we use the same operations? That is the main question. Suppose x = \left [\array{ {x}_{1} \cr {x}_{2} \cr {x}_{3} } \right ]and y = \left [\array{ {y}_{1} \cr {y}_{2} \cr {y}_{3} } \right ]are vectors from W. Then we know that these vectors cannot be totally arbitrary, they must have gained membership in W by virtue of meeting the membership test. For example, we know that x must satisfy 2{x}_{1} − 5{x}_{2} + 7{x}_{3} = 0 while y must satisfy 2{y}_{1} − 5{y}_{2} + 7{y}_{3} = 0. Our first property (Property AC) asks the question, is x + y ∈ W? When our set of vectors was {ℂ}^{3}, this was an easy question to answer. Now it is not so obvious. Notice first that
x+y = \left [\array{
{x}_{1}
\cr
{x}_{2}
\cr
{x}_{3} } \right ]+\left [\array{
{y}_{1}
\cr
{y}_{2}
\cr
{y}_{3} } \right ] = \left [\array{
{x}_{1} + {y}_{1}
\cr
{x}_{2} + {y}_{2}
\cr
{x}_{3} + {y}_{3} } \right ]

and we can test this vector for membership in W as follows,
and by this computation we see that x + y ∈ W. One property down, nine to go.
If α is a scalar and x ∈ W, is it always true that αx ∈ W? This is what we need to establish Property SC. Again, the answer is not as obvious as it was when our set of vectors was all of {ℂ}^{3}. Let’s see.
αx = α\left [\array{
{x}_{1}
\cr
{x}_{2}
\cr
{x}_{3} } \right ] = \left [\array{
α{x}_{1}
\cr
α{x}_{2}
\cr
α{x}_{3} } \right ]

and we can test this vector for membership in W with
and we see that indeed αx ∈ W. Always.
If W has a zero vector, it will be unique (Theorem ZVU). The zero vector for {ℂ}^{3} should also perform the required duties when added to elements of W. So the likely candidate for a zero vector in W is the same zero vector that we know {ℂ}^{3} has. You can check that 0 = \left [\array{ 0\cr 0 \cr 0 } \right ] is a zero vector in W too (Property Z).
With a zero vector, we can now ask about additive inverses (Property AI). As you might suspect, the natural candidate for an additive inverse in W is the same as the additive inverse from {ℂ}^{3}. However, we must insure that these additive inverses actually are elements of W. Given x ∈ W, is −x ∈ W?
−x = \left [\array{
−{x}_{1}
\cr
−{x}_{2}
\cr
−{x}_{3} } \right ]

and we can test this vector for membership in W with
and we now believe that −x ∈ W.
Is the vector addition in W commutative (Property C)? Is x + y = y + x? Of course! Nothing about restricting the scope of our set of vectors will prevent the operation from still being commutative. Indeed, the remaining five properties are unaffected by the transition to a smaller set of vectors, and so remain true. That was convenient.
So W satisfies all ten properties, is therefore a vector space, and thus earns the title of being a subspace of {ℂ}^{3}. ⊠
In Example SC3 we proceeded through all ten of the vector space properties before believing that a subset was a subspace. But six of the properties were easy to prove, and we can lean on some of the properties of the vector space (the superset) to make the other four easier. Here is a theorem that will make it easier to test if a subset is a vector space. A shortcut if there ever was one.
Theorem TSS
Testing Subsets for Subspaces
Suppose that V is a
vector space and W
is a subset of V ,
W ⊆ V . Endow
W with the same
operations as V .
Then W
is a subspace if and only if three conditions are met
Proof ( ⇒) We have the hypothesis that W is a subspace, so by Definition VS we know that W contains a zero vector. This is enough to show that W\mathrel{≠}∅. Also, since W is a vector space it satisfies the additive and scalar multiplication closure properties, and so exactly meets the second and third conditions. If that was easy, the the other direction might require a bit more work.
( ⇐) We have three properties for our hypothesis, and from this we should conclude that W has the ten defining properties of a vector space. The second and third conditions of our hypothesis are exactly Property AC and Property SC. Our hypothesis that V is a vector space implies that Property C, Property AA, Property SMA, Property DVA, Property DSA and Property O all hold. They continue to be true for vectors from W since passing to a subset, and keeping the operation the same, leaves their statements unchanged. Eight down, two to go.
Suppose x ∈ W. Then by the third part of our hypothesis (scalar closure), we know that (−1)x ∈ W. By Theorem AISM (−1)x = −x, so together these statements show us that −x ∈ W. −x is the additive inverse of x in V , but will continue in this role when viewed as element of the subset W. So every element of W has an additive inverse that is an element of W and Property AI is completed. Just one property left.
While we have implicitly discussed the zero vector in the previous paragraph, we need to be certain that the zero vector (of V ) really lives in W. Since W is nonempty, we can choose some vector z ∈ W. Then by the argument in the previous paragraph, we know −z ∈ W. Now by Property AI for V and then by the second part of our hypothesis (additive closure) we see that
0 = z + (−z) ∈ W

So W contain the zero vector from V . Since this vector performs the required duties of a zero vector in V , it will continue in that role as an element of W. This gives us, Property Z, the final property of the ten required. (Sarah Fellez contributed to this proof.) ■
So just three conditions, plus being a subset of a known vector space, gets us all ten properties. Fabulous! This theorem can be paraphrased by saying that a subspace is “a nonempty subset (of a vector space) that is closed under vector addition and scalar multiplication.”
You might want to go back and rework Example SC3 in light of this result, perhaps seeing where we can now economize or where the work done in the example mirrored the proof and where it did not. We will press on and apply this theorem in a slightly more abstract setting.
Example SP4
A subspace of {P}_{4}
{P}_{4}
is the vector space of polynomials with degree at most
4 (Example VSP).
Define a subset W
as
W = \left \{p(x)\mathrel{∣}p ∈ {P}_{4},\ p(2) = 0\right \}

so W is the collection of those polynomials (with degree 4 or less) whose graphs cross the xaxis at x = 2. Whenever we encounter a new set it is a good idea to gain a better understanding of the set by finding a few elements in the set, and a few outside it. For example {x}^{2} − x − 2 ∈ W, while {x}^{4} + {x}^{3} − 7∉W.
Is W nonempty? Yes, x − 2 ∈ W.
Additive closure? Suppose p ∈ W and q ∈ W. Is p + q ∈ W? p and q are not totally arbitrary, we know that p(2) = 0 and q(2) = 0. Then we can check p + q for membership in W,
so we see that p + q qualifies for membership in W.
Scalar multiplication closure? Suppose that α ∈ {ℂ}^{} and p ∈ W. Then we know that p(2) = 0. Testing αp for membership,
so αp ∈ W.
We have shown that W meets the three conditions of Theorem TSS and so qualifies as a subspace of {P}_{4}. Notice that by Definition S we now know that W is also a vector space. So all the properties of a vector space (Definition VS) and the theorems of Section VS apply in full. ⊠
Much of the power of Theorem TSS is that we can easily establish new vector spaces if we can locate them as subsets of other vector spaces, such as the ones presented in Subsection VS.EVS.
It can be as instructive to consider some subsets that are not subspaces. Since Theorem TSS is an equivalence (see Technique E) we can be assured that a subset is not a subspace if it violates one of the three conditions, and in any example of interest this will not be the “nonempty” condition. However, since a subspace has to be a vector space in its own right, we can also search for a violation of any one of the ten defining properties in Definition VS or any inherent property of a vector space, such as those given by the basic theorems of Subsection VS.VSP. Notice also that a violation need only be for a specific vector or pair of vectors.
Example NSC2Z
A nonsubspace in {ℂ}^{2},
zero vector
Consider the subset W
below as a candidate for being a subspace of
{ℂ}^{2}
W = \left \{\left [\array{
{x}_{1}
\cr
{x}_{2} } \right ]\mathrel{∣}3{x}_{1} − 5{x}_{2} = 12\right \}

The zero vector of {ℂ}^{2}, 0 = \left [\array{ 0\cr 0 } \right ]will need to be the zero vector in W also. However, 0∉W since 3(0) − 5(0) = 0\mathrel{≠}12. So W has no zero vector and fails Property Z of Definition VS. This subspace also fails to be closed under addition and scalar multiplication. Can you find examples of this? ⊠
Example NSC2A
A nonsubspace in {ℂ}^{2},
additive closure
Consider the subset X
below as a candidate for being a subspace of
{ℂ}^{2}
X = \left \{\left [\array{
{x}_{1}
\cr
{x}_{2} } \right ]\mathrel{∣}{x}_{1}{x}_{2} = 0\right \}

You can check that 0 ∈ X, so the approach of the last example will not get us anywhere. However, notice that x = \left [\array{ 1\cr 0 } \right ] ∈ X and y = \left [\array{ 0\cr 1 } \right ] ∈ X. Yet
x+y = \left [\array{
1\cr
0 } \right ]+\left [\array{
0\cr
1 } \right ] = \left [\array{
1\cr
1 } \right ]∉X

So X fails the additive closure requirement of either Property AC or Theorem TSS, and is therefore not a subspace. ⊠
Example NSC2S
A nonsubspace in {ℂ}^{2},
scalar multiplication closure
Consider the subset Y
below as a candidate for being a subspace of
{ℂ}^{2}
Y = \left \{\left [\array{
{x}_{1}
\cr
{x}_{2} } \right ]\mathrel{∣}{x}_{1} ∈ ℤ,\kern 1.95872pt {x}_{2} ∈ ℤ\right \}

ℤ is the set of integers, so we are only allowing “whole numbers” as the constituents of our vectors. Now, 0 ∈ Y , and additive closure also holds (can you prove these claims?). So we will have to try something different. Note that α = {1\over 2} ∈ {ℂ}^{} and \left [\array{ 2\cr 3 } \right ] ∈ Y , but
αx = {1\over
2}\left [\array{
2\cr
3 } \right ] = \left [\array{
1\cr
{3\over
2} } \right ]∉Y

So Y fails the scalar multiplication closure requirement of either Property SC or Theorem TSS, and is therefore not a subspace. ⊠
There are two examples of subspaces that are trivial. Suppose that V is any vector space. Then V is a subset of itself and is a vector space. By Definition S, V qualifies as a subspace of itself. The set containing just the zero vector Z = \left \{0\right \} is also a subspace as can be seen by applying Theorem TSS or by simple modifications of the techniques hinted at in Example VSS. Since these subspaces are so obvious (and therefore not too interesting) we will refer to them as being trivial.
Definition TS
Trivial Subspaces
Given the vector space V ,
the subspaces V and
\left \{0\right \} are each called a
trivial subspace. △
We can also use Theorem TSS to prove more general statements about subspaces, as illustrated in the next theorem.
Theorem NSMS
Null Space of a Matrix is a Subspace
Suppose that A is
an m × n matrix. Then
the null space of A,
N\kern 1.95872pt \left (A\right ), is a
subspace of {ℂ}^{n}.
□
Proof We will examine the three requirements of Theorem TSS. Recall that N\kern 1.95872pt \left (A\right ) = \left \{x ∈ {ℂ}^{n}\mathrel{∣}Ax = 0\right \}.
First, 0 ∈N\kern 1.95872pt \left (A\right ), which can be inferred as a consequence of Theorem HSC. So N\kern 1.95872pt \left (A\right )\mathrel{≠}∅.
Second, check additive closure by supposing that x ∈N\kern 1.95872pt \left (A\right ) and y ∈N\kern 1.95872pt \left (A\right ). So we know a little something about x and y: Ax = 0 and Ay = 0, and that is all we know. Question: Is x + y ∈N\kern 1.95872pt \left (A\right )? Let’s check.
So, yes, x + y qualifies for membership in N\kern 1.95872pt \left (A\right ).
Third, check scalar multiplication closure by supposing that α ∈ {ℂ}^{} and x ∈N\kern 1.95872pt \left (A\right ). So we know a little something about x: Ax = 0, and that is all we know. Question: Is αx ∈N\kern 1.95872pt \left (A\right )? Let’s check.
So, yes, αx qualifies for membership in N\kern 1.95872pt \left (A\right ).
Having met the three conditions in Theorem TSS we can now say that the null space of a matrix is a subspace (and hence a vector space in its own right!). ■
Here is an example where we can exercise Theorem NSMS.
Example RSNS
Recasting a subspace as a null space
Consider the subset of {ℂ}^{5}
defined as
W = \left \{\left [\array{
{x}_{1}
\cr
{x}_{2}
\cr
{x}_{3}
\cr
{x}_{4}
\cr
{x}_{5} } \right ]\mathrel{∣}\array{
3{x}_{1} + {x}_{2} − 5{x}_{3} + 7{x}_{4} + {x}_{5} = 0,
\cr
4{x}_{1} + 6{x}_{2} + 3{x}_{3} − 6{x}_{4} − 5{x}_{5} = 0,
\cr
− 2{x}_{1} + 4{x}_{2} + 7{x}_{4} + {x}_{5} = 0 } \right \}

It is possible to show that W is a subspace of {ℂ}^{5} by checking the three conditions of Theorem TSS directly, but it will get tedious rather quickly. Instead, give W a fresh look and notice that it is a set of solutions to a homogeneous system of equations. Define the matrix
A = \left [\array{
3 &1&−5& 7 & 1\cr
4 &6 & 3 &−6 &−5
\cr
−2&4& 0 & 7 & 1 } \right ]

and then recognize that W = N\kern 1.95872pt \left (A\right ). By Theorem NSMS we can immediately see that W is a subspace. Boom! ⊠
The span of a set of column vectors got a heavy workout in Chapter V and Chapter M. The definition of the span depended only on being able to formulate linear combinations. In any of our more general vector spaces we always have a definition of vector addition and of scalar multiplication. So we can build linear combinations and manufacture spans. This subsection contains two definitions that are just mild variants of definitions we have seen earlier for column vectors. If you haven’t already, compare them with Definition LCCV and Definition SSCV.
Definition LC
Linear Combination
Suppose that V is a
vector space. Given n
vectors {u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{n}
and n
scalars {α}_{1},\kern 1.95872pt {α}_{2},\kern 1.95872pt {α}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {α}_{n},
their linear combination is the vector
{α}_{1}{u}_{1} + {α}_{2}{u}_{2} + {α}_{3}{u}_{3} + \mathrel{⋯} + {α}_{n}{u}_{n}.

Example LCM
A linear combination of matrices
In the vector space {M}_{23}
of 2 × 3
matrices, we have the vectors
and we can form linear combinations such as
When we realize that we can form linear combinations in any vector space, then it is natural to revisit our definition of the span of a set, since it is the set of all possible linear combinations of a set of vectors.
Definition SS
Span of a Set
Suppose that V is a vector
space. Given a set of vectors S = \{{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{t}\},
their span, \left \langle S\right \rangle ,
is the set of all possible linear combinations of
{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{t}.
Symbolically,
Theorem SSS
Span of a Set is a Subspace
Suppose V is a vector space.
Given a set of vectors S = \{{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{t}\} ⊆ V ,
their span, \left \langle S\right \rangle , is
a subspace. □
Proof We will verify the three conditions of Theorem TSS. First,
So we have written 0 as a linear combination of the vectors in S and by Definition SS, 0 ∈\left \langle S\right \rangle and therefore S\mathrel{≠}∅.
Second, suppose x ∈\left \langle S\right \rangle and y ∈\left \langle S\right \rangle . Can we conclude that x + y ∈\left \langle S\right \rangle ? What do we know about x and y by virtue of their membership in \left \langle S\right \rangle ? There must be scalars from {ℂ}^{}, {α}_{1},\kern 1.95872pt {α}_{2},\kern 1.95872pt {α}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {α}_{t} and {β}_{1},\kern 1.95872pt {β}_{2},\kern 1.95872pt {β}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {β}_{t} so that
Then
Since each {α}_{i} + {β}_{i} is again a scalar from {ℂ}^{} we have expressed the vector sum x + y as a linear combination of the vectors from S, and therefore by Definition SS we can say that x + y ∈\left \langle S\right \rangle .
Third, suppose α ∈ {ℂ}^{} and x ∈\left \langle S\right \rangle . Can we conclude that αx ∈\left \langle S\right \rangle ? What do we know about x by virtue of its membership in \left \langle S\right \rangle ? There must be scalars from {ℂ}^{}, {α}_{1},\kern 1.95872pt {α}_{2},\kern 1.95872pt {α}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {α}_{t} so that
Then
Since each α{α}_{i} is again a scalar from {ℂ}^{} we have expressed the scalar multiple αx as a linear combination of the vectors from S, and therefore by Definition SS we can say that αx ∈\left \langle S\right \rangle .
With the three conditions of Theorem TSS met, we can say that \left \langle S\right \rangle is a subspace (and so is also vector space, Definition VS). (See Exercise SS.T20, Exercise SS.T21, Exercise SS.T22.) ■
Example SSP
Span of a set of polynomials
In Example SP4 we proved that
W = \left \{p(x)\mathrel{∣}p ∈ {P}_{4},\ p(2) = 0\right \}

is a subspace of {P}_{4}, the vector space of polynomials of degree at most 4. Since W is a vector space itself, let’s construct a span within W. First let
S = \left \{{x}^{4} − 4{x}^{3} + 5{x}^{2} − x − 2,\kern 1.95872pt 2{x}^{4} − 3{x}^{3} − 6{x}^{2} + 6x + 4\right \}

and verify that S is a subset of W by checking that each of these two polynomials has x = 2 as a root. Now, if we define U = \left \langle S\right \rangle , then Theorem SSS tells us that U is a subspace of W. So quite quickly we have built a chain of subspaces, U inside W, and W inside {P}_{4}.
Rather than dwell on how quickly we can build subspaces, let’s try to gain a better understanding of just how the span construction creates subspaces, in the context of this example. We can quickly build representative elements of U,
3({x}^{4}−4{x}^{3}+5{x}^{2}−x−2)+5(2{x}^{4}−3{x}^{3}−6{x}^{2}+6x+4) = 13{x}^{4}−27{x}^{3}−15{x}^{2}+27x+14

and
(−2)({x}^{4}−4{x}^{3}+5{x}^{2}−x−2)+8(2{x}^{4}−3{x}^{3}−6{x}^{2}+6x+4) = 14{x}^{4}−16{x}^{3}−58{x}^{2}+50x+36

and each of these polynomials must be in W since it is closed under addition and scalar multiplication. But you might check for yourself that both of these polynomials have x = 2 as a root.
I can tell you that y = 3{x}^{4} − 7{x}^{3} − {x}^{2} + 7x − 2 is not in U, but would you believe me? A first check shows that y does have x = 2 as a root, but that only shows that y ∈ W. What does y have to do to gain membership in U = \left \langle S\right \rangle ? It must be a linear combination of the vectors in S, {x}^{4} − 4{x}^{3} + 5{x}^{2} − x − 2 and 2{x}^{4} − 3{x}^{3} − 6{x}^{2} + 6x + 4. So let’s suppose that y is such a linear combination,
Notice that operations above are done in accordance with the definition of the vector space of polynomials (Example VSP). Now, if we equate coefficients, which is the definition of equality for polynomials, then we obtain the system of five linear equations in two variables
Build an augmented matrix from the system and rowreduce,
\left [\array{
1 & 2 & 3\cr
−4 &−3 &−7
\cr
5 &−6&−1\cr
−1 & 6 & 7
\cr
−2& 4 &−2 } \right ]\mathop{\longrightarrow}\limits_{}^{\text{RREF}}\left [\array{
\text{1}&0&0\cr
0&\text{1 } &0
\cr
0&0&\text{1}\cr
0&0 &0
\cr
0&0&0} \right ]

With a leading 1 in the final column of the rowreduced augmented matrix, Theorem RCLS tells us the system of equations is inconsistent. Therefore, there are no scalars, {α}_{1} and {α}_{2}, to establish y as a linear combination of the elements in U. So y∉U. ⊠
Let’s again examine membership in a span.
Example SM32
A subspace of {M}_{32}
The set of all 3 × 2
matrices forms a vector space when we use the operations of matrix addition
(Definition MA) and scalar matrix multiplication (Definition MSM), as was show
in Example VSM. Consider the subset
S = \left \{\left [\array{
3& 1\cr
4& 2
\cr
5&−5 } \right ],\kern 1.95872pt \left [\array{
1 & 1\cr
2 &−1
\cr
14&−1 } \right ],\kern 1.95872pt \left [\array{
3 & −1\cr
−1 & 2
\cr
−19&−11 } \right ],\kern 1.95872pt \left [\array{
4 & 2\cr
1 &−2
\cr
14&−2 } \right ],\kern 1.95872pt \left [\array{
3 &1\cr
−4 &0
\cr
−17&7 } \right ]\right \}

and define a new subset of vectors W in {M}_{32} using the span (Definition SS), W = \left \langle S\right \rangle . So by Theorem SSS we know that W is a subspace of {M}_{32}. While W is an infinite set, and this is a precise description, it would still be worthwhile to investigate whether or not W contains certain elements.
First, is
y = \left [\array{
9 & 3\cr
7 & 3
\cr
10&−11 } \right ]

in W? To answer this, we want to determine if y can be written as a linear combination of the five matrices in S. Can we find scalars, {α}_{1},\kern 1.95872pt {α}_{2},\kern 1.95872pt {α}_{3},\kern 1.95872pt {α}_{4},\kern 1.95872pt {α}_{5} so that
Using our definition of matrix equality (Definition ME) we can translate this statement into six equations in the five unknowns,
This is a linear system of equations, which we can represent with an augmented matrix and rowreduce in search of solutions. The matrix that is rowequivalent to the augmented matrix is
\left [\array{
\text{1}&0&0&0& {5\over
8} & 2
\cr
0&\text{1}&0&0&{−19\over
4} &−1
\cr
0&0&\text{1}&0& {−7\over
8} & 0
\cr
0&0&0&\text{1}& {17\over
8} & 1\cr
0&0 &0 &0 & 0 & 0
\cr
0&0&0&0& 0 & 0 } \right ]

So we recognize that the system is consistent since there is no leading 1 in the final column (Theorem RCLS), and compute n − r = 5 − 4 = 1 free variables (Theorem FVCS). While there are infinitely many solutions, we are only in pursuit of a single solution, so let’s choose the free variable {α}_{5} = 0 for simplicity’s sake. Then we easily see that {α}_{1} = 2, {α}_{2} = −1, {α}_{3} = 0, {α}_{4} = 1. So the scalars {α}_{1} = 2, {α}_{2} = −1, {α}_{3} = 0, {α}_{4} = 1, {α}_{5} = 0 will provide a linear combination of the elements of S that equals y, as we can verify by checking,
So with one particular linear combination in hand, we are convinced that y deserves to be a member of W = \left \langle S\right \rangle . Second, is
x = \left [\array{
2& 1\cr
3& 1
\cr
4&−2 } \right ]

in W? To answer this, we want to determine if x can be written as a linear combination of the five matrices in S. Can we find scalars, {α}_{1},\kern 1.95872pt {α}_{2},\kern 1.95872pt {α}_{3},\kern 1.95872pt {α}_{4},\kern 1.95872pt {α}_{5} so that
Using our definition of matrix equality (Definition ME) we can translate this statement into six equations in the five unknowns,
This is a linear system of equations, which we can represent with an augmented matrix and rowreduce in search of solutions. The matrix that is rowequivalent to the augmented matrix is
\left [\array{
\text{1}&0&0&0& {5\over
8} &0
\cr
0&\text{1}&0&0&−{38\over
8} &0
\cr
0&0&\text{1}&0& −{7\over
8} &0
\cr
0&0&0&\text{1}&−{17\over
8} &0\cr
0&0 &0 &0 & 0 &\text{1}
\cr
0&0&0&0& 0 &0\ } \right ]

With a leading 1 in the last column Theorem RCLS tells us that the system is inconsistent. Therefore, there are no values for the scalars that will place x in W, and so we conclude that x∉W. ⊠
Notice how Example SSP and Example SM32 contained questions about membership in a span, but these questions quickly became questions about solutions to a system of linear equations. This will be a common theme going forward.
Several of the subsets of vectors spaces that we worked with in Chapter M are also subspaces — they are closed under vector addition and scalar multiplication in {ℂ}^{m}.
Theorem CSMS
Column Space of a Matrix is a Subspace
Suppose that A
is an m × n matrix.
Then C\kern 1.95872pt \left (A\right ) is a
subspace of {ℂ}^{m}.
□
Proof Definition CSM shows us that C\kern 1.95872pt \left (A\right ) is a subset of {ℂ}^{m}, and that it is defined as the span of a set of vectors from {ℂ}^{m} (the columns of the matrix). Since C\kern 1.95872pt \left (A\right ) is a span, Theorem SSS says it is a subspace. ■
That was easy! Notice that we could have used this same approach to prove that the null space is a subspace, since Theorem SSNS provided a description of the null space of a matrix as the span of a set of vectors. However, I much prefer the current proof of Theorem NSMS. Speaking of easy, here is a very easy theorem that exposes another of our constructions as creating subspaces.
Theorem RSMS
Row Space of a Matrix is a Subspace
Suppose that A
is an m × n matrix.
Then ℛ\kern 1.95872pt \left (A\right ) is a
subspace of {ℂ}^{n}.
□
Proof Definition RSM says ℛ\kern 1.95872pt \left (A\right ) = C\kern 1.95872pt \left ({A}^{t}\right ), so the row space of a matrix is a column space, and every column space is a subspace by Theorem CSMS. That’s enough. ■
One more.
Theorem LNSMS
Left Null Space of a Matrix is a Subspace
Suppose that A
is an m × n matrix.
Then ℒ\kern 1.95872pt \left (A\right ) is a
subspace of {ℂ}^{m}.
□
Proof Definition LNS says ℒ\kern 1.95872pt \left (A\right ) = N\kern 1.95872pt \left ({A}^{t}\right ), so the left null space is a null space, and every null space is a subspace by Theorem NSMS. Done. ■
So the span of a set of vectors, and the null space, column space, row space and left null space of a matrix are all subspaces, and hence are all vector spaces, meaning they have all the properties detailed in Definition VS and in the basic theorems presented in Section VS. We have worked with these objects as just sets in Chapter V and Chapter M, but now we understand that they have much more structure. In particular, being closed under vector addition and scalar multiplication means a subspace is also closed under linear combinations.
Is the set W a subspace of {ℂ}^{3}? Explain your answer.
C15 Working within the vector space {ℂ}^{3}, determine if b = \left [\array{ 4\cr 3 \cr 1 } \right ] is in the subspace W,
W = \left \langle \left \{\left [\array{
3\cr
2
\cr
3 } \right ],\left [\array{
1\cr
0
\cr
3 } \right ],\left [\array{
1\cr
1
\cr
0 } \right ],\left [\array{
2\cr
1
\cr
3 } \right ]\right \}\right \rangle

Contributed by Chris Black Solution [920]
C16 Working within the vector space {ℂ}^{4}, determine if b = \left [\array{ 1\cr 1 \cr 0\cr 1 } \right ] is in the subspace W,
W = \left \langle \left \{\left [\array{
1\cr
2
\cr
−1\cr
1 } \right ],\left [\array{
1\cr
0
\cr
3\cr
1 } \right ],\left [\array{
2\cr
1
\cr
1\cr
2 } \right ]\right \}\right \rangle

Contributed by Chris Black Solution [920]
C17 Working within the vector space {ℂ}^{4}, determine if b = \left [\array{ 2\cr 1 \cr 2\cr 1 } \right ] is in the subspace W,
W = \left \langle \left \{\left [\array{
1\cr
2
\cr
0\cr
2 } \right ],\left [\array{
1\cr
0
\cr
3\cr
1 } \right ],\left [\array{
0\cr
1
\cr
0\cr
2 } \right ],\left [\array{
1\cr
1
\cr
2\cr
0 } \right ]\right \}\right \rangle

Contributed by Chris Black Solution [921]
C20 Working within the vector space {P}_{3} of polynomials of degree 3 or less, determine if p(x) = {x}^{3} + 6x + 4 is in the subspace W below.
W = \left \langle \left \{{x}^{3} + {x}^{2} + x,\kern 1.95872pt {x}^{3} + 2x − 6,\kern 1.95872pt {x}^{2} − 5\right \}\right \rangle

Contributed by Robert Beezer Solution [922]
C21 Consider the subspace
W = \left \langle \left \{\left [\array{
2& 1\cr
3&−1 } \right ],\kern 1.95872pt \left [\array{
4&0\cr
2&3 } \right ],\kern 1.95872pt \left [\array{
−3&1\cr
2 &1 } \right ]\right \}\right \rangle

of the vector space of 2 × 2
matrices, {M}_{22}.
Is C = \left [\array{
−3& 3\cr
6 &−4 } \right ] an
element of W?
Contributed by Robert Beezer Solution [924]
C25 Show that the set W = \left \{\left [\array{
{x}_{1}
\cr
{x}_{2} } \right ]\mathrel{∣}3{x}_{1} − 5{x}_{2} = 12\right \}
from Example NSC2Z fails Property AC and Property SC.
Contributed by Robert Beezer
C26 Show that the set Y = \left \{\left [\array{
{x}_{1}
\cr
{x}_{2} } \right ]\mathrel{∣}{x}_{1} ∈ ℤ,\kern 1.95872pt {x}_{2} ∈ ℤ\right \}
from Example NSC2S has Property AC.
Contributed by Robert Beezer
M20 In {ℂ}^{3}, the vector space of column vectors of size 3, prove that the set Z is a subspace.
Z = \left \{\left [\array{
{x}_{1}
\cr
{x}_{2}
\cr
{x}_{3} } \right ]\mathrel{∣}4{x}_{1} − {x}_{2} + 5{x}_{3} = 0\right \}

Contributed by Robert Beezer Solution [925]
T20 A square matrix A
of size n is upper
triangular if {\left [A\right ]}_{ij} = 0
whenever i > j.
Let U{T}_{n}
be the set of all upper triangular matrices of size
n. Prove
that U{T}_{n}
is a subspace of the vector space of all square matrices of size
n,
{M}_{nn}.
Contributed by Robert Beezer Solution [928]
T30 Let P
be the set of all polynomials, of any degree. The set
P is a vector
space. Let E be
the subset of P
consisting of all polynomials with only terms of even degree. Prove or disprove: the
set E is a
subspace of P.
Contributed by Chris Black Solution [930]
T31 Let P
be the set of all polynomials, of any degree. The set
P is a vector
space. Let F be
the subset of P
consisting of all polynomials with only terms of odd degree. Prove or disprove: the set
F is a subspace
of P.
Contributed by Chris Black Solution [932]
C15 Contributed by Chris Black Statement [915]
For b to be an
element of W = \left \langle S\right \rangle
there must be linear combination of the vectors in
S that
equals b
(Definition SSCV). The existence of such scalars is equivalent to the linear system
ℒS\kern 1.95872pt \left (A,\kern 1.95872pt b\right ) being consistent,
where A
is the matrix whose columns are the vectors from
S
(Theorem SLSLC).
So by Theorem RCLS the system is inconsistent, which indicates that b is not an element of the subspace W.
C16 Contributed by Chris Black Statement [915]
For b to be an
element of W = \left \langle S\right \rangle
there must be linear combination of the vectors in
S that
equals b
(Definition SSCV). The existence of such scalars is equivalent to the linear system
ℒS\kern 1.95872pt \left (A,\kern 1.95872pt b\right ) being consistent,
where A
is the matrix whose columns are the vectors from
S
(Theorem SLSLC).
So by Theorem RCLS the system is consistent, which indicates that b is in the subspace W.
C17 Contributed by Chris Black Statement [916]
For b to be an
element of W = \left \langle S\right \rangle
there must be linear combination of the vectors in
S that
equals b
(Definition SSCV). The existence of such scalars is equivalent to the linear system
ℒS\kern 1.95872pt \left (A,\kern 1.95872pt b\right ) being consistent,
where A
is the matrix whose columns are the vectors from
S
(Theorem SLSLC).
So by Theorem RCLS the system is consistent, which indicates that b is in the subspace W.
C20 Contributed by Robert Beezer Statement [916]
The question is if p
can be written as a linear combination of the vectors in
W. To check
this, we set p
equal to a linear combination and massage with the definitions
of vector addition and scalar multiplication that we get with
{P}_{3}
(Example VSP)
Equating coefficients of equal powers of x, we get the system of equations,
The augmented matrix of this system of equations rowreduces to
\left [\array{
\text{1}&0&0&0\cr
0&\text{1 } &0 &0
\cr
0&0&\text{1}&0\cr
0&0 &0 &\text{1} } \right ]

There is a leading 1 in the last column, so Theorem RCLS implies that the system is inconsistent. So there is no way for p to gain membership in W, so p∉W.
C21 Contributed by Robert Beezer Statement [917]
In order to belong to W, we
must be able to express C
as a linear combination of the elements in the spanning set of
W.
So we begin with such an expression, using the unknowns
a,\kern 1.95872pt b,\kern 1.95872pt c for
the scalars in the linear combination.
C = \left [\array{
−3& 3\cr
6 &−4 } \right ] = a\left [\array{
2& 1\cr
3&−1 } \right ]+b\left [\array{
4&0\cr
2&3 } \right ]+c\left [\array{
−3&1\cr
2 &1 } \right ]

Massaging the righthand side, according to the definition of the vector space operations in {M}_{22} (Example VSM), we find the matrix equality,
\left [\array{
−3& 3\cr
6 &−4 } \right ] = \left [\array{
2a + 4b − 3c& a + c\cr
3a + 2b + 2c &−a + 3b+ c } \right ]

Matrix equality allows us to form a system of four equations in three variables, whose augmented matrix rowreduces as follows,
\left [\array{
2 &4&−3&−3\cr
1 &0 & 1 & 3
\cr
3 &2& 2 & 6\cr
−1 &3 & 1 &−4 } \right ]\mathop{\longrightarrow}\limits_{}^{\text{RREF}}\left [\array{
\text{1}&0&0& 2\cr
0&\text{1 } &0 &−1
\cr
0&0&\text{1}& 1\cr
0&0 &0 & 0 } \right ]

Since this system of equations is consistent (Theorem RCLS), a solution will provide values for a,\kern 1.95872pt b and c that allow us to recognize C as an element of W.
M20 Contributed by Robert Beezer Statement [918]
The membership criteria for Z
is a single linear equation, which comprises a homogeneous system of equations. As such, we
can recognize Z
as the solutions to this system, and therefore
Z is a null space.
Specifically, Z = N\kern 1.95872pt \left (\left [\array{
4&−1&5 } \right ]\right ).
Every null space is a subspace by Theorem NSMS.
A less direct solution appeals to Theorem TSS.
First, we want to be certain Z is nonempty. The zero vector of {ℂ}^{3}, 0 = \left [\array{ 0\cr 0 \cr 0 } \right ], is a good candidate, since if it fails to be in Z, we will know that Z is not a vector space. Check that
4(0) − (0) + 5(0) = 0

so that 0 ∈ Z.
Suppose x = \left [\array{ {x}_{1} \cr {x}_{2} \cr {x}_{3} } \right ] and y = \left [\array{ {y}_{1} \cr {y}_{2} \cr {y}_{3} } \right ] are vectors from Z. Then we know that these vectors cannot be totally arbitrary, they must have gained membership in Z by virtue of meeting the membership test. For example, we know that x must satisfy 4{x}_{1} − {x}_{2} + 5{x}_{3} = 0 while y must satisfy 4{y}_{1} − {y}_{2} + 5{y}_{3} = 0. Our second criteria asks the question, is x + y ∈ Z? Notice first that
x+y = \left [\array{
{x}_{1}
\cr
{x}_{2}
\cr
{x}_{3} } \right ]+\left [\array{
{y}_{1}
\cr
{y}_{2}
\cr
{y}_{3} } \right ] = \left [\array{
{x}_{1} + {y}_{1}
\cr
{x}_{2} + {y}_{2}
\cr
{x}_{3} + {y}_{3} } \right ]

and we can test this vector for membership in Z as follows,
and by this computation we see that x + y ∈ Z.
If α is a scalar and x ∈ Z, is it always true that αx ∈ Z? To check our third criteria, we examine
αx = α\left [\array{
{x}_{1}
\cr
{x}_{2}
\cr
{x}_{3} } \right ] = \left [\array{
α{x}_{1}
\cr
α{x}_{2}
\cr
α{x}_{3} } \right ]

and we can test this vector for membership in Z with
and we see that indeed αx ∈ Z. With the three conditions of Theorem TSS fulfilled, we can conclude that Z is a subspace of {ℂ}^{3}.
T20 Contributed by Robert Beezer Statement [918]
Apply Theorem TSS.
First, the zero vector of {M}_{nn} is the zero matrix, O, whose entries are all zero (Definition ZM). This matrix then meets the condition that {\left [O\right ]}_{ij} = 0 for i > j and so is an element of U{T}_{n}.
Suppose A,B ∈ U{T}_{n}. Is A + B ∈ U{T}_{n}? We examine the entries of A + B “below” the diagonal. That is, in the following, assume that i > j.
which qualifies A + B for membership in U{T}_{n}.
Suppose α ∈ {ℂ}^{} and A ∈ U{T}_{n}. Is αA ∈ U{T}_{n}? We examine the entries of αA “below” the diagonal. That is, in the following, assume that i > j.
which qualifies αA for membership in U{T}_{n}.
Having fulfilled the three conditions of Theorem TSS we see that U{T}_{n} is a subspace of {M}_{nn}.
T30 Contributed by Chris Black Statement [918]
Proof: Let E be
the subset of P
comprised of all polynomials with all terms of even degree. Clearly the set
E is nonempty, as
z(x) = 0 is a polynomial of
even degree. Let p(x) and
q(x) be arbitrary elements
of E. Then there exist
nonnegative integers m
and n
so that
for some constants {a}_{0},{a}_{2},\mathop{\mathop{…}},{a}_{2n} and {b}_{0},{b}_{2},\mathop{\mathop{…}},{b}_{2m}. Without loss of generality, we can assume that m ≤ n. Thus, we have
so p(x) + q(x) has all even terms, and thus p(x) + q(x) ∈ E. Similarly, let α be a scalar. Then
so that αp(x) also has only terms of even degree, and αp(x) ∈ E. Thus, E is a subspace of P.
T31 Contributed by Chris Black Statement [919]
This conjecture is false. We know that the zero vector in
P is the polynomial
z(x) = 0, which does not have odd
degree. Thus, the set F
does not contain the zero vector, and cannot be a vector space.