White-Noise Covariance in Double Sums of a Linear Process
Summary
The document explains how the covariance of two white-noise terms collapses a double sum. Since distinct white-noise observations have zero covariance and matching observations have variance equal to the noise variance, only terms satisfying the matching-index condition remain. For an infinite sum, this produces a single sum of products of coefficients separated by the lag, scaled by the noise variance. For a finite sum, the matching term contributes only when its index falls within the summation bounds.
This derivation addresses the questioner’s confusion about an added lag-times-variance term. It does not produce such an additive term: the resulting expression is a coefficient-product sum. The equality in the question, which instead shows a sum of squared coefficients plus a lag-dependent term, is not established by the covariance calculation shown. Care is also needed because the displayed question and the answer use different sum bounds; the finite-bound indicator condition makes that restriction explicit.
Key ideas
- White-noise covariance is zero for distinct time indices and equals the noise variance for matching indices.
- The matching condition removes the inner sum by selecting the coefficient indexed at the lagged position.
- An infinite double sum becomes a single sum of lag-separated coefficient products, scaled by the noise variance.
- For finite bounds, a matching term contributes only when its index lies within the range.
- The derivation does not yield an additive lag-times-variance term as posed in the question.
Tags
Full text
# Answer by ir7 (score 3, accepted)
# Help understanding the step $\sum_{j=0}^n\sum_{k=0}^ng_jg_k\text{Cov}(\epsilon_{n-1},\epsilon_{n+h-k})=\sum_{j=0}^ng_j^2+h\sigma^2$
Given is that $\epsilon_n$ is a white noise process with $\text{Var}(\epsilon_n)=\sigma^2$ and that $g_j\in\mathbb{R}$. There is a step in my lecture notes that I don't get. It says the following
$$\sum_{j=0}^n\sum_{k=0}^ng_jg_k\text{Cov}(\epsilon_{n-j},\epsilon_{n+h-k})=\sum_{j=0}^ng_j^2+h\sigma^2 \quad \text{for} \quad h\ge0,$$
with the motivation "need $k=h+j$ otherwise the covariance is zero, we use this to remove the sum over $k$".
I understand that the sum over $k$ gets removed and that we want to avoid zero covariance, but how does $+h\sigma^2$ pop up? Doing the substitution $k=h+j$ then the covariance is just the variance which is onl $\sigma^2$ (no $h$), and then it's multiplied to the sum and not added.
## Answer by ir7 (score 3, accepted)
https://quant.stackexchange.com/a/63452
$${\rm Cov} (\epsilon_{n-j}, \epsilon_{n+h-k}) =\gamma (h-k+j) = \sigma^2 1_{k=h+j} $$
where $1_A$ is the indicator function, set to $1$ if statement $A$ is true, and set to $0$ otherwise.
So the double summation is:
$$ \sum_{j=0}^\infty\sum_{k=0}^{\infty}g_jg_k\text{Cov}(\epsilon_{n-j},\epsilon_{n+h-k})$$ $$ = \sum_{j=0}^{\infty}\sum_{k=0}^{\infty} g_jg_k \sigma^2 1_{k=h+j} $$ $$= \sum_{j=0}^{\infty} g_jg_{h+j} \sigma^2 $$
as
$$ \sum_{k=0}^{\infty} g_jg_k \sigma^2 1_{k=h+j} = g_jg_{h+j} \sigma^2 $$
As $k$ runs from $0$ to $\infty$, the terms in the last summation are $0$ except when $k$ hits $h+j$, which will happen for any given, but fixed, $h$.
If the summation is finite, $k$ runs from $0$ to $n$, then
$$ \sum_{k=0}^{n} g_jg_k \sigma^2 1_{k=h+j} = g_jg_{h+j} \sigma^2 1_{h+j \leq n}$$Shown in full with attribution under the source's licence. Licence: CC BY-SA 4.0 (Stack Exchange)
This summary was written by Stratmill's research agent from the original; it is not a copy of the source.