ME 1202: Linear Algebra & Ordinary

Differential Equations (ODEs)

 Vector and Matrix Equations
System of linear equations may appear in a
problem in three different forms:
a. As an ordinary system of the type studied
earlier during this course,
b. As a single vector equation involving several
vectors, or
c. As a matrix equation containing at least one
matrix and several vectors.
➢ In this lecture, it will be shown how these three types
of equations are related and how to convert from one
type to another.
 Vectors in euclidean space Rn
➢ The n-dimensional (real) euclidean space Rn is the
collection of n-tuples* of numbers, called vectors
i.e. we will use vectors to mean a list of numbers.
➢ Vectors can be either presented horizontally,
x = (x1, x2, ..., xn)
or vertically.  x1 
x 
x =  2
 
 
 xn 
*Tuples: An ordered list of elements. For example,
(2, 7, 4, 1, 7) denotes a 5-tuple
 Vectors in euclidean space (contd.)
➢A matrix will only one column is called column
vector or simply a vector. Examples of vector
with two entries are:
 2 0.2  w1 
u =  , v =  , w =  ,
− 1  0.1  w2 
Where w1 and w 2 are real numbers
➢The set of all vectors with two enteries is
denoted by R2 (read as “r-two”)
➢R2 stands for real numbers that appears as
entries in the vectors, whereas exponent 2
indicates that each vector contains two
entries.
 Vectors in euclidean space (contd.)
➢Two vectors in are equal if and only if their
corresponding entries are equal. For example
following vectors are not equal:

 2 1 
u =  , v =  ,
1   2

➢In summary, we say that vectors in R2 are

ordered pairs of real numbers.
 Geometric description of euclidean space Rn
➢The 1-dimensional euclidean space
R1 = {(x): x is a real number}
can be identified with all real numbers R and
be visualized as a straight line.
➢The 2-dimensional euclidean space
R2 = {(x1, x2): x1, x2 are real numbers}
can be visualized as the coordinate plane.
 Geometric description of euclidean space Rn
(contd.)
➢The 3-dimensional euclidean space
R3 = {(x1, x2, x3): x1, x2, x3 are real numbers}
can be visualized as the world we are living in.
 Vector Addition
➢Vectors of the same dimension can
be added For example;
(x1, x2, ..., xn) + (y1, y2, ..., yn) = (x1 + y1, x2 + y2, ..., xn + yn)

➢For example, given two vectors in u and v in

R2, their sum i.e. the vector u+v is obtained by
adding corresponding entries of u and v.

 2 1  2 + 1 3
If , u =  , v =  , then u + v =   = 
1   2 1 + 2 3
 Vector Multiplication
➢A number (scalar) can also be
multiplied to vectors. For example;
c (x1, x2, ..., xn) = (cx1, cx2, ..., cxn).
➢For example, given two vectors in u and real
number c, the scalar multiple of u by c is the
vector cu obtained by multiplying each entry
in u by c.
 2 2 10
If u =  , c = 5, then cu = 5  =  
1  1   5 
 Examples
Let u = (1, 2), v = (3, 4), w = (5, 6), And
x = (1, 0, -3), y = (2, -1, 5). Then
u + v = (1 + 3, 2 + 4) = (4, 6)
3u = (3×1, 3×2) = (3, 6)
u + v + w = (1 + 3 + 5, 2 + 4 + 6) = (9, 12)
3u - 4v + w = (3×1 - 4×3 + 5, 3×2 - 4×4 + 6) = (-4, -4)
x + y = (1 + 2, 0 - 1, -3 + 5) = (3, -1, 2)
-2x = (-2×1, -2×0, -2×(-3)) = (-2, 0, 6)
-2x + 3y = (-2×1 + 3×2, -2×0 + 3×(-1), -2×(-3) + 3×5) = (4, -3, 21)
❑Moreover, because the dimension of u, v, w is
different from the dimension of x, y, expressions
such as u + x, 2v + 3y are meaningless.
Vectors: Addition & Multiplication (Contd.)
Geometrically, the addition is described by
parallelogram, and the scalar multiplication is the
stretching/shrinking and sometimes reversing (for
negative scalars) of vectors. For example;
 Parallelogram Rule for Addition
• Let us look at the addition of two vectors (red and
blue in the picture) in R2. The green vector is
constructed from the parallelogram.

The parallelogram tells us that

the two right triangles (in gray
shade) are identical.
In particular, the two pink
segments of the x-axis have the
same length.
This implies that the x-coordinate
of the green vector is x1 + x2. By
similar argument, the y-
coordinate of the green vector is
y1 + y2.
 Linear Combination
➢The addition and scalar multiplication
can also be combined to form linear
combinations. For example;
x1v1 + x2v2 + ... + xpvp.
is called a linear combination of
vectors v1, ….,vp using weights (or
scalars) x1,…xp.
 Linear Combination (Contd.)
➢If v1, ….,vp are vectors in Rn ,then the set of
all possible linear combinations of v1, ….,vp
is called the subset of Rn spanned (or
generated) by {v1, ….,vp } and is denoted by
span {v1, ….,vp }
 Linear Combination (Contd.)
➢That is Span {v1, ….,vp } is the collections of all
vectors that can be written in the form
x1v1 + x2v2 + ... + xpvp, with x1,…xp scalars (i.e.
weights).

➢For example, the following vectors are all in

Span {v1, v2}
1 2
v1 + v2 , v1 − v2 , 2v1 + 7v2 , v1 + v2
3 3
 Linear combination: Example
This example shows the linear combinations of two
(nonparallel) vectors. It suggests that all the linear
combinations of the two vectors form a plane
passing through the origin.
 Example: 1
 1  2  7
Let v1 = − 2, v2 = 5 , and b =  4,
− 5  6 − 3 
Show that b is in the plane spanned by v1 and v2, that is,
find weights (scalars) x1, x2 such that
x1v1 + x2v2 = b ------ (Eq:1)
• Note: Eq:1 represents a system of linear equations as a single
vector equation containing several vectors.

Solution: Using the definitions of scalar multiplication and vector

addition to rewrite the vector equation
 1  2  7 
x1 − 2 + x2 5  =  4
− 5  6 − 3 
v1 v2 b
 Example: 1 (Contd.)
Which is the same as
 1  2  7   x1  2 x2   7
x1 − 2 + x2 5  =  4 === − 2 x1  + 5 x2  =  4
− 5  6 − 3  − 5 x1  6 x2  − 3 

And  x1 + 2 x2   7
 − 2 x + 5 x  =  4
 1 2   ---------- (Eq:2)
− 5 x1 + 6 x2  − 3 

Now the vectors on left and right sides of Eq:2 are equal, if and only if
their corresponding entries are both equal. That is, x1 & x2 makes the
vector equation 1 true if and only if x1 & x2 satisfy the system
x1 + 2 x2 = 7
− 2 x1 + 5 x2 = 4 ---------- (Eq:3)
− 5 x1 + 6 x2 = −3
 Example: 1 (Contd.)
 1 2 7 
Augmented matrix of the system − 2 5 4 
(Eq:3) can be written as 
− 5 6 − 3 

1 0 3
Now performing Gauss-Jordan elimination 0 1 2 
to obtain reduced echelon form 
0 0 0 

Therefore, solution of Equation (3) system is x1 = 3 ,x2 = 2.

Hence, b is a linear combination of v1 and v2 ,with weights
x1=3 & x2=2. That is
 1   2  7 
3− 2 + 25  =  4
− 5  6 − 3 
 Notes: Example 1
➢ Note that in Example 1, the original vectors v1, v2 and
b are the column of the augmented matrix i.e.
 1 2 7 
− 2 5 4 

− 5 6 − 3 
v1 v2 b

Lets write above matrix in terms of its column

 v1 v2 b  ---------- (Eq:4)

➢From above discussion, it is clear how to write the

augmented matrix immediately after the vector equation (1),
without going though the intermediate steps of Example 1.
 Notes: Example 1 (Contd.)
➢Thus a vector equation
x1v1 + x2v2 + ... + xnvn = b
has the same solution set as the linear system
whose augmented matrix is
[v1 v2 ….. vn b] --------Eq:5

➢In particular, b is in span {v1, ……,vn} if and only

if the linear system corresponding to Eq:5 is
consistent.
 Linear combination Application
A company manufactures two products, namely A & B.
• For $1 worth of product A, company spends $0.45
on materials, $0.25 on labor, $0.15 on overhead.
• For $1 worth of product B, company spends $0.40 on
materials, $0.30 on labor, $0.15 on overhead.
Suppose the company wishes to manufacture x1
dollars worth of product A and x2 dollars worth of
product B. Give a vector that describes the various
costs company will incur.
 Linear combination Application (Contd.)
.45 .40

Let , a = .25 
and b = .30
.15 .15

▪ Vectors a and b represents the “cost per dollar of

income” for two products i.e. A and B respectively.
▪ Now costs of manufacturing x1 dollars worth of
product A is given by the vector x1a. Similarly, costs
of manufacturing x2 dollars worth of product B is
given by the vector x2b.
▪ Hence, the total costs for both products are given
by the vector x1b+ x2b
 The Matrix Equation (Ax = b)
➢A fundamental idea in linear algebra is to view
a linear combination of vectors as the product
of a matrix and a vector.
• If A is an mxn matrix, with columns v1,….,vn,
and if x is in Rn, then the vector Ax is the linear
combination of the columns of A using the
corresponding entries in x as weights, i.e.
 x1 
Ax = v1 v2 ..... vn    = x1v1 + x2v2 + .....+ xn vn − − − −  Eq : 1
 xn 

Note that Ax is defined if the number of columns of A equals the number

of entries (rows) in x
 The Matrix Equation (Ax = b)
➢ Inwords, Equation 1 tells us that the
product A x of a matrix A with a column
matrix x is a linear combination of the
column matrices of A with the coefficients
coming from the matrix x . For example:
 4
1 2 - 1   1   2 − 1 4  6  − 7 3
0 - 5 3 3  = 40 + 3− 5  + 7  3  = 0 + − 15 +  21 = 6
  7              
 

2 - 3  2 − 3  8  − 21 − 13
8 0 4 = 4 8  + 7 0  =  32 +  0  =  32 
  7          
- 5 2   − 5  2  − 20  14  − 6 
 The Matrix Equation (Ax = b)
➢ Even though the equation Ax = b involves two vectors
as well as a matrix (A), it is referred as matrix equation
to distinguish it from vector equation
➢Thus given a m x n matrix A, with columns
v1,….,vn, and given b in Rm, the matrix equation
Ax = b
has the same solution set as a vector equation
x1v1 + x2v2 + ... + xnvn = b
which in turn has the same solution set as the linear
system whose augmented matrix is
[v1 v2 ….. vn b]
 Exercise
Write the following system of linear equations
as (a) vector equation (b) Matrix equation
x1 + 2 x2 − x3 = 4
− 5 x2 + 3 x3 = 1

Now here.
1   2 − 1   4
v1 =   , v2 =   , v3 =   , and b =  
0  − 5   3 1 
Since Vector equation is : x1v1 + x2v2 + ... + xnvn = b
1   2  − 1   4
x1   + x2   + x3   =   - - - --  Eq : 1
0  − 5   3 1 
 Exercise (Contd.)
Now lets consider three vectors on the left hand side of
Eq:1 as the column of a matrix (A)
1 2 - 1
A= 
 0 - 5 3
Now using the definition of a matrix times a vector, Eq: 1
can be rewritten in the form Ax = b
 x1 
1 2 - 1   4
0 - 5 3  x2  = 1 
    
 x3 
Linear Combination in Matrix & vector
equation from

A x = b
 Linear Combination in Matrix & vector
equation from

A x = b

Vector equation : x1v1 + x2 v2 + x3 v3 = b

 Summary: Matrix Equation of a Linear System
a11 x1 + a12 x2 + ... + a1n xn = b1
◼ Consider any system of
a21 x1 + a22 x2 + ... + a2 n xn = b2
m linear equations in n    
unknowns. am1 x1 + am 2 x2 + ... + amn xn = bm

◼ Since two matrices a11 x1 + a12 x2 + ... + a1n xn  b1 

are equal if and only if a x + a x + ... + a x  b 
 21 1 22 2 2n n = 2
their corresponding       
   
entries are equal. am1 x1 + am 2 x2 + ... + amn xn  bm 
◼ The m×1 matrix on
the left side of this a11 a12 ... a1n   x1  b1 
a a ... a   x  b 
equation can be written  21 22 2n   2 
= 2
as a product to give Ax=         
b form.     
am1 am 2 ... amn   xm  bm 
Summary: Matrix Equation of a Linear System
(Contd.)
➢ If we designate these matrices by A ,x ,and b
,respectively, the original system of m equations in n
unknowns has been replaced by the single matrix
equation
➢ The matrix A in this equation is called the coefficient
matrix of the system. The augmented matrix for the
system is obtained by adjoining b to A as the last
column; thus the augmented matrix is
 Linear independence
Consider an n × n matrix  a11 a12  a1n 
a a22  a2 n 
A=  21

     
 
an1 an 2  ann 
This matrix can be viewed as an ordered set of column
vectors: A = v1 v2  vn 
 a11   a12 
a  a 
Where v1 =  
21 
v2 = , 22 
, etc.
     
   
 an1   an 2 
 Linear independence: Definition
A set of vectors is linearly dependent, if and only if we
can find a set of scalars (i.e. weights) , x1 , x2 ,, xn (not
all of which are zero) such that
x1v1 + x2 v2
x2 +  + xn xn = 0 − −  (vector equation of homogenous system)

If such a set of scalars cannot be found i.e. the vector

equation has only trivial solution (i.e. all scalars are
zero), then set of vectors v1 , v2 ,, vn is said to be
linearly independent.
 Example: 1
1   4 2 
Let v1 = 2 , v2 = 5  , v3 = 1  ,
3  6 0 
a. Determine if the set {v1, v2, v3} is linearly independent
Solution
Since, a set of vectors is linearly independent, if and only if the
vector equation of homogenous system has only trivial solution.
Therefore, we must determine if there is a nontrivial solution for
given homogenous system using row operations on the associated
augmented matrix

1 4 2 0  -2R +R 1 4 2 0  -1/3 R 1 4 2 0 
2 5 1 0  → 1 2
0 - 3 - 3 0  → 2 0 1 1 0 
  -3R1+R3    
3 6 0 0 0 - 6 - 6 0 6R2+R3 0 0 0 0
 Example: 1 (Contd.)
From row echelon form matrix it can be seen that:

x1 + 4 x2 + 2 x3 = 0 x1, x2 : basic variables

x2 + x3 = 0 x3: free variable

Therefore, each non-zero value of x3 determines a nontrivial

solution of giver linear system. Hence, v1,v2,v3 are linearly
dependent (i.e. not linearly independent).
b. Find a linear dependence relation among v1,v2,v3
To find a linear dependence relation among v1,v2,v3 reducing
the row echelon matrix to reduced row echelon form

1 4 2 0  -4R +R 1 0 -2 0 
0 1 1 0  →
2 1
0 1 1 0  Thus x = 2 x & x = -x
    1 3 2 3

0 0 0 0 0 0 0 0

 Example: 1 (Contd.)
Now assigning any arbitrary value of x3, say x3=2 will yield:

x1 = 2 x3 = 4 x1, x2 : basic variables

x2 = − x3 − 2 x3: free variable

Substituting these values into vector equation will yield

4v1 − 2v2 + 5v3 = 0

Note this is one (out of infinitely many)

possible linear dependence relations among v1,
v2, v3.
 Example: 2
3 − 3 6 
Let v1 = 0 , v2 =  2  , v3 = 4  ,
0  3  0 
Determine if the set {v1, v2, v3} is linearly independent
Solution
We must determine if there is a nontrivial solution for given
homogenous system using row operations on the associated
augmented matrix

3 - 3 6 0 1/3 R1 1 - 1 2 0  -1/6 R3 1 - 1 0 0 1 0 0 0
0 2 4 0  → 0 1 2 0  → 0 1 0 0  R2→ +R1
0 1 0 0 
  1/2 R   -2R3+R2    
0 3 0 0  2
0 0 - 6 0 0 0 1 0  0 0 1 0
-3R +R2 3 -2R +R
3 1

Since, it can be seen from reduced echelon form that x1=x2=x3=0

i.e. Trivial solution only, implying given set of vectors {v1, v2, v3} is
linearly independent.
 Exercise: 1
 0  0 − 8 
Let v1 = − 6  , v2 =  4 , v3 = − 4  ,
 1  − 2   3 
Determine if the set {v1, v2, v3} is linearly independent
Solution
We must determine if there is a nontrivial solution for given
homogenous system using row operations on the associated
augmented matrix
R1
 0 0 -8 0  1 -2 3
→ 0 1 - 2 3 0 1 - 2 3 0
− 6 4 - 4 0  → − 6 4 - 4
R3
0  6R
→ 1+ 
0 - 8 14 
0  → 0 1 - 7/4
-1/8 R
2
0
   R2 
 1 - 2 3 0  0 0 - 8 0 0 0 - 8 0 0 0 1 0
-1/8 R 3

Since, it can be seen from reduced echelon form that x1=x2=x3=0

i.e. Trivial solution only, implying given set of vectors {v1, v2, v3} is
linearly independent.
 Exercise: 2
1  - 2  8 
Let v1 = 2 , v2 =  1  , v3 = 6  ,
3   1  10 
Determine if the set {v1, v2, v3} is linearly independent
Solution
Using row operations on the associated augmented matrix yields
row echelon matrix given below

1 - 2 8 0 
0 1 - 2 0  x1, x2 : basic variables
  x3: free variable
0 0 0 0 

Therefore, each non-zero value of x3 determines a nontrivial

solution of giver linear system. Hence, v1,v2,v3 are linearly
dependent (i.e. not linearly independent).
 Exercise: 3
 3  3 1 
Let v1 = − 2 , v2 = - 1 , v3 = 0  ,
 2   4  5 
Determine if the set {v1, v2, v3} is linearly independent
Solution
Using row operations on the associated augmented matrix yields
row echelon matrix given below

1 1 1/3 0 
0 1 2/3 0 x1, x2 , x3 : basic
  variables
0 0 1 0

Since, it can be seen from row echelon form that this matrix can be
row reduced to obtain x1=x2=x3=0 i.e. Trivial solution only, implying
given set of vectors {v1, v2, v3} is linearly independent.
 Linear independence of Matrix
columns
➢ Suppose that we begin with a matrix A={V1,…,Vn}
instead of a set of vectors as in previous problems.
The matrix equation Ax = 0 can be written as:
x1v1 + x2 x2 +  + xn xn = 0 − −  (vector equation of homogenous system)

The columns of a matrix A are linearly independent if and

only if the equation Ax = 0 has only the trivial solution.
 Example: 1
Determine if the columns (i.e. vectors) of matrix A are linearly
independent
0 1 4 
A = 1 2 - 1
Solution
5 8 0
Using row operations on the associated augmented matrix of Ax=0
yields row echelon matrix given below

1 2 -1 0
0 1 4 0 
x1, x2 , x3 : basic
 variables
0 0 1 0 

Since, it can be seen from row echelon form that this matrix can be
row reduced to obtain x1=x2=x3=0 i.e. Trivial solution only, implying
columns of A are linearly independent.
 Exercise: 1
Determine if the columns (i.e. vectors) of matrix A are linearly
independent
 1 3 - 2 0
A =  3 10 - 7 1 
Solution
− 5 - 5 3 7
Using row operations on the associated augmented matrix of Ax=0
yields reduced row echelon matrix given below

1 0 0 -2 0
0 1 0 0 0 
x1, x2 , x3 : basic
 variables
0 0 1 -1 0 x4: free variable

Therefore, each non-zero value of x4 determines a nontrivial

solution of giver linear system. Hence, columns of A are
linearly dependent (i.e. not linearly independent).
 Exercise: 2
Determine if the columns (i.e. vectors) of matrix A are linearly
independent
 1 1 0 4 
− 1 0 3 -1 
A= 
 0 -2 1 1 
 
Solution  1 0 -1 3 
Using row operations on the associated augmented matrix of Ax=0
yields row echelon matrix given below
1 1 0 4 0  x1, x2 , x3 : basic
0 1 3 3 0 
A=  variables
0 0 1 1 0 
  x4: free variable
0 0 0 0 0 

Therefore, each non-zero value of x4 determines a nontrivial

solution of giver linear system. Hence, columns of A are
linearly dependent (i.e. not linearly independent).
Linear Transformation
 Linear Transformation (Contd.)

When we see this notation (T: Rn→Rm) we know

that we’re going to be dealing with a function that
takes elements from the set Rn (called the
domain) and associates them with elements from
the set Rm (called the codomain).
 Linear Transformation (Contd.)
• These kinds of functions are called transformations
and we say that T maps Rn into Rm.
• On an element basis we will also say that T maps
the element u from Rn to the element v from Rm
Linear Transformation (Contd.)
x
Example
 Example: 1
 1 -3  3 3 
 2
 
Let A =  3 5 , u =   , b =  2  , c = 2  ,
− 1 7  -1 − 5  5 
and define a transformation T : R2 → R 3 by T(x) = Ax, so that
 1 -3  x1 − 3x2 
   x1   
T ( x) = Ax =  3 5   = 3x1 + 5 x2 
− 1 7   x2 
− x1 + 7 x2 

a. Find T(u), the image of u under the transformation T

The vector T(u)= Au is called the image of u under the action f T

 1 -3  5
 2 
T (u ) = Au =  3 5   =  1 
 
− 1 7   -1
− 9 
 Example: 1 (Contd.)
b . Find an x in R2 whose image under T is b

The vector T(x)= Ax is called the image of x under

the action f T. So solving T(x)= b for x i.e. Solving
Ax = b or
 1 - 3  3
 3 5   x1  =  2
 x   
- 1 7   2  − 5 

Now using the matrix equation [v1 v2 …vn b] and row

reducing the augmented matrix yields
1 0 3/2  Hence, The image of this
0 1 - 1/2  1 .5 
 
x1=1.5 &
x=  x under the action
0 0 0  x2=-0.5
 − 0 . 5  of T is b.
 Example: 1 (Contd.)
c . Determine if c is in the range of the transformation T

The vector c is in the range of T if c is the image of some x in R2,

i.e. if c = T(x) for some x. This is another way of asking if the
system Ax = c is consistent i.e. is any solution exists for x

 1 -3  3 
 3 5  x1  , = 2
  x   
− 1 7   2 
5 
Now using the matrix equation [v1 v2 …vn b] and row
reducing the augmented matrix yields
1 -3 3  The third equation 0 = - 35 implies
0 1 2  system is inconsistent. So, c is not in

0 0 - 35 the range of T
 Example: 2
Suppose that T: R5 -> R2, and T(x) = Ax for some matrix
A and each x in R5. How many rows and column does A
have?
➢ Since, the column dimension of the “lead” matrix (A) must be
equal to the row dimension of the “lag” (x) matrix , therefore, A
must have 5 columns for Ax to be defined.
➢A must have 2 rows for the range of T to be in R2

5=5
A x
25 51

Ax
21
 Exercise: 1
Let A be a 7 x 5 matrix. What must n and m be in order
to define T: Rn -> Rm, by T(x) = Ax?
➢ Since, the column dimension of the “lead” matrix (A) must be
equal to the row dimension of the “lag” (x) matrix , therefore, x
must have 5 columns for Ax to be defined i.e. n = 5.
➢ Ax will have 7 rows as shown below, so m = 7

5=5
A x
75 51

Ax
71
 Exercise:2
3 0
For A =   , define a transformation T : R2 → R 2 by T(x) = Ax
0 3
1  - 4 
Find the images under T of u =   and v =  
5 - 1 
The transf ormation T : R2 → R 2 by T(x) = Ax, is
3 0  x1   3 x1 
T ( x) = Ax =     = 
 0 3 2   2 
x 3 x
The vector T(u)= Au is called the image of u under the action f T
The vector T(v)= Av is called the image of v under the action f T

3 0 1   3  3 0 − 4 − 12
T (u ) = Au =     =  & T (v) = Av = 0 3 − 1  =  − 3 
0 3 5 15       
 Exercise:3
With T defined by T(x) = Ax, find an x whoseimage under T is b,
and determine if x is unique.
 1 0 - 1  0 
Let A =  3 1 - 5 , b = − 5 

− 4 2 1  − 6 

The vector T(x)= Ax is called the image of x under

the action f T. So solving T(x)= b for x i.e. Solving
Ax = b or

1 0 - 1   x1  0  Since, A has 3
3 1 - 5   x  = − 5  columns, so x
   2   must contain 3
- 4 2 1   x3  − 6 rows, for Ax to be
defined
 Exercise:3 (Contd.)
Now using the matrix equation [v1 v2 …vn b] and row reducing
the augmented matrix yields reduced echelon form

1 0 -1 0  1 0 0 4   4
3 1 -5 -5  − −−  0 1 0 3  − −  x = 3 
     
- 4 2 1 - 6  0 0 1 4  4

➢ The image of this x under the action of T is b.

➢ Furthermore,it is clear that given system has
unique solution i.e. x is unique.
 Exercise:4

With T defined by T(x) = Ax, find an x whose image under T is b,

and determine if x is unique.
 1 0 3 − 4 
Let A =   , b=  
− 2 1 -3   9 

The vector T(x)= Ax is called the image of x under

the action f T. So solving T(x)= b for x i.e. Solving
Ax = b or

 x1  Since, A has 3
1 0 3     − 4 columns, so x
- 2   x2  =  
 1 -3   9 must contain 3
 x3  rows, for Ax to be
defined
 Exercise:4 (Contd.)
Now using the matrix equation [v1 v2 …vn b] and row reducing
the augmented matrix yields reduced echelon form
− 4 − 3 x3 
1 0 3 -4  1 0 3 - 4   1 − 3x 
- 2 1 - 3  − −−  0 1 3 1  − −  x =  3 
 9     x3 
x3 : free variable, say x3 = 0 = x1 = −4 & x2 = 1

➢ The image of this x under the action of T is b.

➢ Furthermore, each non-zero value of x3
determines a nontrivial solution of giver
linear system. Hence, given system does not
have unique solution i.e. x is not unique.
 Exercise:5
Find all x in R 4 that are mapped (transformed) into the zero vector
by the transformation x → Ax.
1 3 4 - 3
Let A = 0 1 3 - 2  ,
3 7 6 - 5 

The vector T(x)= Ax is called the image of x under the

action f T. Since, x is transformed into a zero vector,
So solving T(x)= 0 for x i.e. Solving Ax = 0 or
 x1  Since, A has 4
1 3 4 -3   x  0  columns, so x
0 1 3 - 2   2  = 0 
  x3    must contain 4
3 7 6 - 5    0 rows, for Ax to be
 x4  defined
 Exercise:5 (Contd.)
Now using the matrix equation [v1 v2 …vn b] and row reducing
the augmented matrix yields row echelon form

5 x3 − 3 x4 
1 3 4 -3 0  1 0 -5 3 0   
0 1 3 - 2 0  − −−  0 1 3 -2 0  −  x = − 3 x3 + 2 x4 
   x3 
3 7 6 - 5 0  0 0 0 0 0   
 x 4 

➢ x3 and x4 are free variables, implying vector x represents a

general solution for all x in R4 that are mapped into the zero
vector.
5  -3
− 3 2 
Let x3 = 0 & x4 = 1, = x =   & x3 = 1 & x4 = 0, = x =  
1  0 
   
0  1 
 Exercise:6
1 3 4 -3   1
Let , A = 
0 1 3 -2 
 &b=  -
  1

3 7 6 -5 
 
 7 
Is b in the range of linear transformation x → Ax

The vector b is in the range of T if b is the image of some

x , i.e. if b = T(x) for some x.
This is another way of asking if the system Ax = b is
consistent i.e. is any solution exists for x
 x1 
1 3 4 -3  x   1
0 1 3 -2   2  = - 1
   x3   

3 7 6 -5 
   
 7
 4
x
 Exercise:6 (Contd.)
Now using the matrix equation [v1 v2 …vn b] and row
reducing the augmented matrix yields

1 3 4 -3 1  1 3 4 -3 1 
0 1 3 - 2 -1  − −  0 1 3 - 2 -1 
   

3 7 6 -5 7   
0 0 0 0 2 


The third equation 0 = 2 implies system is inconsistent.

So, b is not in the range of linear transformation x → Ax