Closed form for recurrence relations- A long battle
I am almost morally obligated to write this post. While preparing for Math Olympiads, I came across the closed form formula for linear recurrence relations pretty often. However, I never quite came across *any* source that explained *why* this worked. And in the 6 years since, I’ve looked far and wide. However today, in my first College Combinatorics class, I think I finally understood why this works.
Let . Along with this, we also have the initial conditions .
Let us assume that there exists a geometric sequence which satisfies the same relation! We have no information about initial conditions. Just a geometric sequence. To make things more explicit, I’d like to point out that the initial conditions are probably completely different from those mentioned before. Let this geometric sequence be of the form . Plugging these powers of in the recurrence relation above, we solve for the roots of the degree polynomial. We get complex roots, possibly repeated.
Say the distinct roots that we get are , where . Each root satisfies the recurrence relation. Hence, so does , where . This can be checked directly by plugging his linear combination in the recurrence relation above.
Now we determine the values of the ‘s by assuming that satisfies the initial conditions given above. Remember that these initial conditions give rise to a *unique* sequence that satisfies the recurrence relation. Hence, if we can get values of ‘s that make satisfy each initial condition, then we’re done. Does this always work out? Do we always get unique values for the ‘s? Only when the system of equations we generate is consistent. As soon as we get values for ‘s that satisfy this system of equations, it is easy to see that we’ve gotten the closed form function we wanted.
This method is analogous to a gamble. We assume that the desired closed form function is a linear combination of geometric sequences. If it indeed is, we’ll get values for the ‘s. If it is not, we shall not get consistent values for the ‘s. What is important to note that if we do get consistent values for the ‘s, then this is our desired closed form. We don’t need to check for any more conditions. Because a recurrence relation with dependant terms (in that ) and initial conditions is unique.