Trivializing a central simple algebra of degree 4 over the rational numbers. (Q2455745): Difference between revisions

There are known efficient algorithms to decide whether a central simple algebra \(A\) over the rationals \(\mathbb{Q}\) is split, i.e. \(A\cong M_n(\mathbb{Q})\) for some \(n\) (see, e.g., \textit{G. Ivanyos} and \textit{L. Rónyai} [Comput. Complexity 3, No. 3, 245-261 (1993; Zbl 0792.16020)]). The problem treated in this article is to describe an algorithm to actually find an explicit isomorphism if one exists. As the author points out, such algorithms are known in the cases \(n=2\) and \(n=3\). The present paper treats the case \(n=4\), and the algorithm described by the author shows how to first construct a zero divisor which is then used to construct a minimal left ideal. This is done by reducing the task to classical problems in number theory for which there are known algorithms.