6 Linear Combination Span

Linear Combination and Span
Linear Combination:
Definition: A vector w is called linear combination of vectors v1, v2,…,vn if it can
be expressed in the from
w  k1v1  k2v2  ...  knvn , whereki ' s are scalar
Exp. 1: Check whether (2, 2, 2) is a linear combination of (0,-2, 2) and (1, 3,-1).
Let us assume (2, 2, 2)  k (0, 2, 2)  m(1,3, 1)
 (2, 2, 2)  (m, 2k  3m, 2k  m)
 m  2, 2k  3m  2, 2k  m  2
 AX  B,
 0 1 2
[ A : B]   2 3 2 
 2 1 2 
 0 1 2
R23 (1)  2 3 2 
 0 2 4 
 0 1 2
R13 (2)  2 3 2 
 0 0 0 
 2 3 2 
R12  0 1 2 
 0 0 0 
 rank ([ A : B])  rank ( A)  2  no. of unknown  sys. is consisten and has unique Solution.
m2
2k  3m  2  k  2
Hence, (2, 2, 2)  2(0, 2, 2)  2(1,3, 1)
i.e.(2, 2, 2) is linear combination of (0, 2, 2) and 1,3, 1
Exp. 2: Check whether 9  7 x  15x 2 is a linear combination of
p  2  x  4 x 2 , q  1  x  3x 2 & r  3  2 x  5 x 2 .
Let us assume  9  7 x  15 x 2  ap  bq  cr
 9  7 x  15 x 2  (2a  b  3c)  x(a  b  2c)  x 2 (4a  3b  5c)
 2a  b  3c  9, a  b  2c  7, 4a  3b  5c  15
 AX  B,
 2 1 3 9 
[ A : B]  1 1 2 7 
 4 3 5 15
0 3 1 5 
R23 (4), R21 (2) 1 1 2 7 
0 7 3 13 
1 1 2 7 
R12 0 3 1 5 
0 7 3 13 
1 1 2 7 

R 23 (7 / 3) 0 3 1 5 
0 0 2 / 3 4 / 3
 rank ([ A : B])  rank ( A)  3  no. of unknown  sys. is consisten and has unique Solution.
c  2
3b  c  5  b  1
a  b  2c  7  a  2
Hence, 9  7 x  15 x 2  2 p  q  2r
i.e.  9  7 x  15 x 2 is linear combination of p, q & r
 6 8
Exp. 3: Check whether
 1 8 is a linear combination of
 
4 0 1 1 0 2
L  ,M    &N  .
 2 2 2 3  1 4 
 6 8
Let us assume    aL  bM  cN
 1 8
 6 8  4a  b b  2c 
   
 1 8  2a  2b  c 2a  3b  4c 
 4a  b  6, b  2c  8, 2a  2b  c  1& 2a  3b  4c  8
 AX  B,
4 1 0 6
 0 1 2 8
[ A : B]  
 2 2 1 1
 
 2 3 4 8
0 5 2 4
 0 1 2 8 
R34 (1), R31 (2)  
 2 2 1 1
 
 0 1 3 7 
 2 2 1 1
 0 1 2 8 
R13  
0 5 2 4
 
 0 1 3 7 
 2 2 1 1 
 0 1 2 8 
R 23 (5), R 24 (1)  
 0 0 12 36 
 
 0 0 5 15 
 2 2 1 1 
 0 1 2 8 
r34 (5 /12)  
 0 0 12 36 
 
0 0 0 0 
 rank ([ A : B ])  3 & rank ( A)  3  sys. is consisten.
a  1, b  2 & c  3
 6 8
i.e.   is linear combination of L, M & N
 1 8
Spanning:
Theorem: If v1, v2,…,vn are vectors of a vector space V then the set W of all linear
combinations of v1, v2,…,vn is a subspace of V.
Span: If S={ v1, v2,…,vn} is a set of vectors of a vector space V, then the subspace
W of V consisting of all linear combinations of the vectors in S is called the space
spanned by v1, v2,…,vn and we say that the vectors v1, v2,…,vn spans W. It is
denoted by W=span{S}.
e.g. span{(1,0),(0,1)}=R2 (i.e. {(1,0),(0,1)} spans R2)
Exp.1: Check whether Span{S}=R3, if S={(1,1,2),(1,0,1),(2,1,3)}.

Let us assume for any ( x, y , z )  R 3
( x, y, z )  a(1,1, 2)  b(1, 0,1)  c(2,1,3)
 ( x, y, z )  (a  b  2c, a  c, 2a  b  3c)
 a  b  2c  x, a  c  y, 2a  b  3c  z
 AX  B,
1 1 2 x 
[ A : B]  1 0 1 y 
 2 1 3 z 
1 1 2 x 

R12 (1), R13 (2) 0 1 1 y  x 
0 1 1 z  2 x 
1 1 2 x 

R23 (1) 0 1 1 y  x 
0 0 0  x  y  z 
 rank ([ A : B ])  3& rank ( A)  2  sys. is inconsisten
 span{S }  R 3
Exp.2: Check whether Span{S}=P2, if S  {1  x  2 x ,3  x,5  x  4 x , 2  2 x  2 x }
2 2 2
Let us assume for any a0  a1 x  a2 x 2  P2

a0  a1 x  a2 x 2  a (1  x  2 x 2 )  b(3  x)  c(5  x  4 x 2 )  d (2  2 x  2 x 2 )
 a0  a1 x  a2 x 2  (a  3b  5c  2d )  x( a  b  c  2d )  x 2 (2a  4c  2d )
 a0  (a  3b  5c  2d ), a1  ( a  b  c  2d ), a2  (2a  4c  2d )
 AX  B,
 1 3 5 2 a0 
[ A : B]   1 1 1 2 a1 
 2 0 4 2 a2 
1 3 5 2 a0 

R12 (1), R13 (2) 0 4 4 4 a0  a1 
0 6 6 6 a2  2a0 
1 3 5 2 a0 

R23 (6 / 4) 0 4 4 4 a0  a1 

0 0 0 0 ( 1/ 2) a0  (3 / 2) a1  a2 
rank ( A)  2 & rank ([ A : B])  3  sys. is inconsistent
 Span{S }  P2
1 2  2 1   1 2 1 2
Exp.3: Check whether Span{S}=M22, if S  { , , , }
3 4   3 4  3 4 3 4
a a12 
Let us assume for any  11   M 22
 a21 a22 
 a11 a12  1 2   2 1   1 2 1 2 
a   a  b  c  d  
 21 a22  3 4   3 4  3 4  3 4 
a a12   a  2b  c  d 2a  b  2c  2d 
  11   
 a21 a22  3a  3b  3c  3d 4a  4b  4c  4d 
 a  2b  c  d  a11 , 2a  b  2c  2d  a12 ,3a  3b  3c  3d  a21 , 4a  4b  4c  4d  a22
 AX  B,
 1 2 1 1 a11 
 2 1 2 2 a 
[ A : B]   12 
 3 3 3 3 a21 
 
 4 4 4 4 a22 
1 2 1 1 a11 
0 3 4 0 a  2a 
R12 (2), R13 (3), R14 (4)  12 11 
0 9 6 0 a21  3a11 
 
0 12 0 8 a22  4a11 
1 2 1 1 a11 
0 3 4 0 a12  2a11 
R23 (3), R24 (4) 
0 0 6 0 a21  3a11  3a12 
 
0 0 16 8 a22  4a11  4a12 
1 2 1 1 a11 
0 3 4 0 a12  2a11 
R34 (16 / 6)  
0 0 6 0 a21  3a11  3a12 
 
0 0 0 8 a22  4a11  4a12  (16 / 6)(a21  3a11  3a12 ) 
 rank ( A)  4  rank ([ A : B])  sys. is consisten & has unique solution
 span{S }  M 22

6 Linear Combination Span

Uploaded by

Copyright:

Available Formats

6 Linear Combination Span

Uploaded by

Document Information

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

6 Linear Combination Span

Uploaded by

Copyright:

Available Formats

Linear Combination and Span

Exp.1: Check whether Span{S}=R3, if S={(1,1,2),(1,0,1),(2,1,3)}.

Let us assume for any a0  a1 x  a2 x 2  P2

You might also like