Math 2.0

Difference and functional equations Linear difference equations Proposition

Superposition of solutions

Builds on Homogeneous and inhomogeneous linear recurrencesSequence

Statement

Let KK be a field, let d≥1d \ge 1, and let a0,…,ad−1 ⁣:ℕ→Ka_0, \dots, a_{d-1} \colon \N \to K be sequences. For a sequence u ⁣:ℕ→Ku \colon \N \to K, let LuLu be the sequence (Lu)(n)=un+d+ad−1(n) un+d−1+⋯+a0(n) un.(Lu)(n) = u_{n+d} + a_{d-1}(n)\, u_{n+d-1} + \cdots + a_0(n)\, u_n . Then the following hold.

  1. If Lu=0Lu = 0 and Lv=0Lv = 0, then L(αu+βv)=0L(\alpha u + \beta v) = 0 for all α,β∈K\alpha, \beta \in K.
  2. If Lu=g1Lu = g_1 and Lv=g2Lv = g_2, then L(αu+βv)=αg1+βg2L(\alpha u + \beta v) = \alpha g_1 + \beta g_2 for all α,β∈K\alpha, \beta \in K.
  3. If Lp=gLp = g, then a sequence uu satisfies Lu=gLu = g if and only if u=p+hu = p + h for a sequence hh with Lh=0Lh = 0.

Remarks

All three parts follow from the linearity of LL: L(αu+βv)=αLu+βLvL(\alpha u + \beta v) = \alpha Lu + \beta Lv, which one checks term by term. For part 3, if Lu=gLu = g then L(u−p)=g−g=0L(u - p) = g - g = 0, and conversely L(p+h)=g+0=gL(p + h) = g + 0 = g. Example: for un+1−2un=1u_{n+1} - 2 u_n = 1, the constant pn=−1p_n = -1 is a particular solution, and the homogeneous solutions are c 2nc\, 2^n, so all solutions are c 2n−1c\, 2^n - 1. Linearity is necessary: for un+1=un2u_{n+1} = u_n^2, the sequence un=1u_n = 1 is a solution, but 2u2u is not, since 2≠42 \ne 4. The same principle holds for linear differential equations; see the superposition principle.

Going deeper

For a student

Part 1 says that the solutions of a homogeneous linear recurrence form a vector space over KK. Since the leading coefficient is 11, the first dd terms determine a solution, by the same induction as in uniqueness given initial values; so this space has dimension dd. Part 3 says that the solutions of the inhomogeneous recurrence form an affine space, a translate of that vector space. This is the base of the method of undetermined coefficients and of variation of parameters for difference equations.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Homogeneous and inhomogeneous linear recurrences concept
  2. Sequence concept
  3. Superposition of solutions statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Superposition_principle
About this page
Tag7W7VV861JW
URIm2://7W7VV861JW
Kindstatement, proposition
WritingW0 stub
MSC39A06
StatusThis copy of the site has no build data. Run m2 status 7W7VV861JW.
AboutHomogeneous and inhomogeneous linear recurrences
UsesHomogeneous and inhomogeneous linear recurrences, Sequence

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.