For a weakly stationary process with mean and nonzero variance, put and . The function is its autocorrelation function. For observations , one common sample autocorrelation function is
A correlogram plots these estimates against lag; the population analogue plots .
The lag- partial autocorrelation function measures the correlation between and after removing their linear projections on the intervening observations. Its sample counterpart can be calculated by the Yule-Walker equations: solve
and take , assuming the matrix is nonsingular. This defines a standard sample partial autocorrelation function.
For a minimal causal autoregressive model of order , the autocorrelation typically decays geometrically, possibly with damped oscillations, whereas the partial autocorrelation function is zero beyond lag : after those preceding values have been projected out, the innovation is orthogonal to older values. For a moving-average model of order , nonoverlapping sets of driving white noise give for ; its partial autocorrelation function generally tails off when the representation is invertible. Thus an ACF cutoff suggests an MA order; a PACF cutoff suggests an AR order. An ARMA model generally has neither cutoff. These are population properties; sample noise makes cutoffs approximate, so fitted residuals and uncertainty should also be inspected. Under independent white noise, fixed-lag sample correlations have approximate standard error , giving a rough diagnostic band rather than a universal simultaneous test.
Center the five coefficients at lags . Their transfer function is real:
Choosing consecutive causal lags instead only adds a phase and leaves the squared modulus unchanged. After applications, the white noise spectral density has become
Write . Completing the square gives
For , its range is , and its absolute maximum is , attained exactly when . Consequently, on the conventional nonnegative frequency range ,
On the two-sided range there is also a peak at ; the ratio there is one for every . This is a counterexample to the claim if read literally on a signed frequency domain. The correct two-sided exclusion is .
The result illustrates how repeated symmetric filtering can amplify an oscillation. Although preserves a constant component, amplifies period-six oscillations. Repetition selects an increasingly narrow frequency band around those peaks; it does not simply smooth all noise away. In fact the unnormalized output variance eventually grows without bound, since a fixed interval around either peak has .
Difference the local-level state-space model to eliminate its latent level:
Independence and Gaussianity give a stationary Gaussian process with
For , let
These satisfy and . Therefore has the covariance of the moving-average model , where is Gaussian white noise of variance . This is an actual representation, not just covariance matching: define . The convergent inverse filter has constant spectral density , so its Gaussian coordinates are independent, and multiplication by recovers .
Thus
This is the formal ARMA equation with autoregressive coefficient one. Its unit root means that the levels are generally not stationary: if the initial state has finite variance and is independent of future noises, . In stationary-model terminology the correct classification is ARIMA(0,1,1). The requested ARMA description must therefore allow a unit-root equation.
When , the differences are just ; when and , they are , a noninvertible MA(1) with coefficient . If both variances vanish, the model is deterministic apart from a possible initial random level. These limits explain the qualifications on the invertible representation above.
Let . The causality root criterion for an autoregressive model,
is a sufficient condition for a weakly stationary process solution, and gives the causal solution . Indeed is analytic in a disk of radius greater than one, so its Taylor coefficients decay geometrically. The series therefore has mean-square convergence and defines a linear filter of a stationary time series; multiplying by verifies the equation.
For the specified order-two model, put . Since ,
When , its roots are and . Both have modulus greater than one exactly when . The case is white noise and satisfies the same inequality. Consequently
This is the causal stationarity condition selected above. Without causality, a two-sided autoregressive model can also have a noncausal stationary autoregression when its polynomial has no unit-circle zeros. Thus the inequality is not a necessary condition for all conceivable weak stationarity solutions; the causal interpretation is the one required by the subsequent innovations and forecasting questions.
To find the Wold representation, expand . Matching coefficients gives , and . Hence
Here are the Fibonacci numbers. The coefficient formula also follows by partial fractions in the displayed factorization. Absolute summability follows from and . The past observation span equals the past noise span, because the causal series gives one inclusion and gives the reverse inclusion. Thus these noises are the linear innovations, and there is no additional deterministic component. This is the Fibonacci-coefficient autoregression.
The best linear prediction from an infinite past is the orthogonal projection onto the closed span of . Future white noise is orthogonal to that span. Substitution in the recursion therefore gives
The respective errors are and , so their mean squared errors are and . No normal distribution assumption is needed for these linear forecasts.
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.
Differentiate the product of Dirac delta functions defining , regarding and as independent density arguments. The random continuity equation is
For , the causal functional derivatives follow from the explicit strain solution and :
Consequently,
In the Furutsu–Novikov formula, the covariance samples the upper endpoint of the causal time integral. Symmetric regularization of the white noise gives half the mass there. The response vanishes as , while the strain response tends to one, so . Averaging the continuity equation yields the Fokker-Planck equation
There is no direct diffusion term in : its equation contains the time integral of colored noise, whereas the strain equation receives Gaussian white noise. The same result follows from the Itô diffusion with drift and diffusion vector .
Define the autoregressive polynomial and the moving-average polynomial . The standard causality and invertibility root criteria for an ARMA model are
In the usual minimal autoregressive moving-average model, the two polynomials have no common roots. Under that convention, these are the necessary and sufficient root conditions for a causal and invertible representation with the given noise. Without minimality they remain sufficient; shared factors must be considered before claiming necessity.
To see why the conditions work, both ratios and are analytic on a disc of radius greater than one. Their power series coefficients therefore decay geometrically and are absolutely summable. The backshift operator then gives a well-defined mean-square convergent causal time-series representation
Filtering white noise by these fixed coefficients gives a weakly stationary process. The identity verifies the original equation. Multiplication by the absolutely summable inverse of also shows uniqueness among finite-variance stationary solutions. Similarly gives the invertible time-series representation.
Comparing coefficients in derives the first of the ARMA coefficient recursions:
Here for negative , , and for , so in particular . For the inverse filter, compare coefficients in . With , for , for , and for negative indices, this gives
The minus sign in the inverse recursion comes from moving the nonconstant moving-average terms to the other side.
For the first-order model, the standard uncancelled conditions are and . The geometric power series expansions give
Thus the ARMA(1,1) causal and inverse coefficients are
At these give and , including zero-valued parameters without any negative powers. If , the filtered process reduces to and all later coefficients vanish. This common factor cancellation in an ARMA model is why the root inequalities should not be advertised as necessary for every nonminimal parameterization. The stated inequalities still ensure uniqueness for the original equation as well as the desired causal and invertible filters.
The scalar process has zero mean, because white noise has zero mean. Expanding products and retaining only matching noise indices gives its autocovariance function:
The finite second moment and covariance depending only on the lag prove weak stationarity. With the two-sided angular-frequency convention, the spectral density of a stationary process is
It is nonnegative because the bracket is , and it is even because the cosine is even. Hence . No restriction on the real parameter is needed for stationarity here; invertibility is a separate condition.
For the bivariate calculation let , , , and . Uncorrelated white noise processes here means zero cross-covariances at every pair of times. Therefore the vector noise has
The filtered vector is the multivariate moving-average model . Linearity gives . Put , with exactly the orientation of the printed covariance definition. At lag zero, the present and past noise terms are uncorrelated, giving . At lag one the only shared noise is , contributing ; at lag minus one it contributes . Thus the covariance and cross-spectrum of a vector MA(1) are determined by
Explicitly,
In particular the off-diagonal positive- and negative-lag covariances need not coincide. Reading the upper-right entries and taking their Fourier series gives the requested cross-spectrum:
Every coefficient is real, so replacing by conjugates both complex exponentials. Therefore . Unlike the scalar auto-spectrum, this cross-spectrum may be complex and need not be even: its imaginary part is .
A weakly stationary process has finite second moments, a mean independent of , and a covariance depending only on the separation of the observations. Its autocovariance function and autocorrelation function are
where the autocorrelation requires .
Write the autoregressive polynomial as , so the autoregressive model is , with the backshift operator. It is important to distinguish a weakly stationary process from a causal time series: weak stationarity alone does not require to depend only on present and past white noise.
For a two-sided weakly stationary process, the two-sided stationary inverse of an autoregressive polynomial exists and is unique if has no root on the unit circle. To find the excluded parameters, set . The imaginary part of gives
The case is harmless. The possible frequencies are . Since , and , the exceptional parameters are and . Thus, with nondegenerate white noise, the literal two-sided answer is
For completeness, away from those values has an absolutely summable Laurent series on an annulus containing the unit circle. Its bilateral coefficients define an -convergent linear filter of a stationary time series applied to , giving the required solution. Applying the same inverse to the equation gives uniqueness. At an exceptional value, the spectral measure of a stationary time series would have to satisfy . A zero of on the unit circle makes the resulting density nonintegrable near that zero, contradicting finite variance.
If the usual additional causal time series convention is intended, the causality root criterion for an autoregressive model requires the roots of to lie outside the closed unit disk. Equivalently, the roots of lie strictly inside it. The real quadratic stability conditions reduce to and , giving the narrower answer
The printed question does not explicitly impose this extra convention. Both answers have therefore been distinguished. If , the exceptional parameters permit nonunique stationary homogeneous solutions rather than the nonexistence conclusion above.
At ,
Consequently the Wold representation is
The coefficients are absolutely summable, and . The past of lies in the closed linear span of the past white noise; conversely recovers that noise from present and past . Thus is orthogonal to the past of and is its one-step linear prediction error, as required for the Wold decomposition. There is no deterministic component.
Using orthogonality of the white noise, put and calculate the autocovariance by geometric sums:
Hence
In particular, and ; these also satisfy the Yule-Walker equations for this autoregressive model.
Use the two-sided spectral density of a stationary process convention
Thus white noise of variance has density .
Absolute summability makes the linear filter of a stationary time series well defined in : . Its mean is . For its autocovariance, continuity of the inner product gives
The sum is absolutely convergent because . It depends only on , proving weak stationarity. Inserting the spectral inversion formula and exchanging the absolutely dominated sum with the integral yields
Here the coefficients are real, so the two factors are complex conjugates. This is the spectral density transformation under a linear filter.
Applying a second linear filter of a stationary time series gives
The composition of absolutely summable time-series filters can also be calculated directly:
Indeed ; this bound also justifies the interchange of the two sums. The filter gain multiplies under this composition. The sketches for the two individual filters are:
Figure 1.
Ordinary and twelve-step seasonal difference-filter gains
. Details.
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.
The state-space model as printed supplies only uncorrelated white noise. That is insufficient for the claimed normal conditional distributions. For example, take normal, independent process noises taking values equally often, and independent Gaussian observation noises. With and no previous observations, is a two-component shifted mixture distribution, not normal for . Its characteristic function is , which has zeros, whereas a normal characteristic function has none. Similarly a non-Gaussian observation noise prevents the asserted conditional normal law for .
The intended scalar Gaussian Kalman recursion requires and independent of each other and of the previous state and observation history. Assume these Gaussian independence conditions, , , and the given normal filtering law. Conditional on the past, is a sum of independent normals, hence
The new observation noise is independent of and the past, so . Write and . The independent normal pair shows directly that
The covariance comes from the common term. Applying the conditional multivariate normal distribution formula with as the conditioned coordinate gives the Kalman filter update
The final expression verifies nonnegativity of the posterior variance.
For , define
The recursions become and . If , then and, with ,
The nonnegative solution is the steady-state local-level Kalman gain:
For the limit is zero; for it lies strictly between zero and one. These are exact conditional-law results under the additional Gaussian assumptions, not consequences of the weaker printed noise description alone.
For a series with constant mean , write . An autoregressive moving-average process has the form
where is zero-mean white noise with variance . The backshift operator is . Define the autoregressive polynomial and the moving-average polynomial by
The autoregressive operator and moving-average operator give the concise equation
Orders are normally specified minimally, with nonzero last coefficients and no common polynomial factor. A displayed unreduced equation can have larger orders than the process actually needs.
Causality means that the stationary process can be recovered from present and past noise:
Invertibility means that the noise can be recovered from present and past observations:
The causality and invertibility root criteria for an ARMA model, for the reduced representation, are
Indeed the transfer series are and . When all denominator roots lie outside the closed unit disc, each rational function is analytic on a larger disc, so its Taylor coefficients decay geometrically and are absolutely summable. Conversely, a genuine denominator zero in the closed unit disc gives a pole incompatible with such a convergent filter. The reduced-representation proviso prevents a cancelled root from being mistaken for an obstruction.
For order identification by autocorrelation cutoffs, first estimate the sample autocorrelation function and sample partial autocorrelation function from a suitably stationary, centred series. The autocorrelation function is . The lag- partial autocorrelation function is the last coefficient in the best linear regression of on , equivalently the correlation left after removing the intervening lags.
For a pure moving-average model of order , observations more than lags apart share no noise, so the population ACF is zero beyond , while the PACF usually tails off. For a pure autoregressive model of order , the PACF is zero beyond , while the ACF usually decays, possibly with damped oscillation. Thus a clear sample ACF cutoff suggests an MA order and a clear PACF cutoff suggests an AR order. For a mixed ARMA process both usually tail off, so these plots guide a small set of candidate orders rather than determine uniquely. Sampling variation blurs cutoffs; compare fitted candidates and check that their residual ACF resembles white noise. Common-factor cancellation can also disguise the orders in a displayed equation.