Tema 1-2

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 6

Homework 3 for Mathematics II

Semester 2012-2013/2
Professor: Fayçal Ikhouane
1. [4 points] We consider the vector space R3 along with its standard
 basis.
 Define the linear
a 0 0
mapping f : R3 → R3 by f (x) = Ax, ∀x ∈ R3 , where A =  1 1 −1 ; a ∈ R being a
a 0 0
parameter.
Is f diagonalizable? if the answer is positive, find the basis in which f is diagonal, and determine
the matrix that represents f in that basis.

2. [3 points] In genetics, the study of inheritance is based on the concepts of dominant,


recessive, andhybrid genes. The probabilities of producing such genes are determined by a
0.5 0.25 0
matrix S =  0.5 0.5 0.5 . Geneticists are interested in computing limn→∞ S n as this
0 0.25 0.5
quantity gives an information on how genes are distributed among a population after a long
time (n is related to time). The objective of this exercise is to apply the concepts we have seen
to solve this problem.

(a) [0.5 point] Let Q and A be p × p matrices for some positive integer p, and let B =
QAQ−1 . Show that ∀0 6= m ∈ N we have B m = QAm Q−1 (use an argument by induction).

(b) [0.5
 point] Let Kbe p × p diagonal matrix. That is ∃λ1 , . . . , λ
p ∈ R such that K 
=
m
λ1 0 . . . 0 λ1 0 . . . 0
 .. ..
. Show that ∀0 6= m ∈ N we have K m = 
  
 . . 
m
0 . . . 0 λp 0 . . . 0 λp
(use an argument by induction).

(c) [1 point] Find the matrices P and A, with A diagonal, such that S = P AP −1 .

(d) [1 point] ComputeS n and


 find S n (hint: use (a). Also, since A is diagonal,
limn→∞
 n n
λ1 0 0 λ1 0 0
n
A =  0 λ2 0  =  0 λn2 0 ).
0 0 λ3 0 0 λn3

3. [3 points] Consider the vector spaces V = R2 and W = R3 , with standard bases BV


and BW respectively. Define the vectors u1 = (−1, 1)|BV , u2 = (1, 2)|BV , v1 = (0, 1, 2)|BW ,
v2 = (1, 0, 2)|BW , v3 = (1, 2, 0)|BW .

(a) [0.5 point] Prove that (u1 , u2 ) is a basis of V (denoted B 0 V ) and that (v1 , v2 , v3 ) is a
basis of W (denoted B 0 W ).

(b) [1 point] Determine the BV0 - BV change-of-basis matrix (denoted Q), and the B 0 W -
BW change-of-basis matrix (denoted P ).

Let f : V → W be the mapping defined by the relation f ((x, y)|BV ) = (x, x + y, x − y)|BW .
(a) [0.5 point] Prove that the mapping f is linear. Determine the matrix that represents f
with respect to the bases BV and BW (that is the matrix A such that ∀α ∈ V, f (α|BV ) =
(Aα) |BW ).

(b) [1 point] Find the matrix that represents f with respect to the bases B 0 V and B 0 W (that
is the matrix A0 such that ∀α ∈ V, f (α|B0 V ) = (A0 α)|B0 W ).

Answer

a−λ 0 0

1. [1 point] The characteristic polynomial is given by det(A−λId ) = 1 1 − λ −1 =

a 0 −λ
1 − λ −1
(a − λ) = (a − λ)(1 − λ)(−λ) = −λ(λ − 1)(λ − a).
0 −λ
We have to determine the eigenvalues of f . The characteristic equation is det(A − λId ) = 0
that is −λ(λ − 1)(λ − a) = 0 which implies that λ = 1 or λ = 0 or λ = a.

We have to discuss different cases depending on whether the eigenvalues are simple or not.

Case 1: a = 1. [1 point] In this case, there is an eigenvalue λ = 0 which is simple, and


an eigenvalue λ = 1 which is double. The first condition for f to be diagonalizable is that the
characteristic polynomial should have the form (−1)dim(R )=3 (λ − 1)d1 =2 (λ − 0)d2 =1 which is
3

our case. The second condition to be satisfied is d1 + d2 = dim(R3 ) which is also our case.
Remains to compute the dimension of Ker(f  − 1 · Id ) and that  − 0 · Id ).
 of Ker(f
1−1 0 0 0 0 0
Start with the former. A − 1 · Id =  1 1 − 1 −1  =  1 0 −1 . We have
     1 0 −1 1 0 −1
0 0 0 x 0
 1 0 −1   y  =  0  ⇔ x − z = 0 ⇔ x = z. So that Ker(f − 1 · Id ) = {(x, y, z) ∈
1 0 −1 z 0
3
R /x = z} = {(x, y, x), x ∈ R, y ∈ R} = {x(1, 0, 1) + y(0, 1, 0), x ∈ R, y ∈ R}. Thus, the
vectors v1 = (1, 0, 1) and v2 = (0, 1, 0) generate Ker(f − 1 · Id ). It is clear that these vectors are
not proportional, which implies that they are linearly independent. Thus, they form a basis of
Ker(f − 1 · Id ). We conclude that dim (Ker(f − 1 · Id )) = 2 = d1 .
    
1 0 0 x 0 
x=0
Now we look at Ker(f −0·Id ). We have  1 1 −1   y  =  0  ⇔ ⇔
x+y−z =0
 1 0 0 z 0
x=0
Thus Ker(f ) = {(x, y, z) ∈ R3 /x = 0, y = z} = {(0, y, y), y ∈ R} = {y(0, 1, 1), y ∈
y=z
R}. It follows then that the vector space Ker(f ) is generated by the vector v3 = (0, 1, 1) which
is a basis of Ker(f ) since it is nonzero. Thus, dim (Ker(f )) = 1 = d2 . The last condition holds
so that f is diagonalizable.

The
 vectors(v1 , v2 , v3 ) form a basis of R3 in which the matrix that represents f is given by
1 0 0
 0 1 0 
0 0 0
Case 2: a = 0. [1 point] In this case, the eigenvalue λ = 1 is simple, and the eigenval-
ue λ = 0 is double. The first condition for f to be diagonalizable is that the characteristic
polynomial should have the form (−1)dim(R )=3 (λ − 1)d1 =1 (λ − 0)d2 =2 which is the case. The
3

second condition to be satisfied is d1 + d2 = dim(R3 ) which is the case. Remains to compute


the dimension of Ker(f − 1 · Id ) and that  of Ker(f − 0 · Id ).   
0−1 0 0 −1 0 0
Start with the former. A − 1 · Id =  1 1 − 1 −1  =  1 0 −1 . We have
     0 0 −1 0 0 −1
−1 0 0 x 0  x=0
 1 0 −1   y  =  0  ⇔ x − z = 0 ⇔ x = z = 0. Thus Ker(f − 1 · Id ) =
0 0 −1 z 0 z=0

3
{(x, y, z) ∈ R /x = z = 0} = {(0, y, 0), y ∈ R} = {y(0, 1, 0), y ∈ R}. It follows that the vector
u1 = (0, 1, 0) generates Ker(f − 1 · Id ), which means that it is a basis of Ker(f − 1 · Id ) as it is
nonzero. Thus dim (Ker(f − 1 · Id )) = 1 = d1 .
    
0 0 0 x 0
Now look at Ker(f − 0 · Id ). We have  1 1 −1   y  =  0  ⇔ x + y − z =
0 0 0 z 0
3
0 ⇔ z = x + y Thus Ker(f ) = {(x, y, z) ∈ R /z = x + y} = {(x, y, x + y), x, y ∈ R} =
{x(1, 0, 1) + y(0, 1, 1), x, y ∈ R}. It follows that the vector space Ker(f ) is generated by the
vectors u2 = (1, 0, 1) and u3 = (0, 1, 1). These vectors are not proportional, thus they are
linearly independent so that they form a basis of Ker(f ). Thus dim (Ker(f )) = 2 = d2 . The
last condition is thus satisfied which means that f is diagonalizable.

3
The
 vectors(u1 , u2 , u3 ) form a basis of R in which the matrix that represents f is given by
1 0 0
 0 0 0 
0 0 0
Case 3: a 6= 0 and a 6= 1. [1 point] In this case, the eigenvalue λ = 1 is simple,
the eigenvalue λ = 0 is simple, and the eigenvalue λ = a is also simple. The first condi-
tion for f to be diagonalizable is that the characteristic polynomial should have the form
(−1)dim(R )=3 (λ − 1)d1 =1 (λ − 0)d2 =1 (λ − a)d3 =1 which is the case. The second condition to be
3

satisfied is d1 + d2 + d3 = dim(R3 ) which is also the case. Remains to determine the dimension
of Ker(f − 1 · Id ), that of Ker(f − 0 · Id ), and that of Ker(f− a 
· Id ). 
a−1 0 0 a−1 0 0
Start with the former. A − 1 · Id =  1 1 − 1 −1  =  1 0 −1 . We have
      a 0 −1 a 0 −1
a−1 0 0 x 0  (a − 1)x = 0
 1 0 −1   y  =  0  ⇔ x−z =0 Observe that (a − 1)x = 0 ⇔ x = 0
a 0 −1 z 0 ax − z = 0

since a 6= 1. Thus z = 0 so that Ker(f − 1 · Id ) = {(x, y, z) ∈ R3 /x = z = 0} = {(0, y, 0), y ∈
R} = {y(0, 1, 0), y ∈ R}. Thus, the vector w1 = (0, 1, 0) generates Ker(f − 1 · Id ), which means
that it is a basis of Ker(f − 1 · Id ) since it is nonzero. As a conclusion, dim (Ker(f − 1 · Id )) =
1 = d1 .
    
a 0 0 x 0 
ax = 0
Now look at Ker(f − 0 · Id ). We have  1 1 −1   y  =  0  ⇔
x+y−z =0
a 0 0 z 0
Observe that ax = 0 ⇔ x = 0 given that a 6= 0, so that y = z. Thus Ker(f ) = {(x, y, z) ∈
R3 /x = 0, z = y} = {(0, y, y), y ∈ R} = {y(0, 1, 1), y ∈ R}. It follows that Ker(f ) is generated
by the vector u2 = (0, 1, 1) which is a basis of Ker(f ). Thus dim (Ker(f )) = 1 = d2 .

Now lookat Ker(f − a · Id ).    


a−a 0 0 x 0 
x + (1 − a)y − z = 0
We have  1 1−a −1   y  =  0  ⇔ Observe that
ax − az = 0
a 0 0−a z 0
a(x − z) = 0 ⇔ x = z since a 6= 0, which implies that (1 − a)y = 0. In this equation
1 − a 6= 0 which implies that y = 0. It follows that Ker(f ) = {(x, y, z) ∈ R3 /x = z, y =
0} = {(x, 0, x), x ∈ R} = {x(1, 0, 1), x ∈ R}. Thus the vector space Ker(f ) is generated by the
vector w3 = (1, 0, 1) which is a basis of Ker(f ). Thus dim (Ker(f − a · Id )) = 1 = d3 . The last
condition is thus satisfied which implies that f is diagonalizable.

The
 vectors(w1 , w2 , w3 ) form a basis of R3 in which the matrix that represents f is given
1 0 0
by  0 0 0 
0 0 a
2.a. [0.5 point] For m = 1, the relation B m = QAm Q−1 holds by definition of matrix B.
Now, if B m = QAm Q−1 holds for some 0 6= m ∈ N, then B m+1 = B m · B = QAm −1
Q· QAQ−1 =

QAm+1 Q−1 . QED.
 
λm 1 0 ... 0
2.b. [0.5 point] For m = 1, the relation K m =  ...  holds by definition
 
m
0 . . . 0 λp
 
m
λ1 0 . . . 0
of matrix K. Now, if K m =  .. .
 holds for some 0 6= m ∈ N, then
 
m
0 . . . 0 λp
    m+1 
λm1 0 . . . 0 λ 1 0 . . . 0 λ 1 0 . . . 0
K m+1 = K m ·K =  ...
  ..   ..
· . = .
 

0 ... 0 λm
p 0 ... 0 λp 0 ... 0 λm+1
p

QED.

0.5 − λ 0.25 0

2.c. [1 point] The characteristic polynomial is given by det(S−λId ) = 0.5 0.5 − λ 0.5 =

0 0.25 0.5 − λ
−λ(λ − 1)(λ − 0.5).
We have to determine the eigenvalues of f . The characteristic equation is det(A − λId ) = 0
that is −λ(λ − 1)(λ − 0.5) = 0 which implies that λ = 1 or λ = 0 or λ = 0.5. The first
condition for f to be diagonalizable is that the characteristic polynomial should have the form
(−1)dim(R )=3 (λ − 1)d1 =1 (λ − 0)d2 =1 (λ − 0.5)d3 =1 which is the case. The second condition to be
3

satisfied is d1 + d2 + d3 = dim(R3 ) which is also the case. Remains to determine the dimension
of Ker(S − 1 · Id ), that of Ker(S − 0· Id ), and that of Ker(S − 0.5  · Id
). 
0.5 − 1 0.25 0 −0.5 0.25 0
Start with the former. S − 1 · Id =  0.5 0.5 − 1 0.5  =  0.5 −0.5 0.5 .
0 0.25 0.5 − 1 0 0.25 −0.5
     
−0.5 0.25 0 x 0  −0.5x + 0.25y = 0
We have  0.5 −0.5 0.5   y  =  0  ⇔ 0.5x − 0.5y + 0.5z = 0 This is a
0 0.25 −0.5 z 0 0.25y − 0.5z = 0

linear system of 3 equations and 3 unknowns from which we get x = 0.5y and z = 0.5y.
Thus Ker(S − Id ) = {(x, y, z) ∈ R3 /x = 0.5y, z = 0.5y} = {(0.5y, y, 0.5y), y ∈ R} =
{y(0.5, 1, 0.5), y ∈ R}. Thus the vector space Ker(S − Id ) is generated by the vector v1 =
(0.5, 1, 0.5) which is a basis of Ker(S − Id ). Thus dim (Ker(S − Id )) = 1 = d1 .
 
0.5 0.25 0
S − 0 · Id =  0.5 0.5 0.5 
 0 0.25 0.5
    
0.5 0.25 0 x 0  0.5x + 0.25y = 0
We have  0.5 0.5 0.5   y  =  0  ⇔ 0.5x + 0.5y + 0.5z = 0 This is a lin-
0 0.25 0.5 z 0 0.25y + 0.5z = 0

ear system of 3 equations and 3 unknowns from which we get x = −0.5y and z = −0.5y.
Thus Ker(S) = {(x, y, z) ∈ R3 /x = −0.5y, z = −0.5y} = {(−0.5y, y, −0.5y), y ∈ R} =
{y(−0.5, 1, −0.5), y ∈ R}. Thus the vector space Ker(S) is generated by the vector v2 =
(−0.5, 1, −0.5) which is a basis of Ker(S). Thus dim (Ker(S)) = 1 = d2 .
   
0.5 − 0.5 0.25 0 0 0.25 0
S − 0.5 · Id =  0.5 0.5 − 0.5 0.5  =  0.5 0 0.5 .
 0 0.25  0.5− 0.5   0 0.25 0
0 0.25 0 x 0  0.25y = 0
We have  0.5 0 0.5   y  =  0  ⇔ 0.5x + 0.5z = 0 This is a linear system
0 0.25 0 z 0 0.25y = 0

of 3 equations and 3 unknowns from which we get y = 0 and z = −x. Thus Ker(S − 0.5 · Id ) =
{(x, y, z) ∈ R3 /y = 0, z = −x} = {(x, 0, −x), x ∈ R} = {x(1, 0, −1), x ∈ R}. Thus the
vector space Ker(S − 0.5 · Id ) is generated by the vector v3 = (1, 0, −1) which is a basis of
Ker(S − 0.5 · Id ). Thus dim (Ker(S − 0.5 · Id )) = 1 = d3 .

The last condition is thus satisfied which implies that S is diagonalizable. The vectors

1 0 0
(v1 , v2 , v3 ) form a basis of R3 in which the matrix S is represented by A =  0 0 0 
 0 0 0.5
0.5 −0.5 1
−1
That is we have S = P AP where P = (v1 , v2 , v3 ) =  1 1 0  so that P −1 =
  0.5 −0.5 −1
0.5 0.5 0.5
 −0.5 0.5 −0.5 
0.5 0 −0.5
 n   
1 0 0 1 0 0
2.d. [1 point] ∀0 6= n ∈ N, S n = P An P −1 where An =  0 0n 0 = 0 0 0 
n
0 0 0.5 0 0 0.5n
Thus
     
0.5 −0.5 1 1 0 0 0.5 0.5 0.5
Sn =  1 1 0 · 0 0 0  ·  −0.5 0.5 −0.5 
0.5 −0.5 −1 0 0 0.5n 0.5 0 −0.5
 n+1 n+1

0.25 + 0.5 0.25 0.25 − 0.5
=  0.5 0.5 0.5 
n+1 n+1
0.25 − 0.5 0.25 0.25 + 0.5
 
0.25 0.25 0.25
Given that limn→∞ 0.5n+1 = 0 it follows that limn→∞ S n =  0.5 0.5 0.5 .
0.25 0.25 0.25
−1 1
2.a. [0.5 point] We have 6= 0 thus (u1 , u2 ) = B 0 V is a basis of V . We have
1 2
0 1 1

1 0 2 6= 0 so that (v1 , v2 , v3 ) = B 0 W is a basis of W .

2 2 0
2.b. [1 point] Q is the matrix that satisfies ∀α ∈ V, α|BV = Q · α|BV0 , its columns are
 
0 −1 1
the vectors of the basis BV . Thus Q = . Similarly, P is the matrix that satisfies
1 2  
0 1 1
0
∀α ∈ W, α|BW = P · α|BW0 , its columns are the vectors of the basis B
W . Thus P =
 1 0 2 .
2 2 0
2.c. [0.5 
point] We have ∀(x, y) ∈ V, f ((x, y)|BV ) = (A · (x, y))|BW = (x, x + y, x − y)|BW
1 0
where A =  1 1 , thus the function f is linear since f (x) = Ax, ∀x = (x, y) ∈ R2 .
1 −1
2.d. [1 point]
 We2 have A0 = 
P −1 AQ. A and Q are known, and  we have to compute P −1 .
− 3 13 1

3
0 0
−1 2 1 1  −1 0  −1 − 1 .
We get P =  3 −3 6
. The product P AQ gives A = 2
1 1 1 3
3 3
− 6
0 2

You might also like