Is the kth central moment less than the kth raw moment for even k?












5












$begingroup$


If $X$ is a real-valued random variable, then the $k$th raw moment is $mathbb{E}[X^k]$, while the $k$th central moment is $mathbb{E}[(X-mathbb{E}[X])^k]$. If $k$ is even, is the $k$th central moment always bounded above the $k$th raw moment?



When $k = 2$, then $mathbb{E}[(X-mathbb{E}[X])^2] = mathbb{E}[X^2]-mathbb{E}[X]^2$, and because $mathbb{E}[X]^2$ is always positive, it follows that this is less than or equal to $mathbb{E}[X^2]$. But I'm having trouble extending this to larger moments.










share|cite|improve this question











$endgroup$

















    5












    $begingroup$


    If $X$ is a real-valued random variable, then the $k$th raw moment is $mathbb{E}[X^k]$, while the $k$th central moment is $mathbb{E}[(X-mathbb{E}[X])^k]$. If $k$ is even, is the $k$th central moment always bounded above the $k$th raw moment?



    When $k = 2$, then $mathbb{E}[(X-mathbb{E}[X])^2] = mathbb{E}[X^2]-mathbb{E}[X]^2$, and because $mathbb{E}[X]^2$ is always positive, it follows that this is less than or equal to $mathbb{E}[X^2]$. But I'm having trouble extending this to larger moments.










    share|cite|improve this question











    $endgroup$















      5












      5








      5


      1



      $begingroup$


      If $X$ is a real-valued random variable, then the $k$th raw moment is $mathbb{E}[X^k]$, while the $k$th central moment is $mathbb{E}[(X-mathbb{E}[X])^k]$. If $k$ is even, is the $k$th central moment always bounded above the $k$th raw moment?



      When $k = 2$, then $mathbb{E}[(X-mathbb{E}[X])^2] = mathbb{E}[X^2]-mathbb{E}[X]^2$, and because $mathbb{E}[X]^2$ is always positive, it follows that this is less than or equal to $mathbb{E}[X^2]$. But I'm having trouble extending this to larger moments.










      share|cite|improve this question











      $endgroup$




      If $X$ is a real-valued random variable, then the $k$th raw moment is $mathbb{E}[X^k]$, while the $k$th central moment is $mathbb{E}[(X-mathbb{E}[X])^k]$. If $k$ is even, is the $k$th central moment always bounded above the $k$th raw moment?



      When $k = 2$, then $mathbb{E}[(X-mathbb{E}[X])^2] = mathbb{E}[X^2]-mathbb{E}[X]^2$, and because $mathbb{E}[X]^2$ is always positive, it follows that this is less than or equal to $mathbb{E}[X^2]$. But I'm having trouble extending this to larger moments.







      probability inequality expectation






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 28 '15 at 22:53









      Davide Giraudo

      126k16150261




      126k16150261










      asked Dec 28 '15 at 3:09









      user13491user13491

      283




      283






















          2 Answers
          2






          active

          oldest

          votes


















          5












          $begingroup$

          The statement is not true in general and it is easy to construct a counterexample. For example, we want $mathbb{E}(X^4)leq mathbb{E}((X-mathbb{E}(X))^4)$, we can let $X$ has a small probability of taking a large positive value, while keeping $mathbb{E}(X)$ negative. Let
          $X$ be a random variable with $P(X=-2)=1-epsilon$ and $P(x=M)=epsilon$. We choose $epsilon=1/(M+2)$ such that $mathbb{E}(X)=-1$.



          Then we have
          $$
          mathbb{E}(X^2)=M+2,quad mathbb{E}((X-mathbb{E}(X))^2)=M+1
          $$
          and
          $$
          mathbb{E}(X^4)=M^3-2M^2+4M+8,quad mathbb{E}((X-mathbb{E}(X))^4)=M^3+2M^2+2M+1.
          $$
          Obviously, if $M$ is large enough, we have $mathbb{E}(X^4)leq mathbb{E}((X-mathbb{E}(X))^4)$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thanks! Is it also easy to construct counterexamples in the case when $X$ is always positive?
            $endgroup$
            – user13491
            Dec 28 '15 at 15:36










          • $begingroup$
            If $X$ is always positive, so is $mathbb{E}(X)$. As a result $|X-mathbb{E}(X)|leq |X|$, and of course $mathbb{E}big((X-mathbb{E}(X))^kbig)leq mathbb{E}(X^k)$.
            $endgroup$
            – yhhuang
            Dec 28 '15 at 16:51






          • 2




            $begingroup$
            $X-mathbb{E}[X]$ might be negative, so I don't think it's necessarily true that $|X-mathbb{E}[X]| leq |X|$. For example, if $X = 1$ or $X = 9$, with equal probability.
            $endgroup$
            – user13491
            Dec 28 '15 at 23:04



















          1












          $begingroup$

          To complement the accepted answer,
          we can show that $E[(X - E[X])^m] leq E[X^m]$ when $X geq 0$.
          Assume without loss of generality that $E[X] = 1$ (rescaling $X$ if necessary).
          Then, omitting the dependence on $omega$ for notational convenience,
          begin{align}
          & int_{Omega} X^m , d Omega - int_{Omega} (X - 1)^m , dP(omega) \
          & quad =
          int_{X leq 1/2} left[ X^m - (X - 1)^m right] , dP(omega) +
          int_{1/2 < X leq 1} left[ X^m - (X - 1)^m right] , dP(omega) \
          & quad + int_{X > 1} left[ X^m - (X - 1)^m right] , dP(omega). \
          & quad geq
          int_{X leq 1/2} left[ X^m - (X - 1)^m right] , dP(omega)
          + int_{X > 1} left[ X^m - (X - 1)^m right] , dP(omega)
          =: I_1 + I_2.
          end{align}

          For $m$ odd, both $I_1$ and $I_2$ are positive and the statement is proved.
          We assume from now on that $m$ is even.
          It is easy to see that:
          begin{align}
          |a^m - (a - 1)^m| leq (1 - a) quad & text{ if } quad 0 leq a leq 1/2; \
          a^m - (a - 1)^m geq (a - 1) quad & text{ if } quad a > 1.
          end{align}

          Using these inequalities, we deduce that
          $$ I_1 + I_2 geq int_{X > 1} (X - 1) , dP(omega) - int_{X leq 1/2} (1 - X) , dP(omega). $$
          To conclude, we note that,
          by definition of the expected value,
          begin{align}
          & int_{X leq 1/2} (X(omega) - 1) , dP(omega) + int_{1/2 < X leq 1} (X(omega) - 1) , dP(omega) + int_{X > 1} (X(omega) - 1) , dP(omega) = 0 \
          & rightarrow int_{X > 1} (X(omega) - 1) , dP(omega) geq int_{X leq 1/2} (1 - X(omega)) , dP(omega).
          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%2f1591161%2fis-the-kth-central-moment-less-than-the-kth-raw-moment-for-even-k%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









            5












            $begingroup$

            The statement is not true in general and it is easy to construct a counterexample. For example, we want $mathbb{E}(X^4)leq mathbb{E}((X-mathbb{E}(X))^4)$, we can let $X$ has a small probability of taking a large positive value, while keeping $mathbb{E}(X)$ negative. Let
            $X$ be a random variable with $P(X=-2)=1-epsilon$ and $P(x=M)=epsilon$. We choose $epsilon=1/(M+2)$ such that $mathbb{E}(X)=-1$.



            Then we have
            $$
            mathbb{E}(X^2)=M+2,quad mathbb{E}((X-mathbb{E}(X))^2)=M+1
            $$
            and
            $$
            mathbb{E}(X^4)=M^3-2M^2+4M+8,quad mathbb{E}((X-mathbb{E}(X))^4)=M^3+2M^2+2M+1.
            $$
            Obviously, if $M$ is large enough, we have $mathbb{E}(X^4)leq mathbb{E}((X-mathbb{E}(X))^4)$.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Thanks! Is it also easy to construct counterexamples in the case when $X$ is always positive?
              $endgroup$
              – user13491
              Dec 28 '15 at 15:36










            • $begingroup$
              If $X$ is always positive, so is $mathbb{E}(X)$. As a result $|X-mathbb{E}(X)|leq |X|$, and of course $mathbb{E}big((X-mathbb{E}(X))^kbig)leq mathbb{E}(X^k)$.
              $endgroup$
              – yhhuang
              Dec 28 '15 at 16:51






            • 2




              $begingroup$
              $X-mathbb{E}[X]$ might be negative, so I don't think it's necessarily true that $|X-mathbb{E}[X]| leq |X|$. For example, if $X = 1$ or $X = 9$, with equal probability.
              $endgroup$
              – user13491
              Dec 28 '15 at 23:04
















            5












            $begingroup$

            The statement is not true in general and it is easy to construct a counterexample. For example, we want $mathbb{E}(X^4)leq mathbb{E}((X-mathbb{E}(X))^4)$, we can let $X$ has a small probability of taking a large positive value, while keeping $mathbb{E}(X)$ negative. Let
            $X$ be a random variable with $P(X=-2)=1-epsilon$ and $P(x=M)=epsilon$. We choose $epsilon=1/(M+2)$ such that $mathbb{E}(X)=-1$.



            Then we have
            $$
            mathbb{E}(X^2)=M+2,quad mathbb{E}((X-mathbb{E}(X))^2)=M+1
            $$
            and
            $$
            mathbb{E}(X^4)=M^3-2M^2+4M+8,quad mathbb{E}((X-mathbb{E}(X))^4)=M^3+2M^2+2M+1.
            $$
            Obviously, if $M$ is large enough, we have $mathbb{E}(X^4)leq mathbb{E}((X-mathbb{E}(X))^4)$.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Thanks! Is it also easy to construct counterexamples in the case when $X$ is always positive?
              $endgroup$
              – user13491
              Dec 28 '15 at 15:36










            • $begingroup$
              If $X$ is always positive, so is $mathbb{E}(X)$. As a result $|X-mathbb{E}(X)|leq |X|$, and of course $mathbb{E}big((X-mathbb{E}(X))^kbig)leq mathbb{E}(X^k)$.
              $endgroup$
              – yhhuang
              Dec 28 '15 at 16:51






            • 2




              $begingroup$
              $X-mathbb{E}[X]$ might be negative, so I don't think it's necessarily true that $|X-mathbb{E}[X]| leq |X|$. For example, if $X = 1$ or $X = 9$, with equal probability.
              $endgroup$
              – user13491
              Dec 28 '15 at 23:04














            5












            5








            5





            $begingroup$

            The statement is not true in general and it is easy to construct a counterexample. For example, we want $mathbb{E}(X^4)leq mathbb{E}((X-mathbb{E}(X))^4)$, we can let $X$ has a small probability of taking a large positive value, while keeping $mathbb{E}(X)$ negative. Let
            $X$ be a random variable with $P(X=-2)=1-epsilon$ and $P(x=M)=epsilon$. We choose $epsilon=1/(M+2)$ such that $mathbb{E}(X)=-1$.



            Then we have
            $$
            mathbb{E}(X^2)=M+2,quad mathbb{E}((X-mathbb{E}(X))^2)=M+1
            $$
            and
            $$
            mathbb{E}(X^4)=M^3-2M^2+4M+8,quad mathbb{E}((X-mathbb{E}(X))^4)=M^3+2M^2+2M+1.
            $$
            Obviously, if $M$ is large enough, we have $mathbb{E}(X^4)leq mathbb{E}((X-mathbb{E}(X))^4)$.






            share|cite|improve this answer









            $endgroup$



            The statement is not true in general and it is easy to construct a counterexample. For example, we want $mathbb{E}(X^4)leq mathbb{E}((X-mathbb{E}(X))^4)$, we can let $X$ has a small probability of taking a large positive value, while keeping $mathbb{E}(X)$ negative. Let
            $X$ be a random variable with $P(X=-2)=1-epsilon$ and $P(x=M)=epsilon$. We choose $epsilon=1/(M+2)$ such that $mathbb{E}(X)=-1$.



            Then we have
            $$
            mathbb{E}(X^2)=M+2,quad mathbb{E}((X-mathbb{E}(X))^2)=M+1
            $$
            and
            $$
            mathbb{E}(X^4)=M^3-2M^2+4M+8,quad mathbb{E}((X-mathbb{E}(X))^4)=M^3+2M^2+2M+1.
            $$
            Obviously, if $M$ is large enough, we have $mathbb{E}(X^4)leq mathbb{E}((X-mathbb{E}(X))^4)$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Dec 28 '15 at 10:18









            yhhuangyhhuang

            1,098415




            1,098415












            • $begingroup$
              Thanks! Is it also easy to construct counterexamples in the case when $X$ is always positive?
              $endgroup$
              – user13491
              Dec 28 '15 at 15:36










            • $begingroup$
              If $X$ is always positive, so is $mathbb{E}(X)$. As a result $|X-mathbb{E}(X)|leq |X|$, and of course $mathbb{E}big((X-mathbb{E}(X))^kbig)leq mathbb{E}(X^k)$.
              $endgroup$
              – yhhuang
              Dec 28 '15 at 16:51






            • 2




              $begingroup$
              $X-mathbb{E}[X]$ might be negative, so I don't think it's necessarily true that $|X-mathbb{E}[X]| leq |X|$. For example, if $X = 1$ or $X = 9$, with equal probability.
              $endgroup$
              – user13491
              Dec 28 '15 at 23:04


















            • $begingroup$
              Thanks! Is it also easy to construct counterexamples in the case when $X$ is always positive?
              $endgroup$
              – user13491
              Dec 28 '15 at 15:36










            • $begingroup$
              If $X$ is always positive, so is $mathbb{E}(X)$. As a result $|X-mathbb{E}(X)|leq |X|$, and of course $mathbb{E}big((X-mathbb{E}(X))^kbig)leq mathbb{E}(X^k)$.
              $endgroup$
              – yhhuang
              Dec 28 '15 at 16:51






            • 2




              $begingroup$
              $X-mathbb{E}[X]$ might be negative, so I don't think it's necessarily true that $|X-mathbb{E}[X]| leq |X|$. For example, if $X = 1$ or $X = 9$, with equal probability.
              $endgroup$
              – user13491
              Dec 28 '15 at 23:04
















            $begingroup$
            Thanks! Is it also easy to construct counterexamples in the case when $X$ is always positive?
            $endgroup$
            – user13491
            Dec 28 '15 at 15:36




            $begingroup$
            Thanks! Is it also easy to construct counterexamples in the case when $X$ is always positive?
            $endgroup$
            – user13491
            Dec 28 '15 at 15:36












            $begingroup$
            If $X$ is always positive, so is $mathbb{E}(X)$. As a result $|X-mathbb{E}(X)|leq |X|$, and of course $mathbb{E}big((X-mathbb{E}(X))^kbig)leq mathbb{E}(X^k)$.
            $endgroup$
            – yhhuang
            Dec 28 '15 at 16:51




            $begingroup$
            If $X$ is always positive, so is $mathbb{E}(X)$. As a result $|X-mathbb{E}(X)|leq |X|$, and of course $mathbb{E}big((X-mathbb{E}(X))^kbig)leq mathbb{E}(X^k)$.
            $endgroup$
            – yhhuang
            Dec 28 '15 at 16:51




            2




            2




            $begingroup$
            $X-mathbb{E}[X]$ might be negative, so I don't think it's necessarily true that $|X-mathbb{E}[X]| leq |X|$. For example, if $X = 1$ or $X = 9$, with equal probability.
            $endgroup$
            – user13491
            Dec 28 '15 at 23:04




            $begingroup$
            $X-mathbb{E}[X]$ might be negative, so I don't think it's necessarily true that $|X-mathbb{E}[X]| leq |X|$. For example, if $X = 1$ or $X = 9$, with equal probability.
            $endgroup$
            – user13491
            Dec 28 '15 at 23:04











            1












            $begingroup$

            To complement the accepted answer,
            we can show that $E[(X - E[X])^m] leq E[X^m]$ when $X geq 0$.
            Assume without loss of generality that $E[X] = 1$ (rescaling $X$ if necessary).
            Then, omitting the dependence on $omega$ for notational convenience,
            begin{align}
            & int_{Omega} X^m , d Omega - int_{Omega} (X - 1)^m , dP(omega) \
            & quad =
            int_{X leq 1/2} left[ X^m - (X - 1)^m right] , dP(omega) +
            int_{1/2 < X leq 1} left[ X^m - (X - 1)^m right] , dP(omega) \
            & quad + int_{X > 1} left[ X^m - (X - 1)^m right] , dP(omega). \
            & quad geq
            int_{X leq 1/2} left[ X^m - (X - 1)^m right] , dP(omega)
            + int_{X > 1} left[ X^m - (X - 1)^m right] , dP(omega)
            =: I_1 + I_2.
            end{align}

            For $m$ odd, both $I_1$ and $I_2$ are positive and the statement is proved.
            We assume from now on that $m$ is even.
            It is easy to see that:
            begin{align}
            |a^m - (a - 1)^m| leq (1 - a) quad & text{ if } quad 0 leq a leq 1/2; \
            a^m - (a - 1)^m geq (a - 1) quad & text{ if } quad a > 1.
            end{align}

            Using these inequalities, we deduce that
            $$ I_1 + I_2 geq int_{X > 1} (X - 1) , dP(omega) - int_{X leq 1/2} (1 - X) , dP(omega). $$
            To conclude, we note that,
            by definition of the expected value,
            begin{align}
            & int_{X leq 1/2} (X(omega) - 1) , dP(omega) + int_{1/2 < X leq 1} (X(omega) - 1) , dP(omega) + int_{X > 1} (X(omega) - 1) , dP(omega) = 0 \
            & rightarrow int_{X > 1} (X(omega) - 1) , dP(omega) geq int_{X leq 1/2} (1 - X(omega)) , dP(omega).
            end{align}






            share|cite|improve this answer









            $endgroup$


















              1












              $begingroup$

              To complement the accepted answer,
              we can show that $E[(X - E[X])^m] leq E[X^m]$ when $X geq 0$.
              Assume without loss of generality that $E[X] = 1$ (rescaling $X$ if necessary).
              Then, omitting the dependence on $omega$ for notational convenience,
              begin{align}
              & int_{Omega} X^m , d Omega - int_{Omega} (X - 1)^m , dP(omega) \
              & quad =
              int_{X leq 1/2} left[ X^m - (X - 1)^m right] , dP(omega) +
              int_{1/2 < X leq 1} left[ X^m - (X - 1)^m right] , dP(omega) \
              & quad + int_{X > 1} left[ X^m - (X - 1)^m right] , dP(omega). \
              & quad geq
              int_{X leq 1/2} left[ X^m - (X - 1)^m right] , dP(omega)
              + int_{X > 1} left[ X^m - (X - 1)^m right] , dP(omega)
              =: I_1 + I_2.
              end{align}

              For $m$ odd, both $I_1$ and $I_2$ are positive and the statement is proved.
              We assume from now on that $m$ is even.
              It is easy to see that:
              begin{align}
              |a^m - (a - 1)^m| leq (1 - a) quad & text{ if } quad 0 leq a leq 1/2; \
              a^m - (a - 1)^m geq (a - 1) quad & text{ if } quad a > 1.
              end{align}

              Using these inequalities, we deduce that
              $$ I_1 + I_2 geq int_{X > 1} (X - 1) , dP(omega) - int_{X leq 1/2} (1 - X) , dP(omega). $$
              To conclude, we note that,
              by definition of the expected value,
              begin{align}
              & int_{X leq 1/2} (X(omega) - 1) , dP(omega) + int_{1/2 < X leq 1} (X(omega) - 1) , dP(omega) + int_{X > 1} (X(omega) - 1) , dP(omega) = 0 \
              & rightarrow int_{X > 1} (X(omega) - 1) , dP(omega) geq int_{X leq 1/2} (1 - X(omega)) , dP(omega).
              end{align}






              share|cite|improve this answer









              $endgroup$
















                1












                1








                1





                $begingroup$

                To complement the accepted answer,
                we can show that $E[(X - E[X])^m] leq E[X^m]$ when $X geq 0$.
                Assume without loss of generality that $E[X] = 1$ (rescaling $X$ if necessary).
                Then, omitting the dependence on $omega$ for notational convenience,
                begin{align}
                & int_{Omega} X^m , d Omega - int_{Omega} (X - 1)^m , dP(omega) \
                & quad =
                int_{X leq 1/2} left[ X^m - (X - 1)^m right] , dP(omega) +
                int_{1/2 < X leq 1} left[ X^m - (X - 1)^m right] , dP(omega) \
                & quad + int_{X > 1} left[ X^m - (X - 1)^m right] , dP(omega). \
                & quad geq
                int_{X leq 1/2} left[ X^m - (X - 1)^m right] , dP(omega)
                + int_{X > 1} left[ X^m - (X - 1)^m right] , dP(omega)
                =: I_1 + I_2.
                end{align}

                For $m$ odd, both $I_1$ and $I_2$ are positive and the statement is proved.
                We assume from now on that $m$ is even.
                It is easy to see that:
                begin{align}
                |a^m - (a - 1)^m| leq (1 - a) quad & text{ if } quad 0 leq a leq 1/2; \
                a^m - (a - 1)^m geq (a - 1) quad & text{ if } quad a > 1.
                end{align}

                Using these inequalities, we deduce that
                $$ I_1 + I_2 geq int_{X > 1} (X - 1) , dP(omega) - int_{X leq 1/2} (1 - X) , dP(omega). $$
                To conclude, we note that,
                by definition of the expected value,
                begin{align}
                & int_{X leq 1/2} (X(omega) - 1) , dP(omega) + int_{1/2 < X leq 1} (X(omega) - 1) , dP(omega) + int_{X > 1} (X(omega) - 1) , dP(omega) = 0 \
                & rightarrow int_{X > 1} (X(omega) - 1) , dP(omega) geq int_{X leq 1/2} (1 - X(omega)) , dP(omega).
                end{align}






                share|cite|improve this answer









                $endgroup$



                To complement the accepted answer,
                we can show that $E[(X - E[X])^m] leq E[X^m]$ when $X geq 0$.
                Assume without loss of generality that $E[X] = 1$ (rescaling $X$ if necessary).
                Then, omitting the dependence on $omega$ for notational convenience,
                begin{align}
                & int_{Omega} X^m , d Omega - int_{Omega} (X - 1)^m , dP(omega) \
                & quad =
                int_{X leq 1/2} left[ X^m - (X - 1)^m right] , dP(omega) +
                int_{1/2 < X leq 1} left[ X^m - (X - 1)^m right] , dP(omega) \
                & quad + int_{X > 1} left[ X^m - (X - 1)^m right] , dP(omega). \
                & quad geq
                int_{X leq 1/2} left[ X^m - (X - 1)^m right] , dP(omega)
                + int_{X > 1} left[ X^m - (X - 1)^m right] , dP(omega)
                =: I_1 + I_2.
                end{align}

                For $m$ odd, both $I_1$ and $I_2$ are positive and the statement is proved.
                We assume from now on that $m$ is even.
                It is easy to see that:
                begin{align}
                |a^m - (a - 1)^m| leq (1 - a) quad & text{ if } quad 0 leq a leq 1/2; \
                a^m - (a - 1)^m geq (a - 1) quad & text{ if } quad a > 1.
                end{align}

                Using these inequalities, we deduce that
                $$ I_1 + I_2 geq int_{X > 1} (X - 1) , dP(omega) - int_{X leq 1/2} (1 - X) , dP(omega). $$
                To conclude, we note that,
                by definition of the expected value,
                begin{align}
                & int_{X leq 1/2} (X(omega) - 1) , dP(omega) + int_{1/2 < X leq 1} (X(omega) - 1) , dP(omega) + int_{X > 1} (X(omega) - 1) , dP(omega) = 0 \
                & rightarrow int_{X > 1} (X(omega) - 1) , dP(omega) geq int_{X leq 1/2} (1 - X(omega)) , dP(omega).
                end{align}







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Dec 15 '18 at 12:59









                Roberto RastapopoulosRoberto Rastapopoulos

                906424




                906424






























                    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%2f1591161%2fis-the-kth-central-moment-less-than-the-kth-raw-moment-for-even-k%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

                    Quarter-circle Tiles

                    build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

                    Mont Emei