This site is a work in progress. New lessons are added regularly. Contact us

Complex and Irrational Roots

Learning goals

  • Prove nonreal roots pair up when the coefficients are real
  • Trace the proof to conjugation respecting sums and products
  • Show xix - i failing the pairing without real coefficients
  • Pair surd roots when the coefficients are rational
  • Build the forced real or rational quadratic factor
  • Conclude that an odd-degree real polynomial has a real root

The plus-or-minus is not the reason

Start by watching the pairing show up where no single formula produced it. Take

p(x)=x35x2+17x13.p(x) = x^3 - 5x^2 + 17x - 13.

The Rational Root Theorem lists ±1\pm 1 and ±13\pm 13 as the only candidates for a rational root, and p(1)=15+1713=0p(1) = 1 - 5 + 17 - 13 = 0, so x=1x = 1 is one. The Factor Theorem then says x1x - 1 divides pp, and synthetic division returns the quotient:

p(x)=(x1)(x24x+13).p(x) = (x - 1)(x^2 - 4x + 13).

The quadratic factor is the one from a moment ago, whose roots are 2±3i2 \pm 3i. So the three roots of this cubic are

1,2+3i,23i,1, \qquad 2 + 3i, \qquad 2 - 3i,

and the two nonreal ones are a conjugate pair again. No formula swept the cubic in one motion; the roots came out of three separate steps, and the pairing appeared anyway.

Now put the ±\pm story on trial. If the ±\pm were the cause, then any quadratic at all should produce conjugate answers, because every quadratic has that ±\pm. Test it on

q(x)=x2(1+i)x+i.q(x) = x^2 - (1 + i)x + i.

Multiply out (x1)(xi)=x2ixx+i(x - 1)(x - i) = x^2 - ix - x + i and you get exactly qq, so the roots of qq are 11 and ii. Those are not conjugates of each other. The formula still cooperates, by the way: the discriminant is (1+i)24i=2i4i=2i(1+i)^2 - 4i = 2i - 4i = -2i, and since (1i)2=2i(1 - i)^2 = -2i as well, the formula’s ±\pm delivers

x=(1+i)±(1i)2=1  or  i.x = \frac{(1 + i) \pm (1 - i)}{2} = 1 \ \text{ or } \ i.

The ±\pm is right there doing its job, producing two answers, and they refuse to pair. So the ±\pm was never the reason. The only thing that changed between x24x+13x^2 - 4x + 13 and qq is that a coefficient stopped being real. That is the real suspect, and the rest of this lesson convicts it.

Conjugation slides through plus and times

Everything rests on three facts about the conjugate z=abi\overline{z} = a - bi of z=a+biz = a + bi, all of them proved when you learned complex arithmetic:

z+w=z+w,zw=zw,z=z  exactly when z is real.\overline{z + w} = \overline{z} + \overline{w}, \qquad \overline{z\,w} = \overline{z}\cdot\overline{w}, \qquad \overline{z} = z \ \text{ exactly when } z \text{ is real.}

The first two say conjugation does not care whether you conjugate before or after adding, or before or after multiplying. Apply the sum rule repeatedly and the bar spreads over a sum of any length. Apply the product rule repeatedly and zk=(z)k\overline{z^k} = (\overline{z})^k for every whole number kk, since zkz^k is just zz multiplied by itself.

The third fact is a genuine two-way street, and both directions were established: a real number rr equals r+0ir + 0i, and flipping the sign of 00 changes nothing, so r=r\overline{r} = r. Conversely, for z=a+biz = a + bi, the equation z=z\overline{z} = z forces b=b-b = b, so b=0b = 0 and zz is real. Conjugation leaves the real numbers alone, and it leaves nothing else alone. Hold on to that. It is about to become the hypothesis of a theorem.

The conjugate root theorem

Theorem. Let p(x)=anxn+an1xn1++a1x+a0p(x) = a_n x^n + a_{n-1}x^{n-1} + \cdots + a_1 x + a_0, where every coefficient aka_k is a real number. If zz is a complex number with p(z)=0p(z) = 0, then p(z)=0p(\overline{z}) = 0 too.

With real coefficients, every root drags its conjugate along#

Suppose p(z)=0p(z) = 0, and conjugate both sides of that equation.

The right-hand side is easy. Zero is real, so 0=0\overline{0} = 0.

For the left-hand side, push the bar inward one operation at a time. Conjugation respects addition, and applying that rule repeatedly spreads the bar across the whole sum:

p(z)=anzn+an1zn1++a1z+a0.\overline{p(z)} = \overline{a_n z^n} + \overline{a_{n-1}z^{n-1}} + \cdots + \overline{a_1 z} + \overline{a_0}.

Conjugation also respects multiplication, so each term splits into the conjugate of its coefficient times the conjugate of its power of zz. Applying the conjugation product rule again then moves the bar onto every copy of zz inside that power:

akzk=akzk=ak(z)k.\overline{a_k z^k} = \overline{a_k} \cdot \overline{z^k} = \overline{a_k}\,(\overline{z})^{\,k}.

Nothing so far has used anything about the coefficients. This next line is the only place the hypothesis appears, and it is the hinge of the whole theorem. Each aka_k is real, and a real number is its own conjugate, so ak=ak\overline{a_k} = a_k. Every coefficient walks through the bar untouched, while every zz turns into z\overline{z}:

p(z)=an(z)n+an1(z)n1++a1z+a0=p(z).\overline{p(z)} = a_n (\overline{z})^n + a_{n-1}(\overline{z})^{n-1} + \cdots + a_1 \overline{z} + a_0 = p(\overline{z}).

The right end of that chain is literally pp evaluated at z\overline{z}, and the left end is 0=0\overline{0} = 0. Therefore p(z)=0p(\overline{z}) = 0, and z\overline{z} is a root.

Look at what the proof never needed: the degree, a formula for the roots, which root you started from, or any special feature of zz. It needed two rules about conjugation and one fact about the coefficients. Real coefficients are the only thing standing between p(z)=0p(z) = 0 and p(z)=0p(\overline{z}) = 0, which is why the theorem holds at degree 77 exactly as firmly as at degree 22.

Notice also what happens when zz is real: then z=z\overline{z} = z and the theorem says only that a root is a root. All the content is in the nonreal roots. They cannot travel alone.

Conjugate roots reflected across the real axisA complex plane with the real root 1 on the real axis and the conjugate pair 2 plus 3i and 2 minus 3i placed symmetrically above and below it, joined by a dashed vertical segment.ReIm12343i-3ireal root2 + 3i2 - 3ip(x) = x³ - 5x² + 17x - 13
The three roots of the cubic from the last section, drawn in the complex plane. Real coefficients force this mirror symmetry. The two nonreal roots are reflections of each other across the real axis, and the real root sits on the mirror line, so it is its own reflection.

A paired root is worth more than a second root. It hands you a real quadratic factor. Pair z=a+biz = a + bi (with b0b \neq 0) against z=abi\overline{z} = a - bi and multiply the two linear factors:

(xz)(xz)=x2(z+z)x+zz=x22ax+(a2+b2).(x - z)(x - \overline{z}) = x^2 - (z + \overline{z})\,x + z\,\overline{z} = x^2 - 2ax + (a^2 + b^2).

Both new coefficients are real, because z+z=2az + \overline{z} = 2a and zz=a2+b2z\,\overline{z} = a^2 + b^2 are the two quantities that conjugate pairs are famous for making real. And that quadratic really is a factor of pp, for a reason you can state in one line. Whenever rr and ss are distinct roots of pp, the Factor Theorem gives p(x)=(xr)g(x)p(x) = (x - r)\,g(x); substituting x=sx = s turns 0=p(s)=(sr)g(s)0 = p(s) = (s - r)\,g(s) into g(s)=0g(s) = 0, because sr0s - r \neq 0. So the Factor Theorem applies once more, now to gg, and the product (xr)(xs)(x - r)(x - s) divides pp. Take r=zr = z and s=zs = \overline{z}, which are distinct precisely because b0b \neq 0.

Worked example 1 Build the smallest real polynomial with roots 22 and 14i1 - 4i

Real coefficients will not let 14i1 - 4i stand alone, so 1+4i1 + 4i is a root as well. The polynomial has at least the three roots 22, 14i1 - 4i, and 1+4i1 + 4i, so its degree is at least 33, and the monic degree-33 polynomial with exactly those roots is

p(x)=(x2)(x(14i))(x(1+4i)).p(x) = (x - 2)\big(x - (1 - 4i)\big)\big(x - (1 + 4i)\big).

Multiply the conjugate pair first, since that is the product engineered to clear the ii:

(x(14i))(x(1+4i))=x2[(14i)+(1+4i)]x+(14i)(1+4i).\begin{aligned} \big(x - (1 - 4i)\big)\big(x - (1 + 4i)\big) &= x^2 - \big[(1 - 4i) + (1 + 4i)\big]x \\ &\quad + (1 - 4i)(1 + 4i). \end{aligned}

The sum is 22 and the product is 12+42=171^2 + 4^2 = 17, both real, so the quadratic factor is x22x+17x^2 - 2x + 17. Multiplying by the remaining factor,

p(x)=(x2)(x22x+17)=x34x2+21x34.p(x) = (x - 2)(x^2 - 2x + 17) = x^3 - 4x^2 + 21x - 34.

Every coefficient came out real, as it was forced to. Any real polynomial whose roots are exactly those three, counted with multiplicity, is a nonzero constant times this one. (Larger real polynomials with those roots exist, of course; they just carry extra roots as well, like the multiple (x5)p(x)(x - 5)\,p(x).)

Worked example 2 Given that 3+i3 + i is a root of x46x3+11x26x+10x^4 - 6x^3 + 11x^2 - 6x + 10, find every root

The coefficients are real, so the conjugate root theorem hands you a second root for free: 3i3 - i. The two are distinct, so their product is a factor of pp:

(x(3+i))(x(3i))=x26x+(32+12)=x26x+10.\big(x - (3 + i)\big)\big(x - (3 - i)\big) = x^2 - 6x + (3^2 + 1^2) = x^2 - 6x + 10.

Divide pp by it. The first step is x4÷x2=x2x^4 \div x^2 = x^2, and x2(x26x+10)=x46x3+10x2x^2(x^2 - 6x + 10) = x^4 - 6x^3 + 10x^2; subtracting leaves x26x+10x^2 - 6x + 10. The next step is x2÷x2=1x^2 \div x^2 = 1, and subtracting x26x+10x^2 - 6x + 10 leaves nothing:

x46x3+11x26x+10=(x26x+10)(x2+1).x^4 - 6x^3 + 11x^2 - 6x + 10 = (x^2 - 6x + 10)(x^2 + 1).

The second factor gives x2=1x^2 = -1, whose solutions are ii and i-i: another conjugate pair, which is no surprise now. The four roots are

3+i,3i,i,i.3 + i, \qquad 3 - i, \qquad i, \qquad -i.

This polynomial has no real roots at all. An even degree allows that, since its four roots can be consumed by two conjugate pairs.

Check your understanding

pp is a polynomial with real coefficients and p(52i)=0p(5 - 2i) = 0. Which number must also be a root of pp?

Answer choices

The hypothesis is doing all the work

Read the theorem’s statement again and notice how much weight the words “every coefficient is real” are carrying. Take them away and the conclusion dies immediately. The smallest possible counterexample is degree 11:

p(x)=xi.p(x) = x - i.

Its only root is ii, since p(i)=ii=0p(i) = i - i = 0, and i-i is not a root, since p(i)=ii=2i0p(-i) = -i - i = -2i \neq 0. A root with no partner. The theorem is not being violated, because pp has the coefficient i-i, which is not a real number, so the theorem never applied. The quadratic q(x)=x2(1+i)x+iq(x) = x^2 - (1 + i)x + i from the opening section fails for the same reason, with the same nonreal coefficient sitting in plain sight.

So “complex roots come in conjugate pairs” is false as a bare slogan. What is true is the conditional: if the coefficients are real, then the nonreal roots come in conjugate pairs. Whenever you invoke the pairing, check the coefficients first. It is a one-second check, and skipping it is how the mistake gets made.

Do not read the theorem backwards, either. Paired roots do not force real coefficients. Scaling a polynomial by a constant cannot move a single root, so

i(x2+1)=ix2+ii\,(x^2 + 1) = i x^2 + i

has the roots ii and i-i, a perfectly matched conjugate pair, while its coefficients ii and ii are about as nonreal as coefficients get. The most you can conclude from a root list whose nonreal entries pair off with equal multiplicities is that your polynomial is a constant multiple of one with real coefficients. The reason is that pairing the nonreal roots into real quadratics and the real roots into real linear factors rebuilds a real polynomial. That leaves only the leading constant free to be anything it likes.

The multiplicities are not a detail you can wave through. Take (xi)2(x+i)=x3ix2+xi(x - i)^2(x + i) = x^3 - ix^2 + x - i. Its nonreal roots are ii and i-i, which look paired if you only read the list of values, but ii occurs twice and i-i once. That is something no constant multiple of a real polynomial can do. A pairing that ignores multiplicity is not a pairing.

Check your understanding

Exactly one of these polynomials has ii as a root but does not have i-i as a root. Which one?

Answer choices

The same proof over the rationals

Nothing in the proof cared that the swap was iii \mapsto -i in particular. It used only that the swap respects addition and multiplication, and that it leaves every coefficient alone. Any other swap with those two properties will prove its own theorem, with its own hypothesis on the coefficients. Here is the one that matters most.

Fix a rational number dd whose square root is irrational (for a positive integer dd, that means dd is not a perfect square). With that dd fixed, look at the numbers of the form a+bda + b\sqrt{d} with aa and bb rational. The swap is dd\sqrt{d} \mapsto -\sqrt{d}, and the partner of s=a+bds = a + b\sqrt{d} is written

s=abd.s^{*} = a - b\sqrt{d}.

Give it a new symbol rather than reusing the bar, because the bar is already taken and it does something different here. The number 2+52 + \sqrt{5} is real, so its complex conjugate is 2+5=2+5\overline{2 + \sqrt{5}} = 2 + \sqrt{5}, unchanged. The surd partner 252 - \sqrt{5} comes from an entirely different swap.

Theorem. Let pp have rational coefficients, and let aa, bb, and dd all be rational, with b0b \neq 0 and d\sqrt{d} irrational. If a+bda + b\sqrt{d} is a root of pp, then abda - b\sqrt{d} is a root of pp.

With rational coefficients, every surd root drags its partner along#

Work inside the set SS of numbers a+bda + b\sqrt{d} with aa and bb rational. Three facts make the argument run, and each one is the exact counterpart of a fact about complex numbers.

First, SS is closed under addition and multiplication, so a polynomial with rational coefficients, evaluated at a member of SS, stays inside SS. Sums are obvious. For products, use dd=d\sqrt{d}\cdot\sqrt{d} = d:

(a+bd)(c+ed)=(ac+bed)+(ae+bc)d,(a + b\sqrt{d})(c + e\sqrt{d}) = (ac + bed) + (ae + bc)\sqrt{d},

and both new coefficients are rational. Read that last clause slowly, because it is where dd itself has to be rational: bedbed is a product of three rational numbers, and the third of them is dd. This is the one place that hypothesis is spent, and it is spent on the product, not on the sum.

Second, each member of SS is written in that form in only one way. Suppose a+bd=a+bda + b\sqrt{d} = a' + b'\sqrt{d} with all four numbers rational. If bbb \neq b', then rearranging gives d=(aa)/(bb)\sqrt{d} = (a - a')/(b' - b), a ratio of rational numbers, making d\sqrt{d} rational. It is not, so b=bb = b', and then a=aa = a'. This is the matching-parts theorem all over again, with d\sqrt{d} playing the role of ii, and it is where the irrationality of d\sqrt{d} is spent. Without it the swap would not even be well defined: if dd were 44, then 55 could be written as 5+045 + 0\sqrt{4} or as 3+143 + 1\sqrt{4}. Those two competing representations of the same number would then force the swap to send 55 to both 55 and 11.

Third, the swap respects both operations. For a sum, negating the d\sqrt{d} parts of ss and ww separately negates the d\sqrt{d} part of s+ws + w, so (s+w)=s+w(s + w)^{*} = s^{*} + w^{*}. For a product, compare the display above with

(abd)(ced)=(ac+bed)(ae+bc)d.(a - b\sqrt{d})(c - e\sqrt{d}) = (ac + bed) - (ae + bc)\sqrt{d}.

The rational part is identical and the d\sqrt{d} part has flipped sign, which is exactly the statement (sw)=sw(s\,w)^{*} = s^{*}\,w^{*}.

Now rerun the earlier proof word for word. Let p(x)=anxn++a1x+a0p(x) = a_n x^n + \cdots + a_1 x + a_0 with every aka_k rational, and suppose p(s)=0p(s) = 0 for some ss in SS. Apply the swap to both sides. On the right, 0=00^{*} = 0. On the left, the swap passes through the sum and through each product, so it lands on every coefficient and on every copy of ss:

0=(p(s))=an(s)n++a1s+a0.0 = \big(p(s)\big)^{*} = a_n^{*}\,(s^{*})^n + \cdots + a_1^{*}\,s^{*} + a_0^{*}.

Each aka_k is rational, which means ak=ak+0da_k = a_k + 0\sqrt{d}, and the swap leaves it alone: ak=aka_k^{*} = a_k. That is the hinge, in the same position as before. What survives is pp evaluated at the partner:

0=an(s)n++a1s+a0=p(s),0 = a_n (s^{*})^n + \cdots + a_1 s^{*} + a_0 = p(s^{*}),

so s=abds^{*} = a - b\sqrt{d} is a root.

That the number dd is itself rational is a hypothesis, not a formality, and it is exactly the kind of hypothesis this lesson keeps telling you to watch. Drop it, keep every other word of the theorem, and the conclusion dies. Take d=3+22d = 3 + 2\sqrt{2}. Its square root is irrational, as required, and you can name it exactly:

(1+2)2=3+22,sod=1+2.\big(1 + \sqrt{2}\big)^2 = 3 + 2\sqrt{2}, \qquad\text{so}\qquad \sqrt{d} = 1 + \sqrt{2}.

Now take a=0a = 0 and b=1b = 1, both rational with b0b \neq 0. Then a+bd=1+2a + b\sqrt{d} = 1 + \sqrt{2}, and it is a root of the rational-coefficient polynomial p(x)=x22x1p(x) = x^2 - 2x - 1. Every hypothesis you have left holds. Yet the alleged partner abd=12a - b\sqrt{d} = -1 - \sqrt{2} is not a root:

p(12)=(3+22)+(2+22)1=4+420.p\big({-1} - \sqrt{2}\big) = \big(3 + 2\sqrt{2}\big) + \big(2 + 2\sqrt{2}\big) - 1 = 4 + 4\sqrt{2} \neq 0.

The proof collapsed back at the product step, where bed=dbed = d needed to be rational and was not. The theorem itself was never in danger: written honestly, 1+21 + \sqrt{2} is 1+121 + 1\cdot\sqrt{2} with the rational d=2d = 2, and that reading pairs it with 121 - \sqrt{2}, which really is a root of pp. It was the illegal dd that failed, not the mathematics. A hypothesis you never noticed is still a hypothesis.

Two theorems, one skeleton. Setting them side by side is the point of this lesson, because it shows that conjugation is not really about ii at all. It is about which number system the coefficients are drawn from, and about a swap that leaves exactly that system alone.

PropertyComplex conjugatesSurd conjugates
Coefficients must berealrational
The root it acts ona+bia + bi, with aa, bb reala+bda + b\sqrt{d}, with aa, bb, dd rational and d\sqrt{d} irrational
The swapa+biabia + bi \mapsto a - bia+bdabda + b\sqrt{d} \mapsto a - b\sqrt{d}
What the swap fixesexactly the real numbersexactly the rational numbers
Why the proof runsthe swap respects ++ and ×\timesthe swap respects ++ and ×\times
Partner of a rootz=abi\overline{z} = a - bis=abds^{*} = a - b\sqrt{d}
Factor the pair forcesx22ax+(a2+b2)x^2 - 2ax + (a^2 + b^2)x22ax+(a2b2d)x^2 - 2ax + (a^2 - b^2 d)
It fails forxix - ix2x - \sqrt{2}

The last row deserves a second look, because the two hypotheses are genuinely different and confusing them is the standard error. Real coefficients buy you the complex pairing and nothing more. The polynomial

x2(2+2)x+22=(x2)(x2)x^2 - (2 + \sqrt{2})\,x + 2\sqrt{2} = (x - 2)(x - \sqrt{2})

has real coefficients, and the conjugate root theorem is perfectly happy with it (its roots 22 and 2\sqrt{2} are real, so each is its own conjugate). But 2-\sqrt{2} is nowhere among its roots. The surd pairing needs the coefficients to be rational, and 2+22 + \sqrt{2} is not.

Worked example 3 Given that 2+52 + \sqrt{5} is a root of x37x2+11x+3x^3 - 7x^2 + 11x + 3, find every root

Every coefficient is rational, so the surd theorem applies and 252 - \sqrt{5} is a root as well. The two are distinct, so their product divides pp:

(x(2+5))(x(25))=x24x+(225)=x24x1.\big(x - (2 + \sqrt{5})\big)\big(x - (2 - \sqrt{5})\big) = x^2 - 4x + (2^2 - 5) = x^2 - 4x - 1.

Divide. The first step is x3÷x2=xx^3 \div x^2 = x, and x(x24x1)=x34x2xx(x^2 - 4x - 1) = x^3 - 4x^2 - x; subtracting leaves 3x2+12x+3-3x^2 + 12x + 3. The next step is 3x2÷x2=3-3x^2 \div x^2 = -3, and 3(x24x1)=3x2+12x+3-3(x^2 - 4x - 1) = -3x^2 + 12x + 3; subtracting leaves nothing:

x37x2+11x+3=(x24x1)(x3).x^3 - 7x^2 + 11x + 3 = (x^2 - 4x - 1)(x - 3).

So the third root is 33, and the full list is 2+52 + \sqrt{5}, 252 - \sqrt{5}, and 33.

The third root had no choice but to be rational. The irrational pair used up two of the cubic’s three roots, and the linear factor left behind came from dividing one rational polynomial by another. So that factor has rational coefficients, and the root of a rational linear factor is a rational number.

Check your understanding

pp has rational coefficients, degree 44, and two of its roots are 1+21 + \sqrt{2} and 3i3i. What are the other two roots?

Answer choices

What the pairing forces

The pairing is not a curiosity. It constrains what a real polynomial can look like, and the constraints are strong enough to be useful. Everything below follows from the conjugate root theorem plus the Fundamental Theorem of Algebra. That last theorem guarantees that any polynomial of degree 11 or more has at least one complex root to work with.

Every real polynomial factors into real linear and real quadratic pieces#

Let pp have real coefficients and degree n1n \geq 1, with leading coefficient ana_n. Strip one root at a time.

The Fundamental Theorem of Algebra says pp has a root. If that root rr is real, the Factor Theorem gives p(x)=(xr)q(x)p(x) = (x - r)\,q(x), with the quotient qq of degree n1n - 1. Because rr is real, the division that produces qq only ever adds, subtracts, and multiplies real numbers, so qq has real coefficients.

If the root z=u+viz = u + vi is nonreal, so v0v \neq 0, then z\overline{z} is a root as well, and the quadratic

d(x)=(xz)(xz)=x22ux+(u2+v2)d(x) = (x - z)(x - \overline{z}) = x^2 - 2ux + (u^2 + v^2)

has real coefficients. Divide pp by dd using long division, staying entirely inside the real numbers: p(x)=d(x)q(x)+αx+βp(x) = d(x)\,q(x) + \alpha x + \beta. In that identity qq, α\alpha, and β\beta are all real, because every number the long division algorithm touches is real, and the remainder has degree less than 22. Now substitute x=zx = z. Both p(z)p(z) and d(z)d(z) are zero, so αz+β=0\alpha z + \beta = 0, which written out is (αu+β)+αvi=0+0i(\alpha u + \beta) + \alpha v\,i = 0 + 0i. Matching parts gives αv=0\alpha v = 0, and v0v \neq 0 forces α=0\alpha = 0, and then β=0\beta = 0. The remainder is gone: p(x)=d(x)q(x)p(x) = d(x)\,q(x) with qq real of degree n2n - 2. The discriminant of dd is (2u)24(u2+v2)=4v2(-2u)^2 - 4(u^2 + v^2) = -4v^2, which is negative, so dd has no real roots and cannot be broken down any further over the reals.

Either way the degree drops and the quotient is still a real polynomial, so repeat the argument on qq. The degree falls by 11 or 22 each time, so after finitely many steps the quotient is a nonzero real constant, which must be ana_n. Multiplying the pieces back together,

p(x)=an(xr1)(xrk)  d1(x)dm(x),p(x) = a_n\,(x - r_1)\cdots(x - r_k)\;d_1(x)\cdots d_m(x),

where each rir_i is real and each djd_j is a real quadratic with negative discriminant. Counting degrees, n=k+2mn = k + 2m.

Two consequences fall straight out of that factorization, and both are worth stating on their own.

Nonreal roots are matched exactly, multiplicity and all. Every nonreal root of pp has to come from one of the quadratics djd_j, and each djd_j contributes the pair zjz_j and zj\overline{z_j} once each. So zz and z\overline{z} appear the same number of times in the complete root list: they have equal multiplicity. Counting with multiplicity, a real polynomial has exactly 2m2m nonreal roots, an even number, always.

Every real polynomial of odd degree has at least one real root. Suppose nn is odd. Since n=k+2mn = k + 2m, the number kk of real linear factors is n2mn - 2m, which is odd, so k1k \geq 1. At least one factor xrix - r_i is there, and rir_i is a real root. Put the other way round: the nonreal roots come in twos, so they can never use up an odd count, and something real is always left over. This matches the picture you already have of an odd-degree graph, which runs off toward opposite ends and so has to cross the axis somewhere. But notice that we proved that result without drawing anything.

For a cubic this pins things down completely. Counting with multiplicity, it has 33 roots, of which an even number are nonreal. So that cubic has either 00 or 22 nonreal roots among those three, which means either 33 or 11 real roots. A real cubic with no real root does not exist.

Worked example 4 Factor x4+4x^4 + 4 over the reals, then read off its roots

This polynomial has no real roots whatsoever: x40x^4 \geq 0 for every real xx, so x4+44x^4 + 4 \geq 4, which is never zero. The factorization theorem then says it must be a product of two real quadratics, each with negative discriminant. Find them by manufacturing a difference of squares, adding and subtracting 4x24x^2:

x4+4=x4+4x2+44x2=(x2+2)2(2x)2.x^4 + 4 = x^4 + 4x^2 + 4 - 4x^2 = (x^2 + 2)^2 - (2x)^2.

A difference of squares splits at once:

x4+4=(x2+22x)(x2+2+2x)=(x22x+2)(x2+2x+2).x^4 + 4 = (x^2 + 2 - 2x)(x^2 + 2 + 2x) = (x^2 - 2x + 2)(x^2 + 2x + 2).

Each factor has discriminant 48=44 - 8 = -4, negative, so neither breaks down further over the reals, exactly as promised. The quadratic formula on each one gives

x=2±42=1±i,x=2±42=1±i.x = \frac{2 \pm \sqrt{-4}}{2} = 1 \pm i, \qquad\qquad x = \frac{-2 \pm \sqrt{-4}}{2} = -1 \pm i.

Four roots, arranged as two conjugate pairs, and not one of them real. The count works out as it must: degree 44, zero real roots, four nonreal roots, and four is even.

Common mistakes

Practice

Multiple Choice Questions (MCQ)

Progressively harder sets of questions. Each opens on its own page.

Free Response Questions (FRQ)

Longer questions in parts, to be worked out on paper. Progressive hints, the answer on its own so you can check yourself and try again, then the full worked solution, plus a rubric to mark your own work against.

Free response Work it out on paper 5 questions Start →
More practice (optional)

Extra sets, as hard as the Challenge set. Each one opens on its own page.

More resources (optional)

Other explanations of this lesson, if you want a second take.

A bit of history (Optional)

The pairing in this lesson is far older than the numbers it pairs.

Euclid was a Greek mathematician who taught in Alexandria, a city in Egypt, around 300 BCE. His geometry book, the Elements, gives its longest section to lengths that no ratio of whole numbers can express. He had no algebra. He had no symbol for a square root. He worked with lines and rectangles instead, which makes what he found there rather surprising.

The pairing is already sitting in that section. Take a length built as the sum of two parts that share no common measure. Euclid calls that a binomial. The matching difference he calls an apotome. He then proves that a binomial times its apotome comes back as a plain rational length. The irrational parts have destroyed each other on the way. That is the surd conjugate, doing this lesson’s job about eighteen centuries before anybody wrote 1\sqrt{-1}.

The word conjugate records the relationship exactly. It descends from the Latin coniugatus, meaning yoked together, the way two oxen are harnessed to one plough. Neither one can be a root while the other stays out. The swap that leaves the coefficients alone carries each of the pair to the other. And their product is what drags a clean factor back down into those coefficients, whether the pair is a±bda \pm b\sqrt{d} or a±bia \pm bi.