Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
8 views

Lecture 22

Calculus Presentation 22

Uploaded by

thedarkobliteration
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
8 views

Lecture 22

Calculus Presentation 22

Uploaded by

thedarkobliteration
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 46

Let V be an arbitrary

nonempty set of objects


on which two operations
are defined, addition and
multiplication by scalars.
If the following
axioms are
satisfied by all
objects u, v, w in V
and all scalars l and
m, then we call V a
vector space.
Axioms of
Vector Space
For any set of vectors u, v,
w in V and scalars l, m, n:
1. u + v is in V
2. u+v=v+u
3. u + (v + w) = (u + v) + w
4. There exist a zero
vector 0 such that
0+u=u+0=u
5. There exist a vector –u
in V such that
-u + u = 0 = u + (-u)
6. (l u) is in V
7. l (u + v)= l u + l v
8. m (n u) = (m n) u = n (m u)
9. (l +m) u= I u+ m u
10. 1u = u where 1 is the
multiplicative identity
A subset W of a vector
space V is called a
subspace of V if W itself is a
vector space under the
addition and scalar
multiplication defined on V.
If W is a set of one or
more vectors from a
vector space V, then W
is subspace of V if and
only if the following
conditions hold:
(a) If u and v are vectors in
W, then u + v is in W
(b) If k is any scalar and u
is any vector in W, then
k u is in W.
The null space of an m x n
matrix A (Nul A) is the set
of all solutions of the hom
equation Ax = 0
Nul A = {x: x is in Rn and Ax = 0}
The column space of
an m x n matrix A
(Col A) is the set of all
linear combinations
of the columns of A.
The column space of
an m x n matrix A
(Col A) is the set of all
linear combinations
of the columns of A.
If A = [a1 … an],
then
Col A = Span {a1 ,… , an }
An indexed set of vectors
{v1,…, vp} in V is said to be
linearly independent if the
vector equation
c1v1  c2 v2  ...  c p v p 0 (1)
has only the trivial solution,
c1=0, c2=0,…,cp=0
The set {v1,…,vp} is said to be
linearly dependent if (1) has a
nontrivial solution, that is, if
there are some weights, c1,…,cp,
not all zero, such that (1) holds.
In such a case, (1) is called a
linear dependence relation
among v1, … , vp.
An indexed set { v1, … , vp } of
two or more vectors, with v 1 0 ,
is linearly dependent if and only
if some vj (with j  1) is a linear
combination of the preceding
vectors, v1, … , vj-1.
Let p1 (t) = 1, p 2(t) = t and
p 3 (t) = 4 – t. Then
{p 1, p 2, p 3} is linearly
dependent in P because
p3 = 4p1 – p2.
The set {Sint,Cost} is
linearly independent in
C[0,1] because Sint and
Cost are not multiples
of one another as
vectors in C [0,1]. …
However, {Sint Cost,Sin2t}
is linearly dependent
because of the identity:
Sin 2t = 2 Sin t Cos t,
for all t.
Let H be a subspace of a
vector space V. An
indexed set of vectors
B = {b1,…, bp} in V is a
basis for H if
…
B is a linearly independent
set, and the subspace
spanned by B coincides with
H; that is,
H = Span {b1,...,bp }.
Let A be an invertible n x n
matrix – say, A = [a1 … an].
Then the columns of A form a
basis for Rn because they are
linearly independent and they
span R , by the Invertible
n

Matrix Theorem.
Let e1,…, en be the columns of the
identity matrix, In. That is,
 1  0  0
 0  1  
e1   , e2   ,..., en  
     0
     
0
  0
   1
The set {e1, …, en} is called
the standard basis for Rn.
Standard Bases for R 3

x3

e3

e2
x2
e1

x1
 3   4   2
    
v1  0  , v 2  1  , and v 3  1  
  6   7   5 

Determine if {v1, v2, v3} is a


basis for R .
3
Let S = {1, t, t2, …, tn}. Verify
that S is a basis for Pn. This
basis is called the standard
bases for Pn.
Standard Bases for P2
y
y = t2
y=1

y=t
Check whether the set of
vectors
{(2, -3, 1), (4, 1, 1), (0, -7, 1)}
is a basis for R3 ?
Check whether the set of
vectors
{-4 + 1 t + 3 t , 6 + 5 t + 2 t , 8
2 2

+ 4 t + 1 t2}
is a basis for P2?
Show that the set
  1 0   0 1  0 0   0 0  
S =   ,  ,  ,  
  0 0   0 0   1 0   0 1 
is a basis for the vector space
V of all 2 x 2 matrices.
Show that the set
 3 6  0 -1  0 -8   1 0 
  ,  ,  ,  
 3 -6   -1 0   -12 -4   -1 2 

is a basis for the vector space


V of all 2 x 2 matrices.
 1   3   4
Let      
v 1    2  , v 2   5  , v 3  5  ,
  3  7   6 
and H Span{v1 , v 2 , v 3 }.

Note that v3 = 5v1 + 3v2 and


show that Span {v1, v2, v3} =
Span {v1, v2}. Then find a basis
for the subspace H.
Let S = {v1, … , vp} be a set in V and
let H = Span {v1, …, vp}.
(a) If one of the vectors in S, say vk,
is a linear combination of the
remaining vectors in S, then the set
formed from S by removing vk still
spans H.

(b) If H {0}, some subset of S is a
basis for H.
The procedure for finding a
subset of S that is a basis for
W = span S is as follows:
1. Write the Equation,
c1v1 + c2v2 + …+ cn vn = 0
2. Construct the augmented
matrix associated with the
homogeneous system of
equation and transform it to
reduced row echelon form.
3. The vectors
corresponding to the
columns containing the
leading 1’s form a basis
for W = span S.
Thus if S = {v1, v2,…, v6}
and the leading 1’s
occur in columns 1, 3,
and 4,
then { v1 , v3 , v4}
is a basis for span S.
Let S = {v1, v2, v3, v4, v5} be a
set of vectors in R4, where
v1 = (1,2,-2,1), v2 = (-3,0,-4,3),
v3 = (2,1,1,-1), v4 = (-3,3,-9,6),
and v5 = (9,3,7,-6).
Find basis for W = span S.
 1  2   1  2  4   1  2  4  7  
                    
 0 ,  3   0 ,  3 ,  5   0 ,  3 ,  5 ,  8  
 0  0   0  0  6   0  0  6  9  
                    
Linearly Independent Abasis for R 3 Spans R 3 but is
but does not Span R 3 Linearly Dependent
 1  0  s    s   1  0
  
v 1  0  , v 2  1          
H   s  :s in R  s s 0  s 1
 0       
 0  0
    0  0  0

Is {v1, v2} a basis for H?


Neither v1 nor v2 is in H, so {v1,
v2} cannot be a basis for H. In
fact, {v1, v2} is a basis for the
plane of all vectors of the
form (c1, c2, 0), but H is only a
line.

You might also like