Choquet-Deny implies Kolmogorov's zero-one law











up vote
1
down vote

favorite












Choquet-Deny: If $left(Y_1,Y_2,...right)$ are iid random variables taking values in a countable abelian group $G$, $X_n=sum_{kle n}Y_k$, and $left(X_1,X_2,...right)$ is irreducible, then every bounded $mathcal{I}$-measurable random variable is constant, where $mathcal{I}={Asubseteq G^mathbb{N}:phi(A)=A}$ is the shift-invariant sigma-algebra and $phi:left(g_0,g_1,g_2,...right)toleft(g_1,g_2,...right)$ for all $(g_0,g_1,g_2,...)in G^mathbb{N}$ is the shift map.



Lemma: For a random walk on a countable abelian group, a random variable is $mathcal{T}$-measurable if and only if it is $mathcal{I}$-measurable, where $mathcal{T}=cap_nmathcal{T}_n$ is the tail sigma-algebra and $mathcal{T}_n=sigmaleft(X_n,X_{n+1},...right)$.



Problem: If $left(X_1,X_2,...right)$ are iid and finitely supported, show that $mathcal{T}$ is trivial using Choquet-Deny and the lemma.



I think I misunderstand what's going on. In the setting of Choquet-Deny, is the following correct: let $Z$ be a bounded $mathcal{I}$-measurable random variable. The only relevance of $left(X_1,X_2,...right)$ to $Z$ is that it affects the probability of the events in $mathcal{I}$. $left(X_1,X_2,...right)$ does not change which events are in $mathcal{I}$.



The only plausible way I see is letting $Y_n=X_{n+1}-X_n$ and applying Choquet-Deny to $left(Y_1,Y_2,...right)$ and $left(X_1,X_2,...right)$. $left(Y_1,Y_2,...right)$ are identically distributed but not independent since knowing $Y_n=X_{n+1}-X_n$ changes the distribution of $Y_{n+1}=X_{n+2}-X_{n+1}$. We also lack irreducibility of $left(X_1,X_2,...right)$.










share|cite|improve this question


























    up vote
    1
    down vote

    favorite












    Choquet-Deny: If $left(Y_1,Y_2,...right)$ are iid random variables taking values in a countable abelian group $G$, $X_n=sum_{kle n}Y_k$, and $left(X_1,X_2,...right)$ is irreducible, then every bounded $mathcal{I}$-measurable random variable is constant, where $mathcal{I}={Asubseteq G^mathbb{N}:phi(A)=A}$ is the shift-invariant sigma-algebra and $phi:left(g_0,g_1,g_2,...right)toleft(g_1,g_2,...right)$ for all $(g_0,g_1,g_2,...)in G^mathbb{N}$ is the shift map.



    Lemma: For a random walk on a countable abelian group, a random variable is $mathcal{T}$-measurable if and only if it is $mathcal{I}$-measurable, where $mathcal{T}=cap_nmathcal{T}_n$ is the tail sigma-algebra and $mathcal{T}_n=sigmaleft(X_n,X_{n+1},...right)$.



    Problem: If $left(X_1,X_2,...right)$ are iid and finitely supported, show that $mathcal{T}$ is trivial using Choquet-Deny and the lemma.



    I think I misunderstand what's going on. In the setting of Choquet-Deny, is the following correct: let $Z$ be a bounded $mathcal{I}$-measurable random variable. The only relevance of $left(X_1,X_2,...right)$ to $Z$ is that it affects the probability of the events in $mathcal{I}$. $left(X_1,X_2,...right)$ does not change which events are in $mathcal{I}$.



    The only plausible way I see is letting $Y_n=X_{n+1}-X_n$ and applying Choquet-Deny to $left(Y_1,Y_2,...right)$ and $left(X_1,X_2,...right)$. $left(Y_1,Y_2,...right)$ are identically distributed but not independent since knowing $Y_n=X_{n+1}-X_n$ changes the distribution of $Y_{n+1}=X_{n+2}-X_{n+1}$. We also lack irreducibility of $left(X_1,X_2,...right)$.










    share|cite|improve this question
























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      Choquet-Deny: If $left(Y_1,Y_2,...right)$ are iid random variables taking values in a countable abelian group $G$, $X_n=sum_{kle n}Y_k$, and $left(X_1,X_2,...right)$ is irreducible, then every bounded $mathcal{I}$-measurable random variable is constant, where $mathcal{I}={Asubseteq G^mathbb{N}:phi(A)=A}$ is the shift-invariant sigma-algebra and $phi:left(g_0,g_1,g_2,...right)toleft(g_1,g_2,...right)$ for all $(g_0,g_1,g_2,...)in G^mathbb{N}$ is the shift map.



      Lemma: For a random walk on a countable abelian group, a random variable is $mathcal{T}$-measurable if and only if it is $mathcal{I}$-measurable, where $mathcal{T}=cap_nmathcal{T}_n$ is the tail sigma-algebra and $mathcal{T}_n=sigmaleft(X_n,X_{n+1},...right)$.



      Problem: If $left(X_1,X_2,...right)$ are iid and finitely supported, show that $mathcal{T}$ is trivial using Choquet-Deny and the lemma.



      I think I misunderstand what's going on. In the setting of Choquet-Deny, is the following correct: let $Z$ be a bounded $mathcal{I}$-measurable random variable. The only relevance of $left(X_1,X_2,...right)$ to $Z$ is that it affects the probability of the events in $mathcal{I}$. $left(X_1,X_2,...right)$ does not change which events are in $mathcal{I}$.



      The only plausible way I see is letting $Y_n=X_{n+1}-X_n$ and applying Choquet-Deny to $left(Y_1,Y_2,...right)$ and $left(X_1,X_2,...right)$. $left(Y_1,Y_2,...right)$ are identically distributed but not independent since knowing $Y_n=X_{n+1}-X_n$ changes the distribution of $Y_{n+1}=X_{n+2}-X_{n+1}$. We also lack irreducibility of $left(X_1,X_2,...right)$.










      share|cite|improve this question













      Choquet-Deny: If $left(Y_1,Y_2,...right)$ are iid random variables taking values in a countable abelian group $G$, $X_n=sum_{kle n}Y_k$, and $left(X_1,X_2,...right)$ is irreducible, then every bounded $mathcal{I}$-measurable random variable is constant, where $mathcal{I}={Asubseteq G^mathbb{N}:phi(A)=A}$ is the shift-invariant sigma-algebra and $phi:left(g_0,g_1,g_2,...right)toleft(g_1,g_2,...right)$ for all $(g_0,g_1,g_2,...)in G^mathbb{N}$ is the shift map.



      Lemma: For a random walk on a countable abelian group, a random variable is $mathcal{T}$-measurable if and only if it is $mathcal{I}$-measurable, where $mathcal{T}=cap_nmathcal{T}_n$ is the tail sigma-algebra and $mathcal{T}_n=sigmaleft(X_n,X_{n+1},...right)$.



      Problem: If $left(X_1,X_2,...right)$ are iid and finitely supported, show that $mathcal{T}$ is trivial using Choquet-Deny and the lemma.



      I think I misunderstand what's going on. In the setting of Choquet-Deny, is the following correct: let $Z$ be a bounded $mathcal{I}$-measurable random variable. The only relevance of $left(X_1,X_2,...right)$ to $Z$ is that it affects the probability of the events in $mathcal{I}$. $left(X_1,X_2,...right)$ does not change which events are in $mathcal{I}$.



      The only plausible way I see is letting $Y_n=X_{n+1}-X_n$ and applying Choquet-Deny to $left(Y_1,Y_2,...right)$ and $left(X_1,X_2,...right)$. $left(Y_1,Y_2,...right)$ are identically distributed but not independent since knowing $Y_n=X_{n+1}-X_n$ changes the distribution of $Y_{n+1}=X_{n+2}-X_{n+1}$. We also lack irreducibility of $left(X_1,X_2,...right)$.







      probability probability-theory random-variables markov-chains






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 18 at 6:27









      L Wheels

      61




      61



























          active

          oldest

          votes











          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%2f3003204%2fchoquet-deny-implies-kolmogorovs-zero-one-law%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown






























          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          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%2f3003204%2fchoquet-deny-implies-kolmogorovs-zero-one-law%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

          QoS: MAC-Priority for clients behind a repeater

          Ивакино (Тотемский район)

          Can't locate Autom4te/ChannelDefs.pm in @INC (when it definitely is there)