For each $ a $ with $ |a| > 1 $, $f^{-1}(a)$ contains exactly one point












2












$begingroup$



Let $ G = { z in mathbb{C} : |z-2| < 1} $ and let $ f $ be
analytic in $ overline{G} $ except for one simple pole $ z_0 $
inside. Suppose that $ |f(z)| = 1$ for all $ z in partial G $. Show
that for all $ a $ with $ |a| > 1 $, $ f^{-1}(a) $ contains exactly
one point.




So $f(z) $ can be written as $ sum a_n (z-2)^n + frac{b}{z - z_0} $, but I don't know how to use the fact that $ |f(z)| = 1 $ for all $ z in partial G $. How to solve this question?










share|cite|improve this question









$endgroup$

















    2












    $begingroup$



    Let $ G = { z in mathbb{C} : |z-2| < 1} $ and let $ f $ be
    analytic in $ overline{G} $ except for one simple pole $ z_0 $
    inside. Suppose that $ |f(z)| = 1$ for all $ z in partial G $. Show
    that for all $ a $ with $ |a| > 1 $, $ f^{-1}(a) $ contains exactly
    one point.




    So $f(z) $ can be written as $ sum a_n (z-2)^n + frac{b}{z - z_0} $, but I don't know how to use the fact that $ |f(z)| = 1 $ for all $ z in partial G $. How to solve this question?










    share|cite|improve this question









    $endgroup$















      2












      2








      2


      1



      $begingroup$



      Let $ G = { z in mathbb{C} : |z-2| < 1} $ and let $ f $ be
      analytic in $ overline{G} $ except for one simple pole $ z_0 $
      inside. Suppose that $ |f(z)| = 1$ for all $ z in partial G $. Show
      that for all $ a $ with $ |a| > 1 $, $ f^{-1}(a) $ contains exactly
      one point.




      So $f(z) $ can be written as $ sum a_n (z-2)^n + frac{b}{z - z_0} $, but I don't know how to use the fact that $ |f(z)| = 1 $ for all $ z in partial G $. How to solve this question?










      share|cite|improve this question









      $endgroup$





      Let $ G = { z in mathbb{C} : |z-2| < 1} $ and let $ f $ be
      analytic in $ overline{G} $ except for one simple pole $ z_0 $
      inside. Suppose that $ |f(z)| = 1$ for all $ z in partial G $. Show
      that for all $ a $ with $ |a| > 1 $, $ f^{-1}(a) $ contains exactly
      one point.




      So $f(z) $ can be written as $ sum a_n (z-2)^n + frac{b}{z - z_0} $, but I don't know how to use the fact that $ |f(z)| = 1 $ for all $ z in partial G $. How to solve this question?







      complex-analysis






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 7 at 10:01









      lifeishard911lifeishard911

      1166




      1166






















          1 Answer
          1






          active

          oldest

          votes


















          3












          $begingroup$

          Since this is complex analysis, $ |f(z)| = 1 $ on $ partial G $ should be interpreted in one of two different ways :




          • For the maximum modulus principle, however this result doesn't help at all with finding only one preimage of $ a $.


          • For the indices of points relative to some curves : here, we get by setting the usual curve $ gamma : t mapsto e^{2i pi t} + 2 $ that $ n(f circ gamma, a) = 0 $ because $ operatorname{Im} f circ gamma subset D_c(0, 1)$ and $ a not in D_c(0, 1)$. Thus , we can use the argument principle :



          $$ int_gamma frac{f'(z)}{f(z) - a}dz = 2 i pi (sum n(gamma, text{zero of } f(z) - a) - sum n(gamma, text{pole of } f(z) - a))$$



          and notice that $ int_gamma frac{f'(z)}{f(z) - a}dz = n(fcirc gamma, a) = 0$. The result then follows.






          share|cite|improve this answer











          $endgroup$













            Your Answer





            StackExchange.ifUsing("editor", function () {
            return StackExchange.using("mathjaxEditing", function () {
            StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
            StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
            });
            });
            }, "mathjax-editing");

            StackExchange.ready(function() {
            var channelOptions = {
            tags: "".split(" "),
            id: "69"
            };
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function() {
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled) {
            StackExchange.using("snippets", function() {
            createEditor();
            });
            }
            else {
            createEditor();
            }
            });

            function createEditor() {
            StackExchange.prepareEditor({
            heartbeatType: 'answer',
            autoActivateHeartbeat: false,
            convertImagesToLinks: true,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            imageUploader: {
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            },
            noCode: true, onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            });


            }
            });














            draft saved

            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3064836%2ffor-each-a-with-a-1-f-1a-contains-exactly-one-point%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            3












            $begingroup$

            Since this is complex analysis, $ |f(z)| = 1 $ on $ partial G $ should be interpreted in one of two different ways :




            • For the maximum modulus principle, however this result doesn't help at all with finding only one preimage of $ a $.


            • For the indices of points relative to some curves : here, we get by setting the usual curve $ gamma : t mapsto e^{2i pi t} + 2 $ that $ n(f circ gamma, a) = 0 $ because $ operatorname{Im} f circ gamma subset D_c(0, 1)$ and $ a not in D_c(0, 1)$. Thus , we can use the argument principle :



            $$ int_gamma frac{f'(z)}{f(z) - a}dz = 2 i pi (sum n(gamma, text{zero of } f(z) - a) - sum n(gamma, text{pole of } f(z) - a))$$



            and notice that $ int_gamma frac{f'(z)}{f(z) - a}dz = n(fcirc gamma, a) = 0$. The result then follows.






            share|cite|improve this answer











            $endgroup$


















              3












              $begingroup$

              Since this is complex analysis, $ |f(z)| = 1 $ on $ partial G $ should be interpreted in one of two different ways :




              • For the maximum modulus principle, however this result doesn't help at all with finding only one preimage of $ a $.


              • For the indices of points relative to some curves : here, we get by setting the usual curve $ gamma : t mapsto e^{2i pi t} + 2 $ that $ n(f circ gamma, a) = 0 $ because $ operatorname{Im} f circ gamma subset D_c(0, 1)$ and $ a not in D_c(0, 1)$. Thus , we can use the argument principle :



              $$ int_gamma frac{f'(z)}{f(z) - a}dz = 2 i pi (sum n(gamma, text{zero of } f(z) - a) - sum n(gamma, text{pole of } f(z) - a))$$



              and notice that $ int_gamma frac{f'(z)}{f(z) - a}dz = n(fcirc gamma, a) = 0$. The result then follows.






              share|cite|improve this answer











              $endgroup$
















                3












                3








                3





                $begingroup$

                Since this is complex analysis, $ |f(z)| = 1 $ on $ partial G $ should be interpreted in one of two different ways :




                • For the maximum modulus principle, however this result doesn't help at all with finding only one preimage of $ a $.


                • For the indices of points relative to some curves : here, we get by setting the usual curve $ gamma : t mapsto e^{2i pi t} + 2 $ that $ n(f circ gamma, a) = 0 $ because $ operatorname{Im} f circ gamma subset D_c(0, 1)$ and $ a not in D_c(0, 1)$. Thus , we can use the argument principle :



                $$ int_gamma frac{f'(z)}{f(z) - a}dz = 2 i pi (sum n(gamma, text{zero of } f(z) - a) - sum n(gamma, text{pole of } f(z) - a))$$



                and notice that $ int_gamma frac{f'(z)}{f(z) - a}dz = n(fcirc gamma, a) = 0$. The result then follows.






                share|cite|improve this answer











                $endgroup$



                Since this is complex analysis, $ |f(z)| = 1 $ on $ partial G $ should be interpreted in one of two different ways :




                • For the maximum modulus principle, however this result doesn't help at all with finding only one preimage of $ a $.


                • For the indices of points relative to some curves : here, we get by setting the usual curve $ gamma : t mapsto e^{2i pi t} + 2 $ that $ n(f circ gamma, a) = 0 $ because $ operatorname{Im} f circ gamma subset D_c(0, 1)$ and $ a not in D_c(0, 1)$. Thus , we can use the argument principle :



                $$ int_gamma frac{f'(z)}{f(z) - a}dz = 2 i pi (sum n(gamma, text{zero of } f(z) - a) - sum n(gamma, text{pole of } f(z) - a))$$



                and notice that $ int_gamma frac{f'(z)}{f(z) - a}dz = n(fcirc gamma, a) = 0$. The result then follows.







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Jan 7 at 13:51

























                answered Jan 7 at 10:53









                FreeSaladFreeSalad

                454211




                454211






























                    draft saved

                    draft discarded




















































                    Thanks for contributing an answer to Mathematics Stack Exchange!


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid



                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.


                    Use MathJax to format equations. MathJax reference.


                    To learn more, see our tips on writing great answers.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3064836%2ffor-each-a-with-a-1-f-1a-contains-exactly-one-point%23new-answer', 'question_page');
                    }
                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    Popular posts from this blog

                    Mario Kart Wii

                    The Binding of Isaac: Rebirth/Afterbirth

                    What does “Dominus providebit” mean?