First-Order Equations/First-Order Difference Equations

Lesson 2.61,095 words

First-Order Difference Equations

A difference equation advances a sequence one index at a time by a rule y_{n+1} = f(y_n). The linear case y_{n+1} = rho*y_n + b solves in closed form and converges to its equilibrium exactly when the ratio has magnitude below one, which underlies compound-interest and loan calculations.

╌╌╌╌

A difference equation advances a sequence one index at a time. Given a rule

and a starting value , the whole sequence is generated by repeated substitution: , , and in general , the -th iterate. Where a first-order differential equation runs a solution continuously in , a first-order difference equation steps a solution discretely in , and the central question is the same: how does behave as ?1

The discrete analogue of a constant solution is a sequence that never changes.

Equilibria are the fixed points of , found by setting .

Linear difference equations

Take a population whose size in year is a fixed multiple of its size in year , plus a constant net migration :

The constant is the reproduction ratio, and the yearly immigration () or emigration (). Iterating from ,

and the pattern is a geometric sum. For ,

The first term is the descendants of the original population; the second collects the migration of every preceding year. Rewriting it around the equilibrium makes the long-time behavior visible:

Setting in the equation gives the same equilibrium directly, . Everything hinges on the factor :

  • . The factor , so from any start. The equilibrium is asymptotically stable.
  • . The factor grows without bound and diverges, unless exactly. The equilibrium is unstable.
  • . The formula degenerates; iterating directly gives , growing linearly without bound (unless ).

For the pure model (no migration) the equilibrium is , stable for and unstable for : the same dichotomy the continuous equation shows through the sign of , now read off the magnitude of .

For a stable linear difference equation the iterates approach the equilibrium b/(1-rho) monotonically; each point is one step of the rule y_{n+1} = rho*y_n + b with 0 < rho < 1.

The same linear model covers many financial calculations. There is an account balance in period , with the interest rate per period, and is the deposit () or payment () made each period.

The logistic difference equation

Nonlinear difference equations behave far more richly than linear ones. The sharpest example is the discrete counterpart of the logistic model. Replacing the derivative in by a difference quotient and rescaling the variable turns it into the logistic map

with a single parameter. The equilibria come from , that is , so

The second equilibrium is positive only for . Stability is tested by linearizing near each fixed point. Near the quadratic term is negligible and the map reduces to , stable for . Near , writing and dropping the quadratic term gives

stable for , that is . The two ranges meet at , where the equilibria coincide and stability passes from one branch to the other.

A cobweb diagram displays the iteration geometrically. Plot the map and the line on the same axes; their intersections are the equilibria. Starting at on the horizontal axis, a vertical segment to the parabola computes , a horizontal segment to the line transfers that value back to the axis, and repeating traces a staircase or spiral toward the stable equilibrium.

Cobweb diagram for u_{n+1} = rho*u_n(1-u_n) at rho = 2.8: iterates spiral inward to the nonzero equilibrium (rho-1)/rho = 0.6429, approaching with damped oscillation.

Collecting the stability results: is stable for and is stable for . Plotting both equilibria against , the stable portions form a continuous path that jumps from one branch to the other at , an exchange of stability.

Exchange of stability for the logistic map (parameter rho on the horizontal axis): u = 0 is stable (solid) below rho = 1, then loses stability to u = (rho-1)/rho, stable for 1 < rho < 3 and unstable (dashed) beyond.

Period doubling and chaos

For neither equilibrium is stable, and the iterates never settle to a single value. Just past the sequence approaches a two-cycle: after a transient it alternates between two values. At the alternation is between and .

The cobweb of a two-cycle is a rectangle traced repeatedly: the map now folds the interval so that two points map to each other, and the fixed point at sits inside the loop, unstable.

Cobweb of the period-2 orbit at rho = 3.2: the iteration settles into a rectangle between the two-cycle points p = 0.513 and q = 0.80, cycling around the now-unstable fixed point at 0.6875.

Raising further, each state of the two-cycle splits in two. At about the orbit becomes a four-cycle; near it becomes an eight-cycle, and periods follow in quick succession. This cascade of period doublings accumulates at a finite limit . The parameter gaps between successive doublings shrink by a nearly constant factor, the Feigenbaum constant, which recurs across a wide class of maps.

Beyond the solutions are chaotic: they stay in a bounded range but follow no periodic pattern. For the iterates wander between roughly and with no discernible order.

A chaotic orbit of u_{n+1} = 3.65*u_n(1-u_n) from u_0 = 0.3: bounded between about 0.3 and 0.9 but aperiodic, with no repeating block of values.

A hallmark of chaos is sensitivity to initial conditions. Two orbits of the same map starting at and stay close for about fifteen iterations, then diverge completely; after that, neither can be used to predict the other. The logistic map was one of the first simple systems in which this was recognized, in Robert May's 1974 study of insect populations: a growth parameter too large makes long-range prediction impossible in principle, not merely in practice.

Range of Long-time behavior of
converges to (extinction)
converges to
period-2 oscillation
period (doubling cascade)
chaotic: bounded, aperiodic, sensitive to

Summary

  • A first-order difference equation generates a sequence by iteration; its equilibria are the fixed points .
  • The linear equation solves in closed form, with equilibrium that is stable for and unstable for ; the case grows linearly. Compound interest, savings, and loan amortization are direct applications.
  • The logistic map has equilibria and , with an exchange of stability at and loss of stability of the nonzero branch at .
  • Past come period doublings at a geometric rate set by the Feigenbaum constant , accumulating at , beyond which the dynamics are chaotic and sensitive to the initial value.

Footnotes

  1. Boyce, Elementary Differential Equations, §2.9 — First-Order Difference Equations: iteration and equilibria, the linear equation and its financial applications (Example 1, the car loan), and the logistic map with its exchange of stability, period-doubling cascade, and chaotic regime (the Feigenbaum constant and May's 1974 analysis).

╌╌ END ╌╌