For the stationary causal AR(1) with , matching terms in its infinite moving-average representation gives, for ,
Symmetry of the autocovariance extends this to negative lags. Dividing by gives the autocorrelation . The geometric series explains both the enlarged stationary variance and the diminishing memory: all past disturbances contribute to the present, but their squared weights have a finite sum. At , the process reduces to shifted white noise and all nonzero-lag autocorrelations vanish. See Bartlett, lecture 4: AR(1) representation and mean-square convergence.
Autoregressive process of order one Created 2026-09-28 Updated 2026-10-14
An autoregressive process of order one obeys
where is real and is centered white noise of variance . The zero-mean version is ; in the affine form , the stationary mean satisfies .
For , its unique weakly stationary process solution on all integer times is the causal time-series representation
The sum converges in the sense of mean-square convergence because . It is an infinite moving-average representation using only present and past driving noise. Weak white noise suffices for this second-order conclusion; strong white noise also gives strict stationarity. The autocovariance of an AR(1) process is , so its variance is and its ACF is . See Bartlett, lecture 5: AR(1) representation and causality.
The appeal of an AR(1) is that one coefficient expresses how a deviation persists. For , disturbances propagate with weights . For , these weights alternate sign. With , , and , the recursive forecasts of an autoregressive process give and one and two steps ahead. If , the stationary variance is , while the one-step forecast error variance is only . Under weak white noise these are best linear forecasts; independent driving noise also makes them conditional expectations given the observed past.
The condition describes a stationary causal solution, not every finite recursion with those coefficients. Starting from a prescribed value gives the transient in finite initialization of an AR(1) process. Nor is it a condition for all possible two-sided stationary solutions: when , noncausal stationary autoregression uses future driving noise. See stationary versus causal solution of a two-sided AR(1) equation for the boundary cases.
The inverse autoregressive polynomial is an analytic function on a disk larger than the unit disk. The Cauchy estimate gives exponentially decaying coefficients of its infinite moving-average representation. Summing their products gives for some .
A linear process is an L2-convergent white-noise filter , with square-summable coefficients. It is weakly stationary, and its autocovariance is . A causal representation restricts the coefficients to ; it is then an infinite moving-average representation.
A stationary causal time series exists. The infinite moving-average representation
converges in the sense of mean-square convergence because the driving variables are independent random variables and . Shifting the series gives . Its expected value is zero and its autocovariance is
Thus it is a weakly stationary process; since the driving variables have a normal distribution, it is also a Gaussian process and a strictly stationary process. Throughout the stationarity discussion, take ; degenerate zero noise permits trivial constant solutions.
For a stationary linear autoregression, causal time series means that the observation uses only current and past driving noise:
This is a convergent in the sense of mean-square convergence infinite moving-average representation. The stronger usual stable-filter definition requires absolute summability; the argument below also handles the square-summable definition. Let and . Substituting the filter into the recurrence and comparing coefficients of the orthogonal noise gives and . Hence
The Cauchy-Schwarz inequality ensures that is an analytic function in this disk. Thus has no zero strictly inside it. A boundary zero is also impossible: a zero of multiplicity at makes at least a constant times near that point. Its integral over diverges as . On the other hand, orthogonality of complex exponentials gives
a contradiction. Therefore the causality root criterion for an autoregressive model is
Under absolute summability, the shorter boundary argument is continuity of on the closed disk and the identity there.
By the causality root criterion for an autoregressive model, choose smaller than the modulus of every root of . The function is an analytic function on and inside . Writing , the Cauchy estimate gives . For , independence of the noise in the infinite moving-average representation gives
The autocovariance is symmetric in the lag. Thus exponential decay holds with
This is exponential autocovariance decay of a causal autoregression. If is constant, there are no roots and any works.
Expanding the stable autoregressive inverse gives the infinite moving-average representation in linear innovations:
Therefore
For comparison, the causal representation in the originally supplied noise is
Both converge in , since their coefficients are square summable. The second is causal, but its driving noise is not the linear innovation process.