MathJewels math guide · Define and analyze simple recursive processes and recurrence relations
Recursive Rules and Safe Zones
Read a next-step rule, generate a sequence, and use a safe-zone argument to control every future value without calculating forever.
The big idea
A recursive rule tells you how to make the next value from the current one. For example, \(x_{n+1}=(x_n+8)/2\) means: take the value at step \(n\), add 8, and divide by 2 to get the value at step \(n+1\). The starting value matters because the rule alone does not say where the sequence begins. A safe zone, formally called an invariant interval, is an interval with a useful property: whenever a current value is inside, the rule’s next value is also inside. If the starting value is inside too, the process can never leave.
Worked example
Start with \(x_0=1\) and use \(x_{n+1}=(x_n+3)/2\). The first values are \(1,2,\frac52,\frac{11}{4}\). They suggest the sequence stays between 1 and 3, but examples alone are not proof. Instead, suppose an arbitrary current value satisfies \(1\le x_n\le3\). Add 3 throughout and divide by 2:
\[ 2\le \frac{x_n+3}{2}\le3. \]
So the next value is still between 1 and 3. Since the starting value 1 is inside, every later value is inside.
How children may show it
Students may make a step table with columns for \(n\), the current value, and the next value. For a safe-zone proof, they may draw an interval bar, write an if-then sentence, or transform a three-part inequality. Ask them to point separately to the start check and the safe-step check. Both are needed: “It starts inside” and “inside always leads to inside.”
Common mix-up
A student may calculate five or ten values and say that proves the pattern continues forever. Those examples are evidence, but the next uncalculated value could behave differently. Ask, “Did you check some current values, or every possible current value in the interval?” Another mix-up is proving the rule stays inside but forgetting to verify that the starting value is inside. A beautifully locked gate does not help if the process starts beyond it.
Try it together
Use \(y_0=0\) and \(y_{n+1}=(y_n+4)/2\). Calculate four values. Propose an interval that seems to contain them. Then choose a general \(y_n\) in that interval and bound \((y_n+4)/2\). Finally, test a smaller interval and look for one allowed input that is sent outside. Compare what several examples, one general proof, and one counterexample can each establish.