An autoregressive model expresses each observation as a linear function of its
own past plus a white noise shock. We give the exact stationarity condition
through the roots of the characteristic polynomial and the companion matrix,
derive the causal moving-average representation and the Yule-Walker equations
that tie the coefficients to the autocorrelation function, and read off the
exponential decay of the AR(1) and the damped cyclical decay of the AR(2). We
then prove mean reversion of the multistep forecast, compute the AR(1)
half-life, and identify the exactly sampled Ornstein-Uhlenbeck process as a
stationary AR(1), which places the unit root at the boundary of the model class.
An autoregression predicts a series from its own past. It is the workhorse of linear time-series analysis, the model whose autocorrelations decay rather than truncate, dual to the moving average whose autocorrelations cut off. This post builds the AR(p) model from its characteristic polynomial, ties its coefficients to the autocorrelation function, and identifies its continuous-time limit [1], [2].
The series {rt} follows an autoregression of order p if
rt=ϕ0+ϕ1rt−1+⋯+ϕprt−p+at,(1)
where {at} is white noise of variance σ2 and at is uncorrelated with rt−1,rt−2,…. Its characteristic polynomial is ϕ(z)=1−ϕ1z−⋯−ϕpzp.
Taking expectations in Equation (1) under stationarity gives the mean μ=ϕ0/ϕ(1)=ϕ0/(1−ϕ1−⋯−ϕp), and r~t=rt−μ obeys the centered recursion r~t=∑i=1pϕir~t−i+at. Whether a stationary solution exists is decided entirely by the roots of ϕ.
Theorem2
The AR(p) model admits a unique causal weakly stationary solution if and only if every root of ϕ(z)=0 lies outside the unit circle, equivalently every eigenvalue of the companion matrix lies inside it.
Proof
Take p=1 first. Iterating r~t=ϕ1r~t−1+at gives r~t=∑i=0nϕ1iat−i+ϕ1n+1r~t−n−1. The sum converges in mean square as n→∞ precisely when ∣ϕ1∣<1, since E[(∑iϕ1iat−i)2]=σ2∑iϕ12i=σ2/(1−ϕ12) is finite exactly then, and the residual ϕ1n+1r~t−n−1 vanishes in L2. The single root of ϕ(z)=1−ϕ1z is z=1/ϕ1, outside the unit circle iff ∣ϕ1∣<1.
For general p, stack Rt=(r~t,r~t−1,…,r~t−p+1)⊤ and et=(at,0,…,0)⊤. Then Equation (1) is the first-order recursion Rt=ΦRt−1+et with the p×p companion matrix whose first row is (ϕ1,…,ϕp) and whose subdiagonal is the identity. Iterating gives Rt=∑i≥0Φiet−i, whose L2 norm is bounded by σ∑i≥0∥Φi∥. By Gelfand's formula ∥Φi∥1/i→ϱ(Φ), so the series converges in L2 iff the spectral radius ϱ(Φ)<1. Expanding the companion determinant along its first row gives det(zI−Φ)=zp−ϕ1zp−1−⋯−ϕp, and the substitution z=1/w yields the exact identity det((1/w)I−Φ)=w−pϕ(w), so the eigenvalues of Φ are precisely the reciprocals of the roots of ϕ. Hence ϱ(Φ)<1 iff every root of ϕ lies outside the unit circle, and the stationary causal solution is the first component of Rt[3].
The first component of the companion sum reads r~t=∑j≥0(Φj)11at−j, an infinite moving average r~t=∑j≥0ψjat−j with ψj=(Φj)11. The weights follow directly from inverting the polynomial. Writing ϕ(B)ψ(B)=1 in the backshift operator and equating the coefficient of Bj,
ψ0=1,ψj=i=1∑pϕiψj−i(j≥1),(2)
with ψj−i=0 for j<i. Under Theorem 2 these decay at rate ϱ(Φ)<1, so a remote shock has vanishing influence. This is the linear representation the autocorrelation post assumed, now produced explicitly from the AR coefficients.
The same coefficients tie directly to the autocorrelations.
Theorem3
For a stationary AR(p), the autocovariances satisfy γℓ=∑i=1pϕiγℓ−i for ℓ>0, and hence
ρℓ=i=1∑pϕiρℓ−i,ℓ>0.(3)
Proof
Multiply the centered recursion by r~t−ℓ and take expectations. Since at is uncorrelated with r~t−ℓ for ℓ>0, the shock term drops, leaving γℓ=∑i=1pϕiγℓ−i. Dividing by γ0 gives Equation (3). The case ℓ=0 adds the shock variance, γ0=∑i=1pϕiγi+σ2.
Two cases carry the intuition. The AR(1) autocorrelation solves ρℓ=ϕ1ρℓ−1 from ρ0=1, giving pure geometric decay ρℓ=ϕ1ℓ, positive and monotone for ϕ1>0 and alternating for ϕ1<0. The AR(2) is richer.
Proposition4
For a stationary AR(2), ρ1=ϕ1/(1−ϕ2) and ρℓ solves ρℓ=ϕ1ρℓ−1+ϕ2ρℓ−2. The roots of the recursion are real when ϕ12+4ϕ2≥0, giving a mixture of two exponential decays, and a complex conjugate pair of modulus −ϕ2 when ϕ12+4ϕ2<0, giving a damped sinusoid with stochastic period
k=cos−1(ϕ1/(2−ϕ2))2π.(4)
Proof
Setting ℓ=1 in Equation (3) and using ρ−1=ρ1 gives ρ1=ϕ1+ϕ2ρ1, hence ρ1=ϕ1/(1−ϕ2). The recursion has characteristic equation x2−ϕ1x−ϕ2=0 with roots x1,2=21(ϕ1±ϕ12+4ϕ2) and product x1x2=−ϕ2. When ϕ12+4ϕ2≥0 the roots are real and ρℓ=c1x1ℓ+c2x2ℓ is a mixture of two exponentials. When ϕ12+4ϕ2<0 they are a conjugate pair x=∣x∣e±iθ of modulus ∣x∣=x1x2=−ϕ2 and argument cosθ=Re(x)/∣x∣=ϕ1/(2−ϕ2), so the real solution ρℓ∝∣x∣ℓcos(ℓθ+φ) oscillates with period 2π/θ, which is Equation (4).
Complex roots are the mechanism behind cyclical, business-cycle-like autocorrelation from a purely linear model. Order identification uses the dual truncation established earlier, the ACF decaying while the partial autocorrelation cuts off at lag p.
The spectral density is the Fourier transform of the autocovariances, f(ω)=2π1∑ℓγℓe−iℓω. For the linear process r~t=ψ(B)at the autocorrelation post gives γℓ=σ2∑jψjψj+ℓ, so, substituting m=j+ℓ to factorise the double sum,
Since ψ(z)=1/ϕ(z) from Equation (2), ∣ψ(e−iω)∣2=∣ϕ(e−iω)∣−2.
White noise has the flat spectrum σ2/2π, and the autoregression shapes it by the inverse squared gain of ϕ. For the complex-root AR(2) the denominator ∣ϕ(e−iω)∣2 is smallest near the cycle frequency θ of Proposition 4, so f peaks there, the frequency-domain image of the damped sinusoid in the autocorrelations. Integrating the spectrum returns the variance, γ0=∫−ππf(ω)dω=σ2∑j≥0ψj2.
Because at is uncorrelated with the regressors rt−1,…,rt−p, conditional least squares of rt on its lags is consistent and, under Gaussian shocks, equals the conditional maximum-likelihood estimator. Alternatively the Yule-Walker estimator substitutes the sample autocorrelations into Equation (3) and solves the linear system, which the Durbin-Levinson recursion of the autocorrelation post does in O(p) work while delivering the partial autocorrelations for free. The order p is chosen where the sample PACF truncates or an information criterion is minimised [2].
Taking E[⋅∣Fh] in Equation (1) at time h+ℓ and using E[ah+ℓ∣Fh]=0 gives the recursion. From the causal representation, the error is eh(ℓ)=∑j=0ℓ−1ψjah+ℓ−j, so Var[eh(ℓ)]=σ2∑j=0ℓ−1ψj2, which rises to σ2∑j≥0ψj2=γ0. Since ψj→0 under stationarity, the forecast r^h(ℓ)=μ+∑j≥ℓψjah+ℓ−j tends to μ.
The series forgets its origin and returns to its mean, and the forecast variance saturates at the unconditional variance. For the AR(1), r^h(ℓ)−μ=ϕ1ℓ(rh−μ), so the deviation halves over the half-life ℓ=ln(0.5)/ln∣ϕ1∣, the discrete counterpart of a continuous decay rate.
The AR(1) is the exact discretisation of a familiar diffusion.
Proposition7
Sampling the Ornstein-Uhlenbeck process drt=κ(θ−rt)dt+σcdWt at a fixed step Δ>0 yields a stationary AR(1) with ϕ1=e−κΔ and shock variance σ2=σc2(1−e−2κΔ)/(2κ).
Proof
The exact solution over [t,t+Δ] is rt+Δ=θ(1−e−κΔ)+e−κΔrt+∫tt+Δe−κ(t+Δ−s)σcdWs. The stochastic integral is Gaussian, independent across disjoint steps, with mean zero and variance σc2∫0Δe−2κudu=σc2(1−e−2κΔ)/(2κ). This is Equation (1) at p=1 with ϕ0=θ(1−e−κΔ) and ϕ1=e−κΔ, and κ>0 forces ϕ1∈(0,1), so the sampled process is stationary.
As κ↓0 the mean reversion weakens and ϕ1↑1. At ϕ1=1 the root of ϕ sits on the unit circle, Theorem 2 fails, and the model becomes the random walk, whose shocks are permanent and whose variance diverges with time. That boundary is where autoregression leaves the stationary world and unit-root nonstationarity begins.
An autoregression is thus the linear-dependence engine of time series. Its characteristic roots decide stationarity and set the tempo, geometric for real roots and cyclical for complex ones. The Yule-Walker equations read its coefficients off the autocorrelation function, forecasts revert to the mean at a rate the roots fix, and the Ornstein-Uhlenbeck process is its continuous shadow. Push the dominant root to the unit circle and the same algebra opens onto nonstationarity, cointegration, and the error-correction structure behind statistical arbitrage.
[1]
R. S. Tsay, Analysis of Financial Time Series, 3rd ed. Wiley, 2010.
[2]
G. E. P. Box, G. M. Jenkins, and G. C. Reinsel, Time Series Analysis: Forecasting and Control, 3rd ed. Prentice Hall, 1994.
[3]
P. J. Brockwell and R. A. Davis, Time Series: Theory and Methods, 2nd ed. Springer, 1991.