How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
ARMA causality and invertibility root criteria
Statement
Let be weakly stationary and let satisfy the normalized coprime ARMA equation of Linear processes, white noise, and ARMA models, with centered white noise of variance . A causal representation with absolutely summable one-sided coefficients exists if and only if for every . In that case its coefficients are uniquely determined by and there are constants and with .
An invertible representation with absolutely summable one-sided coefficients exists if and only if for every . Its coefficients are uniquely determined by The two criteria are separate: neither condition assumes the other.
Facts & Assumptions
Given: A weakly stationary real solution of the normalized coprime ARMA equation , real polynomials , and centered white noise with .
Linear processes, white noise, and ARMA models: a causal representation is an one-sided filter with ; invertibility is an representation with . The polynomials are normalized and have no common complex root.
Strict and weak stationarity for integer-indexed time series: weak stationarity supplies finite second moments, constant mean, and lag-only autocovariance; these hypotheses make the absolutely summable filter operations applicable to the given solution.
Absolutely summable linear filters preserve weak stationarity: absolutely summable filters are well-defined in and compose by convolution. Applied to white noise, a filter with coefficients has variance .
Every nonconstant polynomial in splits into linear factors: every nonconstant complex polynomial factors into linear terms over .
Proof
Proof technique: compare filter coefficients against nondegenerate white noise for necessity; expand reciprocal polynomials into geometric series for sufficiency.
Suppose a causal representation exists, with and . Applying the finite polynomial and using the ARMA equation gives The coefficient sequence of is in because are finite polynomials and . By [F3], the variance of this zero random variable is . Since , every , so on the closed unit disk; the series for converges uniformly there because .
Suppose has degree and roots counted with multiplicity. None is zero because . By [F4] and normalization, If every , then for each factor has the geometric expansion The coefficient of in has absolute value at most , where , since there are nonnegative -tuples summing to . Choose . The polynomial factor is bounded in , so these coefficients are bounded by . Multiplication by the finite polynomial preserves an exponential bound. If , and is finite, which also has an exponential bound after enlarging . Thus and have absolutely summable one-sided coefficients, and those of have the stated exponential decay.
Suppose an invertible representation exists, with . Apply the finite filter and commute the absolutely summable and polynomial filters by [F3] on the weakly stationary process [F2]: The coefficient sequence of is in . Its filter of white noise is zero, so [F3] and imply every coefficient is zero. The absolutely summable series converges uniformly on the closed unit disk, so the coefficient identity yields for .
If for some , step 1.1 gives . This is a common root, contrary to the coprime condition in [F1]. Therefore causality implies that has no zero in the closed unit disk.
Let be the absolutely summable causal series from step 1.2. Apply the filter to the given equation. Since is weakly stationary, [F2] and [F3] justify composition and is the constant coefficient sequence . Therefore This is the required causal representation of the given solution.
If for some , step 1.3 gives , contradicting coprimality. Hence invertibility implies that has no zero in the closed unit disk.
If has no zero in , the same geometric-series argument as in step 1.2 applied to its roots gives an absolutely summable causal series . Set ; its coefficients are absolutely summable. Applying to the ARMA equation and using filter composition [F3] on the weakly stationary process [F2] gives Thus the model is invertible.
Steps 1.1, 1.2, 2.1, and 2.2 prove both directions of the causal criterion and identify its coefficients; steps 1.3, 2.3, and 2.4 prove both directions of the invertibility criterion and identify its coefficients. The proof uses no choice axiom.
Depends on
Used by
Dependency tree · two levels
17 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Dewei Wang, STAT 720 Time Series Analysis, Theorems 3.1–3.2 (standard reference, not scraped)
- Nicolai Meinshausen, Time Series Analysis: Notes for the course HS 2022, Sections 2.1–2.5 (standard reference, not scraped)