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.
Linear innovation process Created 2026-10-06 Updated 2026-10-14
For a square-integrable time series, let be the closed linear span of its past. The innovation is orthogonal to every past linear observation. A causal invertible autoregressive moving-average model is driven by these innovations, which are weak white noise for a weakly stationary process.
Moving-average process of order one Created 2026-09-28 Updated 2026-10-14
A moving-average process of order one has the form
with centered white noise of finite positive variance . Each disturbance enters the current observation with weight and the next observation with weight , then leaves the filter. It is a weakly stationary process for every real : the mean is and the autocovariance of an MA(1) process depends only on lag. Strong white noise additionally makes it a strictly stationary process. No restriction is needed for stationarity.
For a worked observation calculation, take , , and consecutive noise values , , . Then and ; the same disturbance appears in both. If , the variance is , the lag-one autocovariance is , and the lag-one autocorrelation is . All higher-lag autocorrelations vanish, as shown in autocorrelation.
An MA(1) is useful for brief dependence caused by overlapping disturbances or measurements. Its name refers to a weighted moving sum of noise; its weights need not be positive or sum to one, and it differs from the data smoother in seasonal extraction by a centred moving average. Under strong white noise, observations more than one interval apart depend on disjoint independent noise families and are independent. Under weak white noise, the same cutoff establishes only uncorrelated random variables.
Invertibility of a moving-average model is a separate question: can the specified driving noise be recovered by a stable linear filter of present and past observations? For an MA(1) the answer, with the absolutely summable filter convention, is exactly :
Thus gives a stationary MA(1) that is not invertible in this sense. At it is still stationary, but the inverse coefficients are not absolutely summable. The case is simply shifted white noise. See Bartlett, lecture 5: MA(1) and stable invertibility.
Put and define the autoregressive polynomial and moving-average polynomial by
For a minimal, coprime ARMA representation, the usual simultaneous causality and invertibility root criteria for an ARMA model are
The autoregressive condition makes a stable one-sided filter and gives the causal second-order stationary process. The moving-average condition makes its inverse a stable one-sided filter, so the white noise can be reconstructed from present and past observations. If the two polynomials have a common factor, first use common factor cancellation in an ARMA model; necessary-and-sufficient root statements apply to the reduced noise-driven representation. Stationarity here is second-order stationarity; weak white noise alone does not assert strict stationarity of all finite-dimensional laws.
For , write , so . Expanding gives the Wold representation
In particular , for , and for . The coefficients are square-summable, so this series converges in mean square. Causality and invertibility identify the driver with the linear innovation process, justifying the Wold terminology. For , powers with exponent zero equal one and the formula reduces to the finite moving average.
To obtain the covariance equations, subtract and take covariance with . Orthogonality of the white noise and the causal expansion imply
Thus the innovation coefficients of an ARMA(1,q) process give the entire triangular system in one formula:
At , use , since the autocovariance of a real stationary process is symmetric. The terms are consequently at zero, at , and the intervening partial sums as required.
For , put and . The equations become
Substitution of the second into the first, followed by the geometric recursion, yields the autocovariance of a causal ARMA(1,1) process:
This includes : only lags survive, as for an MA(1) process.
For an autoregressive moving-average model, the driving-to-output transfer function is , and the inverse transfer function is . The causality and invertibility root criteria for an ARMA model require these respective rational functions to have power series about zero converging on a disk larger than the unit disk. If the two polynomials have no common factor, the conditions become
Indeed, outside-disk roots leave a radius of convergence greater than one, so the coefficients decay geometrically and are absolutely summable. Conversely an uncancelled pole inside or on the unit disk prevents the required stable power series. If factors are common, apply the criterion after cancellation, to the noise-driven solution rather than additional homogeneous components. The backshift operator translates these power series into the desired one-sided filters.
The original representation has and , with roots and . There is no cancellation. Hence it is neither causal nor invertible relative to its specified driving noise. Stationarity is nevertheless possible through a two-sided solution: expanding the autoregressive inverse in negative powers gives
This is an anticausal time series representation with square-summable coefficients.
To establish the alternative representation on the same process, define
The inverse of is a stable one-sided filter. For , the identities and give
The time-series spectral density of is ; therefore the defined has constant time-series spectral density . Its mean is zero, its variance is , and all its nonzero-lag autocovariances vanish. It is thus weak white noise. Its definition directly gives
This root reflection of an ARMA representation has roots , so is causal and invertible. A constant spectrum proves whiteness, not independence of non-Gaussian coordinates; no Gaussian assumption is needed for the required white noise representation.
For best linear prediction from an infinite past, let be the closed linear span of with . The causal representation expresses every such in present and past values, while invertibility puts every with in . In particular is orthogonal to . The representation at time one then gives the orthogonal projection
Consequently the best linear predictor and its error variance are
Orthogonality proves optimality among linear predictors in the closed past span, without asserting that the predictor must be the conditional mean for a non-Gaussian process.
For a real weakly stationary process, extend its autocovariance by . The exact existence of a time-series spectral density condition is that its spectral measure of a stationary time series be absolutely continuous with respect to Lebesgue measure. Absolute summability is a useful sufficient condition, not a necessary one.
We use the conventional angular-frequency density on , restricted to by symmetry. Under the absolute-summability condition, the Fourier series and its inverse relation are
Thus . If a one-sided density is instead normalized to integrate to the full variance, use and omit the factor two in the inverse formula. This is the positive-frequency spectral normalization convention difference. With merely an integrable spectral density, the inverse relation remains valid; one must not assume pointwise convergence of the unweighted Fourier series. Its Fejér sums recover the density in :
If and are independent stationary processes, the cross covariances vanish, so
Linearity of the inverse Fourier series relation, or addition of the spectral measures of a stationary time series, gives . Independence can in fact be weakened to zero cross-covariances at every lag.
For the ARMA representation, away from an uncancelled unit root the transfer function gives
The usual causal case has ; the same expression holds for the two-sided stationary solution when . We work in the nondegenerate case and ; cancellations and zero-noise cases are obtained by the appropriate reduced representation or limits. Since independent white noise of variance contributes , put
Then
The white-noise addition to an ARMA(1,1) process problem is therefore the factorization
Define
Both are positive under the stated nondegeneracy conditions. An invertible choice is
These satisfy , , and . Hence
In particular, it is the autoregressive coefficient that enters the terms from the added observation noise.
To obtain a representation of the actual , define
The stable inverse exists because , and spectral filtering gives . Thus is weak white noise, and
Its variance can equivalently be written
When , also ; when , necessarily and , so the latter quotient should not be used. The model may reduce in order through cancellation. Boundary limits with or give and need not be stably invertible; the displayed stable reconstruction applies to the nondegenerate case above.
Here the innovation process consists of linear innovations, the linear one-step prediction errors: , where is the closed linear span of the past 's in . For Gaussian processes this is also the conditional expectation prediction error. For general non-Gaussian strong white noise these two notions can differ.
The given is not the linear innovation process. The moving-average factor has its zero at , inside the unit disk, and is noninvertible as a causal moving-average filter. The identity
is the moving-average root reflection that places this zero outside the unit disk. Thus the causal invertible representation has innovation variance , rather than the given variance .
For an explicit verification, define
The filter has constant squared modulus , so is weak white noise with variance . The new moving-average factor has root and is invertible, while its autoregressive factor is causal. Hence the past spans of and agree, and belongs to that past span. Orthogonality of to past therefore identifies it as the linear innovation process. The variance difference proves that it cannot be . If the original noise is Gaussian, the new linear innovations are independent Gaussian variables; without Gaussianity they need only be uncorrelated random variables.
Reflecting zeros across the unit circle can convert a noncausal or noninvertible ARMA representation to a causal invertible one with the same time-series spectral density. Scale the driving white noise variance according to the modulus factors. Define the new noise as a filter of the actual process; equality of two spectra alone proves equality of second-order structure, not equality of non-Gaussian laws. The resulting noise is weak white noise and need not be independent across time.
For the state-space model , , assume independent Gaussian process noise and measurement noise of variances , independent of the prior state and previous observations. A normal distribution for the filtered state, with mean and variance , predicts mean and variance . Here denotes predicted state variance, rather than the observation-noise covariance notation used in the vector equations above. Gaussian conditional expectation then gives posterior mean and posterior variance , where the Kalman gain is .
Mere weak white noise assumptions do not imply normal posterior distributions: independent process noise with a Rademacher distribution makes the next state a mixture of two shifted normal distributions. The Kalman filter can still describe a best affine state estimate under appropriate second-order assumptions, but that is distinct from an exact Gaussian conditional law.
Weakly stationary process Created 2026-09-28 Updated 2026-10-14
A real stochastic process is a weakly stationary process if it has finite second moments, a constant expected value , and an autocovariance depending only on the lag of a time series:
In particular its variance is the same at every time, . This is often called second-order stationarity. It makes observations from different parts of a record comparable through the same autocorrelation function. Bartlett uses this second-order meaning of stationarity in Introduction to Time Series Analysis, lecture 2: mean, covariance, and stationarity.
For a worked contrast, let be centered white noise of variance . The process has mean , variance , and zero autocovariance at nonzero lags, so it is weakly stationary. The process has exactly the same covariance structure, but its mean is , so it is not weakly stationary. Constant variance alone is insufficient.
Weak stationarity need not imply strict stationarity. For example, choose independent random variables at all integer times, using a standard normal distribution at even times and a Rademacher distribution at odd times. Every coordinate has zero mean and unit variance, and distinct coordinates have zero covariance. Nevertheless a shift by one changes the marginal probability distribution from continuous to two-point. This also illustrates why weak white noise need not be identically distributed.
White noise Created 2026-09-28 Updated 2026-10-14
For the AR(1) and MA(1) formulas here, white noise means a real sequence indexed by all integer times with
These are the weak white noise assumptions: zero mean, a common finite positive variance, and uncorrelated random variables at distinct times. Independence and a normal distribution are additional assumptions. Strong white noise requires independent and identically distributed random variables; discrete Gaussian white noise is the jointly Gaussian special case. Some definitions allow a constant nonzero mean; subtract it before using the centered formulas here.
For a concrete dependent example, let equal or with equal probabilities, independently of a sequence of independent Rademacher random variables , and put . Its mean is zero, its variance is , and its nonzero-lag autocovariances vanish. Nevertheless every equals the same : seeing one magnitude determines all the others. This is white noise with dependence invisible to its ACF, and is also an example of the issue discussed in ergodic stationary process.
Adding independent white noise of variance to a process with transfer function and driving variance gives numerator in its rational time-series spectral density. Put and . If both are positive, the invertible moving-average factor has coefficient and driving variance . Filtering the actual sum by produces its weak white noise driver.