Math 2.0

Probability theory and stochastic processes Theorem

Wold's decomposition theorem

Builds on Stationary processHilbert spaceOrthogonal projectionMoving-average model

Statement

Let (Xt)t∈ℤ(X_t)_{t \in \Z} be a real weakly stationary process with mean 00. Let L2L^2 be the Hilbert space of square-integrable random variables. For s∈ℤs \in \Z, let HsH_s be the closed linear span of {Xr:r≤s}\set{X_r : r \le s} in L2L^2. Let PsP_s be the orthogonal projection onto HsH_s. Assume that the one-step prediction error variance σ2=E[(Xt−Pt−1Xt)2]\sigma^2 = E[(X_t - P_{t-1} X_t)^2] is positive. Then Xt=∑j=0∞ψjεt−j+Vtfor all t∈ℤ,X_t = \sum_{j=0}^{\infty} \psi_j \varepsilon_{t-j} + V_t \qquad \text{for all } t \in \Z, where:

  1. εt=Xt−Pt−1Xt\varepsilon_t = X_t - P_{t-1} X_t, and (εt)(\varepsilon_t) is a white noise with variance σ2\sigma^2: mean 00, variance σ2\sigma^2, pairwise uncorrelated.
  2. ψ0=1\psi_0 = 1, ∑j≥0ψj2<∞\sum_{j \ge 0} \psi_j^2 < \infty, and ψj=E[Xtεt−j]/σ2\psi_j = E[X_t \varepsilon_{t-j}] / \sigma^2.
  3. E[εsVt]=0E[\varepsilon_s V_t] = 0 for all s,t∈ℤs, t \in \Z.
  4. VtV_t lies in ⋂s∈ℤHs\bigcap_{s \in \Z} H_s, and (Vt)(V_t) is deterministic: Vt=PsVtV_t = P_{s} V_t for all ss, so it is predicted without error from its own remote past.

The sequences (ψj)(\psi_j), (εt)(\varepsilon_t) and (Vt)(V_t) are uniquely determined by these conditions.

Remarks

The idea is to split HtH_t orthogonally into the innovations εt,εt−1,…\varepsilon_t, \varepsilon_{t-1}, \dots, which are orthogonal to each other, and the remote past ⋂sHs\bigcap_s H_s. The first sum is the projection of XtX_t onto the closed span of the innovations, with coefficients given by inner products. The remainder VtV_t is the projection onto the remote past. The process is called purely nondeterministic when Vt=0V_t = 0; then XtX_t is a moving-average model of infinite order. Example: a causal AR(11) process Xt=ϕXt−1+εtX_t = \phi X_{t-1} + \varepsilon_t with ∣ϕ∣<1\abs{\phi} < 1 has ψj=ϕj\psi_j = \phi^j and Vt=0V_t = 0. Example of a deterministic process: let AA and BB be uncorrelated with mean 00 and variance 11, let 0<λ<π0 < \lambda < \pi, and let Xt=Acos⁡(λt)+Bsin⁡(λt)X_t = A \cos(\lambda t) + B \sin(\lambda t). This process is weakly stationary, and any two consecutive values determine AA and BB, so XtX_t lies in every HsH_s and σ2=0\sigma^2 = 0; the whole process is its own deterministic part. The coefficients ψj\psi_j need not be absolutely summable, and the shocks εt\varepsilon_t are only uncorrelated, not independent in general.

Going deeper

For a student

The theorem justifies the use of linear models, such as ARMA models, for stationary series: they are finite-parameter approximations of the infinite moving average in the decomposition. The innovations εt\varepsilon_t are the one-step prediction errors, which is why residual checks in model fitting test them for whiteness. The proof is pure Hilbert space geometry: only means and covariances enter, so the result says nothing about nonlinear dependence. It was proved by Herman Wold in his 1938 thesis.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Hilbert space concept
  2. Moving-average model concept
  3. Orthogonal projection concept
  4. Stationary process concept
  5. Wold's decomposition theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Wold%27s_theorem
About this page
Tag2ZK4CE9MF8
URIm2://2ZK4CE9MF8
Kindstatement, theorem
WritingW0 stub
MSC60G10, 62M10, 62M20
StatusThis copy of the site has no build data. Run m2 status 2ZK4CE9MF8.
AboutStationary process
UsesStationary process, Hilbert space, Orthogonal projection, Moving-average model
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.