Skip to main content
Contents
Embed
Dark Mode Prev Up Next
\(\require{physics}\require{upgreek}\everymath{\displaystyle}
\newcommand{\N}{\mathbb N}
\newcommand{\Z}{\mathbb Z}
\newcommand{\Q}{\mathbb Q}
\newcommand{\R}{\mathbb R}
\newcommand{\inv}{^{-1}}
\newcommand{\DS}{\displaystyle}
\newcommand{\eps}{\varepsilon}
\newcommand{\tsub}[1]{_{\mathrm{#1}}}
\newcommand{\ee}{\mathrm{e}}
\newcommand{\ii}{\mathrm{i}}
\newcommand{\limit}[1]{\lim\limits_{#1}}
\newcommand{\resid}[1]{\underset{#1}{\Res}}
\DeclareMathOperator{\sinc}{sinc}
\DeclareMathOperator{\sgn}{sgn}
\newcommand{\pii}{\pi}
\DeclareMathOperator{\Prob}{P}
\DeclareMathOperator{\EV}{E}
\DeclareMathOperator{\Var}{Var}
\newcommand{\bv}[1]{\boldsymbol{#1}}
\newcommand{\uv}[1]{\hat{\bv{#1}}}
\newcommand{\cl}[1]{\mathcal{#1}}
\newcommand{\bb}[1]{\mathbb{#1}}
\DeclareMathOperator{\Cis}{cis}
\DeclareMathOperator{\RE}{Re}
\DeclareMathOperator{\IM}{Im}
\newcommand{\xd}{\mathbf{d}}
\newcommand{\seq}[3]{{#1}_{#2},\cdots,{#1}_{#3}}
\newcommand{\psup}[1]{^{(#1)}}
\newcommand{\hypext}{{}^*}
\DeclareMathOperator{\st}{st}
\newcommand{\set}[1]{\left\{#1\right\}}
\DeclareMathOperator{\Sin}{Sin}
\DeclareMathOperator{\Cos}{Cos}
\DeclareMathOperator{\Tan}{Tan}
\DeclareMathOperator{\Sec}{Sec}
\DeclareMathOperator{\Csc}{Csc}
\DeclareMathOperator{\Cot}{Cot}
\DeclareMathOperator{\Log}{Log}
\DeclareMathOperator{\Arg}{Arg}
\DeclareMathOperator{\Ln}{Ln}
\DeclareMathOperator{\Grad}{grad}
\DeclareMathOperator{\Div}{div}
\DeclareMathOperator{\Curl}{curl}
\newcommand{\rd}{\textstyle\mathop{}\!\mathrm{d}^{\!\!\!-}\hspace{-0.0555 em}}
\newcommand{\rpd}{\textstyle\mathop{}\!\partial^{\hspace{-0.5 em}-}\hspace{-0.1666 em}}
\newcommand{\rdv}[2]{\frac{\rd{#1}}{\rd{#2}}}
\newcommand{\rpdv}[2]{\frac{\rpd{#1}}{\rpd{#2}}}
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\definecolor{fillinmathshade}{gray}{0.9}
\newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}}
\)
Section 20.6 The residue theorem
Objectives
Compute residues at isolated singularities using Laurent series or targeted formulas.
Apply the Residue Theorem to evaluate complex and real integrals.
Use the Argument Principle and Rouché’s theorem to count zeros of functions.
The coefficient of \((z-z_{0})\inv\) in the Laurent series of \(f\) is called the residue of \(f\) at \(z=z_{0}\text{,}\) and is denoted
\begin{equation*}
\resid{z=z_0}f(z)\text{.}
\end{equation*}
Simple pole:
\begin{equation*}
\resid{z=z_0}f(z)=\limit{z\to z_0}(z-z_{0})f(z)
\end{equation*}
Pole of order \(n\text{:}\)
\begin{equation*}
\resid{z=z_0}f(z)=\frac{1}{(n-1)!}\limit{z\to z_0}\dv[n-1]{z}\big((z-z_{0})f(z)\big)
\end{equation*}
If \(f(z)=g(z)/h(z)\) and \(f\) has a simple pole at \(z=z_{0}\text{,}\) then
\begin{equation*}
\resid{z=z_0}f(z)=\dfrac{g(z_0)}{h'(z_0)}
\end{equation*}
Theorem 20 . Cauchy’s residue theorem.
Let \(D\) be a simply connected domain and \(C\) a simple closed contour lying entirely within \(D\text{.}\) If \(f\) is meromorphic on and within \(C\) with isolated singularities \(\seq z1n\) within \(C\text{,}\) then
\begin{equation*}
\oint_{C} f(z)\dd{z}=2\pii\ii\sum_{k=1}^{n}\resid{z=z_0}f(z)\text{.}
\end{equation*}
Some examples of real integrals evaluated using residues
Theorem 21 . Argument principle.
Let \(C\) be a simple closed contour lying entirely within a domain \(D\text{.}\) Suppose \(f\) is meromorphic in \(D\) and \(f(z)\neq 0\) on \(C\text{.}\) Then
\begin{equation*}
\frac{1}{2\pii\ii}\oint_{C}\frac{f'(z)}{f(z)}\dd{z}=N_{0}-N_{p}
\end{equation*}
where \(N_{0}\) is the total number of zeros of \(f\) (up to multiplicity) inside \(C\) and \(N_{p}\) is the number of poles of \(f\) (up to multiplicity) inside \(C\text{.}\)
Theorem 22 . Rouché’s theorem.
Let
\(C\) be a simple closed contour lying entirely within a domain
\(D\text{.}\) Suppose
\(f\) and
\(g\) are analytic in
\(D\text{.}\) If the strict inequality
\(|f(z)-g(z)|<|f(z)|\) holds for all
\(z\) on
\(C\text{,}\) then
\(f\) and
\(g\) have the same number of zeros (counted according to their order or multiplicities) inside
\(C\text{.}\)
This can be used to prove the Fundamental theorem of algebra! THAT would be a great cherry on top!