Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2015/iii/paper-37/3/e/solution

The autocovariance vanishes beyond lag . For an ordinary consecutive sum, variance of a sum gives
The last sum is finite. For , . Counting all coefficient pairs gives
For the odd-indexed sample the lag- autocovariance is , so the same finite-sum argument gives . Only coefficient pairs of the same parity contribute. If and , the odd-subsample limit is
This is the odd-subsample long-run variance of a moving average. Equivalently it is in the cycles convention. Under the printed invertibility assumption and positive noise variance, the polynomial is nonzero at both and , so both limits are positive. The same formulas also hold without invertibility, when cancellations can make a limit zero.

New to topics? Read the docs here!