The Central Idea
For a sequence
\[ a_0,a_1,a_2,a_3,\ldots, \]the change from one term to the next is measured by a difference.
The forward difference is
\[ \boxed{\Delta a_n=a_{n+1}-a_n}. \]A difference equation specifies a relationship involving one or more of these discrete changes.
For example,
\[ \boxed{\Delta a_n=4} \]says that the sequence increases by \(4\) at every step.
From Differences to Recurrences
Start with
\[ \Delta a_n=4. \]By definition,
\[ a_{n+1}-a_n=4. \]Add \(a_n\) to both sides:
\[ \boxed{a_{n+1}=a_n+4}. \]Thus, a difference equation and a recurrence can express the same discrete process in different forms.
From Recurrences to Differences
Suppose
\[ a_{n+1}=a_n+7. \]Subtract \(a_n\):
\[ a_{n+1}-a_n=7. \]Therefore,
\[ \boxed{\Delta a_n=7}. \]The recurrence emphasizes the next value. The difference equation emphasizes the change.
First Differences
The first difference sequence is obtained by subtracting each term from the next.
Consider
\[ 3,\ 8,\ 13,\ 18,\ 23,\ldots \]The first differences are
\[ 8-3=5, \] \[ 13-8=5, \] \[ 18-13=5. \]Therefore,
\[ \boxed{\Delta a_n=5}. \]Constant First Differences
Constant first differences characterize arithmetic sequences.
If
\[ \Delta a_n=d, \]then
\[ a_{n+1}=a_n+d. \]Thus, arithmetic recurrences can be interpreted directly as constant-change difference equations.
Variable First Differences
A difference equation does not need to have a constant right-hand side.
Suppose
\[ \boxed{\Delta a_n=2n+1}. \]Then
\[ a_{n+1}=a_n+2n+1. \]The amount added changes with the index.
Example: Generate Terms from a Difference Equation
Let
\[ a_0=4 \]and
\[ \Delta a_n=2n+1. \]Since
\[ a_{n+1}=a_n+2n+1, \]we obtain
\[ a_1=4+1=5, \] \[ a_2=5+3=8, \] \[ a_3=8+5=13, \] \[ a_4=13+7=20. \]Therefore,
\[ \boxed{4,\ 5,\ 8,\ 13,\ 20,\ldots}. \]The Forward-Difference Operator
The symbol
\[ \Delta \]is called the forward-difference operator.
Applied to a sequence \(a_n\),
\[ \boxed{\Delta a_n=a_{n+1}-a_n}. \]It transforms the original sequence into a new sequence describing step-to-step change.
Difference Tables
A difference table places a sequence and its successive differences in layers.
Consider
\[ 1,\ 4,\ 9,\ 16,\ 25. \]First differences:
\[ 3,\ 5,\ 7,\ 9. \]Second differences:
\[ 2,\ 2,\ 2. \]The constant second difference reveals important polynomial structure.
Second Differences
The second difference is the difference of the first-difference sequence:
\[ \boxed{\Delta^2a_n=\Delta(\Delta a_n)}. \]Expanding,
\[ \Delta^2a_n = (a_{n+2}-a_{n+1})-(a_{n+1}-a_n). \]Therefore,
\[ \boxed{\Delta^2a_n=a_{n+2}-2a_{n+1}+a_n}. \]Example: Constant Second Difference
Let
\[ a_n=n^2. \]Then
\[ \Delta a_n = (n+1)^2-n^2 = 2n+1. \]Apply the difference operator again:
\[ \Delta^2a_n = [2(n+1)+1]-(2n+1). \]Thus,
\[ \boxed{\Delta^2a_n=2}. \]Polynomial Sequences and Differences
Successive differences reduce polynomial degree.
Roughly:
- a linear sequence has constant first differences;
- a quadratic sequence has constant second differences;
- a cubic sequence has constant third differences.
This provides a practical way to recognize polynomial patterns in finite data.
Third and Higher Differences
Higher differences are defined repeatedly:
\[ \Delta^3a_n=\Delta(\Delta^2a_n), \] \[ \Delta^4a_n=\Delta(\Delta^3a_n), \]and so on.
Each layer measures how the previous layer of discrete change is itself changing.
Difference Equations as Discrete Change Laws
A difference equation can be read as a rule for change.
For example,
\[ \Delta P_n=50 \]means that \(P_n\) increases by \(50\) each period.
The equation
\[ \Delta P_n=0.1P_n \]means that the change equals \(10\%\) of the current amount.
State-Dependent Difference Equations
Suppose
\[ \boxed{\Delta a_n=0.2a_n}. \]Then
\[ a_{n+1}-a_n=0.2a_n. \]Therefore,
\[ a_{n+1}=1.2a_n. \]This is a geometric recurrence with growth factor \(1.2\).
Decay in Difference Form
Suppose
\[ \Delta a_n=-0.15a_n. \]Then
\[ a_{n+1}=a_n-0.15a_n. \]Hence,
\[ \boxed{a_{n+1}=0.85a_n}. \]The quantity retains \(85\%\) of its value at every step.
Difference Form of a First-Order Linear Recurrence
Consider
\[ a_{n+1}=ra_n+b. \]Subtract \(a_n\):
\[ a_{n+1}-a_n=(r-1)a_n+b. \]Therefore,
\[ \boxed{\Delta a_n=(r-1)a_n+b}. \]This form isolates the change produced by the current state and the external input.
Example: Growth with Constant Input
Suppose
\[ a_{n+1}=1.05a_n+20. \]Then
\[ \Delta a_n = 1.05a_n+20-a_n. \]Therefore,
\[ \boxed{\Delta a_n=0.05a_n+20}. \]The change consists of \(5\%\) growth plus a constant addition of \(20\).
Equilibrium Values
An equilibrium is a state that does not change under the difference equation.
At equilibrium,
\[ \boxed{\Delta a_n=0}. \]If
\[ \Delta a_n=0.2a_n-10, \]then equilibrium satisfies
\[ 0=0.2a-10. \]Thus,
\[ \boxed{a=50}. \]Checking an Equilibrium
For
\[ \Delta a_n=0.2a_n-10, \]substitute \(a_n=50\):
\[ \Delta a_n=0.2(50)-10=0. \]Therefore, if the sequence reaches \(50\), the next value remains \(50\).
Equilibrium in Recurrence Form
Suppose
\[ a_{n+1}=0.8a_n+10. \]An equilibrium \(L\) satisfies
\[ L=0.8L+10. \]Therefore,
\[ 0.2L=10, \] \[ \boxed{L=50}. \]This matches the zero-change condition obtained from the equivalent difference equation.
Positive and Negative Change
A difference equation immediately reveals whether the sequence rises or falls at a particular state.
If
\[ \Delta a_n>0, \]then
\[ a_{n+1}>a_n. \]If
\[ \Delta a_n<0, \]then
\[ a_{n+1}the value remains unchanged for that step.
Example: Sign Analysis
Consider
\[ \Delta a_n=12-0.3a_n. \]The equilibrium is found from
\[ 12-0.3a=0, \]giving
\[ a=40. \]If \(a_n<40\), then
\[ \Delta a_n>0. \]If \(a_n>40\), then
\[ \Delta a_n<0. \]The sign of the difference points toward the equilibrium.
Difference Equations and Initial Conditions
A difference equation generally requires starting information.
For example,
\[ \Delta a_n=3 \]does not determine one unique sequence.
With
\[ a_0=2, \]the sequence is
\[ 2,\ 5,\ 8,\ 11,\ldots \]while with
\[ a_0=10, \]it becomes
\[ 10,\ 13,\ 16,\ 19,\ldots \]Summing Differences
Since
\[ \Delta a_k=a_{k+1}-a_k, \]summing consecutive differences gives cancellation:
\[ \sum_{k=0}^{n-1}\Delta a_k = (a_1-a_0)+(a_2-a_1)+\cdots+(a_n-a_{n-1}). \]Therefore,
\[ \boxed{\sum_{k=0}^{n-1}\Delta a_k=a_n-a_0}. \]Discrete Accumulation
Rearranging the telescoping identity gives
\[ \boxed{ a_n = a_0+\sum_{k=0}^{n-1}\Delta a_k }. \]This says:
final value = initial value + accumulated discrete changes.
This principle is fundamental in discrete modeling.
Example: Accumulating a Variable Difference
Suppose
\[ \Delta a_k=2k+1 \]and
\[ a_0=4. \]Then
\[ a_n = 4+\sum_{k=0}^{n-1}(2k+1). \]The sum of the first \(n\) odd positive integers is \(n^2\), so
\[ \boxed{a_n=4+n^2}. \]Thus, summing a difference equation can reveal an explicit form.
Differences as a Discrete Analogue of Derivatives
In continuous mathematics, a derivative measures change with respect to a continuously varying input.
In discrete mathematics,
\[ \Delta a_n=a_{n+1}-a_n \]measures change across one index step.
The ideas are related, but a finite difference is not literally the same object as a derivative.
One belongs to discrete change; the other belongs to continuous change.
First Difference of a Linear Explicit Rule
Let
\[ a_n=mn+b. \]Then
\[ a_{n+1}=m(n+1)+b. \]Therefore,
\[ \Delta a_n = [m(n+1)+b]-(mn+b). \]Hence,
\[ \boxed{\Delta a_n=m}. \]This is the discrete version of constant linear rate of change.
First Difference of a Quadratic Explicit Rule
Let
\[ a_n=an^2+bn+c. \]Then
\[ \Delta a_n = a(n+1)^2+b(n+1)+c-(an^2+bn+c). \]Simplifying,
\[ \boxed{\Delta a_n=2an+a+b}. \]The first difference of a quadratic sequence is linear in \(n\).
Second Difference of a Quadratic Rule
From
\[ \Delta a_n=2an+a+b, \]take another difference:
\[ \Delta^2a_n = [2a(n+1)+a+b]-(2an+a+b). \]Therefore,
\[ \boxed{\Delta^2a_n=2a}. \]The constant second difference is twice the quadratic coefficient.
Recovering a Quadratic Coefficient
Suppose a sequence comes from
\[ a_n=An^2+Bn+C \]and has constant second difference
\[ 6. \]Since
\[ \Delta^2a_n=2A, \]we have
\[ 2A=6. \]Therefore,
\[ \boxed{A=3}. \]Difference Equations in Inventory Models
Suppose inventory receives \(40\) units and ships \(55\) units each day.
The net daily change is
\[ 40-55=-15. \]If \(I_n\) is the inventory after day \(n\), then
\[ \boxed{\Delta I_n=-15}. \]Equivalently,
\[ I_{n+1}=I_n-15. \]Difference Equations in Population Models
Suppose a population has \(B_n\) births and \(D_n\) deaths during period \(n\).
Then a simple balance equation is
\[ \boxed{\Delta P_n=B_n-D_n}. \]Additional migration terms could also be included.
The difference equation separates the change into interpretable contributions.
Difference Equations in Financial Models
Suppose a balance earns rate \(r\) per period and then receives a deposit \(D\).
The recurrence is
\[ B_{n+1}=(1+r)B_n+D. \]Therefore,
\[ \boxed{\Delta B_n=rB_n+D}. \]The balance changes through earned growth plus an external contribution.
Difference Equations in Motion
Suppose \(x_n\) is position at discrete time \(n\).
Then
\[ \Delta x_n=x_{n+1}-x_n \]measures the displacement over one time step.
If the time step is one unit, this difference can serve as a discrete velocity measure.
Second Differences and Discrete Acceleration
If
\[ \Delta x_n \]represents stepwise displacement, then
\[ \Delta^2x_n \]measures how that displacement changes from step to step.
This creates a discrete analogue of acceleration.
Example: Constant Discrete Acceleration
Consider positions
\[ 0,\ 1,\ 4,\ 9,\ 16,\ldots \]First differences are
\[ 1,\ 3,\ 5,\ 7,\ldots \]and second differences are
\[ 2,\ 2,\ 2,\ldots \]Thus, the position sequence has constant second difference.
Nonlinear Difference Equations
Difference equations can be nonlinear.
For example,
\[ \boxed{\Delta a_n=(a_n)^2-1} \]becomes
\[ a_{n+1}=a_n+(a_n)^2-1. \]The squared state makes the equation nonlinear.
Difference Equations Can Encode Logistic-Type Change
A nonlinear discrete growth model may have the form
\[ \Delta P_n=rP_n\left(1-\frac{P_n}{K}\right). \]Here \(r\) controls growth and \(K\) acts as a capacity scale.
This example shows how difference equations can represent state-dependent growth that weakens as the state becomes large.
Detailed nonlinear dynamics are beyond the scope of this lesson.
Difference Equations and Fibonacci-Type Sequences
For a Fibonacci-type sequence,
\[ a_{n+1}=a_n+a_{n-1}. \]Subtract \(a_n\):
\[ \Delta a_n=a_{n-1}. \]Therefore,
\[ \boxed{\Delta a_n=a_{n-1}}. \]The stepwise change is itself an earlier term of the sequence.
Difference Equations and Linear Recurrences
Difference equations and linear recurrences are closely related.
For example,
\[ \Delta a_n=2a_n+3 \]is equivalent to
\[ a_{n+1}=3a_n+3. \]Choosing one form or the other depends on whether we want to emphasize the new state or the change itself.
Common Error: Reversing the Difference
With the forward-difference convention,
\[ \boxed{\Delta a_n=a_{n+1}-a_n}. \]Reversing the subtraction changes the sign.
For the sequence
\[ 3,\ 8,\ 13,\ldots, \]the forward difference is
\[ 8-3=5, \]not \(-5\).
Common Error: Confusing a Difference with a Ratio
The expression
\[ a_{n+1}-a_n \]measures additive change.
The expression
\[ \frac{a_{n+1}}{a_n} \]measures multiplicative change when \(a_n\neq0\).
These are different quantities.
Common Error: Assuming Every Difference Is Constant
A difference equation can have
\[ \Delta a_n=n, \]or
\[ \Delta a_n=0.1a_n, \]or many other forms.
Constant differences are only one special case.
Common Error: Forgetting the Initial Condition
The equation
\[ \Delta a_n=4 \]does not identify a unique sequence.
An initial value such as
\[ a_0=7 \]is also needed.
Common Error: Misreading \(\Delta^2 a_n\)
The notation
\[ \Delta^2a_n \]does not mean
\[ (\Delta a_n)^2. \]It means apply the difference operator twice:
\[ \boxed{\Delta^2a_n=\Delta(\Delta a_n)}. \]Common Error: Treating a Difference as a Derivative
A finite difference measures change over a discrete step.
A derivative measures an instantaneous continuous rate of change.
They are conceptually related, but they are not interchangeable without additional assumptions or limiting arguments.
A Reliable Procedure for First-Difference Problems
- Write \(\Delta a_n=a_{n+1}-a_n\).
- Substitute the stated difference rule.
- Rearrange to a recurrence if needed.
- Use the initial condition to generate terms.
- Check the sign and indexing of each difference.
- Interpret the result as stepwise change.
A Reliable Procedure for Difference Tables
- Write the original sequence in order.
- Subtract each term from the next to form first differences.
- Repeat the process to form second differences.
- Continue as needed.
- Look for a constant layer or another recognizable pattern.
- Use the pattern to infer possible structure.
A Reliable Procedure for Equilibrium Analysis
- Write the difference equation.
- Set \(\Delta a_n=0\).
- Solve for the equilibrium state.
- Check the sign of \(\Delta a_n\) below and above that state.
- Interpret whether nearby values move toward or away from equilibrium.
A Reliable Procedure for Translating a Recurrence
- Start with a recurrence such as \(a_{n+1}=F(a_n,n)\).
- Subtract \(a_n\) from both sides.
- Replace \(a_{n+1}-a_n\) by \(\Delta a_n\).
- Simplify the resulting change law.
Practice 1: First Differences
Find the first differences of
\[ 4,\ 9,\ 14,\ 19,\ 24. \]Write a difference equation for the pattern.
Practice 2: Convert to a Recurrence
Convert
\[ \Delta a_n=6 \]into recurrence form.
Practice 3: Variable Difference
Let
\[ a_0=2, \] \[ \Delta a_n=n+1. \]Find \(a_1,a_2,a_3,a_4\).
Practice 4: Second Differences
Find the first and second differences of
\[ 2,\ 6,\ 12,\ 20,\ 30. \]Practice 5: Convert a Recurrence to Difference Form
Convert
\[ a_{n+1}=1.1a_n+8 \]into difference-equation form.
Practice 6: Equilibrium
Find the equilibrium of
\[ \Delta a_n=15-0.5a_n. \]Practice 7: Sign of Change
For
\[ \Delta a_n=20-0.4a_n, \]determine whether the sequence increases or decreases when:
- \(a_n=30\);
- \(a_n=70\).
Practice 8: Discrete Accumulation
Suppose
\[ a_0=5 \]and
\[ \Delta a_k=3 \]for \(k=0,1,\ldots,n-1\).
Use discrete accumulation to find \(a_n\).
Practice 9: Financial Difference Equation
A balance earns \(4\%\) per period and receives a deposit of \(\$25\).
Write a difference equation for the balance \(B_n\).
Practice 10: Fibonacci Difference Form
Suppose
\[ a_{n+1}=a_n+a_{n-1}. \]Express \(\Delta a_n\) in terms of an earlier sequence value.
Practice Answers
Practice 1
First differences are
\[ 9-4=5, \] \[ 14-9=5, \] \[ 19-14=5, \] \[ 24-19=5. \]Therefore,
\[ \boxed{\Delta a_n=5}. \]Practice 2
\[ a_{n+1}-a_n=6. \]Add \(a_n\):
\[ \boxed{a_{n+1}=a_n+6}. \]Practice 3
Since
\[ a_{n+1}=a_n+n+1, \]we get
\[ a_1=2+1=3, \] \[ a_2=3+2=5, \] \[ a_3=5+3=8, \] \[ a_4=8+4=12. \]Therefore,
\[ \boxed{a_1=3,\quad a_2=5,\quad a_3=8,\quad a_4=12}. \]Practice 4
First differences:
\[ 4,\ 6,\ 8,\ 10. \]Second differences:
\[ 2,\ 2,\ 2. \]Therefore,
\[ \boxed{\Delta^2a_n=2} \]across the displayed range.
Practice 5
Subtract \(a_n\):
\[ a_{n+1}-a_n=0.1a_n+8. \]Therefore,
\[ \boxed{\Delta a_n=0.1a_n+8}. \]Practice 6
At equilibrium,
\[ 0=15-0.5a. \]Therefore,
\[ 0.5a=15, \] \[ \boxed{a=30}. \]Practice 7
If \(a_n=30\),
\[ \Delta a_n=20-0.4(30)=8>0. \]The sequence increases.
If \(a_n=70\),
\[ \Delta a_n=20-0.4(70)=-8<0. \]The sequence decreases.
Practice 8
Discrete accumulation gives
\[ a_n = a_0+\sum_{k=0}^{n-1}\Delta a_k. \]Therefore,
\[ a_n = 5+\sum_{k=0}^{n-1}3 = 5+3n. \]Hence,
\[ \boxed{a_n=5+3n}. \]Practice 9
A \(4\%\) gain contributes
\[ 0.04B_n \]to the change, and the deposit adds \(25\).
Therefore,
\[ \boxed{\Delta B_n=0.04B_n+25}. \]Practice 10
Subtract \(a_n\) from both sides:
\[ a_{n+1}-a_n=a_{n-1}. \]Therefore,
\[ \boxed{\Delta a_n=a_{n-1}}. \]What to Remember
A difference equation describes discrete change.
\[ \boxed{\Delta a_n=a_{n+1}-a_n}. \]- Difference equations and recurrences can often be translated into each other.
- Constant first differences characterize arithmetic sequences.
- Second and higher differences measure changes in lower-order differences.
- Polynomial sequences produce constant differences at a predictable level.
- State-dependent differences can model growth, decay, finance, inventory, and population change.
- Equilibrium occurs where the discrete change is zero.
- Summing differences reconstructs accumulated change.
- Finite differences are discrete analogues of continuous change measures, but they are not derivatives.
- Initial conditions remain necessary to identify a particular solution.
The central accumulation identity is
\[ \boxed{ a_n=a_0+\sum_{k=0}^{n-1}\Delta a_k }. \]Where We Go Next
Difference equations describe how a state changes between discrete steps. The next perspective makes that update process itself the central object and tracks how a system moves from one state to another under repeated application of a rule.
The next lesson, Iteration and State Transitions, develops iterative maps, state updates, trajectories, fixed states, finite and infinite state spaces, and the relationship between recurrence rules and discrete dynamical systems.