Skip to content
The book

Argument principle, Rouché's theorem, open mapping

Why this is asked: Rouché is a counting tool: split the polynomial into a dominant term and the rest, verify the strict inequality on the circle, and read off the zero count. Watch for the extra factor when the integrand is (zf)′/(zf).

In one sentence

The argument principle counts zeros minus poles by watching how far the image winds, Rouché turns that count into a comparison with a simpler function, and the open mapping theorem is the structural fact underneath both.

Why the exam asks it

Because "how many roots lie in this region" is a question with no elementary method and a two-line complex-analytic one, and because Rouché's hypothesis — a strict inequality holding on the whole contour — is exactly the sort of condition an option can weaken without looking different.

The idea

The argument principle

Let ff be meromorphic inside and on a simple closed contour γ\gamma, with no zeros or poles on γ\gamma. Then

12πi∮γf′(z)f(z) dz=Z−P,\frac{1}{2\pi i}\oint_\gamma \frac{f'(z)}{f(z)}\,dz = Z - P,

the number of zeros minus poles inside, each counted with multiplicity.

the contour γ zeros f the image f∘γ 0 The image winds around 0 twice and γ encloses two zeros. That is the argument principle: (1/2πi) ∮ f′/f = Z − P, counted with multiplicity.
The argument principle: the number of times the image winds around the origin equals the zeros minus poles enclosed, counted with multiplicity.

The mechanism is worth seeing once. Near a zero of order mm, f(z)=(z−a)mg(z)f(z) = (z-a)^m g(z) with g(a)≠0g(a)\ne0, so

f′f=mz−a+g′g,\frac{f'}{f} = \frac{m}{z-a} + \frac{g'}{g},

and the second term is holomorphic. So f′/ff'/f has a simple pole with residue exactly mm at every zero of order mm, and residue −m-m at every pole of order mm. The residue theorem does the rest.

The name comes from the other reading: ∮f′/f\oint f'/f is the total change in log⁡f\log f, whose imaginary part is the change in arg⁡f\arg f. Dividing by 2π2\pi gives the number of times f∘γf\circ\gamma winds around the origin. Counting zeros and watching the image wind are the same computation.

Rouché

If ∣g∣<∣f∣|g| < |f| everywhere on γ\gamma, then ff and f+gf+g have the same number of zeros inside.

0 |f| — the walker |f + g| — the dog the lead: |g| < |f| If the lead is always shorter than the distance to the lamp post, the dog circles it exactly as often as the walker does. |g| < |f| on the contour ⇒ f and f + g have the same number of zeros inside.
Rouché as the dog on a lead. If the perturbation is always smaller than the function itself on the contour, it cannot change how many times the image encircles the origin.

The picture is the proof: walking a dog around a lamp post, on a lead shorter than the distance to the post, the dog circles the post exactly as often as you do. ff is the walker, f+gf+g the dog, ∣g∣|g| the lead.

Two hypotheses are doing work and both get removed in options.

Strict inequality. ∣g∣≤∣f∣|g| \le |f| is not enough: take f(z)=zf(z) = z and g(z)=−zg(z) = -z on ∣z∣=1|z|=1, where ∣g∣=∣f∣|g| = |f| and f+g≡0f+g \equiv 0 has infinitely many zeros.

On the whole contour. The inequality must hold at every point of γ\gamma, not merely somewhere or on average.

The standard use is bracketing roots by annulus. For p(z)=z5+3z+1p(z) = z^5 + 3z + 1:

  • On ∣z∣=2|z| = 2: ∣z5∣=32|z^5| = 32 and ∣3z+1∣≤7|3z+1| \le 7. Take f=z5f = z^5; all 55 roots lie in ∣z∣<2|z|<2.
  • On ∣z∣=1|z| = 1: ∣3z∣=3|3z| = 3 and ∣z5+1∣≤2|z^5 + 1| \le 2. Take f=3zf = 3z; exactly 11 root lies in ∣z∣<1|z|<1.

So four roots sit in the annulus 1<∣z∣<21 < |z| < 2. Notice the dominant term changes between the two circles — choosing which term plays ff is the whole skill.

Rouché also gives the fundamental theorem of algebra: on a large enough circle the leading term dominates the rest, so a degree-nn polynomial has exactly nn roots.

Open mapping and its consequences

A non-constant holomorphic function on a domain maps open sets to open sets.

This is why ∣f∣|f| can have no interior maximum: the image of a neighbourhood of aa is a neighbourhood of f(a)f(a), so it contains points of larger modulus. The maximum modulus principle is a corollary rather than a separate fact.

Two more consequences:

  • A holomorphic function that is injective has f′≠0f' \ne 0 everywhere. Where f′(a)=0f'(a) = 0 the map is locally mm-to-one for m≥2m \ge 2.
  • A holomorphic bijection has a holomorphic inverse — it is a conformal equivalence, and the inverse comes free.

A real-variable contrast worth carrying: x↦x2x \mapsto x^2 maps the open interval (−1,1)(-1,1) onto [0,1)[0,1), which is not open. Openness of the image is a complex phenomenon.

Where intuition breaks

"∣g∣≤∣f∣|g| \le |f| on γ\gamma, so Rouché applies." Strict. f=zf = z, g=−zg = -z gives f+g≡0f + g \equiv 0. The weakened inequality is the commonest way this option is made wrong.

"Rouché needs ∣g∣<∣f∣|g| < |f| inside the contour." On the contour only. Requiring it inside would make the theorem useless, since that is where the zeros are.

"The argument principle counts zeros." Zeros minus poles. For a meromorphic function the two cancel, and an option will supply a function with poles and ask for the winding number.

"Multiplicity does not matter." Everything here is counted with multiplicity. z3z^3 has one zero as a set and three as a count, and the integral returns three.

"f′≠0f' \ne 0 implies ff is injective." Only locally. eze^{z} has non-vanishing derivative everywhere and is not injective on C\mathbb{C} — the same local-versus-global gap as the inverse function theorem.

"ff injective implies f′≠0f' \ne 0." This one is true for holomorphic ff, and is worth recognising among false options. It fails for real functions: x3x^3 is injective on R\mathbb{R} with f′(0)=0f'(0) = 0.

"A non-constant holomorphic map can have a closed image." Its image is open. A non-constant holomorphic function on a domain never maps onto a closed set like [0,1][0,1], and never takes only real values.

The exam's angle

  1. For "how many roots in this region", reach for Rouché. Split the polynomial into a dominant term and a remainder, and check the inequality on the boundary circle.
  2. Try the obvious split first, then the other one. Which term dominates changes with the radius, and comparing two circles brackets the roots into an annulus.
  3. Count with multiplicity, and subtract poles. Options exploit both.
  4. When an option asserts something is impossible for a holomorphic map, check openness. A non-open image, a real-valued non-constant function, an interior maximum of ∣f∣|f| — all impossible for the same reason.
  5. Compute f′/ff'/f if the integrand looks like a logarithmic derivative. That form is the argument principle asking to be recognised.

The night before

  • Argument principle: 12πi∮f′/f=Z−P\frac{1}{2\pi i}\oint f'/f = Z - P, with multiplicity. Equivalently the winding number of f∘γf\circ\gamma about 00.
  • f′/ff'/f has residue mm at a zero of order mm, and −m-m at a pole of order mm.
  • Rouché: ∣g∣<∣f∣|g| < |f| strictly, on the whole contour ⇒\Rightarrow ff and f+gf+g have equally many zeros inside. f=zf=z, g=−zg=-z breaks the non-strict version.
  • z5+3z+1z^5+3z+1: five roots in ∣z∣<2|z|<2, one in ∣z∣<1|z|<1, so four in the annulus.
  • Fundamental theorem of algebra follows from Rouché on a large circle.
  • Open mapping: non-constant holomorphic maps open sets to open sets. Maximum modulus is a corollary.
  • Injective ⇒f′≠0\Rightarrow f' \ne 0, for holomorphic ff. The converse is false — eze^z.
  • A holomorphic bijection has a holomorphic inverse.

See it move

Rouché in action: counting the zeros of z⁵ + 3z + 1interactivefree

Step 1 / 5The question

How many zeros does p(z)=z5+3z+1p(z) = z^5 + 3z + 1 have inside ∣z∣<1|z| < 1? And inside ∣z∣<2|z| < 2?

No formula finds these roots — but Rouché's theorem counts them without finding them.

The trap here

“f′(z) ≠ 0 everywhere implies f is injective” — false

f(z) = eᶻ on C\mathbb{C}

f′ = eᶻ never vanishes, yet f(z)=f(z+2πi)f(z) = f(z + 2\pi{}i). Non-vanishing derivative gives only local injectivity.

More on this →

Check yourself

How many roots does the polynomial z100−50z30+40z10+6z+1z^{100} - 50z^{30} + 40z^{10} + 6z + 1 have in the open disc {z∈Cz \in \mathbb{C} : |z| < 1}?

More in Zeros and Mappings

Take it further

Last revised . Found a mistake? Tell us — corrections are the fastest thing we act on.

Next: Conformal maps, Möbius transformations, Schwarz lemma

Create a free account to keep your place and have this feed your study plan.

ShareWhatsAppTelegram

Open this in the full syllabus view · Unit 2