${V_n}$ and ${W_n}$ are two sequences of random variables, show that$V_n-W_noverset{p}to0$.
$begingroup$
Let ${V_n}$ and ${W_n}$ be two sequences of random variables satisfying the following conditions.
(i) For all $delta>0$, there exists $lambda$ s.t. $P(|W_n|>lambda)<delta$.
(ii) For all $k$ and all $varepsilon>0$
$$lim_{ntoinfty}P(V_nle k,W_nge k+varepsilon)=0$$
$$lim_{ntoinfty}P(V_nge k+varepsilon ,W_nle k)=0.$$
Then $V_n-W_noverset{p}to0$,as $ntoinfty$.
How to understand and prove this proposition?
probability probability-theory measure-theory probability-distributions random-variables
$endgroup$
|
show 1 more comment
$begingroup$
Let ${V_n}$ and ${W_n}$ be two sequences of random variables satisfying the following conditions.
(i) For all $delta>0$, there exists $lambda$ s.t. $P(|W_n|>lambda)<delta$.
(ii) For all $k$ and all $varepsilon>0$
$$lim_{ntoinfty}P(V_nle k,W_nge k+varepsilon)=0$$
$$lim_{ntoinfty}P(V_nge k+varepsilon ,W_nle k)=0.$$
Then $V_n-W_noverset{p}to0$,as $ntoinfty$.
How to understand and prove this proposition?
probability probability-theory measure-theory probability-distributions random-variables
$endgroup$
1
$begingroup$
Observe that if $V_n leq k$ and $W_n geq k + varepsilon$, it follows that $W_n - V_n geq varepsilon$, so that the conditions imply that $ lim_{n to infty} P(W_n - V_n geq varepsilon) = 0$, and similarly $ lim_{n to infty} P(V_n - W_n geq varepsilon) = 0$.
$endgroup$
– Jonas
Dec 27 '18 at 5:02
$begingroup$
The observation is very helpful. But how to use condition (i). Is it a redundant condition?
$endgroup$
– J.Mike
Dec 27 '18 at 5:14
1
$begingroup$
If $V_n = W_n = infty$, then $V_n - W_n = infty - infty$ is not defined, and similarly if $V_n = W_n = - infty$. However, condition (i) implies that $lim_{lambda to infty} P(|W_n| > lambda) = 0$, so that in particular, $ P(|W_n| = infty) = 0 $. We can use this to argue rigorously that the set of values where $V_n - W_n$ is not defined is negligible, and hence does not affect the desired conclusion.
$endgroup$
– Jonas
Dec 27 '18 at 5:45
1
$begingroup$
Unless you say how $k$ is chosen the arguments in above comments are not valid.
$endgroup$
– Kavi Rama Murthy
Dec 27 '18 at 5:49
$begingroup$
Does condition (i) holds for some/all $n$?
$endgroup$
– user251257
Dec 27 '18 at 12:20
|
show 1 more comment
$begingroup$
Let ${V_n}$ and ${W_n}$ be two sequences of random variables satisfying the following conditions.
(i) For all $delta>0$, there exists $lambda$ s.t. $P(|W_n|>lambda)<delta$.
(ii) For all $k$ and all $varepsilon>0$
$$lim_{ntoinfty}P(V_nle k,W_nge k+varepsilon)=0$$
$$lim_{ntoinfty}P(V_nge k+varepsilon ,W_nle k)=0.$$
Then $V_n-W_noverset{p}to0$,as $ntoinfty$.
How to understand and prove this proposition?
probability probability-theory measure-theory probability-distributions random-variables
$endgroup$
Let ${V_n}$ and ${W_n}$ be two sequences of random variables satisfying the following conditions.
(i) For all $delta>0$, there exists $lambda$ s.t. $P(|W_n|>lambda)<delta$.
(ii) For all $k$ and all $varepsilon>0$
$$lim_{ntoinfty}P(V_nle k,W_nge k+varepsilon)=0$$
$$lim_{ntoinfty}P(V_nge k+varepsilon ,W_nle k)=0.$$
Then $V_n-W_noverset{p}to0$,as $ntoinfty$.
How to understand and prove this proposition?
probability probability-theory measure-theory probability-distributions random-variables
probability probability-theory measure-theory probability-distributions random-variables
asked Dec 27 '18 at 4:49
J.MikeJ.Mike
336110
336110
1
$begingroup$
Observe that if $V_n leq k$ and $W_n geq k + varepsilon$, it follows that $W_n - V_n geq varepsilon$, so that the conditions imply that $ lim_{n to infty} P(W_n - V_n geq varepsilon) = 0$, and similarly $ lim_{n to infty} P(V_n - W_n geq varepsilon) = 0$.
$endgroup$
– Jonas
Dec 27 '18 at 5:02
$begingroup$
The observation is very helpful. But how to use condition (i). Is it a redundant condition?
$endgroup$
– J.Mike
Dec 27 '18 at 5:14
1
$begingroup$
If $V_n = W_n = infty$, then $V_n - W_n = infty - infty$ is not defined, and similarly if $V_n = W_n = - infty$. However, condition (i) implies that $lim_{lambda to infty} P(|W_n| > lambda) = 0$, so that in particular, $ P(|W_n| = infty) = 0 $. We can use this to argue rigorously that the set of values where $V_n - W_n$ is not defined is negligible, and hence does not affect the desired conclusion.
$endgroup$
– Jonas
Dec 27 '18 at 5:45
1
$begingroup$
Unless you say how $k$ is chosen the arguments in above comments are not valid.
$endgroup$
– Kavi Rama Murthy
Dec 27 '18 at 5:49
$begingroup$
Does condition (i) holds for some/all $n$?
$endgroup$
– user251257
Dec 27 '18 at 12:20
|
show 1 more comment
1
$begingroup$
Observe that if $V_n leq k$ and $W_n geq k + varepsilon$, it follows that $W_n - V_n geq varepsilon$, so that the conditions imply that $ lim_{n to infty} P(W_n - V_n geq varepsilon) = 0$, and similarly $ lim_{n to infty} P(V_n - W_n geq varepsilon) = 0$.
$endgroup$
– Jonas
Dec 27 '18 at 5:02
$begingroup$
The observation is very helpful. But how to use condition (i). Is it a redundant condition?
$endgroup$
– J.Mike
Dec 27 '18 at 5:14
1
$begingroup$
If $V_n = W_n = infty$, then $V_n - W_n = infty - infty$ is not defined, and similarly if $V_n = W_n = - infty$. However, condition (i) implies that $lim_{lambda to infty} P(|W_n| > lambda) = 0$, so that in particular, $ P(|W_n| = infty) = 0 $. We can use this to argue rigorously that the set of values where $V_n - W_n$ is not defined is negligible, and hence does not affect the desired conclusion.
$endgroup$
– Jonas
Dec 27 '18 at 5:45
1
$begingroup$
Unless you say how $k$ is chosen the arguments in above comments are not valid.
$endgroup$
– Kavi Rama Murthy
Dec 27 '18 at 5:49
$begingroup$
Does condition (i) holds for some/all $n$?
$endgroup$
– user251257
Dec 27 '18 at 12:20
1
1
$begingroup$
Observe that if $V_n leq k$ and $W_n geq k + varepsilon$, it follows that $W_n - V_n geq varepsilon$, so that the conditions imply that $ lim_{n to infty} P(W_n - V_n geq varepsilon) = 0$, and similarly $ lim_{n to infty} P(V_n - W_n geq varepsilon) = 0$.
$endgroup$
– Jonas
Dec 27 '18 at 5:02
$begingroup$
Observe that if $V_n leq k$ and $W_n geq k + varepsilon$, it follows that $W_n - V_n geq varepsilon$, so that the conditions imply that $ lim_{n to infty} P(W_n - V_n geq varepsilon) = 0$, and similarly $ lim_{n to infty} P(V_n - W_n geq varepsilon) = 0$.
$endgroup$
– Jonas
Dec 27 '18 at 5:02
$begingroup$
The observation is very helpful. But how to use condition (i). Is it a redundant condition?
$endgroup$
– J.Mike
Dec 27 '18 at 5:14
$begingroup$
The observation is very helpful. But how to use condition (i). Is it a redundant condition?
$endgroup$
– J.Mike
Dec 27 '18 at 5:14
1
1
$begingroup$
If $V_n = W_n = infty$, then $V_n - W_n = infty - infty$ is not defined, and similarly if $V_n = W_n = - infty$. However, condition (i) implies that $lim_{lambda to infty} P(|W_n| > lambda) = 0$, so that in particular, $ P(|W_n| = infty) = 0 $. We can use this to argue rigorously that the set of values where $V_n - W_n$ is not defined is negligible, and hence does not affect the desired conclusion.
$endgroup$
– Jonas
Dec 27 '18 at 5:45
$begingroup$
If $V_n = W_n = infty$, then $V_n - W_n = infty - infty$ is not defined, and similarly if $V_n = W_n = - infty$. However, condition (i) implies that $lim_{lambda to infty} P(|W_n| > lambda) = 0$, so that in particular, $ P(|W_n| = infty) = 0 $. We can use this to argue rigorously that the set of values where $V_n - W_n$ is not defined is negligible, and hence does not affect the desired conclusion.
$endgroup$
– Jonas
Dec 27 '18 at 5:45
1
1
$begingroup$
Unless you say how $k$ is chosen the arguments in above comments are not valid.
$endgroup$
– Kavi Rama Murthy
Dec 27 '18 at 5:49
$begingroup$
Unless you say how $k$ is chosen the arguments in above comments are not valid.
$endgroup$
– Kavi Rama Murthy
Dec 27 '18 at 5:49
$begingroup$
Does condition (i) holds for some/all $n$?
$endgroup$
– user251257
Dec 27 '18 at 12:20
$begingroup$
Does condition (i) holds for some/all $n$?
$endgroup$
– user251257
Dec 27 '18 at 12:20
|
show 1 more comment
1 Answer
1
active
oldest
votes
$begingroup$
Thanks for all the comments. I find a proof in the book Order Statistics by David and Nagaraja (2003) on page 286.
Fix $varepsilon>0, delta>0$, by condtion (i) we can choose integers $m$ and $n_0$ s.t.
$$P(|W_n|>mvarepsilon)<delta,quad for~~~ nge n_0.$$
Hence
begin{align*}
P(|V_n&-W_n|>2varepsilon)<delta+P(|W_n|le mvarepsilon,|V_n-W_n|>2varepsilon)\
&=delta+sum_{j=-m}^{m-1}P(jvarepsilonle W_nle (j+1)varepsilon,|V_n-W_n|>2varepsilon)\
&ledelta+sum_{j=-m}^{m-1}Big[PBig(jvarepsilonle W_nle (j+1)varepsilon,V_n>(j+2)varepsilonBig)\
&+PBig(jvarepsilonle W_nle (j+1)varepsilon,V_n<(j-1)varepsilonBig)Big]
end{align*}
which tends to $0$ as $ntoinfty$ by condtion (ii).
$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%2f3053600%2fv-n-and-w-n-are-two-sequences-of-random-variables-show-thatv-n-w-n%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$
Thanks for all the comments. I find a proof in the book Order Statistics by David and Nagaraja (2003) on page 286.
Fix $varepsilon>0, delta>0$, by condtion (i) we can choose integers $m$ and $n_0$ s.t.
$$P(|W_n|>mvarepsilon)<delta,quad for~~~ nge n_0.$$
Hence
begin{align*}
P(|V_n&-W_n|>2varepsilon)<delta+P(|W_n|le mvarepsilon,|V_n-W_n|>2varepsilon)\
&=delta+sum_{j=-m}^{m-1}P(jvarepsilonle W_nle (j+1)varepsilon,|V_n-W_n|>2varepsilon)\
&ledelta+sum_{j=-m}^{m-1}Big[PBig(jvarepsilonle W_nle (j+1)varepsilon,V_n>(j+2)varepsilonBig)\
&+PBig(jvarepsilonle W_nle (j+1)varepsilon,V_n<(j-1)varepsilonBig)Big]
end{align*}
which tends to $0$ as $ntoinfty$ by condtion (ii).
$endgroup$
add a comment |
$begingroup$
Thanks for all the comments. I find a proof in the book Order Statistics by David and Nagaraja (2003) on page 286.
Fix $varepsilon>0, delta>0$, by condtion (i) we can choose integers $m$ and $n_0$ s.t.
$$P(|W_n|>mvarepsilon)<delta,quad for~~~ nge n_0.$$
Hence
begin{align*}
P(|V_n&-W_n|>2varepsilon)<delta+P(|W_n|le mvarepsilon,|V_n-W_n|>2varepsilon)\
&=delta+sum_{j=-m}^{m-1}P(jvarepsilonle W_nle (j+1)varepsilon,|V_n-W_n|>2varepsilon)\
&ledelta+sum_{j=-m}^{m-1}Big[PBig(jvarepsilonle W_nle (j+1)varepsilon,V_n>(j+2)varepsilonBig)\
&+PBig(jvarepsilonle W_nle (j+1)varepsilon,V_n<(j-1)varepsilonBig)Big]
end{align*}
which tends to $0$ as $ntoinfty$ by condtion (ii).
$endgroup$
add a comment |
$begingroup$
Thanks for all the comments. I find a proof in the book Order Statistics by David and Nagaraja (2003) on page 286.
Fix $varepsilon>0, delta>0$, by condtion (i) we can choose integers $m$ and $n_0$ s.t.
$$P(|W_n|>mvarepsilon)<delta,quad for~~~ nge n_0.$$
Hence
begin{align*}
P(|V_n&-W_n|>2varepsilon)<delta+P(|W_n|le mvarepsilon,|V_n-W_n|>2varepsilon)\
&=delta+sum_{j=-m}^{m-1}P(jvarepsilonle W_nle (j+1)varepsilon,|V_n-W_n|>2varepsilon)\
&ledelta+sum_{j=-m}^{m-1}Big[PBig(jvarepsilonle W_nle (j+1)varepsilon,V_n>(j+2)varepsilonBig)\
&+PBig(jvarepsilonle W_nle (j+1)varepsilon,V_n<(j-1)varepsilonBig)Big]
end{align*}
which tends to $0$ as $ntoinfty$ by condtion (ii).
$endgroup$
Thanks for all the comments. I find a proof in the book Order Statistics by David and Nagaraja (2003) on page 286.
Fix $varepsilon>0, delta>0$, by condtion (i) we can choose integers $m$ and $n_0$ s.t.
$$P(|W_n|>mvarepsilon)<delta,quad for~~~ nge n_0.$$
Hence
begin{align*}
P(|V_n&-W_n|>2varepsilon)<delta+P(|W_n|le mvarepsilon,|V_n-W_n|>2varepsilon)\
&=delta+sum_{j=-m}^{m-1}P(jvarepsilonle W_nle (j+1)varepsilon,|V_n-W_n|>2varepsilon)\
&ledelta+sum_{j=-m}^{m-1}Big[PBig(jvarepsilonle W_nle (j+1)varepsilon,V_n>(j+2)varepsilonBig)\
&+PBig(jvarepsilonle W_nle (j+1)varepsilon,V_n<(j-1)varepsilonBig)Big]
end{align*}
which tends to $0$ as $ntoinfty$ by condtion (ii).
answered Dec 27 '18 at 18:59
J.MikeJ.Mike
336110
336110
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%2f3053600%2fv-n-and-w-n-are-two-sequences-of-random-variables-show-thatv-n-w-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
1
$begingroup$
Observe that if $V_n leq k$ and $W_n geq k + varepsilon$, it follows that $W_n - V_n geq varepsilon$, so that the conditions imply that $ lim_{n to infty} P(W_n - V_n geq varepsilon) = 0$, and similarly $ lim_{n to infty} P(V_n - W_n geq varepsilon) = 0$.
$endgroup$
– Jonas
Dec 27 '18 at 5:02
$begingroup$
The observation is very helpful. But how to use condition (i). Is it a redundant condition?
$endgroup$
– J.Mike
Dec 27 '18 at 5:14
1
$begingroup$
If $V_n = W_n = infty$, then $V_n - W_n = infty - infty$ is not defined, and similarly if $V_n = W_n = - infty$. However, condition (i) implies that $lim_{lambda to infty} P(|W_n| > lambda) = 0$, so that in particular, $ P(|W_n| = infty) = 0 $. We can use this to argue rigorously that the set of values where $V_n - W_n$ is not defined is negligible, and hence does not affect the desired conclusion.
$endgroup$
– Jonas
Dec 27 '18 at 5:45
1
$begingroup$
Unless you say how $k$ is chosen the arguments in above comments are not valid.
$endgroup$
– Kavi Rama Murthy
Dec 27 '18 at 5:49
$begingroup$
Does condition (i) holds for some/all $n$?
$endgroup$
– user251257
Dec 27 '18 at 12:20