\(\newcommand{\fA}{\mathfrak{A}} \newcommand{\fB}{\mathfrak{B}} \newcommand{\fC}{\mathfrak{C}} \DeclareMathOperator{\Res}{Res} \newcommand{\fD}{\mathfrak{D}} \newcommand{\fE}{\mathfrak{E}} \newcommand{\fF}{\mathfrak{F}} \newcommand{\fG}{\mathfrak{G}} \newcommand{\fH}{\mathfrak{H}} \newcommand{\fI}{\mathfrak{I}} \newcommand{\fJ}{\mathfrak{J}} \newcommand{\fK}{\mathfrak{K}} \newcommand{\fL}{\mathfrak{L}} \newcommand{\fM}{\mathfrak{M}} \newcommand{\fN}{\mathfrak{N}} \newcommand{\fO}{\mathfrak{O}} \newcommand{\fP}{\mathfrak{P}} \newcommand{\fQ}{\mathfrak{Q}} \newcommand{\fR}{\mathfrak{R}} \newcommand{\fS}{\mathfrak{S}} \newcommand{\fT}{\mathfrak{T}} \newcommand{\fU}{\mathfrak{U}} \newcommand{\fV}{\mathfrak{V}} \newcommand{\fW}{\mathfrak{W}} \newcommand{\fX}{\mathfrak{X}} \newcommand{\fY}{\mathfrak{Y}} \newcommand{\fZ}{\mathfrak{Z}} \newcommand{\cA}{\mathcal{A}} \newcommand{\cB}{\mathcal{B}} \newcommand{\cC}{\mathcal{C}} \newcommand{\cD}{\mathcal{D}} \newcommand{\cE}{\mathcal{E}} \newcommand{\cF}{\mathcal{F}} \newcommand{\cG}{\mathcal{G}} \newcommand{\cH}{\mathcal{H}} \newcommand{\cI}{\mathcal{I}} \newcommand{\cJ}{\mathcal{J}} \newcommand{\cK}{\mathcal{K}} \newcommand{\cL}{\mathcal{L}} \newcommand{\cM}{\mathcal{M}} \newcommand{\cN}{\mathcal{N}} \newcommand{\cO}{\mathcal{O}} \newcommand{\cP}{\mathcal{P}} \newcommand{\cQ}{\mathcal{Q}} \newcommand{\cR}{\mathcal{R}} \newcommand{\cS}{\mathcal{S}} \newcommand{\cT}{\mathcal{T}} \newcommand{\cU}{\mathcal{U}} \newcommand{\cV}{\mathcal{V}} \newcommand{\cW}{\mathcal{W}} \newcommand{\cX}{\mathcal{X}}\newcommand{\cx}{\chi} \newcommand{\cY}{\mathcal{Y}} \newcommand{\cZ}{\mathcal{Z}} \DeclareMathOperator{\Aut}{Aut} \newcommand{\bA}{\mathbb{A}} \newcommand{\bB}{\mathbb{B}} \newcommand{\bC}{\mathbb{C}} \newcommand{\bD}{\mathbb{D}} \newcommand{\bE}{\mathbb{E}} \newcommand{\bF}{\mathbb{F}} \newcommand{\bG}{\mathbb{G}} \newcommand{\bH}{\mathbb{H}} \newcommand{\bI}{\mathbb{I}} \newcommand{\bJ}{\mathbb{J}} \newcommand{\bK}{\mathbb{K}} \newcommand{\bL}{\mathbb{L}} \newcommand{\bM}{\mathbb{M}} \newcommand{\bN}{\mathbb{N}} \newcommand{\bO}{\mathbb{O}} \newcommand{\bP}{\mathbb{P}} \newcommand{\bQ}{\mathbb{Q}} \newcommand{\bR}{\mathbb{R}} \newcommand{\bS}{\mathbb{S}} \newcommand{\bT}{\mathbb{T}} \newcommand{\bU}{\mathbb{U}} \newcommand{\bV}{\mathbb{V}} \newcommand{\bW}{\mathbb{W}} \newcommand{\bX}{\mathbb{X}} \newcommand{\bY}{\mathbb{Y}} \newcommand{\bZ}{\mathbb{Z}} \newcommand{\ce}{\mathcal{e}} \newcommand{\fe}{\mathfrak{e}} \newcommand{\p}{\overline{p}} \DeclareMathOperator{\im}{im} \DeclareMathOperator{\rank}{rank} \DeclareMathOperator{\coker}{coker} \DeclareMathOperator{\rad}{rad} \DeclareMathOperator{\spec}{Spec} \DeclareMathOperator{\diam}{diam} \DeclareMathOperator{\maxspec}{maxSpec} \DeclareMathOperator{\Ann}{Ann} \DeclareMathOperator{\Ass}{Ass} \require{AMScd}\)

Saturday, May 26, 2018

Using Rouché's Theorem for Counting Roots in some Annulus.

Let $f(z)=z^4-6z+1$. We want to find the number of roots of $f$ in the annulus given by $1<|z|<2$.
Remember that Rouché's theorem says, in particular, that if $f,g$ are holomorphic in a domain $D$, and $\gamma$ is a Jordan curve such that $\gamma$ and its interior are contained in $D$, such that for any $z\in \gamma$,
$$|f(z)-g(z)|<|g(z)|.$$
Then $n_{f,\gamma}=n_{g,\gamma}$ where $n_{-,\gamma}$ is the number of zeros of $-$ in the interior of $\gamma$.

So let's first consider $D=\mathbb{C}$ and $\gamma$ the circle of radius $2$. Take $g(z)=z^4$.
Then, over $\gamma$ we have
$$|f(z)-g(z)|=|-6z+1|\leq |6z|+|1|=13<16=|z|^4.$$
Since $n_{g,\gamma}=4$, then $n_{f,\gamma}=4$.

Now take $\delta$ as the circle of radius $1$, and $h(z)=-6z+1$. Then, over $\delta$,
$$|h(z)|=|1-6z|\geq ||1|-|6z||=|1-6|=5>1=|z^4|=|f(z)-h(z)|.$$

Then, since $h$ has exactly one zero in the interior of $\delta$, say $z=\frac{1}{6}$, $f$ must also have exactly one. So, in the annulus, $1<|z|<2$, $f$ has exactly $3$ zeros.

No comments:

Post a Comment