15MAT301 - Linear Algebra

- S. Santhakumar

4.1
THEOREM:
a)A finite set that contains 0 is linearly dependent.
b)A set with exactly one vector is linearly independent if and
only if that vector is not 0.
c)A set with exactly two vectors is linearly independent if
and only if neither vector is a scalar multiple of the other.

4.2
Example: Consider the vector space of all polynomials of
degree less than or equal to 5 & the set of vectors S  1, x  3, 0
For this set the relationk1 (1)  k 2 x  3 k3 0  0 having
infinite number of solution.k1 0, k 2 0, k3 can be any scalar
value..
Hence S is linearly dependent.

4.3
 Two vectors in R 2
R3 or are linearly independent if and
only if they do not lie on the same line passing through the
origin.

4.4
 3
 Three vectors in R are linearly independent if and only if
they do not lie in the same plane which passing through the
origin.

4.5
Basis & dimension:
If V is any vector space and S v1 , v2 ,  , vr  is a finite
set of vectors in V, then S is called a basis for V if the following
two conditions hold:
linearly Bases Spans V
1.S is linearly independent. independent

2.S spans V.
V
The dimension of a vector space V is denoted by dim(V) and
is defined to be the number of vectors in a basis of V.
In addition, the zero vector space is defined to have
dimension zero.
4.6
 over ℝ and unit
n
Example: Consider the vector space R

vectors S 1, 0, 0,  , 0 , 0,1, 0,  , 0 ,  , 0, 0, 0,  , 1

Set of all these unit vectors is a linearly

independent and it will span the entire space .

n
R

Hence it will form a basis. We will used to call it

standard basis of .
n
R

Clearly, number of element in the basis is n.

Hence the dimension of is n.

n
R
 Consider the vector space
M3 of all 3⨉3 – matrices &
the set of vectors
 1 0 0   1 0 0  1 0 0  0 1 0  0 1 0 
     
 0 0 0 ,  1 0 0 ,  1 0 0  ,  0 0 0  ,  0 1 0  ,
  0   0 0 0   1 0 0   0 0 0   0 0 0  
 0 0 
S  
 0 1 0  0 0 1  0
 
0 1   0 0 1
  
 0 1 0 ,  0 0 0 ,  0 0 1  ,  0 0 1 
 
 0 1
 0   0 0 0   0  
0 0   0 0 1  
We already saw that it is a linearly independent set.


We have to check whether it can span the space? or

not?
 1 0 0  1 0 0 1 0 0  0 1 0  0 1 0
         
k1  0 0 0   k 2  1 0 0   k3  1 0 0   k 4  0 0 0   k5  0 1 0 
 0 0 0  0 0 0 1 0 0   0 0 0  0 0 0
        
 0 1 0  0 0 1 0 0 1  0 0 1  a11 a12 a13 
         
 k 6  0 1 0   k 7  0 0 0   k8  0 0 1   k9  0 0 1  a21 a22 a23 
 0 1 0  0 0 0 0 0 0   0 0 1  a 
        31 a32 a33 
 k1  k 2  k3 k 4  k5  k 6 k 7  k8  k9   a11 a12 a13 
   
 k 2  k3 k5  k 6 k8  k9   a21 a22 a23 
 k3 k6 k9  a a32 a33 
   31

 k1  k 2  k3 a11 k 4  k5  k 6 a12 k 7  k8  k9 a13 

 
 k 2  k3 a21 k5  k 6 a22 k8  k9 a23 
 k3 a31 k 6 a32 k9 a33 
 

It is very clear that, the above system of

equations having unique solution. Hence S span

entire space V.

Therefore we can
M 3 conclude that S is the basis of
Some vector space and its standard basis & dimension:
Vector Space Standard Basis Dimension
Rn (Set of all n- 1, 0, 0,, 0, 0,1, 0,, 0,
tuples of real n
 , 0, 0, 0,  , 1
numbers)
R  (Set of all real 1, 0, 0,, 0,1, 0, ,
sequence or infinite  , 0, 0, 0, ,  is not a -
tuples) basis. (Find why? Assignment)
Pn (Set of all
polynomial of degree
less than or equal to n)
 1, x , x 2
,, x n  n+1

Mn (Set of all n⨉n S  eij  M n | eij is matrix

matrices ) with 1 in ijth term 0 in rest  n n n 2

M mn (Set of all m⨉n S  eij  M n | eij is matrix

m n mn
matrices ) with 1 in ijth term 0 in rest 
{0}( Zero Space) No basis. 0
Some theorems:
 All bases for a finite-dimensional vector space have the same
number of vectors.

 Let V be a finite-dimensional vector space, and let S be any

basis.
a) If a set has more than n vectors, then it is linearly
dependent.

b) If a set has fewer than n vectors, then it does not span V.

4.11
THEOREM: (Plus/Minus Theorem)
Let S be a nonempty set of vectors in a vector space V, then
we get the following
a) If S is a linearly independent set, and if v is a vector in V that
is outside of Span(S), then the set S⋃{v} that results by
inserting v into S is still linearly independent.
b) If v is a vector in S that is expressible as a linear combination
of other vectors in S, and if S-{v} denotes the set obtained
by removing v from S, then S-{v} span the same space; that
is,
Span (S) = Span (S – {v})
4.12
THEOREM:
Let V be an n-dimensional vector space, and let S be a set in V
with exactly n vectors. Then the following are equivalent
a)S is a basis for V;
b)S spans V;
c)S is linearly independent.

Example: Consider the vector space of all polynomials of

degree less than or equal to 2, P2 & the set of vectors


S  1, x  3, x 2  3
Here it is very clear that S is linearly

independent.P2Also, dimension of P2 is 3. Hence S is

THEOREMS:
Let S be a finite set of vectors in a finite-dimensional
vector space V.
a) If S spans V but is not a basis for V, then S can be reduced to a
basis for V by removing appropriate vectors from S.
b) If S is a linearly independent set that is not already a basis for
V, then S can be enlarged to a basis for V by inserting
appropriate vectors into S.

 If W is a subspace of a finite-dimensional vector space V, then:

a) W is finite-dimensional;
b) dim(W) ≤ dim(V);
c) W = V if and only if dim(W) = dim(V).
 If dim(V) = n
V

linearly Bases Spans V

independent

# (S) ≤ n # (S) ≥ n

# (S) = n

4.15
4.16
4.17
4.18
4.19
THEOREM: ( Uniqueness of Basis Representation )
If S v1 , v2 ,  , vr  is a basis for a vector space V, then
every vector v in V can be expressed in the form
v k1v1  k 2 v2    k r vr

in exactly one way.

Proof: v 
Letk1v1  k 2 v2    k r vr v c1v&
1  c2 v2    cr vr

are two expression of v. Then

k1v1  k 2 v2    k r vr c1v1  c2 v2    cr vr

⟹ k1  c1 v1  k 2  c2 v2    k r  cr vr 0

Since S is linearly independent,

k1  c1 0, k 2  c2 0,  , k r  cr 0

Hence v can be expressed in unique way. 4.20

Coordinates relative to the basis:
If S v1 , v2 ,  , vr  is a basis for a vector space V, and
v k1v1  k 2 v2    k r vr

is the expression for a vector v in terms of the basis S, then the

scalars k1 , k 2 ,  , k r are called the coordinates of v relative to the
basis S.
The vector k1 , k 2 ,  , k r 
𝑛
𝑅
in constructed from these
coordinates is called the coordinate vector of v relative to S; it is
denoted by v S k1 , k 2 ,  , k r 

4.21
Example:

Consider the vector space of all polynomial of degree less

P4 to 4, S  x 4 , x 3 , x 2  x  1, x  1, 1
than or equal and a basis

. Then every vector p(x) can be expressed as linear

p( x)  x 4  x 2  2 x  1
combination of S.
p ( x) 1x 4  0x 3  1x 2  x  1 1x  1 1(1)
For example, take . Then its linear

expression is .
q ( x) 4 x 4  3 x 3  2 x 2  x
Hence its coordinate form is (1, 0, 1, 1, -1).

Similarly, the coordinate form of is

4.22
 M2
Consider the vector space and its standard basis.

Then every vector ( 2⨉2 - matrices ) can be expressed as

linear combination of standard basis.

 2 3
For example, take  1 2  . Then its linear expression is
 
 2 3  1 0  0 1  0 0  0 0
  2   3   1   2 
 1 2  0 0  0 0  1 0  0 1

Hence its coordinate form is (2, 3, 1, 2).

 0 1
Similarly, the coordinate form of  0 7  is (0, 1, 0, 7).
 
4.23
Coordinate Map:
If S v1 , v2 ,  , vr  is a basis for a finite - dimensional
vector space V, and if v S k1 , k 2 ,  , k r  is the coordinate
vector of v relative to S. Then, we can define a map  S : V  Rn

by  S k1 , k 2 ,  , k r .
This map  S is called coordinate map.

In above examples:
→ (1, 0, 1, 1,
4 2
p ( x )  x  x  2 x 1

-1) q ( x) 4 x 4  3 x 3  2 x 2  x

→ (4, 3, 2, -1, -1).

 2 3  0 1
   
 1 2  0 7
 → (1, 0, 1, 1, -1), → (4,4.24
Relation in change of basis :

If we change the basis for a vector space V from an old basis

B  u1 , u 2 ,  , u r 
to a new basis B '  u1, u 2 ,  , u r , then for

each vector v in V, the old coordinate vector

v B is related to the

new coordinate vector

v B ' by the equation
v B P v B '

where the columns of P are the coordinate vectors of the new

basis vectors relative to the old basis; that is, the column vectors of

P are u1B , u2 B , u3 B ,, un B

4.25
Transition Matrices :

The matrix P in
v B P v B '
is called the transition matrix

from B’ to B.

For emphasis, we will often denote it by PB ' B . This matrix

can be expressed in terms of its column vectors as

PB ' B  u1B | u 2 B | u3 B |  | u n B 

Similarly, the transition matrix from B to B’ can be expressed

in terms of its column vectors as

PB  B '  u1 B ' | u 2 B ' | u3 B ' |  | u n B ' 
4.26
Finding Transition Matrices :
Consider the bases B  (1, 0), (0,1)  and B'  (1,1), (2,1) 
2
for R , where
PB ' B
Find the transition matrix from B’ to B.
PB  B '
Find the transition matrix from B to B’.

Soln: Find PB ' B

(1, 1) = 1 (1, 0) + 1(0, 1) & (2, 1) = 2(1, 0) + 1 (0, 1)
1 2 
PB ' B  
1 1 
(1, 0) = -1 (1, 1) + 1(2, 1) & (0, 1) = 2(1, 1) - 1 (2, 1)
 1 2 
PB  B '  
 1  1 4.27
Theorem :
If P is the transition matrix from a basis B’ to a basis B for
1
P
a finite-dimensional vector space V, then P is invertible and is

the transition matrix from B to B’.

B '  u1 , u 2 ,  , u n 
n
Let R
be any basis for the
 eand ,  , en 
n
vector Sspace 1 , e2let R
be the

standard basis for . If the vectors in these bases

P
B 'form,
are written in column S  u | u 2 |  | u n 
then
1

4.28
Thank
You
4.29