Brownian motion maximum inequality
$begingroup$
I am supposed to show this inequality for a 2 or 3 dimensional Brownian motion:
$textbf{P}^0{suplimits_{tleq k}{|B(t)|}geqfrac{1}{2}}leq 2textbf{P}^0{{|B(k)|geqfrac{1}{2}}}$
(where $textbf{P}^0$ means the BM is started in zero).
This looks a lot like Doob's maximum inequality to me, but on the RHS there is a probabilty instead of an expectation and also $|B|$ is not a martingale for d=2,3. I think you can fix the last part by just taking $ln|B|$ and $|B|^{-1}$ instead, but I don't see how to replace the expectation with a probability.
Thanks in advance!
probability brownian-motion martingales
$endgroup$
|
show 1 more comment
$begingroup$
I am supposed to show this inequality for a 2 or 3 dimensional Brownian motion:
$textbf{P}^0{suplimits_{tleq k}{|B(t)|}geqfrac{1}{2}}leq 2textbf{P}^0{{|B(k)|geqfrac{1}{2}}}$
(where $textbf{P}^0$ means the BM is started in zero).
This looks a lot like Doob's maximum inequality to me, but on the RHS there is a probabilty instead of an expectation and also $|B|$ is not a martingale for d=2,3. I think you can fix the last part by just taking $ln|B|$ and $|B|^{-1}$ instead, but I don't see how to replace the expectation with a probability.
Thanks in advance!
probability brownian-motion martingales
$endgroup$
1
$begingroup$
en.wikipedia.org/wiki/Reflection_principle_(Wiener_process)
$endgroup$
– d.k.o.
Jan 23 at 2:14
$begingroup$
Thanks! But I thought the reflection principle was only applicable to linear Brownian motion? Can I also use it for higher dimensions?
$endgroup$
– John Doe
Jan 23 at 16:55
$begingroup$
What is $|B(t)|$ for higher dimensions?
$endgroup$
– d.k.o.
Jan 23 at 23:06
$begingroup$
I am not sure what you mean ... it's of course length of the random vector with independent Brownian motions in it's entries. But I don't think $|B(t)|$ is a Brownian motion again, is it ...?
$endgroup$
– John Doe
Jan 24 at 0:08
$begingroup$
Is it $ell_2$ norm?
$endgroup$
– d.k.o.
Jan 24 at 7:52
|
show 1 more comment
$begingroup$
I am supposed to show this inequality for a 2 or 3 dimensional Brownian motion:
$textbf{P}^0{suplimits_{tleq k}{|B(t)|}geqfrac{1}{2}}leq 2textbf{P}^0{{|B(k)|geqfrac{1}{2}}}$
(where $textbf{P}^0$ means the BM is started in zero).
This looks a lot like Doob's maximum inequality to me, but on the RHS there is a probabilty instead of an expectation and also $|B|$ is not a martingale for d=2,3. I think you can fix the last part by just taking $ln|B|$ and $|B|^{-1}$ instead, but I don't see how to replace the expectation with a probability.
Thanks in advance!
probability brownian-motion martingales
$endgroup$
I am supposed to show this inequality for a 2 or 3 dimensional Brownian motion:
$textbf{P}^0{suplimits_{tleq k}{|B(t)|}geqfrac{1}{2}}leq 2textbf{P}^0{{|B(k)|geqfrac{1}{2}}}$
(where $textbf{P}^0$ means the BM is started in zero).
This looks a lot like Doob's maximum inequality to me, but on the RHS there is a probabilty instead of an expectation and also $|B|$ is not a martingale for d=2,3. I think you can fix the last part by just taking $ln|B|$ and $|B|^{-1}$ instead, but I don't see how to replace the expectation with a probability.
Thanks in advance!
probability brownian-motion martingales
probability brownian-motion martingales
asked Jan 22 at 21:43
John DoeJohn Doe
263
263
1
$begingroup$
en.wikipedia.org/wiki/Reflection_principle_(Wiener_process)
$endgroup$
– d.k.o.
Jan 23 at 2:14
$begingroup$
Thanks! But I thought the reflection principle was only applicable to linear Brownian motion? Can I also use it for higher dimensions?
$endgroup$
– John Doe
Jan 23 at 16:55
$begingroup$
What is $|B(t)|$ for higher dimensions?
$endgroup$
– d.k.o.
Jan 23 at 23:06
$begingroup$
I am not sure what you mean ... it's of course length of the random vector with independent Brownian motions in it's entries. But I don't think $|B(t)|$ is a Brownian motion again, is it ...?
$endgroup$
– John Doe
Jan 24 at 0:08
$begingroup$
Is it $ell_2$ norm?
$endgroup$
– d.k.o.
Jan 24 at 7:52
|
show 1 more comment
1
$begingroup$
en.wikipedia.org/wiki/Reflection_principle_(Wiener_process)
$endgroup$
– d.k.o.
Jan 23 at 2:14
$begingroup$
Thanks! But I thought the reflection principle was only applicable to linear Brownian motion? Can I also use it for higher dimensions?
$endgroup$
– John Doe
Jan 23 at 16:55
$begingroup$
What is $|B(t)|$ for higher dimensions?
$endgroup$
– d.k.o.
Jan 23 at 23:06
$begingroup$
I am not sure what you mean ... it's of course length of the random vector with independent Brownian motions in it's entries. But I don't think $|B(t)|$ is a Brownian motion again, is it ...?
$endgroup$
– John Doe
Jan 24 at 0:08
$begingroup$
Is it $ell_2$ norm?
$endgroup$
– d.k.o.
Jan 24 at 7:52
1
1
$begingroup$
en.wikipedia.org/wiki/Reflection_principle_(Wiener_process)
$endgroup$
– d.k.o.
Jan 23 at 2:14
$begingroup$
en.wikipedia.org/wiki/Reflection_principle_(Wiener_process)
$endgroup$
– d.k.o.
Jan 23 at 2:14
$begingroup$
Thanks! But I thought the reflection principle was only applicable to linear Brownian motion? Can I also use it for higher dimensions?
$endgroup$
– John Doe
Jan 23 at 16:55
$begingroup$
Thanks! But I thought the reflection principle was only applicable to linear Brownian motion? Can I also use it for higher dimensions?
$endgroup$
– John Doe
Jan 23 at 16:55
$begingroup$
What is $|B(t)|$ for higher dimensions?
$endgroup$
– d.k.o.
Jan 23 at 23:06
$begingroup$
What is $|B(t)|$ for higher dimensions?
$endgroup$
– d.k.o.
Jan 23 at 23:06
$begingroup$
I am not sure what you mean ... it's of course length of the random vector with independent Brownian motions in it's entries. But I don't think $|B(t)|$ is a Brownian motion again, is it ...?
$endgroup$
– John Doe
Jan 24 at 0:08
$begingroup$
I am not sure what you mean ... it's of course length of the random vector with independent Brownian motions in it's entries. But I don't think $|B(t)|$ is a Brownian motion again, is it ...?
$endgroup$
– John Doe
Jan 24 at 0:08
$begingroup$
Is it $ell_2$ norm?
$endgroup$
– d.k.o.
Jan 24 at 7:52
$begingroup$
Is it $ell_2$ norm?
$endgroup$
– d.k.o.
Jan 24 at 7:52
|
show 1 more comment
1 Answer
1
active
oldest
votes
$begingroup$
For $a>0$ let $tau_a:=inf{tge 0:|B_t|=a}$. Then
$$
mathsf{P}^0(tau_ale t)=mathsf{P}^0(tau_ale t,|B_t|ge a)+mathsf{P}^0(tau_ale t,|B_t|< a).tag{1}
$$
Using the strong Markov property (e.g. Theorem 8.3.7 on page 314 here),
begin{align}
mathsf{P}^0(tau_ale t,|B_t|< a)&=mathsf{E}^0[1{tau_ale t}mathsf{P}^0(|B_{tau_a+(t-tau_a)}|<amid mathcal{F}_{tau_a})] \
&=mathsf{E}^0[1{tau_ale t}mathsf{P}^{B_{tau_a}}(|B_{t-tau_a}|<a)]le frac{1}{2}mathsf{P}^0(tau_ale t).tag{2}
end{align}
Combining $(1)$ and $(2)$, we get
$$
mathsf{P}^0left(sup_{sle t}|B_t|ge aright)=mathsf{P}^0(tau_ale t)le 2mathsf{P}^0(|B_t|ge a).
$$
It remains to verify the last inequality in (2), i.e. for any $x$ with $|x|=a$ and $sge 0$,
$$
mathsf{P}^x(|B_s|<a)le 1/2.
$$
$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%2f3083754%2fbrownian-motion-maximum-inequality%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$
For $a>0$ let $tau_a:=inf{tge 0:|B_t|=a}$. Then
$$
mathsf{P}^0(tau_ale t)=mathsf{P}^0(tau_ale t,|B_t|ge a)+mathsf{P}^0(tau_ale t,|B_t|< a).tag{1}
$$
Using the strong Markov property (e.g. Theorem 8.3.7 on page 314 here),
begin{align}
mathsf{P}^0(tau_ale t,|B_t|< a)&=mathsf{E}^0[1{tau_ale t}mathsf{P}^0(|B_{tau_a+(t-tau_a)}|<amid mathcal{F}_{tau_a})] \
&=mathsf{E}^0[1{tau_ale t}mathsf{P}^{B_{tau_a}}(|B_{t-tau_a}|<a)]le frac{1}{2}mathsf{P}^0(tau_ale t).tag{2}
end{align}
Combining $(1)$ and $(2)$, we get
$$
mathsf{P}^0left(sup_{sle t}|B_t|ge aright)=mathsf{P}^0(tau_ale t)le 2mathsf{P}^0(|B_t|ge a).
$$
It remains to verify the last inequality in (2), i.e. for any $x$ with $|x|=a$ and $sge 0$,
$$
mathsf{P}^x(|B_s|<a)le 1/2.
$$
$endgroup$
add a comment |
$begingroup$
For $a>0$ let $tau_a:=inf{tge 0:|B_t|=a}$. Then
$$
mathsf{P}^0(tau_ale t)=mathsf{P}^0(tau_ale t,|B_t|ge a)+mathsf{P}^0(tau_ale t,|B_t|< a).tag{1}
$$
Using the strong Markov property (e.g. Theorem 8.3.7 on page 314 here),
begin{align}
mathsf{P}^0(tau_ale t,|B_t|< a)&=mathsf{E}^0[1{tau_ale t}mathsf{P}^0(|B_{tau_a+(t-tau_a)}|<amid mathcal{F}_{tau_a})] \
&=mathsf{E}^0[1{tau_ale t}mathsf{P}^{B_{tau_a}}(|B_{t-tau_a}|<a)]le frac{1}{2}mathsf{P}^0(tau_ale t).tag{2}
end{align}
Combining $(1)$ and $(2)$, we get
$$
mathsf{P}^0left(sup_{sle t}|B_t|ge aright)=mathsf{P}^0(tau_ale t)le 2mathsf{P}^0(|B_t|ge a).
$$
It remains to verify the last inequality in (2), i.e. for any $x$ with $|x|=a$ and $sge 0$,
$$
mathsf{P}^x(|B_s|<a)le 1/2.
$$
$endgroup$
add a comment |
$begingroup$
For $a>0$ let $tau_a:=inf{tge 0:|B_t|=a}$. Then
$$
mathsf{P}^0(tau_ale t)=mathsf{P}^0(tau_ale t,|B_t|ge a)+mathsf{P}^0(tau_ale t,|B_t|< a).tag{1}
$$
Using the strong Markov property (e.g. Theorem 8.3.7 on page 314 here),
begin{align}
mathsf{P}^0(tau_ale t,|B_t|< a)&=mathsf{E}^0[1{tau_ale t}mathsf{P}^0(|B_{tau_a+(t-tau_a)}|<amid mathcal{F}_{tau_a})] \
&=mathsf{E}^0[1{tau_ale t}mathsf{P}^{B_{tau_a}}(|B_{t-tau_a}|<a)]le frac{1}{2}mathsf{P}^0(tau_ale t).tag{2}
end{align}
Combining $(1)$ and $(2)$, we get
$$
mathsf{P}^0left(sup_{sle t}|B_t|ge aright)=mathsf{P}^0(tau_ale t)le 2mathsf{P}^0(|B_t|ge a).
$$
It remains to verify the last inequality in (2), i.e. for any $x$ with $|x|=a$ and $sge 0$,
$$
mathsf{P}^x(|B_s|<a)le 1/2.
$$
$endgroup$
For $a>0$ let $tau_a:=inf{tge 0:|B_t|=a}$. Then
$$
mathsf{P}^0(tau_ale t)=mathsf{P}^0(tau_ale t,|B_t|ge a)+mathsf{P}^0(tau_ale t,|B_t|< a).tag{1}
$$
Using the strong Markov property (e.g. Theorem 8.3.7 on page 314 here),
begin{align}
mathsf{P}^0(tau_ale t,|B_t|< a)&=mathsf{E}^0[1{tau_ale t}mathsf{P}^0(|B_{tau_a+(t-tau_a)}|<amid mathcal{F}_{tau_a})] \
&=mathsf{E}^0[1{tau_ale t}mathsf{P}^{B_{tau_a}}(|B_{t-tau_a}|<a)]le frac{1}{2}mathsf{P}^0(tau_ale t).tag{2}
end{align}
Combining $(1)$ and $(2)$, we get
$$
mathsf{P}^0left(sup_{sle t}|B_t|ge aright)=mathsf{P}^0(tau_ale t)le 2mathsf{P}^0(|B_t|ge a).
$$
It remains to verify the last inequality in (2), i.e. for any $x$ with $|x|=a$ and $sge 0$,
$$
mathsf{P}^x(|B_s|<a)le 1/2.
$$
answered Jan 25 at 7:40


d.k.o.d.k.o.
10.2k629
10.2k629
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%2f3083754%2fbrownian-motion-maximum-inequality%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
1
$begingroup$
en.wikipedia.org/wiki/Reflection_principle_(Wiener_process)
$endgroup$
– d.k.o.
Jan 23 at 2:14
$begingroup$
Thanks! But I thought the reflection principle was only applicable to linear Brownian motion? Can I also use it for higher dimensions?
$endgroup$
– John Doe
Jan 23 at 16:55
$begingroup$
What is $|B(t)|$ for higher dimensions?
$endgroup$
– d.k.o.
Jan 23 at 23:06
$begingroup$
I am not sure what you mean ... it's of course length of the random vector with independent Brownian motions in it's entries. But I don't think $|B(t)|$ is a Brownian motion again, is it ...?
$endgroup$
– John Doe
Jan 24 at 0:08
$begingroup$
Is it $ell_2$ norm?
$endgroup$
– d.k.o.
Jan 24 at 7:52