Type a command or search the notes. Tab cycles completions. Up and down recall history when blank. Escape dismisses, then leaves the prompt.
MATH
[1251]

Complex polynomials

Complex coefficients, roots, factorisation and real factors.

This page studies polynomials whose coefficients come from complex arithmetic. It asks which polynomials have roots in C\mathbb C and how those roots determine the factors. The central result is that every non-constant complex polynomial splits into linear factors.

Polynomial language

[DEFINITION]

Complex number

A complex number is a number of the form

z=a+bi,a,b∈R,i2=−1.z=a+bi,\qquad a,b\in\mathbb R,\qquad i^2=-1.

The expression a+bia+bi is the Cartesian form of zz. Its real part is Re⁡(z)=a\operatorname{Re}(z)=a and its imaginary part is Im⁡(z)=b\operatorname{Im}(z)=b.

[DEFINITION]

Complex polynomial

A complex polynomial is a function p:C→Cp:\mathbb C\to\mathbb C of the form

p(z)=a0+a1z+a2z2+⋯+anzn,a0,…,an∈C,p(z)=a_0+a_1z+a_2z^2+\cdots+a_nz^n, \qquad a_0,\ldots,a_n\in\mathbb C,

for a non-negative integer nn.

The coefficients may be real or non-real. The word polynomial restricts the exponents of the variable to non-negative integers, not the kinds of numbers allowed as coefficients.

[DEFINITION]

Degree

For a non-zero polynomial

p(z)=∑k=0nakzk,p(z)=\sum_{k=0}^n a_kz^k,

the degree of pp is the largest integer kk for which ak≠0a_k\ne0. The zero polynomial has undefined degree.

[EXAMPLE]

Classify and find degrees

The expressions

0,z,z999,1+35z4,i+2 iz4+πz0,\quad z,\quad z^{999},\quad 1+35z^4,\quad i+\sqrt2\,iz^4+\pi z

are complex polynomials. The non-zero polynomials zz, z999z^{999}, 1+35z41+35z^4 and i+2 iz4+πzi+\sqrt2\,iz^4+\pi z have degrees 11, 999999, 44 and 44, respectively. The zero polynomial has undefined degree.

An expression containing a fractional power such as z1/2z^{1/2} is not a polynomial in zz. By contrast, numbers such as 2+3i2+3i and (1−7i)17(1-7i)^{17} are allowed as coefficients: only the powers of the variable must be non-negative integers.

[routine]

  1. [1]:Complex polynomial
  2. [2]:Degree
[DEFINITION]

Polynomial root

A number α∈C\alpha\in\mathbb C is a root of pp if

p(α)=0.p(\alpha)=0.
[DEFINITION]

Polynomial factor

A polynomial p1p_1 is a factor of pp if there is a polynomial p2p_2 such that

p(z)=p1(z)p2(z)p(z)=p_1(z)p_2(z)

for every z∈Cz\in\mathbb C.

[EXAMPLE]

Find and use roots

For p(z)=z2+1p(z)=z^2+1,

p(i)=i2+1=0,p(i)=i^2+1=0,

so ii is a root. Direct substitution also gives p(−i)=0p(-i)=0. The factor theorem below explains why these roots yield the factorisation

z2+1=(z−i)(z+i)z^2+1=(z-i)(z+i)

into linear factors. The same polynomial has no real root: for real xx, x2+1>0x^2+1>0.

[DEFINITION]

Root multiplicity

For a non-zero polynomial pp, a root α\alpha has multiplicity k≥1k\ge1 if (z−α)k(z-\alpha)^k is a factor of pp but (z−α)k+1(z-\alpha)^{k+1} is not.

[EXAMPLE]

Multiplicity two

For p(z)=(z−1)2p(z)=(z-1)^2, the root 11 has multiplicity two: (z−1)2(z-1)^2 is a factor of pp but (z−1)3(z-1)^3 is not.

Multiplicity records repetition in a factorisation. It is not the number of different solutions: this polynomial has one distinct root, counted twice when roots are counted with multiplicity.

[routine]

  1. [1]:Root multiplicity

Roots and factors

[THEOREM]

Remainder theorem

When p(z)p(z) is divided by z−αz-\alpha, the remainder is the complex number p(α)p(\alpha).

[PROOF]

Polynomial division gives

p(z)=(z−α)q(z)+r,p(z)=(z-\alpha)q(z)+r,

with a constant remainder rr. At z=αz=\alpha, the first term vanishes, leaving p(α)=rp(\alpha)=r.

[THEOREM]

Factor theorem

A number α∈C\alpha\in\mathbb C is a root of pp if and only if z−αz-\alpha is a factor of p(z)p(z).

[PROOF]

If p(α)=0p(\alpha)=0, polynomial division gives

p(z)=(z−α)q(z)+p(α)=(z−α)q(z),p(z)=(z-\alpha)q(z)+p(\alpha)=(z-\alpha)q(z),

so z−αz-\alpha is a factor. Conversely, if p(z)=(z−α)q(z)p(z)=(z-\alpha)q(z), then p(α)=0p(\alpha)=0.

[THEOREM]

Uniqueness of polynomial coefficients

Two complex polynomials agree for every z∈Cz\in\mathbb C if and only if their corresponding coefficients are equal. In particular, a complex polynomial is zero for every zz if and only if all its coefficients are zero.

This is why identities between polynomial functions can be checked coefficient by coefficient.

To see why, subtract the two polynomials. If the result were a non-zero polynomial of degree dd, it could have at most dd distinct roots: each root supplies a linear factor by the factor theorem. After dividing out z−αz-\alpha, any other root β≠α\beta\ne\alpha remains a root of the quotient, so we can repeat this step at most dd times. It therefore cannot vanish at every complex number.

[THEOREM]

Fundamental theorem of algebra

Every complex polynomial of degree n≥1n\ge1 has at least one complex root.

The theorem is stated without proof. It guarantees that a root exists, not a formula for finding it.

Applying the factor theorem to that root and then repeating with the quotient, gives the full factorisation below. This is what is special about C\mathbb C: over R\mathbb R, a polynomial such as z2+1z^2+1 cannot be factored into real linear factors.

Factorisation over C\mathbb C

[THEOREM]

Factorisation over the complex numbers

Every complex polynomial of degree n≥1n\ge1 can be written

p(z)=a(z−α1)(z−α2)⋯(z−αn),p(z)=a(z-\alpha_1)(z-\alpha_2)\cdots(z-\alpha_n),

where aa is the coefficient of znz^n and the αj∈C\alpha_j\in\mathbb C are roots, counted with multiplicity.

[PROOF]

Proceed by induction on the degree. A degree-one polynomial already has the required form. Suppose the result holds for degree mm. If pp has degree m+1m+1, the fundamental theorem of algebra supplies a root α1\alpha_1. The factor theorem gives

p(z)=(z−α1)q(z)p(z)=(z-\alpha_1)q(z)

for a polynomial qq of degree mm. Apply the induction hypothesis to qq and multiply the factors.

[COROLLARY]

Count roots with multiplicity

A complex polynomial of degree n≥1n\ge1 has exactly nn complex roots counted with multiplicity.

The factorisation theorem gives nn linear factors. Conversely, if p(β)=0p(\beta)=0, then

0=a(β−α1)⋯(β−αn),0=a(\beta-\alpha_1)\cdots(\beta-\alpha_n),

so β\beta equals one of the αj\alpha_j. Thus the list has no missing roots, and repeated factors record multiplicity.

“Exactly nn roots” does not mean nn distinct values: (z−1)2(z-1)^2 has two roots counted with multiplicity, but only one distinct root.

[EXAMPLE]

Factorise a quadratic

For p(z)=z2+z+1p(z)=z^2+z+1, the quadratic formula gives

z=−1±−32=−12±32i.z=\frac{-1\pm\sqrt{-3}}2 = -\frac12\pm\frac{\sqrt3}{2}i.

Therefore

z2+z+1=(z+12−32i)(z+12+32i).z^2+z+1 =\left(z+\frac12-\frac{\sqrt3}{2}i\right) \left(z+\frac12+\frac{\sqrt3}{2}i\right).
[EXAMPLE]

Factorise z8−1z^8-1

The roots satisfy z8=1z^8=1, so the eighth roots of unity give

αk=e2πik/8,k=0,1,…,7.\alpha_k=e^{2\pi ik/8},\qquad k=0,1,\ldots,7.

Hence

z8−1=∏k=07(z−e2πik/8)z^8-1=\prod_{k=0}^{7}\left(z-e^{2\pi ik/8}\right)

over C\mathbb C.

Returning to real factors

A real polynomial is one whose coefficients all lie in R\mathbb R, even when the variable takes complex values. Its non-real roots occur in conjugate pairs, so its complex factorisation can be regrouped into real factors.

[PROPOSITION]

Conjugate roots for real coefficients

If pp has real coefficients and α\alpha is a root of multiplicity kk, then α‾\overline\alpha is also a root of multiplicity kk.

The condition on the coefficients is essential: conjugation must leave every coefficient unchanged before it can pass through the polynomial.

[PROOF]

Write p(z)=∑j=0najzjp(z)=\sum_{j=0}^n a_jz^j with aj∈Ra_j\in\mathbb R. If p(α)=0p(\alpha)=0, then

p(α‾)=∑j=0najα‾ j=∑j=0najαj‾=p(α)‾=0.p(\overline\alpha) =\sum_{j=0}^n a_j\overline\alpha^{\,j} =\sum_{j=0}^n\overline{a_j\alpha^j} =\overline{p(\alpha)} =0.

For multiplicity, write p(z)=(z−α)kq(z)p(z)=(z-\alpha)^kq(z) with q(α)≠0q(\alpha)\ne0. Since pp has real coefficients, conjugating this factorisation gives p(z)=(z−α‾)kq~(z)p(z)=(z-\overline\alpha)^k\widetilde q(z), where q~(z)=q(z‾)‾\widetilde q(z)=\overline{q(\overline z)} and q~(α‾)=q(α)‾≠0\widetilde q(\overline\alpha)=\overline{q(\alpha)}\ne0. Thus the conjugate root has exactly the same multiplicity.

[PROPOSITION]

Real linear and quadratic factors

Every non-zero polynomial with real coefficients can be written as a non-zero real constant times a product of real linear factors and real quadratic factors.

Every non-real root occurs with its conjugate. Pairing the corresponding factors gives

(z−α)(z−α‾)=z2−2Re⁡(α)z+∣α∣2,(z-\alpha)(z-\overline\alpha) =z^2-2\operatorname{Re}(\alpha)z+|\alpha|^2,

whose coefficients are real. Real roots already provide real linear factors. The quadratic factors obtained from non-real roots have negative discriminant, so they do not split further over R\mathbb R.

[EXAMPLE]

Factorise x8−1x^8-1 over the reals

The real roots are 11 and −1-1. Pairing the remaining eighth roots with their conjugates gives

x8−1=(x−1)(x+1)(x2+1)×(x2−2 x+1)(x2+2 x+1).\begin{aligned} x^8-1 &=(x-1)(x+1)(x^2+1)\\ &\quad{}\times\left(x^2-\sqrt2\,x+1\right) \left(x^2+\sqrt2\,x+1\right). \end{aligned}

The complex factorisation and the real factorisation describe the same polynomial; the latter groups conjugate roots into quadratic factors.

The characteristic equation of a linear recurrence or differential equation is a complex polynomial. Stability of systems reads growth, decay and oscillation from its roots; the continuous case is the second-order constant-coefficient method from Calculus.

On this page