Argument principle

From Companal
Revision as of 19:09, 18 May 2008 by Vipul (talk | contribs) (4 revisions)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

This article gives the statement, and possibly proof, of a basic fact in complex analysis.
View a complete list of basic facts in complex analysis

This fact is an application of the following pivotal fact/result/idea: residue theorem
View other applications of residue theorem OR Read a survey article on applying residue theorem

Statement

Suppose UC is an open subset and c is a 0-homologous cycle in U. Suppose f is a meromorphic function on U such that no zero or pole of f lies in U. Then we have:

n(fc;0)=ord(zj)n(c;zj)

Where the sum is taken over all zeros/poles zj for f and ord(zj) is the order of f at zj: the unique integer n such that (zzj)nf(z) has neither a zero nor a pole at zj.

Equivalently, we can write this as:

n(fc;0)=n(c;zj)n(c;zj)

where the first summation is for zeros, counted with multiplicity, and the second summation is for poles, counted with multiplicity.

Facts used