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.
A real weakly stationary process has finite second moments, a time-independent mean , and autocovariance function depending only on the lag. Use the angular-frequency convention
The time-series spectral density is nonnegative and integrates to . The displayed Fourier series is ordinarily justified by . More generally, weak stationarity gives a spectral measure of a stationary time series, not necessarily a spectral density. If a spectral density exists without this summability, its Fourier inversion can be understood using Fejér sums, which converge in and at its Lebesgue points. Thus spectral density existence should not be inferred from weak stationarity alone.
A white noise process has mean zero and . Neither independence nor a normal distribution is needed for this second-order definition. Its autocovariance function is zero at nonzero lags, so
For a real absolutely summable filter , the series defining has mean-square convergence: its tails have norm at most . Its mean is , and
The sum is absolutely convergent, since by the Cauchy-Schwarz inequality. It depends only on , proving that the output is a weakly stationary process. Substitute the spectral integral for and interchange the sums and integral, justified by and . This gives
Because the coefficients are real, the two factors are complex conjugates. Hence the spectral density transformation under a linear filter is
For complex coefficients the same formula holds with the conjugate-covariance convention.
Applying this result to the order-two moving-average model yields
Equivalently, its nonzero autocovariances are , and , together with .
For the order-one moving-average process, invert its filter by a geometric series. The required coefficients are
They are absolutely summable for . Direct cancellation gives
with mean-square convergence. Thus the inverse filter recovers exactly the original white noise process, including its variance; it is an invertible time-series representation.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact