0% found this document useful (0 votes)
22 views15 pages

Understanding Vector Spaces in Linear Algebra

The document provides an overview of vector spaces, including their definitions, axioms, and examples of both vector spaces and non-vector spaces. It also discusses subspaces, linear combinations, and the concept of span within vector spaces. Theorems related to vector spaces and illustrative examples are included to clarify the concepts presented.

Uploaded by

adityakk1050
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
22 views15 pages

Understanding Vector Spaces in Linear Algebra

The document provides an overview of vector spaces, including their definitions, axioms, and examples of both vector spaces and non-vector spaces. It also discusses subspaces, linear combinations, and the concept of span within vector spaces. Theorems related to vector spaces and illustrative examples are included to clarify the concepts presented.

Uploaded by

adityakk1050
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Bansilal Ramnath Agarwal Charitable Trust’s

Vishwakarma Institute of Technology, Pune -37.


Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

Introduction: In this topic you will learn vector spaces, linear dependence and independence, basis,
dimension, inner product.
Vector Space
Definition: Let V be non-empty set. Define two operations namely ‘addition’ and ‘scalar multiplication’
on V. V is said to be a vector space if for every u , v, w in V and any real, complex number  , following
axioms hold.
1. u  v V (closed under addition)
2. u  v  v  u (addition is commutative)
3. u  (v  w)  (u  v)  w (addition is associative)
4. There exists 0 V such that u  0  0  u  u . (Existence of zero element for
Addition known as additive identity)
5. There exists u  V  u  u  u  (u )  0 . (Existence of additive inverse)
6.  u V {closed under scalar multiplication}
7. (  )u   u   u
Scalar multiplication is distributive}
8.  (u  v)   u   v
9. ( u )  () u {Scalar multiplication is associative}
10. There exists 1  R such that 1 u  u .
Elements / members of V are called as ‘vectors’.
Theorem 1: For a vector space V
i) Zero vectors are unique. ii) u  V is unique such that u  (u )  0.
Theorem 2: Let V be a vector space and let x, y be vectors in V, then
i) x  y  x  y  0 ii) 0  x  0 iii) k  0  0 for any k  .
iv)  x is unique and  x  (1) x v) If k x  0, then k  0 or x  0.
Examples of Vector Spaces
1) V  {0} (Set consisting of zero vectors)
2) Rn  {( x1 , x2 , , xn ) / x1, x2 , x3 , , xn  R} (Set of all ordered n-tuple of
real or complex numbers)is a vector space under component wise addition and scalar
multiplication, i. e.,
( x1 , x2 , , xn )  ( y1 , y2 , , yn )  ( x1  y1 , x2  y2 , , xn  yn )
 ( x1 , x2 , , xn )  ( x1 ,  x2 , ,  xn ) .
3) Pn ( x)  Set of all polynomials in x up-to degree ‘n’
 {a0 xn  a1xn1   an / a0 , a1 , , an  R}
is a vector space under usual addition and scalar multiplication of polynomials, i.e.
n n 1 n n 1 n n 1
( a0 x  a1x   an )  (b0 x  b1x   bn )  ( a0  b0 ) x  ( a1  b1 ) x   ( an  bn )

 ( a0 x n  a1x n1   an )  ( a0 ) x n  ( a1 ) x n1   ( an ) .


4) M m  n ( R)  {[ai j ] m  n / ai j  R, i  1, 2, , m ; j  1, 2, , n} is a vector space
with usual addition and scalar multiplication of matrices, i. e.,
[ai j ]  [bi j ]  [ai j  bi j ] and [ai j ]  [ ai j ] .
5) V  C[a, b]  { f : [a, b]  R} set of all real valued continuous functions is a vector space
under addition and scalar multiplication of functions, i.e.,
( f  g )( x)  f ( x)  g ( x) and ( f )( x)    f ( x) .

RSD Page 1
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

Examples of sets which are not a vector spaces


1. P2  Set of polynomials of exactly degree 2 is not closed with respect to vector addition.
For Example: Let p( x)   x 2  2 x  5, q( x)  x 2  3
.
 p( x)  q( x)  2 x  8  P2 as 2 x  8 is not a polynomial of degeree 2.
2. The set of integers is not a vector space. Because the set is not closed with respect to scalar
1 2
multiplication. For example (2)   is not an integer .
3 3
3. Let V  ( x, y, z ) : x, y, z  R , with addition as
( x1 , y1 , z1 )  ( x2 , y2 , z2 )  ( x1  x2 , y1  y2 , z1  z2 ) and scalar multiplication as
c ( x, y, z )  (cx, 0, 0)
[Ans.: 1 x, y, z    x, 0, 0    x, y, z  ]
4. Let V  ( x, y) : x, y  R , with standard operation of addition and nonstandard
operation scaler multiplication defined as c ( x, y )  (cx, y ) is not a vector space.
[Ans.: In this example all the axioms are satisfied except axiom number 10.
0  1, 1 =  0 1, 1  (0, 1)   0,0  V is not a vector space. ]
Subspace: - Let V be a vector space and V  0, U  V , U is said to be a subspace of V if U itself is
a vector space under the same ‘addition’ and ‘scalar multiplication’ operations as defined on V.
Theorem1.4: - A non-empty subset U of vector space V is a subspace of V if and only if
1) U is closed under addition, i. e., u1  u2  U for all u1 , u2 U
2) U is closed under scalar multiplication, i. e.,  u  U for every  and u  U
Note: If 0 V is not a member of U  V then U is not a subspace of V .
Illustrative Examples:
Q 1)  
Let A be m  n matrix, then V  X  R n : AX  0 , is a subspace of R n .
Sol :n
Let x, y  V  Ax  0, and Ay  0 `
Consider, A( x  y )  Ax  Ay  0,  x  y V and Let   R, then A( x)   A( x)  0,
  x V .Therefore V is closed with respect to addtion and scalar multilication
V is a subsapce of R n .
Q 2) List all the subspaces of R  {( x, y ) | x, y  R}
2

Soln. 1) {(0, 0)} 2) Set of all lines passing through origin {( x, y ) | y  mx, m  }
3) R 2 itself.
List all the subspaces of R  {( x, y ) | x, y, z  R}
3
Q 3)
Soln. 1) {(0, 0, 0)} 2) Any plane passing through origin.
3) Any line passing through origin. 4) R 3 itself.
Q 4) Is R 2 a subspace of R 3 ?
Soln. No, because R 2 is not even a subset of R 3 ( R 2 has ordered pairs while R 3 has ordered triples)
Q 5) Let U and W are subspaces of a vector space V .Sum of U and W is defined as
U  W  u  w V : u U and v V  Show that U  W is a subspace of V .
Sol .n
Let x, y U  W  x  u1  w1 and y  u2  w2 where u1 , u2  U and w1 , w2  W .

RSD Page 2
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

i) x  y   u1  w1    u2  w2 
  u1  u2    w1  w2  (by associativity and commutativity of V)
but  u1  u2   U and  w1  w2   W (as U and W are subspaces of V )
 x  y U  W .
ii) Let  beany real number,  x    u1  w1    u1   w1 (Distributive propertyof V )
but  u1 U and  w1 W (as U and W aresubspaces of V )
  x U  W  U  W is a subspace of V .
Examples of sets which are not subspaces
Q 1) Is M the set of all singular matrices of order 2  2 a subspace of M 2  2 ( R) ?
Soln. M is not a subspace because it is not closed under addition.
1 1 0 0 1 1 
0 0  1 2  1 2  M . Since addition matrix is non-singular
     
Q 2) Is {( x, y ) | y  mx, m  R} a subspace of R 2 ?
Soln. ( x1 , y1 ), ( x2 , y2 )  y1  m1 x1 , y2  m2 x2 , y1  y2  m1 x1  m2 x2  m( x1  x2 )

Hence it is not closed under addition. It is not a subspace of R 2 .


Q 3) Is H  {( x, y ) | y  mx, m is fixed real number} a subspace of R 2 ?
Soln. Yes, because fixed real number  a single line passing through origin.
Let ( x1 , y1 ), ( x2 , y2 )  H  y1  mx1 , y2  mx2 .
Consider,  x1  x2 , y1  y2    x1  x2 , mx1  mx2    x1  x2 , m( x1  x2 )   H and
  x1 , y1    x1 ,  (mx1 )    x1 , m ( x1 )   H as m,  both are real numbers.
Q 4) Is H1  {( x, y) | x 2  y 2  1} a subspace of R 2 ?
Soln. H1 is not a subspace because (0,0)  H1 .
Q 5) Is H 2  {( x, y) | x 2  y 2  1} a subspace of R 2 ?
Soln. H 2 is not a subspace because H 2 is not closed under addition. e.g. (1, 0), (0,1)  H 2 but
(1,0)  (0,1)  (1,1)  H 2 .
Linear Combination (L.C.) of Vectors
Let H  {v1 , v2 , v3 , , vn } be a subset of a vector space V, then the sum c1v1  c2v2   cn vn , where
c1 , c2 , , cn  R is defined as a linear combination of v1 , v2 , , vn .
# Span of a Set
Let S  {v1 , v2 , v3 , , vn } be a subset of vector space V.
span ( S )  {c1v1  c2v2   cnvn | c1 , c2 , , cn  R} = Set of all possible linear combination of
members of H

RSD Page 3
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

Theorem1.5: Let S  {v1 , v2 , v3 , , vn } be a subset of vector space V. Show that span S is a


subspace of V containing S .
n

h1   ai vi 
Let h1 , h2  span H   n n
Proof. i) i 1
n  ai , bi  R , h1  h2   ( ai  bi ) vi   ci vi , ci  R .
h2   bi vi 
i 1 i 1

i 1


Therefore h1  h2  span(S)
n n
ii) Let  R and  h1   ( ai ) vi   di vi , di  R . Therefore  h1  span(S)
i 1 i 1
 Span S is a subspace of a vector space V.
Note That : Span S is a smallest subspace of V containing S .
Illustrative Examples
Q 1) Show that the set M of all symmetric matrices of order 2  2 is a subspace of M 2  2 ( R) .
Soln. Consider any symmetric matrix A  M . Then
a c  1 0   0 0   0 1 
A   a  b c  , where a, b, c  R .
 c b  0 0   0 1  1 0 
1 0   0 0  0 1 
Here A is a linear combination of   ,  and   of M 2  2 .
0 0  0 1  1 0 
 Set of symmetric matrices of order 2 is a subspace of M 2  2 ( R) .
 a  b  c  
 
  2a  b  
Q 2) Show that H    is a subspace of R .
4

  a  b  5 c  
  2a  c  
 a bc  1   1 1  1   1  1  
 2a  b   2  1 0       
 2   1  0  
  a   b    c    H  span    v1 , v2 , v3 
n
Sol . , ,
 a  b  5c  1   1  5  1   1  5  

 2a  c 
  
2
 
0
 
 1  2   0   1  
where v1 , v2 , v3  R4 .  H is subspace of R 4 .
 a  b  c  
 
 5   a subspace of R4 ?
Q 3) Is H  
  a  b  5c  
  2a  c  
0
0
Soln. Since   is not a member of H, it is not a subspace of R 4 .
0
 
0
Spanning Set
Let S  {v1 , v2 , , vn } be a subset of vector space V. S is said to be a spanning set of V if

RSD Page 4
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

every element of V is expressible as linear combination of elements of S , i.e., v  span {S } for all
v V , i.e., v  c1v1  c2v2   cn vn for some c1 , c2 , , cn is a consistent system of linear equations.
Illustrative Examples
Q 1) Let S  {e1  (1, 0), e2  (0, 1)} . Is S spanning set of R 2 ?
Let ( x, y )  R . ( x, y )  xe1  ye2 is always consistent. S spans R 2 .
2
Soln.
Is S  {1, x, x } spans P2 ?
2
Q 2)
Soln. Let p ( x)  P2 then p( x)  a0 x2  a1 x  a2 ; a0 , a1 , a2  R .  S spans P2 .
Q 3) i) For what value of h, will y be in the subspace of R 3 spanned by v1 , v2 , v3 where
1 5  3  4
     
v1   1 , v2   4 , v3   1  and y   3  . ii) Is v1 , v2 , v3 span R ?
3

 2  7   0   h 
Soln. i) Let y  span {v1 , v2 , v3} . Therefore y  c1v1  c2v2  c3v3 .
 4 1 5  3  c1  5c2  3c3  4
i.e. 3  c1 1  c2 4  c3  1 
     
c1  4c2  c3  3
       
 h   2  7   0  2c1  7c2  0c3  h
1 5 3 : 4 

Consider the augmented matrix [ A : y ]  1 4 1 : 3  R2  R1 , R3  2 R1 

 2 7 0 : h 
1 5 3 4  1 5 3 4 
~ 0 1 2 1  R3  3R2  0
 1 2 1  .
0 3 6 h  8 0 0 0 h  5
For h  5,  [ A]   [ A : y ] .  The system of equations is consistent. Hence,
y  span {v1 , v2 , v3} iff h  5 .
ii) {v1 , v2 , v3} does not span R 3 because the system of equations v  c1v1  c2v2  c3v3 is
not consistent for every v V .
1  2  4  3
Q 3) Let v1  0 , v2  1 , v3  2 , w  1 
     
       
 1  3  6   2
i) Is w belong to the set {v1 , v2 , v3} ? ii) How many vectors are in the set {v1 , v2 , v3} ?
iii) How many vectors are in span{v1 , v2 , v3 } ? iv) Is w  span {v1 , v2 , v3 } ? Why?
v) Is span {v1 , v2 , v3}  R3 ?
Soln. i) No. w is not a member of the set {v1 , v2 , v3} because w  v1  v2  v3 .
ii) Total number of vectors in the set {v1 , v2 , v3} are3.
iii) There are infinite numbers of vectors in span{v1 , v2 , v3 } .
iv) w  span {v1 , v2 , v3}
Consider, w  c1v1  c2 v2  c3v3

RSD Page 5
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

3 1  2  4 c1  2c2  c3  3


1   c  0   c 1   c  2   0c  c  2c  1
  1  2  3  1 2 3

 2   1  3  6  c1  3c2  6c3  2

1 2 4 3
Consider the augmented matrix, [ A : B]   0 1 2 1 

 1 3 6 2
 1 2 4 3 1 2 4 3 
R3  R1  R3  5R2
 0 1 2 1   0 1 2 1 
 
0 5 10 5 0 0 0 0 
ρ[ A : B]  ρ[ A]  The system of equations is consistent.
v) Consider v  c1v1  c2v2  c3v3
v  AC , as  [ A]  2   [ A, v] for every v  R 3 .  This system is not consistent
for every v  R .  Span {v1, v2 , v3}  R3 .
3

Linearly Dependent/Independent Set


Let H  {v1 , v2 , v3 , , vn } be a subset of a vector space V . H is said to be linearly dependent if there
exist scalars (real numbers) c1 , c2 ,, cn not all zero such that
c1v1  c2v2  c3v3   cn vn  0 .
H is said to be linearly independent if c1v1  c2 v2  c3v3 
 cn vn  0 implies c1  c2   cn  0 .
Note: i) H is linearly independent if and only if the system c1v1  c2 v2  c3v3   cn vn  0 has
trivial solution only, i.e. otherwise the set is linearly dependent.
ii) A set containing zero vector is linearly dependent.
iii) Set consists of single non – zero vector is linearly independent.
Theorem1.6: - If the set of vectors are linearly dependent then one of the vectors is expressible as a
linear combination of the remaining.
Proof:- The set is linearly dependent, c1v1  c2 v2  c3v3   cn vn  0 has a non-trivial
solution.  Atleast one of c1 , c2 , , cn is non-zero.
1
Let us assume that c2  0 .Then v2  (c1v1  c3v3   cn vn ) .
c2
Method of checking Linearly Dependent / Independent Set
Step 1:Consider, c1v1  c2v2  c3v3   cn vn  0
 c1 
c 
AC  0 where A   v1 v2 v3 ... v n  , C   2  .
 ... 
 
cn 
Step 2: Find rank of A. Let ρ( A)  r
Step 3: i) If ( A)  r  n (Number of unknowns), then set is linearly independent .
ii) If ( A)  r  n (Number of unknowns), then set is linearly dependent .
Step 3 : If dependent find relation between the vectors.

RSD Page 6
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

Illustrative Examples
Q 1) Determine whether S  {1  t , 2t  3t 2 , t 2  2t 3 , 2  t 3} is linearly dependent or independent.
If dependent, find the relation between them.
Sol . Let v1  1  t , v2  2t  3t 2 , v3  t 2  2t 3 , v4  2  t 3 .
n

Consider, c1v1  c2 v2  c3v3  c4 v4  0 .


c1 (1  t )  c2 (2t  3t 2 )  c3 (t 2  2t 3 )  c4 (2  t 3 )  0  0 t  0 t 2  0 t 3
c1  2c4  0 1 0 0 2  c1 
c1  2c2  0  1 2 0 0  c 
This is ideally zero for every ‘t’ iff i.e.   2  0
3c2  c3  0 0 3 1 0  c3 
   
2c3  c4  0 0 0 2 1 c4 
1 0 0 2 1 0 0 2 1 1 0 0 2
 1   2  R2  1 0 1 
 2 0 0 R2  R1 0 2 0 2  0
Let A    
0 3 1 0 0 3 1 0 0 3 1 0
     
0 0 2 1 0 0 2 1 0 0 2 1 
1 0 0 2 1 0 0 2
0 1 0 1  0 0 1 
R3  3R2 R4  2 R3 1
     
0 0 1 3 0 0 1 3
   
0 0 2 1 0 0 0 5
 [ A]  4  number of unknowns.  The system has a trivial solution only.
 Set of vectors are linearly independent.
 1 0   2 1   3 4   3 3 
Determine whether the set of vectors H     1 0  ,  2 3  ,  1 3   is linearly
3
Q 2) ,
2      
dependent or independent? If dependent, find the relation.
1 0  2 1  3 4  3 3
Soln.: Let v1    , v2    , v3    , v4   .
 2 3  1 0  2 3 1 3
Consider c1v1  c2 v2  c3v3  c4 v4  0 . ---------- (i)
c1  2c2  3c3  3c4  0
1 0  2 1  3 4  3 3 c  4c3  3c4  0
c1    c2    c3    c4   0 2
 2 3  1 0  2 3 1 3 2c1  c2  2c3  c4  0
3c1  3c3  3c4  0
1 2 3 3 1 2 3 3
 0 1 4 3 0 1 4 3
R3  2 R1 , R4  3R1
A    
 2 1 2 1  0 0 16 16 
   
3 0 3 3  0 0 30 30 
1 1 1 2 3 3 1 2 3 3
R3 , R4 0 1 4 3  
(16) R4  R3 0 1 4 3
   
30
 
0 0 1 1 0 0 1 1
   
0 0 1 1 0 0 0 0 
 [ A]  3  number of unknowns  4 .  The system has a non-trivial solution.

RSD Page 7
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

 Vectors are linearly dependent. Equivalent system is


c1  2c2  3c3  3c4  0, c2  4c3  3c4  0, c3  c4  0
Let c4  k , k  0  c3  k
c2  4k  3k  0, c2  k , c1  2k  3k  3k  0, c1  2k
Put values of c1 , c2 , c3 , c4 in (i), 2kv1  kv2  kv3  kv4  0 .
2kv1  kv2  kv3  kv4  0 , i. e., 2v1  v2  v3  v4  0
Q 3) Let H  {v1 , v2 , , vk } spans V. Show that if H is linearly dependent then
H1  {v1 , v2 , , vk 1} also spans V.
n
Sol . Let v V then as H spans V , v  d1v1  d 2v2   d k vk .
If H is linearly dependent, then any vector in H is expressible as the linear combination of
others. Therefore let vk  c1v1  c2v2   ck 1vk 1 . Substituting this in v
v  (d1  d k c1 )v1  (d 2  d k c2 )v2   (d k 1  d k ck 1 )vk
Thus v is expressible as linear combination of vectors in H1 . Hence H1 spans V.
Q 4) Determine by inspection if the given set is linearly independent

1 4 1 0   1  2 


 3
a)  1 ,  7 ,
 
 1 ,
 
1 
b) 0  ,  5  ,  3 
 
 6   2   2   4 
0   7  1 
 2   5 
1  2   4  4  10 
    
c) 1 ,  3  ,  6   d)   ,  
6  15
1  4   8    
10   25 
Soln. a)Set is linearly dependent, because it contains 4-vectors in 3 .
b)Set is linearly dependent, because it contain zero vector.
2  4 
c)Set is linearly dependent, because  3     6  .
1
2
 4   8
d)Set is linearly independent as there is no relation between them.
Basis of a Vector Space
A subset B  {v1 , v2 , , vn } of a vector space V is a basis for V if
1) B is linearly independent. 2) V  span {B} , i.e. B spans V.
Note That: i) A given vector space may have more than one bases.
e.g. B1  {e1  (1, 0) , e2  (0, 1)} , B2  {v1  (1, 1), v2  (1, 1)}
Both B1 & B2 are bases of 2 .
ii) A set having maximum number of linearly independent vectors is the basis.
iii) Minimum number of vectors which spans the set is the basis.
iv) If B  {v1 , v2 , , vn } is basis for vector space V, then every vector in V can
be written in one and only one as a linear combination of vectors in B.
v) If a vector space V has one basis with n vectors, then every basis for V has n
vectors.
Dimension of a vector space

RSD Page 8
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

Number of elements in a basis is known as the dimension of the vector space.


If basis of vector space V contains finite number of vectors, the vector space is finite dimensional.
Otherwise it is said to be infinite dimensional.
# If basis of a vector space V has n-vectors then dimension of V  dim(V )  n & dim{0}  0 .
Note That: 1) In an n-dimensional vector space V, n  1 vectors are linearly dependent.
2) In an n-dimensional vector space V, n  1 vectors do not span vector space V.
 Standard Bases
1) V  R n then the standard basis is B  {e1 , e2 , , en } , where, e1  (1, 0, , 0),
e2  (0, 1, , 0) , , en  (0, 0, , 0, 1) .  dim( R )  n .
n

In particular, for 2
standard basis is (1, 0), (0,1) and , for 3
standard basis is
(1, 0, 0), (0,1, 0), (0, 0,1) .
 1 0   0 1   0 0   0 0  
2) V  M 2  2 ( R) . B    ,  ,  ,    dim(M 2  2 ( R))  4 .
  0 0   0 0  1 0   0 1  
( Note : If V  M m  n ( R) then dim(M m  n ( R))  mn )
3) V  Pn ( x) : space of polynomials in x at most degree n or degree  n . Standard basis
of Pn ( x ) is B  {1, x, x 2 , , x n }  dim( Pn ( x))  n  1 .
4) C[ a , b ]: space of all continuous functions defined on [ a , b] is an infinite dimensional
vector space.
Illustrative Examples
1   1
1. Is B  {v1 , v2 } a basis of R , where v1  2 , v2   2  ?
3  
   
1   1 
Soln. No. Because dim( R )  3 .
3

1   1
2. Is B  {v1 , v2 } a basis of R , where v1  2 , v2   2  ?
2  
   
1   1 
Soln. No. Because v1 & v2 are not even the members of R 2 .
3. What is the span {B} in the above example?
Soln. It is a plane through origin. Since 3 non-collinear points viz origin, point corresponding to vector
v1 and point corresponding to vector v2 forms a plane.
n
Note: If Basis of subsapce V of R contains
i) 1-vector, then geometrically it is a straight line in R n through origin.
ii) 2-vectors, then geometrically it is a plane in R n through origin.
Illustrative Examples
Q 1) Determine whether the set is a basis for M 2  2 ( R) ?
 1 0   1 0   2 1 1 1 
S   ,  ,  0 1 
0 
,
 0 1   1 1  1  
Soln. Since dim(M 2  2 ( R))  4 and S contains 4 vectors, therefore S is a basis for M 2  2 ( R) if and
only if given set of vectors are linearly independent.

RSD Page 9
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

1 0   1 0  2 1 1 1
Let v1    , v2   1 1 , v3  1 0 , v4  0 1
0 1       
 1 2 1 
1
0 0 1 1 
Consider c1v1  c2 v2  c3v3  c4 v4  0 . i.e. AC  0 where A   .
0 1 1 0 
 
1 1 0 1 
1 1 2 1  1 1 2 1 
0 0 1 1  0 1 1 0 
R4  R1 R2  R3
       
0 1 1 0  0 0 1 1 
   
0 2 2 0  0 2 2 0 
1 1 2 1  1 1 2 1 
0 1 1 0  0 1 1 0 
R4 2 R2 R4 4 R3
       
0 0 1 1  0 0 1 1 
   
0 0 4 0  0 0 0 4 
 ( A)  4  number of unknowns. Hence given set of vectors are linearly independent.
Hence S is a basis for M 2  2 ( R).
Q 2) Determine whether the set S  (1, t , 1  t 2 ) a basis for P2 ?
Solution: dim( P2 ( x))  3 and S has exactly 3 elements, it forms a basis for P2 ( x) iff set of vectors
are linearly independent.
Let v1  1, v2  t , v3  1  t 2
1 0 1 
 
Consider c1v1  c2v2  c3v3  0, where A  0 1 0  ( A)  3  number of unknowns
 
0 0 1 
Hence given set of vectors are linearly independent.  S forms a basis for P2 .
Note: If W is a subspace of an n-dimensional vector space, then dimension of W is less than or
equal to n.
Method of determining the dimension of a subspace: Dimension of a subspace can be determined by
finding a set of linearly independent vectors that spans the subspace. This set is a basis for the subspace
and its dimension is number of vectors in its basis.
Illustrative Examples
1. Determine the dimension of each subspace of 4 .
a) S   a, a  b, b, a  c  : a, b , c   b) S   3a, a, b, 0  : a, b 
Solution : a)  a, a  b, b, a  c   a (1, 1, 0, 1)  b(0, 1, 1, 0)  c(0, 0, 0,  1)
we can see that S is spanned by (1, 1, 0, 1), (0, 1, 1, 0) and (0, 0, 0,  1)
and can easily be shown that the set of vectors are linearly independent.
 B  (1, 1, 0, 1), (0, 1, 1, 0), (0, 0, 0, 1) is a basis for S.  dim( S )  3.

RSD Page 10
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

b)  3a, a, b, 0   a(3, 1, 0, 0)  b(0, 0, 1, 0)


we can see that S is spanned by (3, 1, 0, 0), (0, 0, 1, 0)
and can easily be shown that the set of vectors are linearly independent.
 B  (3, 1, 0, 0), (0, 0, 1, 0) is a basis for S.  dim( S )  2.
a b 
2. If W     : a, b, c  R  is a subspace of M 22 . what is a dimension of W?
0 c  
a b 1 0  0 1  0 0
Solution:    a  b  c 
0 c  0 0 0 0 0 1 
 1 0   0 1   0 0  
So, the set B    ,  ,    is a basis for W .  dim(W )  3.
 0 0  0 0 0 1  
  a  3b  2c  
  
  b  4c  3d  
3. Find the dimension of the subsapce W   : a, b, c, d  R 
  a  3c  2d  
  2a  5b  2c  d  

 a  3b  2c  1   3 2 0


 b  4c  3d  0 1  4   3
Solution :   a   b   c   d  
 a  3c  2d  1  0  3  2
         
 2a  5b  2c  5d  2 5  2  5

1   3  2   0 
 0   1   4   3
i.e W is spanned by   ,   ,   ,  
1   0   3  2 
       
 2   5   2   5 
These vectors is a basis for W if vectors are linearly independent
1 3 2 0  1 3 2 0 
0 1 4 3  R3  R1 , R4  2 R1 0 1 43 
 consider A   
1 0 3 2  0 3 52 
   
2 5 2 5  0 11 6 5 
1 3 2 0  1 3 2 0 
0 1 4 3  R4  7 R3 0
 38
1 4 3 
R3 3 R2 , R4 11R2
    ( A)  3
0 0 7 7  0 0 7 7 
   
0 0 38 38  0 0 0 0 
basis for subspace W of R 4 pivote columns of A
 1   3 2
  1  4  
 0  
basis for subspace W  B     ,  ,   dim(W)  3.
 1  0  3 
      
 2 5  2  

RSD Page 11
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

Column space, Row space and Null space of a Matrix


# Column Space of a Matrix
Let A be m  n matrix. Column space of matrix A is the set of all possible linear combinations
of columns of A, denoted as col ( A) , i.e., If A  v1 v2  vn  then
col ( A)  span v1 v2  vn 
Note : 1) Number of columns of A  n
2) Number of vectors in col ( A)  infinite.
3) col ( A) is a subspace of R m .
4) y  col ( A) means the system of linear equations y  AX for some
X  R n is consistent. i. e. col ( A)   y  R m : y  AX for some X  R n 
5) Elementary row operation on a matrix does not affect the linear dependence relation
among the columns of the matrix.
6) The Pivot columns of matrix A form a basis for Col(A).
# Row Space of a Matrix
Let A be m  n matrix. Row space of matrix A is the set of all possible linear combinations of
rows of A, denoted as row ( A) .
Note : 1) number of rows of A  m
2) number of vectors in row ( A)  infinite
3) row ( A) is a subspace of R n
4) y  row ( A) means this system of linear equations y  A T X for some X  R m
is consistent.
# Null Space of a Matrix
Let A be m  n matrix. Null space of A is the set of all those vectors in R n which get map on
to zero by A , denoted as Null ( A) , i. e. , Null ( A)  {x  R n | AX  0} .
Note : 1) Null ( A) is a subspace of R n . 0  Null ( A) . Let x1 , x2  Null ( A) , then
A x1  0, A x2  0  A ( x1  x2 )  A x1  A x2  0  x1  x2  Null ( A)
 ( A x1 )   A x1  0   A  Null ( A)
Null (A) is the subspace of R n (solution space of the homogeneous system AX  0 .)
2) If  ( A)  r , then dim(Null A)  n  r  Nullity of A.
3) dim(col A)  dim(row A)  r .
Theorem :For any matrix A m  n , dim(Null A)  dim(col A)  number of columns of A.
Illustrative Examples
1. Determine the basis for Null ( A), col ( A) and row ( A) and hence determine their
dimensions. Assume that A is row equivalent to B.
 1 3 4 1 9  1 3 0 5 7 
 2 6 6 11 10  0 0 2 3 8 
A   , B
 3 9 6 6 3  0 0 0 0 5
   
 3 9 4 9 0  0 0 0 0 0
Solution: Given : A ~ B .
Each non-pivot columns of B is a linear combination of pivot columns.
In this example it is to observe that

RSD Page 12
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

3 3
b2  3b1 and b4  5b1  b3 a2  3a1 and a4  5a1  a3
2 2
by spanning set theorem we may discard a2 and a4 , to get Basis for column space of
A, is the set containing pivot columns of A.
 1  4  9 
   6   10 
 2  
Basis for col ( A)     ,  ,  dim(col A)  3
  3  6   3  
  3   
4
 
 0  
Basis for row space of A, is the set containing pivot rows of B. Therefore Basis for row ( A)
is (1, 3, 0,5, 7), (0, 0, 2,  3,8), (0, 0, 0, 0,5) .Therefore dim(row A)  3 .
Basis for Null ( A)  is the solution space of AX  0 .
Equivalent system is x1  3x2  5 x4  7 x5  0, 2 x3  3x4  8 x5  0,5 x5  0  x5  0
Let x4  k1 & x2  k2 , x1  3k2  5k1 .
 x1  3k2  5k1   5  3   5 3 
x   k  0 1    1  
 Solution vector  2  2     . Basis for   0     .
X   x3    3k1   k1  3   k2 0  Null ( A)    3  , 0 
         1   
 x4   k1  1 0   0  
 x5   0   0  0    0  0  
dim Null ( A)  2
2. Find k such that i) Null space of A is subsapce of R k and ii) column space of A is subsapce of R k .
1 2 1 5
3 1 1 1 

where A   7 6 5 2
 
1 2 3 1
 2 0 1 3 
Solution : i ) HereAis 5  4 matrix and we knowthat Null spaceis a subspace of R 4 ,  k  4.
ii ) HereAis 5  4 matrix and we knowthat column spaceis a subspace of R 5 ,  k  5.
 8 2 9  2
[Link] A   6 4 8  and w   1  .
 
 4 0 4   2 
i )determine if w is in column space of A. ii) Is w in null space of A? iii ) Is w in row space of A?

RSD Page 13
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

Solution: i) w will be in column space of A, if there exists some vector x  R 3


such that Ax  w is consistant.
 8 2 9 2  R  2 0 2 1  2 0 2 1
let  A, w   6 4 8 1    6 4 8 1   0 4 2 4 
  
R1  2
2 R2 3 R1 , R3  4 R1

 4 0 4 2   8 2 9 2  0 2 1 2 

1
2 0 2 1
  0 4 2 4     A, w    A  2,  the system of linear equations is consistant.
R3  R2
 2

 0 0 0 0 
 w  col ( A)
ii ) w is in null ( A) if and only if Aw  0
 8 2 9   2  0 
Aw   6 4 8   1   0   w  null ( A).
 4 0 4   2  0 
iii ) w will be in row space of A, if there exists some vector x  R 3
such that AT x  w is consistant
 8 6 4 2  1 2 0 0  1 2 0 0 
 AT , w   2 4 0 1  R1  R3
  2 4 0 1  
R2  2 R1 , R3  9 R1
 0 0 0 1 

 9 8 4 2   9 8 4 2  0 10 4 2 
1 2 0 0 
R2  R3
 0
 10 4 2    A, w    A.  w  Row( A).
0 0 0 1 
4. If AX  V and AX  W are both consistant. Is the equation AX  V  W consistant?
Solution: AX  V is consistant means V  col ( A), and AX  W is consistant means W  col ( A).
But col ( A) is a subspace.V  W  Col ( A) AX  V  W is consistant.
5  1  2
5. Let H  Span v1 , v2  and W  u1 , u2  , where v1  3 , v2   3  , u1   1 ,
   

8  4  4 
0 
and u2  0  and K  H  W , find the basis for K .
1 
Solution : Geometrically H and W are the plains in R3. H W is a line of intersection of the
planes H and W .  K can be written as c1v1  c2v2 and also as c3u1  c4u4 .

5 1 2 0 (A)  3
Coefficient matrix A  3 3 1 0 
8 4 4 1
1 5 4 0
By reducing it to echelon form A  0 12 11 0 
RSD 0 0 3 1 Page 14
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology, Pune -37.
Department of Engineering Science & Humanities(DESH)
Linear Algebra and Differential Equations (LADE HS1071)
Vector Spaces

Let c4  k  free variable 


1 11 7 7 11 1
c3   k , c2  k , c1   k .Thus c1   k , c2  k , c3   k , c4  k
3 36 36 36 36 3
Every vector in K is either c1v1  c2 v2 or c3u1  c4u2 .
5  1   24k / 36   2 
7   11     k 
 k 3  k  3    12k / 36    1 
36 36 3
8  4   12k / 36   1
2 0  2    2  
 
OR  k  1  k 0    1  Basis for K    1   .
1     k 
3 3   1 
 4  1   1   

RSD Page 15

Common questions

Powered by AI

The span of a set is the collection of all possible linear combinations of that set's vectors. It plays a central role in vector spaces by forming a subspace that the set can generate. Spanning sets are used to determine bases for vector spaces, where a basis both spans the space and is linearly independent .

Scalar multiplication is critical to defining a vector space as it dictates how vectors are scaled within the space. Deviating from standard multiplication operations can violate vector space axioms, leading to potential issues such as non-closure. For example, if scalar multiplication is defined as operating only on the x-component of a vector and setting others to zero (as with (c,0,0)), it leads to contradictions with standard vector space expectations .

A subset U of a vector space V is considered a subspace if it meets two criteria: it must be non-empty and closed under addition and scalar multiplication. Specifically, for any vectors u1, u2 in U, their sum (u1 + u2) must also be in U. Similarly, for any scalar and vector u in U, the product (αu) must also be in U. Additionally, the zero vector from V must be included in U to meet the identity element requirement .

A set of vectors is linearly independent if no vector in the set can be represented as a linear combination of the others. This property is crucial when determining a basis because a basis needs to provide unique representations for all vectors in the space, which is only possible if the basis set is linearly independent. This ensures that the removal or replacement of any vector in a basis diminishes its ability to span the space .

Yes, a vector space can have multiple bases. Different bases for the same vector space vary in terms of the vectors they contain, though all will have the same number of vectors equal to the space's dimension. Each basis provides a unique linear combination representation for vectors within the space, though they all effectively 'span' the entire vector space .

The set of points (x, y) where y = mx forms a subspace of R^2 if and only if m is a fixed real number and the set includes the origin point (0,0). This set is essentially a line through the origin and satisfies closure under vector addition and scalar multiplication, hence forming a subspace .

A given set of vectors in R^n forms a basis for the space if it is both linearly independent and spans R^n. Linear independence means no vector in the set is a linear combination of others, and spanning means every vector in R^n can be expressed as a linear combination of the set's vectors. Furthermore, the number of vectors in the basis set must equal the dimension of R^n .

The column space of a matrix is determined by the linear independence of its columns. It is the set of all linear combinations of the matrix's columns. A well-defined column space implies that the columns form a basis and thus span a subspace of R^m where m is the number of rows. This is significant because it directly corresponds to the set of possible outputs or images for linear transformations represented by the matrix, impacting the rank and solvability of associated systems of equations .

The set of integers is not considered a vector space because it does not satisfy the vector space axioms related to scalar multiplication. Specifically, the set of integers is not closed under scalar multiplication when the scalars come from a set of real numbers. For instance, multiplying an integer by a non-integer scalar (such as 1/3 * 2) results in a non-integer, violating the closure axiom .

Closure under addition and scalar multiplication ensures that performing standard vector operations within a subspace does not result in vectors that exit the subset. Closure under addition ensures the sum of any two vectors in the subspace is also in the subspace, maintaining its internal consistency. Similarly, closure under scalar multiplication ensures any scaling of a vector by a real number remains within the subspace, which is essential for maintaining the subspace's integrity under linear transformations .

You might also like