Connected levels and polynomials submersions












4












$begingroup$


Is it true that a polynomial submersion $ p: mathbb{R}^2 to mathbb{R}$ of degree $n$ has at most $n$ connected components on each level?



I think I have a proof, can someone point me out any mistakes?



Let $cin mathbb{R}$.



Since $p$ is a submersion, $p-c$ doesn't have a $(x^2+y^2-R)$ factor for any $Rin mathbb{R}^+$.
Also, each connected component of $p^{-1}(c)$ must intersect $x^2+y^2-R=0$ at least twice, for every $R$ big enough.



By Bezout theorem, the system
begin{cases} p=c \ x^2+y^2=Rend{cases}



has at most $2n$ real solutions, hence $p^{-1}(c)$ has at most $n$ connected components.










share|cite|improve this question











$endgroup$

















    4












    $begingroup$


    Is it true that a polynomial submersion $ p: mathbb{R}^2 to mathbb{R}$ of degree $n$ has at most $n$ connected components on each level?



    I think I have a proof, can someone point me out any mistakes?



    Let $cin mathbb{R}$.



    Since $p$ is a submersion, $p-c$ doesn't have a $(x^2+y^2-R)$ factor for any $Rin mathbb{R}^+$.
    Also, each connected component of $p^{-1}(c)$ must intersect $x^2+y^2-R=0$ at least twice, for every $R$ big enough.



    By Bezout theorem, the system
    begin{cases} p=c \ x^2+y^2=Rend{cases}



    has at most $2n$ real solutions, hence $p^{-1}(c)$ has at most $n$ connected components.










    share|cite|improve this question











    $endgroup$















      4












      4








      4


      2



      $begingroup$


      Is it true that a polynomial submersion $ p: mathbb{R}^2 to mathbb{R}$ of degree $n$ has at most $n$ connected components on each level?



      I think I have a proof, can someone point me out any mistakes?



      Let $cin mathbb{R}$.



      Since $p$ is a submersion, $p-c$ doesn't have a $(x^2+y^2-R)$ factor for any $Rin mathbb{R}^+$.
      Also, each connected component of $p^{-1}(c)$ must intersect $x^2+y^2-R=0$ at least twice, for every $R$ big enough.



      By Bezout theorem, the system
      begin{cases} p=c \ x^2+y^2=Rend{cases}



      has at most $2n$ real solutions, hence $p^{-1}(c)$ has at most $n$ connected components.










      share|cite|improve this question











      $endgroup$




      Is it true that a polynomial submersion $ p: mathbb{R}^2 to mathbb{R}$ of degree $n$ has at most $n$ connected components on each level?



      I think I have a proof, can someone point me out any mistakes?



      Let $cin mathbb{R}$.



      Since $p$ is a submersion, $p-c$ doesn't have a $(x^2+y^2-R)$ factor for any $Rin mathbb{R}^+$.
      Also, each connected component of $p^{-1}(c)$ must intersect $x^2+y^2-R=0$ at least twice, for every $R$ big enough.



      By Bezout theorem, the system
      begin{cases} p=c \ x^2+y^2=Rend{cases}



      has at most $2n$ real solutions, hence $p^{-1}(c)$ has at most $n$ connected components.







      algebraic-geometry algebraic-curves






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Jan 3 at 17:01







      F.F

















      asked Sep 15 '18 at 0:49









      F.FF.F

      263




      263






















          0






          active

          oldest

          votes











          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%2f2917380%2fconnected-levels-and-polynomials-submersions%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          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%2f2917380%2fconnected-levels-and-polynomials-submersions%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

          android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

          SQL update select statement

          'app-layout' is not a known element: how to share Component with different Modules