If $(Y_n)_{ninmathbb N_0}$ and $(N_t)_{tge0}$ are stochastic processes, what is the filtration generated by...











up vote
0
down vote

favorite












Let





  • $(Omega,mathcal A)$ and $(E,mathcal E)$ be measurable spaces


  • $(Y_n)_{ninmathbb N_0}$ be a $(E,mathcal E)$-valued stochastic process on $(Omega,mathcal A)$


  • $(N_t)_{tge0}$ be a $mathbb N_0$-valued stochastic process on $(Omega,mathcal A)$


Don't know if it matters, but in my application, $Y$ is a Markov chain and $N$ is a Poisson process, independent from $Y$.



Moreover, let $$mathcal F^N_t:=sigma(N_s:0le sle t);;;text{for }tge0$$ and $$mathcal F^Y_n:=sigma(Y_m:minleft{0,ldots,nright});;;text{for }ninmathbb N_0.$$



Now, let $$X_t:=Y_{N_t};;;text{for }tge0$$ and $$mathcal F^X_t:=sigma(X_s:0le sle t);;;text{for }tge0$$




How can we show that $$sigmaleft(left{Acap Bcapleft{N_t=nright}:Ainmathcal F^N_t,ninmathbb N_0text{ and }Binmathcal F^Y_nright}right)=mathcal F_t:=sigma(mathcal F_t^Ncupmathcal F_t^X)$$ for all $tge0$?




Let $tge0$. I even fail to show that if $Ainmathcal F^N_t$, $ninmathbb N_0$ and $Binmathcal F^Y_n$, then $Acap Bcapleft{N_t=nright}inmathcal F_t$. Though, it would be clear, if $Bcapleft{N_t=nright}inmathcal F^X_t$. I guess we somehow need to use that $X_t$ coincindes with $Y_n$ on $left{N_t=nright}$.










share|cite|improve this question
























  • We cannot show this because it is not true. Take for example the case $Y_0=Y_1=dots$. Then the $sigma$-algebra generated by the composition is trivial, regardless of what the process ${bf N}$ is.
    – Fnacool
    7 hours ago










  • @Fnacool It's claimed here below equation (2.12). Therein $Y$ is a Markov chain and $N$ is a Poisson process, independent from $Y$.
    – 0xbadf00d
    6 hours ago












  • My bad. I incorrectly assumed ${cal F}_t = {cal F}^X_t$. Hope my answer below helps.
    – Fnacool
    5 hours ago















up vote
0
down vote

favorite












Let





  • $(Omega,mathcal A)$ and $(E,mathcal E)$ be measurable spaces


  • $(Y_n)_{ninmathbb N_0}$ be a $(E,mathcal E)$-valued stochastic process on $(Omega,mathcal A)$


  • $(N_t)_{tge0}$ be a $mathbb N_0$-valued stochastic process on $(Omega,mathcal A)$


Don't know if it matters, but in my application, $Y$ is a Markov chain and $N$ is a Poisson process, independent from $Y$.



Moreover, let $$mathcal F^N_t:=sigma(N_s:0le sle t);;;text{for }tge0$$ and $$mathcal F^Y_n:=sigma(Y_m:minleft{0,ldots,nright});;;text{for }ninmathbb N_0.$$



Now, let $$X_t:=Y_{N_t};;;text{for }tge0$$ and $$mathcal F^X_t:=sigma(X_s:0le sle t);;;text{for }tge0$$




How can we show that $$sigmaleft(left{Acap Bcapleft{N_t=nright}:Ainmathcal F^N_t,ninmathbb N_0text{ and }Binmathcal F^Y_nright}right)=mathcal F_t:=sigma(mathcal F_t^Ncupmathcal F_t^X)$$ for all $tge0$?




Let $tge0$. I even fail to show that if $Ainmathcal F^N_t$, $ninmathbb N_0$ and $Binmathcal F^Y_n$, then $Acap Bcapleft{N_t=nright}inmathcal F_t$. Though, it would be clear, if $Bcapleft{N_t=nright}inmathcal F^X_t$. I guess we somehow need to use that $X_t$ coincindes with $Y_n$ on $left{N_t=nright}$.










share|cite|improve this question
























  • We cannot show this because it is not true. Take for example the case $Y_0=Y_1=dots$. Then the $sigma$-algebra generated by the composition is trivial, regardless of what the process ${bf N}$ is.
    – Fnacool
    7 hours ago










  • @Fnacool It's claimed here below equation (2.12). Therein $Y$ is a Markov chain and $N$ is a Poisson process, independent from $Y$.
    – 0xbadf00d
    6 hours ago












  • My bad. I incorrectly assumed ${cal F}_t = {cal F}^X_t$. Hope my answer below helps.
    – Fnacool
    5 hours ago













up vote
0
down vote

favorite









up vote
0
down vote

favorite











Let





  • $(Omega,mathcal A)$ and $(E,mathcal E)$ be measurable spaces


  • $(Y_n)_{ninmathbb N_0}$ be a $(E,mathcal E)$-valued stochastic process on $(Omega,mathcal A)$


  • $(N_t)_{tge0}$ be a $mathbb N_0$-valued stochastic process on $(Omega,mathcal A)$


Don't know if it matters, but in my application, $Y$ is a Markov chain and $N$ is a Poisson process, independent from $Y$.



Moreover, let $$mathcal F^N_t:=sigma(N_s:0le sle t);;;text{for }tge0$$ and $$mathcal F^Y_n:=sigma(Y_m:minleft{0,ldots,nright});;;text{for }ninmathbb N_0.$$



Now, let $$X_t:=Y_{N_t};;;text{for }tge0$$ and $$mathcal F^X_t:=sigma(X_s:0le sle t);;;text{for }tge0$$




How can we show that $$sigmaleft(left{Acap Bcapleft{N_t=nright}:Ainmathcal F^N_t,ninmathbb N_0text{ and }Binmathcal F^Y_nright}right)=mathcal F_t:=sigma(mathcal F_t^Ncupmathcal F_t^X)$$ for all $tge0$?




Let $tge0$. I even fail to show that if $Ainmathcal F^N_t$, $ninmathbb N_0$ and $Binmathcal F^Y_n$, then $Acap Bcapleft{N_t=nright}inmathcal F_t$. Though, it would be clear, if $Bcapleft{N_t=nright}inmathcal F^X_t$. I guess we somehow need to use that $X_t$ coincindes with $Y_n$ on $left{N_t=nright}$.










share|cite|improve this question















Let





  • $(Omega,mathcal A)$ and $(E,mathcal E)$ be measurable spaces


  • $(Y_n)_{ninmathbb N_0}$ be a $(E,mathcal E)$-valued stochastic process on $(Omega,mathcal A)$


  • $(N_t)_{tge0}$ be a $mathbb N_0$-valued stochastic process on $(Omega,mathcal A)$


Don't know if it matters, but in my application, $Y$ is a Markov chain and $N$ is a Poisson process, independent from $Y$.



Moreover, let $$mathcal F^N_t:=sigma(N_s:0le sle t);;;text{for }tge0$$ and $$mathcal F^Y_n:=sigma(Y_m:minleft{0,ldots,nright});;;text{for }ninmathbb N_0.$$



Now, let $$X_t:=Y_{N_t};;;text{for }tge0$$ and $$mathcal F^X_t:=sigma(X_s:0le sle t);;;text{for }tge0$$




How can we show that $$sigmaleft(left{Acap Bcapleft{N_t=nright}:Ainmathcal F^N_t,ninmathbb N_0text{ and }Binmathcal F^Y_nright}right)=mathcal F_t:=sigma(mathcal F_t^Ncupmathcal F_t^X)$$ for all $tge0$?




Let $tge0$. I even fail to show that if $Ainmathcal F^N_t$, $ninmathbb N_0$ and $Binmathcal F^Y_n$, then $Acap Bcapleft{N_t=nright}inmathcal F_t$. Though, it would be clear, if $Bcapleft{N_t=nright}inmathcal F^X_t$. I guess we somehow need to use that $X_t$ coincindes with $Y_n$ on $left{N_t=nright}$.







probability-theory measure-theory stochastic-processes






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 6 hours ago

























asked 8 hours ago









0xbadf00d

1,85541428




1,85541428












  • We cannot show this because it is not true. Take for example the case $Y_0=Y_1=dots$. Then the $sigma$-algebra generated by the composition is trivial, regardless of what the process ${bf N}$ is.
    – Fnacool
    7 hours ago










  • @Fnacool It's claimed here below equation (2.12). Therein $Y$ is a Markov chain and $N$ is a Poisson process, independent from $Y$.
    – 0xbadf00d
    6 hours ago












  • My bad. I incorrectly assumed ${cal F}_t = {cal F}^X_t$. Hope my answer below helps.
    – Fnacool
    5 hours ago


















  • We cannot show this because it is not true. Take for example the case $Y_0=Y_1=dots$. Then the $sigma$-algebra generated by the composition is trivial, regardless of what the process ${bf N}$ is.
    – Fnacool
    7 hours ago










  • @Fnacool It's claimed here below equation (2.12). Therein $Y$ is a Markov chain and $N$ is a Poisson process, independent from $Y$.
    – 0xbadf00d
    6 hours ago












  • My bad. I incorrectly assumed ${cal F}_t = {cal F}^X_t$. Hope my answer below helps.
    – Fnacool
    5 hours ago
















We cannot show this because it is not true. Take for example the case $Y_0=Y_1=dots$. Then the $sigma$-algebra generated by the composition is trivial, regardless of what the process ${bf N}$ is.
– Fnacool
7 hours ago




We cannot show this because it is not true. Take for example the case $Y_0=Y_1=dots$. Then the $sigma$-algebra generated by the composition is trivial, regardless of what the process ${bf N}$ is.
– Fnacool
7 hours ago












@Fnacool It's claimed here below equation (2.12). Therein $Y$ is a Markov chain and $N$ is a Poisson process, independent from $Y$.
– 0xbadf00d
6 hours ago






@Fnacool It's claimed here below equation (2.12). Therein $Y$ is a Markov chain and $N$ is a Poisson process, independent from $Y$.
– 0xbadf00d
6 hours ago














My bad. I incorrectly assumed ${cal F}_t = {cal F}^X_t$. Hope my answer below helps.
– Fnacool
5 hours ago




My bad. I incorrectly assumed ${cal F}_t = {cal F}^X_t$. Hope my answer below helps.
– Fnacool
5 hours ago










1 Answer
1






active

oldest

votes

















up vote
0
down vote













Observe that for any $Ain {cal F}^Y_n$ and any $Bin{cal F}^N_t$, up to null events (not sure if completions were considered here), there exist $tilde Ain {cal E}$ and $tilde Bsubset {mathbb N}_0$ such that
$A = {Y_n in tilde {A}}$.
$B ={N_tin tilde{B}}.$



This should help. Indeed,



$$A cap {N_t=n} ={Y_n in tilde A,N_t=n}={X_t in tilde A,N_t=n}$$
and
$$ B cap {N_t=n} ={N_tin tilde Bcap {n}}.$$



Therefore,



$$ A cap B cap {N_t=n} ={underset{in {cal F}^X_t}{underbrace{ X_t in tilde A}},underset{in {cal F}^Y_t}{underbrace{N_tin tilde B cap {n}}}}.$$



As RHS is an intersection of two events in ${cal F}^N_t$ and ${cal F}^X_t$, it is in $sigma({cal F}^N_tcup {cal F}^X_t)$.






share|cite|improve this answer





















  • What do you mean with "up to null events"? Only those for which $operatorname P[A]ne0$ and $operatorname P[B]ne0$? Why does that matter?
    – 0xbadf00d
    4 hours ago










  • Because it is a normal practice to complete $sigma$-algebras. What this practically means here is that the identification of $A$ and $B$ as given may only hold a.s.
    – Fnacool
    3 hours ago










  • How can we prove that identification? Do you have a reference?
    – 0xbadf00d
    3 hours ago










  • I strongly doubt that these identifications are possible. Note that $mathcal F^Y_nnesigma(Y_n)$.
    – 0xbadf00d
    3 hours ago










  • But note that $left.sigma(X_t)right|_{left{:N_t:=:n:right}}=left.sigma(Y_n)right|_{left{:N_t:=:n:right}}$. Unfortunately, I don't see how this helps.
    – 0xbadf00d
    9 mins ago













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%2f2995311%2fif-y-n-n-in-mathbb-n-0-and-n-t-t-ge0-are-stochastic-processes-what%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
0
down vote













Observe that for any $Ain {cal F}^Y_n$ and any $Bin{cal F}^N_t$, up to null events (not sure if completions were considered here), there exist $tilde Ain {cal E}$ and $tilde Bsubset {mathbb N}_0$ such that
$A = {Y_n in tilde {A}}$.
$B ={N_tin tilde{B}}.$



This should help. Indeed,



$$A cap {N_t=n} ={Y_n in tilde A,N_t=n}={X_t in tilde A,N_t=n}$$
and
$$ B cap {N_t=n} ={N_tin tilde Bcap {n}}.$$



Therefore,



$$ A cap B cap {N_t=n} ={underset{in {cal F}^X_t}{underbrace{ X_t in tilde A}},underset{in {cal F}^Y_t}{underbrace{N_tin tilde B cap {n}}}}.$$



As RHS is an intersection of two events in ${cal F}^N_t$ and ${cal F}^X_t$, it is in $sigma({cal F}^N_tcup {cal F}^X_t)$.






share|cite|improve this answer





















  • What do you mean with "up to null events"? Only those for which $operatorname P[A]ne0$ and $operatorname P[B]ne0$? Why does that matter?
    – 0xbadf00d
    4 hours ago










  • Because it is a normal practice to complete $sigma$-algebras. What this practically means here is that the identification of $A$ and $B$ as given may only hold a.s.
    – Fnacool
    3 hours ago










  • How can we prove that identification? Do you have a reference?
    – 0xbadf00d
    3 hours ago










  • I strongly doubt that these identifications are possible. Note that $mathcal F^Y_nnesigma(Y_n)$.
    – 0xbadf00d
    3 hours ago










  • But note that $left.sigma(X_t)right|_{left{:N_t:=:n:right}}=left.sigma(Y_n)right|_{left{:N_t:=:n:right}}$. Unfortunately, I don't see how this helps.
    – 0xbadf00d
    9 mins ago

















up vote
0
down vote













Observe that for any $Ain {cal F}^Y_n$ and any $Bin{cal F}^N_t$, up to null events (not sure if completions were considered here), there exist $tilde Ain {cal E}$ and $tilde Bsubset {mathbb N}_0$ such that
$A = {Y_n in tilde {A}}$.
$B ={N_tin tilde{B}}.$



This should help. Indeed,



$$A cap {N_t=n} ={Y_n in tilde A,N_t=n}={X_t in tilde A,N_t=n}$$
and
$$ B cap {N_t=n} ={N_tin tilde Bcap {n}}.$$



Therefore,



$$ A cap B cap {N_t=n} ={underset{in {cal F}^X_t}{underbrace{ X_t in tilde A}},underset{in {cal F}^Y_t}{underbrace{N_tin tilde B cap {n}}}}.$$



As RHS is an intersection of two events in ${cal F}^N_t$ and ${cal F}^X_t$, it is in $sigma({cal F}^N_tcup {cal F}^X_t)$.






share|cite|improve this answer





















  • What do you mean with "up to null events"? Only those for which $operatorname P[A]ne0$ and $operatorname P[B]ne0$? Why does that matter?
    – 0xbadf00d
    4 hours ago










  • Because it is a normal practice to complete $sigma$-algebras. What this practically means here is that the identification of $A$ and $B$ as given may only hold a.s.
    – Fnacool
    3 hours ago










  • How can we prove that identification? Do you have a reference?
    – 0xbadf00d
    3 hours ago










  • I strongly doubt that these identifications are possible. Note that $mathcal F^Y_nnesigma(Y_n)$.
    – 0xbadf00d
    3 hours ago










  • But note that $left.sigma(X_t)right|_{left{:N_t:=:n:right}}=left.sigma(Y_n)right|_{left{:N_t:=:n:right}}$. Unfortunately, I don't see how this helps.
    – 0xbadf00d
    9 mins ago















up vote
0
down vote










up vote
0
down vote









Observe that for any $Ain {cal F}^Y_n$ and any $Bin{cal F}^N_t$, up to null events (not sure if completions were considered here), there exist $tilde Ain {cal E}$ and $tilde Bsubset {mathbb N}_0$ such that
$A = {Y_n in tilde {A}}$.
$B ={N_tin tilde{B}}.$



This should help. Indeed,



$$A cap {N_t=n} ={Y_n in tilde A,N_t=n}={X_t in tilde A,N_t=n}$$
and
$$ B cap {N_t=n} ={N_tin tilde Bcap {n}}.$$



Therefore,



$$ A cap B cap {N_t=n} ={underset{in {cal F}^X_t}{underbrace{ X_t in tilde A}},underset{in {cal F}^Y_t}{underbrace{N_tin tilde B cap {n}}}}.$$



As RHS is an intersection of two events in ${cal F}^N_t$ and ${cal F}^X_t$, it is in $sigma({cal F}^N_tcup {cal F}^X_t)$.






share|cite|improve this answer












Observe that for any $Ain {cal F}^Y_n$ and any $Bin{cal F}^N_t$, up to null events (not sure if completions were considered here), there exist $tilde Ain {cal E}$ and $tilde Bsubset {mathbb N}_0$ such that
$A = {Y_n in tilde {A}}$.
$B ={N_tin tilde{B}}.$



This should help. Indeed,



$$A cap {N_t=n} ={Y_n in tilde A,N_t=n}={X_t in tilde A,N_t=n}$$
and
$$ B cap {N_t=n} ={N_tin tilde Bcap {n}}.$$



Therefore,



$$ A cap B cap {N_t=n} ={underset{in {cal F}^X_t}{underbrace{ X_t in tilde A}},underset{in {cal F}^Y_t}{underbrace{N_tin tilde B cap {n}}}}.$$



As RHS is an intersection of two events in ${cal F}^N_t$ and ${cal F}^X_t$, it is in $sigma({cal F}^N_tcup {cal F}^X_t)$.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered 5 hours ago









Fnacool

4,826511




4,826511












  • What do you mean with "up to null events"? Only those for which $operatorname P[A]ne0$ and $operatorname P[B]ne0$? Why does that matter?
    – 0xbadf00d
    4 hours ago










  • Because it is a normal practice to complete $sigma$-algebras. What this practically means here is that the identification of $A$ and $B$ as given may only hold a.s.
    – Fnacool
    3 hours ago










  • How can we prove that identification? Do you have a reference?
    – 0xbadf00d
    3 hours ago










  • I strongly doubt that these identifications are possible. Note that $mathcal F^Y_nnesigma(Y_n)$.
    – 0xbadf00d
    3 hours ago










  • But note that $left.sigma(X_t)right|_{left{:N_t:=:n:right}}=left.sigma(Y_n)right|_{left{:N_t:=:n:right}}$. Unfortunately, I don't see how this helps.
    – 0xbadf00d
    9 mins ago




















  • What do you mean with "up to null events"? Only those for which $operatorname P[A]ne0$ and $operatorname P[B]ne0$? Why does that matter?
    – 0xbadf00d
    4 hours ago










  • Because it is a normal practice to complete $sigma$-algebras. What this practically means here is that the identification of $A$ and $B$ as given may only hold a.s.
    – Fnacool
    3 hours ago










  • How can we prove that identification? Do you have a reference?
    – 0xbadf00d
    3 hours ago










  • I strongly doubt that these identifications are possible. Note that $mathcal F^Y_nnesigma(Y_n)$.
    – 0xbadf00d
    3 hours ago










  • But note that $left.sigma(X_t)right|_{left{:N_t:=:n:right}}=left.sigma(Y_n)right|_{left{:N_t:=:n:right}}$. Unfortunately, I don't see how this helps.
    – 0xbadf00d
    9 mins ago


















What do you mean with "up to null events"? Only those for which $operatorname P[A]ne0$ and $operatorname P[B]ne0$? Why does that matter?
– 0xbadf00d
4 hours ago




What do you mean with "up to null events"? Only those for which $operatorname P[A]ne0$ and $operatorname P[B]ne0$? Why does that matter?
– 0xbadf00d
4 hours ago












Because it is a normal practice to complete $sigma$-algebras. What this practically means here is that the identification of $A$ and $B$ as given may only hold a.s.
– Fnacool
3 hours ago




Because it is a normal practice to complete $sigma$-algebras. What this practically means here is that the identification of $A$ and $B$ as given may only hold a.s.
– Fnacool
3 hours ago












How can we prove that identification? Do you have a reference?
– 0xbadf00d
3 hours ago




How can we prove that identification? Do you have a reference?
– 0xbadf00d
3 hours ago












I strongly doubt that these identifications are possible. Note that $mathcal F^Y_nnesigma(Y_n)$.
– 0xbadf00d
3 hours ago




I strongly doubt that these identifications are possible. Note that $mathcal F^Y_nnesigma(Y_n)$.
– 0xbadf00d
3 hours ago












But note that $left.sigma(X_t)right|_{left{:N_t:=:n:right}}=left.sigma(Y_n)right|_{left{:N_t:=:n:right}}$. Unfortunately, I don't see how this helps.
– 0xbadf00d
9 mins ago






But note that $left.sigma(X_t)right|_{left{:N_t:=:n:right}}=left.sigma(Y_n)right|_{left{:N_t:=:n:right}}$. Unfortunately, I don't see how this helps.
– 0xbadf00d
9 mins ago




















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2995311%2fif-y-n-n-in-mathbb-n-0-and-n-t-t-ge0-are-stochastic-processes-what%23new-answer', 'question_page');
}
);

Post as a guest




















































































Popular posts from this blog

How to change which sound is reproduced for terminal bell?

Can I use Tabulator js library in my java Spring + Thymeleaf project?

Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents