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

Lecture 21

Calculus Presentation 21

Uploaded by

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

Lecture 21

Calculus Presentation 21

Uploaded by

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

as set of all solutions to

a system of homogenous
linear equations as the
set of all linear
combinations of certain
specified vectors
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}
A more dynamic description
of Nul A is the set of all x in
Rn that are mapped into the
zero vector of Rm via the
linear transformation x  Ax.

Nul A
0
Rm
Rn
 5
 1  3  2  
Let A   and u  3 
 5 9 1    2 
 5
 1  3  2    5  9  4   0
Au   3 
    25  27    
  5 9 1    2  0
  2
Elementary row
operation does
not change the
null space of a
matrix.
The null space of an m x n
matrix A is a subspace of
R . Equivalently, the
n

solution set of m hom.


linear equations in n
unknowns (AX=0) is a
subspace of R .n
The set H, of all vectors in R4
whose coordinates a, b, c, d
satisfy the equations
a – 2b + 5c = d
c–a=b
is a subspace of R .4
Find a spanning set for the
null space of the matrix

  3 6  1 1  7

A  1  2 2 3  1  
 2  4 5 8  4 
Find a spanning set for the
null space of
 1 3 2 2 1 
 0 3 6 0  3
 
A  2  3  2 4 4 
 
 3 6 0 6 5 
  2 9 2  4  5
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 }
The column space
of a matrix A is a
subspace of R .m
A typical vector in Col A can
be written as Ax for some x
because the notation Ax
stands for a linear
combination of the columns
of A. That is,
Col A = {b: b = Ax for some
x in Rn}
The notation Ax for vectors
in Col A also shows that Col
A is the range of the linear
transformation
x  Ax
Find a matrix A such that
W = Col A.

  6a - b  
  
W =   a +b  : a,b in R 
  -7a  
  
 6  -1    6   -1 
          
W = a  1  +b  1  : a,b in R  = Span   1  ,  1  
  -7   0     -7   0  
          

 6 -1
 
Let A =  1 1  . Then W colA.
 -7 0 
A system of linear
equations Ax = b is
consistent if and only
if b is in the column
space of A.
A vector b in the column
space of A. Let Ax = b is
the linear system
 -1 3 2   x1   1 
 1 2 -3   x  =  -9 
   2  
 2 1 -2   x3   -3 
Show that b is in the
column space of A, and
express b as a linear
combination of the column
vectors of A.
If x0 denotes any single
solution of a consistent linear
system Ax =b and if v1, …, vk
form the solution space of the
homogeneous system Ax = 0,
then every solution of
Ax = b can be
expressed in the form
x = x0 + c1v1 + … + cnvn
The vector x0 is
called a Particular
Solution of Ax = b.
The expression
x0+ c1 v1+ c2v2+ . . . +ck vk
is called the
General Solution of
Ax = b
The expression
c1 v1+ c2v2+ . . . +ck vk
is called the
General Solution
of Ax = 0.
Find the vector form of the
general solution of the given
linear system Ax = b; then
use that result to find the
vector form of the general
solution of Ax=0.
x1 + 3x2 - 2x3 + 2x5 =0
2x1 +6x2 - 5x3 - 2x4 + 4x5 - 3x6 = -1
5x3 +10x4 +15x6 = 5
2x1 +6x2 + 8x4 + 4x5 +18x6 = 6
 2 4 -2 1 
A =  -2 -5 7 3 
 3 7 -8 6 

a. If the column space of A is


a subspace of Rk, what is k?
b. If the null space of A is a
subspace of Rk, what is k?
a. The columns of A
each have three
entries, so Col A is a
subspace of R , where
k

k = 3.
b. A vector x such that
Ax is defined must have
four entries, so Nul A is
a subspace of R , where
k

k = 4.
 2 4 -2 1 

A =  -2 -5 7 3 
 3 7 -8 6 
Find a nonzero vector in
Col A and a nonzero
vector in Nul A.
 2 4 -2 1 
 3
 -2 
 3
  u=  

v =  -1 
A=  -2 -5 7 3 
 -1
 3 7 -8 6     3 
0
a. Determine if u is in Nul
A. Could u be in Col A?

b. Determine if v is in Col
A. Could v be in Nul A?
A linear transformation
T from V into W is a rule
that assigns to each
vector x in V a unique
vector T (x) in W, such
that
(i) T (u + v) = T (u) + T (v)
for all u, v in V, and
(ii) T (cu) = c T (u) for all u
in V and all scalars c
The kernel (or null
space) of such a T is
the set of all u in V
such that T (u) = 0.
The range of T is the
set of all vectors in W
of the form T (x) for
some x in V.
If T (x) = Ax for some
matrix A – then the
kernel and the range
of T are just the null
space and the column
space of A.
The kernel of T is a subspace
of V and the range of T is a
subspace of W.
Range
Domain
0
0 W
V’
Kernel

Kernel is a Range is a
subspace subspace
of V of W

You might also like