LA5 LC

Engineering Mathematics II (MTH 102)
Indira Mishra
IIIT Bhopal
Feb 7, 2024
Indira Mishra (IIIT Bhopal) Linear Combination and Span Feb 7, 2024 1 / 26
Linear Combination
Let us recall that a vector from R3 is if the form x = (x1 , x2 , x3 ) and

also it can be written as
x = (x1 , x2 , x3 ) = x1 (1, 0, 0) + x2 (0, 1, 0) + x3 (0, 0, 1).
Linear Combination
Let us recall that a vector from R3 is if the form x = (x1 , x2 , x3 ) and

also it can be written as
x = (x1 , x2 , x3 ) = x1 (1, 0, 0) + x2 (0, 1, 0) + x3 (0, 0, 1).
Thus any vector in R3 can be expressed as sum of scalar multiple of

thee vectors
e1 = (1, 0, 0), e2 = (0, 1, 0) and e3 = (0, 0, 1)
Linear Combination
Definition: Let V be a vector space and let {x1 , x2 , . . . xn } be any set

of vectors in V . Then a vector x in V is of the form
Linear Combination

x = α1 x1 + α2 x2 + · · · + αn xn
(where αi , i = 1, . . . n are scalars), is called a linear combination of

the vectors x1 , x2 , . . . , xn .
Linear Combination

x = α1 x1 + α2 x2 + · · · + αn xn
(where αi , i = 1, . . . n are scalars), is called a linear combination of

the vectors x1 , x2 , . . . , xn .
The scalars α1 , α2 , . . . αn are called the coefficients of the linear

combination.
Linear Combination
Example: Determine whether the vector x = (2, 1, 5) is a linear

combination of set of vectors {x1 , x2 , x3 }, where x1 = (1, 2, 1)
x2 = (1, 0, 2), and x3 = (1, 1, 0).
Linear Combination

x2 = (1, 0, 2), and x3 = (1, 1, 0).
Solution:
x is a linear combination of x! , x2 , x3 if we find the constants c1 ,
c2 , c3 so that
x = c1 x1 + c2 x2 + c3 x3 .
Linear Combination

x2 = (1, 0, 2), and x3 = (1, 1, 0).
Solution:
x is a linear combination of x! , x2 , x3 if we find the constants c1 ,
c2 , c3 so that
x = c1 x1 + c2 x2 + c3 x3 .
Let
c1 (1, 2, 1) + c2 (1, 0, 2) + c3 (1, 1, 0) = (2, 1, 5)
Linear Combination

c1 + c2 + c3 = 2 
2c1 + 0c2 + c3 = 1
c1 + 2c2 + 0 · c3 = 5

Linear Combination

c1 + c2 + c3 = 2 
2c1 + 0c2 + c3 = 1
c1 + 2c2 + 0 · c3 = 5

⇐⇒
    
1 1 1 c1 2
 2 0 1   c2  =  1 
1 2 0 c3 5
Linear Combination

c1 + c2 + c3 = 2 
2c1 + 0c2 + c3 = 1
c1 + 2c2 + 0 · c3 = 5

⇐⇒
    
1 1 1 c1 2
 2 0 1   c2  =  1 
1 2 0 c3 5
⇒ c1 = 1, c2 = 2, c3 = −1
⇒ x = 1 · x1 + 2 · x2 − 1 · x3 .
Linear Combination

c1 + c2 + c3 = 2 
2c1 + 0c2 + c3 = 1
c1 + 2c2 + 0 · c3 = 5

⇐⇒
    
1 1 1 c1 2
 2 0 1   c2  =  1 
1 2 0 c3 5
⇒ c1 = 1, c2 = 2, c3 = −1
⇒ x = 1 · x1 + 2 · x2 − 1 · x3 .
Or (2, 1, 5) = (1, 2, 1) + 2(1, 0, 2) − 1(1, 1, 0).
Linear Combination
The span: Let S := {x1 , x2 , . . . , xn } be a nonempty set of vectors in a

vector space V . Then the set of all vectors in V that are linear
combination of vectors in S, is denoted by span(S) or
span{x1 , x2 , . . . , xn }.
Linear Combination
The span: Let S := {x1 , x2 , . . . , xn } be a nonempty set of vectors in a

vector space V . Then the set of all vectors in V that are linear
combination of vectors in S, is denoted by span(S) or
span{x1 , x2 , . . . , xn }.
Let S = {x1 , x2 , . . . , xn }
span(S) = {c1 x1 + c2 x2 + . . . cn xn | c1 , c2 , . . . , cn ∈ R}
Linear Combination
Example: Let S = {(1, 1, 0, 1), (1, −1, 0, 1), (0, 1, 2, 1)}. Determine
whether.
(a). x = (2, 3, 2, 3) and
(b). y = (0, 1, 2, 3)
belong to span(S) or not.
Linear Combination
Example: Let S = {(1, 1, 0, 1), (1, −1, 0, 1), (0, 1, 2, 1)}. Determine
whether.
(a). x = (2, 3, 2, 3) and
(b). y = (0, 1, 2, 3)
belong to span(S) or not.
Solution: a). x belong to span(S) if and only if x is a linear
combination of S.
consider the system
c1 (1, 1, 0, 1) + c2 (1, −1, 0, 1) + c3 (0, 1, 2, 1) = (2, 3, 2, 3).
Linear Combination
The above system is

   
1 1 0 2 1 1 0 2
 1 −1 1 3  R4 −R1  0 −2 1 1  − 1 ·R2
 −−−−→   −−2−−→
 0 0 2 2  R2 −R1  0 0 2 2 
1 1 1 3 0 0 1 1
   1 5 
1 1 0 2 1 0 2 2
 0 1 −1
2 − 12 
−R1 −R2  0 1 −1
2 − 12  R − 1 R3
 −−1−−4−→

 0 −−−→ 
0 2 2   0 0 2 2  R2 + 14 R3
0 0 1 1 0 0 1 1
Linear Combination
   
1 0 0 2 1 0 0 2
 0 1 0 0  R3 −2R4  0 1 0 0 −
 R3 →R4
−− − −−→  0 0 0 0  −−−−→

 0 0 2 2 
0 0 1 1 0 0 1 1
 
1 0 0 2
 0 1 0 0  Thus system has solution:
 
 0 0 1 1  c1 = 2, c2 = 0, c3 = 1.
0 0 0 0
Thus
2 · (1, 1, 0, 1) + 0 · (1, −1, 0, 1) + 1 · (0, 1, 2, 1) = (2, 3, 2, 3)
Hence x ∈ span(S).
Exercise: (b).
Linear Combination
Theorem: Let S = {x1 , x2 , . . . , xn } be any nonempty subset of vector

space V . Then span(S) is a subspace of V .
Linear Combination
Theorem: Let S = {x1 , x2 , . . . , xn } be any nonempty subset of vector

space V . Then span(S) is a subspace of V .
Definition: Let S = {x1 , x2 , . . . , xn } be a set of vectors in a vector

space V ,
if every vector in V is a linear combination of vectors in S,
we say that S spans V , or V is spanned by S.
Linear Combination
Example 1: Let
S = {e1 = (1, 0, 0), e2 = (0, 1, 0), e3 = (0, 0, 1)} ⊆ R3 .
Any vector x = (x1 , x2 , x3 ) ∈ R3 can be written as
x = x1 · (1, 0, 0) + x2 · (0, 1, 0) + x3 (0, 0, 1)

= x1 · e1 + x2 · e2 + x3 · e3 .
Thus R3 is spanned by {e1 , e2 , e3 }.
Linear Combination
Example
 2: Let 
 
1 , 0, . . . 0) ⊆ Rn . Then any
S = e1 , e2 , . . . , en | ej = (0, . . . , 0, |{z}
 
j th
x = (x1 , x2 , . . . , xn ) ∈ Rn can be written as
x = x1 e1 + x2 e2 + · · · + xn en .
Thus Rn is spanned by {e1 , e2 , . . . , en }.
Linear Combination
Example 3: A spanning set for Pn .

Pn = {a0 + a1 x + · · · + an xn | ai ∈ R} is vector space of polynomials of
up to degree n.
Linear Combination

up to degree n.
Let
S = 1, x, x2 , . . . , xn ⊆ Pn

Linear Combination

up to degree n.
Let
S = 1, x, x2 , . . . , xn ⊆ Pn

Any p(x) ∈ Pn can be written as
p(x) = a0 + a1 x + a2 x2 + · · · + an xn
Linear Combination

up to degree n.
Let
S = 1, x, x2 , . . . , xn ⊆ Pn

Any p(x) ∈ Pn can be written as
p(x) = a0 + a1 x + a2 x2 + · · · + an xn
Thus the set S span Pn or Pn is spanned by S.
Linear Combination
Example 4: Let S = {x1 , x2 , x3 } where x1 = (1, 2, 1), x2 = (1, 0, 2)

and x3 = (1, 1, 0). Does S spans R3 ?
Solution: If S span R3 , then any x = (a, b, c) ∈ R3 can be written as

linear combination of x1 , x2 , x3 , That is
c1 (1, 2, 1) + c2 (1, 0, 2) + c3 (1, 1, 0) = (a, b, c)
have non trivial solution.

   
1 1 1 a 1 1 1 a
R −2R1 R2 /2
 2 0 1 b  −−2−−−→  0 −2 −1 b − 2a  −−−→
R3 −R1
1 2 0 c 0 1 −1 c − a
Linear Combination
 
1 1 1 a
b R1 +R2
 0 −1 −1/2 − −−−→
2 −a R3 +R2
0 1 −1 c−a
 b 
1 0 1/2 2 R (− 23 )
 0 −1 −1/2 b
− a  −−3−−− →
2 −R2
0 0 −3/2 2b + c − 2a
1 0 0 2b + c − a
 
 0 1 0 a − 2b 
(4a−b−2c)
0 0 1 3
Linear Combination
 
(c+2b−2a)
1 0 0 3
 
R1 −R3 /3
 
−−−−−−→  0 1 0
 (a−c−b) 
3

R2 −R3 /2  
 
4a−b−2c
0 0 1 3
Thus
R3 = span{(1, 2, 1), (1, 0, 2), (1, 1, 0)}.
Linear Combination
Example 5: Let S = {x1 , x2 }, where x1 = (1, 1, 0), x2 = (1, 1, 1). Does

S span R3 ?
Solution: Let x = (a, b, c) ∈ R3 . Consider
c1 (1, 1, 0) + c2 (1, 1, 1) = (a, b, c).

   
1 1 a 1 1 a
R2 −R1
 1 1 b − −−−→  0 0 b − a  .
0 1 c 0 1 c
The above system has no solution if b − a 6= 0. Thus S does not span

R3 .
Linearly independent/dependent sets
Linearly independent and Linearly dependent sets
Definition: A set of vectors {x1 , x2 , . . . , xm } in a vector space V is

said to be linearly-independent, if the vector equation
c1 x1 + c2 x2 + . . . + cm xm = 0
has only trivial solution c1 = c2 = · · · = cm = 0, otherwise it is said to

be linearly dependent.
Linearly independent:
c1 x1 + c2 x2 + · · · + cm xm = 0 ⇒ c1 = 0, c2 = 0, · · · cm = 0.
Linearly dependent:
c1 x1 + c2 x2 + · · · + cm xm = 0 ⇒ cj 6= 0, for some j.
Remark: Linearly independent means any vector from the set can not
be written as linear combination of other vectors of the set.
Example 1:
a. S = {(1, 2), (2, 4)}
c1 (1, 2) + c2 (2, 4) = (0, 0) ⇒ c1 = 2, c2 = −1
b. S = {(1, 2), (2, 4), (9, 11)}
c1 (1, 2) + c2 (2, 4) + c3 (9, 11) = (0, 0)
⇒ c1 = 2, c2 = −1, c3 = 0.
Thus linearly dependent vectors.
Example 2: Determine whether the vectors

{e1 = (1, 0, 0), e2 = (0, 1, 0), e3 = (0, 0, 1)} in R3 are linearly
independent or not?
Solution: Let c1 e1 + c2 e2 + c3 e3 = 0.
c1 · (1, 0, 0) + c2 (0, 1, 0) + c3 (0, 0, 1) = (0, 0, 0).
(c1 , c2 , c3 ) = (0, 0, 0).

This implies that c1 = c2 = c3 = 0. Thus the vectors {e1 , e2 , e3 } are
linearly independent in R3 .
Example 3: Determine whether x1 = (1, 0, 1, 2), x2 = (0, 1, 1, 2) and

x3 = (1, 1, 1, 3) in R4 are linearly independent or not? Solution
consider linear combination
c1 · x1 + c2 x2 + c3 x3 = 0.
   
1 0 1 0 1 0 0 0
 0 1 1 0   0 1 0 0 
  → ··· →  .
 1 1 1 0   0 0 1 0 
2 2 3 0 0 0 0 0
Therefore c1 = 0, c2 = 0, c3 = 0, and thus x1 , x2 and x3 are linearly
independent.
Example 4: Determine linear dependency of vectors x1 = (1, 2, −1),

x2 = (1, −2, 1), x3 = (−3, 2, −1) and x4 = (2, 0, 0) in a vector space R3 .
Solution: Consider the homogeneous system
c1 x1 + c2 x2 + c3 x3 + c4 x4 = 0.
   
1 1 −3 2 0 1 0 −1 1 0
 2 −2 2 0 0  → · · ·  0 1 −2 1 0  .
−1 1 −1 0 0 0 0 0 0 0
c2 = +2c3 − c4
c1 = c3 − c4 .
let c4 = t, c3 = s, then c2 = 2s − t, c1 = s − t. Thus above system has
nontrivial solutions. Hence {x1 , x2 , x3 , x4 } are linearly dependent.
Check that
x3 = −x1 − 2x2 and x4 = x1 + x2 .

| {z } | {z }
from third column from fourth column
Thus in case of linear dependency any vector from the set can be
written as linear combination of other vectors of the set.
Here x3 and x4 can be written as linear combination of x1 and x2 .
Remarks:
Any set containing zero vector is linearly dependent.
The set {φ} is linearly dependent.
Let S1 and S2 be two subsets of vector space V with S1 ⊆ S2 ,

then
1 S1 is linearly dependent ⇒ S2 is linearly dependent.
2 S2 is linearly independent ⇒ S1 is linearly independent.
If n > m any set of n-vectors in m-space Rm is linearly dependent.
Exercise 1: For what values of α are the vectors

(−1, 0, −1), (2, 1, 2), (1, 1, α) in R3 , are linearly dependent.
Exercise 2: If {x1 , x2 } are linearly dependent set, then x1 is parallel

to x2 (i.e. x1 kx2 ).
Exercise 3: Let S = {x1 , x2 , . . . xn } be a set of vectors in Rn and let

A be an n × n matrix whose columns are the vectors of S. Then
a). If A is singular, then S is linearly dependent.

b). If A is nonsingular, then S is linearly independent.
Thank You

LA5 LC

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

LA5 LC

Uploaded by

Copyright:

Available Formats

Engineering Mathematics II (MTH 102)

Let us recall that a vector from R3 is if the form x = (x1 , x2 , x3 ) and

x = (x1 , x2 , x3 ) = x1 (1, 0, 0) + x2 (0, 1, 0) + x3 (0, 0, 1).

Let us recall that a vector from R3 is if the form x = (x1 , x2 , x3 ) and

x = (x1 , x2 , x3 ) = x1 (1, 0, 0) + x2 (0, 1, 0) + x3 (0, 0, 1).

Thus any vector in R3 can be expressed as sum of scalar multiple of

e1 = (1, 0, 0), e2 = (0, 1, 0) and e3 = (0, 0, 1)

Definition: Let V be a vector space and let {x1 , x2 , . . . xn } be any set

Definition: Let V be a vector space and let {x1 , x2 , . . . xn } be any set

(where αi , i = 1, . . . n are scalars), is called a linear combination of

Definition: Let V be a vector space and let {x1 , x2 , . . . xn } be any set

(where αi , i = 1, . . . n are scalars), is called a linear combination of

The scalars α1 , α2 , . . . αn are called the coefficients of the linear

Example: Determine whether the vector x = (2, 1, 5) is a linear

Example: Determine whether the vector x = (2, 1, 5) is a linear

Example: Determine whether the vector x = (2, 1, 5) is a linear

The span: Let S := {x1 , x2 , . . . , xn } be a nonempty set of vectors in a

The span: Let S := {x1 , x2 , . . . , xn } be a nonempty set of vectors in a

c1 (1, 1, 0, 1) + c2 (1, −1, 0, 1) + c3 (0, 1, 2, 1) = (2, 3, 2, 3).

The above system is

2 · (1, 1, 0, 1) + 0 · (1, −1, 0, 1) + 1 · (0, 1, 2, 1) = (2, 3, 2, 3)

Theorem: Let S = {x1 , x2 , . . . , xn } be any nonempty subset of vector

Theorem: Let S = {x1 , x2 , . . . , xn } be any nonempty subset of vector

Definition: Let S = {x1 , x2 , . . . , xn } be a set of vectors in a vector

x = x1 · (1, 0, 0) + x2 · (0, 1, 0) + x3 (0, 0, 1)

Thus R3 is spanned by {e1 , e2 , e3 }.

Thus Rn is spanned by {e1 , e2 , . . . , en }.

Example 3: A spanning set for Pn .

Example 3: A spanning set for Pn .

Example 3: A spanning set for Pn .

Any p(x) ∈ Pn can be written as

Example 3: A spanning set for Pn .

Any p(x) ∈ Pn can be written as

Thus the set S span Pn or Pn is spanned by S.

Example 4: Let S = {x1 , x2 , x3 } where x1 = (1, 2, 1), x2 = (1, 0, 2)

Solution: If S span R3 , then any x = (a, b, c) ∈ R3 can be written as

c1 (1, 2, 1) + c2 (1, 0, 2) + c3 (1, 1, 0) = (a, b, c)

have non trivial solution.

Example 5: Let S = {x1 , x2 }, where x1 = (1, 1, 0), x2 = (1, 1, 1). Does

c1 (1, 1, 0) + c2 (1, 1, 1) = (a, b, c).

The above system has no solution if b − a 6= 0. Thus S does not span

Linearly independent and Linearly dependent sets

Definition: A set of vectors {x1 , x2 , . . . , xm } in a vector space V is

has only trivial solution c1 = c2 = · · · = cm = 0, otherwise it is said to

c1 (1, 2) + c2 (2, 4) = (0, 0) ⇒ c1 = 2, c2 = −1

b. S = {(1, 2), (2, 4), (9, 11)}

c1 (1, 2) + c2 (2, 4) + c3 (9, 11) = (0, 0)

Example 2: Determine whether the vectors

c1 · (1, 0, 0) + c2 (0, 1, 0) + c3 (0, 0, 1) = (0, 0, 0).

(c1 , c2 , c3 ) = (0, 0, 0).

Example 3: Determine whether x1 = (1, 0, 1, 2), x2 = (0, 1, 1, 2) and

Example 4: Determine linear dependency of vectors x1 = (1, 2, −1),

x3 = −x1 − 2x2 and x4 = x1 + x2 .

The set {φ} is linearly dependent.

Let S1 and S2 be two subsets of vector space V with S1 ⊆ S2 ,

If n > m any set of n-vectors in m-space Rm is linearly dependent.

Exercise 1: For what values of α are the vectors

Exercise 2: If {x1 , x2 } are linearly dependent set, then x1 is parallel

Exercise 3: Let S = {x1 , x2 , . . . xn } be a set of vectors in Rn and let

a). If A is singular, then S is linearly dependent.

You might also like