2018 Exam Papers With Solutions

You might also like

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

MAT3701/000/1/2018

Tutorial letter 000/1/2018

LINEAR ALGEBRA
MAT3701

Semester 1

Department of Mathematical Sciences

Exam Paper and Memo


MAT3701 May/June 2018

BARCODE

Define tomorrow.
Question 1: 17 Marks

Let T : C 3 → C 3 be a non-zero linear operator such that T 2 = 0. Show that

(1.1) R(T ) ⊆ N (T ), (3)

(1.2) dim(N (T )) = 2, (4)


 
0 0 a
(1.3) there exists a basis β for C 3 such that [T ]β = 0 0 b  where a, b ∈ C. (10)
0 0 0

Solution
(1.1)
T 2 = 0 ⇒ T 2 (v) = 0 for all v ∈ C 3
⇒ T (T (v)) = 0 for all v ∈ C 3
⇒ T (v) ∈ N (T ) for all v ∈ C 3
⇒ R(T ) ⊆ N (T )
(3)
(1.2) From (1.1)
R(T ) ⊆ N (T ) ⊂ C 3 (since T 6= 0) ⇒ dim(R(T )) ≤ dim(N (T )) < 3
Therefore
3 = dim(C 3 ) = dim(R(T )) + dim(N (T )) ≤ 2 · dim(N (T )) ⇒ dim(N (T )) = 2
(4)
(1.3) Since dim(N (T )) = 2 there exists a basis {v1 , v2 } for N (T ) consisting of two vectors. Extend it
to a basis β = {v1 , v2 , v3 } for C 3 . Then
 
0 0 a
[T ]β = 0
 0 b
0 0 c
for some a, b, c ∈ C. Note that [T 2 ]β = [T ]2β = 0 since it is given that T 2 = 0. In particular,
the (3, 3)-entry of [T ]2β , namely c2 , is zero. Thus c = 0, and hence [T ]β is of the required
form. (10)[17]

Question 2: 23 Marks

Let T : M3×3 (C) → M3×3 (C) be the linear operator over C defined by T (X) = AX, where
 
0 0 0
A = 1 0 1
0 1 0

2
MAT3701/000/1/2018

 
0 1 0
and let W be the T –cyclic subspace of M3×3 (C) generated by J = 0 1 0.
0 0 1

(2.1) Find the T –cyclic basis for W. (9)

(2.2) Find the characteristic polynomial of TW. (3)

(2.3) Explain whether TW is one-to-one. (1)

(2.4) Explain whether TW is onto. (1)

(2.5) For each eigenvalue of TW , find a corresponding eigenvector expressed as a linear com- (9)
bination of the T -cyclic basis for W.

Solution

(2.1)        
0 1 0 0 0 0 0 0 0 0 0 0
J = 0 1 0, T (J) = 0 1 1, T 2 (J) = 0 1 0 , T 3 (J) = 0 1 1
0 0 1 0 1 0 0 1 1 0 1 0

The T –cyclic basis for W is {J, T (J) , T 2 (J)} since it is linearly independent and T 3 (J) =
T (J). (9)

(2.2) Since T 3 (J) = T (J) from (2.1), the characteristic polynomial of TW is

cTW (t) = (−1)3 (t3 − t) = −t(t2 − 1).

(3)

(2.3) No, since 0 is a root of cTW . (1)

(2.4) No, since from (2.3), TW is not one-to-one. (1)

(2.5) From (2.1)

T (T 2 − I3 )(J) = 0, so T 2 (J) − J is an eigenvector of TW associated with 0.

Similarly

T (T 2 −I3 )(J) = (T −I3 )(T (T +I3 )(J)) = 0, so T 2 (J)+T (J) is an eigenvector associated with 1

and

T (T 2 −I3 )(J) = (T +I3 )(T (T −I3 )(J)) = 0, so T 2 (J)−T (J) is an eigenvector associated with −1.

(9)[23]

3
Question 3: 17 Marks
Let
1 1
 
2 2
0
 
 1 1

A=
 2
0 2
.

 
1 1
0 2 2

(3.1) Show that A is a regular transition matrix. (5)


(3.2) Find lim Am . (9)
m→∞

(3.3) Describe the Gerschgorin discs in which the eigenvalues of A lie. (3)

Solution
(3.1) A is a transition matrix since its entries are nonnegative and the column sums are all equal to
1. It is also regular since the entries of
1 1  1 1  1 1 1
2 2
0 2 2
0 2 4 4
2
A =  2 0 2   2 0 21  =  14 21 14 
1 1 1   
0 12 12 0 12 21 1
4
1
4
1
2

are all positive. (5)


(3.2) Since A is a regular transition matrix, λ = 1 is always an eigenvalue. Now

 1 1    
− 0
   
x1 x1 2 2 x1 0
A x2  = x2  ⇔  12 −1 12  x2  = 0
 
x3 x3 0 1
− 12 x3 0
2
   1

x1 3
⇔ x2  = t  13 
 
x3 1
3
Thus  
1 1 1
3 3 3
lim Am =  1 1 1
 
m→∞ 3 3 3 
1 1 1
3 3 3
(9)
(3.3)
D1 = {z ∈ C : |z − 21 | ≤ 12 }, D2 = {z ∈ C : |z| ≤ 1}, D3 = {z ∈ C : |z − 21 | ≤ 21 }
(3)[17]

Question 4: 11 Marks
Let T : V → V be a linear operator on a finite-dimensional inner product space V over C.
(4.1) Define what is meant by the adjoint linear operator T ∗ of T . (2)

4
MAT3701/000/1/2018

(4.2) Show that (cT )∗ = c̄T ∗ where c ∈ C. (4)

(4.3) Define what is meant by a normal linear operator T . (1)

(4.4) If T is normal, show that hT (v), T (w)i = hT ∗ (v), T ∗ (w)i for all v, w ∈ V . (4)

Solution

(4.1) The adjoint linear operator of T is the linear operator T ∗ : V → V such that

hT (v), wi = hv, T ∗ (w)i for all v, w ∈ V

(2)
(4.2) For all v, w ∈ V

h(cT )(v), wi = hcT (v), wi


= chT (v), wi
= chv, T ∗ (w)i
= hv, c̄T ∗ (w)i

Thus (cT )∗ = c̄T ∗ . (4)


(4.3) T is a normal linear operator if T T ∗ = T ∗ T . (1)
(4.4) For all v, w ∈ V

hT (v), T (w)i = hv, T ∗ (T (w))i


= hv, (T ∗ T )(w)i
= hv, (T T ∗ )(w)i since T is normal
= hv, T (T ∗ (w))i
= hT ∗ (v), T ∗ (w)i

(4)[11]

Question 5: 19 Marks

Let V = P2 (R) denote the inner product space of polynomials of degree at most two over R with
inner product defined by

hg, hi = g (−1) h (−1) + g(0)h (0) + g (1) h (1).

Let T : V → V be the orthogonal projection on


 
1 1 2
W = span (S) where S = √ x, √ x .
2 2

(5.1) Show that S is orthonormal. (6)

5
(5.2) Find the formula for T (ax2 + bx + c) expressed as a single polynomial in terms of a, b, c. (9)

(5.3) Use T to express 1 as 1 = f + g where f ∈ W and g ∈ W ⊥ . (3)

(5.4) Find the polynomial in W closest to 1. (1)

Solution

(5.1)
 
1 1 1 1
√ x, √ x = ((−1) · (−1) + 0 · 0 + 1 · 1) = (1 + 0 + 1) = 1
2 2 2 2
 
1 2 1 2 1 1
√ x ,√ x = ((−1)2 · (−1)2 + 02 · 02 + 12 · 12 ) = (1 + 0 + 1) = 1
2 2 2 2
 
1 1 2 1 1
√ x, √ x = (−1 · (−1)2 + 0 · 02 + 1 · 12 ) = (−1 + 0 + 1) = 0
2 2 2 2

Thus S is an orthonormal subset of V . (6)


(5.2)
T (ax2 + bx + c)
1 1 1 1
= < ax2 + bx + c, √ x > √ x + < ax2 + bx + c, √ x2 > √ x2
2 2 2 2
1
= {[a(−1)2 + b(−1) + c] · (−1) + [a(0)2 + b(0) + c] · 0 + [a(1)2 + b(1) + c] · 1} · x
2
1
+ {[a(−1)2 + b(−1) + c] · (−1)2 + [a(0)2 + b(0) + c] · 02 + [a(1)2 + b(1) + c] · 12 } · x2
2
=bx + (a + c)x2

(9)
(5.3)
1 = T (1) + (1 − T (1)) where T (1) ∈ W and (1 − T (1)) ∈ W ⊥
= x2 + (1 − x2 ) from (5.2), where x2 ∈ W and (1 − x2 ) ∈ W ⊥
(3)
(5.4) It follows from (5.3) that x2 is the polynomial in W closest to 1.

(1)[19]

Question 6: 13 Marks

It is given that A ∈ M3×3 (C) is a normal matrix with eigenvalues i and −i and corresponding
eigenspaces  
1 1
Ei = span (2, 2, 1) , (1, −2, 2)
3 3

6
MAT3701/000/1/2018

and  
1
E−i = span (−2, 1, 2) .
3

(6.1) Find the spectral decomposition of A. (12)

(6.2) Find A. (1)

Solution

(6.1) 2 1
 5 2 4

3 3 9 9 9
 2 2 1
 
  
3 3 3
−2   −2 
2   
Pi =   = 2 8
3 3 
−2
9 9 9 
  1 2  
3 3 3
1 2 4 −2 5
3 3 9 9 9

and  −2  4 −2 −4
 
3 9 9 9
   
 1
  −2 1 2
  −2 1 2

P−i =
 3

 3 3 3
=
9 9 9


   
2 −4 2 4
3 9 9 9

The spectral decomposition is

A = i · Pi − i · P−i
−2 −4
5 2 4
  4

9 9 9 9 9 9
   
−2 
2 8
  −2 1 2

=i·
9 9 9 
− i · 
9 9 9


   
4 −2 5 −4 2 4
9 9 9 9 9 9

(12)

(6.2) 1 4 8

9
i 9
i 9
i
 
−4 
4 7

9i
A= 9
i i
9 
 
8 −4 1
9
i 9
i 9
i

(1)[13]

TOTAL[100]

7
MAT3701/000/2/2018

Tutorial letter 000/2/2018

LINEAR ALGEBRA
MAT3701

Semester 2

Department of Mathematical Sciences

Exam Paper and Memo


MAT3701 October/November 2018

BARCODE

Define tomorrow.
Question 1: 21 Marks

Let T : M3×3 (C) → M3×3 (C) be the linear operator over C defined by T (X) = AX, where
 
0 0 0
A = 1 0 1
0 1 0
 
0 1 0
and let W be the T –cyclic subspace of M3×3 (C) generated by J = 0
 1 0.
0 0 1

(1.1) Find the T –cyclic basis for W. (8)

(1.2) Find the characteristic polynomial of TW. (2)

(1.3) Explain whether TW is one-to-one. (1)

(1.4) Explain whether TW is onto. (1)

(1.5) For each eigenvalue of TW , find a corresponding eigenvector expressed as a linear com- (9)
bination of the T -cyclic basis for W.

Solution

(1.1)        
0 1 0 0 0 0 0 0 0 0 0 0
J = 0 1 0, T (J) = 0 1 1, T 2 (J) = 0 1 0 , T 3 (J) = 0 1 1
0 0 1 0 1 0 0 1 1 0 1 0

The T –cyclic basis for W is {J, T (J) , T 2 (J)} since it is linearly independent and T 3 (J) =
T (J). (8)

(1.2) Since T 3 (J) = T (J) from (1.1), the characteristic polynomial of TW is

cTW (t) = (−1)3 (t3 − t) = −t(t2 − 1).

(2)

(1.3) No, since 0 is a root of cTW . (1)

(1.4) No, since from (1.3) TW is not one-to-one. (1)

2
MAT3701/000/2/2018

(1.5) From (1.1)


T (T 2 − I3 )(J) = 0, so T 2 (J) − J is an eigenvector of TW associated with 0.
Similarly
T (T 2 −I3 )(J) = (T −I3 )(T (T +I3 )(J)) = 0, so T 2 (J)+T (J) is an eigenvector associated with 1
and
T (T 2 −I3 )(J) = (T +I3 )(T (T −I3 )(J)) = 0, so T 2 (J)−T (J) is an eigenvector associated with −1.
(9)
[21]

Question 2: 18 Marks

Let T : C 3 → C 3 be a nonzero linear operator such that T 2 = 2T.

(2.1) Show that λ = 2 is an eigenvalue of T . (5)

(2.2) Show that R (T ) = E2 (T ), the eigenspace of T associated with λ = 2. (5)

(2.3) Explain whether C 3 = R(T ) ⊕ N (T ). (5)

(2.4) Explain briefly whether T is diagonalizable. (3)

Solution
(2.1) Since T 6= 0, there exists a vector v ∈ C 3 such that T (v) 6= 0. Then
T 2 (v) = 2T (v) =⇒ T (T (v)) = 2T (v)

thus T (v) is an eigevector of T corresponding to λ = 2. (5)


(2.2) For all v ∈ C 3
T 2 (v) = 2T (v) =⇒ T (T (v)) = 2T (v))

therefore
T (v) ∈ E2 (T ) and hence R(T ) ⊆ E2 (T ).

Conversely
1

v ∈ E2 (T ) =⇒ T (v) = 2v =⇒ T 2
v = v =⇒ v ∈ R(T )

thus
E2 (T ) ⊆ R(T ).

It therefore follows that


R(T ) = E2 (T ).
(5)

3
(2.3) Since R(T ) = E2 (T ) from (2.2) and N (T ) = E0 (T ), it follows that R(T ) ∩ N (T ) = {0} since
they represent eigenspaces corresponding to distinct eigenvalues. Thus dim(R(T ) ⊕ N (T )) =
rank(T ) + nullity(T ) = dim(C 3 ), so C 3 = R(T ) ⊕ N (T ). (5)
(2.4) It follows from (2.3) that T is diagonalizable since C 3 is a direct sum of eigenspaces of T , hence
C 3 has a basis consisting of eigenvectors of T . (3)
[18]

Question 3: 16 Marks

Let
1 1
 
2
0 2
 
 1 1

 0
A= .
2 2 
 
1 1
2 2
0

(3.1) Show that A is a regular transition matrix. (5)

(3.2) Find lim Am . (9)


m→∞

(3.3) Describe the Gerschgorin discs in which the eigenvalues of A lie. (2)

Solution
(3.1) A is a transition matrix since its entries are nonnegative and the column sums are all equal to
1. It is also regular since the entries of
1 1
 1 1
 1 1 1
2
0 2 2
0 2 2 4 4
    
     
A2 =  0 1 1 
0 1 1
 2 2  2 2 4 2 4 = 1 1 1
    
1 1 1 1 1 1 1
2 2
0 2 2
0 4 4 2

are all positive. (5)


(3.2) Since A is a regular transition matrix, λ = 1 is always an eigenvalue. Now

− 12 1
 
    0 2    
x1 x1 

 x1
 0
A x2 = x2 ⇔ 
   
 0 − 12 1
2
 x2  = 0

x3 x3   x3 0
1 1
2 2
−1
   1

x1 3
⇔ x2  = t  13 .
 
x3 1
3

4
MAT3701/000/2/2018

Thus  
1 1 1
3 3 3
lim Am =  1 1 1
.
 
m→∞ 3 3 3
1 1 1
3 3 3

(9)

(3.3)
D1 = D2 = {z ∈ C : |z − 21 | ≤ 12 } and D3 = {z ∈ C : |z| ≤ 1}.
(2)
[16]

Question 4: 13 Marks

Let <, > denote the standard inner product on C n over C, i.e. < x, y >= y ∗ x where x and y represent
column vectors in C n . Let A ∈ Mn×n (C) be a non-singular matrix. Show that <, >1 : C n × C n → C
defined by < x, y >1 =< Ax, Ay > is an inner product on C n over C.

Solution

Let x, y and z be column vectors in C n and let c ∈ C.


IP1

hx + z, yi1 = hA(x + z), Ayi, definition of <, >1


= hAx + Az, Ayi
= hAx, Ayi + hAz, Ayi, since <, > is an inner product
= hx, yi1 + hz, yi1 , definition of <, >1

Thus IP1 is satisfied.

IP2

hcx, yi1 = hA(cx), Ayi, definition of <, >1


= hcAx, Ayi
= chAx, Ayi, since <, > is an inner product
= chx, yi1 , definition of <, >1

Thus IP2 is satisfied.

IP3

hx, yi1 = hAx, Ayi, definition of <, >1


= hAy, Axi, since <, > is an inner product
= hy, xi1 , definition of <, >1

5
Thus IP3 is satisfied.

IP4

hx, xi1 = hAx, Axi ≥ 0, since <, > is an inner product


and
hx, xi1 = 0 ⇔ hAx, Axi = 0, definition of <, >1
⇔ Ax = 0, since <, > is an inner product
⇔ x = 0, since A is non-singular

Thus IP4 is satisfied, and therefore <, > is an inner product on C n.


[13]

Question 5: 20 Marks

Let V = W ⊕ W ⊥, where V is a finite-dimensional inner product space over a field F and W is a


subspace of V. Define T : V → V by

T (w + w⊥ ) = w − w⊥ , where w ∈ W and w⊥ ∈ W ⊥ .

(5.1) Show that T is a linear operator. (4)

(5.2) Show that T is self-adjoint. (4)

(5.3) Show that T is unitary. (4)

(5.4) Show that the eigenvalues of T are λ = 1 and λ = −1, and find the associated eigenspace (8)
of each eigenvalue.

Solution

Let w1 , w2 ∈ W, w1⊥ , w2⊥ ∈ W ⊥ , and a ∈ F.

(5.1)

T ((w1 + w1⊥ ) + (w2 + w2⊥ )) = T ((w1 + w2 ) + (w1⊥ + w2⊥ ))


= (w1 + w2 ) − (w1⊥ + w2⊥ )
= (w1 − w1⊥ ) + (w2 − w2⊥ )
= T (w1 + w1⊥ ) + T (w2 + w2⊥ ),

and

T (a(w1 + w1⊥ )) = T (aw1 + aw1⊥ )


= aw1 − aw1⊥
= a(w1 − w1⊥ )
= aT (w1 + w1⊥ ),

6
MAT3701/000/2/2018

thus T is a linear operator. (4)

(5.2)

hT (w1 + w1⊥ ), w2 + w2⊥ i = hw1 − w1⊥ , w2 + w2⊥ i


= hw1 , w2 i + hw1 , w2⊥ i − hw1⊥ , w2 i − hw1⊥ , w2⊥ i
= hw1 , w2 i − hw1⊥ , w2⊥ i

and

hw1 + w1⊥ , T (w2 + w2⊥ )i = hw1 + w1⊥ , w2 − w2⊥ i


= hw1 , w2 i − hw1 , w2⊥ i + hw1⊥ , w2 i − hw1⊥ , w2⊥ i
= hw1 , w2 i − hw1⊥ , w2⊥ i.

Thus hT (w1 + w1⊥ ), w2 + w2⊥ i = hw1 + w1⊥ , T (w2 + w2⊥ )i and therefore T is self-adjoint. (4)

(5.3)
T ∗ T (w1 + w1⊥ ) = T 2 (w1 + w1⊥ ) = T (w1 − w1⊥ ) = w1 + w1⊥ , thus T ∗ T = IV
and therefore T is unitary. (4)

(5.4) Let w + w⊥ 6= 0, then

T (w + w⊥ ) = λ(w + w⊥ ) ⇔ w − w⊥ = λ(w + w⊥ )
⇔ w − w⊥ = λw + λw⊥
⇔ w = λw and − w⊥ = λw⊥
⇔ {λ = 1 and w⊥ = 0} or {λ = −1 and w = 0}.

It follows that the eigenvalues of T are λ = 1 with associated eigenspace E1 (T ) = W and λ = −1


with associated eigenspace E−1 (T ) = W ⊥ . (8)
[20]

Question 6: 12 Marks
 
−1 2
Let A =  .
−2 1

(6.1) Find kAk , kA−1 k and cond(A) where k·k denotes the Euclidean matrix norm on M2×2 (R). (9)

(6.2) Suppose x and x e are vectors such that Ax = b, kbk = 1 and kb − Ae


xk ≤ 0.001. Use (6.1) (3)
−1 −1 −1
to determine upper bounds for ke x − A bk (the absolute error) and ke
x − A bk / kA bk (the
relative error).

7
Solution

(6.1)     
∗ −1 −2 −1 2 5 −4
A A= =
2 1 −2 1 −4 5
thus


λ − 5 4
det(λI − A A) =

4 λ − 5
= (λ − 5)2 − 42
= (λ − 9)(λ − 1)

so
√ 1
9 = 3, A−1 = √ = 1 and cond (A) = kAk · A−1 = 3

kAk =
1
(9)

(6.2)
e − A−1 b = A−1 (Ae
x − b) ≤ A−1 kAe

x x − bk ≤ 0.001
and
x − A−1 bk
ke ke
x − xk kAe
x − bk
−1
= ≤ cond (A) ≤ 3(0.001) = 0.003
kA bk kxk kbk
(3)

[12]

TOTAL[100]

You might also like