Two supermartingales and a stopping time
$begingroup$
I have the following task to do:
Let $(X_n)$ and $(Y_n)$ be two supermartingales on the probability space $(Omega, mathcal{A}, P)$ and $T$ be a stopping time regarding a filtration $(mathcal{F}_n)$ and $X_T leq Y_T$ on ${T< infty}$.
Define $Z_n = Y_n$ on ${n<T}$ and $Z_n = X_n$ on ${T leq n}$.
Proof that $(Z_n)$ is a supermartingale.
I tried to use $Z_n = Y_nI_{{n<T}} + X_nI_{{Tleq n}}$ and plug that into $mathbb{E}[Z_n|mathcal{F_{n-1}}]$ and use some properties of the conditional expectation, but I don't seem to get to $leq Z_{n-1}$.
Any help is appreciated.
probability probability-theory conditional-expectation martingales stopping-times
$endgroup$
add a comment |
$begingroup$
I have the following task to do:
Let $(X_n)$ and $(Y_n)$ be two supermartingales on the probability space $(Omega, mathcal{A}, P)$ and $T$ be a stopping time regarding a filtration $(mathcal{F}_n)$ and $X_T leq Y_T$ on ${T< infty}$.
Define $Z_n = Y_n$ on ${n<T}$ and $Z_n = X_n$ on ${T leq n}$.
Proof that $(Z_n)$ is a supermartingale.
I tried to use $Z_n = Y_nI_{{n<T}} + X_nI_{{Tleq n}}$ and plug that into $mathbb{E}[Z_n|mathcal{F_{n-1}}]$ and use some properties of the conditional expectation, but I don't seem to get to $leq Z_{n-1}$.
Any help is appreciated.
probability probability-theory conditional-expectation martingales stopping-times
$endgroup$
$begingroup$
On behalf of @hosam ahmad: this is a theorem 8.1 page 498 in Probability: A Graduate Course Authors: Gut, Allan springer.com/la/book/9781441919854
$endgroup$
– dantopa
Dec 20 '18 at 19:40
add a comment |
$begingroup$
I have the following task to do:
Let $(X_n)$ and $(Y_n)$ be two supermartingales on the probability space $(Omega, mathcal{A}, P)$ and $T$ be a stopping time regarding a filtration $(mathcal{F}_n)$ and $X_T leq Y_T$ on ${T< infty}$.
Define $Z_n = Y_n$ on ${n<T}$ and $Z_n = X_n$ on ${T leq n}$.
Proof that $(Z_n)$ is a supermartingale.
I tried to use $Z_n = Y_nI_{{n<T}} + X_nI_{{Tleq n}}$ and plug that into $mathbb{E}[Z_n|mathcal{F_{n-1}}]$ and use some properties of the conditional expectation, but I don't seem to get to $leq Z_{n-1}$.
Any help is appreciated.
probability probability-theory conditional-expectation martingales stopping-times
$endgroup$
I have the following task to do:
Let $(X_n)$ and $(Y_n)$ be two supermartingales on the probability space $(Omega, mathcal{A}, P)$ and $T$ be a stopping time regarding a filtration $(mathcal{F}_n)$ and $X_T leq Y_T$ on ${T< infty}$.
Define $Z_n = Y_n$ on ${n<T}$ and $Z_n = X_n$ on ${T leq n}$.
Proof that $(Z_n)$ is a supermartingale.
I tried to use $Z_n = Y_nI_{{n<T}} + X_nI_{{Tleq n}}$ and plug that into $mathbb{E}[Z_n|mathcal{F_{n-1}}]$ and use some properties of the conditional expectation, but I don't seem to get to $leq Z_{n-1}$.
Any help is appreciated.
probability probability-theory conditional-expectation martingales stopping-times
probability probability-theory conditional-expectation martingales stopping-times
edited Jun 9 '18 at 3:37
saz
81.8k862130
81.8k862130
asked Jun 8 '18 at 18:34
thatha
1185
1185
$begingroup$
On behalf of @hosam ahmad: this is a theorem 8.1 page 498 in Probability: A Graduate Course Authors: Gut, Allan springer.com/la/book/9781441919854
$endgroup$
– dantopa
Dec 20 '18 at 19:40
add a comment |
$begingroup$
On behalf of @hosam ahmad: this is a theorem 8.1 page 498 in Probability: A Graduate Course Authors: Gut, Allan springer.com/la/book/9781441919854
$endgroup$
– dantopa
Dec 20 '18 at 19:40
$begingroup$
On behalf of @hosam ahmad: this is a theorem 8.1 page 498 in Probability: A Graduate Course Authors: Gut, Allan springer.com/la/book/9781441919854
$endgroup$
– dantopa
Dec 20 '18 at 19:40
$begingroup$
On behalf of @hosam ahmad: this is a theorem 8.1 page 498 in Probability: A Graduate Course Authors: Gut, Allan springer.com/la/book/9781441919854
$endgroup$
– dantopa
Dec 20 '18 at 19:40
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Note that $X_T leq Y_T$ implies that
$$begin{align*} X_n 1_{{T leq n}} = X_n 1_{{T leq n-1}} + X_T 1_{{T=n}} &leq X_n 1_{{T leq n-1}}+ Y_T 1_{{T =n}} \ &= X_n 1_{{T leq n-1}}+ Y_n 1_{{T =n}}. end{align*}$$
Thus,
$$Z_n leq Y_{n} 1_{{T leq n-1}^c} + X_n 1_{{T leq n-1}}.$$
Now use that $(Y_{n})_{n in mathbb{N}}$ and $(X_n)_{n in mathbb{N}}$ are supermartingales and the fact that ${T leq n-1} in mathcal{F}_{n-1}$ to conclude that
$$mathbb{E}(Z_n mid mathcal{F}_{n-1}) leq Z_{n-1}.$$
$endgroup$
$begingroup$
Thank you for your answer, but I have to ask how do you conclude $Z_n leq Y_n 1_{{Tleq n-1}^c} + X_n1_{{Tleq n-1}}$? I have $Z_n leq Y_n 1_{{nleq T}} + X_n1_{{Tleq n-1}}$.
$endgroup$
– tha
Jun 8 '18 at 21:41
1
$begingroup$
@tha That's exactly the same thing, isn't it? Note that ${n leq T} = {T geq n} = {T leq n-1}^c$.
$endgroup$
– saz
Jun 9 '18 at 3:37
$begingroup$
Oh yes, that was my fault. Everything is good, thank you.
$endgroup$
– tha
Jun 9 '18 at 8:39
add a comment |
$begingroup$
this is a theorem 8.1 page 498 in Probability: A Graduate Course
Authors: Gut, Allan
https://www.springer.com/la/book/9781441919854
$endgroup$
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%2f2812799%2ftwo-supermartingales-and-a-stopping-time%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
$begingroup$
Note that $X_T leq Y_T$ implies that
$$begin{align*} X_n 1_{{T leq n}} = X_n 1_{{T leq n-1}} + X_T 1_{{T=n}} &leq X_n 1_{{T leq n-1}}+ Y_T 1_{{T =n}} \ &= X_n 1_{{T leq n-1}}+ Y_n 1_{{T =n}}. end{align*}$$
Thus,
$$Z_n leq Y_{n} 1_{{T leq n-1}^c} + X_n 1_{{T leq n-1}}.$$
Now use that $(Y_{n})_{n in mathbb{N}}$ and $(X_n)_{n in mathbb{N}}$ are supermartingales and the fact that ${T leq n-1} in mathcal{F}_{n-1}$ to conclude that
$$mathbb{E}(Z_n mid mathcal{F}_{n-1}) leq Z_{n-1}.$$
$endgroup$
$begingroup$
Thank you for your answer, but I have to ask how do you conclude $Z_n leq Y_n 1_{{Tleq n-1}^c} + X_n1_{{Tleq n-1}}$? I have $Z_n leq Y_n 1_{{nleq T}} + X_n1_{{Tleq n-1}}$.
$endgroup$
– tha
Jun 8 '18 at 21:41
1
$begingroup$
@tha That's exactly the same thing, isn't it? Note that ${n leq T} = {T geq n} = {T leq n-1}^c$.
$endgroup$
– saz
Jun 9 '18 at 3:37
$begingroup$
Oh yes, that was my fault. Everything is good, thank you.
$endgroup$
– tha
Jun 9 '18 at 8:39
add a comment |
$begingroup$
Note that $X_T leq Y_T$ implies that
$$begin{align*} X_n 1_{{T leq n}} = X_n 1_{{T leq n-1}} + X_T 1_{{T=n}} &leq X_n 1_{{T leq n-1}}+ Y_T 1_{{T =n}} \ &= X_n 1_{{T leq n-1}}+ Y_n 1_{{T =n}}. end{align*}$$
Thus,
$$Z_n leq Y_{n} 1_{{T leq n-1}^c} + X_n 1_{{T leq n-1}}.$$
Now use that $(Y_{n})_{n in mathbb{N}}$ and $(X_n)_{n in mathbb{N}}$ are supermartingales and the fact that ${T leq n-1} in mathcal{F}_{n-1}$ to conclude that
$$mathbb{E}(Z_n mid mathcal{F}_{n-1}) leq Z_{n-1}.$$
$endgroup$
$begingroup$
Thank you for your answer, but I have to ask how do you conclude $Z_n leq Y_n 1_{{Tleq n-1}^c} + X_n1_{{Tleq n-1}}$? I have $Z_n leq Y_n 1_{{nleq T}} + X_n1_{{Tleq n-1}}$.
$endgroup$
– tha
Jun 8 '18 at 21:41
1
$begingroup$
@tha That's exactly the same thing, isn't it? Note that ${n leq T} = {T geq n} = {T leq n-1}^c$.
$endgroup$
– saz
Jun 9 '18 at 3:37
$begingroup$
Oh yes, that was my fault. Everything is good, thank you.
$endgroup$
– tha
Jun 9 '18 at 8:39
add a comment |
$begingroup$
Note that $X_T leq Y_T$ implies that
$$begin{align*} X_n 1_{{T leq n}} = X_n 1_{{T leq n-1}} + X_T 1_{{T=n}} &leq X_n 1_{{T leq n-1}}+ Y_T 1_{{T =n}} \ &= X_n 1_{{T leq n-1}}+ Y_n 1_{{T =n}}. end{align*}$$
Thus,
$$Z_n leq Y_{n} 1_{{T leq n-1}^c} + X_n 1_{{T leq n-1}}.$$
Now use that $(Y_{n})_{n in mathbb{N}}$ and $(X_n)_{n in mathbb{N}}$ are supermartingales and the fact that ${T leq n-1} in mathcal{F}_{n-1}$ to conclude that
$$mathbb{E}(Z_n mid mathcal{F}_{n-1}) leq Z_{n-1}.$$
$endgroup$
Note that $X_T leq Y_T$ implies that
$$begin{align*} X_n 1_{{T leq n}} = X_n 1_{{T leq n-1}} + X_T 1_{{T=n}} &leq X_n 1_{{T leq n-1}}+ Y_T 1_{{T =n}} \ &= X_n 1_{{T leq n-1}}+ Y_n 1_{{T =n}}. end{align*}$$
Thus,
$$Z_n leq Y_{n} 1_{{T leq n-1}^c} + X_n 1_{{T leq n-1}}.$$
Now use that $(Y_{n})_{n in mathbb{N}}$ and $(X_n)_{n in mathbb{N}}$ are supermartingales and the fact that ${T leq n-1} in mathcal{F}_{n-1}$ to conclude that
$$mathbb{E}(Z_n mid mathcal{F}_{n-1}) leq Z_{n-1}.$$
edited Jun 8 '18 at 20:03
answered Jun 8 '18 at 19:38
sazsaz
81.8k862130
81.8k862130
$begingroup$
Thank you for your answer, but I have to ask how do you conclude $Z_n leq Y_n 1_{{Tleq n-1}^c} + X_n1_{{Tleq n-1}}$? I have $Z_n leq Y_n 1_{{nleq T}} + X_n1_{{Tleq n-1}}$.
$endgroup$
– tha
Jun 8 '18 at 21:41
1
$begingroup$
@tha That's exactly the same thing, isn't it? Note that ${n leq T} = {T geq n} = {T leq n-1}^c$.
$endgroup$
– saz
Jun 9 '18 at 3:37
$begingroup$
Oh yes, that was my fault. Everything is good, thank you.
$endgroup$
– tha
Jun 9 '18 at 8:39
add a comment |
$begingroup$
Thank you for your answer, but I have to ask how do you conclude $Z_n leq Y_n 1_{{Tleq n-1}^c} + X_n1_{{Tleq n-1}}$? I have $Z_n leq Y_n 1_{{nleq T}} + X_n1_{{Tleq n-1}}$.
$endgroup$
– tha
Jun 8 '18 at 21:41
1
$begingroup$
@tha That's exactly the same thing, isn't it? Note that ${n leq T} = {T geq n} = {T leq n-1}^c$.
$endgroup$
– saz
Jun 9 '18 at 3:37
$begingroup$
Oh yes, that was my fault. Everything is good, thank you.
$endgroup$
– tha
Jun 9 '18 at 8:39
$begingroup$
Thank you for your answer, but I have to ask how do you conclude $Z_n leq Y_n 1_{{Tleq n-1}^c} + X_n1_{{Tleq n-1}}$? I have $Z_n leq Y_n 1_{{nleq T}} + X_n1_{{Tleq n-1}}$.
$endgroup$
– tha
Jun 8 '18 at 21:41
$begingroup$
Thank you for your answer, but I have to ask how do you conclude $Z_n leq Y_n 1_{{Tleq n-1}^c} + X_n1_{{Tleq n-1}}$? I have $Z_n leq Y_n 1_{{nleq T}} + X_n1_{{Tleq n-1}}$.
$endgroup$
– tha
Jun 8 '18 at 21:41
1
1
$begingroup$
@tha That's exactly the same thing, isn't it? Note that ${n leq T} = {T geq n} = {T leq n-1}^c$.
$endgroup$
– saz
Jun 9 '18 at 3:37
$begingroup$
@tha That's exactly the same thing, isn't it? Note that ${n leq T} = {T geq n} = {T leq n-1}^c$.
$endgroup$
– saz
Jun 9 '18 at 3:37
$begingroup$
Oh yes, that was my fault. Everything is good, thank you.
$endgroup$
– tha
Jun 9 '18 at 8:39
$begingroup$
Oh yes, that was my fault. Everything is good, thank you.
$endgroup$
– tha
Jun 9 '18 at 8:39
add a comment |
$begingroup$
this is a theorem 8.1 page 498 in Probability: A Graduate Course
Authors: Gut, Allan
https://www.springer.com/la/book/9781441919854
$endgroup$
add a comment |
$begingroup$
this is a theorem 8.1 page 498 in Probability: A Graduate Course
Authors: Gut, Allan
https://www.springer.com/la/book/9781441919854
$endgroup$
add a comment |
$begingroup$
this is a theorem 8.1 page 498 in Probability: A Graduate Course
Authors: Gut, Allan
https://www.springer.com/la/book/9781441919854
$endgroup$
this is a theorem 8.1 page 498 in Probability: A Graduate Course
Authors: Gut, Allan
https://www.springer.com/la/book/9781441919854
answered Dec 20 '18 at 18:10
hosam ahmadhosam ahmad
84
84
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.
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%2f2812799%2ftwo-supermartingales-and-a-stopping-time%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
$begingroup$
On behalf of @hosam ahmad: this is a theorem 8.1 page 498 in Probability: A Graduate Course Authors: Gut, Allan springer.com/la/book/9781441919854
$endgroup$
– dantopa
Dec 20 '18 at 19:40