Bolzano's theorem for real closed field.












1












$begingroup$



Take any real closed field $K$ and denote its unique ordering by $leq$. Prove if $f in K[X]$ and $a,b in K$ such that $a<b$ and $f(a) < 0 < f(b)$, then there is $c$ that $f(c)=0$.




I want use the fact that if we have real closed field $K$, so every polynomial $ f in K[X]$ splits into irreducible factors of the form $X-a$ or $(X-a)^2 + b^2$ where $a,b in K[X]$.



Let $f(x) = (x-d)((x-d)^2 + e^2))$ $ $ $d,e in K$ and assume that for some $a,b in K$: $a<b$, $f(a)f(b) < 0. $



$h(x)=(x-d)$ and $g(x)=(x-d)^2+e^2$



$sign(f)=sign(h)sing(g)$. Since $sign(g)=1$, so $sign(f)=sign(h)$. Assume that $sign(h(a))=sign(h(b)).$ It implies that $sign(f(a))=sign(f(b))$ which contradicts with $f(a)f(b)<0$, so we have $h(a)h(b)<0$.



Then $$h(a)<0<h(b)$$
$$a-d <0 <b-d$$
$$c:=d in [a,b]$$ is a root of $f(x)$.



Is that correct?










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    This is correct but you still need to treat the general case when $f$ is a product of possibly more than two irreducible polynomials.
    $endgroup$
    – nombre
    Dec 12 '18 at 20:30
















1












$begingroup$



Take any real closed field $K$ and denote its unique ordering by $leq$. Prove if $f in K[X]$ and $a,b in K$ such that $a<b$ and $f(a) < 0 < f(b)$, then there is $c$ that $f(c)=0$.




I want use the fact that if we have real closed field $K$, so every polynomial $ f in K[X]$ splits into irreducible factors of the form $X-a$ or $(X-a)^2 + b^2$ where $a,b in K[X]$.



Let $f(x) = (x-d)((x-d)^2 + e^2))$ $ $ $d,e in K$ and assume that for some $a,b in K$: $a<b$, $f(a)f(b) < 0. $



$h(x)=(x-d)$ and $g(x)=(x-d)^2+e^2$



$sign(f)=sign(h)sing(g)$. Since $sign(g)=1$, so $sign(f)=sign(h)$. Assume that $sign(h(a))=sign(h(b)).$ It implies that $sign(f(a))=sign(f(b))$ which contradicts with $f(a)f(b)<0$, so we have $h(a)h(b)<0$.



Then $$h(a)<0<h(b)$$
$$a-d <0 <b-d$$
$$c:=d in [a,b]$$ is a root of $f(x)$.



Is that correct?










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    This is correct but you still need to treat the general case when $f$ is a product of possibly more than two irreducible polynomials.
    $endgroup$
    – nombre
    Dec 12 '18 at 20:30














1












1








1





$begingroup$



Take any real closed field $K$ and denote its unique ordering by $leq$. Prove if $f in K[X]$ and $a,b in K$ such that $a<b$ and $f(a) < 0 < f(b)$, then there is $c$ that $f(c)=0$.




I want use the fact that if we have real closed field $K$, so every polynomial $ f in K[X]$ splits into irreducible factors of the form $X-a$ or $(X-a)^2 + b^2$ where $a,b in K[X]$.



Let $f(x) = (x-d)((x-d)^2 + e^2))$ $ $ $d,e in K$ and assume that for some $a,b in K$: $a<b$, $f(a)f(b) < 0. $



$h(x)=(x-d)$ and $g(x)=(x-d)^2+e^2$



$sign(f)=sign(h)sing(g)$. Since $sign(g)=1$, so $sign(f)=sign(h)$. Assume that $sign(h(a))=sign(h(b)).$ It implies that $sign(f(a))=sign(f(b))$ which contradicts with $f(a)f(b)<0$, so we have $h(a)h(b)<0$.



Then $$h(a)<0<h(b)$$
$$a-d <0 <b-d$$
$$c:=d in [a,b]$$ is a root of $f(x)$.



Is that correct?










share|cite|improve this question









$endgroup$





Take any real closed field $K$ and denote its unique ordering by $leq$. Prove if $f in K[X]$ and $a,b in K$ such that $a<b$ and $f(a) < 0 < f(b)$, then there is $c$ that $f(c)=0$.




I want use the fact that if we have real closed field $K$, so every polynomial $ f in K[X]$ splits into irreducible factors of the form $X-a$ or $(X-a)^2 + b^2$ where $a,b in K[X]$.



Let $f(x) = (x-d)((x-d)^2 + e^2))$ $ $ $d,e in K$ and assume that for some $a,b in K$: $a<b$, $f(a)f(b) < 0. $



$h(x)=(x-d)$ and $g(x)=(x-d)^2+e^2$



$sign(f)=sign(h)sing(g)$. Since $sign(g)=1$, so $sign(f)=sign(h)$. Assume that $sign(h(a))=sign(h(b)).$ It implies that $sign(f(a))=sign(f(b))$ which contradicts with $f(a)f(b)<0$, so we have $h(a)h(b)<0$.



Then $$h(a)<0<h(b)$$
$$a-d <0 <b-d$$
$$c:=d in [a,b]$$ is a root of $f(x)$.



Is that correct?







field-theory ordered-fields






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 12 '18 at 19:29









HikiciankaHikicianka

1448




1448








  • 1




    $begingroup$
    This is correct but you still need to treat the general case when $f$ is a product of possibly more than two irreducible polynomials.
    $endgroup$
    – nombre
    Dec 12 '18 at 20:30














  • 1




    $begingroup$
    This is correct but you still need to treat the general case when $f$ is a product of possibly more than two irreducible polynomials.
    $endgroup$
    – nombre
    Dec 12 '18 at 20:30








1




1




$begingroup$
This is correct but you still need to treat the general case when $f$ is a product of possibly more than two irreducible polynomials.
$endgroup$
– nombre
Dec 12 '18 at 20:30




$begingroup$
This is correct but you still need to treat the general case when $f$ is a product of possibly more than two irreducible polynomials.
$endgroup$
– nombre
Dec 12 '18 at 20:30










1 Answer
1






active

oldest

votes


















1












$begingroup$

Yes. You assume that
$sign(h(a)) = sign(h(b))$. Then we have $sign(f(a)) = sign(f(b)) $, but we know that $ f(a) < f(b) $. Hence $ h(a)h(b) < 0 $ and we have



$$
left.
begin{array}{l}
h(a) =& a - d\
h(b) =& b - d
end{array}
right}
Longrightarrow a - d < b - d
$$

Let $c := d$, then
$$
a < c < b quad Longrightarrow quad h(a) < h(c) = 0 < h(b)
$$






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%2f3037121%2fbolzanos-theorem-for-real-closed-field%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









    1












    $begingroup$

    Yes. You assume that
    $sign(h(a)) = sign(h(b))$. Then we have $sign(f(a)) = sign(f(b)) $, but we know that $ f(a) < f(b) $. Hence $ h(a)h(b) < 0 $ and we have



    $$
    left.
    begin{array}{l}
    h(a) =& a - d\
    h(b) =& b - d
    end{array}
    right}
    Longrightarrow a - d < b - d
    $$

    Let $c := d$, then
    $$
    a < c < b quad Longrightarrow quad h(a) < h(c) = 0 < h(b)
    $$






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      Yes. You assume that
      $sign(h(a)) = sign(h(b))$. Then we have $sign(f(a)) = sign(f(b)) $, but we know that $ f(a) < f(b) $. Hence $ h(a)h(b) < 0 $ and we have



      $$
      left.
      begin{array}{l}
      h(a) =& a - d\
      h(b) =& b - d
      end{array}
      right}
      Longrightarrow a - d < b - d
      $$

      Let $c := d$, then
      $$
      a < c < b quad Longrightarrow quad h(a) < h(c) = 0 < h(b)
      $$






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        Yes. You assume that
        $sign(h(a)) = sign(h(b))$. Then we have $sign(f(a)) = sign(f(b)) $, but we know that $ f(a) < f(b) $. Hence $ h(a)h(b) < 0 $ and we have



        $$
        left.
        begin{array}{l}
        h(a) =& a - d\
        h(b) =& b - d
        end{array}
        right}
        Longrightarrow a - d < b - d
        $$

        Let $c := d$, then
        $$
        a < c < b quad Longrightarrow quad h(a) < h(c) = 0 < h(b)
        $$






        share|cite|improve this answer









        $endgroup$



        Yes. You assume that
        $sign(h(a)) = sign(h(b))$. Then we have $sign(f(a)) = sign(f(b)) $, but we know that $ f(a) < f(b) $. Hence $ h(a)h(b) < 0 $ and we have



        $$
        left.
        begin{array}{l}
        h(a) =& a - d\
        h(b) =& b - d
        end{array}
        right}
        Longrightarrow a - d < b - d
        $$

        Let $c := d$, then
        $$
        a < c < b quad Longrightarrow quad h(a) < h(c) = 0 < h(b)
        $$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 12 '18 at 20:24









        nowek7nowek7

        383




        383






























            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%2f3037121%2fbolzanos-theorem-for-real-closed-field%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

            Plaza Victoria

            Puebla de Zaragoza

            Musa