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.
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.
Among the supplied candidates, choose ARMA(2,1). It has the smallest Akaike information criterion. Relative to ARMA(2,2), its AIC improvement is ; the additional second moving-average estimate is only half a standard error from zero and increases the log likelihood function by only about . Dropping it is a reasonable parsimony choice, although that AIC gap is small. ARMA(1,1) has AIC larger by , a much clearer loss of fit. In the chosen model the second autoregressive term is about seven standard errors from zero, so it should not be dropped merely to obtain order one. The first autoregressive term is less precisely estimated; this does not justify automatically deleting it without fitting and comparing the reduced candidate.
Using the usual positive-sign moving-average convention, the fitted autoregressive moving-average model is
These are plug-in values rounded as given, not exact population parameters. The model has zero mean. Its polynomials are and .
With angular frequency , so that the autocovariance is , the spectral density of a stationary process is
The frequency convention makes the normalization unambiguous.
A noncausal stationary autoregression exists. On the two-sided time axis define
This series converges in the sense of mean-square convergence, and direct subtraction gives . The expected value and autocovariance are
Consequently this is a weakly stationary process and, by Gaussianity, a strictly stationary process. It is an example of noncausal stationary autoregression, since uses future noise. In particular, is correlated with , so the usual causal variance recursion is inapplicable. If an additional assumption required the driving noise to be independent of past observations, this solution would be excluded; that assumption is not stated here.
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.
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.
The autocovariance vanishes beyond lag . For an ordinary consecutive sum, variance of a sum gives
The last sum is finite. For , . Counting all coefficient pairs gives
For the odd-indexed sample the lag- autocovariance is , so the same finite-sum argument gives . Only coefficient pairs of the same parity contribute. If and , the odd-subsample limit is
This is the odd-subsample long-run variance of a moving average. Equivalently it is in the cycles convention. Under the printed invertibility assumption and positive noise variance, the polynomial is nonzero at both and , so both limits are positive. The same formulas also hold without invertibility, when cancellations can make a limit zero.
First, the absolute values in the printed limit are an error: the correct long-run variance of a stationary process is the signed sum of autocovariances. Directly,
so
Each coefficient tends to and has absolute value at most . Absolute summability and the dominated convergence theorem therefore give
The sum of absolute values is an upper bound, not the general limit. For a concrete counterexample to the printed assertion, take with unit-variance iid noise. Then , , and other covariances vanish. The absolute sum is , but , so .
For correlated data the central limit theorem can still hold under suitable strong mixing of a stationary process and moment conditions, but the limiting variance is the long-run variance of a stationary process, rather than the one-observation variance. When it is positive,
Positive serial dependence usually increases the standard error, while negative dependence can reduce it. The approximate effective sample size of a stationary sample is when that denominator is positive. A long-memory time series can require a different normalization or a different limit law. Absolute covariance summability alone does not prove a CLT: if with a common independent random scale taking values and with equal probabilities and iid with the standard normal distribution, the off-diagonal covariances are zero, yet has the nonnormal scale-mixture law . The example is not an ergodic stationary process. If the long-run variance of a stationary process is zero, the usual nondegenerate square-root- CLT is unavailable.
For the causal AR(1), and
The conditional distribution follows because the current innovation is independent of the past.
For a fixed known , condition on the observed and use the transitions . Their conditional maximum likelihood criterion is, up to constants,
Differentiating in yields
Since ,
Thus it is an unbiased estimator, even conditionally on , and
It has statistical consistency with mean-square convergence, and the iid-noise strong law of large numbers also gives almost-sure statistical consistency. Its conditional distribution is exactly normal with the displayed mean and variance. If is also observed and all transitions are used, replace by .
The fixed- qualification is necessary for the exact finite-sample claims. If is jointly estimated, conditional likelihood function is linear regression with an intercept: writing and , the unconstrained estimators are
This ratio is not generally an unbiased estimator and does not have the preceding finite-sample variance. Under the usual stationary regression conditions it has statistical consistency; its asymptotic variance is . Indeed, it differs from by , an asymptotically negligible endpoint term. Profiling an unknown innovation variance does not change the fixed- estimate of .
For a weakly stationary process, every observation has the same finite expectation . Linearity of expectation, without any assumption of independence, gives
The variance is a sum of all pairwise covariances:
For a real-valued weakly stationary process, the autocovariance is even. There are pairs at lag zero and pairs in each direction at positive lag . Therefore
Positive autocovariances inflate the uncertainty relative to the independent-observation formula; negative terms may reduce it. An unbiased estimator need not have variance tending to zero: a process consisting of the same random variable at every time is weakly stationary, but averaging cannot reduce its variance.
A zero-mean autoregressive process of order one satisfies
where is white noise with variance . A causal time series uses present and past innovations only. For the series
has mean-square convergence because , and it supplies the causal weakly stationary process. Its variance is . For , only the common innovations contribute to the autocovariance:
Evenness then gives
When , the signs alternate; when , the process is white noise. With nondegenerate innovations, does not give a causal finite-variance stationary solution. These covariance calculations need uncorrelated innovations, not Gaussianity; Gaussian innovations additionally yield a Gaussian process.
The selected model is a moving-average process of order one, with the plus-sign convention used by R:
The Gaussian likelihood function models innovations as independent . Its autocovariance is , , and zero at larger lags, with autocorrelation . The estimated coefficient has modulus less than one, giving invertibility of a moving-average model; a finite moving-average process is stationary regardless of this invertibility restriction.
The original plots show fluctuations around a roughly constant level, no persuasive deterministic trend, and a conspicuous positive lag-one correlation with the other plotted correlations within the approximate sampling bands. They make a stationary nonseasonal working model reasonable for this short series. stationary=TRUE excludes differenced alternatives, and seasonal=FALSE excludes seasonal ARIMA terms. Neither option is proved by a 60-day plot: annual temperature seasonality cannot be excluded from two months, and a longer record or residual diagnostics might require a different model. The options are reasonable local simplifications, not universal statements about temperature dynamics.
Use the stationary autoregressive process of order one
Multiplication by and expectation, using independence of the innovation from the past, gives the autocovariance equation . With , define the sample autocovariances using the same denominator:
Substitution into that equation gives the Yule–Walker estimator for an autoregressive process of order one
This is exactly the lag-one sample autocorrelation function under the divisor- convention, provided the sample has positive variance. Using different divisors for different lags would change the estimator.
For unit-variance innovations, orthogonality to the past gives
Consequently and . Replacing autocovariance by matched sample estimates yields seasonal regression estimators. The unit innovation variance is necessary to identify the noise scale separately.
Short-memory time series 2026-10-06
In a second-order sense a weakly stationary process has short memory when its autocovariance is absolutely summable. Then its spectral density of a stationary process is continuous and its sample-mean variance has the usual finite long-run variance of a stationary process. A central limit theorem still needs additional conditions.