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 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
The Rational Root Theorem lists and as the only candidates for a rational root, and , so is one. The Factor Theorem then says divides , and synthetic division returns the quotient:
The quadratic factor is the one from a moment ago, whose roots are . So the three roots of this cubic are
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 story on trial. If the were the cause, then any quadratic at all should produce conjugate answers, because every quadratic has that . Test it on
Multiply out and you get exactly , so the roots of are and . Those are not conjugates of each other. The formula still cooperates, by the way: the discriminant is , and since as well, the formula’s delivers
The is right there doing its job, producing two answers, and they refuse to pair. So the was never the reason. The only thing that changed between and 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 of , all of them proved when you learned complex arithmetic:
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 for every whole number , since is just multiplied by itself.
The third fact is a genuine two-way street, and both directions were established: a real number equals , and flipping the sign of changes nothing, so . Conversely, for , the equation forces , so and 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 , where every coefficient is a real number. If is a complex number with , then too.
With real coefficients, every root drags its conjugate along#
Suppose , and conjugate both sides of that equation.
The right-hand side is easy. Zero is real, so .
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:
Conjugation also respects multiplication, so each term splits into the conjugate of its coefficient times the conjugate of its power of . Applying the conjugation product rule again then moves the bar onto every copy of inside that power:
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 is real, and a real number is its own conjugate, so . Every coefficient walks through the bar untouched, while every turns into :
The right end of that chain is literally evaluated at , and the left end is . Therefore , and 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 . It needed two rules about conjugation and one fact about the coefficients. Real coefficients are the only thing standing between and , which is why the theorem holds at degree exactly as firmly as at degree .
Notice also what happens when is real: then and the theorem says only that a root is a root. All the content is in the nonreal roots. They cannot travel alone.
A paired root is worth more than a second root. It hands you a real quadratic factor. Pair (with ) against and multiply the two linear factors:
Both new coefficients are real, because and are the two quantities that conjugate pairs are famous for making real. And that quadratic really is a factor of , for a reason you can state in one line. Whenever and are distinct roots of , the Factor Theorem gives ; substituting turns into , because . So the Factor Theorem applies once more, now to , and the product divides . Take and , which are distinct precisely because .
Worked example 1 Build the smallest real polynomial with roots and
Real coefficients will not let stand alone, so is a root as well. The polynomial has at least the three roots , , and , so its degree is at least , and the monic degree- polynomial with exactly those roots is
Multiply the conjugate pair first, since that is the product engineered to clear the :
The sum is and the product is , both real, so the quadratic factor is . Multiplying by the remaining factor,
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 .)
Worked example 2 Given that is a root of , find every root
The coefficients are real, so the conjugate root theorem hands you a second root for free: . The two are distinct, so their product is a factor of :
Divide by it. The first step is , and ; subtracting leaves . The next step is , and subtracting leaves nothing:
The second factor gives , whose solutions are and : another conjugate pair, which is no surprise now. The four roots are
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
is a polynomial with real coefficients and . Which number must also be a root of ?
Every coefficient of is real, so the conjugate root theorem applies. Conjugating flips the sign of the imaginary part and leaves the real part exactly where it was.
The other three choices flip the real part, or swap the two parts, and conjugation does neither.
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 :
Its only root is , since , and is not a root, since . A root with no partner. The theorem is not being violated, because has the coefficient , which is not a real number, so the theorem never applied. The quadratic 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
has the roots and , a perfectly matched conjugate pair, while its coefficients and 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 . Its nonreal roots are and , which look paired if you only read the list of values, but occurs twice and 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 as a root but does not have as a root. Which one?
Test both numbers in each polynomial. In they are both roots, since and . In they are still both roots, because multiplying by cannot move a root. In neither is a root, since . That leaves .
Its coefficient is not real, so the conjugate root theorem never applied, and the pairing genuinely fails.
The same proof over the rationals
Nothing in the proof cared that the swap was 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 whose square root is irrational (for a positive integer , that means is not a perfect square). With that fixed, look at the numbers of the form with and rational. The swap is , and the partner of is written
Give it a new symbol rather than reusing the bar, because the bar is already taken and it does something different here. The number is real, so its complex conjugate is , unchanged. The surd partner comes from an entirely different swap.
Theorem. Let have rational coefficients, and let , , and all be rational, with and irrational. If is a root of , then is a root of .
With rational coefficients, every surd root drags its partner along#
Work inside the set of numbers with and rational. Three facts make the argument run, and each one is the exact counterpart of a fact about complex numbers.
First, is closed under addition and multiplication, so a polynomial with rational coefficients, evaluated at a member of , stays inside . Sums are obvious. For products, use :
and both new coefficients are rational. Read that last clause slowly, because it is where itself has to be rational: is a product of three rational numbers, and the third of them is . This is the one place that hypothesis is spent, and it is spent on the product, not on the sum.
Second, each member of is written in that form in only one way. Suppose with all four numbers rational. If , then rearranging gives , a ratio of rational numbers, making rational. It is not, so , and then . This is the matching-parts theorem all over again, with playing the role of , and it is where the irrationality of is spent. Without it the swap would not even be well defined: if were , then could be written as or as . Those two competing representations of the same number would then force the swap to send to both and .
Third, the swap respects both operations. For a sum, negating the parts of and separately negates the part of , so . For a product, compare the display above with
The rational part is identical and the part has flipped sign, which is exactly the statement .
Now rerun the earlier proof word for word. Let with every rational, and suppose for some in . Apply the swap to both sides. On the right, . On the left, the swap passes through the sum and through each product, so it lands on every coefficient and on every copy of :
Each is rational, which means , and the swap leaves it alone: . That is the hinge, in the same position as before. What survives is evaluated at the partner:
so is a root.
That the number 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 . Its square root is irrational, as required, and you can name it exactly:
Now take and , both rational with . Then , and it is a root of the rational-coefficient polynomial . Every hypothesis you have left holds. Yet the alleged partner is not a root:
The proof collapsed back at the product step, where needed to be rational and was not. The theorem itself was never in danger: written honestly, is with the rational , and that reading pairs it with , which really is a root of . It was the illegal 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 at all. It is about which number system the coefficients are drawn from, and about a swap that leaves exactly that system alone.
| Property | Complex conjugates | Surd conjugates |
|---|---|---|
| Coefficients must be | real | rational |
| The root it acts on | , with , real | , with , , rational and irrational |
| The swap | ||
| What the swap fixes | exactly the real numbers | exactly the rational numbers |
| Why the proof runs | the swap respects and | the swap respects and |
| Partner of a root | ||
| Factor the pair forces | ||
| It fails for |
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
has real coefficients, and the conjugate root theorem is perfectly happy with it (its roots and are real, so each is its own conjugate). But is nowhere among its roots. The surd pairing needs the coefficients to be rational, and is not.
Worked example 3 Given that is a root of , find every root
Every coefficient is rational, so the surd theorem applies and is a root as well. The two are distinct, so their product divides :
Divide. The first step is , and ; subtracting leaves . The next step is , and ; subtracting leaves nothing:
So the third root is , and the full list is , , and .
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
has rational coefficients, degree , and two of its roots are and . What are the other two roots?
Rational coefficients are also real coefficients, so both theorems apply at once.
The surd theorem pairs with , flipping the sign of the term only. The conjugate root theorem pairs with .
That is four roots for a degree- polynomial, so the list is complete. Flipping the sign of the rational part, as two of the wrong choices do, is not what either swap does.
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 or more has at least one complex root to work with.
Every real polynomial factors into real linear and real quadratic pieces#
Let have real coefficients and degree , with leading coefficient . Strip one root at a time.
The Fundamental Theorem of Algebra says has a root. If that root is real, the Factor Theorem gives , with the quotient of degree . Because is real, the division that produces only ever adds, subtracts, and multiplies real numbers, so has real coefficients.
If the root is nonreal, so , then is a root as well, and the quadratic
has real coefficients. Divide by using long division, staying entirely inside the real numbers: . In that identity , , and are all real, because every number the long division algorithm touches is real, and the remainder has degree less than . Now substitute . Both and are zero, so , which written out is . Matching parts gives , and forces , and then . The remainder is gone: with real of degree . The discriminant of is , which is negative, so 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 . The degree falls by or each time, so after finitely many steps the quotient is a nonzero real constant, which must be . Multiplying the pieces back together,
where each is real and each is a real quadratic with negative discriminant. Counting degrees, .
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 has to come from one of the quadratics , and each contributes the pair and once each. So and appear the same number of times in the complete root list: they have equal multiplicity. Counting with multiplicity, a real polynomial has exactly nonreal roots, an even number, always.
Every real polynomial of odd degree has at least one real root. Suppose is odd. Since , the number of real linear factors is , which is odd, so . At least one factor is there, and 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 roots, of which an even number are nonreal. So that cubic has either or nonreal roots among those three, which means either or real roots. A real cubic with no real root does not exist.
Worked example 4 Factor over the reals, then read off its roots
This polynomial has no real roots whatsoever: for every real , so , 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 :
A difference of squares splits at once:
Each factor has discriminant , negative, so neither breaks down further over the reals, exactly as promised. The quadratic formula on each one gives
Four roots, arranged as two conjugate pairs, and not one of them real. The count works out as it must: degree , zero real roots, four nonreal roots, and four is even.