ARMA(1,1) causal and inverse coefficients 2026-10-14
For and , the autoregressive moving-average model has and the displayed coefficients for . These follow by multiplying the two geometric power series. If , all later coefficients vanish and the filtered process is white noise. Thus root restrictions on an uncancelled nonminimal representation are sufficient but need not be necessary for the process after common factor cancellation in an ARMA model.
ARMA coefficient recursions 2026-10-14
For an autoregressive moving-average model, set and . If both have no zeros on the closed unit disc, the causal and inverse filters have absolutely summable coefficients and . Comparing power series coefficients gives and , where , for , and all out-of-range coefficients vanish. The backshift operator then gives the corresponding time-series filters.
For a causal autoregressive moving-average model driven by independent white noise, multiply its recursion by and take covariance. When , all driving white noise values in its moving-average term occur strictly after , so their covariances with vanish. The resulting homogeneous tail recurrence has the same characteristic roots as the autoregressive model recursion. Distinct roots of modulus below one give exponential autocovariance decay.
Autoregressive integrated moving average 2026-10-14
An ARIMA model applies an autoregressive moving-average model to the differenced process , where is the backshift operator. Differencing permits stochastic trends whose levels are not weakly stationary processes. A local random-walk level observed with independent measurement white noise has an ARIMA(0,1,1) representation, or a formal ARMA(1,1) equation with autoregressive coefficient one.
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.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 40 6 Solution Created 2026-10-03 Updated 2026-10-14
A linear filter of a stationary time series with real coefficients satisfying is . Its filter generating function is the Laurent series , absolutely convergent on , and its filter transfer function is . For a one-sided filter this is a power series; a general two-sided filter need not converge on a larger annulus.
The filter theorem states that if is second-order stationary, then exists in mean square, is second-order stationary, and has mean and covarianceIts spectral measure of a stationary time series is . In particular, if has a time-series spectral density in the convention , thenTo prove existence, the norm of a tail of the filter is at most times the sum of the omitted , which tends to zero. Hence finite partial sums converge in . Expectations and covariances pass to the limit, and the covariance double sum is absolutely convergent because . Its formula depends only on , proving stationarity. Insert the spectral representation of and interchange sums and integration; the bound justifies the interchange. The resulting factor is . This proves the spectral statement, including the spectral density transformation under a linear filter without assuming that the input autocovariances are absolutely summable.
For an autoregressive moving-average model, use real polynomials normalized by and first work with the reduced noise-driven representation. If has no zero on the unit circle, the rational function has a Laurent expansion in an annulus containing that circle, with absolutely summable coefficients. Filtering the white noise with it gives a stationary solution. Its time-series spectral density isConversely, for coprime , a unit-circle zero of would make this ratio nonintegrable, since the numerator does not vanish there; thus there is no finite-variance stationary noise-driven solution. A stationary solution can use a bilateral filter when autoregressive roots lie inside the unit circle. The stronger causal condition, meaning dependence only on present and past noise, requires every zero of strictly outside the unit disk. Common factors must be handled before applying these conditions; a cancelled unit-root factor can also allow additional deterministic stationary components, which are outside the minimal noise-driven convention.
Identifiability means that different admissible parameters cannot produce the same stationary process law. In this zero-mean Gaussian setting, its law is determined by its covariance, equivalently its spectrum. Unrestricted ARMA coefficients are not identifiable from that law: if a moving-average factor has root inside the disk, then on ,Reflecting the root outside and multiplying the innovation variance by preserves the spectrum, and therefore the Gaussian law. Common polynomial factors and arbitrary overall scaling give further redundancy. A regular canonical identifiable parameterization requires constant coefficients one, coprime polynomials of their stated minimal orders, all zeros of both and outside the closed unit disk, and .
Here is a proof of canonical identifiability of Gaussian ARMA models. Suppose two such models have equal spectra and write their innovation standard deviations as . The ratio and its reciprocal are analytic on a neighbourhood of the closed unit disk, with modulus one on its boundary. The maximum modulus principle applied to both makes throughout the disk, so is constant. Its value at zero is the positive number , forcing and . Therefore ; coprimality and the normalization at zero force equality of both polynomials. This proves the claimed parameter uniqueness within that canonical class.
In this class, is analytic on a disk of radius greater than one. Its Taylor series coefficients are absolutely summable, soThis is an invertible time-series representation, proved by composition of the stable filters. Causality makes orthogonal to past observations; invertibility makes past noises recoverable from past observations. Their closed past linear spans agree, so this noise is the linear innovation and the one-sided expansion is the Wold representation. Mere stationarity without the stated canonical restrictions does not imply invertibility of the originally written noise representation.
For this one-sided canonical representation, . Comparing coefficients gives the ARMA coefficient recursionsThus for exactly the range asked for,The characteristic rates are reciprocals of the zeros of . Partial fractions therefore express the tail as sums of , where and the degree of is at most one less than the corresponding root multiplicity. Hence the coefficients decay exponentially, with possible polynomial and damped oscillatory factors. If , they instead vanish after . For a noncausal or noninvertible original specification, the Wold coefficients refer to the canonical spectral factor; using the original driving noise as the Wold innovation without checking these restrictions would be incorrect.
The autocovariance is . Analyticity of on a disk of radius gives for a slightly smaller radius than its first pole, and consequently . Moreover, multiply the ARMA equation at time by and take expectations. For , all noises with are later than and orthogonal to it. For this givesThe covariance tail therefore has the same characteristic exponential rates and multiplicity patterns as the filter coefficients, subject to possible cancellation of amplitudes. Pure moving averages have an exact covariance cutoff.
For the final process, factor the polynomials:The common factor has its zero at , so it can be cancelled as a stable filter. Explicitly, let ; the original equation gives . The second moments of are uniformly bounded because those of and are. Iterating gives , whose norm tends to zero as , so in mean square. ThusSumming the covariance series givesThe process is a causal stationary autoregressive process of order one, with alternating-sign geometric correlations, and is invertible. The displayed ARMA(2,1) description is nonminimal because of its common factor; its minimal identifiable class is ARMA(1,0).
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 43 6 Solution Created 2026-10-03 Updated 2026-10-14
For the usual causal, stable autoregressive moving-average model with zero-mean white noise, sufficient conditions for a stationary invertible representation areThe roots of and then lie outside the closed unit disc. For a minimal representation these are the usual causality and invertibility root criteria for an ARMA model. A genuinely minimal ARMA(1,1) additionally has nonzero coefficients and no cancellation ; if a coefficient vanishes the order is lower. Common factors can reduce the process to white noise, so inequalities on an unreduced representation should not be asserted as necessary for every reduced process. A noncausal stationary solution of an unstable autoregressive equation is a different representation, and does not give the requested innovation-based Wold coefficients below.
Using the backshift operator , write . The absolutely summable geometric series givesThus the Wold representation isIts coefficients are square-summable, so the series converges in mean square and defines a weakly stationary process. Invertibility makes the closed spans of past observations and past innovations equal. Since the current driving white noise is orthogonal to all past innovations, it is orthogonal to all past observations and is the linear innovation of this causal invertible process.
The spectral density of an ARMA process follows from the squared frequency response of the linear filter of a stationary time series:This displayed density uses the usual two-sided convention. For the one-sided spectral density used in Question 5, multiply it by two and restrict to .
Let and for . Orthogonality of the driving white noise gives for . HenceFor , separate the term and sum the remaining geometric series:Negative lags satisfy . With , interpret the lag-one factor as one and later powers as zero, recovering the MA(1) covariance.
To express prediction entirely through observations, invert the moving-average factor:The best linear predictor from the whole past is thereforeIndeed is orthogonal to the closed linear span of the past. For any other past-measurable linear predictor , the mean squared error decomposes as , establishing optimality and error variance . The result only uses second-order properties; identifying this linear predictor with a full conditional expectation requires stronger assumptions such as independent innovations or joint Gaussianity. In the cancellation case within the stable range, , the off-zero covariances and predictor vanish, and the spectrum is constant.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 48 1 Solution Created 2026-10-03 Updated 2026-10-14
Define the autoregressive polynomial and the moving-average polynomial . The standard causality and invertibility root criteria for an ARMA model areIn 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 representationFiltering 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 givesThe 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 giveThus the ARMA(1,1) causal and inverse coefficients areAt 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.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 38 1 iii Solution Created 2026-10-03 Updated 2026-10-07
In the usual causal stationary convention, a centered autoregressive moving-average model satisfiesSet and . After removal of common factors, the usual causality condition is that all zeros of lie outside the closed unit disk. Then has an absolutely summable causal coefficient sequence, giving a linear-filter representation of in terms of white noise. Invertibility of the moving-average part is a separate issue and is not needed for its covariance spectrum.
White noise has one-sided density . Applying the filtering result, or equating the spectra of the two filtered sides of the defining equation, givesThe moving-average sign agrees with the positive convention used later. More generally, the same quotient applies to a stationary two-sided solution when the reduced denominator has no unit-circle zeros; causality selects the past-dependent realization. This is the spectral density of an ARMA process.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 29 1 Solution 2026-10-07
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 becomeIndeed, 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 givesThis is an anticausal time series representation with square-summable coefficients.
To establish the alternative representation on the same process, defineThe inverse of is a stable one-sided filter. For , the identities and giveThe 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 givesThis 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 projectionConsequently the best linear predictor and its error variance areOrthogonality 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.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 36 1 b Solution Created 2026-10-03 Updated 2026-10-06
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 isThese 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 isThe frequency convention makes the normalization unambiguous.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 37 2 b Solution Created 2026-10-03 Updated 2026-10-06
Two useful features of autoregressive conditional heteroscedasticity are persistent changes in conditional scale and excess unconditional kurtosis. Its time-varying conditional variance can explain volatility clustering, where large absolute returns occur in groups even when signed returns have little autocorrelation. A homoscedastic autoregressive moving-average model has a fixed innovation variance.
Also, a conditional normal distribution with a random scale is a Gaussian scale mixture. Its unconditional kurtosis can exceed , or its fourth moment can be infinite. A Gaussian autoregressive moving-average model remains jointly Gaussian and cannot reproduce this effect. In the particular lag-two ARCH process, persistence of the squared scale occurs within each parity subsequence; the two parity subsequences are independent.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 37 3 b Solution Created 2026-10-03 Updated 2026-10-06
Use the sample autocorrelation function and sample partial autocorrelation function to look for approximate cutoffs. For a minimal causal autoregressive model of order , the partial autocorrelation function is zero beyond , while the autocorrelation function usually tails off, possibly with damped oscillation. For an invertible moving-average model of order , the autocorrelation function is zero beyond , while the partial autocorrelation function tails off. In a mixed autoregressive moving-average model, both generally tail off.
Thus the last visibly nonzero partial correlation suggests an autoregressive order, and the last visibly nonzero autocorrelation suggests a moving-average order. Finite samples do not produce exact zeros. Approximate white-noise reference bands can help flag clearly nonzero lags, but they are not universal confidence intervals for arbitrary correlated processes. Fit a few suggested orders and check residual autocorrelation, rather than treating these plots as a proof of the model order. This is order identification by autocorrelation cutoffs.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 208 1 1 2 Solution Created 2026-10-03 Updated 2026-10-06
For the spectral questions take the unique weakly stationary process solving the equation, as is customary for a stable autoregressive moving-average model. The equation alone also admits nonstationary solutions differing by , for which a spectral density of a stationary process need not exist. Let be the backshift operator. Since the autoregressive root is , the stationary solution is causal andUsing the convention , the spectral density of a stationary process isThe stationary mean is zero, since .
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 208 1 1 4 Solution Created 2026-10-03 Updated 2026-10-06
The root-reflected, invertible autoregressive moving-average model isThis follows by multiplying the filter identity for by . Its moving-average root and autoregressive root are both outside the unit disk. Thus it is the representation in terms of the innovation process, rather than merely another noise representation with the same spectrum.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 208 2 1 Solution Created 2026-10-03 Updated 2026-10-06
For a causal autoregressive model of order , the population partial autocorrelation function cuts off after lag , whereas the autocorrelation function generally decays. For an invertible moving-average model of order , the autocorrelation function cuts off after lag , whereas the partial correlation coefficients generally decay. For a mixed autoregressive moving-average model, both generally decay. Exponential decay may alternate in sign or show damped oscillations. Sample correlation coefficients only approximate these patterns, so isolated crossings of the significance bands are not exact order tests.
In PDF Figure 1, the autocorrelation function alternates sign, with a large negative lag-one correlation coefficient and geometrically decreasing magnitude. The partial autocorrelation function has essentially one substantial spike, negative at lag one and about ; later values mostly lie within the displayed bands. Thus a stationary AR(1) with a negative coefficient is the natural first model, with initially near . The trace fluctuates around an approximately constant mean and shows no evident deterministic trend.
Fit that model, compare nearby low-order alternatives using likelihood function and an Akaike information criterion or Bayesian information criterion, and inspect the residual autocorrelation function and residual variance. A few small later PACF spikes are expected in a plot with many lags. The roughly white noise bands are a guide, rather than simultaneous guarantees for every lag.
The sign alternation also suggests concentration of spectral power near the high-frequency end: the AR(1) denominator is smallest near when . From estimated and lag-one correlation coefficient one can estimate innovation variance as . The persistence parameter controls the decay rate and long-run variance of a stationary process. These plots do not establish a normal distribution, independence, or the absence of nonlinear dependence; correlation coefficients of squared residuals can provide a separate variance diagnostic.
For an autoregressive moving-average model of order , this state has observation row and transition matrixThe state noise is . Its first transition row reconstructs and its third row shifts the previous white noise value.