Prove the following using Chebyshev and Markov inequality.












2












$begingroup$


Suppose $X$ is a random variable with mean $mu$ and variance $sigma^2$. Show that
$$P(|X-mu| geq ksigma) leq frac{1}{k^2}$$



Question: I know the exercise wants me to use Markov inequality and Chebyshev inequality, but I can't reach the same answer. If someone can help me, it will be appreciated.



Thanks!






probability probability-theory statistics







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    You have stated the standard Chebyshev Inequality. Proofs can be found in many places, including the Wikipedia article.
    $endgroup$
    – André Nicolas
    Nov 28 '15 at 22:12










  • $begingroup$
    Usually the Chebyshev inequality is either written that way or as $P(|X-mu| geq varepsilon) leq frac{sigma^2}{varepsilon^2}$. Starting from the latter way of writing it, you can identify $k$ such that $varepsilon=k sigma$, and then the result follows.
    $endgroup$
    – Ian
    Nov 28 '15 at 22:17










  • $begingroup$
    "I know the exercise want me to use Markov inequality and chebyshev inequality, but I can't reach the same answer." Which answer can you reach?
    $endgroup$
    – Did
    Nov 28 '15 at 22:35
















2












$begingroup$


Suppose $X$ is a random variable with mean $mu$ and variance $sigma^2$. Show that
$$P(|X-mu| geq ksigma) leq frac{1}{k^2}$$



Question: I know the exercise wants me to use Markov inequality and Chebyshev inequality, but I can't reach the same answer. If someone can help me, it will be appreciated.



Thanks!






probability probability-theory statistics







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    You have stated the standard Chebyshev Inequality. Proofs can be found in many places, including the Wikipedia article.
    $endgroup$
    – André Nicolas
    Nov 28 '15 at 22:12










  • $begingroup$
    Usually the Chebyshev inequality is either written that way or as $P(|X-mu| geq varepsilon) leq frac{sigma^2}{varepsilon^2}$. Starting from the latter way of writing it, you can identify $k$ such that $varepsilon=k sigma$, and then the result follows.
    $endgroup$
    – Ian
    Nov 28 '15 at 22:17










  • $begingroup$
    "I know the exercise want me to use Markov inequality and chebyshev inequality, but I can't reach the same answer." Which answer can you reach?
    $endgroup$
    – Did
    Nov 28 '15 at 22:35














2












2








2


1



$begingroup$


Suppose $X$ is a random variable with mean $mu$ and variance $sigma^2$. Show that
$$P(|X-mu| geq ksigma) leq frac{1}{k^2}$$



Question: I know the exercise wants me to use Markov inequality and Chebyshev inequality, but I can't reach the same answer. If someone can help me, it will be appreciated.



Thanks!






probability probability-theory statistics







share|cite|improve this question











$endgroup$




Suppose $X$ is a random variable with mean $mu$ and variance $sigma^2$. Show that
$$P(|X-mu| geq ksigma) leq frac{1}{k^2}$$



Question: I know the exercise wants me to use Markov inequality and Chebyshev inequality, but I can't reach the same answer. If someone can help me, it will be appreciated.



Thanks!






probability probability-theory statistics




probability probability-theory statistics






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 8 '18 at 10:07









Rócherz

2,7762721




2,7762721










asked Nov 28 '15 at 22:05









Electro82Electro82

536218




536218








  • 1




    $begingroup$
    You have stated the standard Chebyshev Inequality. Proofs can be found in many places, including the Wikipedia article.
    $endgroup$
    – André Nicolas
    Nov 28 '15 at 22:12










  • $begingroup$
    Usually the Chebyshev inequality is either written that way or as $P(|X-mu| geq varepsilon) leq frac{sigma^2}{varepsilon^2}$. Starting from the latter way of writing it, you can identify $k$ such that $varepsilon=k sigma$, and then the result follows.
    $endgroup$
    – Ian
    Nov 28 '15 at 22:17










  • $begingroup$
    "I know the exercise want me to use Markov inequality and chebyshev inequality, but I can't reach the same answer." Which answer can you reach?
    $endgroup$
    – Did
    Nov 28 '15 at 22:35














  • 1




    $begingroup$
    You have stated the standard Chebyshev Inequality. Proofs can be found in many places, including the Wikipedia article.
    $endgroup$
    – André Nicolas
    Nov 28 '15 at 22:12










  • $begingroup$
    Usually the Chebyshev inequality is either written that way or as $P(|X-mu| geq varepsilon) leq frac{sigma^2}{varepsilon^2}$. Starting from the latter way of writing it, you can identify $k$ such that $varepsilon=k sigma$, and then the result follows.
    $endgroup$
    – Ian
    Nov 28 '15 at 22:17










  • $begingroup$
    "I know the exercise want me to use Markov inequality and chebyshev inequality, but I can't reach the same answer." Which answer can you reach?
    $endgroup$
    – Did
    Nov 28 '15 at 22:35








1




1




$begingroup$
You have stated the standard Chebyshev Inequality. Proofs can be found in many places, including the Wikipedia article.
$endgroup$
– André Nicolas
Nov 28 '15 at 22:12




$begingroup$
You have stated the standard Chebyshev Inequality. Proofs can be found in many places, including the Wikipedia article.
$endgroup$
– André Nicolas
Nov 28 '15 at 22:12












$begingroup$
Usually the Chebyshev inequality is either written that way or as $P(|X-mu| geq varepsilon) leq frac{sigma^2}{varepsilon^2}$. Starting from the latter way of writing it, you can identify $k$ such that $varepsilon=k sigma$, and then the result follows.
$endgroup$
– Ian
Nov 28 '15 at 22:17




$begingroup$
Usually the Chebyshev inequality is either written that way or as $P(|X-mu| geq varepsilon) leq frac{sigma^2}{varepsilon^2}$. Starting from the latter way of writing it, you can identify $k$ such that $varepsilon=k sigma$, and then the result follows.
$endgroup$
– Ian
Nov 28 '15 at 22:17












$begingroup$
"I know the exercise want me to use Markov inequality and chebyshev inequality, but I can't reach the same answer." Which answer can you reach?
$endgroup$
– Did
Nov 28 '15 at 22:35




$begingroup$
"I know the exercise want me to use Markov inequality and chebyshev inequality, but I can't reach the same answer." Which answer can you reach?
$endgroup$
– Did
Nov 28 '15 at 22:35










2 Answers
2






active

oldest

votes


















1












$begingroup$

The Chebyshev inequality is
$$mathbb{P}(|x - mu| geq a) leq frac{sigma^2}{a^2}$$ .Substituting $$a = ksigma $$gives the answer.






share|cite|improve this answer









$endgroup$





















    1












    $begingroup$

    Thanks André, I found it.



    For any event $A$, let $I_A$ be the indicator random variable of $A$, i.e. $I_A$ equals $1$ if $A$ occurs and $0$ otherwise. Then $newcommand{E}{operatorname{E}}$
    begin{align*}
    Pr(|X-mu| geq ksigma) &=E(I_{|X-mu| geq ksigma}) \
    &= Eleft(I_{left(frac{X-mu}{ksigma}right)^2 geq 1}right) \
    &leq Eleft(left(frac{X-mu}{ksigma}right)^2right) \
    &=frac{1}{k^2} cdot frac{E((X-mu)^2)}{ksigma} \
    &=frac{1}{k^2}.end{align*}






    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%2f1550504%2fprove-the-following-using-chebyshev-and-markov-inequality%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      1












      $begingroup$

      The Chebyshev inequality is
      $$mathbb{P}(|x - mu| geq a) leq frac{sigma^2}{a^2}$$ .Substituting $$a = ksigma $$gives the answer.






      share|cite|improve this answer









      $endgroup$


















        1












        $begingroup$

        The Chebyshev inequality is
        $$mathbb{P}(|x - mu| geq a) leq frac{sigma^2}{a^2}$$ .Substituting $$a = ksigma $$gives the answer.






        share|cite|improve this answer









        $endgroup$
















          1












          1








          1





          $begingroup$

          The Chebyshev inequality is
          $$mathbb{P}(|x - mu| geq a) leq frac{sigma^2}{a^2}$$ .Substituting $$a = ksigma $$gives the answer.






          share|cite|improve this answer









          $endgroup$



          The Chebyshev inequality is
          $$mathbb{P}(|x - mu| geq a) leq frac{sigma^2}{a^2}$$ .Substituting $$a = ksigma $$gives the answer.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 28 '15 at 22:18









          Milen IvanovMilen Ivanov

          884311




          884311























              1












              $begingroup$

              Thanks André, I found it.



              For any event $A$, let $I_A$ be the indicator random variable of $A$, i.e. $I_A$ equals $1$ if $A$ occurs and $0$ otherwise. Then $newcommand{E}{operatorname{E}}$
              begin{align*}
              Pr(|X-mu| geq ksigma) &=E(I_{|X-mu| geq ksigma}) \
              &= Eleft(I_{left(frac{X-mu}{ksigma}right)^2 geq 1}right) \
              &leq Eleft(left(frac{X-mu}{ksigma}right)^2right) \
              &=frac{1}{k^2} cdot frac{E((X-mu)^2)}{ksigma} \
              &=frac{1}{k^2}.end{align*}






              share|cite|improve this answer











              $endgroup$


















                1












                $begingroup$

                Thanks André, I found it.



                For any event $A$, let $I_A$ be the indicator random variable of $A$, i.e. $I_A$ equals $1$ if $A$ occurs and $0$ otherwise. Then $newcommand{E}{operatorname{E}}$
                begin{align*}
                Pr(|X-mu| geq ksigma) &=E(I_{|X-mu| geq ksigma}) \
                &= Eleft(I_{left(frac{X-mu}{ksigma}right)^2 geq 1}right) \
                &leq Eleft(left(frac{X-mu}{ksigma}right)^2right) \
                &=frac{1}{k^2} cdot frac{E((X-mu)^2)}{ksigma} \
                &=frac{1}{k^2}.end{align*}






                share|cite|improve this answer











                $endgroup$
















                  1












                  1








                  1





                  $begingroup$

                  Thanks André, I found it.



                  For any event $A$, let $I_A$ be the indicator random variable of $A$, i.e. $I_A$ equals $1$ if $A$ occurs and $0$ otherwise. Then $newcommand{E}{operatorname{E}}$
                  begin{align*}
                  Pr(|X-mu| geq ksigma) &=E(I_{|X-mu| geq ksigma}) \
                  &= Eleft(I_{left(frac{X-mu}{ksigma}right)^2 geq 1}right) \
                  &leq Eleft(left(frac{X-mu}{ksigma}right)^2right) \
                  &=frac{1}{k^2} cdot frac{E((X-mu)^2)}{ksigma} \
                  &=frac{1}{k^2}.end{align*}






                  share|cite|improve this answer











                  $endgroup$



                  Thanks André, I found it.



                  For any event $A$, let $I_A$ be the indicator random variable of $A$, i.e. $I_A$ equals $1$ if $A$ occurs and $0$ otherwise. Then $newcommand{E}{operatorname{E}}$
                  begin{align*}
                  Pr(|X-mu| geq ksigma) &=E(I_{|X-mu| geq ksigma}) \
                  &= Eleft(I_{left(frac{X-mu}{ksigma}right)^2 geq 1}right) \
                  &leq Eleft(left(frac{X-mu}{ksigma}right)^2right) \
                  &=frac{1}{k^2} cdot frac{E((X-mu)^2)}{ksigma} \
                  &=frac{1}{k^2}.end{align*}







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Dec 8 '18 at 10:14









                  Rócherz

                  2,7762721




                  2,7762721










                  answered Nov 28 '15 at 22:18









                  Electro82Electro82

                  536218




                  536218






























                      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%2f1550504%2fprove-the-following-using-chebyshev-and-markov-inequality%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

                      Aardman Animations

                      Image
                      Aardman Animations, Ltd. Aardman Animations Tipo privada Atividade Animação em stop-motion , Animação em CGI Fundação 1972 Fundador(es) Peter Lord David Sproxton Sede Bristol, Inglaterra  Reino Unido Proprietário(s) Dreamworks Pessoas-chave Peter Lord David Sproxton Nick Park Divisões Aardman Features Aardman Digital Aardman Commercials Aardman Broadcast Aardman International Aardman Rights Aardman Effects Aardman 3-D Systems Aardman Nathan Love AardBoiled Website oficial aardman.com
                      Read more

                      Are they similar matrix

                      Image
                      0 $begingroup$ Do $begin{bmatrix} 0&i&0\0&0&1\0&0&0 end{bmatrix} $ and $begin{bmatrix} 0&0&0\-i&0&0\0&1&0 end{bmatrix} $ are similar.Is this True/false Clearly both are nilpotent and one is conjucate transpose of other but how to know if they are similar.i'm stuck. Please help me linear-algebra vector-spaces eigenvalues-eigenvectors generalizedeigenvector share | cite | improve this question edited Dec 10 '18 at 6:38 Vasanth Kris asked Dec 10 '18 at 6:19
                      Read more

                      “minimization” problem in Euclidean space related to orthonormal basis

                      Image
                      3 $begingroup$ I have stumbled upon an exercice for second year undegraduate student majoring in economics which I find quite demanding. I have an idea for the solution, but it seems awfully complicated, and I am wondering if there was a simpler way to solve it. This goes as follows: Let $(E, langle, rangle)$ be a euclidean space of dimension $n geq 2$ . 1) For any $x in E$ , show that $||x|| = sqrt{n}$ if and only if there exists $(e_1, dots, e_n)$ an orthonormal basis of $E$ such that $x =e_1+ ldots + e_n$ . 2) For any $(x,y) in E$ , show that $||x|| = sqrt{n}$ , $||y|| = sqrt{frac{n(n+1)(2n+1)}{6}}$ and $langle x,y rangle = frac{n(n+1)}{2}$ if and only if there eixsts $(e_1, ldots, e_n)$ an orthonormal basis of $E$ such that $x = e_1 + ldots + e_n$ and $y = e_1 + 2e_2 + ldots + ne_n$ The first q
                      Read more