Increasing, decreasing and periodic recurrences
Introduit| English | Sens |
|---|---|
| periodic sequence/ˌpɪərɪˈɒdɪk ˈsiːkwəns/ | suite périodique |
A simple rule with wild behaviour, 1976
- In June 1976, the ecologist Robert May published "Simple mathematical models with very complicated dynamics" in Nature. He studied insect populations with the recurrence $x_{n+1} = rx_n(1 - x_n)$. For $r = 2.5$ the population settles to one value; for $r = 3.2$ it flips between two values for ever; for $r = 3.9$ it never settles at all. The same rule, with a different number, behaves in completely different ways.
- A sequence from a recurrence can be increasing, decreasing, a periodic sequence 周期数列, or none of these.
Increasing and decreasing
- Increasing: $u_{n+1} > u_n$ for all $n$. Decreasing: $u_{n+1} < u_n$ for all $n$.
- To prove it, show that $u_{n+1} - u_n$ is always positive (or negative): for $u_n = n^2 + n$, $u_{n+1} - u_n = 2n + 2 > 0$.
Which sequence is decreasing?
Difficulté 1/5 · 100 pièces + un petit bonus lors de la première réussite aujourd'hui
Each term is smaller than the last.
Periodic sequences
- The terms repeat after $k$ steps: $u_{n+k} = u_n$ for all $n$. The smallest such $k$ is the period.
- $u_n = \cos\left(\tfrac{n\pi}{2}\right)$ gives $0, -1, 0, 1, 0, \dots$: period 4.
Increasing, decreasing and periodic recurrences
A recurrence needs an initial term as well as a rule
Check whether a sequence or sum argument preserves all its defining information.
What is the period of $u_n = \sin\left(\tfrac{n\pi}{3}\right)$?
Difficulté 2/5 · 140 pièces + un petit bonus lors de la première réussite aujourd'hui
$\tfrac{2\pi}{\pi/3}$.
Worked example: a period-3 sequence
$u_{n+1} = \dfrac{1}{1 - u_n}$, $u_1 = 2$. Show the sequence is periodic and find $\displaystyle\sum_{r=1}^{30} u_r$.
- Terms: $u_2 = \tfrac{1}{1 - 2} = -1$, $u_3 = \tfrac{1}{2}$, $u_4 = \tfrac{1}{1 - \frac{1}{2}} = 2 = u_1$.
- Period: each term depends only on the one before, so the cycle $2, -1, \tfrac{1}{2}$ repeats: period 3.
- Sum: one cycle sums to $1.5$; 30 terms are 10 cycles, so the sum is 15.
$u_{n+1} = 5 - u_n$, $u_1 = 2$. Describe the sequence.
Difficulté 1/5 · 100 pièces + un petit bonus lors de la première réussite aujourd'hui
2, 3, 2, 3, …
Pour $u_{n+1} = 5 - u_n$, $u_1 = 2$, find $\displaystyle\sum_{r=1}^{40} u_r$.
Difficulté 2/5 · 140 pièces + un petit bonus lors de la première réussite aujourd'hui
20 pairs of $2 + 3$.
In the worked example (period 3, $u_1 = 2$), find $u_{100}$.
Difficulté 2/5 · 140 pièces + un petit bonus lors de la première réussite aujourd'hui
$100 = 3 \times 33 + 1$, so $u_{100} = u_1$.
Convergent sequences
- $u_{n+1} = 0.5u_n + 3$ tends to the fixed value $L = 6$ from any start.
- A fixed value can exist without the sequence reaching it: May's rule with $r = 3.2$ has a fixed value but flips around it.
May's two-cycle
- $x_{n+1} = 3.2x_n(1 - x_n)$, $x_1 = 0.5$: $0.8$, $0.512$, $0.7995$, $0.5130$, $0.7995$, …
- The terms settle into a two-value cycle, about $0.513$ and $0.799$.
Finding a fixed value does not prove the sequence converges. Solving $L = 3.2L(1 - L)$ gives $L = 0.6875$, but the sequence from 0.5 never approaches it. Look at the terms, or at the starting value, as well.
If $L = f(L)$ has a solution, the sequence $u_{n+1} = f(u_n)$ must converge to $L$.
Difficulté 1/5 · 100 pièces + un petit bonus lors de la première réussite aujourd'hui
May's rule with $r = 3.2$ is a counterexample.
Prove increasing or decreasing by the sign of $u_{n+1} - u_n$. For periodic sequences, find terms until one repeats, then use full cycles to find sums. A fixed value of a recurrence is a candidate limit only: check that the terms actually approach it.
A sequence has $u_{n+1} = ku_n + 3$, $u_1 = 2$. Given $u_3 = 2$ and the sequence is periodic, find the possible values of $k$ and the period.
Periodicity from a condition.