Module 2

Vector Spaces
4.1 Vectors in Rn
4.2 Vector Spaces
4.3 Subspaces of Vector Spaces
4.4 Spanning Sets and Linear Independence
4.5 Basis and Dimension
4.6 Rank of a Matrix and Systems of Linear
Equations
4.7 Coordinates and Change of Basis
1
 n
4.1 Vectors in R

An ordered n-tuple:
a sequence of n real number ( x1 , x2 , , xn )

 n-space: Rn
the set of all ordered n-tuple

2/107

Ex:
1
n=1 R = 1-space
= set of all real number
2
n=2 R = 2-space
= set of all ordered pair of real numbers ( x1 , x2 )
3
n=3 R = 3-space
= set of all ordered triple of real numbers ( x1 , x2 , x3 )

n=4 4
R = 4-space
= set of all ordered quadruple of real numbers ( x1 , x2 , x3 , x4 )

3/107

Notes:
(1) An n-tuple ( x1 , x2 , , xn ) can be viewed as a point in R
n

with the xi’s as its coordinates.

( x , x ,  , xn )
(2) An n-tuple 1 2 can be viewed as a vector
x  ( x1 , x2 ,, xn )
in Rn with the xi’s as its components.
 Ex:

 x1 , x2   x1 , x2 

 0,0
a point a vector

4/107
 u   u1 , u2 ,  , un  , v   v1 , v2 , , vn  (two vectors in Rn)

 Equal:
u  v if and only if u1  v1 , u2  v2 ,  , un  vn

 Vector addition (the sum of u and v):

u  v   u1  v1 , u2  v2 ,  , un  vn 

 Scalar multiplication (the scalar multiple of u by c):

cu   cu1 , cu2 ,  , cu n 

 Notes:
The sum of two vectors and the scalar multiple of a vector
n
in R are called the standard operations in Rn.
5/107
 Negative:
 u  (u1 ,u2 ,u3 ,...,un )
 Difference:
u  v  (u1  v1 , u2  v2 , u3  v3 ,..., un  vn )

 Zero vector:
0  (0, 0, ..., 0)

 Notes:
(1) The zero vector 0 in Rn is called the additive identity in Rn.
(2) The vector –v is called the additive inverse of v.

6/107

Thm : (Properties of vector addition and scalar multiplication)
n
Let u, v, and w be vectors in R , and let c and d be scalars.
(1) u+v is a vector in Rn
(2) u+v = v+u
(3) (u+v)+w = u+(v+w)
(4) u+0 = u
(5) u+(–u) = 0
(6) cu is a vector in Rn
(7) c(u+v) = cu+cv
(8) (c+d)u = cu+du
(9) c(du) = (cd)u
(10) 1(u) = u
7/107

Ex 5: (Vector operations in R4)
Let u=(2, – 1, 5, 0), v=(4, 3, 1, – 1), and w=(– 6, 2, 0, 3) be
4
vectors in R . Solve x for x in each of the following.
(a) x = 2u – (v + 3w)
(b) 3(x+w) = 2u – v+x
Sol: (a) x  2u  ( v  3w )
 2u  v  3w
 (4,  2, 10, 0)  (4, 3, 1,  1)  (18, 6, 0, 9)
 (4  4  18,  2  3  6, 10  1  0, 0  1  9)
 (18,  11, 9,  8).

8/107
(b) 3(x  w )  2u  v  x
3x  3w  2u  v  x
3x  x  2u  v  3w
2x  2u  v  3w
x  u  12 v  32 w
  2,1,5,0     2, 23 , 21 , 12    9,3,0, 29 
  9, 211 , 92 ,4 

9/107

Thm : (Properties of additive identity and additive inverse)
n
Let v be a vector in R and c be a scalar. Then the following is true.
(1) The additive identity is unique. That is, if u+v=v, then u = 0
(2) The additive inverse of v is unique. That is, if v+u=0, then u = –v
(3) 0v=0
(4) c0=0
(5) If cv=0, then c=0 or v=0
(6) –(– v) = v

10/107

Linear combination:
The vector x is called a linear combination of v 1 , v 2 ,..., v n ,

if it can be expressed in the form c , c ,  , c : scalar

x  c1 v 1  c2 v 2    cn v n 1 2 n
 Ex 6:
Given x = (– 1, – 2, – 2), u = (0,1,4), v = (– 1,1,2), and
3
w = (3,1,2) in R , find a, b, and c such that x = au+bv+cw.
Sol: b  3c  1
a  b  c  2
4a  2b  2c   2
 a  1, b  2, c  1
Thus x  u  2 v  w
11/107
 Notes:
A vector u  (u1 , u2 ,  , un ) in R can be viewed as:
n

a 1×n row matrix (row vector): u  [u1 , u 2 , , un ]

or u1 
u 
a n×1 column matrix (column vector): u   
2


 
un 

(The matrix operations of addition and scalar multiplication

give the same results as the corresponding vector operations)

12/107
 Vector addition Scalar multiplication
u  v  (u1 , u2 , , un )  (v1 , v2 ,  , vn ) cu  c(u1 , u2 ,  , un )
 (u1  v1 , u2  v2 ,  , un  vn )  (cu1 , cu 2 , , cun )
u  v  [u1 , u2 ,  , un ]  [v1 , v2 , , vn ] cu  c[u1 , u2 , , un ]
 [u1  v1 , u2  v2 ,  , un  vn ]  [cu1 , cu 2 , , cun ]
u1  v1  u1  v1  u1  cu1 
u  v  u  v  u  cu 
u v   2   2   2 2 cu  c  2    2 
          
         
u v u
 n  n  n n  v un  cun 

13/107
 Keywords :
 ordered n-tuple
 n-space
 equal
 vector addition
 scalar multiplication
 negative
 difference
 zero vector
 additive identity
 additive inverse

14/107
 Vector Spaces

Vector spaces:
Let V be a set on which two operations (vector addition and
scalar multiplication) are defined. If the following axioms are
satisfied for every u, v, and w in V and every scalar (real
number) c and d, then V is called a vector space.
Addition:
(1) u+v is in V
(2) u+v=v+u
(3) u+(v+w)=(u+v)+w
(4) V has a zero vector 0 such that for every u in V, u+0=u=0+u
(5) For every u in V, there is a vector in V denoted by –u
such that u+(–u)=0=(-u)+u
15/107
Scalar multiplication:
cu
(6) is in V.
c(u  v)  cu  cv
(7)
(c  d(8)
)u  cu  du

 (cd )u
c(du)(9)

)u
1(u(10)

16/107

Notes:
(1) A vector space consists of four entities:
a set of vectors, a set of scalars, and two operations
V ： nonempty set
c ： scalar
 (u, v )  u  v： vector addition
 (c, u)  cu： scalar multiplication
V , ,  is called a vector space

(2) V   0： zero vector space

17/107
 
Examples of vector spaces:
(1) n-tuple space: Rn
(u1 , u2 ,, un )  (v1 , v2 ,, vn )  (u1  v1 , u2  v2 ,, un  vn ) vector addition
k (u1 , u2 ,  , un )  (ku1 , ku 2 , , kun ) scalar multiplication

(2) Matrix space: V  M mn ( the set of all m×n matrices with real values)

Ex: ： (m = n = 2)
u11 u12   v11 v12   u11  v11 u12  v12 
u u   v v   u  v u  v  vector addition
 21 22   21 22   21 21 22 22 
u11 u12   ku11 ku12 
k    scalar multiplication
u21 u22  ku21 ku 22 
18/107
Example: Given the set of all triples of real numbers
( x, y, z ) with the operations
( x, y , z )  ( x ', y ', z ')  ( x  x ', y  y ', z  z ') and
k ( x, y , z )  ( kx, y , z )
Show that it’s not a vector space under the given operation.
 The Zero Vector Space

Let V consist of a single object, which we denote by 0,

and define

0 + 0 = 0 and k 0 = 0 for all scalars k.

It’s easy to check that all the vector space axioms are
satisfied.

We called this the zero vector space.

(3) n-th degree polynomial space: V  Pn (x)
(the set of all real polynomials of degree n or less)

p( x)  q( x)  (a0  b0 )  (a1  b1 ) x    (an  bn ) x n

kp ( x)  ka0  ka1 x    kan x n

(4) Function space: V  c(, ) (the set of all

real-valued
continuous functions defined on the entire real
( f  g )( x)  f ( x)  g ( x)
line.)
(kf )( x)  kf ( x)

21/107
 Thm : (Properties of scalar multiplication)
Let v be any element of a vector space V, and let c be any
scalar. Then the following properties are true.
(1) 0 v  0
(2) c0  0
(3) If cv  0, then c  0 or v  0
(4) (1) v   v

22/107

Notes: To show that a set is not a vector space, you need
only find one axiom that is not satisfied.
 Ex 6: The set of all integer is not a vector space.
Pf: 1  V , 12  R
( 12 )(1)  12  V (it is not closed under scalar multiplication)
  
scalar noninteger
integer

 Ex 7: The set of all second-degree polynomials is not a vector space.

Let p ( x)  x and q ( x)   x  x  1
2 2
Pf:
 p( x)  q( x)  x  1 V
(it is not closed under vector addition)
23/107

Ex 8:
V=R2=the set of all ordered pairs of real numbers defined by
vector addition: (u1 , u 2 )  (v1 , v2 )  (u1  v1 , u2  v2 )
scalar multiplication: c(u1 , u2 )  (cu1 ,0)
Verify V is not a vector space.
Sol:
1(1, 1)  (1, 0)  (1, 1)
 the set (together with the two given operations) is
not a vector space

24/107
 PRACTICE QUESTIONS

Let V be the set of all pairs (x,y) of real numbers. Suppose th
at an addition and scalar multiplication of pairs are defined b
y (x , y)+(u , v)=(x+2u,y+2v), k (x , y)=(k x, k y).
Is the set V a vector space under those operations? Justify yo
ur answer.


Let A be an m x n matrix. Then the set of all solutions of the
homogeneous system Ax=0 is a vector space(under the sum a
nd the scalar multiplication of matrices)

25/107
 Keywords :
 vector space
 n-space
 matrix space
 polynomial space
 function space

26/107
 Subspaces of Vector Spaces

Subspace:
(V ,,) : a vector space
W  
 : a nonempty subset
W V
(W ,,)： a vector space (under the operations of addition and
scalar multiplication defined in V)
 W is a subspace of V
 Trivial subspace:
Every vector space V has at least two subspaces.
(1) Zero vector space {0} is a subspace of V.
(2) V is a subspace of V.
27/107

Thm 4.5: (Test for a subspace)
If W is a nonempty subset of a vector space V, then W is
a subspace of V if and only if the following conditions hold.

(1) If u and v are in W, then u+v is in W.

(2) If u is in W and c is any scalar, then cu is in W.

28/107
Equivalent Definition of a subspace

A non-empty subset W of a vector space V is a subspace if an
d only if x+ky is in W.

29/107

Ex: Subspace of R2
(1)  0 0   0, 0 
(2) Lines through the origin
(3) R 2


Ex: Subspace of R3
(1)  0 0   0, 0, 0 
(2) Lines through the origin
(3) Planes through the origin
(4) R 3

30/107
 Ex 2: (A subspace of M2×2)
Let W be the set of all 2×2 symmetric matrices. Show that
W is a subspace of the vector space M2×2, with the standard
operations of matrix addition and scalar multiplication.
Sol:
W  M 22 M 22 : vector sapces
Let A1, A2  W ( A1T  A1, A2T  A2 )
A1  W, A2  W  ( A1  A2 )T  A1T  A2T  A1  A2 ( A1  A2  W )
k  R , A  W  (kA)T  kAT  kA ( kA W )
W is a subspace of M 22

31/107
 Ex 3: (The set of singular matrices is not a subspace of M2×2)
Let W be the set of singular matrices of order 2. Show that
W is not a subspace of M2×2 with the standard operations.
Sol:
1 0  0 0 
A  W , B    W
0 0 0 1 

1 0 
A B    W
0 1 
W2 is not a subspace of M 22

32/107
 Ex 4: (The set of first-quadrant vectors is not a subspace of R2)
Show that W  {( x1 , x2 ) : x1  0 and x2  0}, with the standard
2
operations, is not a subspace of R .

Sol:
Let u  (1, 1)  W
  1 u    11, 1    1,  1  W (not closed under scalar
multiplication)
W is not a subspace of R 2

33/107
 Ex 6: (Determining subspaces of R2)
2
Which of the following two subsets is a subspace of R ?
(a) The set of points on the line given by x+2y=0.
(b) The set of points on the line given by x+2y=1.
Sol:
(a) W   ( x, y ) x  2 y  0   (2t , t ) t  R
Let v1    2t1 , t1   W v2    2t 2 , t 2   W

v1  v2    2 t1  t 2  ,t1  t 2   W (closed under addition)

kv1    2 kt1  , kt1   W (closed under scalar multiplication)

W is a subspace of R 2

34/107
(b) W    x, y  x  2 y  1 (Note: the zero vector is not on the
line)
Let v  (1,0)  W

  1 v    1,0   W
W is not a subspace of R 2

35/107
 Ex 8: (Determining subspaces of R3)
Which of the following subsets is a subspace of R 3?
(a) W   ( x1 , x2 ,1) x1 , x2  R
(b) W   ( x1 , x1  x3 , x3 ) x1 , x3  R
Sol:
(a) Let v  (0,0,1)  W
 (1) v  (0,0,1)  W
W is not a subspace of R 3
(b) Let v  ( v1 , v1  v 3 , v 3 )  W , u  (u1 , u1  u 3 , u 3 )  W
 v  u   v1  u1 ,  v1  u1    v 3  u 3  , v 3  u 3   W
kv   kv1 ,  kv1    kv 3  , kv 3   W
W is a subspace of R 3
36/107
 PRACTICE QUESTIONS

Which of the following sets are subspaces of the 3-space R3 ?
1. W  {( x, y, z )  R3 : xyz  0}
2. W  {(2t ,3t , 4t )  R 3 : t  R}
3. W  {( x, y, z )  R 3 : x 2  y 2  z 2  0}
4. W  ( x  R 3 : xT u  0  xT v} , where u and v are any
two fixed nonzero vectors in R3 .

37/107
 Thm 4.6: (The intersection of two subspaces is a subspace)

If V and W are both subspaces of a vector space U ,

then the intersection of V and W (denoted by V  U )
is also a subspace of U .

38/107
 DEFINITIONS

The sum of U and W is defined by
U  W  {u  w V : u U , w W }

A vector space V is called the direct sum of two subspaces U
and W written as V  U  W , if V=U+W and U  W  {0}
Note: U+W and U  W are also subspaces of V.
Example:
Theorem: Avector space V is the direct sum of subspaces U an
d W (ie) V  U  W , if and only if for any vԑV there exist uni
que u  U , w such
W that v=u+w.

39/107
Keywords in Section 4.3:

Subspace ：

trivial subspace ：

40/107
 TRY


Let V be the vector space of all 3×3 real matrices.
Let A be the matrix given below and we define
W={M∈V∣AM=MA}.


That is, W consists of matrices that commute with A.
Then W is a subspace of V.


Determine which matrices are in the subspace W

and find the dimension of W.

41/107
 4.4 Spanning Sets and Linear Independence
 Linear combination:
A vector v in a vector space V is called a linear combination of
the vectors u1,u 2 , ,u k in V if v can be written in the form

v  c1u1  c2u 2    ck u k c1,c2 , ,ck : scalars

42/107
 Ex 2-3: (Finding a linear combination)
v1  (1,2,3) v 2  (0,1,2) v 3  (1,0,1)
Prove (a) w  (1,1,1) is a linear combination of v1 , v 2 , v 3
(b) w  (1,2,2) is not a linear combination of v1 , v 2 , v 3
Sol:
(a) w  c1 v1  c2 v 2  c3 v 3
1,1,1  c1 1,2,3  c2  0,1,2  c3   1,0,1
 (c1  c3 , 2c1  c2 , 3c1  2c2  c3 )

c1  c3 1
 2c1  c2 1
3c1  2c2  c3 1

43/107
 1 0  1 1 1 0  1 1 
 2 1 0 1       0 1 2  1
Guass  Jordan Elimination
 
3 2 1 1 0 0 0 0 

 c1  1  t , c2  1  2t , c3  t

(this system has infinitely many solutions)

t 1
 w  2 v1  3 v 2  v 3

44/107
(b)
w  c1 v1  c2 v 2  c3 v 3

1 0  1 1  1 0  1 1 
 2 1 0  2       0 1 2  4 
Guass  Jordan Elimination
 
3 2 1 2  0 0 0 7 

 this system has no solution (0  7)

 w  c1 v1  c2 v 2  c3 v 3

45/107
 the span of a set: span (S)

If S={v1, v2,…, vk} is a set of vectors in a vector space V,

then the span of S is the set of all linear combinations of
the vectors in S,
span (S )  c1 v1  c2 v 2    ck v k ci  R
(the set of all linear combinations of vectors in S )
 a spanning set of a vector space:

If every vector in a given vector space can be written as a

linear combination of vectors in a given set S, then S is
called a spanning set of the vector space.

46/107
 Notes:
span ( S )  V
 S spans (generates) V
V is spanned (generated) by S
S is a spanning set of V

 Notes:
(1) span( )   0
(2) S  span ( S )
(3) S1 , S 2  V
S1  S 2  span ( S1 )  span( S 2 )

47/107
 Ex 5: (A spanning set for R3)
Show that the set S   (1,2,3), (0,1,2), (2,0,1) spans R 3
Sol:
We must determine whether an arbitrary vector u  (u1 , u2 , u3 )
in R 3 can be as a linear combination of v1 , v 2 , and v 3 .
u  R 3  u  c1 v1  c2 v 2  c3 v 3
 c1  2c3  u1
2c1  c2  u2
3c1  2c2  c3  u3
The problem thus reduces to determining whether this system
is consistent for all values of u1 , u2 , and u3 .

48/107
 1 0 2
A  2 1 0 0
3 2 1

 Ax  b has exactly one solution for every u.

 span( S )  R 3

49/107
 Thm 4.7: (Span(S) is a subspace of V)

If S={v1, v2,…, vk} is a set of vectors in a vector space V,

then
(a) span (S) is a subspace of V.
(b) span (S) is the smallest subspace of V that contains S.
(Every other subspace of V that contains S must contain span (S).)

50/107
 Linear Independent (L.I.) and Linear Dependent (L.D.):
S   v1 , v 2 , , v k  : a set of vectors in a vector space V
c1 v1  c2 v 2    ck v k  0

(1) If the equation has only the trivial solution (c1  c2    ck  0)

then S is called linearly independent.
(2) If the equation has a nontrivial solution (i.e., not all zeros),
then S is called linearly dependent.

51/107
 Notes:
(1)  is linearly independent
(2) 0  S  S is linearly dependent.
(3) v  0   v is linearly independent
(4) S1  S 2
S1 is linearly dependent  S 2 is linearly dependent

S 2 is linearly independent  S1 is linearly independent

52/107
 Ex 8: (Testing for linearly independent)
3
Determine whether the following set of vectors in R is L.I. or L.D.
S   1, 2, 3 ,  0, 1, 2  ,   2, 0, 1
v1 v2 v3
Sol: c1  2c3  0
c1 v1  c2 v 2  c3 v 3  0  2c1  c2  0
3c1  2c2  c3  0
1 0  2 0  1 0 0 0
 2 1 0 0 Gauss
   0 1 0 0
- Jordan Elimination

3 2 1 0 0 0 1 0

 c1  c2  c3  0  only the trivial solution 
 S is linearly independent
53/107

Ex 9: (Testing for linearly independent)
Determine whether the following set of vectors in P2 is L.I. or L.D
.
S = {1+xv–1 2x2 , 2+5x
v2– x2 , x+x
v32}
Sol:
c1v1+c2v2+c3v3 = 0
i.e. c1(1+x – 2x2) + c2(2+5x – x2) + c3(x+x2) = 0+0x+0x2

c1+2c2 =0 1 2 0 0 1 2 0 0 
1  G. J.  1 
 c1+5c2+c3 = 0   5 1 0    1 1
3
0 
 2  1 1 0 0 0 0 0 
–2c1 – c2+c3 = 0  
 This system has infinitely many solutions.
(i.e., This system has nontrivial solutions.)
 S is linearly dependent. (Ex: c1=2 , c2= – 1 , c3=3)
54/107

Ex 10: (Testing for linearly independent)
Determine whether the following set of vectors in 2×2
matrix space is L.I. or L.D.
2 1 3 0 1 0 
S    ,  , 
 0 1  2 1   2 0 
v1 v2 v3
Sol:
c1v1+c2v2+c3v3 = 0

2 1  3 0  1 0  0 0 
c1    c2    c3    
 0 1  2 1   2 0   0 0 

55/107
 2c1+3c2+ c3 = 0
c1 =0
2c2+2c3 = 0
c1+ c2 =0
 2 3 1 0 1 0 0 0
1 0 0 0 Gauss - Jordan Elimination 0
 1 0 0
       
0 2 2 0 0 0 1 0
   
1 1 0 0 0 0 0 0

 c1 = c2 = c3= 0 (This system has only the trivial solution.)

 S is linearly independent.

56/107

Thm 4.8: (A property of linearly dependent sets)
A set S = {v1,v2,…,vk}, k2, is linearly independent if and
only if at least one of the vectors vj in S can be written as
a linear combination of the other vectors in S.
Pf:
() c1v1+c2v2+…+ckvk = 0

S is linearly dependent
 ci  0 for some i
c1 ci 1 ci 1 ck
 v i  v1    v i 1  v i 1    v k
ci ci ci ci
57/107
 ()
Let vi = d1v1+…+di-1vi-1+di+1vi+1+…+dkvk

 d1v1+…+di-1vi-1-vi+di+1vi+1+…+dkvk = 0

 c1=d1, …,ci-1=di-1, ci=-1,ci+1=di+1,…, ck=dk (nontrivial solution)

 S is linearly dependent


Corollary to Theorem 4.8:
Two vectors u and v in a vector space V are linearly dependent
if and only if one is a scalar multiple of the other.

58/107
Keywords in Section 4.4:

linear combination

spanning set

trivial solution

linear independent

linear dependent

59/107
 4.5 Basis and Dimension

Basis:
Linearly
V ： a vector space Generating
Bases Independent
Sets
Sets
S ={v1, v2, …, vn}V

(a ) S spans V (i.e., span(S) = V )


(b) S is linearly independent
 S is called a basis for V

 Notes:
(1) Ø is a basis for {0}
(2) the standard basis for R3:
{i, j, k} i = (1, 0, 0), j = (0, 1, 0), k = (0, 0, 1)
Elementary Linear Algebra: Section 4.5, p.221 60/107
61/107
62/107
 n
(3) the standard basis for R :
{e1, e2, …, en} e1=(1,0,…,0), e2=(0,1,…,0), en=(0,0,…,1)
Ex: R4 {(1,0,0,0), (0,1,0,0), (0,0,1,0), (0,0,0,1)}

(4) the standard basis for mn matrix space:

{ Eij | 1im , 1jn }
Ex: 2 2 matrix space:
  1 0   0 1  0 0   0 0  
  ,  ,  , 
 0 0   0 0   1 0   0 1 
(5) the standard basis for Pn(x):
{1, x, x2, …, xn}
Ex: P3(x) {1, x, x2, x3}
Elementary Linear Algebra: Section 4.5, p.224 63/107
 
Thm 4.9: (Uniqueness of basis representation)
If S   v1 , v 2 , , v n  is a basis for a vector space V, then every
vector in V can be written in one and only one way as a linear
combination of vectors in S.
Pf:
 1. span(S) = V
 S is a basis  
 2. S is linearly independent
span(S) = V Let v = c1v1+c2v2+…+cnvn
v = b1v1+b2v2+…+bnvn
 0 = (c1–b1)v1+(c2 – b2)v2+…+(cn – bn)vn

S is linearly independent
 c1= b1 , c2= b2 ,…, cn= bn (i.e., uniqueness)
Elementary Linear Algebra: Section 4.5, p.224 64/107

Lemma: Let V be a vector space and let   ( x1 , x2 ,   , xm ) be a
set of vectors in V.
(1) If  spans V, then every set of vectors with more than
m vectors cannot be linearly independent.
(2) If  is linearly independent, then any set of vectors
with fewer than m vectors cannot span V.

65/107
 
Thm 4.10: (Bases and linear dependence)
If S   v1 , v 2 , , v n  is a basis for a vector space V, then every
set containing more than n vectors in V is linearly dependent.

Pf:
Let S1 = {u1, u2, …, um} , m > n
span( S )  V
u1  c11 v1  c21v 2    cn1 v n
uiV  u 2  c12 v1  c22 v 2    cn 2 v n

u m  c1m v1  c2 m v 2    cnm v n

Elementary Linear Algebra: Section 4.5, p.225 66/107

 Let k1u1+k2u2+…+kmum= 0
 d1v1+d2v2+…+dnvn= 0 (where di = ci1k1+ci2k2+…+cimkm)
 S is L.I.
 di=0 i i.e. c11 k1  c12 k 2    c1m k m  0
c21k1  c22k 2    c2 m k m  0

cn1k1  cn 2 k 2    cnm k m  0
 Thm 1.1: If the homogeneous system has fewer equations
than variables, then it must have infinitely many solution.
m > n  k1u1+k2u2+…+kmum = 0 has nontrivial solution
 S1 is linearly dependent
Elementary Linear Algebra: Section 4.5, p.225 67/107
 
Thm 4.11: (Number of vectors in a basis)
If a vector space V has one basis with n vectors, then every
basis for V has n vectors. (All bases for a finite-dimensional
vector space has the same number of vectors.)
Pf:
S ={v1, v2, …, vn}
two bases for a vector space
S'={u1, u2, …, um}

S is a basis  Thm.4.10 
  n  m
S ' is L.I.  
  n  m
S is L.I.  Thm.4.10
  n  m
S ' is a basis  

Elementary Linear Algebra: Section 4.5, p.226 68/107

 
Finite dimensional:
A vector space V is called finite dimensional,
if it has a basis consisting of a finite number of elements.

Infinite dimensional:
If a vector space V is not finite dimensional,
then it is called infinite dimensional.

Dimension:
The dimension of a finite dimensional vector space V is
defined to be the number of vectors in a basis for V.
V: a vector space S: a basis for V

 dim(V) = #(S) (the number of vectors in S)

Elementary Linear Algebra: Section 4.5, p.227 69/107
  Notes: dim(V) = n
Linearly
(1) dim({0}) = 0 = #(Ø) Generating
Bases Independent
Sets Sets

(2) dim(V) = n , SV #(S) > n #(S) = n #(S) < n

S ： a generating set  #(S)  n

S ： a L.I. set  #(S)  n
S ： a basis  #(S) = n

(3) dim(V) = n , W is a subspace of V  dim(W)  n

Elementary Linear Algebra: Section 4.5, Addition 70/107

 
Ex:
(1) Vector space Rn  basis {e1 , e2 ,  , en}
 dim(Rn) = n
(2) Vector space Mmn  basis {Eij | 1im , 1jn}
 dim(Mmn)=mn
(3) Vector space Pn(x)  basis {1, x, x2,  , xn}
 dim(Pn(x)) = n+1
(4) Vector space P(x)  basis {1, x, x2, }
 dim(P(x)) = 

Elementary Linear Algebra: Section 4.5, Addition 71/107


Theorem: Let V be a finite-dimensional vector spaace;
(1) Any linearly independent set in V can be extended to a
basis by adding more vectors if necessary
(2) Any set of vectors that spans V can be reduced to a basis
by discarding vectors if necessary.
Corollary: Let V be a vector space of dimension n. Then
(1) any set of n vectors that spans V is a basis for V
(2) any set of n linearly independent vectors is a basis for V.

72/107
 CONSTRUCTING A BASIS

Let W be the subspace of R4 spanned by the vectors
x=(1,-2,5,-3), y=(0,1,1,4), z=(1,0,1,0). Find a basis for W and
extend it to a basis for R4.
Solution: Now dimW ≤ 3 since W is spanned by three vectors
x,y,z. Let A be the 3 x 4 matrix whose rows are x,y and z.
1 2 5 3
A  0 1 1 4 
 

1 0 1 0 


Reduce A to a row-echelon form:
 
1 2 5 3
 
U  0 1 1 4 
 5 
0 0 1 
 6 

73/107
 CONTINUED

The three non zero row vectors of U are linearly independen
t, and they also span W because the vectors x,y,z can be expr
essed as a linea combination of these three non zero vectors o
f U. Hence, the three non zero row vectors of U provides a ba
sis for W.

To extend it to a basis for R4 , add any non zero vector of the
form w=(0,0,0,t) to the rows of U.

74/107

Ex 9: (Finding the dimension of a subspace)
(a) W={(d, c–d, c): c and d are real numbers}
(b) W={(2b, b, 0): b is a real number}

75/107
 Sol: (Note: Find a set of L.I. vectors that spans the subspace)
(a) (d, c– d, c) = c(0, 1, 1) + d(1, – 1, 0)
 S = {(0, 1, 1) , (1, – 1, 0)} (S is L.I. and S spans W)
 S is a basis for W
 dim(W) = #(S) = 2
(b)   2b, b,0   b 2,1,0 
 S = {(2, 1, 0)} spans W and S is L.I.
 S is a basis for W
 dim(W) = #(S) = 1
Elementary Linear Algebra: Section 4.5, p.228 76/107
  Ex 11: (Finding the dimension of a subspace)
Let W be the subspace of all symmetric matrices in M22.
What is the dimension of W?
Sol:
a b  
W    a, b, c  R 
b c  
a b 1 0   0 1   0 0 
   a   b   c 
 b c   0 0   1 0   0 1 
1 0 0 1 0 0 
 S    ,  ,   spans W and S is L.I.
0 0 1 0 0 1 
 S is a basis for W  dim(W) = #(S) = 3
Elementary Linear Algebra: Section 4.5, p.229 77/107
 
Thm 4.12: (Basis tests in an n-dimensional space)
Let V be a vector space of dimension n.
(1) If S   v1 , v 2 , , v n  is a linearly independent set of
vectors in V, then S is a basis for V.
(2) If S   v1 , v 2 , , v n  spans V, then S is a basis for V.

dim(V) = n

Generating Linearly
Sets Bases Independent
Sets

#(S) > n #(S) < n

#(S) = n
Elementary Linear Algebra: Section 4.5, p.229 78/107
Theorem:

  any subspace U of V, there is a subspace W of V such tha
For
t

Proof: Choose a basis {u1,u2,…uk} for U and extend it to a b
asis {u1,u2,…uk,uk+1,…un} for V. Then the subspace spann
ed by {uk+1,…un} satisfies the requirement.

79/107
 TRY

 
Let
and consider the following subset V of the 2-dimensional vec
tor space R2.
V={x∈R2∣Ax=5x}.

(a) Prove that the subset V

is a subspace of R2.

(b) Find a basis for V

and determine the dimension of V.

Solution: b) is the basis for V and its dimension is 1

80/107
 TRY

1. Find a basis and the dimension of each of the following su
bspaces Mnxn(R) of all nxn matrices.

(a) The space of all nxn diagonal matrices whose traces are z
ero

(b) The space of all nxn skew symmetric matrices

81/107
 TRY

1. Show that the set S={1,1−x,3+4x+x2}
 is a basis of the vector space P2 of all polynomials of degree
2 or less.  

 2. Let xk denote the vector in Rn whose first k-1 coordinates

are zero and whose last n-k+1 coordinates are 1. Show that th
e set {x1,x2,…,xn} is a basis for Rn.

82/107
PRACTICE PROBLEMS

83/107
PROBLEM 2

84/107
PROBLEM 3

85/107
PROBLEM 4

86/107
PROBLEM 5

87/107
88/107
PROBLEM 6

89/107
90/107
91/107