First-Order Recurrences
1Introduction
This lecture explains how to reduce a constant-coefficient first-order linear recurrence to a geometric sequence by subtracting an equilibrium point. The exceptional case is treated separately.
The recurrence is generally neither arithmetic nor geometric. Its solution depends on eliminating the constant term when , or summing its constant forward difference when .
2Terminology and Definitions
A constant-coefficient first-order linear recurrence has the form
where and are constants. Throughout this lecture, and the initial value is . The equation is homogeneous when and nonhomogeneous when . Although the update map is affine for , the sequence equation is a nonhomogeneous equation with a linear operator on the left-hand side.
An equilibrium point is a value satisfying
For , the unique equilibrium is . For and , no equilibrium exists; for and , every value is an equilibrium.
3Program
First distinguish from . If , then , so the sequence is arithmetic. If , introduce the displacement from the unique equilibrium.
data/lecture/math/sequence/sequences-and-recurrences.lecture.n.md data/lecture/math/sequence/shift-operators-and-recurrences.lecture.n.md data/lecture/math/sequence/difference-equation-basics.lecture.n.md4Informal Explanation
4.11. Why the Equilibrium Is Subtracted
An equilibrium is invariant under the update map . Measuring the displacement from this value removes the translation term and simplifies the update rule.
4.22. The Geometric Displacement Sequence
The displacement from equilibrium is multiplied by at every step. Thus the recurrence contains a geometric sequence after translation. When , its forward difference itself is constant.
5Formal Development
5.1Proposition 1: The Case
Assumptions: For , let with .
Conclusion: With ,
Proof: The equilibrium identity is . Define . Then
Hence is geometric and
Adding proves the formula.
5.2Proposition 2: The Case
Assumptions: For , let with .
Conclusion:
Proof: The recurrence becomes . For , summing from to gives
so telescoping yields . For , the formula reduces to the initial condition . Therefore the conclusion holds for every .
6Example
Consider
The equilibrium satisfies , hence . Set . Then
Since , one has and therefore
7Mathematical Interpretations
7.1Algebraic Interpretation
Translation of the coordinate origin to the equilibrium eliminates the constant term. The standard solution method taught in secondary-school mathematics is therefore an algebraic homogenization procedure.
7.2Operator Interpretation
Define the forward shift by . Then
where is the constant sequence with every term equal to one. This is a linear operator equation , with and .
For , the constant sequence is a particular solution exactly when . Subtracting this particular solution gives
whose kernel consists of geometric sequences satisfying on the index domain. If and , there is no constant particular solution, and the equation is instead with .
7.3Linear-Algebraic Interpretation
The affine recurrence can be embedded in a two-dimensional linear transformation:
An equilibrium satisfies
Thus is an eigenvector with eigenvalue . Translation to the equilibrium separates the affine fixed point from multiplication by in the displacement coordinate.
7.4Analytic Interpretation
The increment is the discrete change measure, so the recurrence is structurally analogous to the differential equation . Both become homogeneous after subtraction of an equilibrium, although their discrete and continuous solution formulas remain distinct.
This correspondence permits comparison of the local structure near an equilibrium in discrete and continuous systems.
8Scope
Equilibrium subtraction applies to when . For , sum the constant forward differences. Variable-coefficient or nonlinear recurrences require other methods, so neither proposition applies to them without modification.
9Basic Formulas
For ,
For ,
10Summary
- First determine whether .
- If , subtract the equilibrium and solve the resulting geometric recurrence.
- If , sum the constant forward differences.