# Why don't quaternions contradict the Fundamental Theorem of Algebra? [duplicate]

I don't pretend to know anything much about the Fundamental Theorem of Algebra (FTA), but I do know what it states: for any polynomial with degree $n$, there are exactly $n$ solutions (roots).

Well, when it comes to quaternions, apparently $i^2=j^2=k^2=-1$, but $i\ne j\ne k\ne i$. So now, we have apparently found three solutions to the second-degree polynomial $x^2=-1$.

I'm not aware of the justification of the FTA, nor I am I aware of Hamilton's justification for quaternions. However, I know a contradiction when I see one. What am I missing here?

## marked as duplicate by user1551, Leucippus, Daniel W. Farlow, Jack's wasted life, Martin RNov 25 '16 at 6:19

• FTA refers to complex numbers. Quaternions are not complex numbers. – dxiv Nov 24 '16 at 3:52
• $q^2 = -1$ has infinitely many solutions in $\mathbb{H}$. – Henricus V. Nov 24 '16 at 3:52
• it is a non-commuative field, and the fundamental theorem of algebra works only for $\mathbb{C}$ (and more generally algebraically closed (commutative) fields) – reuns Nov 24 '16 at 3:53
• @user1952009 non-commutative fields are better known as division rings. – Servaes Nov 24 '16 at 16:37

There is actually a more basic result at work here.

Proposition: Let $R$ be an integral domain and $R[x]$ be the ring of polynomials with coefficients in $R$. If $f \in R[x]$ has degree $n$, then $f$ has at most $n$ roots in $R$.

You have seen that this result is not true for polynomials with coefficients in the quaternions. But the quaternions are not an integral domain because multiplication is not commutative.

The result above says that a degree $n$ polynomial has at most $n$ roots; the fundamental theorem of algebra states that a degree $n$ polynomial has exactly $n$ roots for polynomials with complex coefficients.

EDIT: See the wonderful answer here for the exact spot where the usual proof of the above proposition breaks down in the case of the quaternions. It basically boils down to the fact that in the polynomial ring, the indeterminate $x$ commutes with all scalars, i.e., $ax = xa$ for all $a \in R$. But if $R$ is noncommutative then substituting $b \in R$ for $x$ may cause problems, as it is not always true that $ab = ba$.

• Tks it is what I was searching for. Maybe a proof in the case $R$ is a field would help ? – reuns Nov 24 '16 at 3:58
• I didn't realize that the answer would involve so much high-level mathematics terminology. I'm guessing that one you know what the words mean, the discussion ends up being extremely basic. Only that could explain how quickly this questions was answered (and how succintly) – Mahkoe Nov 24 '16 at 4:00
• @Mahkoe Sorry if I've used terminology that is unfamiliar to you. I included a link to Wikipedia, but the basic gist is the following. An integral domain is a structure in which you can add and multiply, in which multiplication is commutative, and with one very important property: if $ab = 0$, then $a = 0$ or $b = 0$. So the integers $\mathbb{Z}$ are the prototypical example of an integral domain. Something like the integers modulo $6$ is not domain because $2 \cdot 3 = 6 \equiv 0 \pmod{6}$, but $2$ and $3$ are nonzero mod $6$. – André 3000 Nov 24 '16 at 4:03
• @SpamIAm now this is a little more my speed! Simply put, the quaternions (in part due to their noncommutativity) allow for things to "multiply out to zero" in ways that don't happen with complex numbers. (Yes, I know it must be frustrating that you have to hide away the nuance from me, but now I can believe that it's true.) Thank you! – Mahkoe Nov 24 '16 at 4:07
• @user1952009 You can always embed an integral domain in its field of fractions, so I think what I've written is correct. More generally, over a domain, you should be able to divide a polynomial $f$ by a polynomial $g$ provided that the leading coefficient of $g$ is a unit. – André 3000 Nov 24 '16 at 4:15

dxiv answered the question perfectly in the comment; but let me elaborate.

The fundamental theorem of algebra states that every polynomial of the form

$$p(z) = a_{n}z^{n} + a_{n-1}z^{n-1} + \dots + a_{1}z + a_{0}$$ where each $a_{n}$ is a complex number.

can be factored as

$$p(z) = a_{n}(z - z_{1})\cdot(z - z_{2})\cdots(z - z_{n-1})\cdot(z - z_{n})$$

for some choice of complex numbers $z_{1},\cdots,z_{n}$.

Now, this is equivalent to saying there precisely $n$ solutions which lie in the complex numbers to the equation $p(z) = 0$, so long as we agree to count solutions in terms of their multiplicity.

Your example shows there are other solutions which lie within the Quaternion field. Since not all of your solutions are complex numbers, there is no contradiction.

Hope that helps.

Let me put my comments in an answer. As SpamIAm said, the FTA has a generalization in any integral domain :

If $R$ is an integral domain, then any polynomial $P \in R[x]$ of degree $n$ has at most $n$ roots (counted with multiplicity)

The proof is that : $\quad$(a field is commutative, otherwise we say a non-commutative field)

• Any integral domain can be embedded in its field of fraction $K$

• Any field $K$ can be embedded in its algebraic closure $\overline{K}$

• In an algebraically closed field $\overline{K}$, the FTA is

Any polynomial $P \in \overline{K}[x]$ of degree $n$ has exactly $n$ roots (counted with multiplicity)

proof :

• since $\overline{K}$ is algebraically closed $P \in \overline{K}[x]$ has at least one root $a \in \overline{K}$

• if $F$ is a field, then $P \in F[x]$ and $P(a) = 0$ for some $a \in F \implies P(x) = (x-a)Q(x)$ for some $Q\in F[x]$ (see polynomial long division)

• Repeating the factorization on $Q(x)$ you have $P(x) = C \prod_{j=1}^n (x-a_j)$

• If $R$ is an integral domain and $P(x) = C \prod_{j=1}^n (x-a_j)$ with $a_j \in R$ and $C \ne 0$ then $P(b) = 0 \implies b = a_j$ for some $j$

This way you can see what steps fail for $\mathbb{H}$ a non-commutative field.

You already have plenty of answers, but I'd like to add some information in the hope that it might help other students, not only you. You wrote "I do know what [FTA] states: for any polynomial with degree $n$, there are exactly $n$ solutions (roots)." What you quoted here is not the FTA but rather the conclusion half of the FTA. You omitted the hypothesis half, which is that the coefficients of the polynomial and the roots that are being counted are complex numbers. As the other answers have explained, the hypothesis is not satisfied when you're dealing with quaternions, as these are not complex numbers, so there's no reason to expect the conclusion to be true. The reason I'm rehashing this information is that your problem here is one that I've seen very often in teaching various levels of mathematics: a tendency to pay attention only to the conclusion of a theorem, ignoring the hypothesis. Some students seem to feel that the hypothesis is there only because mathematicians like to make theorems look complicated. As you found here, the hypothesis is there because we like to make theorems be correct; if you omit (or ignore) the hypothesis, you get false statements, like the statement that quadratic polynomials should have only two quaternion roots. So the moral of this sermon is that, when learning a theorem, you need to learn the whole theorem, hypothesis and conclusion. Learning only the conclusion leads to errors.

• Usually part of the problem for the hyposthesis (in terms of explaining to those who don't understand) is that it's inward looking, rather than outward looking. They rarely say why the hypothesis is important and what features it's meant to cut out. Humans are great at seeing errors of commision (e.g. spelling mistakes) but are poor at seeing what's been missed. This isn't helped by the special terminology of mathematics relative to the applied reality disciplines that try to use it (I'm an engineer/phyisicist). Interestingly Maxwell did write his EM equations in quaternion form. – Philip Oakley Nov 25 '16 at 11:28