The autocovariance vanishes beyond lag . For an ordinary consecutive sum, variance of a sum givesThe last sum is finite. For , . Counting all coefficient pairs givesFor 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 isThis 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.
Articles by others on the same topic
There are currently no matching articles.