Proving Recurrence Relation by Induction

In summary, the conversation discusses a proof by induction for the equation x_{xn-1}= 5_{xn-1} - 6_{xn-2};for \ n≥2 \\ x_{1}=1 \\ x_{0}=0, where the base step for n=1 is shown and the inductive step is discussed. It is suggested to pre-multiply a 5,-6,1,0 matrix on both sides of the k equation to complete the proof.
  • #1
dragonkiller1
3
0
[itex]x_{xn-1}= 5_{xn-1} - 6_{xn-2};for \ n≥2 \\ x_{1}=1 \\ x_{0}=0[/itex]

prove by induction that:
[itex]\begin{bmatrix}
x_{n}\\ x_{n-1}
\end{bmatrix} = \begin{bmatrix}
5 &-6 \\
1 & 0
\end{bmatrix}^{n-1}\begin{bmatrix}
1\\0
\end{bmatrix}[/itex]
 
Physics news on Phys.org
  • #2
welcome to pf!

hi dragonkiller1! welcome to pf! :wink:

show us what you've tried, and where you're stuck, and then we'll know how to help! :smile:
 
  • #3
I've showed the base step for n=1
For the inductive step:
Suppose P(k) is true for some k
[itex]\begin{bmatrix}
x_{k}\\ x_{k-1}
\end{bmatrix} = \begin{bmatrix}
5 &-6 \\
1 & 0
\end{bmatrix}^{k-1}\begin{bmatrix}
1\\0
\end{bmatrix}[/itex]
Then for n=k+1
[itex]\begin{bmatrix}
x_{k+1}\\ x_{k}
\end{bmatrix} = \begin{bmatrix}
5 &-6 \\
1 & 0
\end{bmatrix}^{k}\begin{bmatrix}
1\\0
\end{bmatrix}[/itex]
?
I'm stuck on the inductive step. >.<
 
  • #4
hi dragonkiller1! :smile:

you obviously need to prove

[itex]\begin{bmatrix}
x_{n+1}\\ x_{n}
\end{bmatrix} = \begin{bmatrix}
5 &-6 \\
1 & 0
\end{bmatrix}\begin{bmatrix}
x_{n}\\ x_{n-1}
\end{bmatrix} [/itex]

which is easier …

the top line or the bottom line? :wink:
 
  • #5
pre multiply 5,-6,1,0 matrix on both the sides(to the k equation) and you will have your proof
 
  • #6
Oh got it. Thanks :)
 

1. What is a recurrence relation?

A recurrence relation is a mathematical expression that defines a sequence, where each term in the sequence is defined in terms of one or more previous terms. It is a way to represent a relationship between the values in a sequence.

2. Why is it important to prove a recurrence relation by induction?

Proving a recurrence relation by induction is important because it provides a way to verify that the relation is true for all values in the sequence, not just for a few specific values. This allows us to make conclusions about the behavior of the sequence and use it in further calculations or applications.

3. How do you prove a recurrence relation by induction?

The steps to prove a recurrence relation by induction are as follows:

  • Base case: Show that the relation is true for the first few values in the sequence.
  • Inductive hypothesis: Assume that the relation is true for some arbitrary value n.
  • Inductive step: Use the inductive hypothesis to prove that the relation is also true for the next value n+1.
  • Conclusion: By the principle of mathematical induction, the relation is true for all values in the sequence.

4. Are there any tips for proving a recurrence relation by induction?

Yes, here are a few tips:

  • Work backwards: Start with the n+1 term and try to simplify it in terms of the n term using the recurrence relation. This can help you see patterns and make the proof easier.
  • Use algebraic manipulation: Don't be afraid to use algebraic properties and manipulations to simplify expressions and make them easier to work with.
  • Check your work: After you have completed the proof, go back and substitute in a few values to make sure the relation holds for each one.

5. Can a recurrence relation be proven using other methods besides induction?

Yes, there are other mathematical techniques that can be used to prove a recurrence relation, such as direct proof or strong induction. However, induction is often the most straightforward and commonly used method for proving recurrence relations.

Similar threads

  • Calculus and Beyond Homework Help
Replies
6
Views
933
  • Calculus and Beyond Homework Help
Replies
4
Views
954
  • Calculus and Beyond Homework Help
Replies
3
Views
947
  • Calculus and Beyond Homework Help
Replies
2
Views
972
  • Calculus and Beyond Homework Help
Replies
3
Views
559
  • Calculus and Beyond Homework Help
Replies
4
Views
2K
  • Calculus and Beyond Homework Help
Replies
12
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
5
Views
967
  • Calculus and Beyond Homework Help
Replies
11
Views
2K
Back
Top