Computations in the ring of quaternionic polynomials (Q1034546): Difference between revisions

Let \(\mathbb{H}\) be the algebra of real quaternions, and let \(\mathbb{H}[q]\) be the polynomial ring over \(\mathbb{H}\) with one indeterminate \(q\). For \(G,F\in\mathbb{H}[q]\), we say that \(G\) divides \(F\) from the left if there exists \(A\in\mathbb{H}[q]\) such that \(F=GA\). It is proved that the Euclidean algorithm holds in \(\mathbb{H}[q]\): for all \(G,F\in\mathbb{H}[q]\) with \(G\neq 0\), there exist uniquely determined \(Q, R\in\mathbb{H}[q]\) such that \(F=GQ+R\) where \(\deg(R)<\deg(G)\). From this it follows that the greatest common left divisor of any finite subset of \(\mathbb{H}[q]\) exists. For any \(F_1,\dots,F_n\in\mathbb{H}[q]\), \(n>1\), the following statements are equivalent: (a) the greatest common left divisor of \(F_1,\dots,F_n\) is \(1\); (b) there exist \(A_1,\dots,A_n\in\mathbb{H}[q]\) such that \(F_1A_1+\dots+F_nA_n=1\); (c) \(F_1,\dots,F_n\) have no common roots in \(\mathbb{H}\). Similar results hold with ``left'' replaced by ``right''. Using Gröbner bases for modules, the module syzygy of any vector of polynomials in \(\mathbb{H}[q]\) is given.