Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 X be weakly stationary and let (Xt,ϵt) satisfy the normalized coprime ARMA(p,q) equation of Linear processes, white noise, and ARMA models, with centered white noise of variance σ2>0. A causal representation with absolutely summable one-sided coefficients exists if and only if ϕ(z)≠0 for every ∣z∣≤1. In that case its coefficients are uniquely determined by Ψ(z):=∑j≥0ψjzj=θ(z)ϕ(z),∣z∣≤1, and there are constants C<∞ and r>1 with ∣ψj∣≤Cr−j.

An invertible representation with absolutely summable one-sided coefficients exists if and only if θ(z)≠0 for every ∣z∣≤1. Its coefficients are uniquely determined by Π(z):=∑j≥0πjzj=ϕ(z)θ(z),∣z∣≤1. The two criteria are separate: neither condition assumes the other.

Facts & Assumptions

Given: A weakly stationary real solution of the normalized coprime ARMA equation ϕ(B)(Xt−μ)=θ(B)ϵt, real polynomials ϕ(0)=θ(0)=1, and centered white noise with 0<σ2=E[ϵt2]<∞.

[F1]

Linear processes, white noise, and ARMA models: a causal representation is an L2 one-sided filter Xt−μ=∑j≥0ψjϵt−j with ∑j∣ψj∣<∞; invertibility is an L2 representation ϵt=∑j≥0πj(Xt−j−μ) with ∑j∣πj∣<∞. The polynomials are normalized and have no common complex root.

[F2]

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.

[F3]

Absolutely summable linear filters preserve weak stationarity: absolutely summable filters are well-defined in L2 and compose by convolution. Applied to white noise, a filter with coefficients a∈ℓ1(N0) has variance σ2∑j≥0aj2.

[F4]

Every nonconstant polynomial in C[x] splits into linear factors: every nonconstant complex polynomial factors into linear terms over C.

Proof

Proof technique: compare filter coefficients against nondegenerate white noise for necessity; expand reciprocal polynomials into geometric series for sufficiency.

1.1F1F3givenalgebra

Suppose a causal representation exists, with Ψ(z)=∑j≥0ψjzj and ∑j∣ψj∣<∞. Applying the finite polynomial ϕ(B) and using the ARMA equation gives (ϕ(B)Ψ(B)−θ(B))ϵt=0. The coefficient sequence a of ϕΨ−θ is in ℓ1 because ϕ,θ are finite polynomials and ψ∈ℓ1. By [F3], the variance of this zero random variable is σ2∑j≥0aj2. Since σ2>0, every aj=0, so ϕ(z)Ψ(z)=θ(z) on the closed unit disk; the series for Ψ converges uniformly there because ∑j∣ψj∣<∞.

1.2F4givenalgebra

Suppose ϕ has degree m≥1 and roots r1,…,rm counted with multiplicity. None is zero because ϕ(0)=1. By [F4] and normalization, ϕ(z)=∏ℓ=1m(1−z/rℓ). If every ∣rℓ∣>1, then for ∣z∣≤1 each factor has the geometric expansion (1−z/rℓ)−1=∑k≥0rℓ−kzk. The coefficient of zj in 1/ϕ(z) has absolute value at most (j+m−1m−1)r∗−j, where r∗=min⁡ℓ∣rℓ∣>1, since there are (j+m−1m−1) nonnegative m-tuples summing to j. Choose 1<r<r∗. The polynomial factor (j+m−1m−1)(r/r∗)j is bounded in j, so these coefficients are bounded by Cr−j. Multiplication by the finite polynomial θ preserves an exponential bound. If m=0, ϕ=1 and θ/ϕ is finite, which also has an exponential bound after enlarging C. Thus η(z):=1/ϕ(z) and Ψ(z):=η(z)θ(z)=θ(z)/ϕ(z) have absolutely summable one-sided coefficients, and those of Ψ have the stated exponential decay.

1.3F1F2F3givenalgebra

Suppose an invertible representation exists, ϵt=π(B)(Xt−μ) with π∈ℓ1(N0). Apply the finite filter ϕ(B) and commute the absolutely summable and polynomial filters by [F3] on the weakly stationary process [F2]: ϕ(B)ϵt=ϕ(B)π(B)(Xt−μ)=π(B)ϕ(B)(Xt−μ)=π(B)θ(B)ϵt. The coefficient sequence of ϕ−πθ is in ℓ1. Its filter of white noise is zero, so [F3] and σ2>0 imply every coefficient is zero. The absolutely summable series Π converges uniformly on the closed unit disk, so the coefficient identity yields ϕ(z)=Π(z)θ(z) for ∣z∣≤1.

2.1F1step 1.1algebra

If ϕ(z0)=0 for some ∣z0∣≤1, step 1.1 gives θ(z0)=ϕ(z0)Ψ(z0)=0. This is a common root, contrary to the coprime condition in [F1]. Therefore causality implies that ϕ has no zero in the closed unit disk.

2.2F1F2F3step 1.2algebra

Let η(z)=1/ϕ(z) be the absolutely summable causal series from step 1.2. Apply the filter η(B) to the given equation. Since X−μ is weakly stationary, [F2] and [F3] justify composition and η∗ϕ is the constant coefficient sequence 1. Therefore Xt−μ=η(B)ϕ(B)(Xt−μ)=η(B)θ(B)ϵt=Ψ(B)ϵt. This is the required causal representation of the given solution.

2.3F1step 1.3algebra

If θ(z0)=0 for some ∣z0∣≤1, step 1.3 gives ϕ(z0)=Π(z0)θ(z0)=0, contradicting coprimality. Hence invertibility implies that θ has no zero in the closed unit disk.

2.4F1F2F3F4givenstep 1.2algebra

If θ has no zero in ∣z∣≤1, the same geometric-series argument as in step 1.2 applied to its roots gives an absolutely summable causal series η(z)=1/θ(z). Set Π(z)=η(z)ϕ(z); its coefficients are absolutely summable. Applying η(B) to the ARMA equation and using filter composition [F3] on the weakly stationary process [F2] gives Π(B)(Xt−μ)=η(B)ϕ(B)(Xt−μ)=η(B)θ(B)ϵt=ϵt. Thus the model is invertible.

3.1step 1.1step 1.2step 2.1step 2.2step 1.3step 2.3step 2.4∎

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