Download Slide 1.3

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Cayley–Hamilton theorem wikipedia , lookup

Exterior algebra wikipedia , lookup

Singular-value decomposition wikipedia , lookup

Matrix multiplication wikipedia , lookup

Eigenvalues and eigenvectors wikipedia , lookup

Laplace–Runge–Lenz vector wikipedia , lookup

Euclidean vector wikipedia , lookup

Vector space wikipedia , lookup

Four-vector wikipedia , lookup

Matrix calculus wikipedia , lookup

Covariance and contravariance of vectors wikipedia , lookup

System of linear equations wikipedia , lookup

Transcript
1 Linear Equations
in Linear Algebra
1.3
VECTOR EQUATIONS
© 2012 Pearson Education, Inc.
VECTOR EQUATIONS
Vectors in
2
 A matrix with only one column is called a column
vector, or simply a vector.
 An example of a vector with two entries is
 w1 
w   ,
 w2 
where w1 and w2 are any real numbers.
 The set of all vectors with 2 entries is denoted by
(read “r-two”).
© 2012 Pearson Education, Inc.
2
Slide 1.3- 2
VECTOR EQUATIONS
 The stands for the real numbers that appear as entries
in the vector, and the exponent 2 indicates that each
vector contains 2 entries.
2
 Two vectors in
are equal if and only if their
corresponding entries are equal.
2
 Given two vectors u and v in
, their sum is the
vector u  v obtained by adding corresponding entries
of u and v.
 Given a vector u and a real number c, the scalar
multiple of u by c is the vector cu obtained by
multiplying each entry in u by c.
© 2012 Pearson Education, Inc.
Slide 1.3- 3
VECTOR EQUATIONS
 2
 1
 Example 1: Given u    and v    , find
 5
 2 
4u, ( 3)v , and 4u  (3)v .
 6 
 4
Solution: 4u    , (3)v    and
 15
 8
 4   6   2
4u  (3)v         
 8  15  7 
© 2012 Pearson Education, Inc.
Slide 1.3- 4
GEOMETRIC DESCRIPTIONS OF
2
 Consider a rectangular coordinate system in the
plane. Because each point in the plane is determined
by an ordered pair of numbers, we can identify a
a

.
geometric point (a, b) with the column vector
b
 
 So we may regard
plane.
© 2012 Pearson Education, Inc.
2
as the set of all points in the
Slide 1.3- 5
PARALLELOGRAM RULE FOR ADDITION
2
 If u and v in
are represented as points in the plane,
then u  v corresponds to the fourth vertex of the
parallelogram whose other vertices are u, 0, and v.
See the figure below.
© 2012 Pearson Education, Inc.
Slide 1.3- 6
VECTORS IN
and
3
are 3 1column matrices with three
3
n
 Vectors in
entries.
 They are represented geometrically by points in a
three-dimensional coordinate space, with arrows from
the origin.
n
 If n is a positive integer, (read “r-n”) denotes the
collection of all lists (or ordered n-tuples) of n real
numbers, usually written as n 1 column matrices,
 u1 
such as
u 
2


u
 
u 
 n .
© 2012 Pearson Education, Inc.
Slide 1.3- 7
ALGEBRAIC PROPERTIES OF


n
The vector whose entries are all zero is called the
zero vector and is denoted by 0.
n
For all u, v, w in
and all scalars c and d:
(i) u  v  v  u
(ii) (u  v)  w  u  (v  w)
(iii) u  0  0  u  u
(iv) u  (  u)   u  u  0,
where u denotes (1)u
(v) c(u  v)  cu  cv
(vi) (c  d )u  cu  du
© 2012 Pearson Education, Inc.
Slide 1.3- 8
LINEAR COMBINATIONS
(vii) c(du)=(cd)(u)
(viii) 1u  u
n
 Given vectors v1, v2, ..., vp in
and given scalars c1,
c2, ..., cp, the vector y defined by
y  c1v1  ...  c p v p
is called a linear combination of v1, …, vp with
weights c1, …, cp.
 The weights in a linear combination can be any real
numbers, including zero.
© 2012 Pearson Education, Inc.
Slide 1.3- 9
LINEAR COMBINATIONS
 1
2
 7
 
 
 
 Example 2: Let a1  2 , a 2  5 and b  4 .
 
 
 
 5
 6 
 3
Determine whether b can be generated (or written) as a
linear combination of a1 and a2. That is, determine
whether weights x1 and x2 exist such that
----(1)
x1a1  x2a 2  b
If vector equation (1) has a solution, find it.
© 2012 Pearson Education, Inc.
Slide 1.3- 10
LINEAR COMBINATIONS
Solution: Use the definitions of scalar multiplication
and vector addition to rewrite the vector equation
 1
2  7 






x1 2  x2 5  4 ,
 
   
 5
 6   3
a1
which is same as
© 2012 Pearson Education, Inc.
a2
a3
 x1   2 x2   7 
 2 x    5 x    4 
1

  2  
 5 x1   6 x2   3
Slide 1.3- 11
LINEAR COMBINATIONS
 x1  2 x2   7 
and 
2 x1  5 x2    4 

  .
 5 x1  6 x2   3
----(2)
 The vectors on the left and right sides of (2) are equal
if and only if their corresponding entries are both
equal. That is, x1 and x2 make the vector equation (1)
true if and only if x1 and x2 satisfy the following
x1  2 x2  7
system.
----(3)
2 x1  5 x2  4
© 2012 Pearson Education, Inc.
5 x1  6 x2  3
Slide 1.3- 12
LINEAR COMBINATIONS
 To solve this system, row reduce the augmented matrix
of the system as follows.
 1 2 7   1 2 7   1 2 7   1 0 3
 2 5 4 


 5 6 3
0 9 18


0 16 32 
0 1 2 


0 16 32 
0 1 2 


0 0 0 
 The solution of (3) is x1  3 and x2  2 . Hence b is a
linear combination of a1 and a2, with weights x1  3 and
 2  7 
x2  2 . That is,  1






3 2  2 5  4 .
© 2012 Pearson Education, Inc.
 
 5
 
 6 
 
 3
Slide 1.3- 13
LINEAR COMBINATIONS
 Now, observe that the original vectors a1, a2, and b
are the columns of the augmented matrix that we row
reduced:
 1 2 7
 2 5 4 


 5 6 3
a1
a2
b
 Write this matrix in a way that identifies its columns.
----(4)
a a b
1
© 2012 Pearson Education, Inc.
2
Slide 1.3- 14
LINEAR COMBINATIONS
 A vector equation
x1a1  x2a 2  ...  xna n  b
has the same solution set as the linear system whose
augmented matrix is
----(5)
a b.
a a
1
2
n
 In particular, b can be generated by a linear
combination of a1, …, an if and only if there exists a
solution to the linear system corresponding to the
matrix (5).
© 2012 Pearson Education, Inc.
Slide 1.3- 15
LINEAR COMBINATIONS
n
 Definition: If v1, …, vp are in
, then the set of all
linear combinations of v1, …, vp is denoted by Span
n
{v1, …, vp} and is called the subset of
spanned
(or generated) by v1, …, vp. That is, Span {v1, ..., vp}
is the collection of all vectors that can be written in
the form
c1v1  c2 v2  ...  c p v p
with c1, …, cp scalars.
© 2012 Pearson Education, Inc.
Slide 1.3- 16
A GEOMETRIC DESCRIPTION OF SPAN {V}
3
 Let v be a nonzero vector in
. Then Span {v} is the
set of all scalar multiples of v, which is the set of
3
points on the line in
through v and 0. See the
figure below.
© 2012 Pearson Education, Inc.
Slide 1.3- 17
A GEOMETRIC DESCRIPTION OF SPAN {U, V}
3
 If u and v are nonzero vectors in
, with v not a
3
multiple of u, then Span {u, v} is the plane in
that
contains u, v, and 0.
3
 In particular, Span {u, v} contains the line in
through u and 0 and the line through v and 0. See the
figure below.
© 2012 Pearson Education, Inc.
Slide 1.3- 18