Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2010/iii/paper-39/1/a/solution

For the autoregressive process of order one, the formula at reads , with an empty sum. If it holds at time , substitution into the recursion gives
Thus mathematical induction proves
No restriction such as is needed for this finite-time identity.

New to topics? Read the docs here!