Exercise 5.C.16

Answers

Proof. (a)

We will prove by induction on n. When n = 1, the result is clearly true.

Assume it is true for n. Then

Tn+1(0,1) = TTn(0,1) = T(Fn,Fn+1) = (Fn+1,Fn + Fn+1) = (Fn+1,Fn+2)

(b)

We need to find (x,y) and λ that satisfy T(x,y) = λ(x,y). Thus need to solve the following set of equations

λx = y λy = x + y

Substituting y in the second equation and dividing both sides by λ, we get y = 1+λ λ x. Therefore, an eigenvector of T has the form (x, 1+λ λ x) and we have

T (x, 1 + λ λ x) = (1 + λ λ x, 1 + 2λ λ x)

We need then, to solve for λ in the following equations

1 + λ λ = λ, 1 + 2λ λ = 1 + λ

You can check that both are equivalent and have the solutions 1+5 2 and 15 2 , which we will denote φ and φ^.

(c)

Substituting the eigenvalues found in (b) on the eigenvector form (x, 1+λ λ x), we get

(1,φ) and (1,φ^).

Both are linearly independent since they are eigenvectors corresponding to distinct eigenvalues. Thus, they are indeed a basis of 2.

(d)

Here we use the fact that if λ is an eigenvalue of T and v a corresponding eigenvector then Tkv = λkv. Since (0,1) = 1 5(0,φ φ^), we have

Tn(0,1) = 1 5Tn(0,φ φ^) = 1 5Tn((1,φ) (1,φ^)) = 1 5 [Tn(1,φ) Tn(1,φ^)] = 1 5 [φn(1,φ) φ^n(1,φ^)] = 1 5(φn φ^n,φn+1 φ^n+1)

Therefore

Fn = 1 5(φn φ^n) = 1 5 [ (1 + 5 2 )n (1 5 2 )n]

(e)

This follows directly from the fact that 1 5 |15 2 | n < 1 2, for all positive integers n, which we will prove by induction.

When n = 1, we have

1 5 |1 5 2 | = 1 5 5 1 2 = 5 5 10 < 5 10 = 1 2

Assume the result holds true for n. Then

1 5 |1 5 2 |n+1 = |1 5 2 | 1 5 |1 5 2 |n < |1 5 2 | 1 2 = 5 1 2 1 2 < 9 1 2 1 2 = 1 2

User profile picture
2017-10-06 00:00
Comments