Order of Summation in proof, Grimmett and Stirzaker 3.11.13.a

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












The question asks to prove:



$E(X) = sum_n=0^inftyP(X>n)$



$E(X) = sum_m=0^inftymP(X=m) = sum_m=0^inftysum_n=0^m-1P(X=m) = sum_n=0^inftysum_m=n+1^inftyP(X=m) = sum_n=0^inftyP(X>n)$



My only problem is understanding how the new limits when the summations are changed going from the 3rd to the 4th expression.



For example $P(x=0)$ is included in $sum_m=0^inftysum_n=0^m-1P(X=m)$ but it doesn't seem to be included in $sum_n=0^inftysum_m=n+1^inftyP(X=m)$?



Can someone explain this?







share|cite|improve this question



















  • I don’t think $P(X=0)$ is included in the third expression.
    – Theoretical Economist
    Jul 16 at 19:24






  • 1




    In the third equality, they have used $m=sum_n=0^m-11$. Clearly, we have $0le nle m-1$ which also means $mge n+1, nge0$. Loosely speaking, the sums can be interchanged as long as they are convergent.
    – StubbornAtom
    Jul 16 at 19:30















up vote
1
down vote

favorite












The question asks to prove:



$E(X) = sum_n=0^inftyP(X>n)$



$E(X) = sum_m=0^inftymP(X=m) = sum_m=0^inftysum_n=0^m-1P(X=m) = sum_n=0^inftysum_m=n+1^inftyP(X=m) = sum_n=0^inftyP(X>n)$



My only problem is understanding how the new limits when the summations are changed going from the 3rd to the 4th expression.



For example $P(x=0)$ is included in $sum_m=0^inftysum_n=0^m-1P(X=m)$ but it doesn't seem to be included in $sum_n=0^inftysum_m=n+1^inftyP(X=m)$?



Can someone explain this?







share|cite|improve this question



















  • I don’t think $P(X=0)$ is included in the third expression.
    – Theoretical Economist
    Jul 16 at 19:24






  • 1




    In the third equality, they have used $m=sum_n=0^m-11$. Clearly, we have $0le nle m-1$ which also means $mge n+1, nge0$. Loosely speaking, the sums can be interchanged as long as they are convergent.
    – StubbornAtom
    Jul 16 at 19:30













up vote
1
down vote

favorite









up vote
1
down vote

favorite











The question asks to prove:



$E(X) = sum_n=0^inftyP(X>n)$



$E(X) = sum_m=0^inftymP(X=m) = sum_m=0^inftysum_n=0^m-1P(X=m) = sum_n=0^inftysum_m=n+1^inftyP(X=m) = sum_n=0^inftyP(X>n)$



My only problem is understanding how the new limits when the summations are changed going from the 3rd to the 4th expression.



For example $P(x=0)$ is included in $sum_m=0^inftysum_n=0^m-1P(X=m)$ but it doesn't seem to be included in $sum_n=0^inftysum_m=n+1^inftyP(X=m)$?



Can someone explain this?







share|cite|improve this question











The question asks to prove:



$E(X) = sum_n=0^inftyP(X>n)$



$E(X) = sum_m=0^inftymP(X=m) = sum_m=0^inftysum_n=0^m-1P(X=m) = sum_n=0^inftysum_m=n+1^inftyP(X=m) = sum_n=0^inftyP(X>n)$



My only problem is understanding how the new limits when the summations are changed going from the 3rd to the 4th expression.



For example $P(x=0)$ is included in $sum_m=0^inftysum_n=0^m-1P(X=m)$ but it doesn't seem to be included in $sum_n=0^inftysum_m=n+1^inftyP(X=m)$?



Can someone explain this?









share|cite|improve this question










share|cite|improve this question




share|cite|improve this question









asked Jul 16 at 19:19









Bazman

365211




365211











  • I don’t think $P(X=0)$ is included in the third expression.
    – Theoretical Economist
    Jul 16 at 19:24






  • 1




    In the third equality, they have used $m=sum_n=0^m-11$. Clearly, we have $0le nle m-1$ which also means $mge n+1, nge0$. Loosely speaking, the sums can be interchanged as long as they are convergent.
    – StubbornAtom
    Jul 16 at 19:30

















  • I don’t think $P(X=0)$ is included in the third expression.
    – Theoretical Economist
    Jul 16 at 19:24






  • 1




    In the third equality, they have used $m=sum_n=0^m-11$. Clearly, we have $0le nle m-1$ which also means $mge n+1, nge0$. Loosely speaking, the sums can be interchanged as long as they are convergent.
    – StubbornAtom
    Jul 16 at 19:30
















I don’t think $P(X=0)$ is included in the third expression.
– Theoretical Economist
Jul 16 at 19:24




I don’t think $P(X=0)$ is included in the third expression.
– Theoretical Economist
Jul 16 at 19:24




1




1




In the third equality, they have used $m=sum_n=0^m-11$. Clearly, we have $0le nle m-1$ which also means $mge n+1, nge0$. Loosely speaking, the sums can be interchanged as long as they are convergent.
– StubbornAtom
Jul 16 at 19:30





In the third equality, they have used $m=sum_n=0^m-11$. Clearly, we have $0le nle m-1$ which also means $mge n+1, nge0$. Loosely speaking, the sums can be interchanged as long as they are convergent.
– StubbornAtom
Jul 16 at 19:30











1 Answer
1






active

oldest

votes

















up vote
1
down vote



accepted










Use the indicator



$$mathbf1_(n leqslant m-1) = mathbf1_(m geqslant n+1) = begincases1, & n leqslant m-1\0, & n > m-1 endcases$$



Thus,



$$sum_m=0^infty sum_n=0^m-1 P(X = m) = sum_m=0^infty sum_n=0^infty P(X = m) mathbf1_(n leqslant m-1) = sum_m=0^infty sum_n=0^infty P(X = m) mathbf1_(m geqslant n+1)\ = sum_n=0^infty sum_m=0^infty P(X = m) mathbf1_(m geqslant n+1) \ = sum_n=0^infty sum_m=n+1^infty P(X = m) $$



We can interchange the sums in the second line by Tonelli's theorem since the terms are non-negative.






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: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    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%2f2853750%2forder-of-summation-in-proof-grimmett-and-stirzaker-3-11-13-a%23new-answer', 'question_page');

    );

    Post as a guest






























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    1
    down vote



    accepted










    Use the indicator



    $$mathbf1_(n leqslant m-1) = mathbf1_(m geqslant n+1) = begincases1, & n leqslant m-1\0, & n > m-1 endcases$$



    Thus,



    $$sum_m=0^infty sum_n=0^m-1 P(X = m) = sum_m=0^infty sum_n=0^infty P(X = m) mathbf1_(n leqslant m-1) = sum_m=0^infty sum_n=0^infty P(X = m) mathbf1_(m geqslant n+1)\ = sum_n=0^infty sum_m=0^infty P(X = m) mathbf1_(m geqslant n+1) \ = sum_n=0^infty sum_m=n+1^infty P(X = m) $$



    We can interchange the sums in the second line by Tonelli's theorem since the terms are non-negative.






    share|cite|improve this answer

























      up vote
      1
      down vote



      accepted










      Use the indicator



      $$mathbf1_(n leqslant m-1) = mathbf1_(m geqslant n+1) = begincases1, & n leqslant m-1\0, & n > m-1 endcases$$



      Thus,



      $$sum_m=0^infty sum_n=0^m-1 P(X = m) = sum_m=0^infty sum_n=0^infty P(X = m) mathbf1_(n leqslant m-1) = sum_m=0^infty sum_n=0^infty P(X = m) mathbf1_(m geqslant n+1)\ = sum_n=0^infty sum_m=0^infty P(X = m) mathbf1_(m geqslant n+1) \ = sum_n=0^infty sum_m=n+1^infty P(X = m) $$



      We can interchange the sums in the second line by Tonelli's theorem since the terms are non-negative.






      share|cite|improve this answer























        up vote
        1
        down vote



        accepted







        up vote
        1
        down vote



        accepted






        Use the indicator



        $$mathbf1_(n leqslant m-1) = mathbf1_(m geqslant n+1) = begincases1, & n leqslant m-1\0, & n > m-1 endcases$$



        Thus,



        $$sum_m=0^infty sum_n=0^m-1 P(X = m) = sum_m=0^infty sum_n=0^infty P(X = m) mathbf1_(n leqslant m-1) = sum_m=0^infty sum_n=0^infty P(X = m) mathbf1_(m geqslant n+1)\ = sum_n=0^infty sum_m=0^infty P(X = m) mathbf1_(m geqslant n+1) \ = sum_n=0^infty sum_m=n+1^infty P(X = m) $$



        We can interchange the sums in the second line by Tonelli's theorem since the terms are non-negative.






        share|cite|improve this answer













        Use the indicator



        $$mathbf1_(n leqslant m-1) = mathbf1_(m geqslant n+1) = begincases1, & n leqslant m-1\0, & n > m-1 endcases$$



        Thus,



        $$sum_m=0^infty sum_n=0^m-1 P(X = m) = sum_m=0^infty sum_n=0^infty P(X = m) mathbf1_(n leqslant m-1) = sum_m=0^infty sum_n=0^infty P(X = m) mathbf1_(m geqslant n+1)\ = sum_n=0^infty sum_m=0^infty P(X = m) mathbf1_(m geqslant n+1) \ = sum_n=0^infty sum_m=n+1^infty P(X = m) $$



        We can interchange the sums in the second line by Tonelli's theorem since the terms are non-negative.







        share|cite|improve this answer













        share|cite|improve this answer



        share|cite|improve this answer











        answered Jul 16 at 20:12









        RRL

        43.7k42260




        43.7k42260






















             

            draft saved


            draft discarded


























             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2853750%2forder-of-summation-in-proof-grimmett-and-stirzaker-3-11-13-a%23new-answer', 'question_page');

            );

            Post as a guest













































































            Comments

            Popular posts from this blog

            What is the equation of a 3D cone with generalised tilt?

            Color the edges and diagonals of a regular polygon

            Relationship between determinant of matrix and determinant of adjoint?