Using the chebychev inequality in the absence of st.dev but known max value











up vote
0
down vote

favorite












A random variable X takes the maximum value of 80, and has a mean equal to 50. Give the best upper bound on P(X<=20).



So is it possible to use the Chebychev inequality here. Note that both values are 30 away from the mean. So is it correct to say that because P(X>=80) = 0 , then because P(X<=20) involves a similar calculation (because both values are 30 away from the mean), it would follow that P(X<=20) = 0 as well.



NOTE: We do not have the distribution of the RV.










share|cite|improve this question






















  • "So is it possible to use the Chebychev inequality here." Erm, no, why would it be?
    – Clement C.
    Nov 16 at 19:16












  • (There are r.v.'s satisfying the assumptions which are not even in $L^2$, i.e. do not have a standard deviation. How do you expect to apply Chebyshev's inequality?)
    – Clement C.
    Nov 16 at 19:20










  • Either of these three inequalities have to be used: Markov, Chebychev and Chernoff. Since Markov inequality is pretty loose here and the chernoff can only be used for RV's that take the values between 0 and 1, I asked for Chebychev. Do you know another way to get a good upper bound?
    – helloworld
    Nov 16 at 19:20










  • You can only use Markov, that's the only one among the three inequalities you list which can apply here given the assumptions.
    – Clement C.
    Nov 16 at 19:21












  • Alright, thank you.
    – helloworld
    Nov 16 at 19:25















up vote
0
down vote

favorite












A random variable X takes the maximum value of 80, and has a mean equal to 50. Give the best upper bound on P(X<=20).



So is it possible to use the Chebychev inequality here. Note that both values are 30 away from the mean. So is it correct to say that because P(X>=80) = 0 , then because P(X<=20) involves a similar calculation (because both values are 30 away from the mean), it would follow that P(X<=20) = 0 as well.



NOTE: We do not have the distribution of the RV.










share|cite|improve this question






















  • "So is it possible to use the Chebychev inequality here." Erm, no, why would it be?
    – Clement C.
    Nov 16 at 19:16












  • (There are r.v.'s satisfying the assumptions which are not even in $L^2$, i.e. do not have a standard deviation. How do you expect to apply Chebyshev's inequality?)
    – Clement C.
    Nov 16 at 19:20










  • Either of these three inequalities have to be used: Markov, Chebychev and Chernoff. Since Markov inequality is pretty loose here and the chernoff can only be used for RV's that take the values between 0 and 1, I asked for Chebychev. Do you know another way to get a good upper bound?
    – helloworld
    Nov 16 at 19:20










  • You can only use Markov, that's the only one among the three inequalities you list which can apply here given the assumptions.
    – Clement C.
    Nov 16 at 19:21












  • Alright, thank you.
    – helloworld
    Nov 16 at 19:25













up vote
0
down vote

favorite









up vote
0
down vote

favorite











A random variable X takes the maximum value of 80, and has a mean equal to 50. Give the best upper bound on P(X<=20).



So is it possible to use the Chebychev inequality here. Note that both values are 30 away from the mean. So is it correct to say that because P(X>=80) = 0 , then because P(X<=20) involves a similar calculation (because both values are 30 away from the mean), it would follow that P(X<=20) = 0 as well.



NOTE: We do not have the distribution of the RV.










share|cite|improve this question













A random variable X takes the maximum value of 80, and has a mean equal to 50. Give the best upper bound on P(X<=20).



So is it possible to use the Chebychev inequality here. Note that both values are 30 away from the mean. So is it correct to say that because P(X>=80) = 0 , then because P(X<=20) involves a similar calculation (because both values are 30 away from the mean), it would follow that P(X<=20) = 0 as well.



NOTE: We do not have the distribution of the RV.







probability upper-lower-bounds






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 16 at 19:14









helloworld

477




477












  • "So is it possible to use the Chebychev inequality here." Erm, no, why would it be?
    – Clement C.
    Nov 16 at 19:16












  • (There are r.v.'s satisfying the assumptions which are not even in $L^2$, i.e. do not have a standard deviation. How do you expect to apply Chebyshev's inequality?)
    – Clement C.
    Nov 16 at 19:20










  • Either of these three inequalities have to be used: Markov, Chebychev and Chernoff. Since Markov inequality is pretty loose here and the chernoff can only be used for RV's that take the values between 0 and 1, I asked for Chebychev. Do you know another way to get a good upper bound?
    – helloworld
    Nov 16 at 19:20










  • You can only use Markov, that's the only one among the three inequalities you list which can apply here given the assumptions.
    – Clement C.
    Nov 16 at 19:21












  • Alright, thank you.
    – helloworld
    Nov 16 at 19:25


















  • "So is it possible to use the Chebychev inequality here." Erm, no, why would it be?
    – Clement C.
    Nov 16 at 19:16












  • (There are r.v.'s satisfying the assumptions which are not even in $L^2$, i.e. do not have a standard deviation. How do you expect to apply Chebyshev's inequality?)
    – Clement C.
    Nov 16 at 19:20










  • Either of these three inequalities have to be used: Markov, Chebychev and Chernoff. Since Markov inequality is pretty loose here and the chernoff can only be used for RV's that take the values between 0 and 1, I asked for Chebychev. Do you know another way to get a good upper bound?
    – helloworld
    Nov 16 at 19:20










  • You can only use Markov, that's the only one among the three inequalities you list which can apply here given the assumptions.
    – Clement C.
    Nov 16 at 19:21












  • Alright, thank you.
    – helloworld
    Nov 16 at 19:25
















"So is it possible to use the Chebychev inequality here." Erm, no, why would it be?
– Clement C.
Nov 16 at 19:16






"So is it possible to use the Chebychev inequality here." Erm, no, why would it be?
– Clement C.
Nov 16 at 19:16














(There are r.v.'s satisfying the assumptions which are not even in $L^2$, i.e. do not have a standard deviation. How do you expect to apply Chebyshev's inequality?)
– Clement C.
Nov 16 at 19:20




(There are r.v.'s satisfying the assumptions which are not even in $L^2$, i.e. do not have a standard deviation. How do you expect to apply Chebyshev's inequality?)
– Clement C.
Nov 16 at 19:20












Either of these three inequalities have to be used: Markov, Chebychev and Chernoff. Since Markov inequality is pretty loose here and the chernoff can only be used for RV's that take the values between 0 and 1, I asked for Chebychev. Do you know another way to get a good upper bound?
– helloworld
Nov 16 at 19:20




Either of these three inequalities have to be used: Markov, Chebychev and Chernoff. Since Markov inequality is pretty loose here and the chernoff can only be used for RV's that take the values between 0 and 1, I asked for Chebychev. Do you know another way to get a good upper bound?
– helloworld
Nov 16 at 19:20












You can only use Markov, that's the only one among the three inequalities you list which can apply here given the assumptions.
– Clement C.
Nov 16 at 19:21






You can only use Markov, that's the only one among the three inequalities you list which can apply here given the assumptions.
– Clement C.
Nov 16 at 19:21














Alright, thank you.
– helloworld
Nov 16 at 19:25




Alright, thank you.
– helloworld
Nov 16 at 19:25










1 Answer
1






active

oldest

votes

















up vote
1
down vote



accepted










You cannot use Chebyshev's inequality here, as you don't even know whether $X$ is square integrable (i.e., $X$ may not even have a standard deviation). (If you want, I can provide an example of such thing.)



So, among the three inequalities you list (Markov, Chebyshev, Chernoff), the only one applicable is the weakest, Markov. Using it on the non-negative r.v. $Y = 80-X$ which has expectation $30$, you get
$$
mathbb{P}{Xleq 20} = mathbb{P}{Ygeq 60} leq frac{mathbb{E}[Y]}{60} = boxed{frac{1}{2}},.
$$



Note further that this bound cannot be improved without further assumptions, as shown by the following example: $X$ taking value $80$ with probability $frac{1}{2}$, and value $20$ with probability $frac{1}{2}$.






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: 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%2f3001535%2fusing-the-chebychev-inequality-in-the-absence-of-st-dev-but-known-max-value%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








    up vote
    1
    down vote



    accepted










    You cannot use Chebyshev's inequality here, as you don't even know whether $X$ is square integrable (i.e., $X$ may not even have a standard deviation). (If you want, I can provide an example of such thing.)



    So, among the three inequalities you list (Markov, Chebyshev, Chernoff), the only one applicable is the weakest, Markov. Using it on the non-negative r.v. $Y = 80-X$ which has expectation $30$, you get
    $$
    mathbb{P}{Xleq 20} = mathbb{P}{Ygeq 60} leq frac{mathbb{E}[Y]}{60} = boxed{frac{1}{2}},.
    $$



    Note further that this bound cannot be improved without further assumptions, as shown by the following example: $X$ taking value $80$ with probability $frac{1}{2}$, and value $20$ with probability $frac{1}{2}$.






    share|cite|improve this answer

























      up vote
      1
      down vote



      accepted










      You cannot use Chebyshev's inequality here, as you don't even know whether $X$ is square integrable (i.e., $X$ may not even have a standard deviation). (If you want, I can provide an example of such thing.)



      So, among the three inequalities you list (Markov, Chebyshev, Chernoff), the only one applicable is the weakest, Markov. Using it on the non-negative r.v. $Y = 80-X$ which has expectation $30$, you get
      $$
      mathbb{P}{Xleq 20} = mathbb{P}{Ygeq 60} leq frac{mathbb{E}[Y]}{60} = boxed{frac{1}{2}},.
      $$



      Note further that this bound cannot be improved without further assumptions, as shown by the following example: $X$ taking value $80$ with probability $frac{1}{2}$, and value $20$ with probability $frac{1}{2}$.






      share|cite|improve this answer























        up vote
        1
        down vote



        accepted







        up vote
        1
        down vote



        accepted






        You cannot use Chebyshev's inequality here, as you don't even know whether $X$ is square integrable (i.e., $X$ may not even have a standard deviation). (If you want, I can provide an example of such thing.)



        So, among the three inequalities you list (Markov, Chebyshev, Chernoff), the only one applicable is the weakest, Markov. Using it on the non-negative r.v. $Y = 80-X$ which has expectation $30$, you get
        $$
        mathbb{P}{Xleq 20} = mathbb{P}{Ygeq 60} leq frac{mathbb{E}[Y]}{60} = boxed{frac{1}{2}},.
        $$



        Note further that this bound cannot be improved without further assumptions, as shown by the following example: $X$ taking value $80$ with probability $frac{1}{2}$, and value $20$ with probability $frac{1}{2}$.






        share|cite|improve this answer












        You cannot use Chebyshev's inequality here, as you don't even know whether $X$ is square integrable (i.e., $X$ may not even have a standard deviation). (If you want, I can provide an example of such thing.)



        So, among the three inequalities you list (Markov, Chebyshev, Chernoff), the only one applicable is the weakest, Markov. Using it on the non-negative r.v. $Y = 80-X$ which has expectation $30$, you get
        $$
        mathbb{P}{Xleq 20} = mathbb{P}{Ygeq 60} leq frac{mathbb{E}[Y]}{60} = boxed{frac{1}{2}},.
        $$



        Note further that this bound cannot be improved without further assumptions, as shown by the following example: $X$ taking value $80$ with probability $frac{1}{2}$, and value $20$ with probability $frac{1}{2}$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 16 at 19:28









        Clement C.

        48.9k33784




        48.9k33784






























            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%2f3001535%2fusing-the-chebychev-inequality-in-the-absence-of-st-dev-but-known-max-value%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

            Biblatex bibliography style without URLs when DOI exists (in Overleaf with Zotero bibliography)

            ComboBox Display Member on multiple fields

            Is it possible to collect Nectar points via Trainline?