Math 2.0

Difference and functional equations Lemma

A solution of (A-r)f=0 is a geometric sequence fixed by its value at 0

Builds on Shift operator

Statement

Let AA be the shift operator on functions f:ℤ→ℂf:\mathbb{Z}\to\mathbb{C}, so that (Af)(n)=f(n+1)(Af)(n)=f(n+1). Let rr be a nonzero number, and let ff satisfy the operator equation (A−r)f=0(A-r)f=0, that is, f(n+1)=r f(n)f(n+1)=r\,f(n) for all integers nn. Put c=f(0)c=f(0). Then f(n)=c rnf(n)=c\,r^n for every integer nn.

Remarks

The values of ff at nonnegative nn follow from the rule f(n+1)=rf(n)f(n+1)=rf(n) by induction upward from 00. The values at negative nn follow by induction downward from 00, using f(n)=r−1f(n+1)f(n)=r^{-1}f(n+1). This step is where r≠0r\neq 0 is needed. If r=0r=0, the claim can fail: a function with f(0)=cf(0)=c and f(n)=0f(n)=0 for n≥1n\ge 1 is a solution, but its values at negative nn are not fixed by cc.

Reading path

To understand this page from the ground up, read these 2 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. Shift operator concept
  2. A solution of (A-r)f=0 is a geometric sequence fixed by its value at 0 statement

Further reading

  1. Web https://github.com/mitchkeller/applied-combinatorics/blob/ebd95d6bd59e23c633c65cf560bcb93efa912aae/source/s_recurrence_rigorous.ptx#L62, source/s_recurrence_rigorous.ptx:62
About this page
TagGGSHNC4CGZ
URIm2://GGSHNC4CGZ
Kindstatement, lemma
WritingW0 stub
MSC39A06
StatusThis copy of the site has no build data. Run m2 status GGSHNC4CGZ.
UsesShift operator
Changed4 November 2026

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)

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.