Calculate limit: Make a stopping time $T$ bounded $Tland n$ and take the limit $n to infty$












0












$begingroup$


Say we have a martingale $X$ and a stopping time $T$.



Instead of directly studying the stopped process $X_T$, many proofs employ a trick,
namely, one considers the bounded stopping time $Tland n$ and instead studies $X_{Tland n}$ and then letting $n to infty$ at some point.



I'm trying to prove that
$$ lim_n X_{T land n} = X_T mathbf{1}_{{T < infty}}.$$



Intuitively it makes sense but I'm stuck trying to prove it.



Edit Update: Like saz noted in the comments below the above limit is not true in general if $P(T = infty) > 0$.



I consider this solved as it cleared up my misunderstanding.










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    If $mathbb{P}(T=infty)>0$ then this does, in general, not hold true. You will need to multiply the left-hand side with $1_{{T<infty}}$ ...
    $endgroup$
    – saz
    Dec 8 '18 at 15:24










  • $begingroup$
    Thank you @saz ! Your comment made me realize I had made an erroneous assumption earlier in a proof I was working on.
    $endgroup$
    – Eberhardt
    Dec 8 '18 at 16:21








  • 1




    $begingroup$
    So.. did this solve/answer your question? You might want to notice that if $T(omega)<infty$ then $T(omega) wedge n = T(omega)$ for $n geq N(omega)$ sufficiently large, and therefore the convergence is really not difficult to show.
    $endgroup$
    – saz
    Dec 8 '18 at 16:39












  • $begingroup$
    Yes, I consider it solved. As you pointed out it's not true in general. So no wonder I struggled to prove my false claim. If we add the factor $mathbf{1}_{{T < infty}}$ to the left-hand side it becomes much easier.
    $endgroup$
    – Eberhardt
    Dec 8 '18 at 17:02


















0












$begingroup$


Say we have a martingale $X$ and a stopping time $T$.



Instead of directly studying the stopped process $X_T$, many proofs employ a trick,
namely, one considers the bounded stopping time $Tland n$ and instead studies $X_{Tland n}$ and then letting $n to infty$ at some point.



I'm trying to prove that
$$ lim_n X_{T land n} = X_T mathbf{1}_{{T < infty}}.$$



Intuitively it makes sense but I'm stuck trying to prove it.



Edit Update: Like saz noted in the comments below the above limit is not true in general if $P(T = infty) > 0$.



I consider this solved as it cleared up my misunderstanding.










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    If $mathbb{P}(T=infty)>0$ then this does, in general, not hold true. You will need to multiply the left-hand side with $1_{{T<infty}}$ ...
    $endgroup$
    – saz
    Dec 8 '18 at 15:24










  • $begingroup$
    Thank you @saz ! Your comment made me realize I had made an erroneous assumption earlier in a proof I was working on.
    $endgroup$
    – Eberhardt
    Dec 8 '18 at 16:21








  • 1




    $begingroup$
    So.. did this solve/answer your question? You might want to notice that if $T(omega)<infty$ then $T(omega) wedge n = T(omega)$ for $n geq N(omega)$ sufficiently large, and therefore the convergence is really not difficult to show.
    $endgroup$
    – saz
    Dec 8 '18 at 16:39












  • $begingroup$
    Yes, I consider it solved. As you pointed out it's not true in general. So no wonder I struggled to prove my false claim. If we add the factor $mathbf{1}_{{T < infty}}$ to the left-hand side it becomes much easier.
    $endgroup$
    – Eberhardt
    Dec 8 '18 at 17:02
















0












0








0





$begingroup$


Say we have a martingale $X$ and a stopping time $T$.



Instead of directly studying the stopped process $X_T$, many proofs employ a trick,
namely, one considers the bounded stopping time $Tland n$ and instead studies $X_{Tland n}$ and then letting $n to infty$ at some point.



I'm trying to prove that
$$ lim_n X_{T land n} = X_T mathbf{1}_{{T < infty}}.$$



Intuitively it makes sense but I'm stuck trying to prove it.



Edit Update: Like saz noted in the comments below the above limit is not true in general if $P(T = infty) > 0$.



I consider this solved as it cleared up my misunderstanding.










share|cite|improve this question











$endgroup$




Say we have a martingale $X$ and a stopping time $T$.



Instead of directly studying the stopped process $X_T$, many proofs employ a trick,
namely, one considers the bounded stopping time $Tland n$ and instead studies $X_{Tland n}$ and then letting $n to infty$ at some point.



I'm trying to prove that
$$ lim_n X_{T land n} = X_T mathbf{1}_{{T < infty}}.$$



Intuitively it makes sense but I'm stuck trying to prove it.



Edit Update: Like saz noted in the comments below the above limit is not true in general if $P(T = infty) > 0$.



I consider this solved as it cleared up my misunderstanding.







probability-theory stochastic-processes martingales






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 8 '18 at 17:02







Eberhardt

















asked Dec 8 '18 at 15:15









EberhardtEberhardt

103117




103117








  • 2




    $begingroup$
    If $mathbb{P}(T=infty)>0$ then this does, in general, not hold true. You will need to multiply the left-hand side with $1_{{T<infty}}$ ...
    $endgroup$
    – saz
    Dec 8 '18 at 15:24










  • $begingroup$
    Thank you @saz ! Your comment made me realize I had made an erroneous assumption earlier in a proof I was working on.
    $endgroup$
    – Eberhardt
    Dec 8 '18 at 16:21








  • 1




    $begingroup$
    So.. did this solve/answer your question? You might want to notice that if $T(omega)<infty$ then $T(omega) wedge n = T(omega)$ for $n geq N(omega)$ sufficiently large, and therefore the convergence is really not difficult to show.
    $endgroup$
    – saz
    Dec 8 '18 at 16:39












  • $begingroup$
    Yes, I consider it solved. As you pointed out it's not true in general. So no wonder I struggled to prove my false claim. If we add the factor $mathbf{1}_{{T < infty}}$ to the left-hand side it becomes much easier.
    $endgroup$
    – Eberhardt
    Dec 8 '18 at 17:02
















  • 2




    $begingroup$
    If $mathbb{P}(T=infty)>0$ then this does, in general, not hold true. You will need to multiply the left-hand side with $1_{{T<infty}}$ ...
    $endgroup$
    – saz
    Dec 8 '18 at 15:24










  • $begingroup$
    Thank you @saz ! Your comment made me realize I had made an erroneous assumption earlier in a proof I was working on.
    $endgroup$
    – Eberhardt
    Dec 8 '18 at 16:21








  • 1




    $begingroup$
    So.. did this solve/answer your question? You might want to notice that if $T(omega)<infty$ then $T(omega) wedge n = T(omega)$ for $n geq N(omega)$ sufficiently large, and therefore the convergence is really not difficult to show.
    $endgroup$
    – saz
    Dec 8 '18 at 16:39












  • $begingroup$
    Yes, I consider it solved. As you pointed out it's not true in general. So no wonder I struggled to prove my false claim. If we add the factor $mathbf{1}_{{T < infty}}$ to the left-hand side it becomes much easier.
    $endgroup$
    – Eberhardt
    Dec 8 '18 at 17:02










2




2




$begingroup$
If $mathbb{P}(T=infty)>0$ then this does, in general, not hold true. You will need to multiply the left-hand side with $1_{{T<infty}}$ ...
$endgroup$
– saz
Dec 8 '18 at 15:24




$begingroup$
If $mathbb{P}(T=infty)>0$ then this does, in general, not hold true. You will need to multiply the left-hand side with $1_{{T<infty}}$ ...
$endgroup$
– saz
Dec 8 '18 at 15:24












$begingroup$
Thank you @saz ! Your comment made me realize I had made an erroneous assumption earlier in a proof I was working on.
$endgroup$
– Eberhardt
Dec 8 '18 at 16:21






$begingroup$
Thank you @saz ! Your comment made me realize I had made an erroneous assumption earlier in a proof I was working on.
$endgroup$
– Eberhardt
Dec 8 '18 at 16:21






1




1




$begingroup$
So.. did this solve/answer your question? You might want to notice that if $T(omega)<infty$ then $T(omega) wedge n = T(omega)$ for $n geq N(omega)$ sufficiently large, and therefore the convergence is really not difficult to show.
$endgroup$
– saz
Dec 8 '18 at 16:39






$begingroup$
So.. did this solve/answer your question? You might want to notice that if $T(omega)<infty$ then $T(omega) wedge n = T(omega)$ for $n geq N(omega)$ sufficiently large, and therefore the convergence is really not difficult to show.
$endgroup$
– saz
Dec 8 '18 at 16:39














$begingroup$
Yes, I consider it solved. As you pointed out it's not true in general. So no wonder I struggled to prove my false claim. If we add the factor $mathbf{1}_{{T < infty}}$ to the left-hand side it becomes much easier.
$endgroup$
– Eberhardt
Dec 8 '18 at 17:02






$begingroup$
Yes, I consider it solved. As you pointed out it's not true in general. So no wonder I struggled to prove my false claim. If we add the factor $mathbf{1}_{{T < infty}}$ to the left-hand side it becomes much easier.
$endgroup$
– Eberhardt
Dec 8 '18 at 17:02












0






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',
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%2f3031220%2fcalculate-limit-make-a-stopping-time-t-bounded-t-land-n-and-take-the-limit%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3031220%2fcalculate-limit-make-a-stopping-time-t-bounded-t-land-n-and-take-the-limit%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

Quarter-circle Tiles

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Mont Emei