How to use the Implicit Function Theorem for show that a set is open?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite













Consider $a_i,; i=1,...,n$, real distinct numbers and the polynomial of degree odd $n$,
$$p(x) = prod_1^n(x-a_i).$$
Define
$$A = binmathbbR mid p(x) = btext has $n$ distinct roots.$$
(i) Show that $0 in A$.
(ii) Show that $A$ is bounded.
(iii) Use the Implicit Function Theorem to show that $A$ is open.




(i) is trivial



(ii) I take a sequence $(b_i)$ such that $b_i to 0$ to get a contradiction, but I couldn't. I just wanted a hint, some better way.



(iii) I never solved any questions involving IFT in order to classify a set. I have no idea how to use it. I wish someone could help me with that. I imagine that I should define $f: mathbbR^p to mathbbR^q$ ($p leq q$) such that $A subset mathbbR^p$ and take $x_0 in A$ and to use the IFT to get $varphi: B_delta(x_0) subset A to mathbbR^q in C^1$. It's the only way I can imagine using IFT. Anyway, I appreciate any help!







share|cite|improve this question















  • 1




    (ii) is false as stated. I guess it means to assume that $n>1$ and by "roots" it means real roots?
    – Eric Wofsey
    Aug 1 at 20:54







  • 1




    @EricWofsey, good point! I also think it is $n> 1$. As for the roots, it was not really clear that if they are only real. The hypothesis $n$ is odd serves to ensure that it has at least one real root so, perhaps, be considered complex roots.
    – Lucas Corrêa
    Aug 1 at 21:01














up vote
1
down vote

favorite













Consider $a_i,; i=1,...,n$, real distinct numbers and the polynomial of degree odd $n$,
$$p(x) = prod_1^n(x-a_i).$$
Define
$$A = binmathbbR mid p(x) = btext has $n$ distinct roots.$$
(i) Show that $0 in A$.
(ii) Show that $A$ is bounded.
(iii) Use the Implicit Function Theorem to show that $A$ is open.




(i) is trivial



(ii) I take a sequence $(b_i)$ such that $b_i to 0$ to get a contradiction, but I couldn't. I just wanted a hint, some better way.



(iii) I never solved any questions involving IFT in order to classify a set. I have no idea how to use it. I wish someone could help me with that. I imagine that I should define $f: mathbbR^p to mathbbR^q$ ($p leq q$) such that $A subset mathbbR^p$ and take $x_0 in A$ and to use the IFT to get $varphi: B_delta(x_0) subset A to mathbbR^q in C^1$. It's the only way I can imagine using IFT. Anyway, I appreciate any help!







share|cite|improve this question















  • 1




    (ii) is false as stated. I guess it means to assume that $n>1$ and by "roots" it means real roots?
    – Eric Wofsey
    Aug 1 at 20:54







  • 1




    @EricWofsey, good point! I also think it is $n> 1$. As for the roots, it was not really clear that if they are only real. The hypothesis $n$ is odd serves to ensure that it has at least one real root so, perhaps, be considered complex roots.
    – Lucas Corrêa
    Aug 1 at 21:01












up vote
1
down vote

favorite









up vote
1
down vote

favorite












Consider $a_i,; i=1,...,n$, real distinct numbers and the polynomial of degree odd $n$,
$$p(x) = prod_1^n(x-a_i).$$
Define
$$A = binmathbbR mid p(x) = btext has $n$ distinct roots.$$
(i) Show that $0 in A$.
(ii) Show that $A$ is bounded.
(iii) Use the Implicit Function Theorem to show that $A$ is open.




(i) is trivial



(ii) I take a sequence $(b_i)$ such that $b_i to 0$ to get a contradiction, but I couldn't. I just wanted a hint, some better way.



(iii) I never solved any questions involving IFT in order to classify a set. I have no idea how to use it. I wish someone could help me with that. I imagine that I should define $f: mathbbR^p to mathbbR^q$ ($p leq q$) such that $A subset mathbbR^p$ and take $x_0 in A$ and to use the IFT to get $varphi: B_delta(x_0) subset A to mathbbR^q in C^1$. It's the only way I can imagine using IFT. Anyway, I appreciate any help!







share|cite|improve this question












Consider $a_i,; i=1,...,n$, real distinct numbers and the polynomial of degree odd $n$,
$$p(x) = prod_1^n(x-a_i).$$
Define
$$A = binmathbbR mid p(x) = btext has $n$ distinct roots.$$
(i) Show that $0 in A$.
(ii) Show that $A$ is bounded.
(iii) Use the Implicit Function Theorem to show that $A$ is open.




(i) is trivial



(ii) I take a sequence $(b_i)$ such that $b_i to 0$ to get a contradiction, but I couldn't. I just wanted a hint, some better way.



(iii) I never solved any questions involving IFT in order to classify a set. I have no idea how to use it. I wish someone could help me with that. I imagine that I should define $f: mathbbR^p to mathbbR^q$ ($p leq q$) such that $A subset mathbbR^p$ and take $x_0 in A$ and to use the IFT to get $varphi: B_delta(x_0) subset A to mathbbR^q in C^1$. It's the only way I can imagine using IFT. Anyway, I appreciate any help!









share|cite|improve this question










share|cite|improve this question




share|cite|improve this question









asked Aug 1 at 20:47









Lucas Corrêa

1,071319




1,071319







  • 1




    (ii) is false as stated. I guess it means to assume that $n>1$ and by "roots" it means real roots?
    – Eric Wofsey
    Aug 1 at 20:54







  • 1




    @EricWofsey, good point! I also think it is $n> 1$. As for the roots, it was not really clear that if they are only real. The hypothesis $n$ is odd serves to ensure that it has at least one real root so, perhaps, be considered complex roots.
    – Lucas Corrêa
    Aug 1 at 21:01












  • 1




    (ii) is false as stated. I guess it means to assume that $n>1$ and by "roots" it means real roots?
    – Eric Wofsey
    Aug 1 at 20:54







  • 1




    @EricWofsey, good point! I also think it is $n> 1$. As for the roots, it was not really clear that if they are only real. The hypothesis $n$ is odd serves to ensure that it has at least one real root so, perhaps, be considered complex roots.
    – Lucas Corrêa
    Aug 1 at 21:01







1




1




(ii) is false as stated. I guess it means to assume that $n>1$ and by "roots" it means real roots?
– Eric Wofsey
Aug 1 at 20:54





(ii) is false as stated. I guess it means to assume that $n>1$ and by "roots" it means real roots?
– Eric Wofsey
Aug 1 at 20:54





1




1




@EricWofsey, good point! I also think it is $n> 1$. As for the roots, it was not really clear that if they are only real. The hypothesis $n$ is odd serves to ensure that it has at least one real root so, perhaps, be considered complex roots.
– Lucas Corrêa
Aug 1 at 21:01




@EricWofsey, good point! I also think it is $n> 1$. As for the roots, it was not really clear that if they are only real. The hypothesis $n$ is odd serves to ensure that it has at least one real root so, perhaps, be considered complex roots.
– Lucas Corrêa
Aug 1 at 21:01










1 Answer
1






active

oldest

votes

















up vote
0
down vote













You can actually also apply the IFT $n$ times on $p:mathbbR^1 rightarrow mathbbR^1$ as follows:




Proof of (iii): Let $b_0 in A$. then $p(x)=b_0$ has $n$ distinct roots $x_0,i$. As $p$ is of degree exactly $n$, the roots must all be of multiplicity 1 and therefore $p'(x_i) neq 0$. Hence, the IFT can be applied $n$ times to $p(x)$ at the positions $x_0,i$. This means we get continuous functions



$$ x_i= x_i(b), $$



defined for $|b-b_0|$ small enough, such that



$$p(x_i(b)) = b$$
and
$$x_i(b_0) = x_0,i.$$



That means that for small variations in $b$ around $b_0$ the roots of $p(x)=b$ vary also small and are still distinct if the variation is small enough. (I'm too lazy to carry out the epsilon delta formulations here ... :) )
Hence $A$ contains a neighborhood around $b_0$ and is open.






share|cite|improve this answer























    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',
    convertImagesToLinks: true,
    noModals: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    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%2f2869505%2fhow-to-use-the-implicit-function-theorem-for-show-that-a-set-is-open%23new-answer', 'question_page');

    );

    Post as a guest






























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    0
    down vote













    You can actually also apply the IFT $n$ times on $p:mathbbR^1 rightarrow mathbbR^1$ as follows:




    Proof of (iii): Let $b_0 in A$. then $p(x)=b_0$ has $n$ distinct roots $x_0,i$. As $p$ is of degree exactly $n$, the roots must all be of multiplicity 1 and therefore $p'(x_i) neq 0$. Hence, the IFT can be applied $n$ times to $p(x)$ at the positions $x_0,i$. This means we get continuous functions



    $$ x_i= x_i(b), $$



    defined for $|b-b_0|$ small enough, such that



    $$p(x_i(b)) = b$$
    and
    $$x_i(b_0) = x_0,i.$$



    That means that for small variations in $b$ around $b_0$ the roots of $p(x)=b$ vary also small and are still distinct if the variation is small enough. (I'm too lazy to carry out the epsilon delta formulations here ... :) )
    Hence $A$ contains a neighborhood around $b_0$ and is open.






    share|cite|improve this answer



























      up vote
      0
      down vote













      You can actually also apply the IFT $n$ times on $p:mathbbR^1 rightarrow mathbbR^1$ as follows:




      Proof of (iii): Let $b_0 in A$. then $p(x)=b_0$ has $n$ distinct roots $x_0,i$. As $p$ is of degree exactly $n$, the roots must all be of multiplicity 1 and therefore $p'(x_i) neq 0$. Hence, the IFT can be applied $n$ times to $p(x)$ at the positions $x_0,i$. This means we get continuous functions



      $$ x_i= x_i(b), $$



      defined for $|b-b_0|$ small enough, such that



      $$p(x_i(b)) = b$$
      and
      $$x_i(b_0) = x_0,i.$$



      That means that for small variations in $b$ around $b_0$ the roots of $p(x)=b$ vary also small and are still distinct if the variation is small enough. (I'm too lazy to carry out the epsilon delta formulations here ... :) )
      Hence $A$ contains a neighborhood around $b_0$ and is open.






      share|cite|improve this answer

























        up vote
        0
        down vote










        up vote
        0
        down vote









        You can actually also apply the IFT $n$ times on $p:mathbbR^1 rightarrow mathbbR^1$ as follows:




        Proof of (iii): Let $b_0 in A$. then $p(x)=b_0$ has $n$ distinct roots $x_0,i$. As $p$ is of degree exactly $n$, the roots must all be of multiplicity 1 and therefore $p'(x_i) neq 0$. Hence, the IFT can be applied $n$ times to $p(x)$ at the positions $x_0,i$. This means we get continuous functions



        $$ x_i= x_i(b), $$



        defined for $|b-b_0|$ small enough, such that



        $$p(x_i(b)) = b$$
        and
        $$x_i(b_0) = x_0,i.$$



        That means that for small variations in $b$ around $b_0$ the roots of $p(x)=b$ vary also small and are still distinct if the variation is small enough. (I'm too lazy to carry out the epsilon delta formulations here ... :) )
        Hence $A$ contains a neighborhood around $b_0$ and is open.






        share|cite|improve this answer















        You can actually also apply the IFT $n$ times on $p:mathbbR^1 rightarrow mathbbR^1$ as follows:




        Proof of (iii): Let $b_0 in A$. then $p(x)=b_0$ has $n$ distinct roots $x_0,i$. As $p$ is of degree exactly $n$, the roots must all be of multiplicity 1 and therefore $p'(x_i) neq 0$. Hence, the IFT can be applied $n$ times to $p(x)$ at the positions $x_0,i$. This means we get continuous functions



        $$ x_i= x_i(b), $$



        defined for $|b-b_0|$ small enough, such that



        $$p(x_i(b)) = b$$
        and
        $$x_i(b_0) = x_0,i.$$



        That means that for small variations in $b$ around $b_0$ the roots of $p(x)=b$ vary also small and are still distinct if the variation is small enough. (I'm too lazy to carry out the epsilon delta formulations here ... :) )
        Hence $A$ contains a neighborhood around $b_0$ and is open.







        share|cite|improve this answer















        share|cite|improve this answer



        share|cite|improve this answer








        edited Aug 1 at 21:19


























        answered Aug 1 at 21:14









        til

        694




        694






















             

            draft saved


            draft discarded


























             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2869505%2fhow-to-use-the-implicit-function-theorem-for-show-that-a-set-is-open%23new-answer', 'question_page');

            );

            Post as a guest













































































            Comments

            Popular posts from this blog

            What is the equation of a 3D cone with generalised tilt?

            Color the edges and diagonals of a regular polygon

            Relationship between determinant of matrix and determinant of adjoint?