Theorem 3: If and are subspaces of a vector space , then the set

+ = + ∈ ∈ } is also a subspace.
Proof: Since and are subspaces, 0 ∈ and 0 ∈ .
Hence = + ∈ + .
Suppose that , ∈ + .
Then, = + , = + for some , ∈ and , ∈ .
Hence + =( + )+ + = + + + ∈ +
Because and are subspaces, + ∈ and + ∈ .
Let ∈ ℝ and ∈ + , then = + , for some ∈ and ∈ .
Since and are subspaces, ∈ and ∈ ,
hence = + = + ∈ + .
Therefore + is a subspace of .
Linear combination:
A linear combination of a set ,..., of vectors in a vector space V is a vector of the
form
+ +⋯+ for some scalars , ,…, .

For example, Let = (1, 2, 3) and = (1, 0, 1) in , then the vector

Suppose we want to express the vector = 1, −2, 5 as a linear combination of the vectors
= 1, 1, 1 , = 1, 2, 3 , = 2, −1, 1 .
We have to find the scalars , and such that = + + ;
that is, 1, −2, 5 = (1, 1, 1) + (1, 2, 3) + 2, −1, 1 .
 1 1 1 2 2
or −2 = 1 + 2 + −1 = + 2 + −
5 1 3 1 3

1 + +2
−2 = +2 −
5 +3 +
The vectors on the left hand and right hand sides of (2) are equal if and only if their
corresponding entries are both equal. That is,

1= + +2
−2 = +2 −
5= +3 +
We solve this system by row reducing the augmented matrix of the system as follows:
 1 1 2 1 1 1 2 1 1 1 2 1
1 2 −1 −2 ~ 0 1 −3 −3 ~ 0 1 −3 −3
1 3 1 5 0 2 −1 4 0 0 5 10
So equivalent system is:

+ + 2 =1
− 3 = −3
5 = 10
Back-substitution yields the solution: = 2, = −3 + 3 = −3 + 6 = 3 and
=1− −2 = 1 − 3 − 2 2 = −6
Thus, = −6 +3 +2 .
Note: In the above example we can observe that, the vector equation
= + + ⋯+
has the same solution as the linear system whose augmented matrix is
[ … ] −−− −(1)
In particular, can be expressed as a linear combination of , ,…, if and only if there
exists a solution to the linear system corresponding to 1 (that is, the the linear system
corresponding to 1 is consistent).

Solved Problems:
1. Can = (2, −5, 3) in be represented as a linear combination of the vectors
= 1, −3, 2 , = 2, −4, −1 , = 1, −5, 7 .
Solution: The vector can be written as a linear combination of , , if and only if
there exist scalars scalars , and such that = + + ;
that is, 2, −5, 3 = 1, −3, 2 + 2, −4, −1 + 1, −5, 7 .
This vector equation is equivalent to a system of three linear equations in three unknowns.
That is,

2= + 2 +
−5 = −3 −4 − 5
3=2 − +7
If we reduce the augmented matrix for the above system, we get,

1 2 1 2 1 2 1 2 1 2 1 2
−3 −4 −5 −5 ~ 0 2 −2 1 ~ 0 2 −2 1
2 −1 7 3 0 −5 5 −1 0 0 0
Here, = ≠ = .
 Thus the system is inconsistent and so has no solution. Thus, cannot be written as a linear
combination of , .
2. For which value of the vectors = (1, −2 , ) in be a linear combination of the vectors
= 3, 0, −2 and = (2, −1, −5).
Solution: The vector can be written as a linear combination of , , if and only if there
exist scalars scalars , such that = + ;
that is, 1, −2, = 3, 0, −2 + (2, −1, −5)
This vector equation is equivalent to a system of three linear equations in three unknowns.
If we reduce the augmented matrix for this system, we obtain,

3 2 1 3 2 1 3 2 1 3 2 1
0 −1 −2 ~ 0 −1 −2 ~ 0 −1 −2 ~ 0 −1 −2
−2 −5 0 − + 0 −11 3 +2 0 0 3 + 24
 The above system is consistent if and only if 3 − 24 = 0, that is = 8. Hence, for = 8 the
vectors = (1, −2 , ) in can be written as a linear combination of the vectors
= 3, 0, −2 and = (2, −1, −5).

3 1 1 1
3. Write the matrix = as a linear combination of the matrices = ,
1 −1 1 0
0 0 0 2
= = .
1 1 0 −1
Solution: To write the matrix E as a linear combination of the matrices A, , we have
to find values of , such that = + + .

3 1 1 1 0 0 0 2 +2
That is, = + + =
1 −1 1 0 1 1 0 −1 + −
 3 1 +2
=
1 −1 + −
this implies, 3 = ,1= +2 , 1= + and −1 = −
Solving above equations, we get, = 3, = −1 and = −2.
Therefore, =3 −2 −1 .

1 2 7
4. Let = −2 , = 5 , = 4 . Determine whether can be written as a linear
−5 6 −3
combination . (Try this).
 Span of vectors:
If , ,…, are vectors in a vector space , then the set of all linear combinations of
, ,…, is called span (or linear span) of the vectors , ,…, . It is denoted by
Span{ , ,…, }.
That is, Span{ , ,…, } is the collection of all vectors that can be written in the form
+ +⋯+ with , ,…, scalars.
Therefore,
Span{ , ,…, }={ + + ⋯+ , ,…, ∈ .

Note: Asking whether a vector is in Span{ , ,…, } means to asking whether the vector
equation + +⋯+ = has a solution, or, equivalently, asking whether the linear
system with augmented matrix , ,…, has a solution.
Theorem:
If , are vectors in a vector space , then the set = { , } is a subspace of .
Proof:
The zero vector is in , because 0 = 0 +0 .
To prove that is closed under the vector addition, take two vectors in ,
that is, let , ∈ , then = + for some scalars
and = + for some scalars
Now, + = + + +
= + +( + ) . So, + ∈ .
Let be a scalar and ∈ , then = + for some scalars
Now, = ( + )= + which shows that is in .
Thus is a subspace of V.
Note : We can generalize the above theorem for vectors, as:
If , ,…, are vectors in a vector space , then the set = { , ,…, } is a
subspace of . (Prove this !!).
A Geometric Description of { } and { , }:
Let be a nonzero vector in . Then { } is the set of all scalar multiples of , which
is the set of points on the line in through and . See figure 1.
If and are nonzero vectors in , with not a multiple of , then Span{u, v} is the plane
in that contains , , and . In particular, Span{u, v } contains the line in through and
and the line through and . See Figure 2.