Escolar Documentos
Profissional Documentos
Cultura Documentos
SOLVED ASSIGNMENTS
SEMESTER FALL-2004
Solution of Assignment # 1 of MTH501
(Fall2004)
Q1. Consider the system of equations
x y 2z a
x z b
2 x y 3z c
Show that the system to be consistent , the constant a, b and c must satisfy c = a + b.
Ans wer:
The augmented matrix correspond to the above system is
1 1 2 a
1 0 1 b . We will find out the echelon form of this matrix which can be
2 1 3 c
obtained by the following steps.
1 1 2 a
1 0 1 b
2 1 3 c
1 1 2 a
0 1 1 b a by R2 R1 , R3 2 R1
0 1 1 c 2a
1 1 2 a
0 1 1 a b by R2 , R3 R2
0 0 0 c a b
Now as you know that if augmented matrix of a linear system in echelon form
have any row of the form [0 0 0… b] where b is non zero then that system will
be inconsistent. Now in the above matrix we have third row as [0, 0, 0, c-a-b] and
in order to system be consistent we must have c –a –b =0 which is equivalent to
c = a + b.
Note:
There are more then one method to solve that question as you can also
put the given values x=r y=2 and z=1 in the system of linear equation and
then you can conclude the same. But concept used in this question is that “If
system of linear equations is consistent then it will have unique solution or
infinite many solutions”. This is not possible that a system of linear equations
have 2 or 3 or 10 solutions.
Q3. An oil refinery produces low-sulfur and high-sulfur fuel. Each ton of low-sulfur
requires 5 minutes in the blending plant and 4 minutes in the refining plant; each
ton of high sulfur fuel requires 4 minutes in the blending plant and 2 minutes in
the refining plant. If the blending plant is available for 3 hours and the refining
plant is available for 2 hours, how many tons of each type of fuel should be
manufactured so that the plants are fully utilized?
Ans wer:
The data given in the question can be formed into system of linear
equations as
Low-sulfur High-sulfur
Blending plant 5 4
Refining Plant 4 2
As we are given in the question that we have blending plant and refining plant
available for 3 and 2 hours respectively. Let x tons of low-sulfur and y tons of
high sulfur be the amount should be manufactured so that plants are fully utilized.
Then from the above data we must have the system,
5x + 4y = 180
4x + 2y = 120
Augmented matrix for the above system
5 4 180 1 2 60
4 2 120 4 2 120 by R1 R2
is
1 2 60
0 6 120
So we have x + 2y = 60 and -6y = - 120, thus we have y= 20 tons and x = 20tons
are the required manufactured tons of each low-sulfur and high-sulfur so that we
can utilize both plants for the given time.
Q4.
(a) Find a linear equation in the variables x and y that has the general solution
x = 5 + 2t, y= t.
1 5
(b) Show that x=t, y t is also the general solution of the equation in
2 2
part (a).
Ans wer:
(a)
We have to find out linear equation for which the given parametric
equations x = 5 + 2t, y= t define the coordinates of any point on that line.
And in order to get the required linear equation we will simply find an equation
independent of the parameter “t”
Suppose x = 5 + 2t ---------- (1)
y = t--------------- (2)
Put t=y in eq. (1) we get
x= 5 + 2y
This is the required linear equation.
(b)
t =5 + 2y --------------- (B)
Y = t/2 – 5/2
1 5
y t
2 2
1 5
This shows that x=t, y t is also the general solution of the equation in part (a).
2 2
5 1 k
Q5. Consider x 2 , y 2 and w 2 find the value(s) of k such that the
7 3 k 3
vector w is in the span of x and y.
Ans wer:
We have to find the value(s) of k (if possible) under the condition that w is in the
span of x and y
As we are able to find the values of the unknowns so we can write the given
1 12 7 11 9 5 1
4 9 4 8 7 3 4
vector as c1 c c c c
5 6 2 11 3 7 4 3 5 9 5
7 4 6 10 5 12 7
Hence the given vector is the linear combination of columns of the given matrix.
2 x1 2 x2 x3 x5 0
x1 x2 2 x3 3 x4 x5 0
Q2. Determine whether the Homogeneous system has
x1 x2 2 x3 x5 0
x3 x4 x5 0
non-trivial solution or not. If it has non-trivial solutions then write the solution in
parametric form.
Solution:
2 2 1 0 1
1 1 2 3 1
Matrix of coefficients for the above system is then
1 1 2 0 1
0 0 1 1 1
1 1 2 0 1
0 0 0 3 0
reduced echelon form of the matrix is thus we have,
0 0 1 0 1
0 0 0 1 0
x1 x2 2 x3 x5 0 x1 x2 2 x3 x5
3 x4 0 x4 0
x3 x5 0 x3 x5
x4 0
Also by putting the value of x3 x5 in first equation we get,
x1 x2 2 x5 x5 x1 x2 x5 which shows that x2 and x5 are free variables. So
we can take x2 t and x5 s where s and t are arbitrary real numbers, thus the
parametric form of the solution is given by the following equation.
x1 t s 1 1
x 1 0
2 t
x3 s t 0 s 1 .
x4 0 0 0
x s 0 1
5
Q3.
(a) Determine whether the given vectors (1, 2, 3, 5), (2, 7, 6, 0), (1, 1, 1, 1)
and (3, 5, 7, 9) are linearly independent or not. Justify your answer.
(b) For what values of c the vectors (-1, 0, -1), (2, 1, 2) and (1, 1, c) are
linearly dependent in R3 .
Solution:
Consider the linear combination of the given vectors as
1 2 1 3 0
2 7 1 5 0
c1 c c c . Now we will solve that homogeneous
3 2 6 3 1 4 7 0
5 0 1 9 0
system and if we gat the non trivial solution of that system then the given four
vectors will be linear dependent otherwise the four vectors will be linear
independent. Matrix of coefficients for the above homogeneous system is,
1 2 1 3
1 2 1 3 0 1 1 1
2 7 1 5 3 3
and the echelon form of that matrix is 1 .
3 6 1 7 0 0 1
2
5 0 1 9 50
0 0 0
3
Since the matrix has pivot position in each row hence the homogeneous system
has only trivial solution. Thus we can conclude that the given vectors are linearly
independent. Also note that the homogenous system in Q2 has non trivial solution
because second row of the matrix of coefficients in echelon form has no pivot
position.
(b)
In order to get the required value or values of c we will solve the homogeneous
system of linear equations correspond to the linear combination
1 2 1 0
x1 0 x2 1 x3 1 0 and we will find out the value of c such that this
1 2 c 0
homogeneous system will have non-trivial solution. So the matrix of coefficients
1 2 1 1 2 1
0 1 1 1 .
is and the echelon form of that matrix is 0 1
1 2 c 0 0 c 1
Now if you choose c such that c -1 = 0 then the above system will have a free
variable namely x3 and thus has non trivial solution, which implies that for this
value of c we have three vectors linearly dependent in R3 thus the required value
of c is 1.
Q4.
(a) Show that the mapping T : R 2 R5 defined by
T(x, y) = (x, x-y, 2x-4y, y, x + y) is a linear transformation.
Solution (a):
We will show that the given transformation satisfies the conditions.
(i) T (u + v) = T(u) + T(v) Where u = (a, b) and v = (c, d) are the
arbitrary two elements of R2 .
(ii) T(cu) = c T(u)
(ii) T(cu) = T(ca, cb) = (ca, ca – cb, 2ca -4cb, cb, ca + cb)
= c (a, a – b, 2a -4b, b, a + b) =c T(a, b)
T(cu) = c T(u)
Thus both conditions are satisfied by the given transformation hence the
transformation is linear.
(b) If we have a linear transformation T:R3 R3 such that
1 1 0 1 0 1
T 0 2 , T 1 0 and T 0 0 then find the matrix of
0 0 0 1 1 0
x1
transformation T and find the image of x2 .
x3
Solution (b):
Since we know that matrix of linear transformation T:Rm Rn is
T (e1 ) T (e2 ) T (e3 ) . . . T (em )
Where e1 (1, 0, 0,..., 0), e2 (0,1, 0,..., 0), e3 (0, 0,1,..., 0)...em (0, 0, 0,...,1)
Thus matrix of the linear transformation is
1 0 0 1 1 1 x1
A T 0 T 1 T 0 2 0 0 and hence the image of x2 is given
0 0 1 0 1 0 x3
x1 1 1 1 x1 x1 x2 x3
by T x2 2 0 0 x2 2 x1 .
x3 0 1 0 x3 x2
Q5. (a) Find a linear transformation which projects every element of R3 into xz-
10
plane and then find the image of 15 .
100
(c) Three friends play a game in which there are always two winners and one
loser. They have the understanding that the loser gives each winner an
amount equal to what the winner already has. After three games, each just
lost once and each has 24$. With how much money did each begin?
Solution (a):
Since we have to find out a linear transformation which projects every
element of R3 into xz-plane that is the linear transformation when acts on an
element of R3 made the y component of that vector 0. Thus we can say that
x1 x1
formula for that linear transformation is T x2 0 and thus the image of
x3 x3
10 10
15 under such a linear transformation is 0 .
100 100
Solution (b):
Let x, y and z be the starting money of the three friends A, B and C
respectively. Now we will consider the three games separately.
1st game:
Suppose that in the first game A having x money is loser then by the given
conditions in the question after 1st game A, B and C will have x - y - z, 2y and 2z dollars
respectively.
2nd game:
Suppose that in the second game B having 2y money is loser then by the
given conditions in the question after 2nd game A, B and C will have 2x -2 y -2z,
2y - 2z – x + y + z =3y – z – x and 4z dollars respectively.
3rd game:
Suppose that in the third game C having 4z money is loser then by the
given conditions in the question after 3rd game A, B and C will have 4x -4 y -4z,
6y – 2z - 2x and 4z -2x + 2y +2z -3y + z+ x=7z – x- y dollars respectively.
Now as we are given in the question that after three games each A, B and C has 24$. So
we have,
4x -4 y -4z = 24
6y – 2z - 2x= 24
7z – x - y = 24
4 4 4 24
Augmented matrix for that system is 2 6 2 24 and echelon form of that
1 1 7 24
1 1 7 24
matrix is 0 0 2 3 and this gives us z = 12$, y = 21$ and x = 39$.
0 0 1 12
You can also check that solution satisfies all the given conditions in the question.
Solution of Assignment # 3 of MTH501
(Fall2004)
6 1 1
Q1.
Given that the matrix A is symmetric if A 1 14
t
4 and
1 4 2
x 2 y 3z 1 1
A 1 2x 3y 2z 4 then find the values of x, y and z (if
1 4 3 x y z
possible).
Solution:
Since the given matrix is symmetric so we have A=At so we can write
x 2 y 3z 1 1 6 1 1
1 2x 3y 2z
4 1 14 4 As we know that two
1 4 3x y z 1 4 2
matrices will be equal if the order and corresponding entries of the matrices are equal. So
by using this fact we can write,
x 2 y 3z 6
2 x 3 y 2 z 14
3x y z 2
1 2 3 6
2 3 2 14 and echelon form of the this
So augmented matrix for the system is
3 1 1 2
1 2 3
matrix is 0 1 2 x 1, y 2, z 3 , thus we get,
0 0 1
1 4 9 1 1 6 1 1
1 266 4 1 14 4 . Hence x 1, y 2, z 3 are
1 4 3 2 3 1 4 2
the required values.
9 0 1 2 4 1
Q2. If A 3 4 4 B 0 1 6 then find
2 8 0 1 8 0
(i) The element a32 of the matrix AB without calculating the matrix AB.
(ii) The element a11 of the matrix BA without calculating the matrix BA
Solution (i):
Since the a32 element of the product AB will be the sum of the
corresponding elements of the third row of A and second column of B. Thus we
4
have a32 1
2 8 0 8 2 4 8 ( 1) 0 8 0
Solution (ii):
Since the a11 element of the product BA will be the sum of the
corresponding elements of the first row of B with the first column of A. Thus we have
2 4 1 9
a11 3 18 12 2 22
2
3 0 1 1 2 1
Q3. Consider the Matrices A 0 0 4 B 0
4 1 then show
1 1 0 1 8 0
that ( AB)1 B 1 A1 .
Solution:
First of all we will find out the product AB then we will find out the
4 14 3
32 0 and
inverse of AB. So AB 4
1 6 2
0.5333 0.0833 0.8000
AB 0.0667 0.1000 --------------- (i)
1
0.0417
0.0667 0.0833 0.6000
Now we have
0.3333 0.0833 0 0.8000 0.8000 0.2000
A 0.3333 0.0833 1 and B 0.1000
0.1000 0.1000
1 1
Solution (ii):
Since we have
cos sin cos sin cos( ) sin( )
A thus A , A
sin cos sin cos sin( ) cos( )
and we have
cos sin cos sin cos cos sin sin cos sin sin cos
A A
sin cos sin cos sin cos cos sin sin sin cos cos
6u - 2v - 4w + 4y = 2
3u - 3v - 6w + y = - 4
-12u + 8v + 21w - 8y = 8
-6u - 10w + 7y = - 43
Find the solution of the above system using LU decomposition.
Solution:
First of all we will find out the LU factorization of the matrix of
6 2 4 4
3 3 6 1
coefficients of the above system which is A
12 8 21 8
6 0 10 7
Step1:
Zero out below the first diagonal entry of A. We get
1 0 0 0
6 2 4 4 1
0 2 4 1 1 1 0 0
R2 R1 , R3 2 R1 , R4 R1 2 Where
0 4 13 0 2 0
2
* 1
0 2 14 11
1 * * 1
in the second matrix entries below first diagonal entry: 1 are the negative of the
multipliers of the row operations which we did in the first matrix.
Step2:
Zero out the entries below the second entry of the diagonal.
1 0 0 0
6 2 4 4 1
1
0 2 4 1 0 0
R3 2 R2 , R4 R2 2
0 0 5 2 2 2 1
0
0 0 10 12
1 1 * 1
Step3:
Zero out the entries below the third entry of the diagonal.
1 0 0 0
6 2 4 4 1
1
0 2 4 1 0 0
R4 2 R3 2 .
0 0 5 2 2 2
1 0
0 0 0 8
1 1 2 1
1 0 0 0
6 2 4 4 1
1
0 2 4 1 0 0
Thus we have U L 2 .
0 0 5 2 2 2
1 0
0 0 0 8
1 1 2 1
Now our system becomes LUx = b where,
1 0 0 0
1 6 2 4 4 u 2
4
1 0 0 0 2 4 1 v
L 2 ,U ,x and b
2 2 0 0 5 2 w 8
1 0
0 0 0 8 y 43
1 1 2 1
z1
z
Let Ux = z where z and by solving Lz = b we get,
2
z3
z4
1 0 0 0 z1 2
1 z1 2
1
1 0 0 z2 4 z2 4 z1 5
2
z3 8
2
2 2
1 0
z z3 8 2 z1 2 z2 2
1 4 z 43 z z 2 z 32
43
1 1 2 4 1 2 3
Now we will solve the system Ux = z which will give the solution of the above system.
6 2 4 4 u 2 y 4
0 2 4 1 v 5 w 1.2
0 0 5 2 w 2 v 6.9
0 0 0 8 y 32 u 4.5
Solution of Assignment # 4 of MTH501
(Fall2004)
3 2 0 0
1 2 0 0 2 0
0
3 4 0 4 0
0 0
Q1. Let U and V 0 0 1 2
0 0 5 1 2
0 0 2 3
0 0 3 4 1
0 0 4 1
Determine whether U and V are block diagonal matrices and find UV using block
matrix multiplication.
Solution
3 2 0 0
1 2 0 0 0 2
3 4 0 0 0 4 0 0
U= and V = 0 0 1 2
0 0 5 1 2
0 0 2 3
0 0 3 4 1
0 0 4 1
1 2 0 0 0 0 0 5 1 4
Here A22 = O 23 = O22 = B23 = C22 =
3 4 0 0 0 0 0 3 4 1
0 0 1 2
3 2 0 0 0
2 O22 = O 32 = 0 D32 = 2 3
4 0 0 0 0 4 1
Then U and V becomes
A22 O23 C22 O22
U and V
O22 B23 O32 D32
A22C22 O23O32 A22O22 O23 D32
UV
O22C22 O32 B23 O22O22 B23 D32
1 2 3 2
A22C22
3 4 2 4
7 6
17 10
1 2
5 2
3
1
B 23 D32
1
2
3 4
4 1
1 9
7 5
7 6 0 0
17 10 0 0
UV
0 0 1 9
0 0 7 5
is the required result
Solution:
From the given system we see that,
1 4 1 is not staisfied .
1 4 is not staisfied .
4 1 staisfied .
Thus the given system is not diagonally dominant. But by interchanging first two rows
we get the system
4x1 – x 2 = 10
-x 1 + 4x2 – x3 = 3
- x 2 + 4x 3 = 6
4 1 staisfied .
Now you can check that 4 1 1 staisfied . hence we made the system diagonally
4 1 staisfied .
dominant.
Jacobi’s Method:
4x1 – x 2 = 10
-x 1 + 4x2 – x3 = 3
- x 2 + 4x 3 = 6
10 x2k
x1k 1
4
3 x1k x3k
x2k 1
4
k 1 6 x2k
x3
4
Take initial iteration ( x10 , x20 , x30 ) (0, 0, 0)
For first iteration put k 0
10
x11
4
3
x12
4
6
x31
4
10 3 6
( x11 , x12 , x31 ) ( , , )
4 4 4
For sec ond iteration put k 1
10 3 / 4 43
x12
4 16
3 10 / 4 6 / 4 28
x22
4 16
6 3 / 4 27
x32
4 16
43 28 27
( x12 , x22 , x32 ) ( , , )
16 16 16
For third iteration put k 2
10 28 /16 188
x13
4 64
3 43 /16 27 /16 118
x23
4 64
6 27 /16 123
x33
4 64
188 118 123
( x13 , x23 , x33 ) ( , , )
64 64 64
Seidal method
4x1 – x 2 = 10
-x 1 + 4x2 – x3 = 3
- x 2 + 4x 3 = 6
k 1 10 x2k
x
1
4
3 x1k 1 x3k
x2K 1
4
K 1
6 x2
x3k 1
4
In int ial iteration ( x10 , x20 , x30 ) (0, 0, 0)
For first iteration put k 0
10 0 10
x11
4 4
3 10 / 4 0 22
x12
4 16
6 22 /16 118
x31
4 64
10 22 118
( x11 , x12 , x31 ) ( , , )
4 16 64
For sec ond iteration put k 1
10 22 /16 182
x12
4 64
3 182 / 64 118 / 64 492
x22
4 256
6 492 / 256 2028
x32
4 1024
182 492 2028
( x12 , x22 , x32 ) ( , , )
64 256 1024
For third iteration put k 2
10 492 / 256 3052
x13
4 1024
3 3052 /1024 2028 /1024 8152
x23
4 4096
6 8152 / 4096 32728
x33
4 16384
3052 8152 32728
( x13 , x23 , x33 ) ( , , )
1024 4096 16384
4 0 7 3 5
0 0 2 0 0
Q3. Consider the matrix 7 3 6 4 8 then find
5 0 5 2 3
0 0 9 1 2
(i) (3, 1)th Cofactor of the above matrix.
(ii) Minor correspond to the element a55 .
(iii) Determinant of the matrix using such a row or column which involves the
least amount of computations.
Solution:
0 7 3 5
0 2 0 0
(i) (3, 1)th Cofactor of the above matrix is (1)31 .
0 5 2 3
0 9 1 2
4 0 7 3
0 0 2 0
(ii) Minor correspond to the element a55 is
7 3 6 4
5 0 5 2
(iii) From the given matrix you can see easily that second row and second
column have only one non-zero entries, so if we expand the determinant
by taking second row or column then we will involve fewer calculations.
So expanding the given matrix by second
4 0 7 3 5
4 0 3 5
0 0 2 0 0
7 3 4 8
row 7 3 6 4 8 (1) 23 Now again
5 0 2 3
5 0 5 2 3
0 0 1 2
0 0 9 1 2
expanding the determinant by second column will reduce the calculations.
4 0 7 3 5
4 0 3 5
0 0 2 0 0
7 3 4 8
7 3 6 4 8 (1) 23 2
5 0 2 3
5 0 5 2 3
So 0 0 1 2 Again
0 0 9 1 2
4 3 5
2 (1) 3 5 2 3
2 2
0 1 2
expanding by the third row we
get
4 0 7 3 5
4 0 3 5
0 0 2 0 0
7 3 4 8
7 3 6 4 8 ( 1) 23 2
5 0 2 3
5 0 5 2 3
0 0 1 2
0 0 9 1 2
4 3 5
4 5 4 3
2 (1) 2 2 3 5 2 3 6 (1)3 2 (1) (1)33
5 3 5 2
0 1 2
(6) 12 15 8 15 (6){(3) (7)} 24
Q4.
(i) Determine the volume of the parallelepiped which has the following
vectors as its adjacent sides,
a 3i 2 j k , b i 10 j 5k and c i 2 j 3k .
(ii) Consider the linear transformation T: R3 R3 defined as
x1 3x1 2 x2 x1
T x2 0 x1 4 x2 5 x3
x3 0 x1 2 x2 2 x3
If S be the volume of the parallelepiped in R3 formed by the vectors (1, 1,
1) ,(2, 3, 7) and (3, 5, 7) find the volume of T(S).
Solution:
(i) Volume of the parallelepiped is equal to the determinant of the
given vectors which
3 2 1
10 5 1 5 1 10
is 1 10 5 3 2 1 120 16 8 128
2 3 1 3 1 2
1 2 3
(ii) First of all we will write the matrix of transformation which
3 2 1
5 Also we know that
is 0 4
0 2 2
Volume of T(S) = (Determinant of matrix of transformation of T) * (Volume of S)
1 1 1
3 7 2 7 2 3
Volume of S = 2 3 7 1 1 1 14 7 1 6 but volume will be
5 7 3 7 3 5
3 5 7
positive so we have Volume of S = 6.
3 2 1
4 5
0 4 5 3 3(18) 54 . Thus we have,
2 2
0 2 2
Volume of T(S) = (-54) * 6 = -324, but we will take the positive value so,
Volume of T(S) = 324
Q5.
(i) Let n 1. Then Rn consists of
(a) V V F
(b) F V V
(c) FF F
Solution:
The correct answer is (b) as we have scalar multiplications from
F V V to vector space V.
(iii) Which of the following is statement is not an axiom for the real vector
space?
(a) For all x, y V we have x + y = y + x
(b) For all x, y, z V we have (x + y) + z = x + (y + z)
(c) For all x, y, z V we have (xy)z = x(yz)
Solution:
As we know that a Vector space V along with a field is a group under
addition and satisfy the scalar multiplication properties but a vector space is associate
with respect to multiplication is not necessary. Thus option (c) is incorrect.
(iv) Which of the following is true? If V is a vector space over the field F
(a) x y / x V , y V V
(b) x y / x V , y V V V
(c) v / v V , F F V
Solution:
The option (a) is true as we know that for a vector space V we
have x, y V then x y V which means that x y / x V , y V V .
(a) U x Rn /, x1 x2 ... xn
(b) U x Rn /, x12 x2 2
(c) U x R n /, x1 1
Solution:
In order to check whether the given subsets are subspaces or not we will
check the two conditions.
(i) If x, y U x y U .
(ii) If c F and v U then cv U
(a) U x Rn /, x1 x2 ... xn is a subspace of Rn as for,
x, y U where x ( x1 , x2 ,...xn ) and y ( y1 , y2 ,... yn ) also x1 x2 ... xn , y1 y2 ... yn
Then we have,
x y ( x1 , x2 ,...xn ) ( y1 , y2 ,... yn ) ( x1 y1 ,.x2 y2 ,..xn yn ) U
because x1 y1 x2 y2 ... xn yn as x1 x2 ... xn , y1 y2 ... yn
So first condition of subspace is satisfied by U.
c F and v U where v ( x1 , x2 ,.., xn ) suchthat x1 x2 .. xn
Now take
cv (cx1 , cx2 ,.., cxn ) U because x1 x2 .. xn cx1 cx2 .. cxn
Hence the set given in the part (a) is a subspace of the vector space Rn .
(b) U x Rn /, x12 x2 2
(c) U x R n /, x1 1
a. For the bases {(4,3, 7), (2, 1, 0), (1, 0,13)}of R3 find the
coordinate of the element (-7, 5, 1) relative to the bases .
b. For the bases {2 x 2 x,3 x 2 1, x 2 } of 2 find the coordinate of the
16 x 2 5 x 9 relative to .
Solution:
(i)
In order to get the coordinate of the element (-7, 5, 1) relative to the given
bases {(4,3, 7), (2, 1, 0), (1, 0,13)}of R3 we will solve the following system.
4 2 1 7
x 3 y 1 z 0 5 The values of x, y and z will be the required coordinates.
7 0 13 1
4 2 1 7
5 and by solving it we get the
Augmented matrix of that system is 3 1 0
7 0 13 1
values of unknowns as x = 2, y = 1, z = -1.
(ii)
In order to get the coordinate of the element 16 x 2 5 x 9 relative to the given
bases {2 x 2 x,3 x 2 1, x 2 } of 2 we will try to find out the values of a, b and c such
a 2 x 2 x b 3x 2 1 c x 2 16 x 2 5 x 9 x 0
that comparing the coefficients of
2a 3b c x 2 a x bx 0 16 x 2 5x 9 x 0
2a 3b c 16
x , x and x we get the following system a
2 0
5 by solving it we get the values
b 9
of unknowns as a = -5, b = 9, c = -1. Thus the coordinate of the given polynomial
is (5,9, 1)
Question # 2
1
1 1
have coordinate of 4 x 3 x 2 2 , coordinate of 2 x 3 1 .
2 2
3 1
P x 2 x 4 4 x 2 3x 2 2 x 2 3
Question # 3
For dimension of Column space; Dimension of Row space and Rank of the following
1 1 1 2
2 3 .
matrix 1 0
2 4 8 5
Solution:
In order to get the dimension of column space, dimension of row space and rank
of the given matrix first of all we will find out the echelon form of the given
1 1 1 2
matrix which is 0 1 3 1 . From the reduced echelon form it is quite
0 0 0 3
clear that the columns 1, 2 and four have the pivot positions thus the
corresponding columns in the given matrix are linearly independent and form a
bases for the column space of the given matrix. Hence dimension of column space
of the given matrix is 3.
Also from the echelon form it is clear that the non-zero rows of the given matrix
are three so forms a bases for the row space thus dimension of row space as well
as rank of the matrix is 3.
Defective matrix:
Let A be an n n matrix. If there is an eigenvalue of A such that
the geometric multiplicity of is less than the algebraic multiplicity of , then A
is called a defective matrix.
Question # 4
Solution:
First of all we will get the eigenvalues of the given matrix for which we
will solve the equation determined by the determinant det( A tI ) 0 now we have,
det( A tI ) t 4 5t 3 9t 2 7t 2 (t 1)3 (t 2)
Thus det( A tI ) 0 gives us t = 1, 1, 1, 2 as roots of the characteristic polynomials which
are the eigenvalues of the given matrix. As the eigenvalue 1 repeats three times so it has
Algebraic multiplicity of eigenvalue 1 is 3 and Algebraic multiplicity of eigenvalue 2 is
1.
In order to get the geometric multiplicity we will find out the dimension of the
eigenspaces correspond to these eigenvalues, for this we will solve the homogeneous
system.
A 1I 0 and the augmented matrix is,
6 1 1 1 0 6 1 1 1 0
16 1 4 4
0 48 3 12 12 0
7 2 0 1 0 42 12 0 6 0
11 1 3 2 0 66 6 18 12 0
6 1 1 1 0 6 1 1 1 0
0 5 4 4 0 0 5 4 4 0
0 5 7 1 0 0 0 3 3 0
0 5 7 1 0 0 0 0 0 0
3x4 3 3
x1 5 5 5
x 8x
x 2
4
x4 Thus the vector form bases for the eigenspaces correspond
8 8
x3 5 5 5
x
x4 4 1 1
x4 1 1
to the eigenvalue 1. Thus the geometric multiplicity of the eigenvalue 1 is 1 which is less
then the algebraic multiplicity of 1. Thus the matrix is by definition defective.
5 1 1 1 0 5 1 1 1 0
16 2 4 4 0 80 10 20 20 0
A 2 I
7 2 1 1 0 35 10 5 5 0
11 1 3 3 0 55 5 15 15 0
5 1 1 0
1 6 1 1 1 0
0 6 4 0
4 0 3 2 2 0
0 3 2 2 0 0 0 0 0 0
0 6 4 4 0 0 0 0 0 0
x3 x4
x1 3 1 1
x
2 2 x3 x4 x3 2 x4 2
x 3 3 3 0
x3 3
x
x4 3 0 3
x
4
Shows that dimension of eigenspaces is 2 which is the geometric multiplicity of the
eigenvalue 2 thus the algebraic multiplicity of eigenvalue 2 is less then Geometric
multiplicity of eigenvalue 2.
But eigenvalue 1 has geometric multiplicity less than algebraic multiplicity thus the given
matrix is defective.
Question # 5
1
(i) Find all 2 2 matrices for which is an eigenvector correspond to the
2
eigenvalue 5.
Solution:
a b
We have to find out the matrix such
c d
a b 1 1 a 2b 5
c d 2 5 2 c 2d 10
that a 2b 5 a 5 2b thus the required matrix
c 2d 10 c 10 2d
5 2b b
is
d
where b and d are any real numbers.
10 2d
(ii) True or false; A square matrix A is invertible if and only if 0 is not an
eigenvalue of A.
Solution:
The above statement is true.
(iii) If 5 is an eigenvalue of matrix A then find the eigenvalue of A5 without
any calculations and justify your answer.
Solution:
As we are given 5 is the eigenvalue of A then the eigenvalue of A5 will be
55 .
Justification:
Suppose is an eigenvalue of A then we will show that A2 will have
eigenvalue . Let x be the eigenvector correspond to that eigenvalue then by
2
Ax x
A Ax A x A2 x Ax
definition we have, but Ax x so,
A2 x x
A2 x 2 x 2 is an eigenvalue of A2 .
By using principle of Mathematical induction we can show that k will be the eigenvalue
of Ak for k 2,3, 4... .
1 2 3 5 0
0 9 4 2 1
(iv) Find eigenvalues of the matrix A 0 0 3 1 2 without any
0 0 0 4 3
0 0 0 0 1
calculation also find the eigenvalues of the matrix A-1 . If you are given
that A is invertible.
Solution:
Since we know that a triangular matrix has its eigenvalues as diagonal
elements, so the eigenvalues of the given matrix are 1, 9, 3, 4. Also we are given A is
1 1 1
invertible so the eigenvalues of A-1 will be 1, , , . Where we use the fact that if is an
9 3 4
1
eigenvalue of an invertible matrix A then will be an eigenvalue of A-1 .
1 k
(v) Consider the matrix A , where k is any arbitrary constant. For
1 1
what values of k the matrix A will have two distinct eigenvalues? When is
there no real eigenvalue?
Solution:
In order to get the answer of the asked questions we will solve the
1 k
A I 0 0 1 k
2
equation 1 1
1
From this you can easily decide that for k = 0 you will get the repeated eigenvalues and
all other values give distinct eigenvalues. Also if the value of k is less then zero then you
will get the complex eigenvalues so there will be no real eigenvalue if k is less then 0.
Question # 6
25 8 30
Show that A is diagonalizable, where A 24 7 30 .
12 4 14
Solution:
First of all we will find out the eigenvalues of the given matrix which
are 1 2 1 and 3 2 . A will be diagonalizable if it will have three linearly
independent eigenvectors correspond to these eigenvalues. So now we will calculate the
eigenvectors correspond to these eigenvalues. Eigenvector correspond to eigenvalue 1 are
1 4 4
u1 3 and u2 3 and eigenvector correspond to the eigenvalue 2 is u3 4 .
0 4 2
1 4 4 1 0 0
Take the matrix P 3 3 4 and D 0 1 0 our claim is that A = PDP-1 so
0 4 2 0 0 2
we will not calculate the inverse of the matrix P but equivalently we will show that
AP = PD.
Question # 7
Determine whether the signals 2k , 4k , ( 5) k are solution of the difference
equation yk 3 yk 2 22 yk 1 40 yk 0 . Also determine whether these signals
forma basis for the solution space of the same equation.
Solution:
Take yk 2k then yk 3 2k 3 and so on. the difference equation becomes,
2k 3 2k 2 222k 1 402 k 0
2k 23 22 22(2) 40 0 Hence 2 k is a solution of the given difference equation.
00
Take yk 4k then yk 3 4k 3 and so on. the difference equation becomes,
4k 3 4k 2 224k 1 404 k 0
4k 43 42 22(4) 40 0 Hence 4 k is a solution of the given difference equation.
00
Take yk 5 then yk 3 5 and so on. the difference equation becomes,
k k 3
00
difference equation.
Now take the Casorati matrix of the given signals, and if the signals are linearly
independent then these signals will form the bases for the solution space.
2k (4) k ( 5) k
k+1 k+1
2 (4) k+1 5 Take k 0
k+ 2 k+ 2
2 (4) k+ 2 5
1 1 1 1 1 1 1 1 1
2 4 -5 0 2 7 0 2 7
4 8 25 0 4 21 0 0 35
Since the echelon form of the matrix has pivot element thus the signals are linearly
independent and form bases for the solution space of given difference equation.
Solution of Assignment # 6 of MTH501
(Fall2004)
p(3)
p(1)
Q1. Define T : P3 4 by T ( p) then,
p(1)
p(3)
c. Show that T is a linear transformation.
d. Find the matrix for T relative to the basis {1, t, t2, t3}
for P3 and the standard basis for 4 .
Solution:
First of all we will show that the given transformation is linear
for this we will show that
(i) T( p + q) = T(p) + T(q) (ii) T(cp) = cT(p)
Where p and q are arbitrary elements of polynomial space P 3 and c is scalar.
p a0 a1 x a2 x 2 a3 x3 and q b0 b1 x b2 x 2 b3 x 3
(i) Let then we have,
p q a0 b0 a1 b1 x a2 b2 x 2 a3 b3 x 3
a0 b0 a1 b1 3 9 a2 b2 27 a3 b3
a0 b0 a1 b1 3 a2 b2 a3 b3
T ( p q)
a0 b0 a1 b1 a2 b2 a3 b3
a b a b 3 9 a b 27 a b
0 0 1 1 2 2 3 3
a0 a1 a2 a3 b0 b1 b2 b3
a0 3a1 9a2 27a3 b0 3b1 9b2 27b3
T ( p) T (q)
Similarly you can show that the second condition satisfied by T.
(ii) First of all we will find out the image of bases of P3 and then we
will find out the coordinate of these images in terms of standard
basis of R4.
1 1
1 1
T (1) Coordinate of T (1) in R 4 with s tan dard basis
1 1
1 1
3 3
1 1
T (t ) Coordinate of T (1) in R with s tan dard basis
4
1 1
3 3
9 9
1 1
T (t ) Coordinate of T (1) in R 4 with s tan dard basis
1 1
9 9
27 27
1 1
T (t ) Coordinate of T (1) in R with s tan dard basis
4
1 1
27 27
1 3 9 27
1 1 1 1
So the required matrix is .
1 1 1 1
1 3 9 27
8 0 0 0 5 0 0 0
0 3 0
0 0 3 0 0
Now taking P and D .
1 2 1 0 0 0 3 0
1 1 0 1 0 0 0 3
Now using the Diagonal Matrix Representation Theorem on page # 325 the
5 0 0 0
0 3 0 0
required B-matrix of the transformation is D .
0 0 3 0
0 0 0 3
Q4.
1 2
For the matrix , find an invertible matrix P and a matrix C
1 3
such that
A = PCP -1.
Solution:
First of all we will find out the eigenvalues of the given
1 2
0 2 4 3 2 0
1 3
4 5 0
2
matrix.
Here we have a 1, b 4 and c 5 then u sin g quadratic formula.
4 16 20
2i
2
Now we will find out the eigenvector correspond to the eigenvalue 2 - i, for
1 i 2 x1 0
1
1 i x2 0
which we will solve 1 i x1 2 x2 0......(1)
x1 1 i x2 0...........(2)
In order to get the nontrivial solution we should know that both equation 1
and 2 must determine the same relationship between x1 and x2.And we can
use either equation to get the relationship between these two variables.
Take equation 2 we get x1 1 i by taking x2 = 1 then the eigenvector will
1 i
be v .
1
a b
Now taking P Re v Im v and C where a 2, b 1 .So we have
b a
1 1 2 1
P ,C And you can check now that A = PCP -1.
1 0 1 2
Q5.
Solve the initial value problem
3 1 1 7
x Ax, x(0) x0 where A 12 0 5 and x0 3
4 2 1 16
Solution:
First of all we will find out the eigenvalues of the matrix A now
the eigenvalues of the matrix A are -1, 1, 2 and corresponding eigenvectors
1 3 1
u1 2 , u2 1 , u3 1
are .Apply the initial
2 7 2
and thus general solution is x(t ) a1e t u1 a2et u2 a3e 2tu3
7 1 3 1
3 a 2 a 1 a 1
condition we get the system 1 2 3 by solving that
16 2 7 2
system you will get the values of constants.
Q6.
7 1
Consider the vectors w 6 , x 5
13 3
e. Find distance between w and x.
f. Compute a vector in the direction of w having unit length.
g. Compute w.x x and w.w w .
x x
Let w spanv1, v2 ,..., vn . Show that if x is orthogonal to each vj,
for 1 j n then x is orthogonal to every vector in w.
Solution:
Since we know that distance between w and x
w x 7 1 6 5 13
3 64 1 100
2 2 2
is
w x 165
7
w 1
We will find out the unit vector in the direction of w which is 6 .
w 254
13
w.x 1
x w.x 62
x So we have x 5 .
x 35
w.x 7 30 39 62, x 1 25 9 35 3
3
w.w 254 254 2 .
Similarly we have w 254
x 35 35
Q8.
3 8
(i) Let y and u . Compute the distance from y to the line
1 6
through u and the origin.
(ii) Find the closest point to y in the subspace W spanned by v 1 and
3 3 1
1 1 1
v2 where y , v1 ,v
5 1 2 1
1 1 1
Solution:
(i) Since we know that the distance from a vector y to a line
through the line from u and origin is y projection of y on u also we know
y.u
projection of y on u u
u.u
that
3 8
y.u 30, u.u 100 projection of y on u
10 6
3 3 8 5.4
y projection of y on u
1 10 6 2.8
y projection of y on u 29.16 7.84 37
(ii) Since we know the closest point to y in the subspace W spanned by v1
y y.v1 v y.v2 v
1 2
v1.v1 v2 .v2
y.v1 9 1 5 1 6, v1.v1 9 1 1 1 12
3
y.v1 1 1
v1
v1.v1 2 1
1
y.v2 3 1 5 1 6, v2 .v2 4
1
y.v1 3 1
v1
v1.v1 2 1
1
3 1 6 3
1 1
y 1 3 1 2 1
2 1 2 1 2 2 1
and v2 is
1 1 2 1