Bounded functions and infimum/supremum












3














Question from my homework:




A function $f colon S to mathbb{R}$ is said to be decreasing on the domain $S subset mathbb{R}$ if for every $x, y in S$ with $y > x$, we have $f(y) < f(x)$.
Show that if $f colon mathbb{R} to mathbb{R}$ is decreasing and bounded on $mathbb{R}$, then the limits $lim_{x to infty} f(x)$ and $lim_{x to -infty} f(x)$ both exist.



Caution: While this claim is clearly related to the theorem that bounded monotone sequences always converge, it is not an immediate corollary of it.
You will have to use the definition of the limit directly.



(Original picture of the problem here.)




My proof:



Let $ S = {f(x) | x in mathbb{R} } $, since $f$ is bounded this set has both an infimum and supremum. (Is this true? I tried to prove it, but have no idea as it seems fairly obvious.) Now, I claim that $lim_{xto infty} f(x) = inf(S) = L$.



By definition, given $epsilon > 0$, there exists $K in mathbb{R}$ such that $x>K implies |f(x) - L| < epsilon$.



Now since $f(x) geq L$ by definition of the infimum, choose $x_1$ such that $f(x_1) < L + epsilon$ for $x_1 > K$. But since $f$ is a decreasing function we have $f(x) leq f(x_1)$, and thus
$$
L - epsilon < L leq f(x) leq f(x_1) < L + epsilon
$$
which proves our claim.



I use a similar argument for the supremum. Could anyone help me out on making this more rigorous as I feel as though I've skipped some steps.










share|cite|improve this question
















bumped to the homepage by Community 2 days ago


This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.















  • Any bounded set in the real numbers has a sup and an inf. If they are in the set themselves is a different story.
    – LASV
    Dec 4 '13 at 20:36










  • About supremum and infimum you are ok. Now, you are wrong in your way to prove that the limit exists,because you don't prove that such a $K$ exists. All you have to do is to prove this existence.
    – Haha
    Dec 4 '13 at 20:42










  • I don't able to see your question
    – user355797
    Jul 26 '16 at 13:32










  • anyone edit so that I try to solve that question
    – user355797
    Jul 26 '16 at 13:33
















3














Question from my homework:




A function $f colon S to mathbb{R}$ is said to be decreasing on the domain $S subset mathbb{R}$ if for every $x, y in S$ with $y > x$, we have $f(y) < f(x)$.
Show that if $f colon mathbb{R} to mathbb{R}$ is decreasing and bounded on $mathbb{R}$, then the limits $lim_{x to infty} f(x)$ and $lim_{x to -infty} f(x)$ both exist.



Caution: While this claim is clearly related to the theorem that bounded monotone sequences always converge, it is not an immediate corollary of it.
You will have to use the definition of the limit directly.



(Original picture of the problem here.)




My proof:



Let $ S = {f(x) | x in mathbb{R} } $, since $f$ is bounded this set has both an infimum and supremum. (Is this true? I tried to prove it, but have no idea as it seems fairly obvious.) Now, I claim that $lim_{xto infty} f(x) = inf(S) = L$.



By definition, given $epsilon > 0$, there exists $K in mathbb{R}$ such that $x>K implies |f(x) - L| < epsilon$.



Now since $f(x) geq L$ by definition of the infimum, choose $x_1$ such that $f(x_1) < L + epsilon$ for $x_1 > K$. But since $f$ is a decreasing function we have $f(x) leq f(x_1)$, and thus
$$
L - epsilon < L leq f(x) leq f(x_1) < L + epsilon
$$
which proves our claim.



I use a similar argument for the supremum. Could anyone help me out on making this more rigorous as I feel as though I've skipped some steps.










share|cite|improve this question
















bumped to the homepage by Community 2 days ago


This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.















  • Any bounded set in the real numbers has a sup and an inf. If they are in the set themselves is a different story.
    – LASV
    Dec 4 '13 at 20:36










  • About supremum and infimum you are ok. Now, you are wrong in your way to prove that the limit exists,because you don't prove that such a $K$ exists. All you have to do is to prove this existence.
    – Haha
    Dec 4 '13 at 20:42










  • I don't able to see your question
    – user355797
    Jul 26 '16 at 13:32










  • anyone edit so that I try to solve that question
    – user355797
    Jul 26 '16 at 13:33














3












3








3


2





Question from my homework:




A function $f colon S to mathbb{R}$ is said to be decreasing on the domain $S subset mathbb{R}$ if for every $x, y in S$ with $y > x$, we have $f(y) < f(x)$.
Show that if $f colon mathbb{R} to mathbb{R}$ is decreasing and bounded on $mathbb{R}$, then the limits $lim_{x to infty} f(x)$ and $lim_{x to -infty} f(x)$ both exist.



Caution: While this claim is clearly related to the theorem that bounded monotone sequences always converge, it is not an immediate corollary of it.
You will have to use the definition of the limit directly.



(Original picture of the problem here.)




My proof:



Let $ S = {f(x) | x in mathbb{R} } $, since $f$ is bounded this set has both an infimum and supremum. (Is this true? I tried to prove it, but have no idea as it seems fairly obvious.) Now, I claim that $lim_{xto infty} f(x) = inf(S) = L$.



By definition, given $epsilon > 0$, there exists $K in mathbb{R}$ such that $x>K implies |f(x) - L| < epsilon$.



Now since $f(x) geq L$ by definition of the infimum, choose $x_1$ such that $f(x_1) < L + epsilon$ for $x_1 > K$. But since $f$ is a decreasing function we have $f(x) leq f(x_1)$, and thus
$$
L - epsilon < L leq f(x) leq f(x_1) < L + epsilon
$$
which proves our claim.



I use a similar argument for the supremum. Could anyone help me out on making this more rigorous as I feel as though I've skipped some steps.










share|cite|improve this question















Question from my homework:




A function $f colon S to mathbb{R}$ is said to be decreasing on the domain $S subset mathbb{R}$ if for every $x, y in S$ with $y > x$, we have $f(y) < f(x)$.
Show that if $f colon mathbb{R} to mathbb{R}$ is decreasing and bounded on $mathbb{R}$, then the limits $lim_{x to infty} f(x)$ and $lim_{x to -infty} f(x)$ both exist.



Caution: While this claim is clearly related to the theorem that bounded monotone sequences always converge, it is not an immediate corollary of it.
You will have to use the definition of the limit directly.



(Original picture of the problem here.)




My proof:



Let $ S = {f(x) | x in mathbb{R} } $, since $f$ is bounded this set has both an infimum and supremum. (Is this true? I tried to prove it, but have no idea as it seems fairly obvious.) Now, I claim that $lim_{xto infty} f(x) = inf(S) = L$.



By definition, given $epsilon > 0$, there exists $K in mathbb{R}$ such that $x>K implies |f(x) - L| < epsilon$.



Now since $f(x) geq L$ by definition of the infimum, choose $x_1$ such that $f(x_1) < L + epsilon$ for $x_1 > K$. But since $f$ is a decreasing function we have $f(x) leq f(x_1)$, and thus
$$
L - epsilon < L leq f(x) leq f(x_1) < L + epsilon
$$
which proves our claim.



I use a similar argument for the supremum. Could anyone help me out on making this more rigorous as I feel as though I've skipped some steps.







analysis supremum-and-infimum






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 27 '18 at 11:17









Jendrik Stelzner

7,82121339




7,82121339










asked Dec 4 '13 at 20:22









DH.

44115




44115





bumped to the homepage by Community 2 days ago


This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.







bumped to the homepage by Community 2 days ago


This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.














  • Any bounded set in the real numbers has a sup and an inf. If they are in the set themselves is a different story.
    – LASV
    Dec 4 '13 at 20:36










  • About supremum and infimum you are ok. Now, you are wrong in your way to prove that the limit exists,because you don't prove that such a $K$ exists. All you have to do is to prove this existence.
    – Haha
    Dec 4 '13 at 20:42










  • I don't able to see your question
    – user355797
    Jul 26 '16 at 13:32










  • anyone edit so that I try to solve that question
    – user355797
    Jul 26 '16 at 13:33


















  • Any bounded set in the real numbers has a sup and an inf. If they are in the set themselves is a different story.
    – LASV
    Dec 4 '13 at 20:36










  • About supremum and infimum you are ok. Now, you are wrong in your way to prove that the limit exists,because you don't prove that such a $K$ exists. All you have to do is to prove this existence.
    – Haha
    Dec 4 '13 at 20:42










  • I don't able to see your question
    – user355797
    Jul 26 '16 at 13:32










  • anyone edit so that I try to solve that question
    – user355797
    Jul 26 '16 at 13:33
















Any bounded set in the real numbers has a sup and an inf. If they are in the set themselves is a different story.
– LASV
Dec 4 '13 at 20:36




Any bounded set in the real numbers has a sup and an inf. If they are in the set themselves is a different story.
– LASV
Dec 4 '13 at 20:36












About supremum and infimum you are ok. Now, you are wrong in your way to prove that the limit exists,because you don't prove that such a $K$ exists. All you have to do is to prove this existence.
– Haha
Dec 4 '13 at 20:42




About supremum and infimum you are ok. Now, you are wrong in your way to prove that the limit exists,because you don't prove that such a $K$ exists. All you have to do is to prove this existence.
– Haha
Dec 4 '13 at 20:42












I don't able to see your question
– user355797
Jul 26 '16 at 13:32




I don't able to see your question
– user355797
Jul 26 '16 at 13:32












anyone edit so that I try to solve that question
– user355797
Jul 26 '16 at 13:33




anyone edit so that I try to solve that question
– user355797
Jul 26 '16 at 13:33










1 Answer
1






active

oldest

votes


















0














I think you are almost there. I would proceed like this:
For $epsilon > 0$ be a given, there exists an $x^{*}$ such that $f(x^{*}) < L + epsilon $. So let $K = |x^{*}| + 1 > 0$, then for all $x$'s such that $x > K$ we have: $f(x) < f(K) < f(x^{*}) < L + epsilon$. But $L < f(x)$ since it is $text{inf}{f(x): x in mathbb{R}}$. So
$L - epsilon < L < f(x) < L + epsilon$. This means $|f(x) - L| < epsilon$ and we're done.






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',
    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%2f593029%2fbounded-functions-and-infimum-supremum%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









    0














    I think you are almost there. I would proceed like this:
    For $epsilon > 0$ be a given, there exists an $x^{*}$ such that $f(x^{*}) < L + epsilon $. So let $K = |x^{*}| + 1 > 0$, then for all $x$'s such that $x > K$ we have: $f(x) < f(K) < f(x^{*}) < L + epsilon$. But $L < f(x)$ since it is $text{inf}{f(x): x in mathbb{R}}$. So
    $L - epsilon < L < f(x) < L + epsilon$. This means $|f(x) - L| < epsilon$ and we're done.






    share|cite|improve this answer




























      0














      I think you are almost there. I would proceed like this:
      For $epsilon > 0$ be a given, there exists an $x^{*}$ such that $f(x^{*}) < L + epsilon $. So let $K = |x^{*}| + 1 > 0$, then for all $x$'s such that $x > K$ we have: $f(x) < f(K) < f(x^{*}) < L + epsilon$. But $L < f(x)$ since it is $text{inf}{f(x): x in mathbb{R}}$. So
      $L - epsilon < L < f(x) < L + epsilon$. This means $|f(x) - L| < epsilon$ and we're done.






      share|cite|improve this answer


























        0












        0








        0






        I think you are almost there. I would proceed like this:
        For $epsilon > 0$ be a given, there exists an $x^{*}$ such that $f(x^{*}) < L + epsilon $. So let $K = |x^{*}| + 1 > 0$, then for all $x$'s such that $x > K$ we have: $f(x) < f(K) < f(x^{*}) < L + epsilon$. But $L < f(x)$ since it is $text{inf}{f(x): x in mathbb{R}}$. So
        $L - epsilon < L < f(x) < L + epsilon$. This means $|f(x) - L| < epsilon$ and we're done.






        share|cite|improve this answer














        I think you are almost there. I would proceed like this:
        For $epsilon > 0$ be a given, there exists an $x^{*}$ such that $f(x^{*}) < L + epsilon $. So let $K = |x^{*}| + 1 > 0$, then for all $x$'s such that $x > K$ we have: $f(x) < f(K) < f(x^{*}) < L + epsilon$. But $L < f(x)$ since it is $text{inf}{f(x): x in mathbb{R}}$. So
        $L - epsilon < L < f(x) < L + epsilon$. This means $|f(x) - L| < epsilon$ and we're done.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Jul 26 '16 at 23:13

























        answered Dec 4 '13 at 20:51









        DeepSea

        70.9k54487




        70.9k54487






























            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            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%2f593029%2fbounded-functions-and-infimum-supremum%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

            1300-talet

            1300-talet

            Display a custom attribute below product name in the front-end Magento 1.9.3.8