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.
Interpret the forecasts as best linear prediction from a finite past. For a causal autoregressive process, the innovations are orthogonal to previous observations. If they also have zero conditional mean given the past, the same forecasts are conditional means; white noise by itself guarantees only the linear-prediction interpretation.
Let be the process mean and write its centered autoregression as . Set for , and recursively put
The forecast is a linear combination of the observed last values. Subtracting the recursion from the future autoregression shows that the prediction error is a linear combination of future innovations, hence orthogonal to every observed value. This proves the optimal projection property, rather than merely suggesting that future noise should be replaced by zero. In particular,
The empty sum for is zero. Taking gives the centered convention. This is the recursive forecasts of an autoregressive process construction.
For the stable order-one equation, use its stationary causal solution
The series converges in mean square because and the white noise innovations have a common finite variance . Orthogonality of their distinct time indices gives
Adding the deterministic mean therefore yields weak stationarity for , with
The autocorrelation function assumes ; a zero-variance process has no normalized correlation. A recursion from an arbitrary nonstationary initial value would have transient moments, so the stationary-solution interpretation is important here.
Iteration gives . The innovation sum is orthogonal to the observed past, giving
For the integrated process, the backshift operator subtracts consecutive levels, so . Consequently . If the last increment is observed, substitute its forecast and sum the geometric progression:
This is the forecasts of an integrated AR(1) process formula. Its final term is bounded as , even for negative , hence the forecast's long-run slope is the drift:
With an initial level orthogonal to future innovations, the level formula is also the best linear forecast from the observed levels. Without that initial-level condition, it is the increment-based recursive forecast, and the levels could contain additional predictive information. The level formula uses , or a known when . With just and no model for the initial level, the last increment cannot be recovered from the supplied observations; a one-observation level forecast would need that additional information.