Beruflich Dokumente
Kultur Dokumente
VECTOR SPACES
4.1 Introduction to
Vectors
Real vector spaces &
Subspaces
Linear Algebra I
Ordered n-tuple
Defn: If n is a positive integer, then an ordered n-tuple is
a sequence of n real numbers (a1 , a2 ,,an). The set of
all n-tuples is called n-space and is denoted by Rn.
R1 = R = { a1, b1, }
R2 = { (a1 , a2), (b2 , b2), }
R3 = { (a1, a2, a3), (b1, b2, b3), }
Standard Operations on Rn
Defn: Let vectors u = (u1,u2,,un) and v = (v1,v2,,vn) in
Rn .
1) u=v if u1=v1, u2=v2,, un=vn.
2) Sum of u and v is u+v =(u1+v1, , un+vn)
3) Scalar Multiple of a scalar k and u is ku= (ku1,ku2,
,kun)
4) u = (-u1 , -u2 ,,-un) is the negative of u.
Zero vector, 0 = (0, 0, , 0)
2) Distance
bet
d(u, v)
two
u vvectors
((u- v): (u- v))1/2
(u1 v1 )2 (u2 v2 )2 ... (u2 v2 )2
2) u + v = v + u
8) (k+m)u=ku+mu
10)1u=u
7
Vector Spaces
Examples of vector spaces:
1) Rn
2) A square matrix of size 2
3) mxn matrices
4) Real-Valued functions
Thm 5.1.1 Let V be a vector space, u V and k a scalar,
then,
1) 0u=0
2) k0=0
3) (-1)u = -u
4) If ku = 0, then k = 0 or u = 0
Assoc. Prof. Dr. Khalipah Ibrahim
Subspaces
Defn: Subspace of a vector.
Let V be a vector space and W is a subset of V.
W is called a subspace of V if W is a vector space under
the addition and scalar multiplication defined on V.
Thm 5.2.1. If W is a set of one or more vectors from 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 vectors in W, then u + v is in W
2) If k is any scalar and u is any vector in W, then ku is in
W.
2 Condition for a set of vectors, W to be a subspace of a
vector space V.
1) For every u,vW, u+v W
Assoc. Prof. Dr. Khalipah Ibrahim
v
y
k
n
w
S, x 2v y - z
z
l
S, m 2k n o
Check condition 1:
u j v k w i
AB
x m y n z o
x m (2v y z) (2k n o)
2(v k) (y n) (z o)
Thus(A B) S condition1 fulfilled
kx ky kz
x y z
kx k(2v y z)
2kv ky kz
2(kv) (ky) - (kz)
ThuskA S .condition2 fulfilled
kA k
a e b f
ka ke kb kf
kcg
kdh
cg dh
k(A B) k
RHS
a
c
b
e f
ka kb ke kf
k
g h kc kd kg kh
d
ka ke kb kf
kckg kdkh
ka ke kb kf
ka ke kb kf
2
k
cg
k
dh
kdh
kcg
k(A+B)kA+kB
Thus, the axiom fails to hold
kA kB k
w 0
Check Condition 1
p q u v p u q v
AB
r
0
w
0
r w 0 0
(p u) (q v) (p q) (u v)
0
Condition 1 is fulfilled
Check condition 2
p q
kp kq
kA k
kr ks
r s
kp kq k(p q) 0 if k 0
Condition 2 is not satisfied. N is not a subspace
of M2x2
Assoc. Prof. Dr. Khalipah Ibrahim
1 4 4
i) A
,4 1 4 W
1 0 0
ii) let a 0,b 0,c 0 andd 0
0 0 0
B
,
0 0 0
a c 0 0 0 b
B W. Thus,W containsa zero vectorof M23
0 0 0
thezero vectorof M23
0 0 0
Check condition 1
a b c
p q r
AB
d 0 0
s 0 0
a p b q c r
0
0
d s
(a+p)+(c+r)=(a+c) +(p+r)
=b+q
Thus, b+q=(a+p) + (c+r)
A+BW
Condition 1 is satisfied
a b c
ka kb kc
kA k
d 0 0
kd 0 0
kb=k(a+c) =ka+kc
kAW. Thus, W is a suspace of M23
TOPIC 4 :
VECTOR SPACES
4.2 Linear
Combination
Linear Algebra I
Linear Combination
Defn: Consider a vector space V. If w V, then w is called
a linear combination of the vectors
v1, v2, , vn in V if it can be written as
w= k1v1+k2v2+ +knvn
where k1, k2, , kn are scalars. These scalars are called
the coefficient of the linear combination.
Eg 1. Given vectors u = (1,2,-1) and v = (6,4,2)
determine whether each of the following vectors is a
linear combination of u and v
a) w= (9,2,7)
b) x = (4, -1,8)
Assoc. Prof. Dr. Khalipah Ibrahim
21
Example 1: solution
1 6
a) 2 4
1 2
9
2
1 6
0 8
0 8
9
16
16
1 6
0 1
0 0
9
2
k2=2, k1=-3
w = -3u + 2k
w is a linear combination of u and v
1 6
b) 2 4
1 2
4
1
1 6
0 8
0 8
4
9
16
1 6
0 1
0 0
9
2
22
Example 1: solution
23
Linear Combination
Thm 4.2.3 : If S = {v1, v2, , vn} is a nonempty set of
vectors in a vector space V, then:
a) The set W of all possible linear combinations of
vectors in S is a subspace of V.
24
Example 2: solution
26
Example 2: solution
27
TOPIC 4 :
VECTOR SPACES
4.3 Linear
independence
Linear Algebra II
Linear Independence
A set of vectors is called linearly dependent if they are
interrelated in the sense that one or more of them can be
expressed as a linear combination of the others.
Defn: Let S={v1, v2, , vn} and k1v1+k2v2+ +knvn =0.
1) Set S is linearly independent if k1=k2 = = kn=0 .
2) Set S is linearly dependent if not all kj are 0.
Thm 4.3.1 Let S be a set with two or more vectors.
a) Set S is linearly dependent iff at least one of the
vectors in S is expressible as a linear combination of
other vectors in S.
b) Set S is linearly independent iff no vector in S is
expressible as a linear combination of other vectors in S.
Assoc. Prof. Dr. Khalipah Ibrahim
30
Linear Independence
Thm 4.3.2
a) A finite set of vectors that contains the zero vector
is linearly dependent.
b) A set with exactly one vector is linearly independent iff
that vector is not a zero vector.
c)A set with exactly two vectors is linearly independent if
and only if neither vector is a scalar multiple of the other .
Thm 4.3.3. Let S = {v1, v2, , vr} be a set of vectors in
Rn. If r>n, then S is linearly dependent.
31
Linear Independence
Example 3.
Determine whether the vectors u=(1,-2,3), v=(5,6,-1) and
w=(3,2,1) form a linearly dependent or linearly
independent set.
Solution:
Let c1u + c2v + c3w = 0
Form a linear system and solve
32
TOPIC 4 :
VECTOR SPACES
Example 5: Solution
Solution:
35
36
37
M32
0
1
, 0
1
1 0 0 1 0 0 0 0 0 0 0 0
: S 0 0 , 0 0 , 1 0 , 0 1 , 0 0 , 0 0
0 0 0 0 0 0 0 0 1 0 0 1
38
,
v
2
n} is a basis for a finite
dimensional vector space V.
a) If a set R has more than n vectors, then R is linearly
dependent
b) If a set R has fewer than n vectors, then R does not
span V
39
40
Plus/Minus Theorem
Thm 5.4.4
Let S a nonempty set of vectors in a vector space V.
1) If S is a linearly independent set, and 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.
2) 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 and S {v} span the same space; that is,
Span (S) = span (S {v})
41
Plus/Minus Theorem
Thm 5.4.5
If V is an n-dimensional vector space, and if S is a set in V
with exactly n vectors, then S is a basis for V if either S
spans V or S is linearly independent.
Thm 5.4.6
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 in to S.
42
Plus/Minus Theorem
Example 6.
a) Consider a set of vectors
W = {(1,0,0,0), (-1,1,0,-1), (3,2,0,-2), (0,-1,-2,2),
(1,0,1,0)}
i. Show that the set W spans R4
ii. Determine vector(s) in W that can be removed so
that W can be a basis for R4.
b)
43
Example 6: Solution
44
Example 6: Solution
45
Example 6: Solution
46
Example 7: Solution
48
TOPIC 4 :
VECTOR SPACES
Linear Algebra II
Inner Products
Defn: An inner product on a real vector space V is a function
that associates a real number u,v with each pair of
vectors u and v in V such that it satisfies the following
axioms for all vectors u, v, and z in V and all scalars k.
u, v = v,u
u + v, z = u, z +v, z
ku, v = ku, v
v,v 0
and v,v = 0 if and only if v=0
A real vector space with an inner product is called a real
inner product space.
50
Inner Products
Let u = (u1, u2, , un) and v= (v1, v2, , vn)
1) Euclidean Inner Product on Rn or Euclidean n-space defined
by
u, v = uv = u1v1 + u2v2 ++ unvn is an inner product.
2) Weighted Euclidean inner product with weights positive real
numbers w1, w2, , wn defined by
u,v = w1u1v1 + w2u2v2 ++ wnunvn is an inner product.
Example 1. Let u = (u1, u2) and v= (v1, v2) be the vectors in R2.
Verify that the weighted Euclidean inner product
u,v = 3u1v1 + 2u2v2 satisfies the four inner product
axioms.
51
Example 1:solution
52
in
Inner
Product
Defn:
If V is an inner product space, then the norm (or length )
of
a vector u in V is defined
by
1/ 2
u u, u
53
Find u , v,
u1 u2
b) Let u= u3 u4
matrices.
be any 2x2
Tu
u , v = tr(u v) =tr(v 3
u) 4= u1v1 + u 2v32 +2u
3v3 + u4v4
Find u , v and
if
and
.
c) Let u = a +bx +cx2 and v= d+ex +fx2 any vectors in
P2 and
54
Example 2:solution
55
Example 2:solution
56
Example 2:solution
57
58
TOPIC 4 :
VECTOR SPACES
60
(u
v
)
(u
v
)
...
(u
v
)
u ) (v) = (v , v ,
1 , v1 ), then
2
2
n
n
n
62
Example 3:solution
Solution:
63
Example 3:solution
64
Orthogonal projection
Thm 6.3.4 Projection Theorem
If W is a finite-dimensional subspace of an inner product
space V, then every vector u in V can be expressed in
exactly one way as
u = w1 + w2 where w1 is in W and w2 is in W.
w1 = projW u = orthogonal projection of u on W
w2 = projW u =component of u orthogonal to W
65
Orthogonal Projection
Thm 6.3.5
Let W be a finite-dimensional subspace of an inner product
space V.
1 then
anyproj
vector
in
V,
u
v
w
2 1
v1
u, v2
v2
v2 ...
u, vr
vr
vr
Thm 6.3.6
Every nonzero finite-dimensional inner product space has
an orthonormal basis.
66
Orthogonal Projections
Example 4. Let R3 has the Euclidean inner product and let
W be the subspace spanned by orthonormal vectors v1 =
(0,1,0) and v2 = (-4/5,0,3/5). Find the orthogonal
projection of a vector u on W and the component of u
orthogonal to W if u = (1,1,1).
Solution:
67
Example 4:solution
68
Gram-Schmidt Process
Gram-Schmidt Process is used to convert any basis
to an orthogonal basis.
Let V be any nonzero finite-dimensional inner product
space, and {u1, u2, , un} is any basis for V.
An orthogonal basis {v1, v2, , vn} for V can be found as
follows:
Step 1: Let v1 = u1
u2 , v1 v that is orthogonal to v :
Step 2:Construct
a
vector
1
v u
v2
2
v1
u3 , v1
u3 , v2
v3 u3 a vector
v1v3 that 2is orthogonal
v2
Step 3:Construct
to v1 and
2
v1
v2
v2 :
69
Gram-Schmidt Process
Continue in the same manner, after n steps an orthogonal
set of n vectors {v1, v2, . , vn} will be obtained.
Example 5.
Let R3 has the Euclidean inner product. Apply the GramSchmidt process to transform the basis vectors u1 =
(1,1,1), u2 = (0,1,1) and u3 = (0,0,1) into an orthonormal
Solution.
basis {n1,n2,n3}.
70
Example 5:solution
71
Example 5:solution
72
TOPIC 4 :
VECTOR SPACES
Linear Algebra II
Change of Basis
Let B = {u1, u2, , un} and B = {u1, u2, , un} are
the bases for a vector space V and v V.
If :
1)[v]B is the coordinate vector of v relative to B
2)[v]B is the coordinate vector of v relative to B
3)P is a transition matrix from B to B
then
[v]B = P [v]B
Transition matrix P can be expressed in terms of its
column vector as follows:
P = [ [u1]B | [u2]B | | [un]B ]
Assoc. Prof. Dr. Khalipah Ibrahim
74
Transition Matrices
Thm 6.5.1
If P is the transition matrix from a basis B to B for a
finite-dimensional vector space V, then P is invertible, and
Q = P-1 is the transition matrix from B to B.
Q=P-1 =[[u1]B | [u2]B | | [un]B ]
Example 6
Consider the bases B ={u1,u2} and B ={u1,u2} for R2.
Given u1=(1,0), u2=(0,1), u1=(1,1) and u2=(2,1), find:
a) The transition matrix from B to B.
b) The transition matrix from B to B.
3
c) [v]B if [v]B = 5
75
Example 6:solution
76
Example 6:solution
77
Example 6:solution
78
End of Texts
TOPIC 4
VECTOR SPACES