Solution (source code)

= Solution

Define the <autoregressive polynomial> $\Phi(z)=1-\sum_{k=1}^p\phi_kz^k$ and the <moving-average polynomial> $\Theta(z)=1+\sum_{k=1}^q\theta_kz^k$. The standard <causality and invertibility root criteria for an ARMA model> are
$$
\boxed{\Phi(z)\ne0\text{ and }\Theta(z)\ne0\quad\text{for every }|z|\leq1.}
$$
In 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 $C(z)=\Theta(z)/\Phi(z)$ and $D(z)=\Phi(z)/\Theta(z)$ are analytic on a disc of radius greater than one. Their <power series> coefficients therefore decay geometrically and are absolutely summable. The <backshift operator> $BX_t=X_{t-1}$ then gives a well-defined mean-square convergent <causal time-series representation>
$$
X_t=C(B)\epsilon_t=\sum_{j\geq0}c_j\epsilon_{t-j}.
$$
Filtering <white noise> by these fixed coefficients gives a <weakly stationary process>. The identity $\Phi(B)C(B)=\Theta(B)$ verifies the original equation. Multiplication by the absolutely summable inverse of $\Phi(B)$ also shows uniqueness among finite-variance stationary solutions. Similarly $D(B)X_t=\epsilon_t$ gives the <invertible time-series representation>.

Comparing coefficients in $\Phi(z)C(z)=\Theta(z)$ derives the first of the <ARMA coefficient recursions>:
$$
\boxed{c_j=\theta_j+\sum_{k=1}^p\phi_kc_{j-k}\quad(j\geq0).}
$$
Here $c_j=0$ for negative $j$, $\theta_0=1$, and $\theta_j=0$ for $j>q$, so in particular $c_0=1$. For the inverse filter, compare coefficients in $\Theta(z)D(z)=\Phi(z)$. With $a_0=1$, $a_j=-\phi_j$ for $1\leq j\leq p$, $a_j=0$ for $j>p$, and $d_j=0$ for negative indices, this gives
$$
\boxed{d_j=a_j-\sum_{k=1}^q\theta_kd_{j-k}\quad(j\geq0),\qquad d_0=1.}
$$
The 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 $|\phi|<1$ and $|\theta|<1$. The geometric <power series> expansions give
$$
\frac{1+\theta z}{1-\phi z}=1+(\phi+\theta)\sum_{j\geq1}\phi^{j-1}z^j,\qquad\frac{1-\phi z}{1+\theta z}=1-(\phi+\theta)\sum_{j\geq1}(-\theta)^{j-1}z^j.
$$
Thus the <ARMA(1,1) causal and inverse coefficients> are
$$
\boxed{c_0=d_0=1,\qquad c_j=(\phi+\theta)\phi^{j-1},\qquad d_j=-(\phi+\theta)(-\theta)^{j-1}\quad(j\geq1).}
$$
At $j=1$ these give $c_1=\phi+\theta$ and $d_1=-(\phi+\theta)$, including zero-valued parameters without any negative powers. If $\theta=-\phi$, the filtered process reduces to $X_t=\epsilon_t$ 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.