Show that $E(X|mathcal{F}_tau)=sumlimits_{ninmathbb{N}}E(X|mathcal{F}_n)mathbf{1}_{{tau=n}}$
up vote
3
down vote
favorite
If $mathbf{E}X<infty$ and $tau$ is a stopping time, then $$mathbf{E}(X|mathcal{F}_tau)=sum_{ninmathbb{N}}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}.$$
My attempt: First assume that $X$ is nonnegative. The general case will follow directly from nonnegative case.
Let $Ain mathcal{F}_tau.$ Then $Acap {tau=n}in mathcal{F}_n$ for every $ninmathbb{N}.$ Therefore, begin{align*}
int_{A}sum_{ninmathbb{N}}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}dmathbf{P}&=sum_{ninmathbb{N}}int_{A}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}dmathbf{P}=sum_{ninmathbb{N}}int_{Acap {tau=n}}mathbf{E}(X|mathcal{F}_n)dmathbf{P}\&=sum_{ninmathbb{N}}int_{Acap {tau=n}}Xdmathbf{P}=int_A Xdmathbf{P}
end{align*}
where the first equality follows from monotone convergence theorem, third follows from the definition of the conditional expectation.
Question: (1) To prove that $sum_{ninmathbb{N}}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}$ is indeed the conditional expectation of $X$ wrt $mathcal{F}_tau$, I have to prove that it is $mathcal{F}_tau$-measurable. How should I do so?
(2) Since the stopping time can take infinite value, my calculation of the integration above holds only when $tau<infty$ almost surely. Is the condition $tau<infty$ a.s. necessary here?
Thanks in advance!
probability-theory stochastic-processes conditional-expectation stopping-times
add a comment |
up vote
3
down vote
favorite
If $mathbf{E}X<infty$ and $tau$ is a stopping time, then $$mathbf{E}(X|mathcal{F}_tau)=sum_{ninmathbb{N}}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}.$$
My attempt: First assume that $X$ is nonnegative. The general case will follow directly from nonnegative case.
Let $Ain mathcal{F}_tau.$ Then $Acap {tau=n}in mathcal{F}_n$ for every $ninmathbb{N}.$ Therefore, begin{align*}
int_{A}sum_{ninmathbb{N}}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}dmathbf{P}&=sum_{ninmathbb{N}}int_{A}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}dmathbf{P}=sum_{ninmathbb{N}}int_{Acap {tau=n}}mathbf{E}(X|mathcal{F}_n)dmathbf{P}\&=sum_{ninmathbb{N}}int_{Acap {tau=n}}Xdmathbf{P}=int_A Xdmathbf{P}
end{align*}
where the first equality follows from monotone convergence theorem, third follows from the definition of the conditional expectation.
Question: (1) To prove that $sum_{ninmathbb{N}}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}$ is indeed the conditional expectation of $X$ wrt $mathcal{F}_tau$, I have to prove that it is $mathcal{F}_tau$-measurable. How should I do so?
(2) Since the stopping time can take infinite value, my calculation of the integration above holds only when $tau<infty$ almost surely. Is the condition $tau<infty$ a.s. necessary here?
Thanks in advance!
probability-theory stochastic-processes conditional-expectation stopping-times
add a comment |
up vote
3
down vote
favorite
up vote
3
down vote
favorite
If $mathbf{E}X<infty$ and $tau$ is a stopping time, then $$mathbf{E}(X|mathcal{F}_tau)=sum_{ninmathbb{N}}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}.$$
My attempt: First assume that $X$ is nonnegative. The general case will follow directly from nonnegative case.
Let $Ain mathcal{F}_tau.$ Then $Acap {tau=n}in mathcal{F}_n$ for every $ninmathbb{N}.$ Therefore, begin{align*}
int_{A}sum_{ninmathbb{N}}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}dmathbf{P}&=sum_{ninmathbb{N}}int_{A}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}dmathbf{P}=sum_{ninmathbb{N}}int_{Acap {tau=n}}mathbf{E}(X|mathcal{F}_n)dmathbf{P}\&=sum_{ninmathbb{N}}int_{Acap {tau=n}}Xdmathbf{P}=int_A Xdmathbf{P}
end{align*}
where the first equality follows from monotone convergence theorem, third follows from the definition of the conditional expectation.
Question: (1) To prove that $sum_{ninmathbb{N}}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}$ is indeed the conditional expectation of $X$ wrt $mathcal{F}_tau$, I have to prove that it is $mathcal{F}_tau$-measurable. How should I do so?
(2) Since the stopping time can take infinite value, my calculation of the integration above holds only when $tau<infty$ almost surely. Is the condition $tau<infty$ a.s. necessary here?
Thanks in advance!
probability-theory stochastic-processes conditional-expectation stopping-times
If $mathbf{E}X<infty$ and $tau$ is a stopping time, then $$mathbf{E}(X|mathcal{F}_tau)=sum_{ninmathbb{N}}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}.$$
My attempt: First assume that $X$ is nonnegative. The general case will follow directly from nonnegative case.
Let $Ain mathcal{F}_tau.$ Then $Acap {tau=n}in mathcal{F}_n$ for every $ninmathbb{N}.$ Therefore, begin{align*}
int_{A}sum_{ninmathbb{N}}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}dmathbf{P}&=sum_{ninmathbb{N}}int_{A}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}dmathbf{P}=sum_{ninmathbb{N}}int_{Acap {tau=n}}mathbf{E}(X|mathcal{F}_n)dmathbf{P}\&=sum_{ninmathbb{N}}int_{Acap {tau=n}}Xdmathbf{P}=int_A Xdmathbf{P}
end{align*}
where the first equality follows from monotone convergence theorem, third follows from the definition of the conditional expectation.
Question: (1) To prove that $sum_{ninmathbb{N}}mathbf{E}(X|mathcal{F}_n)mathbf{1}_{{tau=n}}$ is indeed the conditional expectation of $X$ wrt $mathcal{F}_tau$, I have to prove that it is $mathcal{F}_tau$-measurable. How should I do so?
(2) Since the stopping time can take infinite value, my calculation of the integration above holds only when $tau<infty$ almost surely. Is the condition $tau<infty$ a.s. necessary here?
Thanks in advance!
probability-theory stochastic-processes conditional-expectation stopping-times
probability-theory stochastic-processes conditional-expectation stopping-times
edited Nov 27 at 17:20
Did
246k23220453
246k23220453
asked Nov 27 at 14:51
bellcircle
1,327411
1,327411
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
up vote
2
down vote
accepted
(1) Recall $mathscr{F}_tau$ is, by definition, the set of events satisfying $mathrm{E} cap {tau = n} in mathscr{F}_n.$ Then, all you need to do is to show that $underbrace{left{ sumlimits_{nin mathbf{N}} mathbf{E}(X mid mathscr{F}_n) mathbf{1}_{{tau=n}} in mathrm{A} right}}_{mathrm{E}} cap {tau = m} in mathscr{F}_m.$ The intersection on the left side becomes ${mathbf{E}(X mid mathscr{F}_m) in mathrm{A}}cap{tau=m},$ which clearly belongs to $mathscr{F}_m.$ Q.E.D.
(2) If $tau = infty$ with positive probability, you would need to add it in the sum and make sense of the case $n = infty$ everywhere.
add a comment |
up vote
1
down vote
It suffices to prove that for each $n$ and each $mathcal F_n$-measurable random variable $Y$, the random variable $Ymathbf 1_{{tau=n}}$ is $mathcal{F}_{tau}$-measurable. By an approximation by simple function argument, it suffices to prove it in the most restrictive case where $Y$ is the indicator function of an $mathcal{F}_{n}$-measurable set, say $B$. This can be done by checking the definition, by proving that $Bcap {tau=n}cap {tau=k}$ is an element of $mathcal F_n$ for all $k$. This intersection is empty for $kneq n$ and for $k=n$, $mathcal{F}_{n}$-measurability of $Bcap {tau=n}$ is guaranteed by the fact that $tau$ is a stopping time.
We have to extend the filtration to $t=+infty$ by taking $mathcal{F}_{+infty}$ as the $sigma$-algebra generated by all the $mathcal{F}_{t}$, add the term $mathbb Eleft[Xmid mathcal F_{+infty}right]mathbf 1_{{tau=+infty}}$ and change the definition of $mathcal{F}_{tau}$ as
$$
mathcal{F}_{tau}=left{Ain mathcal{F}_{+infty}mid forall k, Acap {tau=k}in mathcal F_kright}.
$$
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3015862%2fshow-that-ex-mathcalf-tau-sum-limits-n-in-mathbbnex-mathcalf-n%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
up vote
2
down vote
accepted
(1) Recall $mathscr{F}_tau$ is, by definition, the set of events satisfying $mathrm{E} cap {tau = n} in mathscr{F}_n.$ Then, all you need to do is to show that $underbrace{left{ sumlimits_{nin mathbf{N}} mathbf{E}(X mid mathscr{F}_n) mathbf{1}_{{tau=n}} in mathrm{A} right}}_{mathrm{E}} cap {tau = m} in mathscr{F}_m.$ The intersection on the left side becomes ${mathbf{E}(X mid mathscr{F}_m) in mathrm{A}}cap{tau=m},$ which clearly belongs to $mathscr{F}_m.$ Q.E.D.
(2) If $tau = infty$ with positive probability, you would need to add it in the sum and make sense of the case $n = infty$ everywhere.
add a comment |
up vote
2
down vote
accepted
(1) Recall $mathscr{F}_tau$ is, by definition, the set of events satisfying $mathrm{E} cap {tau = n} in mathscr{F}_n.$ Then, all you need to do is to show that $underbrace{left{ sumlimits_{nin mathbf{N}} mathbf{E}(X mid mathscr{F}_n) mathbf{1}_{{tau=n}} in mathrm{A} right}}_{mathrm{E}} cap {tau = m} in mathscr{F}_m.$ The intersection on the left side becomes ${mathbf{E}(X mid mathscr{F}_m) in mathrm{A}}cap{tau=m},$ which clearly belongs to $mathscr{F}_m.$ Q.E.D.
(2) If $tau = infty$ with positive probability, you would need to add it in the sum and make sense of the case $n = infty$ everywhere.
add a comment |
up vote
2
down vote
accepted
up vote
2
down vote
accepted
(1) Recall $mathscr{F}_tau$ is, by definition, the set of events satisfying $mathrm{E} cap {tau = n} in mathscr{F}_n.$ Then, all you need to do is to show that $underbrace{left{ sumlimits_{nin mathbf{N}} mathbf{E}(X mid mathscr{F}_n) mathbf{1}_{{tau=n}} in mathrm{A} right}}_{mathrm{E}} cap {tau = m} in mathscr{F}_m.$ The intersection on the left side becomes ${mathbf{E}(X mid mathscr{F}_m) in mathrm{A}}cap{tau=m},$ which clearly belongs to $mathscr{F}_m.$ Q.E.D.
(2) If $tau = infty$ with positive probability, you would need to add it in the sum and make sense of the case $n = infty$ everywhere.
(1) Recall $mathscr{F}_tau$ is, by definition, the set of events satisfying $mathrm{E} cap {tau = n} in mathscr{F}_n.$ Then, all you need to do is to show that $underbrace{left{ sumlimits_{nin mathbf{N}} mathbf{E}(X mid mathscr{F}_n) mathbf{1}_{{tau=n}} in mathrm{A} right}}_{mathrm{E}} cap {tau = m} in mathscr{F}_m.$ The intersection on the left side becomes ${mathbf{E}(X mid mathscr{F}_m) in mathrm{A}}cap{tau=m},$ which clearly belongs to $mathscr{F}_m.$ Q.E.D.
(2) If $tau = infty$ with positive probability, you would need to add it in the sum and make sense of the case $n = infty$ everywhere.
answered Nov 27 at 17:27
Will M.
2,352314
2,352314
add a comment |
add a comment |
up vote
1
down vote
It suffices to prove that for each $n$ and each $mathcal F_n$-measurable random variable $Y$, the random variable $Ymathbf 1_{{tau=n}}$ is $mathcal{F}_{tau}$-measurable. By an approximation by simple function argument, it suffices to prove it in the most restrictive case where $Y$ is the indicator function of an $mathcal{F}_{n}$-measurable set, say $B$. This can be done by checking the definition, by proving that $Bcap {tau=n}cap {tau=k}$ is an element of $mathcal F_n$ for all $k$. This intersection is empty for $kneq n$ and for $k=n$, $mathcal{F}_{n}$-measurability of $Bcap {tau=n}$ is guaranteed by the fact that $tau$ is a stopping time.
We have to extend the filtration to $t=+infty$ by taking $mathcal{F}_{+infty}$ as the $sigma$-algebra generated by all the $mathcal{F}_{t}$, add the term $mathbb Eleft[Xmid mathcal F_{+infty}right]mathbf 1_{{tau=+infty}}$ and change the definition of $mathcal{F}_{tau}$ as
$$
mathcal{F}_{tau}=left{Ain mathcal{F}_{+infty}mid forall k, Acap {tau=k}in mathcal F_kright}.
$$
add a comment |
up vote
1
down vote
It suffices to prove that for each $n$ and each $mathcal F_n$-measurable random variable $Y$, the random variable $Ymathbf 1_{{tau=n}}$ is $mathcal{F}_{tau}$-measurable. By an approximation by simple function argument, it suffices to prove it in the most restrictive case where $Y$ is the indicator function of an $mathcal{F}_{n}$-measurable set, say $B$. This can be done by checking the definition, by proving that $Bcap {tau=n}cap {tau=k}$ is an element of $mathcal F_n$ for all $k$. This intersection is empty for $kneq n$ and for $k=n$, $mathcal{F}_{n}$-measurability of $Bcap {tau=n}$ is guaranteed by the fact that $tau$ is a stopping time.
We have to extend the filtration to $t=+infty$ by taking $mathcal{F}_{+infty}$ as the $sigma$-algebra generated by all the $mathcal{F}_{t}$, add the term $mathbb Eleft[Xmid mathcal F_{+infty}right]mathbf 1_{{tau=+infty}}$ and change the definition of $mathcal{F}_{tau}$ as
$$
mathcal{F}_{tau}=left{Ain mathcal{F}_{+infty}mid forall k, Acap {tau=k}in mathcal F_kright}.
$$
add a comment |
up vote
1
down vote
up vote
1
down vote
It suffices to prove that for each $n$ and each $mathcal F_n$-measurable random variable $Y$, the random variable $Ymathbf 1_{{tau=n}}$ is $mathcal{F}_{tau}$-measurable. By an approximation by simple function argument, it suffices to prove it in the most restrictive case where $Y$ is the indicator function of an $mathcal{F}_{n}$-measurable set, say $B$. This can be done by checking the definition, by proving that $Bcap {tau=n}cap {tau=k}$ is an element of $mathcal F_n$ for all $k$. This intersection is empty for $kneq n$ and for $k=n$, $mathcal{F}_{n}$-measurability of $Bcap {tau=n}$ is guaranteed by the fact that $tau$ is a stopping time.
We have to extend the filtration to $t=+infty$ by taking $mathcal{F}_{+infty}$ as the $sigma$-algebra generated by all the $mathcal{F}_{t}$, add the term $mathbb Eleft[Xmid mathcal F_{+infty}right]mathbf 1_{{tau=+infty}}$ and change the definition of $mathcal{F}_{tau}$ as
$$
mathcal{F}_{tau}=left{Ain mathcal{F}_{+infty}mid forall k, Acap {tau=k}in mathcal F_kright}.
$$
It suffices to prove that for each $n$ and each $mathcal F_n$-measurable random variable $Y$, the random variable $Ymathbf 1_{{tau=n}}$ is $mathcal{F}_{tau}$-measurable. By an approximation by simple function argument, it suffices to prove it in the most restrictive case where $Y$ is the indicator function of an $mathcal{F}_{n}$-measurable set, say $B$. This can be done by checking the definition, by proving that $Bcap {tau=n}cap {tau=k}$ is an element of $mathcal F_n$ for all $k$. This intersection is empty for $kneq n$ and for $k=n$, $mathcal{F}_{n}$-measurability of $Bcap {tau=n}$ is guaranteed by the fact that $tau$ is a stopping time.
We have to extend the filtration to $t=+infty$ by taking $mathcal{F}_{+infty}$ as the $sigma$-algebra generated by all the $mathcal{F}_{t}$, add the term $mathbb Eleft[Xmid mathcal F_{+infty}right]mathbf 1_{{tau=+infty}}$ and change the definition of $mathcal{F}_{tau}$ as
$$
mathcal{F}_{tau}=left{Ain mathcal{F}_{+infty}mid forall k, Acap {tau=k}in mathcal F_kright}.
$$
answered Nov 27 at 15:56
Davide Giraudo
124k16150259
124k16150259
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3015862%2fshow-that-ex-mathcalf-tau-sum-limits-n-in-mathbbnex-mathcalf-n%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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