Equivalent condition for the existence of a $t∈(T_0,T_1]$ with $|f(t)-lim_{s→t-}f(s)|>ε$ for a...
$begingroup$
Let $f:[0,infty)tomathbb R$ be right-continuous and assume that the left-sided limit $$f(t-):=lim_{sto t-}f(s)$$ exists for all $tge0$. Now, let $$Delta f(t):=f(t)-f(t-);;;text{for }tge0,$$ $0le T_0<T_1<T_1$ and $varepsilonge0$.
How can we show that
- $exists tin(T_0,T_1]:|Delta f(t)|>varepsilon$
- $exists kinmathbb N:forall linmathbb N:exists s_1,s_2inmathbb Qcapleft(T_0,T_1+frac1lright]:|s_1-s_2|<frac1ltext{ and }|f(s_1)-f(s_2)|>varepsilon+frac1k$
are equivalent?
While intuitively reasonable, it's not clear to me how we need to construct the equivalence. For example, assume 1.: Since $f$ has a left-sided limit at $t$, we can minimize $|f(s)-f(t-)|$ arbitrarily by choosing $s<t$ sufficiently close to $t$. In the same way, by right-continuity at $t$, we can minimize $|f(s)-f(t)|$ arbitrarily by choosing $sge t$ sufficiently close to $t$. So, maybe the basic idea could be to choose $s_1<t$ and $s_2ge t$ and use $$varepsilon<|Delta f(t)|le|f(s_1)-f(s_2)|+|f(s_1)-f(t-)|+|f(s_2)-f(t)|tag1.$$ (I've assumed $varepsilon>0$. Guess the case $varepsilon=0$ needs to be treated separately?)
calculus limits analysis continuity
$endgroup$
add a comment |
$begingroup$
Let $f:[0,infty)tomathbb R$ be right-continuous and assume that the left-sided limit $$f(t-):=lim_{sto t-}f(s)$$ exists for all $tge0$. Now, let $$Delta f(t):=f(t)-f(t-);;;text{for }tge0,$$ $0le T_0<T_1<T_1$ and $varepsilonge0$.
How can we show that
- $exists tin(T_0,T_1]:|Delta f(t)|>varepsilon$
- $exists kinmathbb N:forall linmathbb N:exists s_1,s_2inmathbb Qcapleft(T_0,T_1+frac1lright]:|s_1-s_2|<frac1ltext{ and }|f(s_1)-f(s_2)|>varepsilon+frac1k$
are equivalent?
While intuitively reasonable, it's not clear to me how we need to construct the equivalence. For example, assume 1.: Since $f$ has a left-sided limit at $t$, we can minimize $|f(s)-f(t-)|$ arbitrarily by choosing $s<t$ sufficiently close to $t$. In the same way, by right-continuity at $t$, we can minimize $|f(s)-f(t)|$ arbitrarily by choosing $sge t$ sufficiently close to $t$. So, maybe the basic idea could be to choose $s_1<t$ and $s_2ge t$ and use $$varepsilon<|Delta f(t)|le|f(s_1)-f(s_2)|+|f(s_1)-f(t-)|+|f(s_2)-f(t)|tag1.$$ (I've assumed $varepsilon>0$. Guess the case $varepsilon=0$ needs to be treated separately?)
calculus limits analysis continuity
$endgroup$
add a comment |
$begingroup$
Let $f:[0,infty)tomathbb R$ be right-continuous and assume that the left-sided limit $$f(t-):=lim_{sto t-}f(s)$$ exists for all $tge0$. Now, let $$Delta f(t):=f(t)-f(t-);;;text{for }tge0,$$ $0le T_0<T_1<T_1$ and $varepsilonge0$.
How can we show that
- $exists tin(T_0,T_1]:|Delta f(t)|>varepsilon$
- $exists kinmathbb N:forall linmathbb N:exists s_1,s_2inmathbb Qcapleft(T_0,T_1+frac1lright]:|s_1-s_2|<frac1ltext{ and }|f(s_1)-f(s_2)|>varepsilon+frac1k$
are equivalent?
While intuitively reasonable, it's not clear to me how we need to construct the equivalence. For example, assume 1.: Since $f$ has a left-sided limit at $t$, we can minimize $|f(s)-f(t-)|$ arbitrarily by choosing $s<t$ sufficiently close to $t$. In the same way, by right-continuity at $t$, we can minimize $|f(s)-f(t)|$ arbitrarily by choosing $sge t$ sufficiently close to $t$. So, maybe the basic idea could be to choose $s_1<t$ and $s_2ge t$ and use $$varepsilon<|Delta f(t)|le|f(s_1)-f(s_2)|+|f(s_1)-f(t-)|+|f(s_2)-f(t)|tag1.$$ (I've assumed $varepsilon>0$. Guess the case $varepsilon=0$ needs to be treated separately?)
calculus limits analysis continuity
$endgroup$
Let $f:[0,infty)tomathbb R$ be right-continuous and assume that the left-sided limit $$f(t-):=lim_{sto t-}f(s)$$ exists for all $tge0$. Now, let $$Delta f(t):=f(t)-f(t-);;;text{for }tge0,$$ $0le T_0<T_1<T_1$ and $varepsilonge0$.
How can we show that
- $exists tin(T_0,T_1]:|Delta f(t)|>varepsilon$
- $exists kinmathbb N:forall linmathbb N:exists s_1,s_2inmathbb Qcapleft(T_0,T_1+frac1lright]:|s_1-s_2|<frac1ltext{ and }|f(s_1)-f(s_2)|>varepsilon+frac1k$
are equivalent?
While intuitively reasonable, it's not clear to me how we need to construct the equivalence. For example, assume 1.: Since $f$ has a left-sided limit at $t$, we can minimize $|f(s)-f(t-)|$ arbitrarily by choosing $s<t$ sufficiently close to $t$. In the same way, by right-continuity at $t$, we can minimize $|f(s)-f(t)|$ arbitrarily by choosing $sge t$ sufficiently close to $t$. So, maybe the basic idea could be to choose $s_1<t$ and $s_2ge t$ and use $$varepsilon<|Delta f(t)|le|f(s_1)-f(s_2)|+|f(s_1)-f(t-)|+|f(s_2)-f(t)|tag1.$$ (I've assumed $varepsilon>0$. Guess the case $varepsilon=0$ needs to be treated separately?)
calculus limits analysis continuity
calculus limits analysis continuity
edited Dec 6 '18 at 14:15
0xbadf00d
asked Dec 6 '18 at 10:33
0xbadf00d0xbadf00d
1,81241430
1,81241430
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
- implies 2.:
As $|Delta f(t)| > epsilon$ we can choose $k in mathbb{N}$ such that $|Delta f(t)| geq epsilon+3/k$. Since $f$ has a finite left-hand limit at $t$, we can choose $delta_1>0$ such that
$$|f(u)-f(t-)| < frac{1}{k} quad text{for all $u in [t-delta_1,t)$}.$$
Analogously, the right-continuity yields that there exists $delta_2>0$ such that
$$|f(t)-f(v)| < frac{1}{k} quad text{for all $v in [t,t+delta_2]$}.$$
If $ell in mathbb{N}$ is a given fixed number we may assume without loss of generality that $delta := min{delta_1,delta_2} <1/(2ell)$. Choose some $s_1 in [t-delta,t) cap mathbb{Q}$ and $s_2 in [t,t+delta) cap mathbb{Q}$. Then $$|s_1-s_2| leq |s_1-t| + |t-s_2| leq 2 delta = frac{1}{ell}$$ and $$begin{align*} epsilon + frac{3}{k} leq |Delta f(t)| &leq |f(s_1)-f(t-)| + |f(t)-f(s_2)| + |f(s_1)-f(s_2)| \ &< frac{2}{k} + |f(s_1)-f(s_2)|, end{align*}$$ i.e. $$|f(s_1)-f(s_2)| > epsilon + frac{1}{k} $$
- implies 1.
Let $k in mathbb{N}$ be as in 2. and choose for any $ell in mathbb{N}$ some numbers $s_1^{(ell)}$ and $s_2^{(ell)}$ in $[T_0,T_1+1]$ such that $$|s_1^{(ell)}-s_2^{(ell)}| leq 1/ell tag{1}$$ and $$|f(s_1^{(ell)})-f(s_2^{(ell)})| > epsilon+1/k. tag{2}$$ Since the interval $[T_0,T_1+1]$ is compact we can find convergent subsequences, say $(t_1^{(ell)})$ and $(t_2^{(ell)})$, of $(s_1^{(ell)})$ and $(s_2^{(ell)})$, and it follows from $(1)$ that $$ t = lim_{ell to infty} t_1^{(ell)} = lim_{t to infty} t_2^{(ell)}.$$ By the continuity assumptions on $f$, this implies
$$f_i := lim_{ell to infty} f(t_i^{(ell)}) in {f(t),f(t-)} tag{3}$$
for $i=1,2$. On the other hand, we know from $(2)$ that
$$|f_1-f_2|> epsilon + frac{1}{k}>0, tag{4}$$
and therefore $f_1 neq f_2$. From $(3)$ we thus conclude that one of the limits equals $f(t)$ and th other limit equals $f(t-)$. Hence, by (4),
$$|Delta f(t)|= |f(t)-f(t-)| > epsilon.$$
$endgroup$
$begingroup$
Thank you very much for your answer. I've got a related question (even so it might not look related at a first glance). Would be great if you could help there too. Oh, and I don't know if you noticed, I've asked a (somehow related) question on the convergence of discrete-time Markov chain to Feller processes. I could imagine that you have at least an idea for an answer.
$endgroup$
– 0xbadf00d
Dec 6 '18 at 17:51
$begingroup$
If $g:[0,infty)tomathbb R$ is continuous and $$sigma:=infleft{tge0:|f(t)|gevarepsilonright},$$ then $|g(sigma)|=varepsilon$. Are we able to say something similar about $|Delta f(tau)|$ and $f(tau)$?
$endgroup$
– 0xbadf00d
Dec 6 '18 at 19:57
$begingroup$
@0xbadf00d Unless you tell me something about the relation of $f$, $g$ and $sigma$, $tau$ this is impossible to say...
$endgroup$
– saz
Dec 6 '18 at 19:59
$begingroup$
Sorry, $$tau:=infleft{tge0:|Delta f(t)|>varepsilonright}.$$
$endgroup$
– 0xbadf00d
Dec 6 '18 at 20:00
1
$begingroup$
@0xbadf00d Note that a Poisson process has only finitely many jumps in finite time intervals, and therefore $tau=T_1$ is the first time the process jumps (i.e. the infimum is attained at $t=T_1$). In particular $f(tau)=1$.
$endgroup$
– saz
Dec 7 '18 at 12:03
|
show 4 more comments
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%2f3028322%2fequivalent-condition-for-the-existence-of-a-t%25e2%2588%2588t-0-t-1-with-ft-lim-s%25e2%2586%2592t%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
- implies 2.:
As $|Delta f(t)| > epsilon$ we can choose $k in mathbb{N}$ such that $|Delta f(t)| geq epsilon+3/k$. Since $f$ has a finite left-hand limit at $t$, we can choose $delta_1>0$ such that
$$|f(u)-f(t-)| < frac{1}{k} quad text{for all $u in [t-delta_1,t)$}.$$
Analogously, the right-continuity yields that there exists $delta_2>0$ such that
$$|f(t)-f(v)| < frac{1}{k} quad text{for all $v in [t,t+delta_2]$}.$$
If $ell in mathbb{N}$ is a given fixed number we may assume without loss of generality that $delta := min{delta_1,delta_2} <1/(2ell)$. Choose some $s_1 in [t-delta,t) cap mathbb{Q}$ and $s_2 in [t,t+delta) cap mathbb{Q}$. Then $$|s_1-s_2| leq |s_1-t| + |t-s_2| leq 2 delta = frac{1}{ell}$$ and $$begin{align*} epsilon + frac{3}{k} leq |Delta f(t)| &leq |f(s_1)-f(t-)| + |f(t)-f(s_2)| + |f(s_1)-f(s_2)| \ &< frac{2}{k} + |f(s_1)-f(s_2)|, end{align*}$$ i.e. $$|f(s_1)-f(s_2)| > epsilon + frac{1}{k} $$
- implies 1.
Let $k in mathbb{N}$ be as in 2. and choose for any $ell in mathbb{N}$ some numbers $s_1^{(ell)}$ and $s_2^{(ell)}$ in $[T_0,T_1+1]$ such that $$|s_1^{(ell)}-s_2^{(ell)}| leq 1/ell tag{1}$$ and $$|f(s_1^{(ell)})-f(s_2^{(ell)})| > epsilon+1/k. tag{2}$$ Since the interval $[T_0,T_1+1]$ is compact we can find convergent subsequences, say $(t_1^{(ell)})$ and $(t_2^{(ell)})$, of $(s_1^{(ell)})$ and $(s_2^{(ell)})$, and it follows from $(1)$ that $$ t = lim_{ell to infty} t_1^{(ell)} = lim_{t to infty} t_2^{(ell)}.$$ By the continuity assumptions on $f$, this implies
$$f_i := lim_{ell to infty} f(t_i^{(ell)}) in {f(t),f(t-)} tag{3}$$
for $i=1,2$. On the other hand, we know from $(2)$ that
$$|f_1-f_2|> epsilon + frac{1}{k}>0, tag{4}$$
and therefore $f_1 neq f_2$. From $(3)$ we thus conclude that one of the limits equals $f(t)$ and th other limit equals $f(t-)$. Hence, by (4),
$$|Delta f(t)|= |f(t)-f(t-)| > epsilon.$$
$endgroup$
$begingroup$
Thank you very much for your answer. I've got a related question (even so it might not look related at a first glance). Would be great if you could help there too. Oh, and I don't know if you noticed, I've asked a (somehow related) question on the convergence of discrete-time Markov chain to Feller processes. I could imagine that you have at least an idea for an answer.
$endgroup$
– 0xbadf00d
Dec 6 '18 at 17:51
$begingroup$
If $g:[0,infty)tomathbb R$ is continuous and $$sigma:=infleft{tge0:|f(t)|gevarepsilonright},$$ then $|g(sigma)|=varepsilon$. Are we able to say something similar about $|Delta f(tau)|$ and $f(tau)$?
$endgroup$
– 0xbadf00d
Dec 6 '18 at 19:57
$begingroup$
@0xbadf00d Unless you tell me something about the relation of $f$, $g$ and $sigma$, $tau$ this is impossible to say...
$endgroup$
– saz
Dec 6 '18 at 19:59
$begingroup$
Sorry, $$tau:=infleft{tge0:|Delta f(t)|>varepsilonright}.$$
$endgroup$
– 0xbadf00d
Dec 6 '18 at 20:00
1
$begingroup$
@0xbadf00d Note that a Poisson process has only finitely many jumps in finite time intervals, and therefore $tau=T_1$ is the first time the process jumps (i.e. the infimum is attained at $t=T_1$). In particular $f(tau)=1$.
$endgroup$
– saz
Dec 7 '18 at 12:03
|
show 4 more comments
$begingroup$
- implies 2.:
As $|Delta f(t)| > epsilon$ we can choose $k in mathbb{N}$ such that $|Delta f(t)| geq epsilon+3/k$. Since $f$ has a finite left-hand limit at $t$, we can choose $delta_1>0$ such that
$$|f(u)-f(t-)| < frac{1}{k} quad text{for all $u in [t-delta_1,t)$}.$$
Analogously, the right-continuity yields that there exists $delta_2>0$ such that
$$|f(t)-f(v)| < frac{1}{k} quad text{for all $v in [t,t+delta_2]$}.$$
If $ell in mathbb{N}$ is a given fixed number we may assume without loss of generality that $delta := min{delta_1,delta_2} <1/(2ell)$. Choose some $s_1 in [t-delta,t) cap mathbb{Q}$ and $s_2 in [t,t+delta) cap mathbb{Q}$. Then $$|s_1-s_2| leq |s_1-t| + |t-s_2| leq 2 delta = frac{1}{ell}$$ and $$begin{align*} epsilon + frac{3}{k} leq |Delta f(t)| &leq |f(s_1)-f(t-)| + |f(t)-f(s_2)| + |f(s_1)-f(s_2)| \ &< frac{2}{k} + |f(s_1)-f(s_2)|, end{align*}$$ i.e. $$|f(s_1)-f(s_2)| > epsilon + frac{1}{k} $$
- implies 1.
Let $k in mathbb{N}$ be as in 2. and choose for any $ell in mathbb{N}$ some numbers $s_1^{(ell)}$ and $s_2^{(ell)}$ in $[T_0,T_1+1]$ such that $$|s_1^{(ell)}-s_2^{(ell)}| leq 1/ell tag{1}$$ and $$|f(s_1^{(ell)})-f(s_2^{(ell)})| > epsilon+1/k. tag{2}$$ Since the interval $[T_0,T_1+1]$ is compact we can find convergent subsequences, say $(t_1^{(ell)})$ and $(t_2^{(ell)})$, of $(s_1^{(ell)})$ and $(s_2^{(ell)})$, and it follows from $(1)$ that $$ t = lim_{ell to infty} t_1^{(ell)} = lim_{t to infty} t_2^{(ell)}.$$ By the continuity assumptions on $f$, this implies
$$f_i := lim_{ell to infty} f(t_i^{(ell)}) in {f(t),f(t-)} tag{3}$$
for $i=1,2$. On the other hand, we know from $(2)$ that
$$|f_1-f_2|> epsilon + frac{1}{k}>0, tag{4}$$
and therefore $f_1 neq f_2$. From $(3)$ we thus conclude that one of the limits equals $f(t)$ and th other limit equals $f(t-)$. Hence, by (4),
$$|Delta f(t)|= |f(t)-f(t-)| > epsilon.$$
$endgroup$
$begingroup$
Thank you very much for your answer. I've got a related question (even so it might not look related at a first glance). Would be great if you could help there too. Oh, and I don't know if you noticed, I've asked a (somehow related) question on the convergence of discrete-time Markov chain to Feller processes. I could imagine that you have at least an idea for an answer.
$endgroup$
– 0xbadf00d
Dec 6 '18 at 17:51
$begingroup$
If $g:[0,infty)tomathbb R$ is continuous and $$sigma:=infleft{tge0:|f(t)|gevarepsilonright},$$ then $|g(sigma)|=varepsilon$. Are we able to say something similar about $|Delta f(tau)|$ and $f(tau)$?
$endgroup$
– 0xbadf00d
Dec 6 '18 at 19:57
$begingroup$
@0xbadf00d Unless you tell me something about the relation of $f$, $g$ and $sigma$, $tau$ this is impossible to say...
$endgroup$
– saz
Dec 6 '18 at 19:59
$begingroup$
Sorry, $$tau:=infleft{tge0:|Delta f(t)|>varepsilonright}.$$
$endgroup$
– 0xbadf00d
Dec 6 '18 at 20:00
1
$begingroup$
@0xbadf00d Note that a Poisson process has only finitely many jumps in finite time intervals, and therefore $tau=T_1$ is the first time the process jumps (i.e. the infimum is attained at $t=T_1$). In particular $f(tau)=1$.
$endgroup$
– saz
Dec 7 '18 at 12:03
|
show 4 more comments
$begingroup$
- implies 2.:
As $|Delta f(t)| > epsilon$ we can choose $k in mathbb{N}$ such that $|Delta f(t)| geq epsilon+3/k$. Since $f$ has a finite left-hand limit at $t$, we can choose $delta_1>0$ such that
$$|f(u)-f(t-)| < frac{1}{k} quad text{for all $u in [t-delta_1,t)$}.$$
Analogously, the right-continuity yields that there exists $delta_2>0$ such that
$$|f(t)-f(v)| < frac{1}{k} quad text{for all $v in [t,t+delta_2]$}.$$
If $ell in mathbb{N}$ is a given fixed number we may assume without loss of generality that $delta := min{delta_1,delta_2} <1/(2ell)$. Choose some $s_1 in [t-delta,t) cap mathbb{Q}$ and $s_2 in [t,t+delta) cap mathbb{Q}$. Then $$|s_1-s_2| leq |s_1-t| + |t-s_2| leq 2 delta = frac{1}{ell}$$ and $$begin{align*} epsilon + frac{3}{k} leq |Delta f(t)| &leq |f(s_1)-f(t-)| + |f(t)-f(s_2)| + |f(s_1)-f(s_2)| \ &< frac{2}{k} + |f(s_1)-f(s_2)|, end{align*}$$ i.e. $$|f(s_1)-f(s_2)| > epsilon + frac{1}{k} $$
- implies 1.
Let $k in mathbb{N}$ be as in 2. and choose for any $ell in mathbb{N}$ some numbers $s_1^{(ell)}$ and $s_2^{(ell)}$ in $[T_0,T_1+1]$ such that $$|s_1^{(ell)}-s_2^{(ell)}| leq 1/ell tag{1}$$ and $$|f(s_1^{(ell)})-f(s_2^{(ell)})| > epsilon+1/k. tag{2}$$ Since the interval $[T_0,T_1+1]$ is compact we can find convergent subsequences, say $(t_1^{(ell)})$ and $(t_2^{(ell)})$, of $(s_1^{(ell)})$ and $(s_2^{(ell)})$, and it follows from $(1)$ that $$ t = lim_{ell to infty} t_1^{(ell)} = lim_{t to infty} t_2^{(ell)}.$$ By the continuity assumptions on $f$, this implies
$$f_i := lim_{ell to infty} f(t_i^{(ell)}) in {f(t),f(t-)} tag{3}$$
for $i=1,2$. On the other hand, we know from $(2)$ that
$$|f_1-f_2|> epsilon + frac{1}{k}>0, tag{4}$$
and therefore $f_1 neq f_2$. From $(3)$ we thus conclude that one of the limits equals $f(t)$ and th other limit equals $f(t-)$. Hence, by (4),
$$|Delta f(t)|= |f(t)-f(t-)| > epsilon.$$
$endgroup$
- implies 2.:
As $|Delta f(t)| > epsilon$ we can choose $k in mathbb{N}$ such that $|Delta f(t)| geq epsilon+3/k$. Since $f$ has a finite left-hand limit at $t$, we can choose $delta_1>0$ such that
$$|f(u)-f(t-)| < frac{1}{k} quad text{for all $u in [t-delta_1,t)$}.$$
Analogously, the right-continuity yields that there exists $delta_2>0$ such that
$$|f(t)-f(v)| < frac{1}{k} quad text{for all $v in [t,t+delta_2]$}.$$
If $ell in mathbb{N}$ is a given fixed number we may assume without loss of generality that $delta := min{delta_1,delta_2} <1/(2ell)$. Choose some $s_1 in [t-delta,t) cap mathbb{Q}$ and $s_2 in [t,t+delta) cap mathbb{Q}$. Then $$|s_1-s_2| leq |s_1-t| + |t-s_2| leq 2 delta = frac{1}{ell}$$ and $$begin{align*} epsilon + frac{3}{k} leq |Delta f(t)| &leq |f(s_1)-f(t-)| + |f(t)-f(s_2)| + |f(s_1)-f(s_2)| \ &< frac{2}{k} + |f(s_1)-f(s_2)|, end{align*}$$ i.e. $$|f(s_1)-f(s_2)| > epsilon + frac{1}{k} $$
- implies 1.
Let $k in mathbb{N}$ be as in 2. and choose for any $ell in mathbb{N}$ some numbers $s_1^{(ell)}$ and $s_2^{(ell)}$ in $[T_0,T_1+1]$ such that $$|s_1^{(ell)}-s_2^{(ell)}| leq 1/ell tag{1}$$ and $$|f(s_1^{(ell)})-f(s_2^{(ell)})| > epsilon+1/k. tag{2}$$ Since the interval $[T_0,T_1+1]$ is compact we can find convergent subsequences, say $(t_1^{(ell)})$ and $(t_2^{(ell)})$, of $(s_1^{(ell)})$ and $(s_2^{(ell)})$, and it follows from $(1)$ that $$ t = lim_{ell to infty} t_1^{(ell)} = lim_{t to infty} t_2^{(ell)}.$$ By the continuity assumptions on $f$, this implies
$$f_i := lim_{ell to infty} f(t_i^{(ell)}) in {f(t),f(t-)} tag{3}$$
for $i=1,2$. On the other hand, we know from $(2)$ that
$$|f_1-f_2|> epsilon + frac{1}{k}>0, tag{4}$$
and therefore $f_1 neq f_2$. From $(3)$ we thus conclude that one of the limits equals $f(t)$ and th other limit equals $f(t-)$. Hence, by (4),
$$|Delta f(t)|= |f(t)-f(t-)| > epsilon.$$
edited Dec 6 '18 at 18:36
answered Dec 6 '18 at 14:56
sazsaz
78.7k858123
78.7k858123
$begingroup$
Thank you very much for your answer. I've got a related question (even so it might not look related at a first glance). Would be great if you could help there too. Oh, and I don't know if you noticed, I've asked a (somehow related) question on the convergence of discrete-time Markov chain to Feller processes. I could imagine that you have at least an idea for an answer.
$endgroup$
– 0xbadf00d
Dec 6 '18 at 17:51
$begingroup$
If $g:[0,infty)tomathbb R$ is continuous and $$sigma:=infleft{tge0:|f(t)|gevarepsilonright},$$ then $|g(sigma)|=varepsilon$. Are we able to say something similar about $|Delta f(tau)|$ and $f(tau)$?
$endgroup$
– 0xbadf00d
Dec 6 '18 at 19:57
$begingroup$
@0xbadf00d Unless you tell me something about the relation of $f$, $g$ and $sigma$, $tau$ this is impossible to say...
$endgroup$
– saz
Dec 6 '18 at 19:59
$begingroup$
Sorry, $$tau:=infleft{tge0:|Delta f(t)|>varepsilonright}.$$
$endgroup$
– 0xbadf00d
Dec 6 '18 at 20:00
1
$begingroup$
@0xbadf00d Note that a Poisson process has only finitely many jumps in finite time intervals, and therefore $tau=T_1$ is the first time the process jumps (i.e. the infimum is attained at $t=T_1$). In particular $f(tau)=1$.
$endgroup$
– saz
Dec 7 '18 at 12:03
|
show 4 more comments
$begingroup$
Thank you very much for your answer. I've got a related question (even so it might not look related at a first glance). Would be great if you could help there too. Oh, and I don't know if you noticed, I've asked a (somehow related) question on the convergence of discrete-time Markov chain to Feller processes. I could imagine that you have at least an idea for an answer.
$endgroup$
– 0xbadf00d
Dec 6 '18 at 17:51
$begingroup$
If $g:[0,infty)tomathbb R$ is continuous and $$sigma:=infleft{tge0:|f(t)|gevarepsilonright},$$ then $|g(sigma)|=varepsilon$. Are we able to say something similar about $|Delta f(tau)|$ and $f(tau)$?
$endgroup$
– 0xbadf00d
Dec 6 '18 at 19:57
$begingroup$
@0xbadf00d Unless you tell me something about the relation of $f$, $g$ and $sigma$, $tau$ this is impossible to say...
$endgroup$
– saz
Dec 6 '18 at 19:59
$begingroup$
Sorry, $$tau:=infleft{tge0:|Delta f(t)|>varepsilonright}.$$
$endgroup$
– 0xbadf00d
Dec 6 '18 at 20:00
1
$begingroup$
@0xbadf00d Note that a Poisson process has only finitely many jumps in finite time intervals, and therefore $tau=T_1$ is the first time the process jumps (i.e. the infimum is attained at $t=T_1$). In particular $f(tau)=1$.
$endgroup$
– saz
Dec 7 '18 at 12:03
$begingroup$
Thank you very much for your answer. I've got a related question (even so it might not look related at a first glance). Would be great if you could help there too. Oh, and I don't know if you noticed, I've asked a (somehow related) question on the convergence of discrete-time Markov chain to Feller processes. I could imagine that you have at least an idea for an answer.
$endgroup$
– 0xbadf00d
Dec 6 '18 at 17:51
$begingroup$
Thank you very much for your answer. I've got a related question (even so it might not look related at a first glance). Would be great if you could help there too. Oh, and I don't know if you noticed, I've asked a (somehow related) question on the convergence of discrete-time Markov chain to Feller processes. I could imagine that you have at least an idea for an answer.
$endgroup$
– 0xbadf00d
Dec 6 '18 at 17:51
$begingroup$
If $g:[0,infty)tomathbb R$ is continuous and $$sigma:=infleft{tge0:|f(t)|gevarepsilonright},$$ then $|g(sigma)|=varepsilon$. Are we able to say something similar about $|Delta f(tau)|$ and $f(tau)$?
$endgroup$
– 0xbadf00d
Dec 6 '18 at 19:57
$begingroup$
If $g:[0,infty)tomathbb R$ is continuous and $$sigma:=infleft{tge0:|f(t)|gevarepsilonright},$$ then $|g(sigma)|=varepsilon$. Are we able to say something similar about $|Delta f(tau)|$ and $f(tau)$?
$endgroup$
– 0xbadf00d
Dec 6 '18 at 19:57
$begingroup$
@0xbadf00d Unless you tell me something about the relation of $f$, $g$ and $sigma$, $tau$ this is impossible to say...
$endgroup$
– saz
Dec 6 '18 at 19:59
$begingroup$
@0xbadf00d Unless you tell me something about the relation of $f$, $g$ and $sigma$, $tau$ this is impossible to say...
$endgroup$
– saz
Dec 6 '18 at 19:59
$begingroup$
Sorry, $$tau:=infleft{tge0:|Delta f(t)|>varepsilonright}.$$
$endgroup$
– 0xbadf00d
Dec 6 '18 at 20:00
$begingroup$
Sorry, $$tau:=infleft{tge0:|Delta f(t)|>varepsilonright}.$$
$endgroup$
– 0xbadf00d
Dec 6 '18 at 20:00
1
1
$begingroup$
@0xbadf00d Note that a Poisson process has only finitely many jumps in finite time intervals, and therefore $tau=T_1$ is the first time the process jumps (i.e. the infimum is attained at $t=T_1$). In particular $f(tau)=1$.
$endgroup$
– saz
Dec 7 '18 at 12:03
$begingroup$
@0xbadf00d Note that a Poisson process has only finitely many jumps in finite time intervals, and therefore $tau=T_1$ is the first time the process jumps (i.e. the infimum is attained at $t=T_1$). In particular $f(tau)=1$.
$endgroup$
– saz
Dec 7 '18 at 12:03
|
show 4 more comments
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%2f3028322%2fequivalent-condition-for-the-existence-of-a-t%25e2%2588%2588t-0-t-1-with-ft-lim-s%25e2%2586%2592t%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