ProofComplete

Generating Functions - Key Proof

The Fibonacci generating function demonstrates how recurrence relations translate into functional equations, enabling extraction of closed formulas.

DefinitionFibonacci Generating Function

The ordinary generating function for the Fibonacci sequence is: F(x)=n=0Fnxn=x1xx2F(x) = \sum_{n=0}^{\infty} F_n x^n = \frac{x}{1-x-x^2}

Proof:

The Fibonacci sequence satisfies Fn=Fn1+Fn2F_n = F_{n-1} + F_{n-2} for n2n \geq 2, with F0=0F_0 = 0 and F1=1F_1 = 1.

Let F(x)=n=0FnxnF(x) = \sum_{n=0}^{\infty} F_n x^n. Multiply the recurrence by xnx^n and sum from n=2n = 2 to \infty: n=2Fnxn=n=2Fn1xn+n=2Fn2xn\sum_{n=2}^{\infty} F_n x^n = \sum_{n=2}^{\infty} F_{n-1} x^n + \sum_{n=2}^{\infty} F_{n-2} x^n

The left side is F(x)F0F1x=F(x)xF(x) - F_0 - F_1 x = F(x) - x.

For the right side: n=2Fn1xn=xn=2Fn1xn1=xm=1Fmxm=x(F(x)F0)=xF(x)\sum_{n=2}^{\infty} F_{n-1} x^n = x \sum_{n=2}^{\infty} F_{n-1} x^{n-1} = x \sum_{m=1}^{\infty} F_m x^m = x(F(x) - F_0) = xF(x)

n=2Fn2xn=x2n=2Fn2xn2=x2k=0Fkxk=x2F(x)\sum_{n=2}^{\infty} F_{n-2} x^n = x^2 \sum_{n=2}^{\infty} F_{n-2} x^{n-2} = x^2 \sum_{k=0}^{\infty} F_k x^k = x^2 F(x)

Therefore: F(x)x=xF(x)+x2F(x)F(x) - x = xF(x) + x^2F(x) F(x)(1xx2)=xF(x)(1 - x - x^2) = x F(x)=x1xx2F(x) = \frac{x}{1-x-x^2}

Extracting Binet's Formula:

Factor the denominator: 1xx2=(xϕ)(xϕ^)1 - x - x^2 = -(x-\phi)(x-\hat{\phi}) where ϕ=1+52\phi = \frac{1+\sqrt{5}}{2} and ϕ^=152\hat{\phi} = \frac{1-\sqrt{5}}{2} are roots of x2=x+1x^2 = x + 1, or equivalently, 1=x+x21 = x + x^2.

Actually, solving 1xx2=01 - x - x^2 = 0 gives x=1±52x = \frac{-1 \pm \sqrt{5}}{2}, so the roots are ϕ^-\hat{\phi} and ϕ-\phi. We can write: 1xx2=(1ϕx)(1ϕ^x)(ϕϕ^)1 - x - x^2 = (1 - \phi x)(1 - \hat{\phi} x) \cdot (-\phi\hat{\phi})

Note that ϕϕ^=1+52152=154=1\phi \cdot \hat{\phi} = \frac{1+\sqrt{5}}{2} \cdot \frac{1-\sqrt{5}}{2} = \frac{1-5}{4} = -1.

So: 1xx2=(1/ϕ)(1/ϕ^)(1ϕx)(1ϕ^x)=(1)(1ϕx)(1ϕ^x)=(1ϕx)(1ϕ^x)1 - x - x^2 = -(1/\phi)(1/\hat{\phi})(1 - \phi x)(1 - \hat{\phi} x) = -(-1)(1 - \phi x)(1 - \hat{\phi} x) = (1-\phi x)(1-\hat{\phi}x)

Wait, let me recalculate. If rr is a root of r2=r+1r^2 = r + 1, then 1=r+r21 = r + r^2, so 1rr2=01 - r - r^2 = 0. The polynomial 1xx21 - x - x^2 has roots where x=ϕx = \phi and x=ϕ^x = \hat{\phi}... Actually, I need to be more careful.

The characteristic equation of Fn=Fn1+Fn2F_n = F_{n-1} + F_{n-2} is r2=r+1r^2 = r + 1, with roots ϕ\phi and ϕ^\hat{\phi}.

For the generating function denominator 1xx21 - x - x^2, setting equal to zero: x2+x1=0x^2 + x - 1 = 0, giving x=1±52x = \frac{-1 \pm \sqrt{5}}{2}. These are ϕ^-\hat{\phi} and 1/ϕ-1/\phi (since 1/ϕ=ϕ1=ϕ^1/\phi = \phi - 1 = \hat{\phi} from ϕ2=ϕ+1\phi^2 = \phi + 1).

Using partial fractions: x1xx2=x(1ϕx)(1ϕ^x)=A1ϕx+B1ϕ^x\frac{x}{1-x-x^2} = \frac{x}{(1-\phi x)(1-\hat{\phi}x)} = \frac{A}{1-\phi x} + \frac{B}{1-\hat{\phi}x}

Solving: A=15A = \frac{1}{\sqrt{5}} and B=15B = -\frac{1}{\sqrt{5}}.

Therefore: F(x)=15(11ϕx11ϕ^x)=15n=0(ϕnϕ^n)xnF(x) = \frac{1}{\sqrt{5}} \left(\frac{1}{1-\phi x} - \frac{1}{1-\hat{\phi}x}\right) = \frac{1}{\sqrt{5}} \sum_{n=0}^{\infty} (\phi^n - \hat{\phi}^n) x^n

Comparing coefficients: Fn=ϕnϕ^n5F_n = \frac{\phi^n - \hat{\phi}^n}{\sqrt{5}}, which is Binet's formula. \square

Remark

This derivation illustrates the power of generating functions to bridge recurrences and closed forms. The generating function encodes all sequence values simultaneously, and algebraic manipulation reveals the underlying structure. This method generalizes to any linear recurrence with constant coefficients, always producing rational generating functions whose partial fraction decompositions yield closed formulas.