Proof.
We apply Theorem
![[*]](crossref.png)
with
 |
(10) |
Thus we have
 |
(11) |
Observe that this matrix is left-invertible modulo

if and only if

are relatively prime modulo

.
Indeed, the matrix

is left-invertible modulo

iff there exists
a matrix
such that

, that is
 |
(12) |
We prove now the claim of the theorem.
Assume we have computed

such that

and

hold.
We want to compute

.
Let

be such that
 |
(13) |
We look for

such that
 |
(14) |
Following the proof of Theorem
![[*]](crossref.png)
we are led to solve the equation
 |
(15) |
A solution of this equation is
 |
(16) |
This proves the claim of the theorem.
Proof.
By induction on

.
The clain is clear for

.
So let us assume it is true for

and consider monic polynomials
![$ g^{({\ell}+1)}, h^{({\ell}+1)} \in R[x]$](img83.png)
satisfying
 |
(18) |
and
 |
(19) |
Such polynomials

exist
by Theorem
3.
(The fact that they can be chosen monic is left to the reader
as an exercise.)
Observe that we have
 |
(20) |
So the induction hypothesis leads to
 |
(21) |
Hence there exist polynomials
![$ q_g, q_h \in (R/m)[x]$](img89.png)
such that
 |
(22) |
Since

are given to be monic, it is easy to prove
that for

we have
 |
(23) |
In addition, observe that combining
Equation (
18)
and
Equation (
22)
we obtain
 |
(24) |
The induction hypothesis shows that

is a multiple of

.
Then we obtain
 |
(25) |
By Theorem
1
and
Equation (
23),
the Equation (
25)
has a unique solution.