markdown
First-Order Recurrencesmd a59aac3
lecture/math/sequence/first-order-recurrences.lecture.n.md
Download PDF

First-Order Recurrences

date2026-07-14document_iddoc_6442a1efe00e9165818d0e45a4c37d40description一次漸化式を、平衡点による標準解法と、シフト作用素による非同次線型作用素方程式の両方から整理する講義である。prerequisites等比数列 / 数列と漸化式 / 一次方程式 / シフト作用素と漸化式type講義content_typelecturestatusactiverelateddata/lecture/math/sequence/sequences-and-recurrences.lecture.n.md / data/lecture/math/sequence/arithmetic-and-geometric-sequences.lecture.n.md / data/lecture/math/sequence/shift-operators-and-recurrences.lecture.n.md / data/lecture/math/sequence/recurrence-types-and-strategies.lecture.n.md / data/lecture/math/sequence/difference-equation-basics.lecture.n.md / data/lecture/math/linear-operator/linear-operator-equation-basics.lecture.n.md
mathhighschoolsequencelecture

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 p=1 is treated separately.

The recurrence an+1=pan+q is generally neither arithmetic nor geometric. Its solution depends on eliminating the constant term q when p1, or summing its constant forward difference when p=1.

2Terminology and Definitions

A constant-coefficient first-order linear recurrence has the form

an+1=pan+q,

where p and q are constants. Throughout this lecture, n[PARSE ERROR: Undefined("Command(\"ge\")")]1 and the initial value is a1. The equation is homogeneous when q=0 and nonhomogeneous when q0. Although the update map xpx+q is affine for q0, the sequence equation (E-pI)a=q1 is a nonhomogeneous equation with a linear operator on the left-hand side.

An equilibrium point is a value α satisfying

α=pα+q.

For p1, the unique equilibrium is α=q/(1-p). For p=1 and q0, no equilibrium exists; for p=1 and q=0, every value is an equilibrium.

3Program

First distinguish p=1 from p1. If p=1, then an+1-an=q, so the sequence is arithmetic. If p1, introduce the displacement an-α 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.md

4Informal Explanation

4.11. Why the Equilibrium Is Subtracted

An equilibrium is invariant under the update map xpx+q. 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 p at every step. Thus the p1 recurrence contains a geometric sequence after translation. When p=1, its forward difference itself is constant.

5Formal Development

5.1Proposition 1: The Case p1

Assumptions: For n[PARSE ERROR: Undefined("Command(\"ge\")")]1, let an+1=pan+q with p1.

Conclusion: With α=q/(1-p),

[PARSE ERROR: Undefined("Command(\"boxed\")")]an=α+(a1-α)pn-1.

Proof: The equilibrium identity is α=pα+q. Define bn=an-α. Then

bn+1=an+1-α=pan+q-α=p(an-α)=pbn.

Hence (bn) is geometric and

bn=b1pn-1=(a1-α)pn-1.

Adding α proves the formula.

5.2Proposition 2: The Case p=1

Assumptions: For n[PARSE ERROR: Undefined("Command(\"ge\")")]1, let an+1=pan+q with p=1.

Conclusion:

[PARSE ERROR: Undefined("Command(\"boxed\")")]an=a1+(n-1)q.

Proof: The recurrence becomes an+1-an=q. For N[PARSE ERROR: Undefined("Command(\"ge\")")]2, summing from n=1 to N-1 gives

n=1N-1(an+1-an)=n=1N-1q,

so telescoping yields aN-a1=(N-1)q. For N=1, the formula reduces to the initial condition a1=a1. Therefore the conclusion holds for every n[PARSE ERROR: Undefined("Command(\"ge\")")]1.

6Example

Consider

an+1=2an+3,a1=1.

The equilibrium satisfies α=2α+3, hence α=-3. Set bn=an+3. Then

bn+1=an+1+3=2an+6=2bn.

Since b1=4, one has bn=4·2n-1=2n+1 and therefore

an=2n+1-3.

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 (Ea)n=an+1. Then

(E-pI)a=q1,

where 1 is the constant sequence with every term equal to one. This is a linear operator equation La=y, with L=E-pI and y=q1.

For p1, the constant sequence an=α is a particular solution exactly when (1-p)α=q. Subtracting this particular solution gives

(E-pI)b=0,

whose kernel consists of geometric sequences satisfying bn+1=pbn on the index domain. If p=1 and q0, there is no constant particular solution, and the equation is instead Δa=q with Δ=E-I.

7.3Linear-Algebraic Interpretation

The affine recurrence can be embedded in a two-dimensional linear transformation:

(an+11)=(pq01)(an1).

An equilibrium satisfies

(pq01)(α1)=(α1).

Thus (α,1)T is an eigenvector with eigenvalue 1. Translation to the equilibrium separates the affine fixed point from multiplication by p in the displacement coordinate.

7.4Analytic Interpretation

The increment an+1-an is the discrete change measure, so the recurrence is structurally analogous to the differential equation y=cy+d. 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 an+1=pan+q when p1. For p=1, sum the constant forward differences. Variable-coefficient or nonlinear recurrences require other methods, so neither proposition applies to them without modification.

9Basic Formulas

For p1,

[PARSE ERROR: Undefined("Command(\"boxed\")")]α=q1-p,
[PARSE ERROR: Undefined("Command(\"boxed\")")]bn:=an-αbn+1=pbn,
[PARSE ERROR: Undefined("Command(\"boxed\")")]an=α+(a1-α)pn-1(n[PARSE ERROR: Undefined("Command(\"ge\")")]1).

For p=1,

[PARSE ERROR: Undefined("Command(\"boxed\")")]an=a1+(n-1)q(n[PARSE ERROR: Undefined("Command(\"ge\")")]1).

10Summary

  • First determine whether p=1.
  • If p1, subtract the equilibrium and solve the resulting geometric recurrence.
  • If p=1, sum the constant forward differences.

11Related Lectures

data/lecture/math/sequence/sequences-and-recurrences.lecture.n.md data/lecture/math/sequence/arithmetic-and-geometric-sequences.lecture.n.md data/lecture/math/sequence/shift-operators-and-recurrences.lecture.n.md data/lecture/math/sequence/recurrence-types-and-strategies.lecture.n.md data/lecture/math/sequence/difference-equation-basics.lecture.n.md data/lecture/math/linear-operator/linear-operator-equation-basics.lecture.n.md
raw .n.md をコピー
loc をコピー (filepath:line ~ line)
copy share link
copy encoded share link
path をコピー
copy share link
copy encoded share link
copy share link
copy encoded share link
タブを全て閉じる