🧮 Brain Teaser

The Argument Principle: Counting Zeros of a Polynomial

Let f(z)=z5+3z+1f(z) = z^5 + 3z + 1. Use the argument principle (or Rouché's theorem) to determine exactly how many zeros ff has inside the unit disk z<1|z| < 1.

Hint: Compare ff to a simpler function on z=1|z| = 1.

Rouché's theoremargument principlezeros of polynomialsunit disk

Answer: Rouché's Theorem: Zeros of z⁵+3z+1

Key Idea / Intuition

The trick is to split f(z)=z5+3z+1f(z) = z^5 + 3z + 1 into a "dominant" piece and a "small" perturbation on the boundary circle z=1|z| = 1. On the unit circle, the term 3z3z has modulus 33, while z5+1z^5 + 1 has modulus at most 22. Since the dominant part wins on the boundary, Rouché's theorem tells us ff has the same number of zeros inside z<1|z|<1 as the dominant part 3z3z — which has exactly one zero (at the origin).


Formal Proof / Solution

Rouché's Theorem (statement): If ff and gg are holomorphic inside and on a simple closed contour CC, and g(z)<f(z)|g(z)| < |f(z)| for all zCz \in C, then ff and f+gf + g have the same number of zeros (counted with multiplicity) inside CC.


Setup. Write f(z)=3z=:f0(z)+z5+1=:g(z).f(z) = \underbrace{3z}_{=: f_0(z)} + \underbrace{z^5 + 1}_{=: g(z)}.

We apply Rouché's theorem with C={z=1}C = \{|z| = 1\}, comparing the "big" piece f0(z)=3zf_0(z) = 3z against the "small" piece g(z)=z5+1g(z) = z^5 + 1.


Checking the Rouché condition on z=1|z| = 1:

  • f0(z)=3z=3|f_0(z)| = |3z| = 3,
  • g(z)=z5+1z5+1=1+1=2|g(z)| = |z^5 + 1| \leq |z^5| + 1 = 1 + 1 = 2.

Since g(z)2<3=f0(z)|g(z)| \leq 2 < 3 = |f_0(z)| for all zz on z=1|z| = 1, the condition g(z)<f0(z)|g(z)| < |f_0(z)| holds everywhere on the contour.


Applying Rouché's Theorem:

The function f0(z)=3zf_0(z) = 3z has exactly one zero inside z<1|z| < 1 (namely z=0z = 0, with multiplicity 1).

By Rouché's theorem, f(z)=f0(z)+g(z)=z5+3z+1f(z) = f_0(z) + g(z) = z^5 + 3z + 1 also has exactly one zero inside z<1|z| < 1.


Conclusion.

f(z)=z5+3z+1 has exactly 1 zero inside the unit disk.\boxed{f(z) = z^5 + 3z + 1 \text{ has exactly } 1 \text{ zero inside the unit disk.}}

The remaining four zeros (by the fundamental theorem of algebra) all lie outside the unit disk z1|z| \geq 1.


Why this is beautiful: Rouché's theorem lets you "transfer" zero-counting from a complicated function to a trivially simple one, purely by a modulus estimate on the boundary. No explicit root-finding required.

Source: Complex Analysis (Stein & Shakarchi), Chapter 3; standard folklore example

Type: Complex AnalysisSource: Complex Analysis (Stein & Shakarchi), Chapter 3; standard folklore exampleEdit on GitHub ↗