Confusion about given proof of the compensated Poisson process being a Martingale?












0












$begingroup$


Given the following proof of the compensated Poisson process being a Martingale



enter image description here



Why does the proof start with $E[N(t)-lambda t|N(s)]$ when the question asks to prove that $X(t)$ is a Martingale? Shouldn't it start with $E[N(t)-lambda t|N(s)-lambda s]$?



I see that the solution shows that when you plug in the 2nd line of the solution into the left side of $E[N(s)|N(t)]-lambda t$ you will get $N(s)-lambda s$ which is equivalent to $X(s)$ but I'm still confused as to why the proof is starting with, essentially, $E[X(t)|X(s)+lambda s]$ to prove the Martingale when the given definition seems to imply you should start with $E[X(t)|X(s)]$ and then try to get to a final answer of $X(s)$










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    Given the following proof of the compensated Poisson process being a Martingale



    enter image description here



    Why does the proof start with $E[N(t)-lambda t|N(s)]$ when the question asks to prove that $X(t)$ is a Martingale? Shouldn't it start with $E[N(t)-lambda t|N(s)-lambda s]$?



    I see that the solution shows that when you plug in the 2nd line of the solution into the left side of $E[N(s)|N(t)]-lambda t$ you will get $N(s)-lambda s$ which is equivalent to $X(s)$ but I'm still confused as to why the proof is starting with, essentially, $E[X(t)|X(s)+lambda s]$ to prove the Martingale when the given definition seems to imply you should start with $E[X(t)|X(s)]$ and then try to get to a final answer of $X(s)$










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      Given the following proof of the compensated Poisson process being a Martingale



      enter image description here



      Why does the proof start with $E[N(t)-lambda t|N(s)]$ when the question asks to prove that $X(t)$ is a Martingale? Shouldn't it start with $E[N(t)-lambda t|N(s)-lambda s]$?



      I see that the solution shows that when you plug in the 2nd line of the solution into the left side of $E[N(s)|N(t)]-lambda t$ you will get $N(s)-lambda s$ which is equivalent to $X(s)$ but I'm still confused as to why the proof is starting with, essentially, $E[X(t)|X(s)+lambda s]$ to prove the Martingale when the given definition seems to imply you should start with $E[X(t)|X(s)]$ and then try to get to a final answer of $X(s)$










      share|cite|improve this question









      $endgroup$




      Given the following proof of the compensated Poisson process being a Martingale



      enter image description here



      Why does the proof start with $E[N(t)-lambda t|N(s)]$ when the question asks to prove that $X(t)$ is a Martingale? Shouldn't it start with $E[N(t)-lambda t|N(s)-lambda s]$?



      I see that the solution shows that when you plug in the 2nd line of the solution into the left side of $E[N(s)|N(t)]-lambda t$ you will get $N(s)-lambda s$ which is equivalent to $X(s)$ but I'm still confused as to why the proof is starting with, essentially, $E[X(t)|X(s)+lambda s]$ to prove the Martingale when the given definition seems to imply you should start with $E[X(t)|X(s)]$ and then try to get to a final answer of $X(s)$







      stochastic-processes markov-chains conditional-expectation






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Dec 4 '18 at 21:48









      user3491700user3491700

      535




      535






















          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          Conditioning on $X(s)+lambda s$ is the same as conditioning on $X(s)$ since $lambda s$ is not random. I do not know your background on probability theory, but in an elementary explanation, the information $X(s)+lambda s$ and $X(s)$ carry is exactly the same since the two differ by a deterministic quantity, so knowing one can recover another. In measure-theoretic probability terms. the sigma-fields generated by the two are exactly the same.






          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%2f3026228%2fconfusion-about-given-proof-of-the-compensated-poisson-process-being-a-martingal%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












            $begingroup$

            Conditioning on $X(s)+lambda s$ is the same as conditioning on $X(s)$ since $lambda s$ is not random. I do not know your background on probability theory, but in an elementary explanation, the information $X(s)+lambda s$ and $X(s)$ carry is exactly the same since the two differ by a deterministic quantity, so knowing one can recover another. In measure-theoretic probability terms. the sigma-fields generated by the two are exactly the same.






            share|cite|improve this answer









            $endgroup$


















              0












              $begingroup$

              Conditioning on $X(s)+lambda s$ is the same as conditioning on $X(s)$ since $lambda s$ is not random. I do not know your background on probability theory, but in an elementary explanation, the information $X(s)+lambda s$ and $X(s)$ carry is exactly the same since the two differ by a deterministic quantity, so knowing one can recover another. In measure-theoretic probability terms. the sigma-fields generated by the two are exactly the same.






              share|cite|improve this answer









              $endgroup$
















                0












                0








                0





                $begingroup$

                Conditioning on $X(s)+lambda s$ is the same as conditioning on $X(s)$ since $lambda s$ is not random. I do not know your background on probability theory, but in an elementary explanation, the information $X(s)+lambda s$ and $X(s)$ carry is exactly the same since the two differ by a deterministic quantity, so knowing one can recover another. In measure-theoretic probability terms. the sigma-fields generated by the two are exactly the same.






                share|cite|improve this answer









                $endgroup$



                Conditioning on $X(s)+lambda s$ is the same as conditioning on $X(s)$ since $lambda s$ is not random. I do not know your background on probability theory, but in an elementary explanation, the information $X(s)+lambda s$ and $X(s)$ carry is exactly the same since the two differ by a deterministic quantity, so knowing one can recover another. In measure-theoretic probability terms. the sigma-fields generated by the two are exactly the same.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Dec 4 '18 at 22:00









                UchihaUchiha

                9310




                9310






























                    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%2f3026228%2fconfusion-about-given-proof-of-the-compensated-poisson-process-being-a-martingal%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

                    Wiesbaden

                    Marschland

                    Dieringhausen